diff options
Diffstat (limited to 'test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp')
-rw-r--r-- | test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp | 184 |
1 files changed, 184 insertions, 0 deletions
diff --git a/test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp b/test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp new file mode 100644 index 000000000000..d5a34e2f2cb3 --- /dev/null +++ b/test/std/algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp.pass.cpp @@ -0,0 +1,184 @@ +//===----------------------------------------------------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is dual licensed under the MIT and the University of Illinois Open +// Source Licenses. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +// <algorithm> + +// template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> +// bool +// is_sorted(Iter first, Iter last, Compare comp); + +#include <algorithm> +#include <functional> +#include <cassert> + +#include "test_iterators.h" + +template <class Iter> +void +test() +{ + { + int a[] = {0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a))); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + + { + int a[] = {0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + + { + int a[] = {0, 0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + + { + int a[] = {0, 0, 0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 0, 0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 0, 1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 0, 1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1, 0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1, 0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1, 1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {0, 1, 1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0, 0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0, 0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0, 1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 0, 1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1, 0, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1, 0, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1, 1, 0}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } + { + int a[] = {1, 1, 1, 1}; + unsigned sa = sizeof(a) / sizeof(a[0]); + assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); + } +} + +int main() +{ + test<forward_iterator<const int*> >(); + test<bidirectional_iterator<const int*> >(); + test<random_access_iterator<const int*> >(); + test<const int*>(); +} |