cxx/test/thread/futures/futures.tas/futures.task.members/ctor_func.pass.cpp
2010-08-30 18:46:21 +00:00

62 lines
1.4 KiB
C++

//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <future>
// class packaged_task<R(ArgTypes...)>
// template <class F>
// explicit packaged_task(F&& f);
#include <future>
#include <cassert>
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 main()
{
{
std::packaged_task<double(int, char)> p(A(5));
assert(p);
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_copies = 0;
{
A a(5);
std::packaged_task<double(int, char)> p(a);
assert(p);
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);
}
}