blob: b0d34e0d8e41f3fa48b5f9cb966c91b896379fe6 (
plain)
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
|
// Copyright (C) 2005, 2009 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.5 [lib.alg.adjacent_find]
// { dg-do compile }
#include <algorithm>
#include <testsuite_iterators.h>
using __gnu_test::forward_iterator_wrapper;
struct S { };
bool operator==(const S&, const S&) {return true;}
struct X { };
bool predicate(const X&, const X&) {return true;}
forward_iterator_wrapper<S>
test1(forward_iterator_wrapper<S>& s)
{ return std::adjacent_find(s, s); }
forward_iterator_wrapper<X>
test2(forward_iterator_wrapper<X>& x)
{ return std::adjacent_find(x, x, predicate); }
|