//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // class packaged_task // template // explicit packaged_task(allocator_arg_t, const Allocator& a, F&& f); #include #include #include "../../test_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() { { std::packaged_task p(std::allocator_arg, test_allocator(), A(5)); assert(test_alloc_base::count > 0); assert(p.valid()); std::future f = p.get_future(); p(3, 'a'); assert(f.get() == 105.0); assert(A::n_copies == 0); assert(A::n_moves > 0); } assert(test_alloc_base::count == 0); A::n_copies = 0; A::n_moves = 0; { A a(5); std::packaged_task p(std::allocator_arg, test_allocator(), a); assert(test_alloc_base::count > 0); assert(p.valid()); std::future f = p.get_future(); p(3, 'a'); assert(f.get() == 105.0); assert(A::n_copies > 0); assert(A::n_moves > 0); } assert(test_alloc_base::count == 0); A::n_copies = 0; A::n_moves = 0; { A a(5); std::packaged_task p(std::allocator_arg, test_allocator(), &func); assert(test_alloc_base::count > 0); assert(p.valid()); std::future f = p.get_future(); p(4); assert(f.get() == 4); } assert(test_alloc_base::count == 0); A::n_copies = 0; A::n_moves = 0; { A a(5); std::packaged_task p(std::allocator_arg, test_allocator(), func); assert(test_alloc_base::count > 0); assert(p.valid()); std::future f = p.get_future(); p(4); assert(f.get() == 4); } assert(test_alloc_base::count == 0); }