#include <packed_vector.h>

Public Types
typedef U	size_type

typedef T *	iterator

typedef std::reverse_iterator< iterator >	reverse_iterator

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

Public Member Functions
	packed_vector ()

	packed_vector (size_type size)

	packed_vector (size_type size, const T &value)

template<class InputIterator >
	packed_vector (InputIterator first, InputIterator last)

	packed_vector (const packed_vector< T > &other)

	~packed_vector ()

packed_vector< T, U > &	operator= (packed_vector< T, U > other)

iterator	begin ()

const_iterator	begin () const

const_iterator	cbegin () const

iterator	end ()

const_iterator	end () const

const_iterator	cend () const

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

const_reverse_iterator	crbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

const_reverse_iterator	crend () const

size_type	size () const

bool	empty () const

T &	operator[] (size_type i)

const T &	operator[] (size_type i) const

T &	at (size_type i)

const T &	at (size_type i) const

T &	front ()

const T &	front () const

T &	back ()

const T &	back () const

T *	data ()

const T *	data () const

void	clear ()

void	resize (size_type size)

void	push_back (const T &x)

void	pop_back ()

iterator	insert (const_iterator position, const T &x)

iterator	erase (const_iterator position)

void	swap (packed_vector< T, U > &other)

	operator std::vector< T > () const

Public Attributes
const typedef T *	const_iterator

Detailed Description

template<class T, class U = uint8_t>
class stdext::packed_vector< T, U >

Definition at line 34 of file packed_vector.h.

Member Typedef Documentation

◆ const_reverse_iterator

template<class T , class U = uint8_t>

typedef std::reverse_iterator<const_iterator> stdext::packed_vector< T, U >::const_reverse_iterator

Definition at line 41 of file packed_vector.h.

◆ iterator

template<class T , class U = uint8_t>

typedef T* stdext::packed_vector< T, U >::iterator

Definition at line 38 of file packed_vector.h.

◆ reverse_iterator

template<class T , class U = uint8_t>

typedef std::reverse_iterator<iterator> stdext::packed_vector< T, U >::reverse_iterator

Definition at line 40 of file packed_vector.h.

◆ size_type

template<class T , class U = uint8_t>

typedef U stdext::packed_vector< T, U >::size_type

Definition at line 37 of file packed_vector.h.

Constructor & Destructor Documentation

◆ packed_vector() [1/5]

template<class T , class U = uint8_t>

stdext::packed_vector< T, U >::packed_vector ( )

inline

Definition at line 43 of file packed_vector.h.

◆ packed_vector() [2/5]

template<class T , class U = uint8_t>

stdext::packed_vector< T, U >::packed_vector ( size_type size )

inline

Definition at line 44 of file packed_vector.h.

◆ packed_vector() [3/5]

template<class T , class U = uint8_t>

stdext::packed_vector< T, U >::packed_vector	(	size_type	size,
		const T &	value
	)

inline

Definition at line 45 of file packed_vector.h.

Here is the call graph for this function:

◆ packed_vector() [4/5]

template<class T , class U = uint8_t>

template<class InputIterator >

stdext::packed_vector< T, U >::packed_vector	(	InputIterator	first,
		InputIterator	last
	)

inline

Definition at line 47 of file packed_vector.h.

◆ packed_vector() [5/5]

template<class T , class U = uint8_t>

stdext::packed_vector< T, U >::packed_vector ( const packed_vector< T > & other )

inline

Definition at line 48 of file packed_vector.h.

Here is the call graph for this function:

◆ ~packed_vector()

template<class T , class U = uint8_t>

stdext::packed_vector< T, U >::~packed_vector ( )

inline

Definition at line 49 of file packed_vector.h.

Member Function Documentation

◆ at() [1/2]

template<class T , class U = uint8_t>

T& stdext::packed_vector< T, U >::at ( size_type i )

inline

Definition at line 72 of file packed_vector.h.

◆ at() [2/2]

template<class T , class U = uint8_t>

const T& stdext::packed_vector< T, U >::at ( size_type i ) const

inline

Definition at line 73 of file packed_vector.h.

◆ back() [1/2]

template<class T , class U = uint8_t>

T& stdext::packed_vector< T, U >::back ( )

inline

Definition at line 77 of file packed_vector.h.

◆ back() [2/2]

template<class T , class U = uint8_t>

const T& stdext::packed_vector< T, U >::back ( ) const

inline

Definition at line 78 of file packed_vector.h.

◆ begin() [1/2]

template<class T , class U = uint8_t>

iterator stdext::packed_vector< T, U >::begin ( )

inline

Definition at line 53 of file packed_vector.h.

Here is the caller graph for this function:

◆ begin() [2/2]

template<class T , class U = uint8_t>

const_iterator stdext::packed_vector< T, U >::begin ( ) const

inline

Definition at line 54 of file packed_vector.h.

◆ cbegin()

template<class T , class U = uint8_t>

const_iterator stdext::packed_vector< T, U >::cbegin ( ) const

inline

Definition at line 55 of file packed_vector.h.

◆ cend()

template<class T , class U = uint8_t>

const_iterator stdext::packed_vector< T, U >::cend ( ) const

inline

Definition at line 58 of file packed_vector.h.

◆ clear()

template<class T , class U = uint8_t>

void stdext::packed_vector< T, U >::clear ( )

inline

Definition at line 83 of file packed_vector.h.

Here is the caller graph for this function:

◆ crbegin()

template<class T , class U = uint8_t>

const_reverse_iterator stdext::packed_vector< T, U >::crbegin ( ) const

inline

Definition at line 62 of file packed_vector.h.

Here is the call graph for this function:

◆ crend()

template<class T , class U = uint8_t>

const_reverse_iterator stdext::packed_vector< T, U >::crend ( ) const

inline

Definition at line 65 of file packed_vector.h.

Here is the call graph for this function:

◆ data() [1/2]

template<class T , class U = uint8_t>

T* stdext::packed_vector< T, U >::data ( )

inline

Definition at line 80 of file packed_vector.h.

◆ data() [2/2]

template<class T , class U = uint8_t>

const T* stdext::packed_vector< T, U >::data ( ) const

inline

Definition at line 81 of file packed_vector.h.

◆ empty()

template<class T , class U = uint8_t>

bool stdext::packed_vector< T, U >::empty ( ) const

inline

Definition at line 68 of file packed_vector.h.

◆ end() [1/2]

template<class T , class U = uint8_t>

iterator stdext::packed_vector< T, U >::end ( )

inline

Definition at line 56 of file packed_vector.h.

Here is the caller graph for this function:

◆ end() [2/2]

template<class T , class U = uint8_t>

const_iterator stdext::packed_vector< T, U >::end ( ) const

inline

Definition at line 57 of file packed_vector.h.

◆ erase()

template<class T , class U = uint8_t>

iterator stdext::packed_vector< T, U >::erase ( const_iterator position )

inline

Definition at line 132 of file packed_vector.h.

◆ front() [1/2]

template<class T , class U = uint8_t>

T& stdext::packed_vector< T, U >::front ( )

inline

Definition at line 75 of file packed_vector.h.

◆ front() [2/2]

template<class T , class U = uint8_t>

const T& stdext::packed_vector< T, U >::front ( ) const

inline

Definition at line 76 of file packed_vector.h.

◆ insert()

template<class T , class U = uint8_t>

iterator stdext::packed_vector< T, U >::insert	(	const_iterator	position,
		const T &	x
	)

inline

Definition at line 120 of file packed_vector.h.

◆ operator std::vector< T >()

template<class T , class U = uint8_t>

stdext::packed_vector< T, U >::operator std::vector< T > ( ) const

inline

Definition at line 145 of file packed_vector.h.

Here is the call graph for this function:

◆ operator=()

template<class T , class U = uint8_t>

packed_vector<T,U>& stdext::packed_vector< T, U >::operator= ( packed_vector< T, U > other )

inline

Definition at line 51 of file packed_vector.h.

Here is the call graph for this function:

◆ operator[]() [1/2]

template<class T , class U = uint8_t>

T& stdext::packed_vector< T, U >::operator[] ( size_type i )

inline

Definition at line 70 of file packed_vector.h.

◆ operator[]() [2/2]

template<class T , class U = uint8_t>

const T& stdext::packed_vector< T, U >::operator[] ( size_type i ) const

inline

Definition at line 71 of file packed_vector.h.

◆ pop_back()

template<class T , class U = uint8_t>

void stdext::packed_vector< T, U >::pop_back ( )

inline

Definition at line 108 of file packed_vector.h.

Here is the call graph for this function:

◆ push_back()

template<class T , class U = uint8_t>

void stdext::packed_vector< T, U >::push_back ( const T & x )

inline

Definition at line 99 of file packed_vector.h.

◆ rbegin() [1/2]

template<class T , class U = uint8_t>

reverse_iterator stdext::packed_vector< T, U >::rbegin ( )

inline

Definition at line 60 of file packed_vector.h.

Here is the call graph for this function:

◆ rbegin() [2/2]

template<class T , class U = uint8_t>

const_reverse_iterator stdext::packed_vector< T, U >::rbegin ( ) const

inline

Definition at line 61 of file packed_vector.h.

Here is the call graph for this function:

◆ rend() [1/2]

template<class T , class U = uint8_t>

reverse_iterator stdext::packed_vector< T, U >::rend ( )

inline

Definition at line 63 of file packed_vector.h.

Here is the call graph for this function:

◆ rend() [2/2]

template<class T , class U = uint8_t>

const_reverse_iterator stdext::packed_vector< T, U >::rend ( ) const

inline

Definition at line 64 of file packed_vector.h.

Here is the call graph for this function:

◆ resize()

template<class T , class U = uint8_t>

void stdext::packed_vector< T, U >::resize ( size_type size )

inline

Definition at line 91 of file packed_vector.h.

Here is the call graph for this function:

◆ size()

template<class T , class U = uint8_t>

size_type stdext::packed_vector< T, U >::size ( ) const

inline

Definition at line 67 of file packed_vector.h.

Here is the caller graph for this function:

◆ swap()

template<class T , class U = uint8_t>

void stdext::packed_vector< T, U >::swap ( packed_vector< T, U > & other )

inline

Definition at line 143 of file packed_vector.h.

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

◆ const_iterator

template<class T , class U = uint8_t>

const typedef T* stdext::packed_vector< T, U >::const_iterator

Definition at line 39 of file packed_vector.h.

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

src/framework/stdext/packed_vector.h

Public Types

Public Member Functions

Public Attributes

Detailed Description

template<class T, class U = uint8_t> class stdext::packed_vector< T, U >

Member Typedef Documentation

◆ const_reverse_iterator

◆ iterator

◆ reverse_iterator

◆ size_type

Constructor & Destructor Documentation

◆ packed_vector() [1/5]

◆ packed_vector() [2/5]

◆ packed_vector() [3/5]

◆ packed_vector() [4/5]

◆ packed_vector() [5/5]

◆ ~packed_vector()

Member Function Documentation

◆ at() [1/2]

◆ at() [2/2]

◆ back() [1/2]

◆ back() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ cbegin()

◆ cend()

◆ clear()

◆ crbegin()

◆ crend()

◆ data() [1/2]

◆ data() [2/2]

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase()

◆ front() [1/2]

◆ front() [2/2]

◆ insert()

◆ operator std::vector< T >()

◆ operator=()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ pop_back()

◆ push_back()

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ resize()

◆ size()

◆ swap()

Member Data Documentation

◆ const_iterator

template<class T, class U = uint8_t>
class stdext::packed_vector< T, U >