| //===----------------------------------------------------------------------===// |
| // |
| // The LLVM Compiler Infrastructure |
| // |
| // This file is dual licensed under the MIT and the University of Illinois Open |
| // Source Licenses. See LICENSE.TXT for details. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <unordered_map> |
| |
| // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
| // class Alloc = allocator<pair<const Key, T>>> |
| // class unordered_map |
| |
| // template <class InputIterator> |
| // void insert(InputIterator first, InputIterator last); |
| |
| #include <unordered_map> |
| #include <string> |
| #include <cassert> |
| |
| #include "test_iterators.h" |
| #include "min_allocator.h" |
| |
| int main() |
| { |
| { |
| typedef std::unordered_map<int, std::string> C; |
| typedef std::pair<int, std::string> P; |
| P a[] = |
| { |
| P(1, "one"), |
| P(2, "two"), |
| P(3, "three"), |
| P(4, "four"), |
| P(1, "four"), |
| P(2, "four"), |
| }; |
| C c; |
| c.insert(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); |
| assert(c.size() == 4); |
| assert(c.at(1) == "one"); |
| assert(c.at(2) == "two"); |
| assert(c.at(3) == "three"); |
| assert(c.at(4) == "four"); |
| } |
| #if TEST_STD_VER >= 11 |
| { |
| typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, |
| min_allocator<std::pair<const int, std::string>>> C; |
| typedef std::pair<int, std::string> P; |
| P a[] = |
| { |
| P(1, "one"), |
| P(2, "two"), |
| P(3, "three"), |
| P(4, "four"), |
| P(1, "four"), |
| P(2, "four"), |
| }; |
| C c; |
| c.insert(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); |
| assert(c.size() == 4); |
| assert(c.at(1) == "one"); |
| assert(c.at(2) == "two"); |
| assert(c.at(3) == "three"); |
| assert(c.at(4) == "four"); |
| } |
| #endif |
| } |