diff options
Diffstat (limited to 'libstdc++-v3/testsuite/backward/hash_set')
4 files changed, 309 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/backward/hash_set/1.cc b/libstdc++-v3/testsuite/backward/hash_set/1.cc new file mode 100644 index 000000000..808d08907 --- /dev/null +++ b/libstdc++-v3/testsuite/backward/hash_set/1.cc @@ -0,0 +1,40 @@ +// { dg-options "-Wno-deprecated" } + +// 2002-04-28 Paolo Carlini <pcarlini@unitus.it> +// Peter Schmid <schmid@snake.iap.physik.tu-darmstadt.de> + +// Copyright (C) 2002, 2004, 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_set (SGI extension) + +#include <hash_set> + +void +test01() +{ + bool test __attribute__((unused)) = true; + const int werte[] = { 1, 25, 9, 16, -36}; + const int anzahl = sizeof(werte) / sizeof(int); + __gnu_cxx::hash_set<int> intTable(werte, werte + anzahl); +} + +int main() +{ + test01(); + return 0; +} diff --git a/libstdc++-v3/testsuite/backward/hash_set/25896.cc b/libstdc++-v3/testsuite/backward/hash_set/25896.cc new file mode 100644 index 000000000..e82a28174 --- /dev/null +++ b/libstdc++-v3/testsuite/backward/hash_set/25896.cc @@ -0,0 +1,159 @@ +// { 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_set/erase/1.cc, using +// hash_set instead of unordered_set. + +#include <hash_set> +#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_set<std::string> Set; + typedef Set::iterator iterator; + typedef Set::const_iterator const_iterator; + + Set s1; + + s1.insert("because to why"); + s1.insert("the stockholm syndrome"); + s1.insert("a cereous night"); + s1.insert("eeilo"); + s1.insert("protean"); + s1.insert("the way you are when"); + s1.insert("tillsammans"); + s1.insert("umbra/penumbra"); + s1.insert("belonging (no longer mix)"); + s1.insert("one line behind"); + VERIFY( s1.size() == 10 ); + + VERIFY( s1.erase("eeilo") == 1 ); + VERIFY( s1.size() == 9 ); + iterator it1 = s1.find("eeilo"); + VERIFY( it1 == s1.end() ); + + VERIFY( s1.erase("tillsammans") == 1 ); + VERIFY( s1.size() == 8 ); + iterator it2 = s1.find("tillsammans"); + VERIFY( it2 == s1.end() ); + + // Must work (see DR 526) + iterator it3 = s1.find("belonging (no longer mix)"); + VERIFY( it3 != s1.end() ); + VERIFY( s1.erase(*it3) == 1 ); + VERIFY( s1.size() == 7 ); + it3 = s1.find("belonging (no longer mix)"); + VERIFY( it3 == s1.end() ); + + VERIFY( !s1.erase("abra") ); + VERIFY( s1.size() == 7 ); + + VERIFY( !s1.erase("eeilo") ); + VERIFY( s1.size() == 7 ); + + VERIFY( s1.erase("because to why") == 1 ); + VERIFY( s1.size() == 6 ); + iterator it4 = s1.find("because to why"); + VERIFY( it4 == s1.end() ); + + iterator it5 = s1.find("umbra/penumbra"); + iterator it6 = s1.find("one line behind"); + VERIFY( it5 != s1.end() ); + VERIFY( it6 != s1.end() ); + + VERIFY( s1.find("the stockholm syndrome") != s1.end() ); + VERIFY( s1.find("a cereous night") != s1.end() ); + VERIFY( s1.find("the way you are when") != s1.end() ); + VERIFY( s1.find("a cereous night") != s1.end() ); + + VERIFY( s1.erase(*it5) == 1 ); + VERIFY( s1.size() == 5 ); + it5 = s1.find("umbra/penumbra"); + VERIFY( it5 == s1.end() ); + + VERIFY( s1.erase(*it6) == 1 ); + VERIFY( s1.size() == 4 ); + it6 = s1.find("one line behind"); + VERIFY( it6 == s1.end() ); + + iterator it7 = s1.begin(); + iterator it8 = it7; + ++it8; + iterator it9 = it8; + ++it9; + + VERIFY( s1.erase(*it8) == 1 ); + VERIFY( s1.size() == 3 ); + VERIFY( ++it7 == it9 ); + + iterator it10 = it9; + ++it10; + iterator it11 = it10; + + VERIFY( s1.erase(*it9) == 1 ); + VERIFY( s1.size() == 2 ); + VERIFY( ++it10 == s1.end() ); + + s1.erase(s1.begin()); + VERIFY( s1.size() == 1 ); + VERIFY( s1.begin() == it11 ); + + VERIFY( s1.erase(*s1.begin()) == 1 ); + VERIFY( s1.size() == 0 ); + VERIFY( s1.begin() == s1.end() ); +} + +int main() +{ + test01(); + return 0; +} diff --git a/libstdc++-v3/testsuite/backward/hash_set/check_construct_destroy.cc b/libstdc++-v3/testsuite/backward/hash_set/check_construct_destroy.cc new file mode 100644 index 000000000..8f8aafba1 --- /dev/null +++ b/libstdc++-v3/testsuite/backward/hash_set/check_construct_destroy.cc @@ -0,0 +1,84 @@ +// { dg-options "-Wno-deprecated" } + +// 2004-07-26 Matt Austern <austern@apple.com> +// +// Copyright (C) 2003, 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/>. +// + +#include <hash_set> +#include <functional> +#include <iterator> +#include <testsuite_allocator.h> + +using namespace __gnu_test; + +int main() +{ + typedef __gnu_cxx::hash_set<int, __gnu_cxx::hash<int>, std::equal_to<int>, + tracker_allocator<int> > + Container; + + const int arr10[10] = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 }; + const int arr10a[10] = { 31, 23, 82, 46, 13, 17, 30, 71, 22, 51 }; + bool ok = true; + + int buckets; + + tracker_allocator_counter::reset(); + { + Container c; + buckets = c.bucket_count(); + ok = check_construct_destroy("empty container", buckets, 0) && ok; + } + ok = check_construct_destroy("empty container", buckets, buckets) && ok; + + + tracker_allocator_counter::reset(); + { + Container c(arr10, arr10 + 10); + ok = check_construct_destroy("Construct from range", buckets+10, 0) && ok; + } + ok = check_construct_destroy("Construct from range", buckets+10, buckets+10) && ok; + + tracker_allocator_counter::reset(); + { + Container c(arr10, arr10 + 10); + c.insert(arr10a[0]); + ok = check_construct_destroy("Insert element", buckets+11, 0) && ok; + } + ok = check_construct_destroy("Insert element", buckets+11, buckets+11) && ok; + + tracker_allocator_counter::reset(); + { + Container c(arr10, arr10 + 10); + c.insert(arr10a, arr10a+3); + ok = check_construct_destroy("Insert short range", buckets+13, 0) && ok; + } + ok = check_construct_destroy("Insert short range", buckets+13, buckets+13) && ok; + + tracker_allocator_counter::reset(); + { + Container c(arr10, arr10 + 10); + c.insert(arr10a, arr10a+10); + ok = check_construct_destroy("Insert long range", buckets+20, 0) && ok; + } + ok = check_construct_destroy("Insert long range", buckets+20, buckets+20) && ok; + + return ok ? 0 : 1; +} + diff --git a/libstdc++-v3/testsuite/backward/hash_set/requirements/explicit_instantiation.cc b/libstdc++-v3/testsuite/backward/hash_set/requirements/explicit_instantiation.cc new file mode 100644 index 000000000..a2a1cbfb3 --- /dev/null +++ b/libstdc++-v3/testsuite/backward/hash_set/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_set> + +template class __gnu_cxx::hash_set<int>; |