1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// UNSUPPORTED: c++98, c++03
11
12// <map>
13
14// class map
15
16// map(initializer_list<value_type> il, const key_compare& comp);
17
18#include <map>
19#include <cassert>
20#include "../../../test_compare.h"
21#include "min_allocator.h"
22
23int main()
24{
25    {
26    typedef std::pair<const int, double> V;
27    typedef test_compare<std::less<int> > C;
28    std::map<int, double, C> m({
29                                {1, 1},
30                                {1, 1.5},
31                                {1, 2},
32                                {2, 1},
33                                {2, 1.5},
34                                {2, 2},
35                                {3, 1},
36                                {3, 1.5},
37                                {3, 2}
38                               }, C(3));
39    assert(m.size() == 3);
40    assert(distance(m.begin(), m.end()) == 3);
41    assert(*m.begin() == V(1, 1));
42    assert(*next(m.begin()) == V(2, 1));
43    assert(*next(m.begin(), 2) == V(3, 1));
44    assert(m.key_comp() == C(3));
45    }
46    {
47    typedef std::pair<const int, double> V;
48    typedef test_compare<std::less<int> > C;
49    std::map<int, double, C, min_allocator<std::pair<const int, double>>> m({
50                                {1, 1},
51                                {1, 1.5},
52                                {1, 2},
53                                {2, 1},
54                                {2, 1.5},
55                                {2, 2},
56                                {3, 1},
57                                {3, 1.5},
58                                {3, 2}
59                               }, C(3));
60    assert(m.size() == 3);
61    assert(distance(m.begin(), m.end()) == 3);
62    assert(*m.begin() == V(1, 1));
63    assert(*next(m.begin()) == V(2, 1));
64    assert(*next(m.begin(), 2) == V(3, 1));
65    assert(m.key_comp() == C(3));
66    }
67}
68