1 //===----------------------------------------------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 // <set> 10 11 // class multiset 12 13 // template <class InputIterator> 14 // void insert(InputIterator first, InputIterator last); 15 16 #include <set> 17 #include <cassert> 18 19 #include "test_iterators.h" 20 #include "min_allocator.h" 21 22 int main(int, char**) 23 { 24 { 25 typedef std::multiset<int> M; 26 typedef int V; 27 V ar[] = 28 { 29 1, 30 1, 31 1, 32 2, 33 2, 34 2, 35 3, 36 3, 37 3 38 }; 39 M m; 40 m.insert(input_iterator<const V*>(ar), 41 input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0]))); 42 assert(m.size() == 9); 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 1); 45 assert(*next(m.begin(), 2) == 1); 46 assert(*next(m.begin(), 3) == 2); 47 assert(*next(m.begin(), 4) == 2); 48 assert(*next(m.begin(), 5) == 2); 49 assert(*next(m.begin(), 6) == 3); 50 assert(*next(m.begin(), 7) == 3); 51 assert(*next(m.begin(), 8) == 3); 52 } 53 #if TEST_STD_VER >= 11 54 { 55 typedef std::multiset<int, std::less<int>, min_allocator<int>> M; 56 typedef int V; 57 V ar[] = 58 { 59 1, 60 1, 61 1, 62 2, 63 2, 64 2, 65 3, 66 3, 67 3 68 }; 69 M m; 70 m.insert(input_iterator<const V*>(ar), 71 input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0]))); 72 assert(m.size() == 9); 73 assert(*next(m.begin(), 0) == 1); 74 assert(*next(m.begin(), 1) == 1); 75 assert(*next(m.begin(), 2) == 1); 76 assert(*next(m.begin(), 3) == 2); 77 assert(*next(m.begin(), 4) == 2); 78 assert(*next(m.begin(), 5) == 2); 79 assert(*next(m.begin(), 6) == 3); 80 assert(*next(m.begin(), 7) == 3); 81 assert(*next(m.begin(), 8) == 3); 82 } 83 #endif 84 85 return 0; 86 } 87