1// { dg-do run }
2
3// 2005-2-17  Matt Austern  <austern@apple.com>
4//
5// Copyright (C) 2005-2015 Free Software Foundation, Inc.
6//
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)
11// any later version.
12//
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.
17//
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/>.
21
22// 6.3.4.3 unordered_set
23// range insert
24
25#include <string>
26#include <iterator>
27#include <algorithm>
28#include <tr1/unordered_set>
29#include <testsuite_hooks.h>
30
31bool test __attribute__((unused)) = true;
32
33void test01()
34{
35  typedef std::tr1::unordered_set<std::string> Set;
36  Set s;
37  VERIFY(s.empty());
38
39  const int N = 10;
40  const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
41			     "magenta", "yellow", "orange", "pink", "gray" };
42
43  s.insert(A+0, A+N);
44  VERIFY(s.size() == static_cast<unsigned int>(N));
45  VERIFY(std::distance(s.begin(), s.end()) == N);
46
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());
51  }
52}
53
54void test02()
55{
56  typedef std::tr1::unordered_set<int> Set;
57  Set s;
58  VERIFY(s.empty());
59
60  const int N = 8;
61  const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
62
63  s.insert(A+0, A+N);
64  VERIFY(s.size() == 6);
65  VERIFY(std::distance(s.begin(), s.end()) == 6);
66
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);
73}
74
75int main()
76{
77  test01();
78  test02();
79  return 0;
80}
81