b64f8b07c1
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@119395 91177308-0d34-0410-b5e6-96231b3b80d8
53 lines
1.4 KiB
C++
53 lines
1.4 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 multimap
|
|
|
|
// template <class InputIterator>
|
|
// multimap(InputIterator first, InputIterator last,
|
|
// const key_compare& comp);
|
|
|
|
#include <map>
|
|
#include <cassert>
|
|
|
|
#include "../../../test_compare.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;
|
|
std::multimap<int, double, C> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5));
|
|
assert(m.key_comp() == C(5));
|
|
assert(m.size() == 9);
|
|
assert(distance(m.begin(), m.end()) == 9);
|
|
assert(*m.begin() == V(1, 1));
|
|
assert(*next(m.begin()) == V(1, 1.5));
|
|
assert(*next(m.begin(), 2) == V(1, 2));
|
|
assert(*next(m.begin(), 3) == V(2, 1));
|
|
assert(*next(m.begin(), 4) == V(2, 1.5));
|
|
assert(*next(m.begin(), 5) == V(2, 2));
|
|
assert(*next(m.begin(), 6) == V(3, 1));
|
|
assert(*next(m.begin(), 7) == V(3, 1.5));
|
|
assert(*next(m.begin(), 8) == V(3, 2));
|
|
}
|