137 lines
3.6 KiB
C++
137 lines
3.6 KiB
C++
|
|
// Copyright 2015, 2017 Peter Dimov.
|
|
//
|
|
// 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
|
|
|
|
|
|
#if defined(_MSC_VER)
|
|
#pragma warning( disable: 4244 ) // 'initializing': conversion from 'int' to 'char', possible loss of data
|
|
#endif
|
|
|
|
#include <boost/mp11/tuple.hpp>
|
|
#include <boost/core/lightweight_test.hpp>
|
|
#include <tuple>
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <array>
|
|
|
|
int main()
|
|
{
|
|
using boost::mp11::tuple_apply;
|
|
|
|
{
|
|
std::tuple<int, short, char> tp{ 1, 2, 3 };
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, tp );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
}
|
|
|
|
{
|
|
std::tuple<int, short, char> const tp{ 1, 2, 3 };
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, tp );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
}
|
|
|
|
#if defined( __clang_major__ ) && __clang_major__ == 3 && __clang_minor__ < 8
|
|
#else
|
|
|
|
{
|
|
std::tuple<std::unique_ptr<int>, std::unique_ptr<int>, std::unique_ptr<int>> tp{ std::unique_ptr<int>(new int(1)), std::unique_ptr<int>(new int(2)), std::unique_ptr<int>(new int(3)) };
|
|
|
|
int s = tuple_apply( [&]( std::unique_ptr<int> px, std::unique_ptr<int> py, std::unique_ptr<int> pz ){ return 100 * *px + 10 * *py + *pz; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
|
|
#endif
|
|
|
|
{
|
|
std::pair<int, short> tp{ 1, 2 };
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y ){ return 10 * x + y; }, tp );
|
|
BOOST_TEST_EQ( s, 12 );
|
|
}
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y ){ return 10 * x + y; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 12 );
|
|
}
|
|
}
|
|
|
|
{
|
|
std::pair<int, short> const tp{ 1, 2 };
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y ){ return 10 * x + y; }, tp );
|
|
BOOST_TEST_EQ( s, 12 );
|
|
}
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y ){ return 10 * x + y; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 12 );
|
|
}
|
|
}
|
|
|
|
{
|
|
std::array<int, 3> tp{{ 1, 2, 3 }};
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, tp );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
}
|
|
|
|
{
|
|
std::array<int, 3> const tp{{ 1, 2, 3 }};
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, tp );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
|
|
{
|
|
int s = tuple_apply( [&]( int x, int y, int z ){ return 100 * x + 10 * y + z; }, std::move(tp) );
|
|
BOOST_TEST_EQ( s, 123 );
|
|
}
|
|
}
|
|
|
|
{
|
|
std::tuple<> tp;
|
|
|
|
BOOST_TEST_EQ( tuple_apply( []{ return 11; }, tp ), 11 );
|
|
BOOST_TEST_EQ( tuple_apply( []{ return 12; }, std::move( tp ) ), 12 );
|
|
}
|
|
|
|
{
|
|
std::array<int, 0> tp;
|
|
|
|
BOOST_TEST_EQ( tuple_apply( []{ return 11; }, tp ), 11 );
|
|
BOOST_TEST_EQ( tuple_apply( []{ return 12; }, std::move( tp ) ), 12 );
|
|
}
|
|
|
|
return boost::report_errors();
|
|
}
|