aboutsummaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite/25_algorithms/lower_bound/debug/irreflexive.cc
blob: 1554df0d97f6b43f2a6d24e284709ad61bfa8ffd (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
42
43
44
45
46
47
// Copyright (C) 2015-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/>.
//
// { dg-require-debug-mode "" }
// { dg-do compile }

#include <algorithm>

struct A
{
  A(int i) : _i(i)
  { }

  int _i;
};

// Only knowns how to compare an A with an int.
struct A_int_comparer
{
  bool
  operator()(A a, int i) const
  { return a._i < i; }

  bool
  operator()(int i, A a) const
  { return i < a._i; }
};

void test01()
{
  A as[] = { 0, 1, 2, 3 };
  std::lower_bound(as, as + 4, 1, A_int_comparer());
}