Inheritance diagram for Std::vector< T >:

Classes
struct	const_reverse_iterator

struct	reverse_iterator

Public Types
using	iterator = typename Common::Array< T >::iterator

using	const_iterator = typename Common::Array< T >::const_iterator

Public Types inherited from Common::Array< T >
typedef T *	iterator

typedef const T *	const_iterator

typedef T	value_type

typedef uint	size_type

Public Member Functions
	vector (size_t newSize)

	vector (size_t newSize, const T &elem)

	vector (std::initializer_list< T > list)

void	insert (const T &element)

void	insert (iterator position, const_iterator first, const_iterator last)

T &	at (size_t index)

const T &	at (size_t index) const

void	remove (T element)

void	rotate (iterator it)

const_iterator	cbegin ()

const_iterator	cend ()

reverse_iterator	rbegin ()

reverse_iterator	rend ()

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

const_reverse_iterator	crbegin () const

const_reverse_iterator	crend () const

Public Member Functions inherited from Common::Array< T >
	Array (size_type count)

	Array (size_type count, const T &value)

	Array (const Array< T > &array)

	Array (Array< T > &&old)

	Array (std::initializer_list< T > list)

template<class T2 >
	Array (const T2 *array, size_type n)

template<class... TArgs>
void	emplace (const_iterator pos, TArgs &&... args)

template<class... TArgs>
void	emplace_back (TArgs &&...args)

void	push_back (const T &element)

void	push_back (T &&element)

void	push_back (const Array< T > &array)

void	pop_back ()

const T *	data () const

T *	data ()

T &	front ()

const T &	front () const

T &	back ()

const T &	back () const

void	insert_at (size_type idx, const T &element)

void	insert_at (size_type idx, const Array< T > &array)

void	insert (iterator pos, const T &element)

T	remove_at (size_type idx)

T &	operator[] (size_type idx)

const T &	operator[] (size_type idx) const

Array< T > &	operator= (const Array< T > &array)

Array &	operator= (Array< T > &&old)

size_type	size () const

void	clear ()

iterator	erase (iterator pos)

iterator	erase (iterator first, iterator last)

bool	empty () const

bool	operator== (const Array< T > &other) const

bool	operator!= (const Array< T > &other) const

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

void	reserve (size_type newCapacity)

void	resize (size_type newSize)

void	resize (size_type newSize, const T value)

void	assign (const_iterator first, const_iterator last)

void	swap (Array &arr)

Additional Inherited Members
Protected Member Functions inherited from Common::Array< T >
void	allocCapacity (size_type capacity)

void	freeStorage (T *storage, const size_type elements)

iterator	insert_aux (iterator pos, const_iterator first, const_iterator last)

Static Protected Member Functions inherited from Common::Array< T >
static size_type	roundUpCapacity (size_type capacity)

Protected Attributes inherited from Common::Array< T >
size_type	_capacity

size_type	_size

T *	_storage

Member Function Documentation

◆ insert()

template<class T>

void Std::vector< T >::insert	(	iterator	position,
		const_iterator	first,
		const_iterator	last
	)

inline

Adds a range of items at the specified position in the array

◆ remove()

template<class T>

void Std::vector< T >::remove ( T element )

inline

Remove an element

◆ rotate()

template<class T>

void Std::vector< T >::rotate ( iterator it )

inline

Rotates the array so that the item pointed to by the iterator becomes the first item, and the predeceding item becomes the last one

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

common/std/vector.h

Classes

Public Types

Public Member Functions

Additional Inherited Members

Member Function Documentation

◆ insert()

◆ remove()

◆ rotate()