2
0
mirror of https://github.com/boostorg/leaf.git synced 2026-01-30 20:02:15 +00:00
Files
leaf/test/result_load_accumulate_test.cpp
2019-02-09 18:53:30 -08:00

63 lines
1.4 KiB
C++

// Copyright (c) 2018-2019 Emil Dotchevski
// Copyright (c) 2018-2019 Second Spectrum, 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/result.hpp>
#include <boost/leaf/handle_error.hpp>
#include "boost/core/lightweight_test.hpp"
namespace leaf = boost::leaf;
template <int> struct info { int value; };
template <class T>
leaf::result<T> test()
{
leaf::result<T> r1 = leaf::new_error(info<42>{40});
leaf::result<T> & r2 = r1.load(info<1>{});
leaf::result<T> & r3 = r2.load(info<2>{2}, info<3>{3});
leaf::result<T> & r4 = r3.accumulate([ ](info<42> & x){ ++x.value; });
leaf::result<T> & r5 = r4.accumulate([ ](info<42> & x){ ++x.value; }, [ ](info<1> & x){ ++x.value; });
return r5;
}
int main()
{
{
int r = leaf::try_handle_all(
[ ]
{
return test<int>();
},
[ ]( leaf::match<info<42>, 42>, leaf::match<info<1>, 1>, leaf::match<info<2>, 2>, leaf::match<info<3>, 3> )
{
return 1;
},
[ ]
{
return 2;
} );
BOOST_TEST_EQ(r, 1);
}
{
int r = leaf::try_handle_all(
[ ]() -> leaf::result<int>
{
LEAF_CHECK(test<void>());
return 0;
},
[ ]( leaf::match<info<42>, 42>, leaf::match<info<1>, 1>, leaf::match<info<2>, 2>, leaf::match<info<3>, 3> )
{
return 1;
},
[ ]
{
return 2;
} );
BOOST_TEST_EQ(r, 1);
}
return boost::report_errors();
}