projects / thirdparty / gcc.git / blame
| Commit | Line | Data |
|---|---|---|
| 52a7e4c6 MA |
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, 59 Temple Place - Suite 330, Boston, MA 02111-1307, | |
| 21 | // USA. | |
| 22 | ||
| 23 | // 6.3.4.4 unordered_map | |
| 24 | // range insert | |
| 25 | ||
| 26 | #include <string> | |
| 27 | #include <iterator> | |
| 28 | #include <algorithm> | |
| 29 | #include <tr1/unordered_map> | |
| 30 | #include "testsuite_hooks.h" | |
| 31 | ||
| 32 | bool test __attribute__((unused)) = true; | |
| 33 | ||
| 34 | void test01() | |
| 35 | { | |
| 36 | typedef std::tr1::unordered_map<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 | VERIFY(m["red"] == 5); | |
| 56 | VERIFY(m["green"] == 9); | |
| 57 | VERIFY(m["blue"] == 3); | |
| 58 | VERIFY(m["cyan"] == 8); | |
| 59 | VERIFY(m["magenta"] == 7); | |
| 60 | } | |
| 61 | ||
| 62 | void test02() | |
| 63 | { | |
| 64 | typedef std::tr1::unordered_map<std::string, int> Map; | |
| 65 | typedef std::pair<const std::string, int> Pair; | |
| 66 | ||
| 67 | Map m; | |
| 68 | VERIFY(m.empty()); | |
| 69 | ||
| 70 | Pair A[9] = | |
| 71 | { | |
| 72 | Pair("red", 5), | |
| 73 | Pair("green", 9), | |
| 74 | Pair("red", 19), | |
| 75 | Pair("blue", 3), | |
| 76 | Pair("blue", 60), | |
| 77 | Pair("cyan", 8), | |
| 78 | Pair("magenta", 7), | |
| 79 | Pair("blue", 99), | |
| 80 | Pair("green", 33) | |
| 81 | }; | |
| 82 | ||
| 83 | m.insert(A+0, A+9); | |
| 84 | VERIFY(m.size() == 5); | |
| 85 | VERIFY(std::distance(m.begin(), m.end()) == 5); | |
| 86 | ||
| 87 | VERIFY(m["red"] == 5); | |
| 88 | VERIFY(m["green"] == 9); | |
| 89 | VERIFY(m["blue"] == 3); | |
| 90 | VERIFY(m["cyan"] == 8); | |
| 91 | VERIFY(m["magenta"] == 7); | |
| 92 | } | |
| 93 | ||
| 94 | int main() | |
| 95 | { | |
| 96 | test01(); | |
| 97 | test02(); | |
| 98 | return 0; | |
| 99 | } |