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
71
72
73
74
75
76
77
78
79
80
81
82
|
// 2001-12-28 Phil Edwards <pme@gcc.gnu.org>
//
// Copyright (C) 2001-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/>.
// Concept checking must remain sane.
// { dg-options "-D_GLIBCXX_CONCEPT_CHECKS" }
#include <vector>
#include <string>
#include <algorithm>
#include <testsuite_hooks.h>
using namespace std;
// PR libstdc++/2054 and follow-up discussion
struct indirectCompare
{
indirectCompare(const vector<string>& v) : V(v) {}
bool operator()( int x, int y) const
{
return V[x] < V[y];
}
bool operator()( int x, const string& a) const
{
return V[x] < a;
}
bool operator()( const string& a, int x) const
{
return V[x] < a;
}
const vector<string>& V;
};
void
test2054( )
{
const int Maxi = 1022;
vector<string> Words(Maxi);
vector<int> Index(Maxi);
for(size_t i = 0; i < Index.size(); i++)
Index[i] = i;
indirectCompare aComparison(Words);
sort(Index.begin(), Index.end(), aComparison);
string SearchTerm;
lower_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
upper_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
equal_range(Index.begin(), Index.end(), SearchTerm, aComparison);
binary_search(Index.begin(), Index.end(), SearchTerm, aComparison);
}
int main()
{
test2054();
return 0;
}
|
