| //===----------------------------------------------------------------------===// |
| // |
| // 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> |
| |
| 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)); |
| } |
