1 // 2001-12-28 Phil Edwards <pme@gcc.gnu.org>
3 // Copyright (C) 2001, 2002, 2004 Free Software Foundation, Inc.
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)
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.
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, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // Concept checking must remain sane.
23 // { dg-options "-D_GLIBCXX_CONCEPT_CHECKS" }
28 #include <testsuite_hooks.h>
33 // PR libstdc++/2054 and follow-up discussion
34 struct indirectCompare
36 indirectCompare(const vector
<string
>& v
) : V(v
) {}
38 bool operator()( int x
, int y
) const
43 bool operator()( int x
, const string
& a
) const
48 bool operator()( const string
& a
, int x
) const
53 const vector
<string
>& V
;
59 const int Maxi
= 1022;
61 vector
<string
> Words(Maxi
);
62 vector
<int> Index(Maxi
);
64 for(size_t i
= 0; i
< Index
.size(); i
++)
67 indirectCompare
aComparison(Words
);
69 sort(Index
.begin(), Index
.end(), aComparison
);
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
);
79 #if !__GXX_WEAK__ && _MT_ALLOCATOR_H
80 // Explicitly instantiate for systems with no COMDAT or weak support.
81 template class __gnu_cxx::__mt_alloc
<int>;
82 template class __gnu_cxx::__mt_alloc
<std::string
>;