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_set
// pair<iterator, bool> insert(const value_type& x);
#include <unordered_set>
#include <cassert>
#include "min_allocator.h"
template<class Container>
void do_insert_const_lvalue_test()
{
typedef Container C;
typedef std::pair<typename C::iterator, bool> R;
typedef typename C::value_type VT;
C c;
const VT v1(3.5);
R r = c.insert(v1);
assert(c.size() == 1);
assert(*r.first == 3.5);
assert(r.second);
r = c.insert(v1);
assert(c.size() == 1);
assert(*r.first == 3.5);
assert(!r.second);
const VT v2(4.5);
r = c.insert(v2);
assert(c.size() == 2);
assert(*r.first == 4.5);
assert(r.second);
const VT v3(5.5);
r = c.insert(v3);
assert(c.size() == 3);
assert(*r.first == 5.5);
assert(r.second);
}
int main()
{
do_insert_const_lvalue_test<std::unordered_set<double> >();
#if TEST_STD_VER >= 11
{
typedef std::unordered_set<double, std::hash<double>,
std::equal_to<double>, min_allocator<double>> C;
do_insert_const_lvalue_test<C>();
}
#endif
}
|
