123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202 |
- // Copyright (C) 2015-2022 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-do run { target c++14 } }
- #include <set>
- #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::set<int, Cmp>;
- test_type x{ 1, 3, 5 };
- const test_type& cx = x;
- void
- test01()
- {
- Cmp::count = 0;
- auto it = x.find(1L);
- VERIFY( it != x.end() && *it == 1 );
- it = x.find(2L);
- VERIFY( it == x.end() );
- auto cit = cx.find(3L);
- VERIFY( cit != cx.end() && *cit == 3 );
- cit = cx.find(2L);
- VERIFY( cit == cx.end() );
- VERIFY( Cmp::count == 0 );
- static_assert(std::is_same<decltype(it), test_type::iterator>::value,
- "find returns iterator");
- static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
- "const find returns const_iterator");
- }
- 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 == 1 );
- 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 == 1 );
- it = x.lower_bound(2L);
- VERIFY( it != x.end() && *it == 3 );
- auto cit = cx.lower_bound(1L);
- VERIFY( cit != cx.end() && *cit == 1 );
- cit = cx.lower_bound(2L);
- VERIFY( cit != cx.end() && *cit == 3 );
- VERIFY( Cmp::count == 0 );
- static_assert(std::is_same<decltype(it), test_type::iterator>::value,
- "lower_bound returns iterator");
- static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
- "const lower_bound returns const_iterator");
- }
- void
- test04()
- {
- Cmp::count = 0;
- auto it = x.upper_bound(1L);
- VERIFY( it != x.end() && *it == 3 );
- it = x.upper_bound(5L);
- VERIFY( it == x.end() );
- auto cit = cx.upper_bound(1L);
- VERIFY( cit != cx.end() && *cit == 3 );
- cit = cx.upper_bound(5L);
- VERIFY( cit == cx.end() );
- VERIFY( Cmp::count == 0 );
- static_assert(std::is_same<decltype(it), test_type::iterator>::value,
- "upper_bound returns iterator");
- static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
- "const upper_bound returns const_iterator");
- }
- void
- test05()
- {
- Cmp::count = 0;
- auto it = x.equal_range(1L);
- VERIFY( it.first != it.second && *it.first == 1 );
- it = x.equal_range(2L);
- VERIFY( it.first == it.second && it.first != x.end() );
- auto cit = cx.equal_range(1L);
- VERIFY( cit.first != cit.second && *cit.first == 1 );
- cit = cx.equal_range(2L);
- VERIFY( cit.first == cit.second && cit.first != cx.end() );
- VERIFY( Cmp::count == 0 );
- using pair = std::pair<test_type::iterator, test_type::iterator>;
- static_assert(std::is_same<decltype(it), pair>::value,
- "equal_range returns pair<iterator, iterator>");
- using cpair = std::pair<test_type::const_iterator, test_type::const_iterator>;
- static_assert(std::is_same<decltype(cit), cpair>::value,
- "const equal_range returns pair<const_iterator, const_iterator>");
- }
- void
- test06()
- {
- // https://gcc.gnu.org/ml/libstdc++/2015-01/msg00176.html
- // Verify the new function template overloads do not cause problems
- // when the comparison function is not transparent.
- struct I
- {
- int i;
- operator int() const { return i; }
- };
- std::set<int> s;
- I i = { };
- s.find(i);
- }
- void
- test07()
- {
- // PR libstdc++/78273
- struct C {
- bool operator()(int l, int r) const { return l < r; }
- struct Partition { };
- bool operator()(int l, Partition) const { return l < 2; }
- bool operator()(Partition, int r) const { return 4 < r; }
- using is_transparent = void;
- };
- std::set<int, C> s{ 1, 2, 3, 4, 5 };
- auto n = s.count(C::Partition{});
- VERIFY( n == 3 );
- }
- int
- main()
- {
- test01();
- test02();
- test03();
- test04();
- test05();
- test06();
- test07();
- }
|