]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/tr1/6_containers/unordered/swap/unordered_map/1.cc
d379774926d2cb6d15b6228af44f87d4491516d0
1 // 2005-12-20 Paolo Carlini <pcarlini@suse.de>
3 // Copyright (C) 2005 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // 6.3.4.4 unordered_map::swap
23 #include <tr1/unordered_map>
25 #include <testsuite_hooks.h>
26 #include <testsuite_allocator.h>
28 // uneq_allocator as a non-empty allocator.
32 bool test
__attribute__((unused
)) = true;
36 typedef pair
<const char, int> my_pair
;
37 typedef __gnu_test::uneq_allocator
<my_pair
> my_alloc
;
38 typedef unordered_map
<char, int, hash
<char>, equal_to
<char>, my_alloc
>
41 const char title01
[] = "Rivers of sand";
42 const char title02
[] = "Concret PH";
43 const char title03
[] = "Sonatas and Interludes for Prepared Piano";
44 const char title04
[] = "never as tired as when i'm waking up";
46 const size_t N1
= sizeof(title01
);
47 const size_t N2
= sizeof(title02
);
48 const size_t N3
= sizeof(title03
);
49 const size_t N4
= sizeof(title04
);
51 typedef map
<char, int> my_map
;
53 for (size_t i
= 0; i
< N1
; ++i
)
54 map01_ref
.insert(my_pair(title01
[i
], i
));
56 for (size_t i
= 0; i
< N2
; ++i
)
57 map02_ref
.insert(my_pair(title02
[i
], i
));
59 for (size_t i
= 0; i
< N3
; ++i
)
60 map03_ref
.insert(my_pair(title03
[i
], i
));
62 for (size_t i
= 0; i
< N4
; ++i
)
63 map04_ref
.insert(my_pair(title04
[i
], i
));
65 my_umap::size_type size01
, size02
;
69 my_umap
umap01(10, hash
<char>(), equal_to
<char>(), alloc01
);
70 size01
= umap01
.size();
71 my_umap
umap02(10, hash
<char>(), equal_to
<char>(), alloc01
);
72 size02
= umap02
.size();
75 VERIFY( umap01
.size() == size02
);
76 VERIFY( umap01
.empty() );
77 VERIFY( umap02
.size() == size01
);
78 VERIFY( umap02
.empty() );
80 my_umap
umap03(10, hash
<char>(), equal_to
<char>(), alloc01
);
81 size01
= umap03
.size();
82 my_umap
umap04(map02_ref
.begin(), map02_ref
.end(), 10, hash
<char>(),
83 equal_to
<char>(), alloc01
);
84 size02
= umap04
.size();
87 VERIFY( umap03
.size() == size02
);
88 VERIFY( my_map(umap03
.begin(), umap03
.end()) == map02_ref
);
89 VERIFY( umap04
.size() == size01
);
90 VERIFY( umap04
.empty() );
92 my_umap
umap05(map01_ref
.begin(), map01_ref
.end(), 10, hash
<char>(),
93 equal_to
<char>(), alloc01
);
94 size01
= umap05
.size();
95 my_umap
umap06(map02_ref
.begin(), map02_ref
.end(), 10, hash
<char>(),
96 equal_to
<char>(), alloc01
);
97 size02
= umap06
.size();
100 VERIFY( umap05
.size() == size02
);
101 VERIFY( my_map(umap05
.begin(), umap05
.end()) == map02_ref
);
102 VERIFY( umap06
.size() == size01
);
103 VERIFY( my_map(umap06
.begin(), umap06
.end()) == map01_ref
);
105 my_umap
umap07(map01_ref
.begin(), map01_ref
.end(), 10, hash
<char>(),
106 equal_to
<char>(), alloc01
);
107 size01
= umap07
.size();
108 my_umap
umap08(map03_ref
.begin(), map03_ref
.end(), 10, hash
<char>(),
109 equal_to
<char>(), alloc01
);
110 size02
= umap08
.size();
113 VERIFY( umap07
.size() == size02
);
114 VERIFY( my_map(umap07
.begin(), umap07
.end()) == map03_ref
);
115 VERIFY( umap08
.size() == size01
);
116 VERIFY( my_map(umap08
.begin(), umap08
.end()) == map01_ref
);
118 my_umap
umap09(map03_ref
.begin(), map03_ref
.end(), 10, hash
<char>(),
119 equal_to
<char>(), alloc01
);
120 size01
= umap09
.size();
121 my_umap
umap10(map04_ref
.begin(), map04_ref
.end(), 10, hash
<char>(),
122 equal_to
<char>(), alloc01
);
123 size02
= umap10
.size();
126 VERIFY( umap09
.size() == size02
);
127 VERIFY( my_map(umap09
.begin(), umap09
.end()) == map04_ref
);
128 VERIFY( umap10
.size() == size01
);
129 VERIFY( my_map(umap10
.begin(), umap10
.end()) == map03_ref
);
131 my_umap
umap11(map04_ref
.begin(), map04_ref
.end(), 10, hash
<char>(),
132 equal_to
<char>(), alloc01
);
133 size01
= umap11
.size();
134 my_umap
umap12(map01_ref
.begin(), map01_ref
.end(), 10, hash
<char>(),
135 equal_to
<char>(), alloc01
);
136 size02
= umap12
.size();
139 VERIFY( umap11
.size() == size02
);
140 VERIFY( my_map(umap11
.begin(), umap11
.end()) == map01_ref
);
141 VERIFY( umap12
.size() == size01
);
142 VERIFY( my_map(umap12
.begin(), umap12
.end()) == map04_ref
);
144 my_umap
umap13(map03_ref
.begin(), map03_ref
.end(), 10, hash
<char>(),
145 equal_to
<char>(), alloc01
);
146 size01
= umap13
.size();
147 my_umap
umap14(map03_ref
.begin(), map03_ref
.end(), 10, hash
<char>(),
148 equal_to
<char>(), alloc01
);
149 size02
= umap14
.size();
152 VERIFY( umap13
.size() == size02
);
153 VERIFY( my_map(umap13
.begin(), umap13
.end()) == map03_ref
);
154 VERIFY( umap14
.size() == size01
);
155 VERIFY( my_map(umap14
.begin(), umap14
.end()) == map03_ref
);