c0b12dad93
2015-04-30 Edward Smith-Rowland <3dw4rd@verizon.net> Add fundamentals TR container erasure. * include/Makefile.am: Add new headers. * include/Makefile.in: Add new headers. * include/experimental/array: New. * include/experimental/deque: New. * include/experimental/erase_if.tcc: New. * include/experimental/forward_list: New. * include/experimental/list: New. * include/experimental/map: New. * include/experimental/set: New. * include/experimental/string: New. * include/experimental/unordered_map: New. * include/experimental/unordered_set: New. * include/experimental/vector: New. * testsuite/experimental/deque/erasure.cc: New. * testsuite/experimental/forward_list/erasure.cc: New. * testsuite/experimental/list/erasure.cc: New. * testsuite/experimental/map/erasure.cc: New. * testsuite/experimental/set/erasure.cc: New. * testsuite/experimental/string/erasure.cc: New. * testsuite/experimental/unordered_map/erasure.cc: New. * testsuite/experimental/unordered_set/erasure.cc: New. * testsuite/experimental/vector/erasure.cc: New. From-SVN: r222630
67 lines
1.7 KiB
C++
67 lines
1.7 KiB
C++
// { dg-options "-std=gnu++14" }
|
|
// { dg-do run }
|
|
|
|
// 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 moved_to of the GNU General Public License along
|
|
// with this library; see the file COPYING3. If not see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
#include <experimental/map>
|
|
#include <testsuite_hooks.h>
|
|
|
|
auto is_odd_pair = [](const std::pair<const int, std::string>& p)
|
|
{
|
|
return p.first % 2 != 0;
|
|
};
|
|
|
|
void
|
|
test01()
|
|
{
|
|
bool test [[gnu::unused]] = true;
|
|
|
|
std::map<int, std::string> m{ { 10, "A" }, { 11, "B" },
|
|
{ 12, "C" }, { 14, "D" },
|
|
{ 15, "E" }, { 17, "F" },
|
|
{ 18, "G" }, { 19, "H" } };
|
|
std::experimental::erase_if(m, is_odd_pair);
|
|
std::map<int, std::string> t{ { 10, "A" }, { 12, "C" },
|
|
{ 14, "D" }, { 18, "G" } };
|
|
VERIFY( m == t );
|
|
}
|
|
|
|
void
|
|
test02()
|
|
{
|
|
bool test [[gnu::unused]] = true;
|
|
|
|
std::multimap<int, std::string> mm{ { 20, "S" }, { 21, "T" },
|
|
{ 22, "U" }, { 22, "V" },
|
|
{ 23, "W" }, { 23, "X" },
|
|
{ 24, "Y" }, { 25, "Z" } };
|
|
std::experimental::erase_if(mm, is_odd_pair);
|
|
std::multimap<int, std::string> t{ { 20, "S" }, { 22, "U" },
|
|
{ 22, "V" }, { 24, "Y" } };
|
|
VERIFY( mm == t );
|
|
}
|
|
|
|
int
|
|
main()
|
|
{
|
|
test01();
|
|
test02();
|
|
|
|
return 0;
|
|
}
|