Inheritance diagram for pw::Vector< T, vector_impl::kGeneric >:

Public Types
using	value_type = T

using	size_type = unsigned short

using	difference_type = ptrdiff_t

using	reference = value_type &

using	const_reference = const value_type &

using	pointer = T *

using	const_pointer = const T *

using	iterator = T *

using	const_iterator = const T *

using	reverse_iterator = std::reverse_iterator< iterator >

using	const_reverse_iterator = std::reverse_iterator< const_iterator >

Public Member Functions
Vector &	operator= (const Vector &other)

Vector &	operator= (Vector &&other) noexcept

Vector &	operator= (std::initializer_list< T > list)

void	assign (size_type count, const T &value)

template<typename Iterator , typename... , typename = std::enable_if_t<vector_impl::IsIterator<Iterator>::value>>
void	assign (Iterator first, Iterator last)

void	assign (std::initializer_list< T > list)

reference	at (size_t index)

const_reference	at (size_t index) const

reference	operator[] (size_t index)

const_reference	operator[] (size_t index) const

reference	front ()

const_reference	front () const

reference	back ()

const_reference	back () const

T *	data () noexcept

const T *	data () const noexcept

iterator	begin () noexcept

const_iterator	begin () const noexcept

const_iterator	cbegin () const noexcept

iterator	end () noexcept

const_iterator	end () const noexcept

const_iterator	cend () const noexcept

reverse_iterator	rbegin () noexcept

const_reverse_iterator	rbegin () const

const_reverse_iterator	crbegin () const noexcept

reverse_iterator	rend () noexcept

const_reverse_iterator	rend () const

const_reverse_iterator	crend () const noexcept

bool	empty () const noexcept

bool	full () const noexcept

size_t	size () const noexcept

size_t	max_size () const noexcept

size_t	capacity () const noexcept

void	clear () noexcept

iterator	insert (const_iterator position, size_type count, const T &value)

iterator	insert (const_iterator position, const T &value)

iterator	insert (const_iterator position, T &&value)

template<typename Iterator , int &... ExplicitArgumentBarrier, typename = std::enable_if_t<vector_impl::IsIterator<Iterator>::value>>
iterator	insert (const_iterator position, Iterator first, Iterator last)

iterator	insert (const_iterator position, std::initializer_list< T > list)

template<typename... Args>
iterator	emplace (const_iterator position, Args &&... args)

iterator	erase (const_iterator first, const_iterator last)

iterator	erase (const_iterator position)

void	push_back (const T &value)

void	push_back (T &&value)

template<typename... Args>
void	emplace_back (Args &&... args)

void	pop_back ()

void	resize (size_t new_size)

void	resize (size_t new_size, const T &value)

Protected Member Functions
constexpr	Vector (size_type max_size) noexcept

template<typename Iterator >
void	CopyFrom (Iterator first, Iterator last)

void	MoveFrom (Vector &other) noexcept

void	Append (size_type count, const T &value)

template<typename Iterator >
iterator	InsertFrom (const_iterator position, Iterator first, Iterator last)

void	ShiftEntriesForInsert (T *first, size_type to_insert)

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

pw_containers/public/pw_containers/vector.h

Public Types

Public Member Functions

Protected Member Functions