//===----------------------------------------------------------------------===// // // 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 multiset // template // multiset(InputIterator first, InputIterator last, // const value_compare& comp, const allocator_type& a); #include #include #include "test_iterators.h" #include "../../../test_compare.h" #include "test_allocator.h" int main() { typedef int V; V ar[] = { 1, 1, 1, 2, 2, 2, 3, 3, 3 }; typedef test_compare > C; typedef test_allocator A; std::multiset m(input_iterator(ar), input_iterator(ar+sizeof(ar)/sizeof(ar[0])), C(5), A(7)); assert(m.value_comp() == C(5)); assert(m.get_allocator() == A(7)); assert(m.size() == 9); assert(distance(m.begin(), m.end()) == 9); assert(*next(m.begin(), 0) == 1); assert(*next(m.begin(), 1) == 1); assert(*next(m.begin(), 2) == 1); assert(*next(m.begin(), 3) == 2); assert(*next(m.begin(), 4) == 2); assert(*next(m.begin(), 5) == 2); assert(*next(m.begin(), 6) == 3); assert(*next(m.begin(), 7) == 3); assert(*next(m.begin(), 8) == 3); #if _LIBCPP_STD_VER > 11 { typedef int V; V ar[] = { 1, 1, 1, 2, 2, 2, 3, 3, 3 }; typedef test_allocator A; typedef test_compare > C; A a; std::multiset m(ar, ar+sizeof(ar)/sizeof(ar[0]), a); assert(m.size() == 9); assert(distance(m.begin(), m.end()) == 9); assert(*next(m.begin(), 0) == 1); assert(*next(m.begin(), 1) == 1); assert(*next(m.begin(), 2) == 1); assert(*next(m.begin(), 3) == 2); assert(*next(m.begin(), 4) == 2); assert(*next(m.begin(), 5) == 2); assert(*next(m.begin(), 6) == 3); assert(*next(m.begin(), 7) == 3); assert(*next(m.begin(), 8) == 3); assert(m.get_allocator() == a); } #endif }