4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
69 lines
2.2 KiB
C++
69 lines
2.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <map>
|
|
|
|
// class map
|
|
|
|
// map(initializer_list<value_type> il, const key_compare& comp);
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
#include "../../../test_compare.h"
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
typedef test_compare<std::less<int> > C;
|
|
std::map<int, double, C> m({
|
|
{1, 1},
|
|
{1, 1.5},
|
|
{1, 2},
|
|
{2, 1},
|
|
{2, 1.5},
|
|
{2, 2},
|
|
{3, 1},
|
|
{3, 1.5},
|
|
{3, 2}
|
|
}, C(3));
|
|
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));
|
|
assert(m.key_comp() == C(3));
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::pair<const int, double> V;
|
|
typedef test_compare<std::less<int> > C;
|
|
std::map<int, double, C, min_allocator<std::pair<const int, double>>> m({
|
|
{1, 1},
|
|
{1, 1.5},
|
|
{1, 2},
|
|
{2, 1},
|
|
{2, 1.5},
|
|
{2, 2},
|
|
{3, 1},
|
|
{3, 1.5},
|
|
{3, 2}
|
|
}, C(3));
|
|
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));
|
|
assert(m.key_comp() == C(3));
|
|
}
|
|
#endif
|
|
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
|
}
|