X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Ftestsuite%2Fbackward%2Fhash_map%2F1.cc;fp=libstdc%2B%2B-v3%2Ftestsuite%2Fbackward%2Fhash_map%2F1.cc;h=cf05e555b49342d9b084950c98607f6a16e691f5;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git
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 00000000..cf05e555
--- /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
+// .
+
+// hash_map (SGI extension)
+
+#include
+#include
+#include
+#include
+
+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 struct hash
+ {
+ size_t operator()(const T *const & s) const
+ { return reinterpret_cast(s); }
+ };
+
+ template<> struct hash
+ {
+ size_t operator()(const string &s) const { return hash_string(s.c_str()); }
+ };
+
+ template<> struct hash
+ {
+ size_t operator()(const string &s) const { return hash_string(s.c_str()); }
+ };
+
+ template struct hash >
+ {
+ hash __fh;
+ hash __sh;
+ size_t operator()(const pair &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 a;
+ hash_map b;
+
+ vector > 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;
+}