Template class for dynamic vector. More...

#include <SLVector.h>

Public Member Functions
	SLVector ()
	creates empty array More...

	SLVector (SLuint size)
	creates array w. size More...

	SLVector (const SLVector &a)
	creates a copy of array a More...

virtual	~SLVector ()
	standard destructor More...

SLVector< T, U > &	operator= (const SLVector &a)
	assignment operator More...

SLVector< T, U > &	operator= (const SLVector *a)
	assignment operator More...

T &	operator[] (SLuint i)
	access operator More...

void	set (const SLVector &a)
	set array with another More...

U	size ()
	returns size More...

U	capacity ()
	returns internal size More...

void	push_back (const T element)
	appends element at end More...

void	pop_back ()
	deletes element at end More...

void	erase (U i)
	delete element at pos i More...

T &	at (SLuint i)
	returns element at pos i More...

void	reverse ()
	reverses the order More...

void	clear ()
	deletes all More...

void	resize (SLuint64 size=0)
	deletes all, sets _size=size More...

void	reserve (SLuint64 newSize)
	set capacity = newSize More...

Private Attributes
U	_size
	real size of array of type U More...

U	_capacity
	internal size of array of type U More...

T *	_contents
	pointer to the array of type T More...

Detailed Description

template<class T, class U>
class SLVector< T, U >

Template class for dynamic vector.

Implements a minimal dynamic sized array like the STL vector. The array can be of a class type T and can have the max. size of type U. Compatibility is given as long no iterators are used. Bounds checks are only done in _DEBUG mode within the access methods and operators.

Definition at line 28 of file SLVector.h.

Constructor & Destructor Documentation

◆ SLVector() [1/3]

template<class T , class U >

SLVector< T, U >::SLVector

creates empty array

Definition at line 60 of file SLVector.h.

 {
     _size     = 0;
     _capacity = 0;
     _contents = 0;
 }

◆ SLVector() [2/3]

template<class T , class U >

SLVector< T, U >::SLVector ( SLuint size )

creates array w. size

Definition at line 68 of file SLVector.h.

 {
     _size     = size;
     _capacity = size;
     _contents = new T[_capacity];
 }

◆ SLVector() [3/3]

template<class T , class U >

SLVector< T, U >::SLVector ( const SLVector< T, U > & a )

creates a copy of array a

Definition at line 76 of file SLVector.h.

 {
     _size     = 0;
     _capacity = 0;
     _contents = 0;
     set(a);
 }

◆ ~SLVector()

template<class T , class U >

SLVector< T, U >::~SLVector

virtual

standard destructor

Definition at line 85 of file SLVector.h.

 {
     delete[] _contents;
 }

Member Function Documentation

◆ at()

template<class T , class U >

T & SLVector< T, U >::at ( SLuint i )

inline

returns element at pos i

Returns the element at position i. Overrun is checked in _DEBUG mode and causes Warning but returns a value so that the caller can be reached.

Definition at line 115 of file SLVector.h.

 {
 #ifdef _DEBUG
     if (i >= _size)
     {
         SL_LOG("SLVector::operator[]: Index >= size! Overflow! Argh!");
         return _contents[_size - 1]; // return something for debug
     }
 #endif
     return _contents[i];
 }

◆ capacity()

template<class T , class U >

U SLVector< T, U >::capacity ( )

inline

returns internal size

Definition at line 42 of file SLVector.h.

◆ clear()

template<class T , class U >

void SLVector< T, U >::clear ( )

inline

deletes all

Definition at line 48 of file SLVector.h.

◆ erase()

template<class T , class U >

void SLVector< T, U >::erase ( U i )

delete element at pos i

Definition at line 221 of file SLVector.h.

 {
     if (index >= _size)
     {
         SL_EXIT_MSG("SLVector::erase(SLuint index): Index out of range!");
     }
     else if (index == _size - 1)
     {
         pop_back();
     }
     else
     {
         SLuint j;
         _size--;
         _capacity = _size;
         T* temp   = new T[_capacity];
         for (j = 0; j < _size; ++j)
         {
             if (j < index)
                 temp[j] = _contents[j];
             else
                 temp[j] = _contents[j + 1];
         }
         delete[] _contents;
         _contents = temp;
     }
 }

◆ operator=() [1/2]

template<class T , class U >

SLVector< T, U > & SLVector< T, U >::operator= ( const SLVector< T, U > & a )

assignment operator

Definition at line 129 of file SLVector.h.

 {
     this->set(a);
     return (*this);
 }

◆ operator=() [2/2]

template<class T , class U >

SLVector< T, U > & SLVector< T, U >::operator= ( const SLVector< T, U > * a )

assignment operator

Definition at line 137 of file SLVector.h.

 {
     this->set(*a);
     return (*this);
 }

◆ operator[]()

template<class T , class U >

T & SLVector< T, U >::operator[] ( SLuint i )

inline

access operator

The bracket operator as used in arrays. You can use it on the left or right side of =. Overrun is checked in _DEBUG mode and causes Warning but returns a value so that the caller can be reached.

Definition at line 96 of file SLVector.h.

 {
 #ifdef _DEBUG
     if (i >= _size)
     {
         SL_LOG("SLVector::operator[]: Index >= size! Overflow! Argh!");
         return _contents[_size - 1]; // return something for debug
     }
 #endif
     return _contents[i];
 }

◆ pop_back()

template<class T , class U >

void SLVector< T, U >::pop_back

deletes element at end

Definition at line 281 of file SLVector.h.

 {
     _size--;
 }

◆ push_back()

template<class T , class U >

void SLVector< T, U >::push_back ( const T element )

appends element at end

Definition at line 200 of file SLVector.h.

 {
     if (_capacity != 0)
     {
         if (_size >= _capacity)
         {
             reserve(_capacity * 2);
         }
         _contents[_size] = element;
         _size++;
     }
     else
     {
         _capacity    = 2;
         _size        = 1;
         _contents    = new T[_capacity];
         _contents[0] = element;
     }
 }

◆ reserve()

template<class T , class U >

void SLVector< T, U >::reserve ( SLuint64 newSize )

set capacity = newSize

Internal, the SLVector is representet by an c++Array not of size _size, but of an internal size. The function reserve changes the internal representation and can make adding much more faster. If s is smaller than the actual size, it will be ignored.

Definition at line 175 of file SLVector.h.

 {
     T*     temp;
     SLuint i;
  
 #ifdef _DEBUG
     if (newSize > MAXCAPACITY)
     {
         SL_LOG("SLVector::reserve: newSize > Max. capacity");
         newSize = MAXCAPACITY;
     }
 #endif
  
     if ((U)newSize >= _size)
     {
         _capacity = (U)newSize;
         temp      = new T[_capacity];
         for (i = 0; i < _size; i++)
             temp[i] = _contents[i];
         delete[] _contents;
         _contents = temp;
     }
 }

◆ resize()

template<class T , class U >

void SLVector< T, U >::resize ( SLuint64 size = 0 )

deletes all, sets _size=size

Definition at line 264 of file SLVector.h.

 {
 #ifdef _DEBUG
     if (newSize > MAXCAPACITY)
     {
         SL_LOG("SLVector::reserve: newSize > Max. capacity");
         newSize = MAXCAPACITY;
     }
 #endif
     _size     = (U)newSize;
     _capacity = (U)newSize;
     delete[] _contents;
     _contents = 0;
     if (_capacity) _contents = new T[_capacity];
 }

◆ reverse()

template<class T , class U >

void SLVector< T, U >::reverse

reverses the order

Definition at line 250 of file SLVector.h.

 {
     SLuint i;
     T      temp;
  
     for (i = 0; i < (_size / 2); i++)
     {
         temp                     = _contents[i];
         _contents[i]             = _contents[_size - i - 1];
         _contents[_size - i - 1] = temp;
     }
 }

◆ set()

template<class T , class U >

void SLVector< T, U >::set ( const SLVector< T, U > & a )

set array with another

Definition at line 144 of file SLVector.h.

 {
     SLuint i;
     if (&a != this)
     {
         T* temp = 0;
  
         if (_capacity > 0)
             delete[] _contents;
  
         _size     = a._size;
         _capacity = _size;
         _contents = 0;
  
         if (_capacity > 0)
         {
             temp = new T[_capacity];
             for (i = 0; i < _capacity; ++i)
                 temp[i] = a._contents[i];
             _contents = temp;
         }
     }
 }

◆ size()

template<class T , class U >

U SLVector< T, U >::size ( )

inline

returns size

Definition at line 41 of file SLVector.h.

Member Data Documentation

◆ _capacity

template<class T , class U >

U SLVector< T, U >::_capacity

private

internal size of array of type U

Definition at line 54 of file SLVector.h.

◆ _contents

template<class T , class U >

T* SLVector< T, U >::_contents

private

pointer to the array of type T

Definition at line 55 of file SLVector.h.

◆ _size

template<class T , class U >

U SLVector< T, U >::_size

private

real size of array of type U

Definition at line 53 of file SLVector.h.

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

SLVector.h

Public Member Functions

Private Attributes

Detailed Description

template<class T, class U> class SLVector< T, U >

Constructor & Destructor Documentation

◆ SLVector() [1/3]

◆ SLVector() [2/3]

◆ SLVector() [3/3]

◆ ~SLVector()

Member Function Documentation

◆ at()

◆ capacity()

◆ clear()

◆ erase()

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ operator[]()

◆ pop_back()

◆ push_back()

◆ reserve()

◆ resize()

◆ reverse()

◆ set()

◆ size()

Member Data Documentation

◆ _capacity

◆ _contents

◆ _size

template<class T, class U>
class SLVector< T, U >