emplace_hint.pass.cpp revision bc8d3f97eb5c958007f2713238472e0c1c8fe02c 
1//===----------------------------------------------------------------------===//
2//
3// ��������������������The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <unordered_map>
11
12// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13//           class Alloc = allocator<pair<const Key, T>>>
14// class unordered_map
15
16// template <class... Args>
17//     iterator emplace_hint(const_iterator p, Args&&... args);
18
19#include <unordered_map>
20#include <cassert>
21
22#include "../../../Emplaceable.h"
23
24int main()
25{
26#ifdef _LIBCPP_MOVE
27    {
28        typedef std::unordered_map<int, Emplaceable> C;
29        typedef C::iterator R;
30        C c;
31        C::const_iterator e = c.end();
32        R r = c.emplace_hint(e, 3);
33        assert(c.size() == 1);
34        assert(r->first == 3);
35        assert(r->second == Emplaceable());
36
37        r = c.emplace_hint(e, std::pair<const int, Emplaceable>(4, Emplaceable(5, 6)));
38        assert(c.size() == 2);
39        assert(r->first == 4);
40        assert(r->second == Emplaceable(5, 6));
41
42        r = c.emplace_hint(e, 5, 6, 7);
43        assert(c.size() == 3);
44        assert(r->first == 5);
45        assert(r->second == Emplaceable(6, 7));
46    }
47#endif
48}
49