llvm-project

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);
15

16
#include <map>
17
#include <cassert>
18

19
#include "test_macros.h"
20
#include "min_allocator.h"
21

22
int main(int, char**)
23
{
24
    {
25
    typedef std::pair<const int, double> V;
26
    V ar[] =
27
    {
28
        V(1, 1),
29
        V(1, 1.5),
30
        V(1, 2),
31
        V(2, 1),
32
        V(2, 1.5),
33
        V(2, 2),
34
        V(3, 1),
35
        V(3, 1.5),
36
        V(3, 2),
37
    };
38
    std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
39
    assert(m.size() == 3);
40
    assert(std::distance(m.begin(), m.end()) == 3);
41
    assert(*m.begin() == V(1, 1));
42
    assert(*std::next(m.begin()) == V(2, 1));
43
    assert(*std::next(m.begin(), 2) == V(3, 1));
44
    }
45
#if TEST_STD_VER >= 11
46
    {
47
    typedef std::pair<const int, double> V;
48
    V ar[] =
49
    {
50
        V(1, 1),
51
        V(1, 1.5),
52
        V(1, 2),
53
        V(2, 1),
54
        V(2, 1.5),
55
        V(2, 2),
56
        V(3, 1),
57
        V(3, 1.5),
58
        V(3, 2),
59
    };
60
    std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
61
    assert(m.size() == 3);
62
    assert(std::distance(m.begin(), m.end()) == 3);
63
    assert(*m.begin() == V(1, 1));
64
    assert(*std::next(m.begin()) == V(2, 1));
65
    assert(*std::next(m.begin(), 2) == V(3, 1));
66
    }
67
#endif
68

69
  return 0;
70
}
71