//===----------------------------------------------------------------------===// // // 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 multimap // template // multimap(InputIterator first, InputIterator last, // const key_compare& comp); #include #include #include "../../../test_compare.h" #include "min_allocator.h" int main() { { typedef std::pair V; V ar[] = { V(1, 1), V(1, 1.5), V(1, 2), V(2, 1), V(2, 1.5), V(2, 2), V(3, 1), V(3, 1.5), V(3, 2), }; typedef test_compare > C; std::multimap m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5)); assert(m.key_comp() == C(5)); assert(m.size() == 9); assert(distance(m.begin(), m.end()) == 9); assert(*m.begin() == V(1, 1)); assert(*next(m.begin()) == V(1, 1.5)); assert(*next(m.begin(), 2) == V(1, 2)); assert(*next(m.begin(), 3) == V(2, 1)); assert(*next(m.begin(), 4) == V(2, 1.5)); assert(*next(m.begin(), 5) == V(2, 2)); assert(*next(m.begin(), 6) == V(3, 1)); assert(*next(m.begin(), 7) == V(3, 1.5)); assert(*next(m.begin(), 8) == V(3, 2)); } #if __cplusplus >= 201103L { typedef std::pair V; V ar[] = { V(1, 1), V(1, 1.5), V(1, 2), V(2, 1), V(2, 1.5), V(2, 2), V(3, 1), V(3, 1.5), V(3, 2), }; typedef test_compare > C; std::multimap> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5)); assert(m.key_comp() == C(5)); assert(m.size() == 9); assert(distance(m.begin(), m.end()) == 9); assert(*m.begin() == V(1, 1)); assert(*next(m.begin()) == V(1, 1.5)); assert(*next(m.begin(), 2) == V(1, 2)); assert(*next(m.begin(), 3) == V(2, 1)); assert(*next(m.begin(), 4) == V(2, 1.5)); assert(*next(m.begin(), 5) == V(2, 2)); assert(*next(m.begin(), 6) == V(3, 1)); assert(*next(m.begin(), 7) == V(3, 1.5)); assert(*next(m.begin(), 8) == V(3, 2)); } #endif }