1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// Copyright (C) 2020-2022 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[] = {1, 2, 3, 4, 5, 5, 6, 7};
for (unsigned i = 0; i < 5; i++)
for (unsigned j = 5; j < 8; j++)
{
test_container<int, forward_iterator_wrapper> cx(x);
auto result = ranges::lower_bound(std::next(cx.begin(), i),
std::next(cx.begin(), j),
4, {}, [] (int a) { return a-1; });
VERIFY( result.ptr == x+4 );
}
ranges::reverse(x);
test_range<int, forward_iterator_wrapper> rx(x);
auto result = ranges::lower_bound(rx, 5, ranges::greater{},
[] (int a) { return a+1; });
VERIFY( result.ptr == x+4 );
}
constexpr bool
test02()
{
int x[] = {1, 2, 3, 4, 5};
return (ranges::lower_bound(x, 6) == x+5
&& ranges::lower_bound(x, x, 6) == x
&& ranges::lower_bound(x, 1) == x);
}
int
main()
{
test01();
static_assert(test02());
}
|
