XenevaOS
Loading...
Searching...
No Matches
Classes | Public Member Functions | Protected Member Functions | Protected Attributes | List of all members
libhelix::Vector< T > Class Template Reference

Vector implementation which provides the most important methods as defined by std::vector. This class it is quite handy to have and most of the times quite better then dealing with raw c arrays. More...

#include <Vector.h>

Collaboration diagram for libhelix::Vector< T >:
Collaboration graph
[legend]

Classes

class  iterator
 Iterator for the Vector class. More...
 

Public Member Functions

 Vector (size_t len=20, Allocator &allocator=DefaultAllocator)
 default constructor
 
 Vector (int size, T value, Allocator &allocator=DefaultAllocator)
 allocate size and initialize array
 
 Vector (Vector< T > &&moveFrom)=default
 Move constructor.
 
Vector & operator= (Vector &&obj)
 Move operator.
 
 Vector (Vector< T > &copyFrom)
 copy constructor
 
Vector< T > & operator= (Vector< T > &copyFrom)
 copy operator
 
 Vector (T *from, T *to, Allocator &allocator=DefaultAllocator)
 legacy constructor with pointer range
 
virtual ~Vector ()
 Destructor.
 
void clear ()
 
int size ()
 
bool empty ()
 
void push_back (T value)
 
void push_front (T value)
 
void pop_back ()
 
void pop_front ()
 
void assign (iterator v1, iterator v2)
 
void assign (size_t number, T value)
 
void swap (Vector< T > &in)
 
T & operator[] (int index)
 
T & operator[] (const int index) const
 
bool resize (int newSize, T value)
 
void shrink_to_fit ()
 
int capacity ()
 
bool resize (int newSize)
 
iterator begin ()
 
T & back ()
 
iterator end ()
 
void erase (iterator it)
 
void erase (int pos)
 
T * data ()
 
 operator bool () const
 
int indexOf (T obj)
 

Protected Member Functions

void resize_internal (int newSize, bool copy, bool shrink=false)
 
T * newArray (int newSize)
 
void deleteArray (T *oldData, int oldBufferLen)
 
void cleanup (T *data, int from, int to)
 

Protected Attributes

int bufferLen = 0
 
int len = 0
 
T * p_data = nullptr
 
Allocator * p_allocator = &DefaultAllocator
 

Detailed Description

template<class T>
class libhelix::Vector< T >

Vector implementation which provides the most important methods as defined by std::vector. This class it is quite handy to have and most of the times quite better then dealing with raw c arrays.

Author
Phil Schatzmann
Copyright
GPLv3

Constructor & Destructor Documentation

◆ Vector() [1/5]

template<class T >
libhelix::Vector< T >::Vector ( size_t  len = 20,
Allocator &  allocator = DefaultAllocator 
)
inline

default constructor

◆ Vector() [2/5]

template<class T >
libhelix::Vector< T >::Vector ( int  size,
T  value,
Allocator &  allocator = DefaultAllocator 
)
inline

allocate size and initialize array

◆ Vector() [3/5]

template<class T >
libhelix::Vector< T >::Vector ( Vector< T > &&  moveFrom)
default

Move constructor.

◆ Vector() [4/5]

template<class T >
libhelix::Vector< T >::Vector ( Vector< T > &  copyFrom)
inline

copy constructor

◆ Vector() [5/5]

template<class T >
libhelix::Vector< T >::Vector ( T *  from,
T *  to,
Allocator &  allocator = DefaultAllocator 
)
inline

legacy constructor with pointer range

◆ ~Vector()

template<class T >
virtual libhelix::Vector< T >::~Vector ( )
inlinevirtual

Destructor.

Member Function Documentation

◆ assign() [1/2]

template<class T >
void libhelix::Vector< T >::assign ( iterator  v1,
iterator  v2 
)
inline

◆ assign() [2/2]

template<class T >
void libhelix::Vector< T >::assign ( size_t  number,
T  value 
)
inline

◆ back()

template<class T >
T & libhelix::Vector< T >::back ( )
inline

◆ begin()

template<class T >
iterator libhelix::Vector< T >::begin ( )
inline

◆ capacity()

template<class T >
int libhelix::Vector< T >::capacity ( )
inline

◆ cleanup()

template<class T >
void libhelix::Vector< T >::cleanup ( T *  data,
int  from,
int  to 
)
inlineprotected

◆ clear()

template<class T >
void libhelix::Vector< T >::clear ( )
inline

◆ data()

template<class T >
T * libhelix::Vector< T >::data ( )
inline

◆ deleteArray()

template<class T >
void libhelix::Vector< T >::deleteArray ( T *  oldData,
int  oldBufferLen 
)
inlineprotected

◆ empty()

template<class T >
bool libhelix::Vector< T >::empty ( )
inline

◆ end()

template<class T >
iterator libhelix::Vector< T >::end ( )
inline

◆ erase() [1/2]

template<class T >
void libhelix::Vector< T >::erase ( int  pos)
inline

◆ erase() [2/2]

template<class T >
void libhelix::Vector< T >::erase ( iterator  it)
inline

◆ indexOf()

template<class T >
int libhelix::Vector< T >::indexOf ( T  obj)
inline

◆ newArray()

template<class T >
T * libhelix::Vector< T >::newArray ( int  newSize)
inlineprotected

◆ operator bool()

template<class T >
libhelix::Vector< T >::operator bool ( ) const
inline

◆ operator=() [1/2]

template<class T >
Vector & libhelix::Vector< T >::operator= ( Vector< T > &&  obj)

Move operator.

◆ operator=() [2/2]

template<class T >
Vector< T > & libhelix::Vector< T >::operator= ( Vector< T > &  copyFrom)
inline

copy operator

◆ operator[]() [1/2]

template<class T >
T & libhelix::Vector< T >::operator[] ( const int  index) const
inline

◆ operator[]() [2/2]

template<class T >
T & libhelix::Vector< T >::operator[] ( int  index)
inline

◆ pop_back()

template<class T >
void libhelix::Vector< T >::pop_back ( )
inline

◆ pop_front()

template<class T >
void libhelix::Vector< T >::pop_front ( )
inline

◆ push_back()

template<class T >
void libhelix::Vector< T >::push_back ( T  value)
inline

◆ push_front()

template<class T >
void libhelix::Vector< T >::push_front ( T  value)
inline

◆ resize() [1/2]

template<class T >
bool libhelix::Vector< T >::resize ( int  newSize)
inline

◆ resize() [2/2]

template<class T >
bool libhelix::Vector< T >::resize ( int  newSize,
T  value 
)
inline

◆ resize_internal()

template<class T >
void libhelix::Vector< T >::resize_internal ( int  newSize,
bool  copy,
bool  shrink = false 
)
inlineprotected

◆ shrink_to_fit()

template<class T >
void libhelix::Vector< T >::shrink_to_fit ( )
inline

◆ size()

template<class T >
int libhelix::Vector< T >::size ( )
inline

◆ swap()

template<class T >
void libhelix::Vector< T >::swap ( Vector< T > &  in)
inline

Member Data Documentation

◆ bufferLen

template<class T >
int libhelix::Vector< T >::bufferLen = 0
protected

◆ len

template<class T >
int libhelix::Vector< T >::len = 0
protected

◆ p_allocator

template<class T >
Allocator* libhelix::Vector< T >::p_allocator = &DefaultAllocator
protected

◆ p_data

template<class T >
T* libhelix::Vector< T >::p_data = nullptr
protected
The documentation for this class was generated from the following file:
Generated by doxygen 1.9.8