]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/tr1/6_containers/unordered_set/insert/set_range.cc
3 // 2005-2-17 Matt Austern <austern@apple.com>
5 // Copyright (C) 2005, 2009 Free Software Foundation, Inc.
7 // This file is part of the GNU ISO C++ Library. This library is free
8 // software; you can redistribute it and/or modify it under the
9 // terms of the GNU General Public License as published by the
10 // Free Software Foundation; either version 3, or (at your option)
13 // This library is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License along
19 // with this library; see the file COPYING3. If not see
20 // <http://www.gnu.org/licenses/>.
22 // 6.3.4.3 unordered_set
28 #include <tr1/unordered_set>
29 #include <testsuite_hooks.h>
31 bool test
__attribute__((unused
)) = true;
35 typedef std::tr1::unordered_set
<std::string
> Set
;
40 const std::string A
[N
] = { "red", "green", "blue", "violet", "cyan",
41 "magenta", "yellow", "orange", "pink", "gray" };
44 VERIFY(s
.size() == static_cast<unsigned int>(N
));
45 VERIFY(std::distance(s
.begin(), s
.end()) == N
);
47 for (int i
= 0; i
< N
; ++i
) {
48 std::string str
= A
[i
];
49 Set::iterator it
= std::find(s
.begin(), s
.end(), str
);
50 VERIFY(it
!= s
.end());
56 typedef std::tr1::unordered_set
<int> Set
;
61 const int A
[N
] = { 3, 7, 4, 8, 2, 4, 6, 7 };
64 VERIFY(s
.size() == 6);
65 VERIFY(std::distance(s
.begin(), s
.end()) == 6);
67 VERIFY(std::count(s
.begin(), s
.end(), 2) == 1);
68 VERIFY(std::count(s
.begin(), s
.end(), 3) == 1);
69 VERIFY(std::count(s
.begin(), s
.end(), 4) == 1);
70 VERIFY(std::count(s
.begin(), s
.end(), 6) == 1);
71 VERIFY(std::count(s
.begin(), s
.end(), 7) == 1);
72 VERIFY(std::count(s
.begin(), s
.end(), 8) == 1);