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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
// Copyright 2018-2024 Emil Dotchevski and Reverge Studios, Inc.
// 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)
#include <boost/leaf/config.hpp>
#if defined(BOOST_LEAF_NO_EXCEPTIONS) || defined(BOOST_LEAF_NO_THREADS) || !BOOST_LEAF_CFG_CAPTURE
#include <iostream>
int main()
{
std::cout << "Unit test not applicable." << std::endl;
return 0;
}
#else
#ifdef BOOST_LEAF_TEST_SINGLE_HEADER
# include "leaf.hpp"
#else
# include <boost/leaf/result.hpp>
# include <boost/leaf/handle_errors.hpp>
# include <boost/leaf/on_error.hpp>
#endif
#include "lightweight_test.hpp"
#include <vector>
#include <future>
#include <iterator>
#include <algorithm>
namespace leaf = boost::leaf;
template <int> struct info { int value; };
struct fut_info
{
int a;
int b;
int result;
std::future<leaf::result<int>> fut;
};
template <class F>
std::vector<fut_info> launch_tasks( int task_count, F f )
{
BOOST_LEAF_ASSERT(task_count>0);
std::vector<fut_info> fut;
std::generate_n( std::back_inserter(fut), task_count,
[=]
{
int const a = rand();
int const b = rand();
int const res = (rand()%10) - 5;
return fut_info { a, b, res, std::async( std::launch::async,
[=]
{
return leaf::try_capture_all(
[&]
{
return f(a, b, res);
} );
} ) };
} );
return fut;
}
int main()
{
int const task_count = 100;
int received_a, received_b;
auto task =
[]( int a, int b, int res ) -> leaf::result<int>
{
if( res >= 0 )
return res;
else
return leaf::new_error( info<1>{a}, info<2>{b}, info<3>{} );
};
auto error_handlers = std::make_tuple(
[&]( info<1> const & x1, info<2> const & x2, info<4> const & )
{
received_a = x1.value;
received_b = x2.value;
return -1;
},
[]
{
return -2;
} );
{
std::vector<fut_info> fut = launch_tasks(task_count, task);
for( auto & f : fut )
{
f.fut.wait();
received_a = received_b = 0;
int r = leaf::try_handle_all(
[&]() -> leaf::result<int>
{
auto load = leaf::on_error( info<4>{} );
return f.fut.get().value();
},
error_handlers );
if( f.result>=0 )
BOOST_TEST_EQ(r, f.result);
else
{
BOOST_TEST_EQ(r, -1);
BOOST_TEST_EQ(f.a, received_a);
BOOST_TEST_EQ(f.b, received_b);
}
}
}
{
std::vector<fut_info> fut = launch_tasks(task_count, task);
for( auto & f : fut )
{
f.fut.wait();
received_a = received_b = 0;
int r = leaf::try_handle_all(
[&]
{
auto load = leaf::on_error( info<4>{} );
return leaf::try_handle_some(
[&]() -> leaf::result<int>
{
return f.fut.get().value();
},
[]( leaf::error_info const & err )
{
return err.error();
} );
},
error_handlers );
if( f.result>=0 )
BOOST_TEST_EQ(r, f.result);
else
{
BOOST_TEST_EQ(r, -1);
BOOST_TEST_EQ(f.a, received_a);
BOOST_TEST_EQ(f.b, received_b);
}
}
}
return boost::report_errors();
}
#endif
|
