summaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite/backward/hash_map
diff options
context:
space:
mode:
Diffstat (limited to 'libstdc++-v3/testsuite/backward/hash_map')
-rw-r--r--libstdc++-v3/testsuite/backward/hash_map/1.cc105
-rw-r--r--libstdc++-v3/testsuite/backward/hash_map/14648.cc40
-rw-r--r--libstdc++-v3/testsuite/backward/hash_map/23528.cc43
-rw-r--r--libstdc++-v3/testsuite/backward/hash_map/25896.cc160
-rw-r--r--libstdc++-v3/testsuite/backward/hash_map/requirements/explicit_instantiation.cc26
5 files changed, 374 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/backward/hash_map/1.cc b/libstdc++-v3/testsuite/backward/hash_map/1.cc
new file mode 100644
index 000000000..cf05e555b
--- /dev/null
+++ b/libstdc++-v3/testsuite/backward/hash_map/1.cc
@@ -0,0 +1,105 @@
+// { dg-options "-Wno-deprecated" }
+
+// Copyright (C) 2002, 2005, 2007, 2009 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/>.
+
+// hash_map (SGI extension)
+
+#include <cstdlib>
+#include <string>
+#include <hash_map>
+#include <testsuite_hooks.h>
+
+namespace __gnu_cxx
+{
+ using std::string;
+
+ inline size_t hash_string(const char* s)
+ {
+ unsigned long h;
+ for (h=0; *s; ++s) {
+ h = 5*h + *s;
+ }
+ return size_t(h);
+ }
+
+ template<class T> struct hash<T *>
+ {
+ size_t operator()(const T *const & s) const
+ { return reinterpret_cast<size_t>(s); }
+ };
+
+ template<> struct hash<string>
+ {
+ size_t operator()(const string &s) const { return hash_string(s.c_str()); }
+ };
+
+ template<> struct hash<const string>
+ {
+ size_t operator()(const string &s) const { return hash_string(s.c_str()); }
+ };
+
+ template<class T1, class T2> struct hash<pair<T1,T2> >
+ {
+ hash<T1> __fh;
+ hash<T2> __sh;
+ size_t operator()(const pair<T1,T2> &p) const {
+ return __fh(p.first) ^ __sh(p.second);
+ }
+ };
+}
+
+void test01()
+{
+ const int Size = 5;
+ bool test __attribute__((unused)) = true;
+
+ using std::string;
+ using std::pair;
+ using std::vector;
+ using __gnu_cxx::hash_map;
+
+ for (int i = 0; i < 10; i++)
+ {
+ hash_map<string, int> a;
+ hash_map<string, int> b;
+
+ vector<pair<string, int> > contents (Size);
+ for (int j = 0; j < Size; j++)
+ {
+ string s;
+ for (int k = 0; k < 10; k++)
+ {
+ s += 'a' + (rand() % 26);
+ }
+ contents[j] = make_pair(s,j);
+ }
+ for (int j = 0; j < Size; j++)
+ {
+ a[contents[j].first] = contents[j].second;
+ int k = Size - 1 - j;
+ b[contents[k].first] = contents[k].second;
+ }
+ VERIFY( a == b );
+ }
+}
+
+int main()
+{
+ test01();
+ return 0;
+}
diff --git a/libstdc++-v3/testsuite/backward/hash_map/14648.cc b/libstdc++-v3/testsuite/backward/hash_map/14648.cc
new file mode 100644
index 000000000..b6822961b
--- /dev/null
+++ b/libstdc++-v3/testsuite/backward/hash_map/14648.cc
@@ -0,0 +1,40 @@
+// { dg-options "-Wno-deprecated" }
+
+// Copyright (C) 2004, 2005, 2007, 2009 Free Software Foundation
+//
+// 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/>.
+
+#include <iostream>
+#include <hash_map>
+#include <ext/rope>
+
+// libstdc++/14648
+void test01()
+{
+ using namespace __gnu_cxx;
+
+ typedef hash_map<char, crope, hash<char>, std::equal_to<char> > maptype;
+ maptype m;
+ m['l'] = "50";
+ m['x'] = "10";
+ std::cout << "m['x'] = " << m['x'] << std::endl;
+}
+
+int main()
+{
+ test01();
+ return 0;
+}
diff --git a/libstdc++-v3/testsuite/backward/hash_map/23528.cc b/libstdc++-v3/testsuite/backward/hash_map/23528.cc
new file mode 100644
index 000000000..2af6d30f2
--- /dev/null
+++ b/libstdc++-v3/testsuite/backward/hash_map/23528.cc
@@ -0,0 +1,43 @@
+// { dg-options "-Wno-deprecated" }
+// { dg-do compile }
+
+// Copyright (C) 2005, 2009 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/>.
+
+#include <hash_map>
+
+// libstdc++/23528
+void test01()
+{
+ __gnu_cxx::hash_map<int, int> m;
+ m[888] = 999;
+
+ __gnu_cxx::hash_map<int, int>::allocator_type a = m.get_allocator();
+
+ __gnu_cxx::hash_map<int, int>::value_type *y = a.allocate(1);
+
+ a.construct(y, *m.begin());
+
+ a.destroy(y);
+ a.deallocate(y, 1);
+}
+
+int main()
+{
+ test01();
+ return 0;
+}
diff --git a/libstdc++-v3/testsuite/backward/hash_map/25896.cc b/libstdc++-v3/testsuite/backward/hash_map/25896.cc
new file mode 100644
index 000000000..f196053c2
--- /dev/null
+++ b/libstdc++-v3/testsuite/backward/hash_map/25896.cc
@@ -0,0 +1,160 @@
+// { dg-options "-Wno-deprecated" }
+
+// Copyright (C) 2009 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/>.
+
+// This is a copy of tr1/6_containers/unordered_map/erase/1.cc, using
+// hash_map instead of unordered_map.
+
+#include <hash_map>
+#include <string>
+#include <testsuite_hooks.h>
+
+namespace __gnu_cxx
+{
+ using std::string;
+
+ inline size_t hash_string(const char* s)
+ {
+ unsigned long h;
+ for (h=0; *s; ++s) {
+ h = 5*h + *s;
+ }
+ return size_t(h);
+ }
+
+ template<class T> struct hash<T *>
+ {
+ size_t operator()(const T *const & s) const
+ { return reinterpret_cast<size_t>(s); }
+ };
+
+ template<> struct hash<string>
+ {
+ size_t operator()(const string &s) const { return hash_string(s.c_str()); }
+ };
+
+ template<> struct hash<const string>
+ {
+ size_t operator()(const string &s) const { return hash_string(s.c_str()); }
+ };
+}
+
+void test01()
+{
+ bool test __attribute__((unused)) = true;
+
+ typedef __gnu_cxx::hash_map<std::string, int> Map;
+ typedef Map::iterator iterator;
+ typedef Map::const_iterator const_iterator;
+ typedef Map::value_type value_type;
+
+ Map m1;
+
+ m1.insert(value_type("because to why", 1));
+ m1.insert(value_type("the stockholm syndrome", 2));
+ m1.insert(value_type("a cereous night", 3));
+ m1.insert(value_type("eeilo", 4));
+ m1.insert(value_type("protean", 5));
+ m1.insert(value_type("the way you are when", 6));
+ m1.insert(value_type("tillsammans", 7));
+ m1.insert(value_type("umbra/penumbra", 8));
+ m1.insert(value_type("belonging (no longer mix)", 9));
+ m1.insert(value_type("one line behind", 10));
+ VERIFY( m1.size() == 10 );
+
+ VERIFY( m1.erase("eeilo") == 1 );
+ VERIFY( m1.size() == 9 );
+ iterator it1 = m1.find("eeilo");
+ VERIFY( it1 == m1.end() );
+
+ VERIFY( m1.erase("tillsammans") == 1 );
+ VERIFY( m1.size() == 8 );
+ iterator it2 = m1.find("tillsammans");
+ VERIFY( it2 == m1.end() );
+
+ // Must work (see DR 526)
+ iterator it3 = m1.find("belonging (no longer mix)");
+ VERIFY( it3 != m1.end() );
+ VERIFY( m1.erase(it3->first) == 1 );
+ VERIFY( m1.size() == 7 );
+ it3 = m1.find("belonging (no longer mix)");
+ VERIFY( it3 == m1.end() );
+
+ VERIFY( !m1.erase("abra") );
+ VERIFY( m1.size() == 7 );
+
+ VERIFY( !m1.erase("eeilo") );
+ VERIFY( m1.size() == 7 );
+
+ VERIFY( m1.erase("because to why") == 1 );
+ VERIFY( m1.size() == 6 );
+ iterator it4 = m1.find("because to why");
+ VERIFY( it4 == m1.end() );
+
+ iterator it5 = m1.find("umbra/penumbra");
+ iterator it6 = m1.find("one line behind");
+ VERIFY( it5 != m1.end() );
+ VERIFY( it6 != m1.end() );
+
+ VERIFY( m1.find("the stockholm syndrome") != m1.end() );
+ VERIFY( m1.find("a cereous night") != m1.end() );
+ VERIFY( m1.find("the way you are when") != m1.end() );
+ VERIFY( m1.find("a cereous night") != m1.end() );
+
+ VERIFY( m1.erase(it5->first) == 1 );
+ VERIFY( m1.size() == 5 );
+ it5 = m1.find("umbra/penumbra");
+ VERIFY( it5 == m1.end() );
+
+ VERIFY( m1.erase(it6->first) == 1 );
+ VERIFY( m1.size() == 4 );
+ it6 = m1.find("one line behind");
+ VERIFY( it6 == m1.end() );
+
+ iterator it7 = m1.begin();
+ iterator it8 = it7;
+ ++it8;
+ iterator it9 = it8;
+ ++it9;
+
+ VERIFY( m1.erase(it8->first) == 1 );
+ VERIFY( m1.size() == 3 );
+ VERIFY( ++it7 == it9 );
+
+ iterator it10 = it9;
+ ++it10;
+ iterator it11 = it10;
+
+ VERIFY( m1.erase(it9->first) == 1 );
+ VERIFY( m1.size() == 2 );
+ VERIFY( ++it10 == m1.end() );
+
+ m1.erase(m1.begin());
+ VERIFY( m1.size() == 1 );
+ VERIFY( m1.begin() == it11 );
+
+ VERIFY( m1.erase(m1.begin()->first) == 1 );
+ VERIFY( m1.size() == 0 );
+ VERIFY( m1.begin() == m1.end() );
+}
+
+int main()
+{
+ test01();
+ return 0;
+}
diff --git a/libstdc++-v3/testsuite/backward/hash_map/requirements/explicit_instantiation.cc b/libstdc++-v3/testsuite/backward/hash_map/requirements/explicit_instantiation.cc
new file mode 100644
index 000000000..36452db53
--- /dev/null
+++ b/libstdc++-v3/testsuite/backward/hash_map/requirements/explicit_instantiation.cc
@@ -0,0 +1,26 @@
+// { dg-options "-Wno-deprecated" }
+// { dg-do compile }
+
+// Copyright (C) 2004, 2007, 2009 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/>.
+
+
+// This file tests explicit instantiation of library containers
+
+#include <hash_map>
+
+template class __gnu_cxx::hash_map<int, char>;