Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <unordered_map> |
| 11 | |
| 12 | // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
| 13 | // class Alloc = allocator<pair<const Key, T>>> |
| 14 | // class unordered_map |
| 15 | |
| 16 | // void insert(initializer_list<value_type> il); |
| 17 | |
| 18 | #include <unordered_map> |
| 19 | #include <string> |
| 20 | #include <cassert> |
| 21 | |
| 22 | #include "../../../iterators.h" |
| 23 | |
| 24 | int main() |
| 25 | { |
| 26 | #ifdef _LIBCPP_MOVE |
| 27 | { |
| 28 | typedef std::unordered_map<int, std::string> C; |
| 29 | typedef std::pair<int, std::string> P; |
| 30 | C c; |
| 31 | c.insert( |
| 32 | { |
| 33 | P(1, "one"), |
| 34 | P(2, "two"), |
| 35 | P(3, "three"), |
| 36 | P(4, "four"), |
| 37 | P(1, "four"), |
| 38 | P(2, "four"), |
| 39 | } |
| 40 | ); |
| 41 | assert(c.size() == 4); |
| 42 | assert(c.at(1) == "one"); |
| 43 | assert(c.at(2) == "two"); |
| 44 | assert(c.at(3) == "three"); |
| 45 | assert(c.at(4) == "four"); |
| 46 | } |
Howard Hinnant | 6046ace | 2010-08-22 00:15:28 +0000 | [diff] [blame] | 47 | #endif // _LIBCPP_MOVE |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 48 | } |