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
|
// Copyright (C) 2005-2016 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/>.
// 25.1.3 [lib.alg.find.end]
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_container;
using __gnu_test::forward_iterator_wrapper;
typedef test_container<int, forward_iterator_wrapper> Container;
using std::find_end;
void
test1()
{
int array[] = {0};
Container con1(array, array);
Container con2(array, array + 1);
VERIFY(find_end(con1.begin(), con1.end(), con1.begin(), con1.end()).ptr == array);
VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array);
VERIFY(find_end(con2.begin(), con2.end(), con1.begin(), con1.end()).ptr == array + 1);
}
void
test2()
{
int array1[] = {2, 2, 1, 2, 2, 1};
int array2[] = {2, 2};
Container con1(array1, array1 + 6);
Container con2(array2, array2 + 2);
VERIFY(find_end(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array1 + 3);
}
int main()
{
test1();
test2();
}
|
