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
67
68
69
70
|
// 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-options "-std=gnu++11" }
// { dg-require-debug-mode "" }
// { dg-do run { xfail *-*-* } }
#include <algorithm>
#include <testsuite_hooks.h>
struct A
{
A(int i) : _i(i)
{ }
int _i;
};
bool
operator<(A a, int i)
{ return a._i < i; }
bool
operator<(int i, A a)
{ return i < a._i; }
void test01()
{
bool test __attribute__((unused)) = true;
A as[] { 0, 1, 2, 3 };
int is[] { 0, 1, 2, 3 };
VERIFY( !std::lexicographical_compare(as, as + 4, is, is + 4) );
}
bool
bad_lower(int lhs, int rhs)
{
if (lhs == 0)
return true;
return lhs < rhs;
}
void test02()
{
int is[] { 0, 1, 2, 3 };
std::lexicographical_compare(is, is + 4, is, is + 4, bad_lower);
}
int main()
{
test01();
test02();
return 0;
}
|
