]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/testsuite/ext/concept_checks.cc
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / ext / concept_checks.cc
CommitLineData
be399691
PE
1// 2001-12-28 Phil Edwards <pme@gcc.gnu.org>
2//
99dee823 3// Copyright (C) 2001-2021 Free Software Foundation, Inc.
be399691
PE
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
748086b7 8// Free Software Foundation; either version 3, or (at your option)
be399691
PE
9// any later version.
10//
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15//
16// You should have received a copy of the GNU General Public License along
748086b7
JJ
17// with this library; see the file COPYING3. If not see
18// <http://www.gnu.org/licenses/>.
be399691
PE
19
20// Concept checking must remain sane.
21
3d7c150e 22// { dg-options "-D_GLIBCXX_CONCEPT_CHECKS" }
be399691
PE
23
24#include <vector>
25#include <string>
26#include <algorithm>
27#include <testsuite_hooks.h>
28
29using namespace std;
30
31
bf7edb60 32// PR libstdc++/2054 and follow-up discussion
be399691
PE
33struct indirectCompare
34{
35 indirectCompare(const vector<string>& v) : V(v) {}
36
37 bool operator()( int x, int y) const
38 {
39 return V[x] < V[y];
40 }
41
42 bool operator()( int x, const string& a) const
43 {
44 return V[x] < a;
45 }
46
bf7edb60
PE
47 bool operator()( const string& a, int x) const
48 {
49 return V[x] < a;
50 }
51
be399691
PE
52 const vector<string>& V;
53};
54
55void
56test2054( )
57{
58 const int Maxi = 1022;
59
60 vector<string> Words(Maxi);
61 vector<int> Index(Maxi);
62
63 for(size_t i = 0; i < Index.size(); i++)
64 Index[i] = i;
65
66 indirectCompare aComparison(Words);
67
68 sort(Index.begin(), Index.end(), aComparison);
69
70 string SearchTerm;
71
72 lower_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
bf7edb60
PE
73 upper_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
74 equal_range(Index.begin(), Index.end(), SearchTerm, aComparison);
75 binary_search(Index.begin(), Index.end(), SearchTerm, aComparison);
be399691
PE
76}
77
78int main()
79{
80 test2054();
be399691
PE
81 return 0;
82}