array_iterator.hpp

//
// Created by sauliac on 20/03/2020.
//
 
#ifndef __ARRAY_ITERATOR_HPP_
#define __ARRAY_ITERATOR_HPP_
 
#include <vector>
 
#include "headcpp.hpp"
#include "dim_array.hpp"
 
namespace Kadath {
 
    class Array_iterator : public Memory_mapped
    {
    protected:
        Dim_array sizes ;
        Memory_mapped_array<int> steps;
        int position; 
 
    public:
        explicit Array_iterator(int ndim, int tndim) : sizes{ndim}, steps(ndim + 1), position{0}
        {steps.front()=1; for(int i=0;i<ndim;i++) {steps[i+1] = steps[i]*tndim; sizes.set(i) = tndim;}}
        explicit Array_iterator (const Dim_array& dim) : sizes{dim}, steps(dim.get_ndim() + 1), position{0}
        {steps.front()=1; for(int i=0;i<dim.get_ndim();i++) steps[i+1] = steps[i]*sizes(i);}
 
        //Copy constructor and assignment operator, move constructor and assignment as well as the destructor are the
        // default ones generated by the compiler.
        int get_ndim() const {return sizes.get_ndim() ;} ;
        int get_position() const {return position;}
 
        bool operator==(Array_iterator const & xx) const {return (position == xx.position && get_ndim() == xx.get_ndim());}
        Array_iterator & set_value(int _position) { position = _position; return *this;}
        Array_iterator & set(Array_iterator const &_so) {position = _so.position; return *this;}
        bool check_value();
        void set_start() { position = 0;}
        Dim_array const& get_sizes() const {return sizes ;} ;
        bool inc (int increm, int var=0) { position += increm * steps[var]; return check_value();}
        bool inc1(int var)  { position += steps[var]; return check_value();}
        bool inc() {position++; return check_value(); }
        template <class> friend class Array ;
    };
 
    inline bool Array_iterator::check_value() {
        if(position >= steps.back()) {
            position = steps.back() - 1;
            return false;
        }
        else return true;
    }
 
}
 
#endif //__ARRAY_ITERATOR_HPP_