50 lines
1.2 KiB
C++
50 lines
1.2 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>
|
|||
|
|
// void insert(InputIterator first, InputIterator last);
|
|||
|
|
|
|||
|
|
#include <map>
|
|||
|
|
#include <cassert>
|
|||
|
|
|
|||
|
|
#include "../../../iterators.h"
|
|||
|
|
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
{
|
|||
|
|
typedef std::map<int, double> M;
|
|||
|
|
typedef std::pair<int, double> P;
|
|||
|
|
P ar[] =
|
|||
|
|
{
|
|||
|
|
P(1, 1),
|
|||
|
|
P(1, 1.5),
|
|||
|
|
P(1, 2),
|
|||
|
|
P(2, 1),
|
|||
|
|
P(2, 1.5),
|
|||
|
|
P(2, 2),
|
|||
|
|
P(3, 1),
|
|||
|
|
P(3, 1.5),
|
|||
|
|
P(3, 2),
|
|||
|
|
};
|
|||
|
|
M m;
|
|||
|
|
m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[0])));
|
|||
|
|
assert(m.size() == 3);
|
|||
|
|
assert(m.begin()->first == 1);
|
|||
|
|
assert(m.begin()->second == 1);
|
|||
|
|
assert(next(m.begin())->first == 2);
|
|||
|
|
assert(next(m.begin())->second == 1);
|
|||
|
|
assert(next(m.begin(), 2)->first == 3);
|
|||
|
|
assert(next(m.begin(), 2)->second == 1);
|
|||
|
|
}
|
|||
|
|
}
|