blob: 964738b4a68aa99385851578ec9846288b8ba08a [file] [log] [blame]
 //===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // class map // template // void insert(InputIterator first, InputIterator last); #include #include #include "test_iterators.h" #include "min_allocator.h" int main() { { typedef std::map M; typedef std::pair P; P ar[] = { P(1, 1), P(1, 1.5), P(1, 2), P(2, 1), P(2, 1.5), P(2, 2), P(3, 1), P(3, 1.5), P(3, 2), }; M m; m.insert(input_iterator(ar), input_iterator(ar + sizeof(ar)/sizeof(ar[0]))); assert(m.size() == 3); assert(m.begin()->first == 1); assert(m.begin()->second == 1); assert(next(m.begin())->first == 2); assert(next(m.begin())->second == 1); assert(next(m.begin(), 2)->first == 3); assert(next(m.begin(), 2)->second == 1); } #if __cplusplus >= 201103L { typedef std::map, min_allocator>> M; typedef std::pair P; P ar[] = { P(1, 1), P(1, 1.5), P(1, 2), P(2, 1), P(2, 1.5), P(2, 2), P(3, 1), P(3, 1.5), P(3, 2), }; M m; m.insert(input_iterator(ar), input_iterator(ar + sizeof(ar)/sizeof(ar[0]))); assert(m.size() == 3); assert(m.begin()->first == 1); assert(m.begin()->second == 1); assert(next(m.begin())->first == 2); assert(next(m.begin())->second == 1); assert(next(m.begin(), 2)->first == 3); assert(next(m.begin(), 2)->second == 1); } #endif }