div_op.hpp

//
// (c) Copyright 2011 DESY, Eugen Wintersberger <eugen.wintersberger@desy.de>
//
// This file is part of libpnicore.
//
// libpnicore is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 2 of the License, or
// (at your option) any later version.
//
// libpnicore is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with libpnicore.  If not, see <http://www.gnu.org/licenses/>.
//
// ============================================================================
//
// Created on: Jul 25,2012
//     Author: Eugen Wintersberger <eugen.wintersberger@desy.de>
//
#pragma once

#include "op_traits.hpp"
#include "../../utilities/container_iterator.hpp"

namespace pni{
namespace core{
    
    template<typename ATYPE> class array_view;

    template<
             typename OP1T,
             typename OP2T
            > 
    class div_op
    {
        private:
            typename op_trait<OP1T>::ref_type _op1;
            typename op_trait<OP2T>::ref_type _op2;
        public:
            //--------------------public types---------------------------------
            typedef typename OP1T::value_type value_type;
            typedef div_op<OP1T,OP2T> array_type;
            typedef void storage_type;
            typedef container_iterator<array_type> iterator;
            typedef container_iterator<const array_type> const_iterator;
            typedef container_iterator<array_type> reverse_iterator;
            typedef container_iterator<const array_type> const_reverse_iterator;
            typedef array_view<array_type> view_type;
            typedef typename array_trait<OP1T,OP2T>::map_type map_type;
            typedef typename array_trait<OP1T,OP2T>::inplace_arithmetic
                inplace_arithmetic;

            //===================constructors==================================
            div_op(const OP1T &o1,const OP2T &o2):
                _op1(o1),
                _op2(o2)
            {}

            //====================public methods===============================
            value_type operator[](size_t i) const
            {
                return this->_op1[i]/this->_op2[i];
            }

            //-----------------------------------------------------------------
            value_type at(size_t i) const 
            { 
                if(i>=size())
                    throw index_error(EXCEPTION_RECORD,"index exceeds size");

                return (*this)[i]; 
            }

            //-----------------------------------------------------------------
            size_t size() const
            {
                return _op1.size() > _op2.size() ?  _op1.size() : _op2.size();
            }

            //=====================iterators===================================
            const_iterator begin() const
            {
                return const_iterator(this,0);
            }

            //-----------------------------------------------------------------
            const_iterator end() const
            {
                return const_iterator(this,this->size());
            }
    };

//end of namespace
}
}