91c78ea5b6
* include/bits/stl_map.h (map::find<>, map::count<>, map::lower_bound<>, map::upper_bound<>, map::equal_range<>): New member function templates to perform heterogeneous lookup. * include/bits/stl_multimap.h (multimap::find<>, multimap::count<>, multimap::lower_bound<>, multimap::upper_bound<>, multimap::equal_range<>): Likewise. * include/bits/stl_multiset.h (multiset::find<>, multiset::count<>, multiset::lower_bound<>, multiset::upper_bound<>, multiset::equal_range<>): Likewise. * include/bits/stl_set.h (set::find<>, set::count<>, set::lower_bound<>, set::upper_bound<>, set::equal_range<>): Likewise. * include/bits/stl_tree.h (_Rb_tree::_S_lower_bound_tr, _Rb_tree::_S_upper_bound_tr, _Rb_tree::_M_find_tr, _Rb_tree::_M_count_tr, _Rb_tree::_M_lower_bound_tr, _Rb_tree::_M_upper_bound_tr, _Rb_tree::_M_equal_range_tr): Likewise. * testsuite/23_containers/map/operations/2.cc: New. * testsuite/23_containers/multimap/operations/2.cc: New. * testsuite/23_containers/multiset/operations/2.cc: New. * testsuite/23_containers/set/operations/2.cc: New. From-SVN: r219888
142 lines
3.0 KiB
C++
142 lines
3.0 KiB
C++
// Copyright (C) 2015 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/>.
|
|
|
|
// { dg-options "-std=gnu++14" }
|
|
|
|
#include <map>
|
|
#include <testsuite_hooks.h>
|
|
|
|
struct Cmp
|
|
{
|
|
typedef void is_transparent;
|
|
|
|
bool operator()(int i, long l) const { return i < l; }
|
|
bool operator()(long l, int i) const { return l < i; }
|
|
bool operator()(int i, int j) const { ++count; return i < j; }
|
|
|
|
static int count;
|
|
};
|
|
|
|
int Cmp::count = 0;
|
|
|
|
using test_type = std::multimap<int, char, Cmp>;
|
|
|
|
test_type x{ { 1, '2' }, { 3, '4' }, { 3, '5' } };
|
|
const test_type& cx = x;
|
|
|
|
void
|
|
test01()
|
|
{
|
|
Cmp::count = 0;
|
|
|
|
auto it = x.find(1L);
|
|
VERIFY( it != x.end() && it->second == '2' );
|
|
it = x.find(2L);
|
|
VERIFY( it == x.end() );
|
|
|
|
auto cit = cx.find(3L);
|
|
VERIFY( cit != cx.end() && cit->second == '4' );
|
|
cit = cx.find(2L);
|
|
VERIFY( cit == cx.end() );
|
|
|
|
VERIFY( Cmp::count == 0);
|
|
}
|
|
|
|
void
|
|
test02()
|
|
{
|
|
Cmp::count = 0;
|
|
|
|
auto n = x.count(1L);
|
|
VERIFY( n == 1 );
|
|
n = x.count(2L);
|
|
VERIFY( n == 0 );
|
|
|
|
auto cn = cx.count(3L);
|
|
VERIFY( cn == 2 );
|
|
cn = cx.count(2L);
|
|
VERIFY( cn == 0 );
|
|
|
|
VERIFY( Cmp::count == 0);
|
|
}
|
|
|
|
void
|
|
test03()
|
|
{
|
|
Cmp::count = 0;
|
|
|
|
auto it = x.lower_bound(1L);
|
|
VERIFY( it != x.end() && it->second == '2' );
|
|
it = x.lower_bound(2L);
|
|
VERIFY( it != x.end() && it->second == '4' );
|
|
|
|
auto cit = cx.lower_bound(1L);
|
|
VERIFY( cit != cx.end() && cit->second == '2' );
|
|
cit = cx.lower_bound(2L);
|
|
VERIFY( cit != cx.end() && cit->second == '4' );
|
|
|
|
VERIFY( Cmp::count == 0);
|
|
}
|
|
|
|
void
|
|
test04()
|
|
{
|
|
Cmp::count = 0;
|
|
|
|
auto it = x.upper_bound(1L);
|
|
VERIFY( it != x.end() && it->second == '4' );
|
|
it = x.upper_bound(3L);
|
|
VERIFY( it == x.end() );
|
|
|
|
auto cit = cx.upper_bound(1L);
|
|
VERIFY( cit != cx.end() && cit->second == '4' );
|
|
cit = cx.upper_bound(3L);
|
|
VERIFY( cit == cx.end() );
|
|
|
|
VERIFY( Cmp::count == 0);
|
|
}
|
|
|
|
void
|
|
test05()
|
|
{
|
|
Cmp::count = 0;
|
|
|
|
auto it = x.equal_range(1L);
|
|
VERIFY( it.first != it.second && it.first->second == '2' );
|
|
it = x.equal_range(2L);
|
|
VERIFY( it.first == it.second && it.first != x.end() );
|
|
|
|
auto cit = cx.equal_range(3L);
|
|
VERIFY( cit.first != cit.second && cit.first->second == '4' );
|
|
VERIFY( std::distance(cit.first, cit.second) == 2 );
|
|
cit = cx.equal_range(2L);
|
|
VERIFY( cit.first == cit.second && cit.first != cx.end() );
|
|
|
|
VERIFY( Cmp::count == 0);
|
|
}
|
|
|
|
|
|
int
|
|
main()
|
|
{
|
|
test01();
|
|
test02();
|
|
test03();
|
|
test04();
|
|
test05();
|
|
}
|