108 lines
3.3 KiB
C++
108 lines
3.3 KiB
C++
// -*- C++ -*-
|
|
|
|
#ifndef __pack_num_h__
|
|
#define __pack_num_h__
|
|
|
|
#include <cstdlib>
|
|
//#include <type_traits>
|
|
#include <tuple>
|
|
#include <ostream>
|
|
|
|
#include "base_def.h"
|
|
#include "xfor/exttype.h"
|
|
|
|
namespace MultiArrayHelper
|
|
{
|
|
|
|
template <size_t N>
|
|
struct PackNum
|
|
{
|
|
template <typename... T>
|
|
static void printTuple(std::ostream& out, const std::tuple<T...>& tp)
|
|
{
|
|
out << std::get<sizeof...(T)-N-1>(tp) << ", ";
|
|
PackNum<N-1>::printTuple(out, tp);
|
|
}
|
|
|
|
template <class... Ops>
|
|
static auto mkSteps(std::intptr_t ii, const std::tuple<Ops...>& otp)
|
|
-> decltype(PackNum<N-1>::mkSteps(ii, otp).extend( std::get<N>(otp).rootSteps(ii)) )
|
|
{
|
|
return PackNum<N-1>::mkSteps(ii, otp).extend( std::get<N>(otp).rootSteps(ii));
|
|
}
|
|
|
|
template <class RootStepTuple, class IndexClass, class OpClass>
|
|
static void mkExt(std::array<RootStepTuple,IndexClass::totalDim()>& out,
|
|
const std::array<std::intptr_t,IndexClass::totalDim()>& siar,
|
|
const OpClass& second)
|
|
{
|
|
std::get<N>(out) = second.rootSteps( std::get<N>(siar) );
|
|
PackNum<N-1>::mkExt(out, siar, second);
|
|
}
|
|
|
|
template <size_t LAST, typename T, class ETuple, class OpTuple, class OpFunction, typename... Args>
|
|
static inline T mkOpExpr(const ETuple& pos, const OpTuple& ops, const Args&... args)
|
|
{
|
|
typedef typename std::remove_reference<decltype(std::get<N>(ops))>::type NextOpType;
|
|
static_assert(LAST > NextOpType::SIZE, "inconsistent array positions");
|
|
static constexpr size_t NEXT = LAST - NextOpType::SIZE;
|
|
return PackNum<N-1>::template mkOpExpr<NEXT,T,ETuple,OpTuple,OpFunction,T,Args...>
|
|
( pos, ops, std::get<N>(ops).get(Getter<NEXT>::template getX<ETuple>( pos )), args...);
|
|
}
|
|
|
|
template <class OpTuple, class Expr>
|
|
static auto mkLoop( const OpTuple& ot, Expr&& exp )
|
|
-> decltype(std::get<N>(ot).loop( PackNum<N-1>::mkLoop(ot,exp) ))
|
|
{
|
|
return std::get<N>(ot).loop( PackNum<N-1>::mkLoop(ot,exp) );
|
|
}
|
|
};
|
|
|
|
template<>
|
|
struct PackNum<0>
|
|
{
|
|
template <typename... T>
|
|
static void printTuple(std::ostream& out, const std::tuple<T...>& tp)
|
|
{
|
|
out << std::get<sizeof...(T)-1>(tp);
|
|
}
|
|
|
|
template <class... Ops>
|
|
static auto mkSteps(std::intptr_t ii, const std::tuple<Ops...>& otp)
|
|
-> decltype(std::get<0>(otp).rootSteps(ii))
|
|
{
|
|
return std::get<0>(otp).rootSteps(ii);
|
|
}
|
|
|
|
template <class RootStepTuple, class IndexClass, class OpClass>
|
|
static void mkExt(std::array<RootStepTuple,IndexClass::totalDim()>& out,
|
|
const std::array<std::intptr_t,IndexClass::totalDim()>& siar,
|
|
const OpClass& second)
|
|
{
|
|
std::get<0>(out) = second.rootSteps( std::get<0>(siar) );
|
|
}
|
|
|
|
template <size_t LAST, typename T, class ETuple, class OpTuple, class OpFunction, typename... Args>
|
|
static inline T mkOpExpr(const ETuple& pos, const OpTuple& ops, const Args&... args)
|
|
{
|
|
typedef typename std::remove_reference<decltype(std::get<0>(ops))>::type NextOpType;
|
|
static constexpr size_t NEXT = LAST - NextOpType::SIZE;
|
|
static_assert(NEXT == 0, "inconsistent array positions");
|
|
return OpFunction::apply(std::get<0>(ops).get(Getter<0>::template getX<ETuple>( pos )), args...);
|
|
}
|
|
|
|
template <class OpTuple, class Expr>
|
|
static auto mkLoop( const OpTuple& ot, Expr&& exp )
|
|
-> decltype(std::get<0>(ot).loop( exp ))
|
|
{
|
|
return std::get<0>(ot).loop( exp );
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
} // end namespace MultiArrayHelper
|
|
|
|
#endif
|