1// { dg-do run } 2 3// 2005-2-17 Matt Austern <austern@apple.com> 4// 5// Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free 20// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, 21// USA. 22 23// 6.3.4.6 unordered_multimap 24// range insert 25 26#include <string> 27#include <iterator> 28#include <algorithm> 29#include <tr1/unordered_map> 30#include "testsuite_hooks.h" 31 32bool test __attribute__((unused)) = true; 33 34void test01() 35{ 36 typedef std::tr1::unordered_multimap<std::string, int> Map; 37 typedef std::pair<const std::string, int> Pair; 38 39 Map m; 40 VERIFY(m.empty()); 41 42 Pair A[5] = 43 { 44 Pair("red", 5), 45 Pair("green", 9), 46 Pair("blue", 3), 47 Pair("cyan", 8), 48 Pair("magenta", 7) 49 }; 50 51 m.insert(A+0, A+5); 52 VERIFY(m.size() == 5); 53 VERIFY(std::distance(m.begin(), m.end()) == 5); 54 55 for (int i = 0; i < 5; ++i) 56 VERIFY(std::find(m.begin(), m.end(), A[i]) != m.end()); 57} 58 59void test02() 60{ 61 typedef std::tr1::unordered_multimap<std::string, int> Map; 62 typedef std::pair<const std::string, int> Pair; 63 64 Map m; 65 VERIFY(m.empty()); 66 67 Pair A[9] = 68 { 69 Pair("red", 5), 70 Pair("green", 9), 71 Pair("red", 19), 72 Pair("blue", 3), 73 Pair("blue", 60), 74 Pair("cyan", 8), 75 Pair("magenta", 7), 76 Pair("blue", 99), 77 Pair("green", 33) 78 }; 79 80 m.insert(A+0, A+9); 81 VERIFY(m.size() == 9); 82 VERIFY(std::distance(m.begin(), m.end()) == 9); 83 84 for (int i = 0; i < 9; ++i) 85 VERIFY(std::find(m.begin(), m.end(), A[i]) != m.end()); 86} 87 88int main() 89{ 90 test01(); 91 test02(); 92 return 0; 93} 94