aboutsummaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite/23_containers/map/modifiers
diff options
context:
space:
mode:
Diffstat (limited to 'libstdc++-v3/testsuite/23_containers/map/modifiers')
-rw-r--r--libstdc++-v3/testsuite/23_containers/map/modifiers/extract.cc147
-rw-r--r--libstdc++-v3/testsuite/23_containers/map/modifiers/merge.cc147
2 files changed, 294 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/23_containers/map/modifiers/extract.cc b/libstdc++-v3/testsuite/23_containers/map/modifiers/extract.cc
new file mode 100644
index 00000000000..dbbcc803ba7
--- /dev/null
+++ b/libstdc++-v3/testsuite/23_containers/map/modifiers/extract.cc
@@ -0,0 +1,147 @@
+// Copyright (C) 2016 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++17" }
+
+#include <map>
+#include <algorithm>
+#include <testsuite_hooks.h>
+
+using test_type = std::map<int, int>;
+
+void
+test01()
+{
+ bool test __attribute__((unused)) = true;
+
+ test_type c{ {1, 10}, {2, 20}, {3, 30} };
+ test_type::node_type node;
+ test_type::insert_return_type ins;
+ test_type::iterator pos;
+
+ node = c.extract(0);
+ VERIFY( !node );
+ VERIFY( node.empty() );
+ VERIFY( c.size() == 3 );
+
+ ins = c.insert(std::move(node));
+ VERIFY( !node );
+ VERIFY( node.empty() );
+ VERIFY( c.size() == 3 );
+ VERIFY( !ins.inserted );
+ VERIFY( !ins.node );
+ VERIFY( ins.position == c.end() );
+
+ node = c.extract(1);
+ VERIFY( (bool)node );
+ VERIFY( !node.empty() );
+ VERIFY( c.size() == 2 );
+ VERIFY( c.count(1) == 0 );
+ VERIFY( node.get_allocator() == c.get_allocator() );
+ VERIFY( node.key() == 1 );
+ VERIFY( node.mapped() == 10 );
+
+ node.key() = 4;
+ node.mapped() = 40;
+ VERIFY( node.key() == 4 );
+ VERIFY( node.mapped() == 40 );
+
+ ins = c.insert(std::move(node));
+ VERIFY( !node );
+ VERIFY( node.empty() );
+ VERIFY( c.size() == 3 );
+ VERIFY( ins.inserted );
+ VERIFY( !ins.node );
+ VERIFY( ins.position != c.end() );
+ VERIFY( ins.position->first == 4 );
+ VERIFY( ins.position->second == 40 );
+ VERIFY( c.count(1) == 0 );
+ VERIFY( c.count(4) == 1 );
+ VERIFY( std::is_sorted(c.begin(), c.end()) );
+
+ pos = c.insert(c.begin(), std::move(node));
+ VERIFY( !node );
+ VERIFY( node.empty() );
+ VERIFY( c.size() == 3 );
+ VERIFY( pos == c.end() );
+
+ node = c.extract(2);
+ pos = c.insert(c.begin(), std::move(node));
+ VERIFY( c.size() == 3 );
+ VERIFY( pos != c.end() );
+ VERIFY( pos->first == 2 );
+ VERIFY( pos->second == 20 );
+
+ test_type c2 = c;
+ node = c2.extract(3);
+ ins = c.insert(std::move(node));
+ VERIFY( node.empty() );
+ VERIFY( ins.position != c.end() );
+ VERIFY( !ins.inserted );
+ VERIFY( !ins.node.empty() );
+ VERIFY( ins.node.key() == 3 );
+ VERIFY( ins.node.mapped() == 30 );
+ VERIFY( ins.position->first == ins.node.key() );
+}
+
+void
+test02()
+{
+ bool test __attribute__((unused)) = true;
+
+ test_type c{ {1, 10}, {2, 20}, {3, 30} };
+ test_type::node_type node;
+ test_type::insert_return_type ins;
+
+ node = c.extract(c.begin());
+ VERIFY( (bool)node );
+ VERIFY( !node.empty() );
+ VERIFY( c.size() == 2 );
+ VERIFY( node.get_allocator() == c.get_allocator() );
+ VERIFY( node.key() == 1 );
+ VERIFY( node.mapped() == 10 );
+
+ ins = c.insert(std::move(node));
+ VERIFY( node.empty() );
+ VERIFY( c.size() == 3 );
+ VERIFY( ins.inserted );
+ VERIFY( !ins.node );
+ VERIFY( ins.position != c.end() );
+ VERIFY( ins.position->first == 1 );
+ VERIFY( ins.position->second == 10 );
+}
+
+void
+test03()
+{
+ struct less : std::less<int> { };
+ using std::is_same_v;
+ using compat_type1 = std::map<int, int, less>;
+ static_assert( is_same_v<test_type::node_type, compat_type1::node_type> );
+ using compat_type2 = std::multimap<int, int>;
+ static_assert( is_same_v<test_type::node_type, compat_type2::node_type> );
+ using compat_type3 = std::multimap<int, int, less>;
+ static_assert( is_same_v<test_type::node_type, compat_type3::node_type> );
+}
+
+int
+main()
+{
+ test01();
+ test02();
+ test03();
+}
diff --git a/libstdc++-v3/testsuite/23_containers/map/modifiers/merge.cc b/libstdc++-v3/testsuite/23_containers/map/modifiers/merge.cc
new file mode 100644
index 00000000000..c978ed21e07
--- /dev/null
+++ b/libstdc++-v3/testsuite/23_containers/map/modifiers/merge.cc
@@ -0,0 +1,147 @@
+// Copyright (C) 2016 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++17" }
+
+#include <map>
+#include <algorithm>
+#include <testsuite_hooks.h>
+
+using test_type = std::map<int, int>;
+
+void
+test01()
+{
+ bool test __attribute__((unused)) = true;
+
+ const test_type c0{ {1, 10}, {2, 20}, {3, 30} };
+ test_type c1 = c0, c2 = c0;
+
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( c2 == c0 );
+
+ c1.clear();
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( c2.empty() );
+
+ c2.merge(std::move(c1));
+ VERIFY( c1.empty() );
+ VERIFY( c2 == c0 );
+}
+
+void
+test02()
+{
+ bool test __attribute__((unused)) = true;
+
+ const test_type c0{ {1, 10}, {2, 20}, {3, 30} };
+ test_type c1 = c0;
+ std::map<int, int, std::less<>> c2( c0.begin(), c0.end() );
+
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( std::equal(c2.begin(), c2.end(), c0.begin(), c0.end()) );
+
+ c1.clear();
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( c2.empty() );
+
+ c2.merge(std::move(c1));
+ VERIFY( c1.empty() );
+ VERIFY( std::equal(c2.begin(), c2.end(), c0.begin(), c0.end()) );
+}
+
+void
+test03()
+{
+ bool test __attribute__((unused)) = true;
+
+ const test_type c0{ {1, 10}, {2, 20}, {3, 30} };
+ test_type c1 = c0;
+ std::map<int, int, std::greater<>> c2( c0.begin(), c0.end() );
+
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( std::equal(c2.rbegin(), c2.rend(), c0.begin(), c0.end()) );
+
+ c1.clear();
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( c2.empty() );
+
+ c2.merge(c1);
+ VERIFY( c1.empty() );
+ VERIFY( std::equal(c2.rbegin(), c2.rend(), c0.begin(), c0.end()) );
+
+ c1.merge(std::move(c2));
+ VERIFY( c1 == c0 );
+ VERIFY( c2.empty() );
+}
+
+void
+test04()
+{
+ bool test __attribute__((unused)) = true;
+
+ const test_type c0{ {1, 10}, {2, 20}, {3, 30} };
+ test_type c1 = c0;
+ std::multimap<int, int, std::greater<>> c2( c0.begin(), c0.end() );
+
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( std::equal(c2.rbegin(), c2.rend(), c0.begin(), c0.end()) );
+
+ c1.clear();
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( c2.empty() );
+
+ c2.merge(c1);
+ VERIFY( c1.empty() );
+ VERIFY( std::equal(c2.rbegin(), c2.rend(), c0.begin(), c0.end()) );
+
+ c1 = c0;
+ c2.merge(c1);
+ VERIFY( c1.empty() );
+ VERIFY( c2.size() == (2 * c0.size()) );
+ VERIFY( std::is_sorted(c2.begin(), c2.end(), c2.value_comp()) );
+
+ c1.merge(c2);
+ VERIFY( c1 == c0 );
+ VERIFY( std::equal(c2.rbegin(), c2.rend(), c0.begin(), c0.end()) );
+
+ c1.merge(std::move(c2));
+ VERIFY( c1 == c0 );
+ VERIFY( std::equal(c2.rbegin(), c2.rend(), c0.begin(), c0.end()) );
+
+ c1.clear();
+ c1.merge(std::move(c2));
+ VERIFY( c1 == c0 );
+ VERIFY( c2.empty() );
+}
+
+int
+main()
+{
+ test01();
+ test02();
+ test03();
+ test04();
+}
generated by cgit v1.2.3 (git 2.25.1) at 2024-07-02 11:17:35 +0000