50 lines
1.3 KiB
C++
50 lines
1.3 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
|
//
|
|||
|
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
|
// License. See LICENSE.TXT for details.
|
|||
|
|
//
|
|||
|
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|
|||
|
|
// <map>
|
|||
|
|
|
|||
|
|
// class map
|
|||
|
|
|
|||
|
|
// template <class InputIterator>
|
|||
|
|
// map(InputIterator first, InputIterator last,
|
|||
|
|
// const key_compare& comp, const allocator_type& a);
|
|||
|
|
|
|||
|
|
#include <map>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
#include "../../../test_compare.h"
|
|||
|
|
#include "../../../test_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),
|
|||
|
|
};
|
|||
|
|
typedef test_compare<std::less<int> > C;
|
|||
|
|
typedef test_allocator<V> A;
|
|||
|
|
std::map<int, double, C, A> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(7));
|
|||
|
|
assert(m.get_allocator() == A(7));
|
|||
|
|
assert(m.key_comp() == C(5));
|
|||
|
|
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));
|
|||
|
|
}
|