1 // Copyright (C) 2002 Free Software Foundation, Inc.
2 //
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 2, or (at your option)
7 // any later version.
8
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING. If not, write to the Free
16 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
17 // USA.
18
19 // hash_map (SGI extension)
20
21 #include <cstdlib>
22 #include <string>
23 #include <ext/hash_map>
24 #include <testsuite_hooks.h>
25
26 using namespace std;
27 using namespace __gnu_cxx;
28
29 namespace __gnu_cxx
30 {
hash_string(const char * s)31 inline size_t hash_string(const char* s)
32 {
33 unsigned long h;
34 for (h=0; *s; ++s) {
35 h = 5*h + *s;
36 }
37 return size_t(h);
38 }
39
40 template<class T> struct hash<T *>
41 {
operator ()__gnu_cxx::hash42 size_t operator()(const T *const & s) const
43 { return reinterpret_cast<size_t>(s); }
44 };
45
46 template<> struct hash<string>
47 {
operator ()__gnu_cxx::hash48 size_t operator()(const string &s) const { return hash_string(s.c_str()); }
49 };
50
51 template<> struct hash<const string>
52 {
operator ()__gnu_cxx::hash53 size_t operator()(const string &s) const { return hash_string(s.c_str()); }
54 };
55
56 template<class T1, class T2> struct hash<pair<T1,T2> >
57 {
58 hash<T1> __fh;
59 hash<T2> __sh;
operator ()__gnu_cxx::hash60 size_t operator()(const pair<T1,T2> &p) const {
61 return __fh(p.first) ^ __sh(p.second);
62 }
63 };
64 }
65
66
67 const int Size = 5;
68
test01()69 void test01()
70 {
71 bool test = true;
72
73 for (int i = 0; i < 10; i++)
74 {
75 hash_map<string,int> a;
76 hash_map<string,int> b;
77
78 vector<pair<string,int> > contents (Size);
79 for (int j = 0; j < Size; j++)
80 {
81 string s;
82 for (int k = 0; k < 10; k++)
83 {
84 s += 'a' + (rand() % 26);
85 }
86 contents[j] = make_pair(s,j);
87 }
88 for (int j = 0; j < Size; j++)
89 {
90 a[contents[j].first] = contents[j].second;
91 int k = Size - 1 - j;
92 b[contents[k].first] = contents[k].second;
93 }
94 VERIFY( a == b );
95 }
96 }
97
main()98 int main()
99 {
100 test01();
101 return 0;
102 }
103