xref: /llvm-project/libcxx/test/std/containers/associative/multiset/multiset.cons/iter_iter_comp.pass.cpp (revision 5ffe11a9fccfffbabbea5bbcc1cfd4b21af6d631)
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 //     multiset(InputIterator first, InputIterator last, const value_compare& comp);
15 
16 #include <set>
17 #include <cassert>
18 
19 #include "test_macros.h"
20 #include "test_iterators.h"
21 #include "../../../test_compare.h"
22 
main(int,char **)23 int main(int, char**)
24 {
25     typedef int V;
26     V ar[] =
27     {
28         1,
29         1,
30         1,
31         2,
32         2,
33         2,
34         3,
35         3,
36         3
37     };
38     typedef test_less<V> C;
39     std::multiset<V, C> m(cpp17_input_iterator<const V*>(ar),
40                      cpp17_input_iterator<const V*>(ar+sizeof(ar)/sizeof(ar[0])), C(5));
41     assert(m.value_comp() == C(5));
42     assert(m.size() == 9);
43     assert(std::distance(m.begin(), m.end()) == 9);
44     assert(*std::next(m.begin(), 0) == 1);
45     assert(*std::next(m.begin(), 1) == 1);
46     assert(*std::next(m.begin(), 2) == 1);
47     assert(*std::next(m.begin(), 3) == 2);
48     assert(*std::next(m.begin(), 4) == 2);
49     assert(*std::next(m.begin(), 5) == 2);
50     assert(*std::next(m.begin(), 6) == 3);
51     assert(*std::next(m.begin(), 7) == 3);
52     assert(*std::next(m.begin(), 8) == 3);
53 
54   return 0;
55 }
56