townforge/thread
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
cc
thread/test/sync/futures/when_any/iterators_pass.cpp
Tom Hughes 2a68582676 Remove racy check 
This check may or may not be true depending on how long it takes pt1 to
finish executing. You can verify this by adding a sleep before the check
in which case "is_ready()" is always true.
2018-04-26 07:30:43 -07:00

364 lines
13 KiB
C++
Raw Permalink Blame History

//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// Copyright (C) 2014 Vicente J. Botet Escriba
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
// <boost/thread/future.hpp>
// template< typename InputIterator>
// future<vector<typename InputIterator::value_type> >
// when_any(InputIterator first, InputIterator last)
#include <boost/config.hpp>
#if ! defined BOOST_NO_CXX11_DECLTYPE
#define BOOST_RESULT_OF_USE_DECLTYPE
#endif
#define BOOST_THREAD_VERSION 4
#include <boost/thread/future.hpp>
#include <boost/detail/lightweight_test.hpp>
#include <stdexcept>
#ifdef BOOST_MSVC
#pragma warning(disable: 4127) // conditional expression is constant
#endif
int p1()
{
return 123;
}
int thr()
{
throw std::logic_error("123");
}
int p2()
{
boost::this_thread::sleep_for(boost::chrono::milliseconds(200));
return 321;
}
int main()
{
#if defined BOOST_THREAD_PROVIDES_FUTURE_WHEN_ALL_WHEN_ANY
if (0) // todo not yet implemented
{ // invalid future copy-constructible
boost::csbl::vector<boost::future<int> > v;
boost::future<int> f1;
v.push_back(boost::move(f1));
v.push_back(boost::make_ready_future(321));
BOOST_TEST(! v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res.size() == 2);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
// has exception
//BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // is_ready future copy-constructible
boost::future<int> f1 = boost::make_ready_future(123);
boost::future<int> f2 = boost::make_ready_future(321);
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[0].is_ready());
BOOST_TEST(v[1].valid());
BOOST_TEST(v[1].is_ready());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
if (0) // todo FAILS not yet implemented
BOOST_TEST(all.is_ready());
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // is_ready shared_future copy-constructible
boost::shared_future<int> f1 = boost::make_ready_future(123).share();
boost::shared_future<int> f2 = boost::make_ready_future(321).share();
boost::csbl::vector<boost::shared_future<int> > v;
v.push_back(f1);
v.push_back(f2);
BOOST_TEST(v[0].valid());
BOOST_TEST(v[0].is_ready());
BOOST_TEST(v[1].valid());
BOOST_TEST(v[1].is_ready());
boost::future<boost::csbl::vector<boost::shared_future<int> > > all = boost::when_any(v.begin(), v.end());
if (0) // fixme
BOOST_TEST(v[0].valid());
if (0) // fixme
BOOST_TEST(v[1].valid());
BOOST_TEST(all.valid());
if (0) // todo FAILS not yet implemented
BOOST_TEST(all.is_ready());
boost::csbl::vector<boost::shared_future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // packaged_task future copy-constructible
boost::packaged_task<int()> pt1(&p1);
boost::future<int> f1 = pt1.get_future();
BOOST_TEST(f1.valid());
boost::packaged_task<int()> pt2(&p2);
boost::future<int> f2 = pt2.get_future();
BOOST_TEST(f2.valid());
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
pt1();
pt2();
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // packaged_task future copy-constructible
boost::packaged_task<int()> pt1(&thr);
boost::future<int> f1 = pt1.get_future();
BOOST_TEST(f1.valid());
boost::packaged_task<int()> pt2(&p2);
boost::future<int> f2 = pt2.get_future();
BOOST_TEST(f2.valid());
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
pt1();
pt2();
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
try {
res[0].get();
BOOST_TEST(false);
} catch (std::logic_error& ex) {
BOOST_TEST(ex.what() == std::string("123"));
} catch (...) {
BOOST_TEST(false);
}
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // packaged_task shared_future copy-constructible
boost::packaged_task<int()> pt1(&p1);
boost::shared_future<int> f1 = pt1.get_future().share();
BOOST_TEST(f1.valid());
boost::packaged_task<int()> pt2(&p2);
boost::shared_future<int> f2 = pt2.get_future().share();
BOOST_TEST(f2.valid());
boost::csbl::vector<boost::shared_future<int> > v;
v.push_back(f1);
v.push_back(f2);
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::shared_future<int> > > all = boost::when_any(v.begin(), v.end());
if (0) // fixme
BOOST_TEST(v[0].valid());
if (0) // fixme
BOOST_TEST(v[1].valid());
BOOST_TEST(all.valid());
BOOST_TEST(! all.is_ready());
pt1();
pt2();
boost::this_thread::sleep_for(boost::chrono::milliseconds(300));
BOOST_TEST(all.is_ready());
boost::csbl::vector<boost::shared_future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // async future copy-constructible
boost::future<int> f1 = boost::async(boost::launch::async, &p1);
BOOST_TEST(f1.valid());
boost::future<int> f2 = boost::async(boost::launch::async, &p2);
BOOST_TEST(f2.valid());
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(! res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // async shared_future copy-constructible
boost::shared_future<int> f1 = boost::async(boost::launch::async, &p1).share();
BOOST_TEST(f1.valid());
boost::shared_future<int> f2 = boost::async(boost::launch::async, &p2).share();
BOOST_TEST(f2.valid());
boost::csbl::vector<boost::shared_future<int> > v;
v.push_back(f1);
v.push_back(f2);
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::shared_future<int> > > all = boost::when_any(v.begin(), v.end());
if (0) // fixme
BOOST_TEST(v[0].valid());
if (0) // fixme
BOOST_TEST(v[1].valid());
BOOST_TEST(all.valid());
boost::csbl::vector<boost::shared_future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(! res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
{ // async future copy-constructible
boost::future<int> f1 = boost::async(boost::launch::async, &p1);
BOOST_TEST(f1.valid());
boost::future<int> f2 = boost::make_ready_future(321);
BOOST_TEST(f2.valid());
BOOST_TEST(f2.is_ready());
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res[0].valid());
if (0) // fixme
BOOST_TEST(! res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
#if defined BOOST_THREAD_PROVIDES_VARIADIC_THREAD
// fixme darwin-4.8.0_11 terminate called without an active exception
{ // deferred future copy-constructible
boost::future<int> f1 = boost::async(boost::launch::deferred, &p1);
boost::future<int> f2 = boost::async(boost::launch::deferred, &p2);
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
boost::csbl::vector<boost::future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(! res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
// fixme darwin-4.8.0_11 terminate called without an active exception
{ // deferred shared_future copy-constructible
boost::shared_future<int> f1 = boost::async(boost::launch::deferred, &p1).share();
boost::shared_future<int> f2 = boost::async(boost::launch::deferred, &p2).share();
boost::csbl::vector<boost::shared_future<int> > v;
v.push_back(f1);
v.push_back(f2);
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::shared_future<int> > > all = boost::when_any(v.begin(), v.end());
if (0) // fixme
BOOST_TEST(v[0].valid());
if (0) // fixme
BOOST_TEST(v[1].valid());
BOOST_TEST(all.valid());
boost::csbl::vector<boost::shared_future<int> > res = all.get();
BOOST_TEST(res[0].valid());
BOOST_TEST(res[0].is_ready());
BOOST_TEST(res[0].get() == 123);
BOOST_TEST(res[1].valid());
BOOST_TEST(! res[1].is_ready());
BOOST_TEST(res[1].get() == 321);
}
#endif
#if ! defined BOOST_NO_CXX11_LAMBDAS
{ // async futures copy-constructible then()
boost::future<int> f1 = boost::async(boost::launch::async, &p1);
BOOST_TEST(f1.valid());
boost::future<int> f2 = boost::async(boost::launch::async, &p2);
BOOST_TEST(f2.valid());
boost::csbl::vector<boost::future<int> > v;
v.push_back(boost::move(f1));
v.push_back(boost::move(f2));
BOOST_TEST(v[0].valid());
BOOST_TEST(v[1].valid());
boost::future<boost::csbl::vector<boost::future<int> > > all = boost::when_any(v.begin(), v.end());
BOOST_TEST(! v[0].valid());
BOOST_TEST(! v[1].valid());
BOOST_TEST(all.valid());
boost::future<int> sum = all.then([](boost::future<boost::csbl::vector<boost::future<int> > > f)
{
boost::csbl::vector<boost::future<int> > v = f.get();
return v[0].get() + v[1].get();
});
BOOST_TEST(sum.valid());
BOOST_TEST(sum.get() == 444);
}
#endif
#endif
return boost::report_errors();
}
Reference in New Issue View Git Blame Copy Permalink