forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
69 lines
1.6 KiB
C++
69 lines
1.6 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
|
|
|
|
// template <class InputIterator>
|
|
// map(InputIterator first, InputIterator last);
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
|
|
#include "min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
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
|
|
}
|