libstdc++-v3/testsuite/ext/concept_checks.cc

   1 // 2001-12-28  Phil Edwards  <pme@gcc.gnu.org>
   2 //
   3 // Copyright (C) 2001, 2002, 2004, 2005 Free Software Foundation, Inc.
   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
   8 // Free Software Foundation; either version 2, or (at your option)
   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
  17 // with this library; see the file COPYING.  If not, write to the Free
  18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  19 // USA.
  20
  21 // Concept checking must remain sane.
  22
  23 // { dg-options "-D_GLIBCXX_CONCEPT_CHECKS" }
  24
  25 #include <vector>
  26 #include <string>
  27 #include <algorithm>
  28 #include <testsuite_hooks.h>
  29
  30 using namespace std;
  31
  32
  33 // PR libstdc++/2054 and follow-up discussion
  34 struct indirectCompare
  35 {
  36   indirectCompare(const vector<string>& v) : V(v) {}
  37
  38   bool operator()( int x,  int y) const
  39   {
  40        return V[x] < V[y];
  41   }
  42
  43   bool operator()( int x, const string& a) const
  44   {
  45        return V[x] < a;
  46   }
  47
  48   bool operator()( const string& a, int x) const
  49   {
  50        return V[x] < a;
  51   }
  52
  53   const vector<string>& V;
  54 };
  55
  56 void
  57 test2054( )
  58 {
  59   const int Maxi = 1022;
  60
  61   vector<string> Words(Maxi);
  62   vector<int> Index(Maxi);
  63
  64   for(size_t i = 0; i < Index.size(); i++)
  65      Index[i] = i;
  66
  67   indirectCompare aComparison(Words);
  68
  69   sort(Index.begin(), Index.end(), aComparison);
  70
  71   string SearchTerm;
  72
  73   lower_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
  74   upper_bound(Index.begin(), Index.end(), SearchTerm, aComparison);
  75   equal_range(Index.begin(), Index.end(), SearchTerm, aComparison);
  76   binary_search(Index.begin(), Index.end(), SearchTerm, aComparison);
  77 }
  78
  79 int main()
  80 {
  81   test2054();
  82   return 0;
  83 }