STK_Array1D.h

Go to the documentation of this file.

/*--------------------------------------------------------------------*/
/*     Copyright (C) 2004-2016  Serge Iovleff, Université Lille 1, Inria
 
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as
    published by the Free Software Foundation; either version 2 of the
    License, or (at your option) any later version.
 
    This program 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 Lesser General Public License for more details.
 
    You should have received a copy of the GNU Lesser General Public
    License along with this program; if not, write to the
    Free Software Foundation, Inc.,
    59 Temple Place,
    Suite 330,
    Boston, MA 02111-1307
    USA
 
    Contact: S..._Dot_I..._At_stkpp_Dot_org (see copyright for ...)
*/
 
/*
 * Project:  stkpp::Arrays
 * created on: 26 nov. 2007
 * Author:   Serge Iovleff, S..._Dot_I..._At_stkpp_Dot_org (see copyright for ...)
 **/
 
#ifndef STK_ARRAY1D_H
#define STK_ARRAY1D_H
 
#include "STK_IArray1D.h"
 
namespace STK
{
template<class Type_, int Size_ = UnknownSize > class Array1D;
 
namespace hidden
{
template<class Type_, int Size_>
struct Traits< Array1D<Type_, Size_> >
{
  typedef Array1D<Type_, 1>     Row;
  typedef Array1D<Type_, Size_> Col;
  typedef Array1D<Type_, UnknownSize> SubVector;
 
  typedef Type_ Type;
  typedef typename RemoveConst<Type>::Type const& TypeConst;
 
  enum
  {
    structure_ = Arrays::vector_,
    orient_    = Arrays::by_col_,
    sizeCols_  = 1,
    sizeRows_  = Size_,
    size_      = Size_,
    storage_   = Arrays::dense_ // always dense
  };
 
  typedef MemAllocator<Type, size_> Allocator;
 
  typedef TRange<size_> RowRange;
  typedef TRange<1>     ColRange;
 
  typedef int Index;
 
  typedef DenseRandomIterator< Array1D<Type_, Size_> > Iterator;
  typedef ConstDenseRandomIterator< Array1D<Type_, Size_> > ConstIterator;
 
  typedef std::reverse_iterator<Iterator> ReverseIterator;
  typedef std::reverse_iterator<ConstIterator> ConstReverseIterator;
};
 
} // namespace hidden
 
}
 
namespace STK
{
template<class Type_, int Size_ >
class Array1D: public IArray1D< Array1D<Type_, Size_> >
{
  public:
    typedef IArray1D< Array1D<Type_, Size_> > Base;
    typedef typename hidden::Traits< Array1D<Type_, Size_> >::Allocator Allocator;
 
    enum
    {
      structure_ = hidden::Traits< Array1D<Type_, Size_> >::structure_,
      orient_    = hidden::Traits< Array1D<Type_, Size_> >::orient_,
      sizeCols_  = hidden::Traits< Array1D<Type_, Size_> >::sizeCols_,
      sizeRows_  = hidden::Traits< Array1D<Type_, Size_> >::sizeRows_,
      size_      = hidden::Traits< Array1D<Type_, Size_> >::size_,
      storage_   = hidden::Traits< Array1D<Type_, Size_> >::storage_
    };
 
    typedef typename hidden::Traits< Array1D <Type_, Size_> >::Type Type;
    typedef typename hidden::Traits< Array1D <Type_, Size_> >::TypeConst TypeConst;
 
    typedef typename hidden::Traits< Array1D <Type_, Size_> >::RowRange RowRange;
    typedef typename hidden::Traits< Array1D <Type_, Size_> >::ColRange ColRange;
 
    typedef typename hidden::Traits< Array1D<Type_, Size_> >::Iterator Iterator;
    typedef typename hidden::Traits< Array1D<Type_, Size_> >::ConstIterator ConstIterator;
    typedef typename hidden::Traits< Array1D<Type_, Size_> >::ReverseIterator ReverseIterator;
    typedef typename hidden::Traits< Array1D<Type_, Size_> >::ConstReverseIterator ConstReverseIterator;
 
    // Compatibility naming scheme with STL
    typedef Iterator iterator;
    typedef ConstIterator const_iterator;
    typedef ReverseIterator reverse_iterator;
    typedef ConstReverseIterator const_reverse_iterator;
 
    class InnerOperator;
    Array1D(): Base(){}
    Array1D( Range const& I): Base(I) {}
    Array1D( Range const& I, Type const& v): Base(I, v) {}
    Array1D( Array1D const& T, bool ref =false): Base(T, ref) {}
    template<int OtherSize>
    Array1D( Array1D<Type, OtherSize> const& T, bool ref =false): Base(T, ref) {}
    template<int OtherSize>
    Array1D( Array1D<Type, OtherSize> const& T, RowRange const& I, bool ref = true)
           : Base(T, I, ref) {}
    Array1D( Allocator const& A, Range const& I, bool ref): Base(A, I, ref) {}
    Array1D( Type* q, Range const& I): Base(q, I) {}
    ~Array1D() {}
    Array1D& operator=(Array1D const& T)
    { return this->assign(T);}
    template<class OtherArray>
    Array1D& operator=(ITContainer1D<OtherArray> const& T)
    {
      // check size
      if (this->range()!=T.range()) this->resize(T.range());
      for (int i=this->begin(); i<this->end(); i++) this->elt(i) = T.elt(i);
      return *this;
    }
    Array1D& operator=(Type const& v)
    {
      for (int i=this->begin(); i<this->end(); i++) this->elt(i)= v;
      return *this;
    }
};
 
} // namespace STK
 
#endif // STK_ARRAY1D_H