1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // class packaged_task<R(ArgTypes...)>
14 // template <class F, class Allocator>
15 // explicit packaged_task(allocator_arg_t, const Allocator& a, F&& f);
20 #include "../../test_allocator.h"
30 explicit A(long i) : data_(i) {}
31 A(A&& a) : data_(a.data_) {++n_moves; a.data_ = -1;}
32 A(const A& a) : data_(a.data_) {++n_copies;}
34 long operator()(long i, long j) const {return data_ + i + j;}
40 int func(int i) { return i; }
45 std::packaged_task<double(int, char)> p(std::allocator_arg,
46 test_allocator<A>(), A(5));
47 assert(test_alloc_base::count > 0);
49 std::future<double> f = p.get_future();
51 assert(f.get() == 105.0);
52 assert(A::n_copies == 0);
53 assert(A::n_moves > 0);
55 assert(test_alloc_base::count == 0);
60 std::packaged_task<double(int, char)> p(std::allocator_arg,
61 test_allocator<A>(), a);
62 assert(test_alloc_base::count > 0);
64 std::future<double> f = p.get_future();
66 assert(f.get() == 105.0);
67 assert(A::n_copies > 0);
68 assert(A::n_moves > 0);
70 assert(test_alloc_base::count == 0);
75 std::packaged_task<int(int)> p(std::allocator_arg, test_allocator<A>(), &func);
76 assert(test_alloc_base::count > 0);
78 std::future<int> f = p.get_future();
82 assert(test_alloc_base::count == 0);
87 std::packaged_task<int(int)> p(std::allocator_arg, test_allocator<A>(), func);
88 assert(test_alloc_base::count > 0);
90 std::future<int> f = p.get_future();
94 assert(test_alloc_base::count == 0);