//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator>> // class unordered_map // template // void insert(InputIterator first, InputIterator last); #include #include #include #include "test_iterators.h" #include "min_allocator.h" int main() { { typedef std::unordered_map C; typedef std::pair 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(a), input_iterator(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 __cplusplus >= 201103L { typedef std::unordered_map, std::equal_to, min_allocator>> C; typedef std::pair 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(a), input_iterator(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 }