1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
// class Alloc = allocator<Value>>
// class unordered_multiset
// template <class... Args>
// iterator emplace(Args&&... args);
#include <unordered_set>
#include <cassert>
#include "../../Emplaceable.h"
#include "min_allocator.h"
int main()
{
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
{
typedef std::unordered_multiset<Emplaceable> C;
typedef C::iterator R;
C c;
R r = c.emplace();
assert(c.size() == 1);
assert(*r == Emplaceable());
r = c.emplace(Emplaceable(5, 6));
assert(c.size() == 2);
assert(*r == Emplaceable(5, 6));
r = c.emplace(5, 6);
assert(c.size() == 3);
assert(*r == Emplaceable(5, 6));
}
#if __cplusplus >= 201103L
{
typedef std::unordered_multiset<Emplaceable, std::hash<Emplaceable>,
std::equal_to<Emplaceable>, min_allocator<Emplaceable>> C;
typedef C::iterator R;
C c;
R r = c.emplace();
assert(c.size() == 1);
assert(*r == Emplaceable());
r = c.emplace(Emplaceable(5, 6));
assert(c.size() == 2);
assert(*r == Emplaceable(5, 6));
r = c.emplace(5, 6);
assert(c.size() == 3);
assert(*r == Emplaceable(5, 6));
}
#endif
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}
|
