gcc/libstdc++-v3/testsuite/ext/concept_checks.cc
Benjamin Kosnik 3d7c150e3f Move from CPP to CXX.
2003-07-04  Benjamin Kosnik  <bkoz@redhat.com>

	Move from CPP to CXX.
	* include/bits/c++config: Move to GLIBCXX from GLIBCPP.
	* testsuite/Makefile.am: Same.
	* testsuite/Makefile.in: Regenerate.
	* po/Makefile.am: Same.
	* po/Makefile.in: Regenerate.
	* libsupc++/Makefile.am: Same.
	* libsupc++/Makefile.in: Regenerate.
	* libmath/Makefile.am: Same.
	* libmath/Makefile.in: Regenerate.
	* include/Makefile.am: Same.
	* include/Makefile.in: Regenerate.
	* src/Makefile.am: Same.
	* src/Makefile.in: Regenerate.
	* acconfig.h: Same.
	* configure.host: Same.
	* configure.in: Same.
	* configure: Regenerate.
	* acinclude.m4: Same.
	* aclocal.m4: Same.
	* src: Change all files in this directory.
	* testsuite: Same.
	* include: Same, standardize include guards.
	* config: Same.
	* libsupc++: Same.

From-SVN: r68958
2003-07-05 04:05:45 +00:00

85 lines
2.0 KiB
C++

// 2001-12-28 Phil Edwards <pme@gcc.gnu.org>
//
// Copyright (C) 2001, 2002 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
// 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;
}