forked from OSchip/llvm-project
71 lines
1.7 KiB
C++
71 lines
1.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <map>
|
|
|
|
// class map
|
|
|
|
// template <class InputIterator>
|
|
// map(InputIterator first, InputIterator last);
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "min_allocator.h"
|
|
|
|
int main(int, char**)
|
|
{
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
V ar[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 1.5),
|
|
V(1, 2),
|
|
V(2, 1),
|
|
V(2, 1.5),
|
|
V(2, 2),
|
|
V(3, 1),
|
|
V(3, 1.5),
|
|
V(3, 2),
|
|
};
|
|
std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
assert(m.size() == 3);
|
|
assert(distance(m.begin(), m.end()) == 3);
|
|
assert(*m.begin() == V(1, 1));
|
|
assert(*next(m.begin()) == V(2, 1));
|
|
assert(*next(m.begin(), 2) == V(3, 1));
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
V ar[] =
|
|
{
|
|
V(1, 1),
|
|
V(1, 1.5),
|
|
V(1, 2),
|
|
V(2, 1),
|
|
V(2, 1.5),
|
|
V(2, 2),
|
|
V(3, 1),
|
|
V(3, 1.5),
|
|
V(3, 2),
|
|
};
|
|
std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
assert(m.size() == 3);
|
|
assert(distance(m.begin(), m.end()) == 3);
|
|
assert(*m.begin() == V(1, 1));
|
|
assert(*next(m.begin()) == V(2, 1));
|
|
assert(*next(m.begin(), 2) == V(3, 1));
|
|
}
|
|
#endif
|
|
|
|
return 0;
|
|
}
|