blob: bc32334831300ed5e64106476df68952e4e7b346 [file] [log] [blame]
// Copyright (C) 2020-2021 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-options "-std=gnu++2a" }
// { dg-do run { target c++2a } }
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_container;
using __gnu_test::test_range;
using __gnu_test::forward_iterator_wrapper;
namespace ranges = std::ranges;
void
test01()
{
int x[] = {3,4,5,1};
test_container<int, forward_iterator_wrapper> cx(x);
VERIFY( ranges::is_sorted_until(cx.begin(),
ranges::next(cx.begin(), 3))
== ranges::next(cx.begin(), 3) );
VERIFY( ranges::is_sorted_until(cx) == ranges::next(cx.begin(), 3) );
VERIFY( ranges::is_sorted_until(cx, ranges::greater{})
== ranges::next(cx.begin(), 1) );
VERIFY( ranges::is_sorted_until(cx, {}, [] (int a) { return 0; })
== cx.end() );
}
void
test02()
{
int x[] = {1,2,3,4,5};
test_range<int, forward_iterator_wrapper> rx(x);
VERIFY( ranges::is_sorted_until(rx) == ranges::end(rx) );
VERIFY( ranges::is_sorted_until(ranges::begin(rx),
ranges::next(ranges::begin(rx), 2),
ranges::greater{})
== ranges::next(ranges::begin(rx), 1) );
}
constexpr bool
test03()
{
int x[] = { 1,2 };
return (ranges::is_sorted_until(x) == x+2
&& ranges::is_sorted_until(x, x) == x );
}
int
main()
{
test01();
test02();
static_assert(test03());
}