f5256e16df
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103516 91177308-0d34-0410-b5e6-96231b3b80d8
82 lines
2.2 KiB
C++
82 lines
2.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <unordered_map>
|
|
|
|
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
|
// class Alloc = allocator<pair<const Key, T>>>
|
|
// class unordered_multimap
|
|
|
|
// template <class P,
|
|
// class = typename enable_if<is_convertible<P, value_type>::value>::type>
|
|
// iterator insert(const_iterator p, P&& x);
|
|
|
|
#include <unordered_map>
|
|
#include <cassert>
|
|
|
|
#include "../../../MoveOnly.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::unordered_multimap<double, int> C;
|
|
typedef C::iterator R;
|
|
typedef std::pair<double, short> P;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.insert(e, P(3.5, 3));
|
|
assert(c.size() == 1);
|
|
assert(r->first == 3.5);
|
|
assert(r->second == 3);
|
|
|
|
r = c.insert(r, P(3.5, 4));
|
|
assert(c.size() == 2);
|
|
assert(r->first == 3.5);
|
|
assert(r->second == 4);
|
|
|
|
r = c.insert(e, P(4.5, 4));
|
|
assert(c.size() == 3);
|
|
assert(r->first == 4.5);
|
|
assert(r->second == 4);
|
|
|
|
r = c.insert(e, P(5.5, 4));
|
|
assert(c.size() == 4);
|
|
assert(r->first == 5.5);
|
|
assert(r->second == 4);
|
|
}
|
|
#ifdef _LIBCPP_MOVE
|
|
{
|
|
typedef std::unordered_multimap<MoveOnly, MoveOnly> C;
|
|
typedef C::iterator R;
|
|
typedef std::pair<MoveOnly, MoveOnly> P;
|
|
C c;
|
|
C::const_iterator e = c.end();
|
|
R r = c.insert(e, P(3, 3));
|
|
assert(c.size() == 1);
|
|
assert(r->first == 3);
|
|
assert(r->second == 3);
|
|
|
|
r = c.insert(r, P(3, 4));
|
|
assert(c.size() == 2);
|
|
assert(r->first == 3);
|
|
assert(r->second == 4);
|
|
|
|
r = c.insert(e, P(4, 4));
|
|
assert(c.size() == 3);
|
|
assert(r->first == 4);
|
|
assert(r->second == 4);
|
|
|
|
r = c.insert(e, P(5, 4));
|
|
assert(c.size() == 4);
|
|
assert(r->first == 5);
|
|
assert(r->second == 4);
|
|
}
|
|
#endif
|
|
}
|