diff options
Diffstat (limited to 'libcxx/test/std/algorithms')
8 files changed, 26 insertions, 26 deletions
diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ranges.remove.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ranges.remove.pass.cpp index 3192599..96387b2 100644 --- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ranges.remove.pass.cpp +++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ranges.remove.pass.cpp @@ -35,7 +35,7 @@ static_assert(!HasRemoveIt<PermutableNotForwardIterator>); static_assert(!HasRemoveIt<PermutableNotSwappable>); static_assert(!HasRemoveIt<int*, SentinelForNotSemiregular>); static_assert(!HasRemoveIt<int*, SentinelForNotWeaklyEqualityComparableWith>); -static_assert(!HasRemoveIt<int**>); // not indirect_binary_prediacte +static_assert(!HasRemoveIt<int**>); // not indirect_binary_predicate template <class Range> concept HasRemoveR = requires(Range range) { std::ranges::remove(range, 0); }; @@ -45,7 +45,7 @@ static_assert(!HasRemoveR<PermutableRangeNotForwardIterator>); static_assert(!HasRemoveR<PermutableRangeNotSwappable>); static_assert(!HasRemoveR<SentinelForNotSemiregular>); static_assert(!HasRemoveR<SentinelForNotWeaklyEqualityComparableWith>); -static_assert(!HasRemoveR<UncheckedRange<int**>>); // not indirect_binary_prediacte +static_assert(!HasRemoveR<UncheckedRange<int**>>); // not indirect_binary_predicate template <int N, int M> struct Data { diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.iterator.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.iterator.pass.cpp index 9420902..b604263 100644 --- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.iterator.pass.cpp +++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.iterator.pass.cpp @@ -19,7 +19,7 @@ // ranges::transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, // F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); -// The range overloads are tested in ranges.tranform.binary.range.pass.cpp. +// The range overloads are tested in ranges.transform.binary.range.pass.cpp. #include <algorithm> #include <array> diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.range.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.range.pass.cpp index bebe456..08ca8aa 100644 --- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.range.pass.cpp +++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.binary.range.pass.cpp @@ -18,7 +18,7 @@ // ranges::transform(R1&& r1, R2&& r2, O result, // F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); -// The iterator overloads are tested in ranges.tranform.binary.iterator.pass.cpp. +// The iterator overloads are tested in ranges.transform.binary.iterator.pass.cpp. #include <algorithm> #include <array> @@ -34,15 +34,15 @@ struct BinaryFunc { }; template <class Range> -concept HasTranformR = requires(Range r, int* out) { std::ranges::transform(r, r, out, BinaryFunc{}); }; - -static_assert(HasTranformR<std::array<int, 1>>); -static_assert(!HasTranformR<int>); -static_assert(!HasTranformR<InputRangeNotDerivedFrom>); -static_assert(!HasTranformR<InputRangeNotIndirectlyReadable>); -static_assert(!HasTranformR<InputRangeNotInputOrOutputIterator>); -static_assert(!HasTranformR<InputRangeNotSentinelSemiregular>); -static_assert(!HasTranformR<InputRangeNotSentinelEqualityComparableWith>); +concept HasTransformR = requires(Range r, int* out) { std::ranges::transform(r, r, out, BinaryFunc{}); }; + +static_assert(HasTransformR<std::array<int, 1>>); +static_assert(!HasTransformR<int>); +static_assert(!HasTransformR<InputRangeNotDerivedFrom>); +static_assert(!HasTransformR<InputRangeNotIndirectlyReadable>); +static_assert(!HasTransformR<InputRangeNotInputOrOutputIterator>); +static_assert(!HasTransformR<InputRangeNotSentinelSemiregular>); +static_assert(!HasTransformR<InputRangeNotSentinelEqualityComparableWith>); template <class It> concept HasTransformOut = requires(int* it, int* sent, It out, std::array<int, 2> range) { diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.unary.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.unary.pass.cpp index b83f9cc..eeacf83 100644 --- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.unary.pass.cpp +++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ranges.transform.unary.pass.cpp @@ -31,15 +31,15 @@ #include "almost_satisfies_types.h" template <class Range> -concept HasTranformR = requires(Range r, int* out) { std::ranges::transform(r, out, std::identity{}); }; - -static_assert(HasTranformR<std::array<int, 1>>); -static_assert(!HasTranformR<int>); -static_assert(!HasTranformR<InputRangeNotDerivedFrom>); -static_assert(!HasTranformR<InputRangeNotIndirectlyReadable>); -static_assert(!HasTranformR<InputRangeNotInputOrOutputIterator>); -static_assert(!HasTranformR<InputRangeNotSentinelSemiregular>); -static_assert(!HasTranformR<InputRangeNotSentinelEqualityComparableWith>); +concept HasTransformR = requires(Range r, int* out) { std::ranges::transform(r, out, std::identity{}); }; + +static_assert(HasTransformR<std::array<int, 1>>); +static_assert(!HasTransformR<int>); +static_assert(!HasTransformR<InputRangeNotDerivedFrom>); +static_assert(!HasTransformR<InputRangeNotIndirectlyReadable>); +static_assert(!HasTransformR<InputRangeNotInputOrOutputIterator>); +static_assert(!HasTransformR<InputRangeNotSentinelSemiregular>); +static_assert(!HasTransformR<InputRangeNotSentinelEqualityComparableWith>); template <class It, class Sent = It> concept HasTransformIt = diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp index faf597c..e28cbe2 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/equal.pass.cpp @@ -18,7 +18,7 @@ // constexpr bool // constexpr after c++17 // equal(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); -// We test the cartesian product, so we somethimes compare differently signed types +// We test the cartesian product, so we sometimes compare differently signed types // ADDITIONAL_COMPILE_FLAGS: -Wno-sign-compare #include <algorithm> diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ranges.for_each_n.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ranges.for_each_n.pass.cpp index 9641411..9138199 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ranges.for_each_n.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ranges.for_each_n.pass.cpp @@ -57,7 +57,7 @@ constexpr void test_iterator() { assert(i == 4); } - { // check that an emptry range works + { // check that an empty range works int a[] = {}; std::ranges::for_each_n(Iter(a), 0, [](auto&) { assert(false); }); } diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.partitions/ranges.is_partitioned.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.partitions/ranges.is_partitioned.pass.cpp index 9795d1e..72b58f5 100644 --- a/libcxx/test/std/algorithms/alg.sorting/alg.partitions/ranges.is_partitioned.pass.cpp +++ b/libcxx/test/std/algorithms/alg.sorting/alg.partitions/ranges.is_partitioned.pass.cpp @@ -87,7 +87,7 @@ constexpr void test_iterators() { } } - { // check that it's partitoned if the predicate is true for all elements + { // check that it's partitioned if the predicate is true for all elements { int a[] = {1, 2, 3, 4}; auto ret = std::ranges::is_partitioned(Iter(a), Sent(Iter(a + 4)), [](int) { return true; }); diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp index ed26c5b..554bd89 100644 --- a/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp +++ b/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort.pass.cpp @@ -190,7 +190,7 @@ test_pointer_sort() // test_adversarial_quicksort generates a vector with values arranged in such a // way that they would invoke O(N^2) behavior on any quick sort implementation -// that satisifies certain conditions. Details are available in the following +// that satisfies certain conditions. Details are available in the following // paper: // "A Killer Adversary for Quicksort", M. D. McIlroy, Software-Practice & // Experience Volume 29 Issue 4 April 10, 1999 pp 341-344. |