#ifndef __slice_h__ #define __slice_h__ #include "multi_array_base.h" namespace MultiArrayTools { template class Slice : public MutableMultiArrayBase { public: typedef ContainerRange CRange; typedef MultiArrayBase MAB; typedef typename CRange::IndexType IType; DEFAULT_MEMBERS(Slice); // RITypes = Range XOR Index depending on whether const XOR opern template Slice(MutableMultiArrayBase& ma, const std::shared_ptr&... ris); virtual const T& operator[](const IType& i) const override; virtual T& operator[](const IType& i) override; virtual const T& at(const typename IType::MetaType& meta) const override; virtual T& at(const typename IType::MetaType& meta) override; virtual const T* data() const override; virtual T* data() override; virtual bool isSlice() const override; virtual auto begin() const -> IType override; virtual auto end() const -> IType override; private: T* mData; }; } // end namespace MultiArrayTools /* ========================= * * --- TEMPLATE CODE --- * * ========================= */ namespace MultiArrayTools { namespace { //size_t sum(size_t arg) //{ // return arg; //} template size_t sum(size_t arg, SizeTypes... args) { return arg + sum(args...); } template struct XX { template static auto ri_to_tuple(const std::shared_ptr& ri) -> std::tuple { return std::make_tuple(ri); } template static size_t ri_to_start_pos(const std::shared_ptr& ri) { return 0; } }; template <> struct XX { template static auto ri_to_tuple(const std::shared_ptr& ri) -> std::tuple<> { return std::make_tuple(); } template static size_t ri_to_start_pos(const std::shared_ptr& ri) { return ri->pos(); } }; template auto mkSliceRange(const std::shared_ptr&... ris) -> decltype(std::tuple_cat(XX::ri_to_tuple(ris)...)) { return std::tuple_cat(XX::ri_to_tuple(ris)...); } template size_t mkStartPos(const std::shared_ptr&... ris) { return sum(ri_to_start_pos(ris)...); } } /************* * Slice * *************/ template template Slice::Slice(MutableMultiArrayBase& ma, const std::shared_ptr&... ris) : MutableMultiArrayBase( mkSliceRange(ris...) ), mData(ma.data() + mkStartPos(ris...)) { MAB::mProtoI.format( mBlockSizes(mkSliceBlocks(ris...)) ); } template const T& Slice::operator[](const IType& i) const { assert(i.sliceMode()); // -> compare objects !!!!! assert(i.container() == reinterpret_cast(this)); return mData[ i.pos() ]; } template T& Slice::operator[](const IType& i) { assert(i.sliceMode()); assert(i.container() == reinterpret_cast(this)); return mData[ i.pos() ]; } template const T& Slice::at(const typename IType::MetaType& meta) const { return mData[ begin().at(meta).pos() ]; } template T& Slice::at(const typename IType::MetaType& meta) { return mData[ begin().at(meta).pos() ]; } template const T* Slice::data() const { return mData; } template T* Slice::data() { return mData; } template bool Slice::isSlice() const { return true; } template auto Slice::begin() const -> Slice::IType { IType i = MAB::mProtoI; i = 0; //i = mStartPos; return i.setData(data()); } template auto Slice::end() const -> Slice::IType { IType i = MAB::mProtoI; i = i.max(); // CHECK !!! //i = std::get(mBlockSizes); return i.setData(data()); } } // end namespace MultiArrayTools #endif