diff options
Diffstat (limited to 'libcxx/test/algorithms')
123 files changed, 369 insertions, 380 deletions
diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp index d61a4614b57..41b5ab9a8a9 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter> +// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter> // OutIter // copy(InIter first, InIter last, OutIter result); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp index 345422075c1..761502bbe3c 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<BidirectionalIterator InIter, BidirectionalIterator OutIter> -// requires OutputIterator<OutIter, InIter::reference> +// template<BidirectionalIterator InIter, BidirectionalIterator OutIter> +// requires OutputIterator<OutIter, InIter::reference> // OutIter // copy_backward(InIter first, InIter last, OutIter result); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp index ec228f5f339..83c55e39e6b 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, -// Predicate<auto, InIter::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, +// Predicate<auto, InIter::value_type> Pred> +// requires CopyConstructible<Pred> // OutIter // copy_if(InIter first, InIter last, OutIter result, Pred pred); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp index 9d8a527afaf..5d95c3378dd 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter> +// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter> // OutIter // copy_n(InIter first, InIter::difference_type n, OutIter result); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp index 41129116474..7db8009a28f 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires OutputIterator<Iter, const T&> +// template<ForwardIterator Iter, class T> +// requires OutputIterator<Iter, const T&> // void // fill(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp index a528ae598bc..095f9c7cdd0 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<class Iter, IntegralLike Size, class T> -// requires OutputIterator<Iter, const T&> +// template<class Iter, IntegralLike Size, class T> +// requires OutputIterator<Iter, const T&> // OutputIterator // fill_n(Iter first, Size n, const T& value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp index 6042af0fb40..3b009d7b72a 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter, Callable Generator> -// requires OutputIterator<Iter, Generator::result_type> -// && CopyConstructible<Generator> +// template<ForwardIterator Iter, Callable Generator> +// requires OutputIterator<Iter, Generator::result_type> +// && CopyConstructible<Generator> // void // generate(Iter first, Iter last, Generator gen); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp index 58f2862dbe8..07aee184583 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp @@ -10,8 +10,8 @@ // <algorithm> // template<class Iter, IntegralLike Size, Callable Generator> -// requires OutputIterator<Iter, Generator::result_type> -// && CopyConstructible<Generator> +// requires OutputIterator<Iter, Generator::result_type> +// && CopyConstructible<Generator> // void // generate_n(Iter first, Size n, Generator gen); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp index 38795ae94af..80c50abe498 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.move/move.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator InIter, typename OutIter> -// requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type> +// template<InputIterator InIter, typename OutIter> +// requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type> // OutIter // move(InIter first, InIter last, OutIter result); @@ -56,7 +56,7 @@ test1() assert(*ib[i] == i); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -130,5 +130,5 @@ int main() test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*, std::unique_ptr<int>*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.move/move_backward.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.move/move_backward.pass.cpp index 1291ee4d730..349f13eb7ee 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.move/move_backward.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.move/move_backward.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<BidirectionalIterator InIter, BidirectionalIterator OutIter> -// requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type> +// template<BidirectionalIterator InIter, BidirectionalIterator OutIter> +// requires OutputIterator<OutIter, RvalueOf<InIter::reference>::type> // OutIter // move_backward(InIter first, InIter last, OutIter result); @@ -56,7 +56,7 @@ test1() assert(*ib[i] == i); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -84,5 +84,5 @@ int main() test1<std::unique_ptr<int>*, bidirectional_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*, std::unique_ptr<int>*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp index 0a1c60fbd45..5bc177ddf30 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp @@ -13,7 +13,6 @@ // bool // is_partitioned(InputIterator first, InputIterator last, Predicate pred); - #include <algorithm> #include <cassert> diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/partition.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/partition.pass.cpp index 43190d01336..9e7c14b6197 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/partition.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/partition.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Pred> +// template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Pred> // Iter // partition(Iter first, Iter last, Pred pred); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/stable_partition.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/stable_partition.pass.cpp index e589e7b2f3b..bdb579ecdbb 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/stable_partition.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/stable_partition.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Pred> +// template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Pred> // Iter // stable_partition(Iter first, Iter last, Pred pred); @@ -300,7 +300,7 @@ test1() Iter r = std::stable_partition(Iter(array), Iter(array+size), is_null()); } -#endif +#endif // _LIBCPP_MOVE int main() { diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle.pass.cpp index ca4a2bdd722..76bfdbffa3f 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> // void // random_shuffle(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle_rand.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle_rand.pass.cpp index 6a17521f44f..be67adf4ccf 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle_rand.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/random_shuffle_rand.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter, Callable<auto, Iter::difference_type> Rand> -// requires ShuffleIterator<Iter> -// && Convertible<Rand::result_type, Iter::difference_type> +// template<RandomAccessIterator Iter, Callable<auto, Iter::difference_type> Rand> +// requires ShuffleIterator<Iter> +// && Convertible<Rand::result_type, Iter::difference_type> // void // random_shuffle(Iter first, Iter last, Rand&& rand); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp index 2524b33f6f1..44ef8e369ab 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> -// && HasEqualTo<Iter::value_type, T> +// template<ForwardIterator Iter, class T> +// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> +// && HasEqualTo<Iter::value_type, T> // Iter // remove(Iter first, Iter last, const T& value); @@ -63,7 +63,7 @@ test1() assert(*ia[5] == 4); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -79,5 +79,5 @@ int main() test1<random_access_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp index 71774f4ccd2..f225e0badd8 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, class T> -// requires HasEqualTo<InIter::value_type, T> +// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, class T> +// requires HasEqualTo<InIter::value_type, T> // OutIter // remove_copy(InIter first, InIter last, OutIter result, const T& value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp index 46fff383296..3b7fb610161 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, -// Predicate<auto, InIter::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator InIter, OutputIterator<auto, InIter::reference> OutIter, +// Predicate<auto, InIter::value_type> Pred> +// requires CopyConstructible<Pred> // OutIter // remove_copy_if(InIter first, InIter last, OutIter result, Pred pred); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp index e196d0336ae..df8996c23e2 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred> -// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> -// && CopyConstructible<Pred> +// template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred> +// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> +// && CopyConstructible<Pred> // Iter // remove_if(Iter first, Iter last, Pred pred); @@ -72,7 +72,7 @@ test1() assert(*ia[5] == 4); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -88,5 +88,5 @@ int main() test1<random_access_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace.pass.cpp index 031e5f94af0..ed58692e1ee 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace.pass.cpp @@ -9,10 +9,10 @@ // <algorithm> -// template<ForwardIterator Iter, class T> +// template<ForwardIterator Iter, class T> // requires OutputIterator<Iter, Iter::reference> // && OutputIterator<Iter, const T&> -// && HasEqualTo<Iter::value_type, T> +// && HasEqualTo<Iter::value_type, T> // void // replace(Iter first, Iter last, const T& old_value, const T& new_value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp index c75bbbb7355..5d4330025a7 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp @@ -9,10 +9,10 @@ // <algorithm> -// template<InputIterator InIter, typename OutIter, class T> -// requires OutputIterator<OutIter, InIter::reference> -// && OutputIterator<OutIter, const T&> -// && HasEqualTo<InIter::value_type, T> +// template<InputIterator InIter, typename OutIter, class T> +// requires OutputIterator<OutIter, InIter::reference> +// && OutputIterator<OutIter, const T&> +// && HasEqualTo<InIter::value_type, T> // OutIter // replace_copy(InIter first, InIter last, OutIter result, const T& old_value, // const T& new_value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp index 68e67978545..9a0efbda525 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter, typename OutIter, -// Predicate<auto, InIter::value_type> Pred, class T> -// requires OutputIterator<OutIter, InIter::reference> -// && OutputIterator<OutIter, const T&> -// && CopyConstructible<Pred> +// template<InputIterator InIter, typename OutIter, +// Predicate<auto, InIter::value_type> Pred, class T> +// requires OutputIterator<OutIter, InIter::reference> +// && OutputIterator<OutIter, const T&> +// && CopyConstructible<Pred> // OutIter // replace_copy_if(InIter first, InIter last, OutIter result, Pred pred, const T& new_value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_if.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_if.pass.cpp index 47a8982545a..564c1d3c1b1 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_if.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.replace/replace_if.pass.cpp @@ -9,10 +9,10 @@ // <algorithm> -// template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred, class T> -// requires OutputIterator<Iter, Iter::reference> -// && OutputIterator<Iter, const T&> -// && CopyConstructible<Pred> +// template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred, class T> +// requires OutputIterator<Iter, Iter::reference> +// && OutputIterator<Iter, const T&> +// && CopyConstructible<Pred> // void // replace_if(Iter first, Iter last, Pred pred, const T& new_value); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse.pass.cpp index 34e95634504..27f92bcc856 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<BidirectionalIterator Iter> -// requires HasSwap<Iter::reference, Iter::reference> +// template<BidirectionalIterator Iter> +// requires HasSwap<Iter::reference, Iter::reference> // void // reverse(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp index c11dacde701..be90461e072 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<BidirectionalIterator InIter, OutputIterator<auto, InIter::reference> OutIter> +// template<BidirectionalIterator InIter, OutputIterator<auto, InIter::reference> OutIter> // OutIter // reverse_copy(InIter first, InIter last, OutIter result); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate.pass.cpp index 3e61b1cef78..91164113cfd 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<ShuffleIterator Iter> +// template<ShuffleIterator Iter> // Iter // rotate(Iter first, Iter middle, Iter last); @@ -419,7 +419,7 @@ test1() assert(*ig[5] == 2); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -435,5 +435,5 @@ int main() test1<random_access_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp index 6459e9933f9..465fbd00077 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<ForwardIterator InIter, OutputIterator<auto, InIter::reference> OutIter> +// template<ForwardIterator InIter, OutputIterator<auto, InIter::reference> OutIter> // OutIter // rotate_copy(InIter first, InIter middle, InIter last, OutIter result); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.swap/iter_swap.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.swap/iter_swap.pass.cpp index eacc5dcac93..63577175131 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.swap/iter_swap.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.swap/iter_swap.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<Iterator Iter1, Iterator Iter2> -// requires HasSwap<Iter1::reference, Iter2::reference> +// template<Iterator Iter1, Iterator Iter2> +// requires HasSwap<Iter1::reference, Iter2::reference> // void // iter_swap(Iter1 a, Iter2 b); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp index f44cd91ac1a..f150d2f8d2d 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.swap/swap_ranges.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter1, ForwardIterator Iter2> -// requires HasSwap<Iter1::reference, Iter2::reference> +// template<ForwardIterator Iter1, ForwardIterator Iter2> +// requires HasSwap<Iter1::reference, Iter2::reference> // Iter2 // swap_ranges(Iter1 first1, Iter1 last1, Iter2 first2); @@ -60,7 +60,7 @@ test1() assert(*j[2] == 3); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -106,5 +106,5 @@ int main() test1<std::unique_ptr<int>*, random_access_iterator<std::unique_ptr<int>*> >(); test1<std::unique_ptr<int>*, std::unique_ptr<int>*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp index bfed398cabe..e417683b170 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, class OutIter, -// Callable<auto, const InIter1::value_type&, const InIter2::value_type&> BinaryOp> -// requires OutputIterator<OutIter, BinaryOp::result_type> && CopyConstructible<BinaryOp> +// template<InputIterator InIter1, InputIterator InIter2, class OutIter, +// Callable<auto, const InIter1::value_type&, const InIter2::value_type&> BinaryOp> +// requires OutputIterator<OutIter, BinaryOp::result_type> && CopyConstructible<BinaryOp> // OutIter // transform(InIter1 first1, InIter1 last1, InIter2 first2, OutIter result, BinaryOp binary_op); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp index 47674fffc02..91b31fb8ed9 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator InIter, class OutIter, -// Callable<auto, const InIter::value_type&> Op> -// requires OutputIterator<OutIter, Op::result_type> && CopyConstructible<Op> +// template<InputIterator InIter, class OutIter, +// Callable<auto, const InIter::value_type&> Op> +// requires OutputIterator<OutIter, Op::result_type> && CopyConstructible<Op> // OutIter // transform(InIter first, InIter last, OutIter result, Op op); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp index 8582ddb139b..f31c73ff0c3 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter> +// template<ForwardIterator Iter> // requires OutputIterator<Iter, Iter::reference> -// && EqualityComparable<Iter::value_type> +// && EqualityComparable<Iter::value_type> // Iter // unique(Iter first, Iter last); @@ -169,7 +169,7 @@ test1() assert(*ii[2] == 2); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -185,5 +185,5 @@ int main() test1<random_access_iterator<Ptr*> >(); test1<Ptr*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp index 25d061dc50a..13cf4ef9726 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter, class OutIter> -// requires OutputIterator<OutIter, RvalueOf<InIter::value_type>::type> -// && EqualityComparable<InIter::value_type> -// && HasAssign<InIter::value_type, InIter::reference> -// && Constructible<InIter::value_type, InIter::reference> +// template<InputIterator InIter, class OutIter> +// requires OutputIterator<OutIter, RvalueOf<InIter::value_type>::type> +// && EqualityComparable<InIter::value_type> +// && HasAssign<InIter::value_type, InIter::reference> +// && Constructible<InIter::value_type, InIter::reference> // OutIter // unique_copy(InIter first, InIter last, OutIter result); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy_pred.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy_pred.pass.cpp index 5acd5f4308d..873a5e8ab03 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_copy_pred.pass.cpp @@ -9,12 +9,12 @@ // <algorithm> -// template<InputIterator InIter, class OutIter, -// EquivalenceRelation<auto, InIter::value_type> Pred> -// requires OutputIterator<OutIter, RvalueOf<InIter::value_type>::type> -// && HasAssign<InIter::value_type, InIter::reference> -// && Constructible<InIter::value_type, InIter::reference> -// && CopyConstructible<Pred> +// template<InputIterator InIter, class OutIter, +// EquivalenceRelation<auto, InIter::value_type> Pred> +// requires OutputIterator<OutIter, RvalueOf<InIter::value_type>::type> +// && HasAssign<InIter::value_type, InIter::reference> +// && Constructible<InIter::value_type, InIter::reference> +// && CopyConstructible<Pred> // OutIter // unique_copy(InIter first, InIter last, OutIter result, Pred pred); diff --git a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_pred.pass.cpp b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_pred.pass.cpp index 8d456912cfd..0b921e02c75 100644 --- a/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.modifying.operations/alg.unique/unique_pred.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred> -// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> -// && CopyConstructible<Pred> +// template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred> +// requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> +// && CopyConstructible<Pred> // Iter // unique(Iter first, Iter last, Pred pred); @@ -211,7 +211,7 @@ test1() assert(count_equal::count == si-1); } -#endif +#endif // _LIBCPP_MOVE int main() { @@ -227,5 +227,5 @@ int main() test1<random_access_iterator<Ptr*> >(); test1<Ptr*>(); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp index 985d6c86ff9..ad60cc549f2 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter> -// requires EqualityComparable<Iter::value_type> +// template<ForwardIterator Iter> +// requires EqualityComparable<Iter::value_type> // Iter // adjacent_find(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp index d27ee2c63f1..751ca24a589 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred> -// requires CopyConstructible<Pred> +// template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred> +// requires CopyConstructible<Pred> // Iter // adjacent_find(Iter first, Iter last, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.count/count.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.count/count.pass.cpp index e3147539197..332a3e2cdb0 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.count/count.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.count/count.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter, class T> -// requires HasEqualTo<Iter::value_type, T> +// template<InputIterator Iter, class T> +// requires HasEqualTo<Iter::value_type, T> // Iter::difference_type // count(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.count/count_if.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.count/count_if.pass.cpp index fc02b9f8735..48ef013a97b 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.count/count_if.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.count/count_if.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred> +// requires CopyConstructible<Pred> // Iter::difference_type // count_if(Iter first, Iter last, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp index 0eb2ff59387..e36076e6fc5 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2> -// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// template<InputIterator Iter1, InputIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> // bool // equal(Iter1 first1, Iter1 last1, Iter2 first2); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp index 5f110490c02..6b856e65747 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2, -// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator Iter1, InputIterator Iter2, +// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> +// requires CopyConstructible<Pred> // bool // equal(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp index a099d96b696..0684e22e041 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter1, ForwardIterator Iter2> -// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// template<ForwardIterator Iter1, ForwardIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> // Iter1 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end_pred.pass.cpp index d0777895ea1..873930c97f0 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/find_end_pred.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter1, ForwardIterator Iter2, -// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> -// requires CopyConstructible<Pred> +// template<ForwardIterator Iter1, ForwardIterator Iter2, +// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> +// requires CopyConstructible<Pred> // Iter1 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp index 8087aba84a6..a64eb221c8a 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter1, ForwardIterator Iter2> -// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// template<InputIterator Iter1, ForwardIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> // Iter1 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of_pred.pass.cpp index f9bbf792ba7..5cd5e3bf479 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of_pred.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator Iter1, ForwardIterator Iter2, -// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator Iter1, ForwardIterator Iter2, +// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> +// requires CopyConstructible<Pred> // Iter1 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find/find.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find/find.pass.cpp index 0ef3a7be71f..6d0aa478a4e 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find/find.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find/find.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter, class T> -// requires HasEqualTo<Iter::value_type, T> +// template<InputIterator Iter, class T> +// requires HasEqualTo<Iter::value_type, T> // Iter // find(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if.pass.cpp index a0aa5289eb8..94f877ecd90 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred> +// requires CopyConstructible<Pred> // Iter // find_if(Iter first, Iter last, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if_not.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if_not.pass.cpp index 29dd03f0676..c912e4b7068 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if_not.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.find/find_if_not.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred> +// requires CopyConstructible<Pred> // Iter // find_if_not(Iter first, Iter last, Pred pred); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.foreach/test.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.foreach/test.pass.cpp index 351cccfe718..6d67a6c30be 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.foreach/test.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.foreach/test.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter, Callable<auto, Iter::reference> Function> -// requires CopyConstructible<Function> +// template<InputIterator Iter, Callable<auto, Iter::reference> Function> +// requires CopyConstructible<Function> // Function // for_each(Iter first, Iter last, Function f); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.search/search.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.search/search.pass.cpp index ba85c64287e..764d0c7765b 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.search/search.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.search/search.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter1, ForwardIterator Iter2> -// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// template<ForwardIterator Iter1, ForwardIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> // Iter1 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp index ea53bcc54fc..e35ab1e15ca 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/alg.search/search_pred.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter1, ForwardIterator Iter2> -// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// template<ForwardIterator Iter1, ForwardIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> // Iter1 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); diff --git a/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp index 2b3159b08c4..e668694c7c9 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2> -// requires HasEqualTo<Iter1::value_type, Iter2::value_type> +// template<InputIterator Iter1, InputIterator Iter2> +// requires HasEqualTo<Iter1::value_type, Iter2::value_type> // pair<Iter1, Iter2> // mismatch(Iter1 first1, Iter1 last1, Iter2 first2); diff --git a/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp index c8f2ee18224..e611935f274 100644 --- a/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp +++ b/libcxx/test/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2, -// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> -// requires CopyConstructible<Pred> +// template<InputIterator Iter1, InputIterator Iter2, +// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> +// requires CopyConstructible<Pred> // pair<Iter1, Iter2> // mismatch(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred); diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search.pass.cpp index 041e9baa8db..34d49d3e7ff 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires HasLess<T, Iter::value_type> -// && HasLess<Iter::value_type, T> +// template<ForwardIterator Iter, class T> +// requires HasLess<T, Iter::value_type> +// && HasLess<Iter::value_type, T> // bool // binary_search(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search_comp.pass.cpp index 25ca0754657..f1e89542334 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/binary_search_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter, class T, CopyConstructible Compare> -// requires Predicate<Compare, T, Iter::value_type> -// && Predicate<Compare, Iter::value_type, T> +// template<ForwardIterator Iter, class T, CopyConstructible Compare> +// requires Predicate<Compare, T, Iter::value_type> +// && Predicate<Compare, Iter::value_type, T> // bool // binary_search(Iter first, Iter last, const T& value, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range.pass.cpp index 0a91406b7ff..247039a5cd7 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range.pass.cpp @@ -9,10 +9,10 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires HasLess<T, Iter::value_type> -// && HasLess<Iter::value_type, T> -// pair<Iter, Iter> +// template<ForwardIterator Iter, class T> +// requires HasLess<T, Iter::value_type> +// && HasLess<Iter::value_type, T> +// pair<Iter, Iter> // equal_range(Iter first, Iter last, const T& value); #include <algorithm> diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp.pass.cpp index 6b910cc726b..38254b5eb9a 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp.pass.cpp @@ -9,10 +9,10 @@ // <algorithm> -// template<ForwardIterator Iter, class T, CopyConstructible Compare> -// requires Predicate<Compare, T, Iter::value_type> -// && Predicate<Compare, Iter::value_type, T> -// pair<Iter, Iter> +// template<ForwardIterator Iter, class T, CopyConstructible Compare> +// requires Predicate<Compare, T, Iter::value_type> +// && Predicate<Compare, Iter::value_type, T> +// pair<Iter, Iter> // equal_range(Iter first, Iter last, const T& value, Compare comp); #include <algorithm> diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound.pass.cpp index 0f727c5f028..84090e81f60 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires HasLess<Iter::value_type, T> +// template<ForwardIterator Iter, class T> +// requires HasLess<Iter::value_type, T> // Iter // lower_bound(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp.pass.cpp index a7a307a9584..0674da804ee 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires HasLess<Iter::value_type, T> +// template<ForwardIterator Iter, class T> +// requires HasLess<Iter::value_type, T> // Iter // lower_bound(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound.pass.cpp index 8d5b0550ddf..c80e4528f1b 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, class T> -// requires HasLess<T, Iter::value_type> +// template<ForwardIterator Iter, class T> +// requires HasLess<T, Iter::value_type> // Iter // upper_bound(Iter first, Iter last, const T& value); diff --git a/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp.pass.cpp index d5325d6c81f..b57928c0ef2 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // Iter // upper_bound(Iter first, Iter last, const T& value, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp index 776111437bb..0e7a19cb890 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires LessThanComparable<Iter::value_type> // bool // is_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test() { int i1[] = {0, 0}; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp index a6719840900..631d7a8f616 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires LessThanComparable<Iter::value_type> // bool // is_heap(Iter first, Iter last); @@ -18,7 +18,6 @@ #include <functional> #include <cassert> - void test() { int i1[] = {0, 0}; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp index 4807b1faf23..1908d70c4e7 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp @@ -17,7 +17,6 @@ #include <algorithm> #include <cassert> - void test() { int i1[] = {0, 0}; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp index 42d31913ea3..960d60eff7f 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // Iter // is_heap_until(Iter first, Iter last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp index 9a4b84fefcd..611583a15aa 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> // void // make_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp index d8dbdfbda47..70b1b81549e 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> && CopyConstructible<Compare> // void // make_heap(Iter first, Iter last, Compare comp); @@ -27,7 +27,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -60,5 +60,5 @@ int main() assert(std::is_heap(ia, ia+N, indirect_less())); delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp index 849be36bb10..96e6a648e6f 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> // void // pop_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp index 9c06650992a..cc093a54083 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> && CopyConstructible<Compare> // void // pop_heap(Iter first, Iter last, Compare comp); @@ -27,7 +27,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -64,5 +64,5 @@ int main() } delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp index fe9876b8b47..5e845aa9d87 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp @@ -9,16 +9,15 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // push_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp index e60f077a26a..87126298bf9 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // push_heap(Iter first, Iter last); @@ -28,7 +28,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -62,5 +62,5 @@ int main() } delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp index 2e91333754c..303c8b04685 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> // void // sort_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp index 882a6247496..8cac3b6cdc7 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> && CopyConstructible<Compare> // void // sort_heap(Iter first, Iter last, Compare comp); @@ -27,7 +27,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -62,5 +62,5 @@ int main() assert(std::is_sorted(ia, ia+N, indirect_less())); delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare.pass.cpp index 30c654dfed2..544e80779bc 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2> -// requires HasLess<Iter1::value_type, Iter2::value_type> -// && HasLess<Iter2::value_type, Iter1::value_type> +// template<InputIterator Iter1, InputIterator Iter2> +// requires HasLess<Iter1::value_type, Iter2::value_type> +// && HasLess<Iter2::value_type, Iter1::value_type> // bool // lexicographical_compare(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); diff --git a/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare_comp.pass.cpp index bcc0d23179d..e9448e5b958 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/lexicographical_compare_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2, CopyConstructible Compare> -// requires Predicate<Compare, Iter1::value_type, Iter2::value_type> -// && Predicate<Compare, Iter2::value_type, Iter1::value_type> +// template<InputIterator Iter1, InputIterator Iter2, CopyConstructible Compare> +// requires Predicate<Compare, Iter1::value_type, Iter2::value_type> +// && Predicate<Compare, Iter2::value_type, Iter1::value_type> // bool // lexicographical_compare(Iter1 first1, Iter1 last1, // Iter2 first2, Iter2 last2, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge.pass.cpp index 94ce4a21119..4703e6077df 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<BidirectionalIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // inplace_merge(Iter first, Iter middle, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge_comp.pass.cpp index b222bbaaf5b..56f46287bc6 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.merge/inplace_merge_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // void // inplace_merge(Iter first, Iter middle, Iter last, Compare comp); @@ -28,7 +28,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE #include "../../iterators.h" @@ -108,5 +108,5 @@ int main() } delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.merge/merge.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.merge/merge.pass.cpp index c811aca40c1..79d3d79b684 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.merge/merge.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.merge/merge.pass.cpp @@ -9,10 +9,10 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && HasLess<InIter2::value_type, InIter1::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && HasLess<InIter2::value_type, InIter1::value_type> // OutIter // merge(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, OutIter result); diff --git a/libcxx/test/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp index ecd044293e0..d3a3c2d6457 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter, -// Predicate<auto, InIter2::value_type, InIter1::value_type> Compare> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter, +// Predicate<auto, InIter2::value_type, InIter1::value_type> Compare> // requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && CopyConstructible<Compare> +// && OutputIterator<OutIter, InIter2::reference> +// && CopyConstructible<Compare> // OutIter // merge(InIter1 first1, InIter1 last1, // InIter2 first2, InIter2 last2, OutIter result, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_comp.pass.cpp index 885382d8dea..15285efd514 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<class T, StrictWeakOrder<auto, T> Compare> -// requires !SameType<T, Compare> && CopyConstructible<Compare> +// template<class T, StrictWeakOrder<auto, T> Compare> +// requires !SameType<T, Compare> && CopyConstructible<Compare> // const T& // max(const T& a, const T& b, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element.pass.cpp index 444fd56505b..427e5e35364 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<ForwardIterator Iter> +// requires LessThanComparable<Iter::value_type> // Iter // max_element(Iter first, Iter last); @@ -41,7 +41,7 @@ test(unsigned N) for (int i = 0; i < N; ++i) a[i] = i; std::random_shuffle(a, a+N); - test(Iter(a), Iter(a+N)); + test(Iter(a), Iter(a+N)); delete [] a; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element_comp.pass.cpp index f50fa71e23f..5d186119672 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_element_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // Iter // max_element(Iter first, Iter last, Compare comp); @@ -42,7 +42,7 @@ test(unsigned N) for (int i = 0; i < N; ++i) a[i] = i; std::random_shuffle(a, a+N); - test(Iter(a), Iter(a+N)); + test(Iter(a), Iter(a+N)); delete [] a; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list.pass.cpp index 124ca61be9a..d79ddde58b5 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template <class T> +// template <class T> // T // max(initializer_list<T> t); @@ -31,5 +31,5 @@ int main() assert(i == 3); i = std::max({1, 3, 2}); assert(i == 3); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list_comp.pass.cpp index 8c78fbdb6f1..c31a9f8dcc7 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/max_init_list_comp.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<class T, class Compare> +// template<class T, class Compare> // T // max(initializer_list<T> t, Compare comp); @@ -32,5 +32,5 @@ int main() assert(i == 1); i = std::max({1, 3, 2}, std::greater<int>()); assert(i == 1); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_comp.pass.cpp index d88c21d5687..7decb025fbf 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<class T, StrictWeakOrder<auto, T> Compare> -// requires !SameType<T, Compare> && CopyConstructible<Compare> +// template<class T, StrictWeakOrder<auto, T> Compare> +// requires !SameType<T, Compare> && CopyConstructible<Compare> // const T& // min(const T& a, const T& b, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element.pass.cpp index 67eafad2450..bb1bdf6e5dd 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<ForwardIterator Iter> +// requires LessThanComparable<Iter::value_type> // Iter // min_element(Iter first, Iter last); @@ -41,7 +41,7 @@ test(unsigned N) for (int i = 0; i < N; ++i) a[i] = i; std::random_shuffle(a, a+N); - test(Iter(a), Iter(a+N)); + test(Iter(a), Iter(a+N)); delete [] a; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element_comp.pass.cpp index f0291fff7f0..529cf5449a3 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_element_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // Iter // min_element(Iter first, Iter last, Compare comp); @@ -42,7 +42,7 @@ test(unsigned N) for (int i = 0; i < N; ++i) a[i] = i; std::random_shuffle(a, a+N); - test(Iter(a), Iter(a+N)); + test(Iter(a), Iter(a+N)); delete [] a; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list.pass.cpp index bb19d4fdf99..62c42064e7d 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<class T> +// template<class T> // T // min(initializer_list<T> t); @@ -31,5 +31,5 @@ int main() assert(i == 1); i = std::min({1, 3, 2}); assert(i == 1); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list_comp.pass.cpp index 161d68207c6..2b9499ba8c0 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/min_init_list_comp.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<class T, class Compare> +// template<class T, class Compare> // T // min(initializer_list<T> t, Compare comp); @@ -32,5 +32,5 @@ int main() assert(i == 3); i = std::min({1, 3, 2}, std::greater<int>()); assert(i == 3); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_comp.pass.cpp index 83fa53c8f1c..91fb16de93b 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<class T, StrictWeakOrder<auto, T> Compare> -// requires !SameType<T, Compare> && CopyConstructible<Compare> +// template<class T, StrictWeakOrder<auto, T> Compare> +// requires !SameType<T, Compare> && CopyConstructible<Compare> // pair<const T&, const T&> // minmax(const T& a, const T& b, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp index eda36f9537f..2eb99c3fecc 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<ForwardIterator Iter> -// requires LessThanComparable<Iter::value_type> -// pair<Iter, Iter> +// template<ForwardIterator Iter> +// requires LessThanComparable<Iter::value_type> +// pair<Iter, Iter> // minmax_element(Iter first, Iter last); #include <algorithm> @@ -47,7 +47,7 @@ test(unsigned N) for (int i = 0; i < N; ++i) a[i] = i; std::random_shuffle(a, a+N); - test(Iter(a), Iter(a+N)); + test(Iter(a), Iter(a+N)); delete [] a; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element_comp.pass.cpp index 482126eeddf..427b8d54a00 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_element_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // pair<Iter, Iter> // minmax_element(Iter first, Iter last, Compare comp); @@ -50,7 +50,7 @@ test(unsigned N) for (int i = 0; i < N; ++i) a[i] = i; std::random_shuffle(a, a+N); - test(Iter(a), Iter(a+N)); + test(Iter(a), Iter(a+N)); delete [] a; } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list.pass.cpp index 0dbb2117228..cf028de1fe5 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<class T> +// template<class T> // pair<T, T> // minmax(initializer_list<T> t); @@ -25,5 +25,5 @@ int main() assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list_comp.pass.cpp index 4f3d1441402..d233c25258b 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_init_list_comp.pass.cpp @@ -9,7 +9,7 @@ // <algorithm> -// template<class T, class Compare> +// template<class T, class Compare> // pair<T, T> // minmax(initializer_list<T> t, Compare comp); @@ -26,5 +26,5 @@ int main() assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp index ea46195b4e2..61d8d2ae35a 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // nth_element(Iter first, Iter nth, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp index b4d60502ed9..5e89a03fe15 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.nth.element/nth_element_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // void // nth_element(Iter first, Iter nth, Iter last, Compare comp); @@ -29,7 +29,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test_one(unsigned N, unsigned M) @@ -81,5 +81,5 @@ int main() std::nth_element(v.begin(), v.begin() + v.size()/2, v.end(), indirect_less()); assert(*v[v.size()/2] == v.size()/2); } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation.pass.cpp index e4697557900..9ffef4165df 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter> +// template<BidirectionalIterator Iter> // requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// && LessThanComparable<Iter::value_type> // bool // next_permutation(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation_comp.pass.cpp index 842b9b8e727..0924697e3b0 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/next_permutation_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // bool // next_permutation(Iter first, Iter last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation.pass.cpp index c469316a897..c6e536e03b8 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<BidirectionalIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // bool // prev_permutation(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation_comp.pass.cpp index 6a96fdb9565..7ac286492ae 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/prev_permutation_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // bool // prev_permutation(Iter first, Iter last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp index 665ba51fa51..13f02213797 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2> -// requires HasLess<Iter1::value_type, Iter2::value_type> +// template<InputIterator Iter1, InputIterator Iter2> +// requires HasLess<Iter1::value_type, Iter2::value_type> // && HasLess<Iter2::value_type, Iter1::value_type> // bool // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); @@ -41,7 +41,6 @@ test() assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb))); assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa))); - assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2))); assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2))); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp index ccdb04d878d..75181ab3d79 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<InputIterator Iter1, InputIterator Iter2, typename Compare> -// requires Predicate<Compare, Iter1::value_type, Iter2::value_type> -// && Predicate<Compare, Iter2::value_type, Iter1::value_type> +// template<InputIterator Iter1, InputIterator Iter2, typename Compare> +// requires Predicate<Compare, Iter1::value_type, Iter2::value_type> +// && Predicate<Compare, Iter2::value_type, Iter1::value_type> // bool // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Compare comp); @@ -42,7 +42,6 @@ test() assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>())); assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>())); - assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>())); assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>())); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference.pass.cpp index 03628b22135..ef4473c0d63 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && HasLess<InIter2::value_type, InIter1::value_type> -// && HasLess<InIter1::value_type, InIter2::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && HasLess<InIter2::value_type, InIter1::value_type> +// && HasLess<InIter1::value_type, InIter2::value_type> // OutIter // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, // OutIter result); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference_comp.pass.cpp index 65e3cd6611b..f6e8d2c6b92 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/set_difference_comp.pass.cpp @@ -9,12 +9,12 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter, -// CopyConstructible Compare> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && Predicate<Compare, InIter1::value_type, InIter2::value_type> -// && Predicate<Compare, InIter2::value_type, InIter1::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter, +// CopyConstructible Compare> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && Predicate<Compare, InIter1::value_type, InIter2::value_type> +// && Predicate<Compare, InIter2::value_type, InIter1::value_type> // OutIter // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, // OutIter result, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp index e832215942f..6b3ede5ac03 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && HasLess<InIter2::value_type, InIter1::value_type> -// && HasLess<InIter1::value_type, InIter2::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && HasLess<InIter2::value_type, InIter1::value_type> +// && HasLess<InIter1::value_type, InIter2::value_type> // OutIter // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, // OutIter result); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp index 64aaf19d101..6b6c391fcda 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp @@ -9,12 +9,12 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter, -// CopyConstructible Compare> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && Predicate<Compare, InIter1::value_type, InIter2::value_type> -// && Predicate<Compare, InIter2::value_type, InIter1::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter, +// CopyConstructible Compare> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && Predicate<Compare, InIter1::value_type, InIter2::value_type> +// && Predicate<Compare, InIter2::value_type, InIter1::value_type> // OutIter // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, // OutIter result, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference.pass.cpp index b7e30f4eb63..d1491c368ff 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && HasLess<InIter2::value_type, InIter1::value_type> -// && HasLess<InIter1::value_type, InIter2::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && HasLess<InIter2::value_type, InIter1::value_type> +// && HasLess<InIter1::value_type, InIter2::value_type> // OutIter // set_symmetric_difference(InIter1 first1, InIter1 last1, // InIter2 first2, InIter2 last2, diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference_comp.pass.cpp index b4614ba1f05..35a26c69e35 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/set_symmetric_difference_comp.pass.cpp @@ -10,14 +10,14 @@ // <algorithm> // template<InputIterator InIter1, InputIterator InIter2, typename OutIter, -// CopyConstructible Compare> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && Predicate<Compare, InIter1::value_type, InIter2::value_type> -// && Predicate<Compare, InIter2::value_type, InIter1::value_type> +// CopyConstructible Compare> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && Predicate<Compare, InIter1::value_type, InIter2::value_type> +// && Predicate<Compare, InIter2::value_type, InIter1::value_type> // OutIter // set_symmetric_difference(InIter1 first1, InIter1 last1, -// InIter2 first2, InIter2 last2, +// InIter2 first2, InIter2 last2, // OutIter result, Compare comp); #include <algorithm> diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union.pass.cpp index 669f05d3c86..76dfed18338 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && HasLess<InIter2::value_type, InIter1::value_type> -// && HasLess<InIter1::value_type, InIter2::value_type> +// template<InputIterator InIter1, InputIterator InIter2, typename OutIter> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && HasLess<InIter2::value_type, InIter1::value_type> +// && HasLess<InIter1::value_type, InIter2::value_type> // OutIter // set_union(InIter1 first1, InIter1 last1, // InIter2 first2, InIter2 last2, OutIter result); diff --git a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union_comp.pass.cpp index ff61b7e207c..0fbb43ad0c1 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/set_union_comp.pass.cpp @@ -10,11 +10,11 @@ // <algorithm> // template<InputIterator InIter1, InputIterator InIter2, typename OutIter, -// CopyConstructible Compare> -// requires OutputIterator<OutIter, InIter1::reference> -// && OutputIterator<OutIter, InIter2::reference> -// && Predicate<Compare, InIter1::value_type, InIter2::value_type> -// && Predicate<Compare, InIter2::value_type, InIter1::value_type> +// CopyConstructible Compare> +// requires OutputIterator<OutIter, InIter1::reference> +// && OutputIterator<OutIter, InIter2::reference> +// && Predicate<Compare, InIter1::value_type, InIter2::value_type> +// && Predicate<Compare, InIter2::value_type, InIter1::value_type> // OutIter // set_union(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, // OutIter result, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted.pass.cpp index efdd51bcf97..167a9c627b4 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<ForwardIterator Iter> +// requires LessThanComparable<Iter::value_type> // bool // is_sorted(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp index 3251aebffda..4c39fa50634 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // bool // is_sorted(Iter first, Iter last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until.pass.cpp index 63b904a8b7c..33a894dfb91 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<ForwardIterator Iter> +// requires LessThanComparable<Iter::value_type> // Iter // is_sorted_until(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp.pass.cpp index 84894904baa..0fdf2b84e33 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // Iter // is_sorted_until(Iter first, Iter last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy.pass.cpp index 03eda68b4a9..bdfb1c03d67 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy.pass.cpp @@ -9,11 +9,11 @@ // <algorithm> -// template<InputIterator InIter, RandomAccessIterator RAIter> -// requires ShuffleIterator<RAIter> -// && OutputIterator<RAIter, InIter::reference> -// && HasLess<InIter::value_type, RAIter::value_type> -// && LessThanComparable<RAIter::value_type> +// template<InputIterator InIter, RandomAccessIterator RAIter> +// requires ShuffleIterator<RAIter> +// && OutputIterator<RAIter, InIter::reference> +// && HasLess<InIter::value_type, RAIter::value_type> +// && LessThanComparable<RAIter::value_type> // RAIter // partial_sort_copy(InIter first, InIter last, RAIter result_first, RAIter result_last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy_comp.pass.cpp index 1ffcf5429f5..95058663762 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/partial_sort_copy_comp.pass.cpp @@ -9,12 +9,12 @@ // <algorithm> -// template<InputIterator InIter, RandomAccessIterator RAIter, class Compare> -// requires ShuffleIterator<RAIter> -// && OutputIterator<RAIter, InIter::reference> -// && Predicate<Compare, InIter::value_type, RAIter::value_type> -// && StrictWeakOrder<Compare, RAIter::value_type>} -// && CopyConstructible<Compare> +// template<InputIterator InIter, RandomAccessIterator RAIter, class Compare> +// requires ShuffleIterator<RAIter> +// && OutputIterator<RAIter, InIter::reference> +// && Predicate<Compare, InIter::value_type, RAIter::value_type> +// && StrictWeakOrder<Compare, RAIter::value_type>} +// && CopyConstructible<Compare> // RAIter // partial_sort_copy(InIter first, InIter last, // RAIter result_first, RAIter result_last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort.pass.cpp index 8773ee5a79a..74d06bb0495 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // partial_sort(Iter first, Iter middle, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort_comp.pass.cpp index e54bfe4caa7..d9e8e5f9699 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort/partial_sort_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // void // partial_sort(Iter first, Iter middle, Iter last, Compare comp); @@ -29,7 +29,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test_larger_sorts(unsigned N, unsigned M) @@ -83,5 +83,5 @@ int main() for (int i = 0; i < v.size()/2; ++i) assert(*v[i] == i); } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp index e60d09fae55..a21f173fa35 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // sort(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort_comp.pass.cpp index 2c9f63fffa9..46f1abbbdc1 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/sort/sort_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // void // sort(Iter first, Iter last, Compare comp); @@ -29,8 +29,7 @@ struct indirect_less {return *x < *y;} }; -#endif - +#endif // _LIBCPP_MOVE int main() { @@ -54,5 +53,5 @@ int main() assert(*v[1] == 1); assert(*v[2] == 2); } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort.pass.cpp index 652bdc1e9e0..ce01122651d 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // stable_sort(Iter first, Iter last); diff --git a/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort_comp.pass.cpp index 89b807b053c..6b57c2d4b90 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/stable_sort_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> -// && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> +// && CopyConstructible<Compare> // void // stable_sort(Iter first, Iter last, Compare comp); @@ -29,7 +29,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE struct first_only { @@ -79,5 +79,5 @@ int main() assert(*v[1] == 1); assert(*v[2] == 2); } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/iterators.h b/libcxx/test/algorithms/iterators.h index 01b0e336be6..539a9a49848 100644 --- a/libcxx/test/algorithms/iterators.h +++ b/libcxx/test/algorithms/iterators.h @@ -311,4 +311,4 @@ base(Iter i) return i; } -#endif +#endif // ITERATORS_H |
