Array2D.h

Go to the documentation of this file.

/********************************************************************
**                Image Component Library (ICL)                    **
**                                                                 **
** Copyright (C) 2006-2013 CITEC, University of Bielefeld          **
**                         Neuroinformatics Group                  **
** Website: www.iclcv.org and                                      **
**          http://opensource.cit-ec.de/projects/icl               **
**                                                                 **
** File   : ICLUtils/src/ICLUtils/Array2D.h                        **
** Module : ICLUtils                                               **
** Authors: Christof Elbrechter                                    **
**                                                                 **
**                                                                 **
** GNU LESSER GENERAL PUBLIC LICENSE                               **
** This file may be used under the terms of the GNU Lesser General **
** Public License version 3.0 as published by the                  **
**                                                                 **
** Free Software Foundation and appearing in the file LICENSE.LGPL **
** included in the packaging of this file.  Please review the      **
** following information to ensure the license requirements will   **
** be met: http://www.gnu.org/licenses/lgpl-3.0.txt                **
**                                                                 **
** The development of this software was supported by the           **
** Excellence Cluster EXC 277 Cognitive Interaction Technology.    **
** The Excellence Cluster EXC 277 is a grant of the Deutsche       **
** Forschungsgemeinschaft (DFG) in the context of the German       **
** Excellence Initiative.                                          **
**                                                                 **
********************************************************************/

#pragma once

#include <ICLUtils/CompatMacros.h>
#include <ICLUtils/SmartArray.h>
#include <ICLUtils/Size.h>
#include <ICLUtils/Point.h>
#include <algorithm>

namespace icl{
  namespace utils{


    template<class T>
    class Array2D{

      Size m_size;

      SmartArray<T> m_data;

      public:

      typedef T* iterator;

      typedef const T* const_iterator;

      inline Array2D(){}

      inline Array2D(int w,int h):
      m_size(w,h),m_data(new T[w*h]){}

      inline Array2D(const Size &s):
      m_size(s),m_data(new T[s.getDim()]){}

      template<class Init>
      inline Array2D(int w, int h, Init init):
      m_size(w,h),m_data(new T[w*h]){
        fill(init);
      }

      template<class Init>
      inline Array2D(const Size &s, Init init):
      m_size(s),m_data(new T[s.getDim()]){
        fill(init);
      }

      inline Array2D(int w, int h, T *data, bool deepCopy=false):
      m_size(w,h),m_data(deepCopy ? new T[w*h] : data, deepCopy){
        if(deepCopy) assign(data,data+w*h);
      }

      inline Array2D(const Size &s, T *data, bool deepCopy=false):
      m_size(s),m_data(deepCopy ? new T[s.getDim()] : data, deepCopy){
        if(deepCopy) assign(data,data+s.getDim());
      }

      inline Array2D(int w, int h,const T *data):
      m_size(w,h),m_data(new T[w*h]){
        assign(data,data+w*h);
      }

      inline Array2D(const Size &s,const T *data):
      m_size(s),m_data(new T[s.getDim()]){
        assign(data,data+s.getDim());
      }

      template<class Iterator>
      inline Array2D(int w, int h,Iterator begin, Iterator end):
      m_size(w,h),m_data(new T[w*h]){
        assign(begin,end);
      }

      template<class Iterator>
      inline Array2D(const Size &s,Iterator begin, Iterator end):
      m_size(s),m_data(new T[s.getDim()]){
        assign(begin,end);
      }


      template<class Value>
      inline void fill(Value val){
        std::fill(begin(),end(),val);
      }

      template<class Iterator>
      inline void assign(Iterator begin, Iterator end){
        std::copy(begin,end,this->begin());
      }

      inline int getWidth() const { return m_size.width; }

      inline int getHeight() const { return m_size.height; }

      inline int getDim() const { return m_size.getDim(); }

      inline const Size &getSize() const { return m_size; }


      inline T &operator[](int idx) { return m_data.get()[idx]; }

      inline const T &operator[](int idx) const{ return m_data.get()[idx]; }

      inline T &operator()(int x,int y) { return m_data.get()[x+m_size.width*y]; }

      inline const T &operator()(int x, int y) const{ return m_data.get()[x+m_size.width*y]; }


      inline iterator begin() { return m_data.get(); }

      inline const_iterator begin() const { return m_data.get(); }

      inline iterator end() { return m_data.get()+getDim(); }

      inline const_iterator end() const{ return m_data.get()+getDim(); }

      inline Array2D<T> deepCopy() const{
        return Array2D<T>(getSize(),begin(),end());
      }


      inline void detach(){
          if(m_data.use_count() > 1){
            SmartArray<T> det(new T[getDim()]);
            std::copy(begin(),end(),det.get());
            m_data = det;
          }
      }

      inline T* data() { return begin(); }

      inline const T* data() const { return begin(); }


      inline const T &minElem(Point *pos=0) const {
        int idx = (int)(std::min_element(begin(),end()) - begin());
        if(pos) *pos = Point(idx%getWidth(),idx/getWidth());
        return data()[idx];
      }


      inline const T &maxElem(Point *pos=0) const {
        int idx = (int)(std::max_element(begin(),end()) - begin());
        if(pos) *pos = Point(idx%getWidth(),idx/getWidth());
        return data()[idx];
      }


      void setSize(const Size &size){
        if(getSize() == size) return;
        m_size = size;
        m_data = new T[size.getDim()];
      }


      template<class Init>
      void setSize(const Size &size, const Init &init){
        setSize(size);
        fill(init);
      }
    };



  } // namespace utils
}