xref: /llvm-project/libcxx/test/std/containers/associative/map/map.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 // <map>
10 
11 // class map
12 
13 // template <class InputIterator>
14 //     map(InputIterator first, InputIterator last, const key_compare& comp);
15 
16 #include <map>
17 #include <cassert>
18 
19 #include "test_macros.h"
20 #include "../../../test_compare.h"
21 #include "min_allocator.h"
22 
main(int,char **)23 int main(int, char**)
24 {
25     {
26     typedef std::pair<const int, double> V;
27     V ar[] =
28     {
29         V(1, 1),
30         V(1, 1.5),
31         V(1, 2),
32         V(2, 1),
33         V(2, 1.5),
34         V(2, 2),
35         V(3, 1),
36         V(3, 1.5),
37         V(3, 2),
38     };
39     typedef test_less<int> C;
40     std::map<int, double, C> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5));
41     assert(m.key_comp() == C(5));
42     assert(m.size() == 3);
43     assert(std::distance(m.begin(), m.end()) == 3);
44     assert(*m.begin() == V(1, 1));
45     assert(*std::next(m.begin()) == V(2, 1));
46     assert(*std::next(m.begin(), 2) == V(3, 1));
47     }
48 #if TEST_STD_VER >= 11
49     {
50     typedef std::pair<const int, double> V;
51     V ar[] =
52     {
53         V(1, 1),
54         V(1, 1.5),
55         V(1, 2),
56         V(2, 1),
57         V(2, 1.5),
58         V(2, 2),
59         V(3, 1),
60         V(3, 1.5),
61         V(3, 2),
62     };
63     typedef test_less<int> C;
64     std::map<int, double, C, min_allocator<std::pair<const int, double>>> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5));
65     assert(m.key_comp() == C(5));
66     assert(m.size() == 3);
67     assert(std::distance(m.begin(), m.end()) == 3);
68     assert(*m.begin() == V(1, 1));
69     assert(*std::next(m.begin()) == V(2, 1));
70     assert(*std::next(m.begin(), 2) == V(3, 1));
71     }
72 #endif
73 
74   return 0;
75 }
76