mirror of
https://github.com/boostorg/ublas.git
synced 2026-01-24 06:22:13 +00:00
231ba5f730
Auxiliary functions for extents and strides were using different functions. Additionally, many tags were used to distinguish between different tensor types. This patch simplifies interfaces of different core functions and unifies functions that can process different types of extent and stride types.
221 lines
7.5 KiB
C++
221 lines
7.5 KiB
C++
//
|
|
// Copyright (c) 2018-2020, Cem Bassoy, cem.bassoy@gmail.com
|
|
// Copyright (c) 2019-2020, Amit Singh, amitsingh19975@gmail.com
|
|
//
|
|
// 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)
|
|
//
|
|
// The authors gratefully acknowledge the support of
|
|
// Google and Fraunhofer IOSB, Ettlingen, Germany
|
|
//
|
|
|
|
|
|
|
|
#include <boost/numeric/ublas/tensor.hpp>
|
|
#include "utility.hpp"
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
#include <functional>
|
|
|
|
BOOST_AUTO_TEST_SUITE(test_tensor_static_expression)
|
|
|
|
using test_types = zip<int,float,std::complex<float>>::with_t<boost::numeric::ublas::layout::first_order, boost::numeric::ublas::layout::last_order>;
|
|
|
|
|
|
struct fixture
|
|
{
|
|
template<std::size_t N1,size_t... N>
|
|
using extents_type = boost::numeric::ublas::extents<N1,N...>;
|
|
|
|
std::tuple<
|
|
extents_type<1,1>, // 1
|
|
extents_type<2,3>, // 2
|
|
extents_type<4,1,3>, // 3
|
|
extents_type<4,2,3>, // 4
|
|
extents_type<4,2,3,5> // 5
|
|
> extents;
|
|
};
|
|
|
|
BOOST_FIXTURE_TEST_CASE_TEMPLATE( test_tensor_static_expression_retrieve_extents, value, test_types, fixture)
|
|
{
|
|
namespace ublas = boost::numeric::ublas;
|
|
using value_type = typename value::first_type;
|
|
using layout_type = typename value::second_type;
|
|
|
|
auto uplus1 = [](auto const& a){return a + value_type(1);};
|
|
auto uplus2 = [](auto const& a){return value_type(2) + a;};
|
|
auto bplus = std::plus <value_type>{};
|
|
auto bminus = std::minus<value_type>{};
|
|
|
|
for_each_in_tuple(extents, [&](auto const& /*unused*/, auto& e){
|
|
using extents_type = std::decay_t<decltype(e)>;
|
|
using tensor_type = ublas::tensor_static<value_type,extents_type,layout_type>;
|
|
|
|
|
|
auto t = tensor_type();
|
|
auto v = value_type{};
|
|
for(auto& tt: t){ tt = v; v+=value_type{1}; }
|
|
|
|
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( t ) == e );
|
|
|
|
|
|
// uexpr1 = t+1
|
|
// uexpr2 = 2+t
|
|
auto uexpr1 = ublas::detail::make_unary_tensor_expression<tensor_type>( t, uplus1 );
|
|
auto uexpr2 = ublas::detail::make_unary_tensor_expression<tensor_type>( t, uplus2 );
|
|
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( uexpr1 ) == e );
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( uexpr2 ) == e );
|
|
|
|
// bexpr_uexpr = (t+1) + (2+t)
|
|
auto bexpr_uexpr = ublas::detail::make_binary_tensor_expression<tensor_type>( uexpr1, uexpr2, bplus );
|
|
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( bexpr_uexpr ) == e );
|
|
|
|
|
|
// bexpr_bexpr_uexpr = ((t+1) + (2+t)) - t
|
|
auto bexpr_bexpr_uexpr = ublas::detail::make_binary_tensor_expression<tensor_type>( bexpr_uexpr, t, bminus );
|
|
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( bexpr_bexpr_uexpr ) == e );
|
|
|
|
});
|
|
|
|
for_each_in_tuple(extents, [&](auto I, auto& e1){
|
|
|
|
if ( I >= std::tuple_size_v<decltype(extents)> - 1){
|
|
return;
|
|
}
|
|
|
|
using extents_type1 = std::decay_t<decltype(e1)>;
|
|
using tensor_type1 = ublas::tensor_static<value_type, extents_type1, layout_type>;
|
|
|
|
for_each_in_tuple(extents, [&](auto J, auto& e2){
|
|
|
|
if( J != I + 1 ){
|
|
return;
|
|
}
|
|
|
|
using extents_type2 = std::decay_t<decltype(e2)>;
|
|
using tensor_type2 = ublas::tensor_static<value_type, extents_type2, layout_type>;
|
|
|
|
auto v = value_type{};
|
|
|
|
tensor_type1 t1;
|
|
for(auto& tt: t1){ tt = v; v+=value_type{1}; }
|
|
|
|
tensor_type2 t2;
|
|
for(auto& tt: t2){ tt = v; v+=value_type{2}; }
|
|
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( t1 ) != ublas::detail::retrieve_extents( t2 ) );
|
|
|
|
// uexpr1 = t1+1
|
|
// uexpr2 = 2+t2
|
|
auto uexpr1 = ublas::detail::make_unary_tensor_expression<tensor_type1>( t1, uplus1 );
|
|
auto uexpr2 = ublas::detail::make_unary_tensor_expression<tensor_type2>( t2, uplus2 );
|
|
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( t1 ) == ublas::detail::retrieve_extents( uexpr1 ) );
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( t2 ) == ublas::detail::retrieve_extents( uexpr2 ) );
|
|
BOOST_CHECK( ublas::detail::retrieve_extents( uexpr1 ) != ublas::detail::retrieve_extents( uexpr2 ) );
|
|
|
|
});
|
|
});
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
BOOST_FIXTURE_TEST_CASE_TEMPLATE( test_tensor_static_expression_all_extents_equal, value, test_types, fixture)
|
|
{
|
|
namespace ublas = boost::numeric::ublas;
|
|
using value_type = typename value::first_type;
|
|
using layout_type = typename value::second_type;
|
|
|
|
auto uplus1 = [](auto const& a){return a + value_type(1);};
|
|
auto uplus2 = [](auto const& a){return value_type(2) + a;};
|
|
auto bplus = std::plus <value_type>{};
|
|
auto bminus = std::minus<value_type>{};
|
|
|
|
for_each_in_tuple(extents, [&](auto const& /*unused*/, auto& e){
|
|
using extents_type = std::decay_t<decltype(e)>;
|
|
using tensor_type = ublas::tensor_static<value_type,extents_type,layout_type>;
|
|
|
|
|
|
auto t = tensor_type{};
|
|
auto v = value_type{};
|
|
for(auto& tt: t){ tt = v; v+=value_type{1}; }
|
|
|
|
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( t , e ) );
|
|
|
|
|
|
// uexpr1 = t+1
|
|
// uexpr2 = 2+t
|
|
auto uexpr1 = ublas::detail::make_unary_tensor_expression<tensor_type>( t, uplus1 );
|
|
auto uexpr2 = ublas::detail::make_unary_tensor_expression<tensor_type>( t, uplus2 );
|
|
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( uexpr1, e ) );
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( uexpr2, e ) );
|
|
|
|
// bexpr_uexpr = (t+1) + (2+t)
|
|
auto bexpr_uexpr = ublas::detail::make_binary_tensor_expression<tensor_type>( uexpr1, uexpr2, bplus );
|
|
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( bexpr_uexpr, e ) );
|
|
|
|
|
|
// bexpr_bexpr_uexpr = ((t+1) + (2+t)) - t
|
|
auto bexpr_bexpr_uexpr = ublas::detail::make_binary_tensor_expression<tensor_type>( bexpr_uexpr, t, bminus );
|
|
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( bexpr_bexpr_uexpr , e ) );
|
|
|
|
});
|
|
|
|
|
|
for_each_in_tuple(extents, [&](auto I, auto& e1){
|
|
|
|
if ( I >= std::tuple_size_v<decltype(extents)> - 1){
|
|
return;
|
|
}
|
|
|
|
using extents_type1 = std::decay_t<decltype(e1)>;
|
|
using tensor_type1 = ublas::tensor_static<value_type, extents_type1, layout_type>;
|
|
|
|
for_each_in_tuple(extents, [&](auto J, auto& e2){
|
|
|
|
if( J != I + 1 ){
|
|
return;
|
|
}
|
|
|
|
using extents_type2 = std::decay_t<decltype(e2)>;
|
|
using tensor_type2 = ublas::tensor_static<value_type, extents_type2, layout_type>;
|
|
|
|
auto v = value_type{};
|
|
|
|
tensor_type1 t1;
|
|
for(auto& tt: t1){ tt = v; v+=value_type{1}; }
|
|
|
|
tensor_type2 t2;
|
|
for(auto& tt: t2){ tt = v; v+=value_type{2}; }
|
|
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( t1, ublas::detail::retrieve_extents(t1) ) );
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( t2, ublas::detail::retrieve_extents(t2) ) );
|
|
|
|
// uexpr1 = t1+1
|
|
// uexpr2 = 2+t2
|
|
auto uexpr1 = ublas::detail::make_unary_tensor_expression<tensor_type1>( t1, uplus1 );
|
|
auto uexpr2 = ublas::detail::make_unary_tensor_expression<tensor_type2>( t2, uplus2 );
|
|
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( uexpr1, ublas::detail::retrieve_extents(uexpr1) ) );
|
|
BOOST_CHECK( ublas::detail::all_extents_equal( uexpr2, ublas::detail::retrieve_extents(uexpr2) ) );
|
|
|
|
});
|
|
});
|
|
|
|
}
|
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|