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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// UNSUPPORTED: no-threads
// packaged_task allocator support was removed in C++17 (LWG 2921)
// REQUIRES: c++11 || c++14
// <future>
// class packaged_task<R(ArgTypes...)>
// template <class F, class Allocator>
// explicit packaged_task(allocator_arg_t, const Allocator& a, F&& f);
#include <future>
#include <cassert>
#include "test_macros.h"
#include "test_allocator.h"
#include "min_allocator.h"
class A
{
long data_;
public:
static int n_moves;
static int n_copies;
explicit A(long i) : data_(i) {}
A(A&& a) : data_(a.data_) {++n_moves; a.data_ = -1;}
A(const A& a) : data_(a.data_) {++n_copies;}
long operator()(long i, long j) const {return data_ + i + j;}
};
int A::n_moves = 0;
int A::n_copies = 0;
int func(int i) { return i; }
int main(int, char**)
{
test_allocator_statistics alloc_stats;
{
std::packaged_task<double(int, char)> p(std::allocator_arg,
test_allocator<A>(&alloc_stats), A(5));
assert(alloc_stats.alloc_count > 0);
assert(p.valid());
std::future<double> f = p.get_future();
p(3, 'a');
assert(f.get() == 105.0);
assert(A::n_copies == 0);
assert(A::n_moves > 0);
}
assert(alloc_stats.alloc_count == 0);
A::n_copies = 0;
A::n_moves = 0;
{
A a(5);
std::packaged_task<double(int, char)> p(std::allocator_arg,
test_allocator<A>(&alloc_stats), a);
assert(alloc_stats.alloc_count > 0);
assert(p.valid());
std::future<double> f = p.get_future();
p(3, 'a');
assert(f.get() == 105.0);
assert(A::n_copies > 0);
assert(A::n_moves >= 0);
}
assert(alloc_stats.alloc_count == 0);
A::n_copies = 0;
A::n_moves = 0;
{
A a(5);
std::packaged_task<int(int)> p(std::allocator_arg, test_allocator<A>(&alloc_stats), &func);
assert(alloc_stats.alloc_count > 0);
assert(p.valid());
std::future<int> f = p.get_future();
p(4);
assert(f.get() == 4);
}
assert(alloc_stats.alloc_count == 0);
A::n_copies = 0;
A::n_moves = 0;
{
A a(5);
std::packaged_task<int(int)> p(std::allocator_arg, test_allocator<A>(&alloc_stats), func);
assert(alloc_stats.alloc_count > 0);
assert(p.valid());
std::future<int> f = p.get_future();
p(4);
assert(f.get() == 4);
}
assert(alloc_stats.alloc_count == 0);
A::n_copies = 0;
A::n_moves = 0;
{
std::packaged_task<double(int, char)> p(std::allocator_arg,
bare_allocator<void>(), A(5));
assert(p.valid());
std::future<double> f = p.get_future();
p(3, 'a');
assert(f.get() == 105.0);
assert(A::n_copies == 0);
assert(A::n_moves > 0);
}
A::n_copies = 0;
A::n_moves = 0;
{
std::packaged_task<double(int, char)> p(std::allocator_arg,
min_allocator<void>(), A(5));
assert(p.valid());
std::future<double> f = p.get_future();
p(3, 'a');
assert(f.get() == 105.0);
assert(A::n_copies == 0);
assert(A::n_moves > 0);
}
A::n_copies = 0;
A::n_moves = 0;
return 0;
}
|
