projects / thirdparty / gcc.git / blame
| Commit | Line | Data |
|---|---|---|
| 180ecd6a MA |
1 | // { dg-do run } |
| 2 | ||
| 3 | // 2005-2-17 Matt Austern <austern@apple.com> | |
| 4 | // | |
| aa118a03 | 5 | // Copyright (C) 2005-2014 Free Software Foundation, Inc. |
| 180ecd6a MA |
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 | |
| 748086b7 | 10 | // Free Software Foundation; either version 3, or (at your option) |
| 180ecd6a MA |
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 | |
| 748086b7 JJ |
19 | // with this library; see the file COPYING3. If not see |
| 20 | // <http://www.gnu.org/licenses/>. | |
| 180ecd6a MA |
21 | |
| 22 | // 6.3.4.6 unordered_multimap | |
| 23 | // Single-element insert | |
| 24 | ||
| 25 | #include <string> | |
| 26 | #include <iterator> | |
| 27 | #include <tr1/unordered_map> | |
| 28 | #include "testsuite_hooks.h" | |
| 29 | ||
| 30 | bool test __attribute__((unused)) = true; | |
| 31 | ||
| 32 | void test01() | |
| 33 | { | |
| 34 | typedef std::tr1::unordered_multimap<std::string, int> Map; | |
| 35 | typedef std::pair<const std::string, int> Pair; | |
| 36 | ||
| 37 | Map m; | |
| 38 | VERIFY(m.empty()); | |
| 39 | ||
| 40 | Map::iterator i = m.insert(Pair("abcde", 3)); | |
| 41 | VERIFY(m.size() == 1); | |
| 42 | VERIFY(std::distance(m.begin(), m.end()) == 1); | |
| 43 | VERIFY(i == m.begin()); | |
| 44 | VERIFY(i->first == "abcde"); | |
| 45 | VERIFY(i->second == 3); | |
| 46 | } | |
| 47 | ||
| 48 | void test02() | |
| 49 | { | |
| 50 | typedef std::tr1::unordered_multimap<std::string, int> Map; | |
| 51 | typedef std::pair<const std::string, int> Pair; | |
| 52 | ||
| 53 | Map m; | |
| 54 | VERIFY(m.empty()); | |
| 55 | ||
| 56 | m.insert(Pair("abcde", 3)); | |
| 57 | m.insert(Pair("abcde", 7)); | |
| 58 | ||
| 59 | VERIFY(m.size() == 2); | |
| 60 | VERIFY(std::distance(m.begin(), m.end()) == 2); | |
| 61 | ||
| 62 | Map::iterator i1 = m.begin(); | |
| 63 | Map::iterator i2 = i1; | |
| 64 | ++i2; | |
| 65 | ||
| 66 | VERIFY(i1->first == "abcde"); | |
| 67 | VERIFY(i2->first == "abcde"); | |
| 68 | VERIFY((i1->second == 3 && i2->second == 7) || | |
| 69 | (i1->second == 7 && i2->second == 3)); | |
| 70 | } | |
| 71 | ||
| 72 | int main() | |
| 73 | { | |
| 74 | test01(); | |
| 75 | test02(); | |
| 76 | return 0; | |
| 77 | } |