template One dimensional Horizontal List. More...

#include <STK_List1D.h>

Inheritance diagram for STK::List1D< Type_ >:

Public Types
enum	{ structure_ = hidden::Traits< List1D <Type_> >::structure_ , orient_ = hidden::Traits< List1D <Type_> >::orient_ , sizeRows_ = hidden::Traits< List1D <Type_> >::sizeRows_ , sizeCols_ = hidden::Traits< List1D <Type_> >::sizeCols_ , storage_ = hidden::Traits< List1D <Type_> >::storage_ }

typedef hidden::Traits< List1D< Type_ > >::Type	Type

typedef hidden::Traits< List1D< Type_ > >::TypeConst	TypeConst

typedef hidden::Traits< List1D< Type_ > >::RowRange	RowRange

typedef hidden::Traits< List1D< Type_ > >::ColRange	ColRange

typedef ITContainer1D< List1D< Type > >	Base

typedef CellHo< Type >	Cell

typedef hidden::Traits< List1D< Type_ > >::Iterator	Iterator

typedef hidden::Traits< List1D< Type_ > >::ConstIterator	ConstIterator

typedef hidden::Traits< List1D< Type_ > >::ReverseIterator	ReverseIterator

typedef hidden::Traits< List1D< Type_ > >::ConstReverseIterator	ConstReverseIterator

typedef Iterator	iterator

typedef ConstIterator	const_iterator

typedef ReverseIterator	reverse_iterator

typedef ConstReverseIterator	const_reverse_iterator

Public Types inherited from STK::ITContainer1D< List1D< Type_ > >
enum

typedef hidden::Traits< List1D< Type_ > >::Type	Type

typedef hidden::Traits< List1D< Type_ > >::TypeConst	TypeConst

typedef hidden::Traits< List1D< Type_ > >::RowRange	RowRange

typedef hidden::Traits< List1D< Type_ > >::ColRange	ColRange

typedef hidden::Traits< List1D< Type_ > >::Row	Row

typedef hidden::Traits< List1D< Type_ > >::Col	Col

typedef hidden::Traits< List1D< Type_ > >::SubVector	SubVector

typedef hidden::Traits< List1D< Type_ > >::Iterator	Iterator

typedef hidden::Traits< List1D< Type_ > >::ConstIterator	ConstIterator

typedef hidden::Traits< List1D< Type_ > >::ReverseIterator	ReverseIterator

typedef hidden::Traits< List1D< Type_ > >::ConstReverseIterator	ConstReverseIterator

Public Member Functions
	List1D ()
	Default constructor : empty List.

	List1D (Range const &I)
	constructor with specified Range.

	List1D (Range const &I, Type const &v)
	Misc constructor, initialization with a constant.

	List1D (List1D< Type > const &T)
	Copy constructor.

	List1D (List1D< Type > const &T, Range const &J, bool ref=true)
	access to many elements.

RowRange const &	rows () const

int	beginRows () const

int	endRows () const

int	sizeRows () const

ColRange	cols () const

int	beginCols () const

int	endCols () const

int	sizeCols () const

int	lastIdxRows () const

int	lastIdxCols () const

	~List1D ()
	destructor.

Cell const *const	p_begin () const

Cell const *const	p_lastIdx () const

Type &	elt1Impl (int pos)
	access to one element.

Type const &	elt1Impl (int pos) const
	access to one element const.

List1D	subImpl (Range const &J) const
	access to many elements.

void	shiftImpl (int const &beg)
	New first index for the object.

void	clear ()
	Clear the object.

void	pushBack (int const &n=1)
	Add n Elts to the container.

void	insert (Range const &I, Type const &v)
	Insert element `v` in the range `I` of the List1D.

void	merge (List1D const &other)
	merge this with other.

void	insertElt (int pos, int const &n=1)
	Insert n elts at the position pos of the container.

void	popBack (int const &n=1)
	Delete n last elements of the container.

void	erase (int pos, int const &n=1)
	Delete n elts at the pos index to the container.

void	swap (int const &j1, int const &j2)
	Swapping the j1th column and the j2th column.

List1D &	operator= (const List1D &T)
	operator = : overwrite the List1D with T.

List1D< Type > &	resizeImpl (Range const &I)
	Resize the container.

List1D< Type > &	operator= (Type const &v)
	operator= : set the container to a constant value.

int	begin () const

int	end () const

int	size () const

int	lastIdx () const

Public Member Functions inherited from STK::ITContainer1D< List1D< Type_ > >
RowRange const &	range () const

int	begin () const

int	end () const

int	size () const

int	lastIdx () const

Iterator	beginIterator ()

Iterator	endIterator ()

ConstIterator	beginConstIterator () const

ConstIterator	endConstIterator () const

ReverseIterator	rbeginIterator ()

ReverseIterator	rendIterator ()

ConstReverseIterator	rbeginConstIterator () const

ConstReverseIterator	rendConstIterator () const

bool	empty () const
	Is there some data ?

Type &	elt (int i)

TypeConst	elt (int i) const

Type &	operator[] (int i)

TypeConst	operator[] (int i) const

Type &	at (int i)

TypeConst	at (int i) const

SubVector	sub (Range const &I) const
	Access to many elements.

Type &	front ()

TypeConst	front () const

Type &	back ()

TypeConst	back () const

void	shift (int beg)

List1D< Type_ > &	resize (Range const &I=RowRange())

Public Member Functions inherited from STK::IRecursiveTemplate< Derived >
Derived &	asDerived ()
	static cast : return a reference of this with a cast to the derived class.

Derived const &	asDerived () const
	static cast : return a const reference of this with a cast to the derived class.

Derived *	asPtrDerived ()
	static cast : return a ptr on a `Derived` of this with a cast to the derived class.

Derived const *	asPtrDerived () const
	static cast : return a ptr on a constant `Derived` of this with a cast to the derived class.

Derived *	clone () const
	create a leaf using the copy constructor of the Derived class.

Derived *	clone (bool isRef) const
	create a leaf using the copy constructor of the Derived class and a flag determining if the clone is a reference or not.

Public Member Functions inherited from STK::TRef<-1 >
bool	isRef () const

bool	ref () const

void	exchange (TRef const &T)
	swap this with the container T.

void	setRef (bool ref) const
	Modify the container : can become a reference or the owner of the data.

Protected Member Functions
	List1D (Cell const &p_first, Cell const &p_last, Range const &J)
	constructor by reference, ref_=1.

void	initialize (Range const &I)
	Protected function for initialization.

void	freeMem ()
	Protected function for deallocation.

Protected Member Functions inherited from STK::ITContainer1D< List1D< Type_ > >
	ITContainer1D ()
	Default constructor.

	ITContainer1D (RowRange const &I)
	constructor with a specified range.

	~ITContainer1D ()
	destructor.

void	exchange (ITContainer1D &T)
	exchange this container with T

void	setRange (RowRange const &I=RowRange())
	Set range of the rows of the container.

void	incRange (int n=1)
	increment the range of the container (can be negative).

void	incFirst (int n=1)
	increment the beginning of the container (can be negative).

void	decFirst (int n=1)
	decrement the beginning of the container.

void	incLast (int n=1)
	increment the end of the container (can be negative).

void	decLast (int n=1)
	decrement the end of the container.

Protected Member Functions inherited from STK::IRecursiveTemplate< Derived >
	IRecursiveTemplate ()
	constructor.

	~IRecursiveTemplate ()
	destructor.

Protected Member Functions inherited from STK::TRef<-1 >
	TRef (bool ref)
	Default constructor We have to specify the member ref_.

	~TRef ()
	destructor.

Protected Attributes
Cell *	p_begin_
	First Element of the List.

Cell *	p_last_
	Last Element of the List.

Private Member Functions
void	setDefault ()
	set members values to default.

void	moveCurrentPositionLeft () const
	Move CurrentPositionent position to left.

void	moveCurrentPositionRight () const
	move CurrentPositionent position to right

void	moveCurrentPosition (int pos) const
	Move the current position to pos.

Private Attributes
int	currentPosition_
	Current position of pointer p_current_ in the List1D.

Cell *	p_current_
	Current position pointed in the List1D.

Detailed Description

template<class Type_>
class STK::List1D< Type_ >

template One dimensional Horizontal List.

A List1D is an implementation of the Interface ITContainer1D for list of homogeneous objects.

Definition at line 112 of file STK_List1D.h.

Member Typedef Documentation

◆ Base

template<class Type_ >

typedef ITContainer1D< List1D<Type> > STK::List1D< Type_ >::Base

Definition at line 129 of file STK_List1D.h.

◆ Cell

template<class Type_ >

typedef CellHo<Type> STK::List1D< Type_ >::Cell

Definition at line 130 of file STK_List1D.h.

◆ ColRange

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::ColRange STK::List1D< Type_ >::ColRange

Definition at line 128 of file STK_List1D.h.

◆ const_iterator

template<class Type_ >

typedef ConstIterator STK::List1D< Type_ >::const_iterator

Definition at line 139 of file STK_List1D.h.

◆ const_reverse_iterator

template<class Type_ >

typedef ConstReverseIterator STK::List1D< Type_ >::const_reverse_iterator

Definition at line 141 of file STK_List1D.h.

◆ ConstIterator

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::ConstIterator STK::List1D< Type_ >::ConstIterator

Definition at line 133 of file STK_List1D.h.

◆ ConstReverseIterator

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::ConstReverseIterator STK::List1D< Type_ >::ConstReverseIterator

Definition at line 135 of file STK_List1D.h.

◆ Iterator

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::Iterator STK::List1D< Type_ >::Iterator

Definition at line 132 of file STK_List1D.h.

◆ iterator

template<class Type_ >

typedef Iterator STK::List1D< Type_ >::iterator

Definition at line 138 of file STK_List1D.h.

◆ reverse_iterator

template<class Type_ >

typedef ReverseIterator STK::List1D< Type_ >::reverse_iterator

Definition at line 140 of file STK_List1D.h.

◆ ReverseIterator

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::ReverseIterator STK::List1D< Type_ >::ReverseIterator

Definition at line 134 of file STK_List1D.h.

◆ RowRange

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::RowRange STK::List1D< Type_ >::RowRange

Definition at line 127 of file STK_List1D.h.

◆ Type

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::Type STK::List1D< Type_ >::Type

Definition at line 115 of file STK_List1D.h.

◆ TypeConst

template<class Type_ >

typedef hidden::Traits<List1D<Type_>>::TypeConst STK::List1D< Type_ >::TypeConst

Definition at line 116 of file STK_List1D.h.

Member Enumeration Documentation

◆ anonymous enum

template<class Type_ >

anonymous enum

Enumerator
structure_
orient_
sizeRows_
sizeCols_
storage_

Definition at line 118 of file STK_List1D.h.

    {
      structure_ = hidden::Traits< List1D <Type_> >::structure_,
      orient_    = hidden::Traits< List1D <Type_> >::orient_,
      sizeRows_  = hidden::Traits< List1D <Type_> >::sizeRows_,
      sizeCols_  = hidden::Traits< List1D <Type_> >::sizeCols_,
      storage_   = hidden::Traits< List1D <Type_> >::storage_
    };

Constructor & Destructor Documentation

◆ List1D() [1/6]

template<class Type_ >

STK::List1D< Type_ >::List1D ( )

inline

Default constructor : empty List.

Definition at line 149 of file STK_List1D.h.

149: Base(), IContainerRef(false) { initialize(Range()); }

STK::List1D::initialize

void initialize(Range const &I)

Protected function for initialization.

Definition STK_List1D.h:611

STK::List1D::Base

ITContainer1D< List1D< Type > > Base

Definition STK_List1D.h:129

STK::IContainerRef

TRef<-1 > IContainerRef

Definition STK_IContainerRef.h:102

STK::Range

TRange< UnknownSize > Range

Definition STK_Range.h:59

References STK::List1D< Type_ >::initialize().

Referenced by STK::List1D< Type_ >::List1D(), and STK::List1D< Type_ >::subImpl().

◆ List1D() [2/6]

template<class Type_ >

STK::List1D< Type_ >::List1D ( Range const & I )

inline

constructor with specified Range.

Parameters

I	range of the container

Definition at line 153 of file STK_List1D.h.

153 : Base(I), IContainerRef(false)

154 { initialize(I); }

References STK::List1D< Type_ >::initialize().

◆ List1D() [3/6]

template<class Type_ >

STK::List1D< Type_ >::List1D	(	Range const &	I,
		Type const &	v
	)

inline

Misc constructor, initialization with a constant.

Parameters

I	range of the container
v	initial value of the container

Definition at line 159 of file STK_List1D.h.

          : ITContainer1D<List1D >(I), IContainerRef(false)
    { initialize(I);
      Cell* p1  = p_begin_;
      for ( int j=begin(); j<end(); j++)
      { (*p1) = v;             // overwrite the value of the current cell
        p1    = p1->getRight();   // Goto Right place
      }
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::end(), STK::List1D< Type_ >::initialize(), and STK::List1D< Type_ >::p_begin_.

◆ List1D() [4/6]

template<class Type_ >

STK::List1D< Type_ >::List1D ( List1D< Type > const & T )

inline

Copy constructor.

Parameters

T	the list to copy

Definition at line 171 of file STK_List1D.h.

                                  : Base(T), IContainerRef(false)
                                  , p_begin_(0), p_last_(0), currentPosition_(0), p_current_(0)
    {
      // initialize container
      initialize(T.range());
      // copy the container
      Cell* p1  = p_begin_;
      Cell* pt1 = T.p_begin_;
      for (int j=T.begin(); j<T.end(); j++)
      { (*p1) = pt1->data();   // write the value of the current cell
        p1    = p1->getRight();   // Goto Right
        pt1   = pt1->getRight();  // Goto Right
      }
    }

References STK::List1D< Type_ >::initialize(), and STK::List1D< Type_ >::p_begin_.

◆ List1D() [5/6]

template<class Type_ >

STK::List1D< Type_ >::List1D	(	List1D< Type > const &	T,
		Range const &	J,
		bool	ref = `true`
	)

inline

access to many elements.

Parameters

T	the list to reference
J	the range of the elements
ref	is this a reference of T ?

Returns: a list with a reference to the elements in the given range

Definition at line 191 of file STK_List1D.h.

          : Base(J), IContainerRef(ref)
    {
#ifdef STK_BOUNDS_CHECK
      if ((J.begin()<T.begin()))
      { STKOUT_OF_RANGE_1ARG(List1D::List1D,J,J.begin()<T.begin());}
      if ((J.lastIdx()>T.lastIdx()))
      { STKOUT_OF_RANGE_1ARG(List1D::List1D,J,J.lastIdx()>T.lastIdx());}
#endif
      if (!ref)
      {
        initialize(J);
        (*this) = T;
      }
      else
      {
        T.moveCurrentPosition(J.begin());
        p_begin_ = T.p_current_;
        moveCurrentPosition(J.lastIdx());
        p_last_ = T.p_current_;
        currentPosition_  = begin();
        p_current_ = p_begin_;
      }
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_current_, STK::List1D< Type_ >::p_last_, STK::TRef<-1 >::ref(), and STKOUT_OF_RANGE_1ARG.

◆ List1D() [6/6]

template<class Type_ >

STK::List1D< Type_ >::List1D	(	Cell *const &	p_first,
		Cell *const &	p_last,
		Range const &	J
	)

inlineprotected

constructor by reference, ref_=1.

This constructor does not copy physically the elements contained in the Container. The List1D is wrapped by a reference List1D reduced to the range J.

Parameters

p_first	the first cell of the container to wrap
p_last	the last cell of the container to wrap
J	range of the data to wrap

Definition at line 248 of file STK_List1D.h.

         : Base(J), IContainerRef(true)
          , p_begin_(p_first)
          , p_last_(p_last)
    {
      currentPosition_  = begin();
      p_current_ = p_first;
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, and STK::List1D< Type_ >::p_current_.

◆ ~List1D()

template<class Type_ >

STK::List1D< Type_ >::~List1D ( )

inline

destructor.

Definition at line 258 of file STK_List1D.h.

258{ if (!this->isRef()) freeMem();}

STK::List1D::freeMem

void freeMem()

Protected function for deallocation.

Definition STK_List1D.h:651

STK::TRef<-1 >::isRef

bool isRef() const

Definition STK_IContainerRef.h:81

References STK::List1D< Type_ >::freeMem(), and STK::TRef<-1 >::isRef().

Member Function Documentation

◆ begin()

template<class Type_ >

int STK::ITContainer1D< Derived >::begin ( ) const

inline

Returns: the index of the first element

Definition at line 113 of file STK_ITContainer1D.h.

113{ return range_.begin();}

STK::ITContainer1D< List1D< Type_ > >::range_

RowRange range_

range of the array.

Definition STK_ITContainer1D.h:279

◆ beginCols()

template<class Type_ >

int STK::List1D< Type_ >::beginCols ( ) const

inline

Returns: the index of the first column

Definition at line 227 of file STK_List1D.h.

227{ return baseIdx;}

STK::baseIdx

const int baseIdx

base index of the containers created in STK++.

Definition STK_Constants.h:63

References STK::baseIdx.

◆ beginRows()

template<class Type_ >

int STK::List1D< Type_ >::beginRows ( ) const

inline

Returns: the index of the first element

Definition at line 218 of file STK_List1D.h.

218{ return begin();}

References STK::List1D< Type_ >::begin().

◆ clear()

template<class Type_ >

void STK::List1D< Type_ >::clear ( )

inline

Clear the object.

Memory is liberated and the range of the Container is set to 0:-1.

Definition at line 314 of file STK_List1D.h.

    {
      if (this->isRef()) return;   // Nothing to do for ref
      freeMem();        // Free mem
      this->setRange(); // Set to default the dimension
    }

References STK::List1D< Type_ >::freeMem(), STK::TRef<-1 >::isRef(), and STK::ITContainer1D< List1D< Type_ > >::setRange().

◆ cols()

template<class Type_ >

ColRange STK::List1D< Type_ >::cols ( ) const

inline

Returns: the Horizontal range (1 column)

Definition at line 225 of file STK_List1D.h.

225{ return ColRange(1);}

STK::List1D::ColRange

hidden::Traits< List1D< Type_ > >::ColRange ColRange

Definition STK_List1D.h:128

◆ elt1Impl() [1/2]

template<class Type_ >

Type & STK::List1D< Type_ >::elt1Impl ( int pos )

inline

access to one element.

Parameters

pos	index of the element

Returns: a reference on the element pos

Definition at line 267 of file STK_List1D.h.

    {
      moveCurrentPosition(pos);
      return (p_current_->data());
    }

References STK::List1D< Type_ >::moveCurrentPosition(), and STK::List1D< Type_ >::p_current_.

◆ elt1Impl() [2/2]

template<class Type_ >

Type const & STK::List1D< Type_ >::elt1Impl ( int pos ) const

inline

access to one element const.

Parameters

pos	index of the const element

Returns: a constant reference on the element pos

Definition at line 276 of file STK_List1D.h.

    {
      moveCurrentPosition(pos);
      return (p_current_->data());
    }

References STK::List1D< Type_ >::moveCurrentPosition(), and STK::List1D< Type_ >::p_current_.

◆ end()

template<class Type_ >

int STK::ITContainer1D< Derived >::end ( ) const

inline

Returns: the ending index of the elements

Definition at line 115 of file STK_ITContainer1D.h.

115{ return range_.end();}

Referenced by STK::List1D< Type_ >::endRows(), STK::List1D< Type_ >::freeMem(), STK::List1D< Type_ >::initialize(), and STK::List1D< Type_ >::List1D().

◆ endCols()

template<class Type_ >

int STK::List1D< Type_ >::endCols ( ) const

inline

Returns: the index of the ending column

Definition at line 229 of file STK_List1D.h.

229{ return baseIdx+1;}

References STK::baseIdx.

◆ endRows()

template<class Type_ >

int STK::List1D< Type_ >::endRows ( ) const

inline

Returns: the ending index of the elements

Definition at line 220 of file STK_List1D.h.

220{ return end();}

References STK::List1D< Type_ >::end().

◆ erase()

template<class Type_ >

void STK::List1D< Type_ >::erase	(	int	pos,
		int const &	n = `1`
	)

inline

Delete n elts at the pos index to the container.

Parameters

pos	index where to delete elements
n	number of elements to delete (default 1)

Definition at line 475 of file STK_List1D.h.

    {
      // if n==0 nothing to do
      if (n<=0) return;
      // is this structure just a pointer?
      if (this->isRef())
      { STKRUNTIME_ERROR_2ARG(List1D::erase,pos, n,cannot operate on references.);}
      // check bounds
      if (begin() > pos)
      { STKOUT_OF_RANGE_2ARG(List1D::erase,pos, n,begin()>pos);}
      if (this->lastIdx() < pos)
      { STKOUT_OF_RANGE_2ARG(List1D::erase,pos, n,lastIdx() < pos);}
      if (this->lastIdx() < pos+n-1)
      { STKOUT_OF_RANGE_2ARG(List1D::erase,pos, n,lastIdx() < pos+n-1);}
      // Move the current position to pos
      moveCurrentPosition(pos);
      Cell* p2 = p_current_;  // get pos-th cell
      moveCurrentPositionLeft();       // set current to (pos-1)th position
      // delete n cells
      for (int l=1; l<=n; l++)
      { Cell* p3 = p2->getRight();  // get right cell in p3
        delete p2;                          // delete current cell
        p2 = p3;                            // next
      }
      // If the last column have been erased update p_last_
      if (pos+n-1 == this->lastIdx()) { p_last_ = p_current_;}
      // Update the dimension of the container
      this->decLast(n);
      // If we have erased all cols
      if (size() == 0)
      { setDefault();}
      else
      { p2->setLeft(p_current_);        // p2 is the j+n cell
        p_current_->setRight(p2);       // p_current_ is on j-1 cell
        // If the first column has been erased
        if (pos == begin())
        { p_begin_  = p2;   // Set the new beg cell
          p_current_ = p2;   // p_current_
          currentPosition_++;       // and current position
        }
      }
    }

Referenced by STK::List1D< Type_ >::erase(), and STK::List1D< Type_ >::popBack().

◆ freeMem()

template<class Type_ >

void STK::List1D< Type_ >::freeMem ( )

inlineprotected

Protected function for deallocation.

Definition at line 651 of file STK_List1D.h.

    {
      if (this->isRef()) return;   // Nothing to do for ref
      Cell *p2, *p1 =p_begin_;   // Auxiliary pointers for cells
      // for all cells
      for (int j=begin(); j<end(); j++)
      { p2 = p1->getRight();               // get the right cell
        delete p1;                         // delete the curent cell
        p1 = p2;                           // and iterate
      }
      setDefault();
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::end(), STK::TRef<-1 >::isRef(), STK::List1D< Type_ >::p_begin_, and STK::List1D< Type_ >::setDefault().

Referenced by STK::List1D< Type_ >::clear(), and STK::List1D< Type_ >::~List1D().

◆ initialize()

template<class Type_ >

void STK::List1D< Type_ >::initialize ( Range const & I )

inlineprotected

Protected function for initialization.

Definition at line 611 of file STK_List1D.h.

    {
       // set new dimensions
      this->setRange(I);
      if (this->empty())
      {
        setDefault(); return;
      }
      // Allocate memory for the cells
      Cell *p1, *p2;        // Auxiliary pointer for cells
 
      p1 = new Cell();        // pointer on the first cell
      p_begin_ = p1;                     // set the first cell
      // main loop for the other cells
      for (int j=begin()+1; j<end(); j++)
      { try
        { p2 = new Cell(p1);}        // try to allocate memory
        catch (std::bad_alloc & error)       // if an alloc error occur
        { while (p1 != (Cell*)NULL)  // for all cells allocated
          { p2 = p1->getLeft();              // get the cell left
            delete p1;                       // delete the cell
            p1 = p2;                         // and iterate
          }
          // set default
          setDefault();
          this->setRange();
          // and throw the Exception
          STKRUNTIME_ERROR_1ARG(List1D::initialize,I,memory allocation failed);
        }
        // if no error is catched
        p1->setRight(p2);      // Set the right cell
        p1 = p2;               // and iterate
      }
      p_last_ = p1;              // Set the last cell
      p_last_->setRight(p_begin_);  // the last cell point on the first cell
      p_begin_->setLeft(p_last_);   // the first cell point on the last cell
      currentPosition_  = begin();    // current position is first position
      p_current_ = p_begin_;            // CurrentPositionent cell is first cell
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, STK::ITContainer1D< List1D< Type_ > >::empty(), STK::List1D< Type_ >::end(), STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_current_, STK::List1D< Type_ >::p_last_, STK::List1D< Type_ >::setDefault(), STK::ITContainer1D< List1D< Type_ > >::setRange(), and STKRUNTIME_ERROR_1ARG.

Referenced by STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), and STK::List1D< Type_ >::pushBack().

◆ insert()

template<class Type_ >

void STK::List1D< Type_ >::insert	(	Range const &	I,
		Type const &	v
	)

inline

Insert element v in the range I of the List1D.

Parameters

I	range of the index where to insert elements
v	the value tu insert

Definition at line 370 of file STK_List1D.h.

    {
      insertElt(I.begin(), I.size());
      for (int i=I.begin(); i<=I.lastIdx(); i++)
        this->elt(i) = v;
    }

References STK::ITContainer1D< List1D< Type_ > >::elt(), and STK::List1D< Type_ >::insertElt().

◆ insertElt()

template<class Type_ >

void STK::List1D< Type_ >::insertElt	(	int	pos,
		int const &	n = `1`
	)

inline

Insert n elts at the position pos of the container.

Parameters

pos	index where to insert elements
n	number of elements to insert (default 1)

Definition at line 414 of file STK_List1D.h.

    {
      // if n<=0 nothing to do
      if (n <= 0) return;
      // is this structure just a pointer?
      if (this->isRef())
      { STKRUNTIME_ERROR_2ARG(List1D::insertElt,pos,n,cannot operate on references.);}
      if (begin() > pos)
      { STKOUT_OF_RANGE_2ARG(List1D::insertElt,pos,n,begin() > pos);}
      if (this->lastIdx()+1 < pos)
      { STKOUT_OF_RANGE_2ARG(List1D::insertElt,pos,n,lastIdx()+1 < pos);}
      // Move the current position to j
      moveCurrentPosition(pos);
      Cell *p0 = p_current_->getLeft(); // Get the j-1 cell
      Cell *p1 = p0;                    // Auxiliary cell;
      // main loop for the other cells
      for (int j1=1; j1<=n; j1++)
      {
        Cell *p2;        // Auxiliary cell;
        try
        { p2 = new Cell(p1);}  // try to allocate memory
        catch (std::bad_alloc & error) // if an alloc error occur
        { while ( p1 != p0)            // for all cells allocated
          { p2 = p1;                   // get the cell left
            delete p1;                 // delete the curent cell
            p1 = p2->getLeft();        // iterate
          }
          p0->setRight(p_current_);
          STKRUNTIME_ERROR_2ARG(List1D::insertElt,pos,n,memory allocation failed);
        } // catch block
        // if no error is intercepted
        p1->setRight(p2);  // Set the right cell of the current cell
        p1 = p2;           // iterate
      }
      p1->setRight(p_current_);     // the last cell point on the first cell
      p_current_->setLeft(p1);      // the first cell point on the last cell
      if ( pos==begin() )     // if the beginning was modified
      { p_begin_ = p0->getRight();} // set new beginning
      this->incLast(n);             // Update the size of the container
      currentPosition_ +=n;         // Update the current position
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, STK::ITContainer1D< List1D< Type_ > >::incLast(), STK::List1D< Type_ >::insertElt(), STK::TRef<-1 >::isRef(), STK::List1D< Type_ >::lastIdx(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_current_, STKOUT_OF_RANGE_2ARG, and STKRUNTIME_ERROR_2ARG.

Referenced by STK::List1D< Type_ >::insert(), STK::List1D< Type_ >::insertElt(), and STK::DataFrame::insertVariable().

◆ lastIdx()

template<class Type_ >

int STK::ITContainer1D< Derived >::lastIdx ( ) const

inline

Returns: the index of the last element

Definition at line 120 of file STK_ITContainer1D.h.

120{ return range_.lastIdx();}

Referenced by STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::insertElt(), STK::List1D< Type_ >::lastIdxRows(), STK::List1D< Type_ >::moveCurrentPosition(), STK::DataFrame::operator=(), STK::List1D< Type_ >::popBack(), STK::DataFrame::pushBackDataFrame(), STK::List1D< Type_ >::resizeImpl(), STK::List1D< Type_ >::subImpl(), and STK::List1D< Type_ >::swap().

◆ lastIdxCols()

template<class Type_ >

int STK::List1D< Type_ >::lastIdxCols ( ) const

inline

Returns: the index of the last element

Definition at line 236 of file STK_List1D.h.

236{ return baseIdx;}

References STK::baseIdx.

◆ lastIdxRows()

template<class Type_ >

int STK::List1D< Type_ >::lastIdxRows ( ) const

inline

Returns: the index of the last element

Definition at line 234 of file STK_List1D.h.

234{ return this->lastIdx();}

References STK::List1D< Type_ >::lastIdx().

◆ merge()

template<class Type_ >

void STK::List1D< Type_ >::merge ( List1D< Type_ > const & other )

inline

merge this with other.

other will become a reference.

Parameters

other the list to append

Definition at line 379 of file STK_List1D.h.

    {
      if (other.empty()) return;
      // is this structure just a pointer?
      if (this->isRef())
      { STKRUNTIME_ERROR_NO_ARG(List1D::merge(other),*this is a reference.);}
      // is T just a pointer?
      if (other.isRef())
      { STKRUNTIME_ERROR_NO_ARG(List1D::merge(other),other is a reference.);}
      // break const reference
      List1D& otherRef = const_cast<List1D&>(other);
      // compute horizontal range of the container after insertion
      Range range(this->range());
 
      // merge
      otherRef.p_begin_->setLeft(p_last_);
      otherRef.p_last_->setRight(p_begin_);
      p_last_->setRight(otherRef.p_begin_);
      p_last_ = otherRef.p_last_;
      p_begin_->setLeft(p_last_);
 
      // compute first index of the first column added
      const int first = range.lastIdx() + 1;
      this->setRange(range.incLast(otherRef.size()));
      otherRef.setRange(Range(first, other.size()));
      otherRef.setRef(true);
 
      // reset p_current_ to first position
      otherRef.currentPosition_ = first;
      otherRef.p_current_ = otherRef.p_begin_;
    }

References STK::TRange< UnknownSize >::incLast(), STK::TRef<-1 >::isRef(), STK::List1D< Type_ >::merge(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_last_, STK::ITContainer1D< List1D< Type_ > >::range(), STK::ITContainer1D< List1D< Type_ > >::setRange(), and STKRUNTIME_ERROR_NO_ARG.

Referenced by STK::List1D< Type_ >::merge().

◆ moveCurrentPosition()

template<class Type_ >

void STK::List1D< Type_ >::moveCurrentPosition ( int pos ) const

inlineprivate

Move the current position to pos.

Parameters

pos	the position to move

Definition at line 693 of file STK_List1D.h.

    {
      if (pos>currentPosition_)
      {
        if ((pos-currentPosition_) <= (this->lastIdx()-pos))
          for( ;currentPosition_!=pos; ) moveCurrentPositionRight();
        else  // else start from the end
          for( currentPosition_ = this->lastIdx(), p_current_ = p_last_; currentPosition_!=pos; )
            moveCurrentPositionLeft();
      }
      else
      {
        if ((currentPosition_-pos) <= (pos-begin()))
          for( ;currentPosition_!=pos; ) moveCurrentPositionLeft();
        else // else start from the beginning
          for( currentPosition_ = begin(), p_current_ = p_begin_; currentPosition_!=pos; )
            moveCurrentPositionRight();
      }
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, STK::List1D< Type_ >::lastIdx(), STK::List1D< Type_ >::moveCurrentPositionLeft(), STK::List1D< Type_ >::moveCurrentPositionRight(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_current_, and STK::List1D< Type_ >::p_last_.

Referenced by STK::List1D< Type_ >::elt1Impl(), STK::List1D< Type_ >::elt1Impl(), STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::insertElt(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::subImpl(), and STK::List1D< Type_ >::swap().

◆ moveCurrentPositionLeft()

template<class Type_ >

void STK::List1D< Type_ >::moveCurrentPositionLeft ( ) const

inlineprivate

Move CurrentPositionent position to left.

Definition at line 679 of file STK_List1D.h.

    {
      p_current_ = p_current_->getLeft();
      currentPosition_--;
    }

References STK::List1D< Type_ >::currentPosition_, and STK::List1D< Type_ >::p_current_.

Referenced by STK::List1D< Type_ >::erase(), and STK::List1D< Type_ >::moveCurrentPosition().

◆ moveCurrentPositionRight()

template<class Type_ >

void STK::List1D< Type_ >::moveCurrentPositionRight ( ) const

inlineprivate

move CurrentPositionent position to right

Definition at line 685 of file STK_List1D.h.

    {
      p_current_ = p_current_->getRight();
      currentPosition_++;
    }

References STK::List1D< Type_ >::currentPosition_, and STK::List1D< Type_ >::p_current_.

Referenced by STK::List1D< Type_ >::moveCurrentPosition().

◆ operator=() [1/2]

template<class Type_ >

List1D & STK::List1D< Type_ >::operator= ( const List1D< Type_ > & T )

inline

operator = : overwrite the List1D with T.

We resize the object if this and T does not have the same size but if they have the same size, we don't modify the range of the object.

Parameters

T	the container to copy

Definition at line 549 of file STK_List1D.h.

    {
      // We have to resize if this and T have not the same size
      // but if they have the same size, we don't scale the index
      if (size()!=T.size()) { this->resize(T.range());}
 
      /* copy without ovelapping.                                     */
      if (begin() < T.begin())
      { Cell *p1 = p_begin_, *pt1 = T.p_begin_;
        for (int j=1; j<=size(); j++)
        { (*p1) = pt1->data();   // overwrite the value
          p1    = p1->getRight();   // Goto Right for this
          pt1   = pt1->getRight();  // Goto Right for T
        }
      }
      else
      { Cell *p1 = p_last_, *pt1 = T.p_last_;
        for (int j=size(); j>=1; j--)
        { (*p1) = pt1->data();   // overwrite the value
          p1    = p1->getLeft();    // Goto Left for this
          pt1   = pt1->getLeft();   // Goto Left for T
        }
      }
      return *this;
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_last_, STK::ITContainer1D< Derived >::range(), STK::ITContainer1D< List1D< Type_ > >::resize(), and STK::List1D< Type_ >::size().

◆ operator=() [2/2]

template<class Type_ >

List1D< Type > & STK::List1D< Type_ >::operator= ( Type const & v )

inline

operator= : set the container to a constant value.

Parameters

v	the value to set

Definition at line 598 of file STK_List1D.h.

    {
      Cell* p1 = p_begin_;
      for (int j=1; j<=size(); j++)
      { p1->setData(v);      // overwrite the value of the current cell
        p1    = p1->getRight(); // Goto Right
      }
      return *this;
    }

References STK::List1D< Type_ >::p_begin_, STK::IRunnerSupervised< YArray_, XArray_, Weights_ >::setData(), and STK::List1D< Type_ >::size().

◆ p_begin()

template<class Type_ >

Cell const *const STK::List1D< Type_ >::p_begin ( ) const

inline

Returns: the pointer on the first cell of the list

Definition at line 260 of file STK_List1D.h.

260{ return p_begin_;}

References STK::List1D< Type_ >::p_begin_.

◆ p_lastIdx()

template<class Type_ >

Cell const *const STK::List1D< Type_ >::p_lastIdx ( ) const

inline

Returns: the pointer on the last cell of the list

Definition at line 262 of file STK_List1D.h.

262{ return p_last_;}

References STK::List1D< Type_ >::p_last_.

◆ popBack()

template<class Type_ >

void STK::List1D< Type_ >::popBack ( int const & n = 1 )

inline

Delete n last elements of the container.

Parameters

n	number of elts to delete

Definition at line 458 of file STK_List1D.h.

    {
      // if n<=0 nothing to do
      if (n <= 0) return;
      // is this structure just a pointer?
      if (this->isRef())
      { STKRUNTIME_ERROR_1ARG(List1D::popBack,n,cannot operate on references.);}
      // if there is elts to erase
      if (size()<n)
      { STKOUT_OF_RANGE_1ARG(List1D::popBack,n,size() < n);}
      // erase elts with pos = end -n +1
      erase(this->lastIdx() - n +1, n);
    }

References STK::List1D< Type_ >::erase(), STK::TRef<-1 >::isRef(), STK::List1D< Type_ >::lastIdx(), STK::List1D< Type_ >::popBack(), STK::List1D< Type_ >::size(), STKOUT_OF_RANGE_1ARG, and STKRUNTIME_ERROR_1ARG.

Referenced by STK::List1D< Type_ >::popBack(), and STK::List1D< Type_ >::resizeImpl().

◆ pushBack()

template<class Type_ >

void STK::List1D< Type_ >::pushBack ( int const & n = 1 )

inline

Add n Elts to the container.

Parameters

n	number of elements to add

Definition at line 323 of file STK_List1D.h.

    {
      // if n==0 nothing to do
      if (n <= 0) return;
      // is this structure just a pointer?
      if (this->isRef())
      { STKRUNTIME_ERROR_1ARG(List1D::pushBack,n,cannot operate on references.);}
      // If the container is empty : create it
      if (this->empty())
      { initialize(Range(begin(), n));}
      else  // else adjust the beginning and the sizes
      {
        Cell *p1, *p2;            // Auxiliary cells;
        try
        { p1 = new Cell(p_last_);} // Create the end+1 cell
        catch (std::bad_alloc & error)
        { STKRUNTIME_ERROR_1ARG(List1D::pushBack,n,memory allocation failed);}
        // if no error is intercepted
        p_last_->setRight(p1);             // Set the right ending cell
        for (int j=2; j<=n; j++)    // main loop for the other cells
        { try
          { p2 = new Cell(p1);}  // try to allocate memory
          catch (std::bad_alloc & error) // if an alloc error occur
          {
            while ( p1 != p_last_)       // for all cells allocated
            { p2 = p1->getLeft();        // get the cell left
              delete p1;                 // delete the curent cell
              p1 = p2;                   // iterate
            }
            // set the original right side of cend
            p_last_->setRight(p_begin_);
            STKRUNTIME_ERROR_1ARG(List1D::pushBack,n,memory allocation failed);
          } // end catch
          // if no error
          p1->setRight(p2);  // Set the right cell of the current cell
          p1 = p2;           // Set the current cell to the the next cell
        }
        p1->setRight(p_begin_);    // the last cell point on the first cell
        p_begin_->setLeft(p1);     // the first cell point on the last cell
        p_last_ = p1;              // the last cell adress
        this->incLast(n);          // Update size of the container
      }
    }

References STK::List1D< Type_ >::begin(), STK::ITContainer1D< List1D< Type_ > >::empty(), STK::ITContainer1D< List1D< Type_ > >::incLast(), STK::List1D< Type_ >::initialize(), STK::TRef<-1 >::isRef(), STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_last_, STK::List1D< Type_ >::pushBack(), and STKRUNTIME_ERROR_1ARG.

Referenced by STK::List1D< Type_ >::pushBack(), and STK::List1D< Type_ >::resizeImpl().

◆ resizeImpl()

template<class Type_ >

List1D< Type > & STK::List1D< Type_ >::resizeImpl ( Range const & I )

inline

Resize the container.

call shift
call pushBack if there will be more elements
call popBack if three will be less elements
Parameters

I the range to set to the List1D

Definition at line 580 of file STK_List1D.h.

     {
       // check if there is something to do
       if ( this->range() == I) return *this;
       if (this->isRef())
       { STKRUNTIME_ERROR_1ARG(List1D::resizeImpl,I,cannot operate on references);}
       // translate beg
       shiftImpl(I.begin());
       // compute number of elements to delete or add
       const int inc = I.lastIdx() - this->lastIdx();
       // adjust size of the container
       if (inc > 0) this->pushBack(inc);  // more elements
       else         this->popBack(-inc);  // less elements
       return *this;
     }

References STK::TRef<-1 >::isRef(), STK::List1D< Type_ >::lastIdx(), STK::List1D< Type_ >::popBack(), STK::List1D< Type_ >::pushBack(), STK::ITContainer1D< List1D< Type_ > >::range(), STK::List1D< Type_ >::resizeImpl(), STK::List1D< Type_ >::shiftImpl(), and STKRUNTIME_ERROR_1ARG.

Referenced by STK::List1D< Type_ >::resizeImpl().

◆ rows()

template<class Type_ >

RowRange const & STK::List1D< Type_ >::rows ( ) const

inline

Returns: the range of the rows of the container

Definition at line 216 of file STK_List1D.h.

216{ return this->range();}

References STK::ITContainer1D< List1D< Type_ > >::range().

◆ setDefault()

template<class Type_ >

void STK::List1D< Type_ >::setDefault ( )

inlineprivate

set members values to default.

Definition at line 671 of file STK_List1D.h.

    { p_begin_  = 0;
      p_last_  = 0;
      p_current_ = 0;
      currentPosition_  = begin();
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, STK::List1D< Type_ >::p_begin_, STK::List1D< Type_ >::p_current_, and STK::List1D< Type_ >::p_last_.

Referenced by STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::freeMem(), and STK::List1D< Type_ >::initialize().

◆ shiftImpl()

template<class Type_ >

void STK::List1D< Type_ >::shiftImpl ( int const & beg )

inline

New first index for the object.

Parameters

beg	new first index of the Container.

Definition at line 300 of file STK_List1D.h.

    {
      if (begin() == beg) return;
      // is this structure just a pointer?
      if (this->isRef())
      { STKRUNTIME_ERROR_1ARG(List1D::shift,beg,cannot operate on references);}
      //compute increment
      int inc = beg - begin();
      this->incRange(inc);  // update this->range_()
      currentPosition_ += inc;         // update current position
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::currentPosition_, STK::ITContainer1D< List1D< Type_ > >::incRange(), STK::TRef<-1 >::isRef(), STK::ITContainer1D< List1D< Type_ > >::shift(), and STKRUNTIME_ERROR_1ARG.

Referenced by STK::List1D< Type_ >::resizeImpl().

◆ size()

template<class Type_ >

int STK::ITContainer1D< Derived >::size ( ) const

inline

Returns: the size of the container

Definition at line 117 of file STK_ITContainer1D.h.

117{ return range_.size();}

Referenced by STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::operator=(), STK::List1D< Type_ >::operator=(), STK::List1D< Type_ >::popBack(), and STK::List1D< Type_ >::sizeRows().

◆ sizeCols()

template<class Type_ >

int STK::List1D< Type_ >::sizeCols ( ) const

inline

Returns: the number of columns

Definition at line 231 of file STK_List1D.h.

231{ return 1;};

◆ sizeRows()

template<class Type_ >

int STK::List1D< Type_ >::sizeRows ( ) const

inline

Returns: the size of the container

Definition at line 222 of file STK_List1D.h.

222{ return size();}

References STK::List1D< Type_ >::size().

◆ subImpl()

template<class Type_ >

List1D STK::List1D< Type_ >::subImpl ( Range const & J ) const

inline

access to many elements.

Parameters

J	the range of the elements

Returns: a list with a reference to the elements in the given range

Definition at line 285 of file STK_List1D.h.

    {
      if ((J.begin()<begin()))
      { STKOUT_OF_RANGE_1ARG(List1D::subImpl,J,J.begin()<begin());}
      if ((J.lastIdx()>this->lastIdx()))
      { STKOUT_OF_RANGE_1ARG(List1D::subImpl,J,J.lastIdx()>lastIdx());}
      moveCurrentPosition(J.begin());
      Cell* p_first = p_current_;
      moveCurrentPosition(J.lastIdx());
      Cell* p_last = p_current_;
      return List1D(p_first, p_last, J);
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::lastIdx(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::p_current_, STKOUT_OF_RANGE_1ARG, and STK::List1D< Type_ >::subImpl().

Referenced by STK::List1D< Type_ >::subImpl().

◆ swap()

template<class Type_ >

void STK::List1D< Type_ >::swap	(	int const &	j1,
		int const &	j2
	)

inline

Swapping the j1th column and the j2th column.

Parameters

j1	index of the first element to swap
j2	index of the second element to swap

Definition at line 521 of file STK_List1D.h.

    {
#ifdef STK_BOUNDS_CHECK
      if (j1<begin())
      { STKOUT_OF_RANGE_2ARG(List1D::swap,j1, j2,j1<begin());}
      if (j1>this->lastIdx())
      { STKOUT_OF_RANGE_2ARG(List1D::swap,j1, j2,j1>lastIdx());}
      if (j2<begin())
      { STKOUT_OF_RANGE_2ARG(List1D::swap,j1, j2,j2<begin());}
      if (j2>this->lastIdx())
      { STKOUT_OF_RANGE_2ARG(List1D::swap,j1, j2,j2>lastIdx());}
#endif
      // get j1th value in aux
      moveCurrentPosition(j1);
      Cell *p1 = p_current_;
      Type aux = p1->data();
      // set j2th value in j1th position
      moveCurrentPosition(j2);
      (*p1) = p_current_->data();
      // set j2th value to aux
      (*p_current_) = aux;
    }

References STK::List1D< Type_ >::begin(), STK::List1D< Type_ >::lastIdx(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::p_current_, STKOUT_OF_RANGE_2ARG, and STK::List1D< Type_ >::swap().

Referenced by STK::List1D< Type_ >::swap().

Member Data Documentation

◆ currentPosition_

template<class Type_ >

int STK::List1D< Type_ >::currentPosition_

mutableprivate

Current position of pointer p_current_ in the List1D.

Definition at line 666 of file STK_List1D.h.

Referenced by STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::insertElt(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::moveCurrentPositionLeft(), STK::List1D< Type_ >::moveCurrentPositionRight(), STK::List1D< Type_ >::setDefault(), and STK::List1D< Type_ >::shiftImpl().

◆ p_begin_

template<class Type_ >

Cell* STK::List1D< Type_ >::p_begin_

protected

First Element of the List.

Definition at line 608 of file STK_List1D.h.

Referenced by STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::freeMem(), STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::insertElt(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::merge(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::operator=(), STK::List1D< Type_ >::operator=(), STK::List1D< Type_ >::p_begin(), STK::List1D< Type_ >::pushBack(), and STK::List1D< Type_ >::setDefault().

◆ p_current_

template<class Type_ >

Cell* STK::List1D< Type_ >::p_current_

mutableprivate

Current position pointed in the List1D.

Definition at line 668 of file STK_List1D.h.

Referenced by STK::List1D< Type_ >::elt1Impl(), STK::List1D< Type_ >::elt1Impl(), STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::insertElt(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::moveCurrentPositionLeft(), STK::List1D< Type_ >::moveCurrentPositionRight(), STK::List1D< Type_ >::setDefault(), STK::List1D< Type_ >::subImpl(), and STK::List1D< Type_ >::swap().

◆ p_last_

template<class Type_ >

Cell* STK::List1D< Type_ >::p_last_

protected

Last Element of the List.

Definition at line 609 of file STK_List1D.h.

Referenced by STK::List1D< Type_ >::erase(), STK::List1D< Type_ >::initialize(), STK::List1D< Type_ >::List1D(), STK::List1D< Type_ >::merge(), STK::List1D< Type_ >::moveCurrentPosition(), STK::List1D< Type_ >::operator=(), STK::List1D< Type_ >::p_lastIdx(), STK::List1D< Type_ >::pushBack(), and STK::List1D< Type_ >::setDefault().

The documentation for this class was generated from the following file:

STK_List1D.h

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ Base

◆ Cell

◆ ColRange

◆ const_iterator

◆ const_reverse_iterator

◆ ConstIterator

◆ ConstReverseIterator

◆ Iterator

◆ iterator

◆ reverse_iterator

◆ ReverseIterator

◆ RowRange

◆ Type

◆ TypeConst

Member Enumeration Documentation

◆ anonymous enum

Constructor & Destructor Documentation

◆ List1D() [1/6]

◆ List1D() [2/6]

◆ List1D() [3/6]

◆ List1D() [4/6]

◆ List1D() [5/6]

◆ List1D() [6/6]

◆ ~List1D()

Member Function Documentation

◆ begin()

◆ beginCols()

◆ beginRows()

◆ clear()

◆ cols()

◆ elt1Impl() [1/2]

◆ elt1Impl() [2/2]

◆ end()

◆ endCols()

◆ endRows()

◆ erase()

◆ freeMem()

◆ initialize()

◆ insert()

◆ insertElt()

◆ lastIdx()

◆ lastIdxCols()

◆ lastIdxRows()

◆ merge()

◆ moveCurrentPosition()

◆ moveCurrentPositionLeft()

◆ moveCurrentPositionRight()

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ p_begin()

◆ p_lastIdx()

◆ popBack()

◆ pushBack()

◆ resizeImpl()

◆ rows()

◆ setDefault()

◆ shiftImpl()

◆ size()

◆ sizeCols()

◆ sizeRows()

◆ subImpl()

◆ swap()

Member Data Documentation

◆ currentPosition_

◆ p_begin_

◆ p_current_

◆ p_last_