Base class for stack-based, exception-safe and resizable vector with fixed-capacity. More...

#include <static_vector.h>

Inheritance diagram for sen::StaticVectorBase< T >:

Public Types
using	value_type = T
using	difference_type = ptrdiff_t
using	pointer = T*
using	const_pointer = T const*
using	reference = T&
using	const_reference = T const&
using	rvalue_reference = T&&
using	iterator = pointer
using	const_iterator = const_pointer
using	size_type = std::size_t
using	reverse_iterator = std::reverse_iterator<iterator>
using	const_reverse_iterator = std::reverse_iterator<const_iterator>
using	Maybe = Result<void, StaticVectorError>
using	MaybeIterator = Result<iterator, StaticVectorError>

Public Member Functions
	StaticVectorBase (const StaticVectorBase &) noexcept=delete
	StaticVectorBase (StaticVectorBase &&) noexcept=delete
StaticVectorBase &	operator= (StaticVectorBase &&) noexcept=delete
StaticVectorBase &	operator= (const StaticVectorBase &) noexcept=delete
size_type	size () const noexcept
	Element count. Complexity: constant.
size_type	capacity () const noexcept
	Maximum number of elements that can be allocated in the storage. Complexity: constant.
size_type	maxSize () const noexcept
	Max element count (same as capacity()). Complexity: constant.
const_pointer	data () const noexcept
	Direct access to the underlying storage. Complexity: constant.
pointer	data () noexcept
	Direct access to the underlying storage. Complexity: constant.
bool	empty () const noexcept
	true if the container is empty. Complexity: constant
bool	full () const noexcept
	true if the container is full. Complexity: constant
Maybe	assign (size_type n, const T &u) noexcept(nothrowCopyCons)
	Clears the vector and assigns n copies of u to it. Complexity: linear in n.
Maybe	assign (const std::initializer_list< T > &list) noexcept(nothrowCopyCons)
	Initializer list assignment. Complexity: linear in list.size().
Maybe	assign (std::initializer_list< T > &&list) noexcept(nothrowMoveCons)
	Initializer list assignment (r-value version). Complexity: linear in list.size().
template<class InputIt>
Maybe	assign (InputIt first, InputIt last) noexcept(nothrowCopyCons)
	Clears the vector and assigns a range to it. Complexity: linear in distance(first, last).
iterator	begin () noexcept
	Returns an iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to end(). Complexity: constant.
const_iterator	begin () const noexcept
	Returns an iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to end(). Complexity: constant.
iterator	end () noexcept
	Iterator to the element following the last element. Complexity: constant.
const_iterator	end () const noexcept
	Iterator to the element following the last element. Complexity: constant. NOLINTNEXTLINE(cppcoreguidelines-pro-bounds-pointer-arithmetic).
reverse_iterator	rbegin () noexcept
	Reverse iterator to the first element. Complexity: constant.
const_reverse_iterator	rbegin () const noexcept
	Reverse iterator to the first element. Complexity: constant.
reverse_iterator	rend () noexcept
	Returns a reverse iterator to the element following the last element of the reversed vector. It corresponds to the element preceding the first element of the non-reversed vector. This element acts as a placeholder, attempting to access it results in undefined behavior. Complexity: constant.
const_reverse_iterator	rend () const noexcept
	Returns a reverse iterator to the element following the last element of the reversed vector. It corresponds to the element preceding the first element of the non-reversed vector. This element acts as a placeholder, attempting to access it results in undefined behavior. Complexity: constant.
const_iterator	cbegin () noexcept
	Returns a const iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to cend(). Complexity: constant.
const_iterator	cbegin () const noexcept
	Returns a const iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to cend(). Complexity: constant.
const_iterator	cend () noexcept
	Constant iterator to the element following the last element. Complexity: constant.
const_iterator	cend () const noexcept
	Constant iterator to the element following the last element. Complexity: constant.
reference	operator[] (size_type i) noexcept
	Gets the element at index i. Complexity: constant.
const_reference	operator[] (size_type i) const noexcept
	Gets the element at index i. Complexity: constant.
reference	front () noexcept
	The element at the beginning of the container. Calling front on an empty container is undefined. Complexity: constant.
const_reference	front () const noexcept
	The element at the beginning of the container (const version). Calling front on an empty container is undefined. Complexity: constant.
reference	back () noexcept
	The element at the end of the container. Calling back on an empty container is undefined. Complexity: constant.
const_reference	back () const noexcept
	The element at the end of the container (const version). Calling back on an empty container is undefined. Complexity: constant.
void	clear () noexcept(nothrowDes)
	Clears the vector. This function destroys all the elements. Complexity: linear in size().
Maybe	push_back (T &&value) noexcept(nothrowMoveCons)
	Appends a value to the end of the container (r-value version). Complexity: constant.
Maybe	push_back (const T &value) noexcept(nothrowCopyCons)
	Appends a value to the end of the container. Complexity: constant.
Maybe	push_back () noexcept(nothrowDefaultCons)
	Appends a value (default constructed) to the end of the container. Complexity: constant.
template<typename... Args>
MaybeIterator	emplace (iterator position, Args &&... args) noexcept(nothrowMoveCons)
	Inserts a new element into the container directly before pos. The arguments args... are forwarded to the constructor as std::forward<Args>(args) args... may directly or indirectly refer to a value in the container.
template<typename... Args>
Maybe	emplace_back (Args &&... args) noexcept(//NOLINT(readability-identifier-naming) nothrowMoveCons)
	Constructs an element in-place at the end of the embedded storage.
Maybe	pop_back () noexcept(nothrowDes)
	Removes the last element of the container. Iterators and references to the last element, as well as the end() iterator, are invalidated. Complexity: constant.
MaybeIterator	insert (iterator position, const_reference x) noexcept(nothrowCopyCons)
	Inserts and element before position. Complexity: linear in size().
MaybeIterator	insert (iterator position, value_type &&x) noexcept(nothrowMoveCons)
	Inserts and element before position (r-value version). Complexity: linear in size().
MaybeIterator	insert (iterator position, size_type n, const T &x) noexcept(nothrowCopyCons)
	Inserts n copies of the value before pos Complexity: linear in size() and n.
MaybeIterator	insert (iterator position, std::initializer_list< T > list) noexcept(nothrowCopyCons)
	Inserts a range of values via initializer list. Complexity: linear in size() and list.size().
template<class InputIt>
MaybeIterator	insert (iterator position, InputIt first, InputIt last) noexcept(nothrowCopyCons)
	Inserts elements from range [first, last) before position. Complexity: linear in size() and distance(first, last).
template<class InputIt>
MaybeIterator	move_insert (iterator position, InputIt first, InputIt last) noexcept(nothrowMoveCons)
	Inserts elements from range [first, last) before position (by moving them). Complexity: linear in size() and distance(first, last).
Maybe	resize (size_type newSize, const T &value) noexcept(nothrowCopyAndDes)
	Changes the size of the container to newSize. If need to be appended, elements are copy-constructed from value. Complexity: linear in newSize.
Maybe	resize (size_type newSize) noexcept(nothrowDefaultConsAndDes)
	Changes the size of the container to newSize. If need to be appended, elements are move-constructed from T{}. Complexity: linear in newSize.
MaybeIterator	erase (iterator position) noexcept(nothrowDes)
	Remove an element at position from the container. Complexity: linear in size().
MaybeIterator	erase (iterator first, iterator last) noexcept(nothrowDes)
	Remove a range of elements from the container. Complexity: linear in size() and distance(first, last).
template<class InputIt>
void	internalDestroy (InputIt first, InputIt last) noexcept(nothrowDes)

Static Public Attributes
static constexpr bool	nothrowDes = std::is_nothrow_destructible_v<T>
static constexpr bool	nothrowDefaultCons = std::is_nothrow_default_constructible_v<T>
static constexpr bool	nothrowCopyCons = std::is_nothrow_copy_constructible_v<T>
static constexpr bool	nothrowMoveCons = std::is_nothrow_move_constructible_v<T>
static constexpr bool	nothrowCopyAndDes = nothrowDes && nothrowCopyCons
static constexpr bool	nothrowDefaultConsAndDes = nothrowDefaultCons && nothrowDes

Protected Member Functions
	StaticVectorBase (std::size_t capacity, void *dataPtr) noexcept
virtual	~StaticVectorBase () noexcept
void	internalSetSize (std::size_t newSize) noexcept
	Changes the container size to newSize.

Detailed Description

template<typename T>
class sen::StaticVectorBase< T >

Base class for stack-based, exception-safe and resizable vector with fixed-capacity.

Mimics the interface and general behavior of std::vector, but it does not perform memory allocations and does not make use of exceptions.

The idea is for it to be compatible with std algorithms and serve as a replacement for std::vector in constrained or real-time environments.

Use StaticVectorBase<T> when using vectors but not depending on their capacity.

Note: This class is not thread-aware.

Template Parameters

T	value type.

Member Typedef Documentation

◆ value_type

template<typename T>

using sen::StaticVectorBase< T >::value_type = T

◆ difference_type

template<typename T>

using sen::StaticVectorBase< T >::difference_type = ptrdiff_t

◆ pointer

template<typename T>

using sen::StaticVectorBase< T >::pointer = T*

◆ const_pointer

template<typename T>

using sen::StaticVectorBase< T >::const_pointer = T const*

◆ reference

template<typename T>

using sen::StaticVectorBase< T >::reference = T&

◆ const_reference

template<typename T>

using sen::StaticVectorBase< T >::const_reference = T const&

◆ rvalue_reference

template<typename T>

using sen::StaticVectorBase< T >::rvalue_reference = T&&

◆ iterator

template<typename T>

using sen::StaticVectorBase< T >::iterator = pointer

◆ const_iterator

template<typename T>

using sen::StaticVectorBase< T >::const_iterator = const_pointer

◆ size_type

template<typename T>

using sen::StaticVectorBase< T >::size_type = std::size_t

◆ reverse_iterator

template<typename T>

using sen::StaticVectorBase< T >::reverse_iterator = std::reverse_iterator<iterator>

◆ const_reverse_iterator

template<typename T>

using sen::StaticVectorBase< T >::const_reverse_iterator = std::reverse_iterator<const_iterator>

◆ Maybe

template<typename T>

using sen::StaticVectorBase< T >::Maybe = Result<void, StaticVectorError>

◆ MaybeIterator

template<typename T>

using sen::StaticVectorBase< T >::MaybeIterator = Result<iterator, StaticVectorError>

Constructor & Destructor Documentation

◆ StaticVectorBase() [1/3]

template<typename T>

sen::StaticVectorBase< T >::StaticVectorBase ( const StaticVectorBase< T > & )

deletenoexcept

◆ StaticVectorBase() [2/3]

template<typename T>

sen::StaticVectorBase< T >::StaticVectorBase ( StaticVectorBase< T > && )

deletenoexcept

◆ StaticVectorBase() [3/3]

template<typename T>

sen::StaticVectorBase< T >::StaticVectorBase	(	std::size_t	capacity,
		void *	dataPtr )

inlineprotectednoexcept

◆ ~StaticVectorBase()

template<typename T>

virtual sen::StaticVectorBase< T >::~StaticVectorBase ( )

inlineprotectedvirtualnoexcept

Member Function Documentation

◆ operator=() [1/2]

template<typename T>

StaticVectorBase & sen::StaticVectorBase< T >::operator= ( StaticVectorBase< T > && )

deletenoexcept

◆ operator=() [2/2]

template<typename T>

StaticVectorBase & sen::StaticVectorBase< T >::operator= ( const StaticVectorBase< T > & )

deletenoexcept

◆ size()

template<typename T>

size_type sen::StaticVectorBase< T >::size ( ) const

inlinenodiscardnoexcept

Element count. Complexity: constant.

◆ capacity()

template<typename T>

size_type sen::StaticVectorBase< T >::capacity ( ) const

inlinenodiscardnoexcept

Maximum number of elements that can be allocated in the storage. Complexity: constant.

◆ maxSize()

template<typename T>

size_type sen::StaticVectorBase< T >::maxSize ( ) const

inlinenodiscardnoexcept

Max element count (same as capacity()). Complexity: constant.

◆ data() [1/2]

template<typename T>

const_pointer sen::StaticVectorBase< T >::data ( ) const

inlinenodiscardnoexcept

Direct access to the underlying storage. Complexity: constant.

◆ data() [2/2]

template<typename T>

pointer sen::StaticVectorBase< T >::data ( )

inlinenodiscardnoexcept

Direct access to the underlying storage. Complexity: constant.

◆ empty()

template<typename T>

bool sen::StaticVectorBase< T >::empty ( ) const

inlinenodiscardnoexcept

true if the container is empty. Complexity: constant

◆ full()

template<typename T>

bool sen::StaticVectorBase< T >::full ( ) const

inlinenodiscardnoexcept

true if the container is full. Complexity: constant

◆ assign() [1/4]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::assign	(	StaticVectorBase< T >::size_type	n,
		const T &	u )

inlinenodiscardnoexcept

Clears the vector and assigns n copies of u to it. Complexity: linear in n.

Postcondition: object contains n values of u.

Parameters

n	the number of elements to assign.
u	the value to be copied in.

Returns: Ok - operation was successful full - not enough capacity to hold n elements.

◆ assign() [2/4]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::assign ( const std::initializer_list< T > & list )

inlinenodiscardnoexcept

Initializer list assignment. Complexity: linear in list.size().

Postcondition: object contains all the elements of list.

Parameters

list	elements to be stored in the vector.

Returns: Ok - operation was successful full - not enough capacity to hold list.size() elements.

◆ assign() [3/4]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::assign ( std::initializer_list< T > && list )

inlinenodiscardnoexcept

Initializer list assignment (r-value version). Complexity: linear in list.size().

Postcondition: object contains all the elements of list.

Parameters

list	elements to be stored in the vector.

Returns: Ok - operation was successful full - not enough capacity to hold list.size() elements.

◆ assign() [4/4]

template<typename T>

template<class InputIt>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::assign	(	InputIt	first,
		InputIt	last )

inlinenodiscardnoexcept

Clears the vector and assigns a range to it. Complexity: linear in distance(first, last).

Postcondition: object contains a copy of all the elements between first and last.

Returns: Ok - operation was successful badRange - [first, last] is not a valid range. full - not enough capacity to hold list.size() elements.

◆ begin() [1/2]

template<typename T>

iterator sen::StaticVectorBase< T >::begin ( )

inlinenodiscardnoexcept

Returns an iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to end(). Complexity: constant.

◆ begin() [2/2]

template<typename T>

const_iterator sen::StaticVectorBase< T >::begin ( ) const

inlinenodiscardnoexcept

Returns an iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to end(). Complexity: constant.

◆ end() [1/2]

template<typename T>

iterator sen::StaticVectorBase< T >::end ( )

inlinenodiscardnoexcept

Iterator to the element following the last element. Complexity: constant.

◆ end() [2/2]

template<typename T>

const_iterator sen::StaticVectorBase< T >::end ( ) const

inlinenodiscardnoexcept

Iterator to the element following the last element. Complexity: constant. NOLINTNEXTLINE(cppcoreguidelines-pro-bounds-pointer-arithmetic).

◆ rbegin() [1/2]

template<typename T>

reverse_iterator sen::StaticVectorBase< T >::rbegin ( )

inlinenodiscardnoexcept

Reverse iterator to the first element. Complexity: constant.

◆ rbegin() [2/2]

template<typename T>

const_reverse_iterator sen::StaticVectorBase< T >::rbegin ( ) const

inlinenodiscardnoexcept

Reverse iterator to the first element. Complexity: constant.

◆ rend() [1/2]

template<typename T>

reverse_iterator sen::StaticVectorBase< T >::rend ( )

inlinenodiscardnoexcept

Returns a reverse iterator to the element following the last element of the reversed vector. It corresponds to the element preceding the first element of the non-reversed vector. This element acts as a placeholder, attempting to access it results in undefined behavior. Complexity: constant.

◆ rend() [2/2]

template<typename T>

const_reverse_iterator sen::StaticVectorBase< T >::rend ( ) const

inlinenodiscardnoexcept

Returns a reverse iterator to the element following the last element of the reversed vector. It corresponds to the element preceding the first element of the non-reversed vector. This element acts as a placeholder, attempting to access it results in undefined behavior. Complexity: constant.

◆ cbegin() [1/2]

template<typename T>

const_iterator sen::StaticVectorBase< T >::cbegin ( )

inlinenodiscardnoexcept

Returns a const iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to cend(). Complexity: constant.

◆ cbegin() [2/2]

template<typename T>

const_iterator sen::StaticVectorBase< T >::cbegin ( ) const

inlinenodiscardnoexcept

Returns a const iterator to the first element of the vector. If the vector is empty, the returned iterator will be equal to cend(). Complexity: constant.

◆ cend() [1/2]

template<typename T>

const_iterator sen::StaticVectorBase< T >::cend ( )

inlinenodiscardnoexcept

Constant iterator to the element following the last element. Complexity: constant.

◆ cend() [2/2]

template<typename T>

const_iterator sen::StaticVectorBase< T >::cend ( ) const

inlinenodiscardnoexcept

Constant iterator to the element following the last element. Complexity: constant.

◆ operator[]() [1/2]

template<typename T>

reference sen::StaticVectorBase< T >::operator[] ( size_type i )

inlinenodiscardnoexcept

Gets the element at index i. Complexity: constant.

Precondition: i < size(); i >= 0

Warning: This function does not perform range checks. Please ensure that i is within valid limits.

Parameters

i	index of the element to fetch.

Returns: the value of the element at position i.

◆ operator[]() [2/2]

template<typename T>

const_reference sen::StaticVectorBase< T >::operator[] ( size_type i ) const

inlinenodiscardnoexcept

Gets the element at index i. Complexity: constant.

Precondition: i < size(); i >= 0

Warning: This function does not perform range checks. Please ensure that i is within valid limits.

Parameters

i	index of the element to fetch.

Returns: the value of the element at position i.

◆ front() [1/2]

template<typename T>

reference sen::StaticVectorBase< T >::front ( )

inlinenodiscardnoexcept

The element at the beginning of the container. Calling front on an empty container is undefined. Complexity: constant.

Precondition: !empty()

◆ front() [2/2]

template<typename T>

const_reference sen::StaticVectorBase< T >::front ( ) const

inlinenodiscardnoexcept

The element at the beginning of the container (const version). Calling front on an empty container is undefined. Complexity: constant.

Precondition: !empty()

◆ back() [1/2]

template<typename T>

reference sen::StaticVectorBase< T >::back ( )

inlinenodiscardnoexcept

The element at the end of the container. Calling back on an empty container is undefined. Complexity: constant.

Precondition: !empty()

◆ back() [2/2]

template<typename T>

const_reference sen::StaticVectorBase< T >::back ( ) const

inlinenodiscardnoexcept

The element at the end of the container (const version). Calling back on an empty container is undefined. Complexity: constant.

Precondition: !empty()

◆ clear()

template<typename T>

void sen::StaticVectorBase< T >::clear ( )

inlinenoexcept

Clears the vector. This function destroys all the elements. Complexity: linear in size().

Postcondition: size() == 0; empty()

◆ push_back() [1/3]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::push_back ( T && value )

inlinenoexcept

Appends a value to the end of the container (r-value version). Complexity: constant.

Returns: Ok - operation was successful full - not enough capacity in the vector.

NOLINTNEXTLINE(readability-identifier-naming)

◆ push_back() [2/3]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::push_back ( const T & value )

inlinenoexcept

Appends a value to the end of the container. Complexity: constant.

Returns: Ok - operation was successful full - not enough capacity in the vector.

NOLINTNEXTLINE(readability-identifier-naming)

◆ push_back() [3/3]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::push_back ( )

inlinenoexcept

Appends a value (default constructed) to the end of the container. Complexity: constant.

Returns: Ok - operation was successful full - not enough capacity in the vector.

NOLINTNEXTLINE(readability-identifier-naming)

◆ emplace()

template<typename T>

template<typename... Args>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::emplace	(	StaticVectorBase< T >::iterator	position,
		Args &&...	args )

inlinenoexcept

Inserts a new element into the container directly before pos. The arguments args... are forwarded to the constructor as std::forward<Args>(args) args... may directly or indirectly refer to a value in the container.

Only the iterators and references before the insertion point remain valid. The past-the-end iterator is also invalidated.

Complexity: linear in size().

Returns: badRange - position was not in a valid range full - not enough capacity in the vector. iterator - pointing to the emplaced element.

◆ emplace_back()

template<typename T>

template<typename... Args>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::emplace_back ( Args &&... args )

inlinenoexcept

Constructs an element in-place at the end of the embedded storage.

Appends a new element to the end of the container. The arguments args... are forwarded to the constructor as std::forward<Args>(args)

Only the past-the-end iterator is invalidated.

Complexity: constant

Template Parameters

Args	- arguments for constructing the element.

Returns: full - not enough capacity in the vector. iterator - pointing to the emplaced element.

◆ pop_back()

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::pop_back ( )

inlinenoexcept

Removes the last element of the container. Iterators and references to the last element, as well as the end() iterator, are invalidated. Complexity: constant.

Returns: empty - attempted to pop_back on an empty vector. ok - successful operation.

◆ insert() [1/5]

template<typename T>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::insert	(	StaticVectorBase< T >::iterator	position,
		const_reference	x )

inlinenoexcept

Inserts and element before position. Complexity: linear in size().

Parameters

position	- where to insert the new element.
x	- element to insert.

Returns: badRange - position was not in a valid range. full - not enough capacity in the vector. iterator - pointing to the inserted element.

◆ insert() [2/5]

template<typename T>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::insert	(	iterator	position,
		value_type &&	x )

inlinenoexcept

Inserts and element before position (r-value version). Complexity: linear in size().

Parameters

position	- where to insert the new element
x	- element to insert

Returns: badRange - position was not in a valid range. full - not enough capacity in the vector. iterator - pointing to the inserted element.

◆ insert() [3/5]

template<typename T>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::insert	(	StaticVectorBase< T >::iterator	position,
		StaticVectorBase< T >::size_type	n,
		const T &	x )

inlinenoexcept

Inserts n copies of the value before pos Complexity: linear in size() and n.

Parameters

position	- where to insert the new elements.
n	- number of elements to insert.
x	- value of the elements to insert.

Returns: badRange - position was not in a valid range. full - not enough capacity in the vector. iterator - iterator pointing to the first element inserted, or position if n == 0.

◆ insert() [4/5]

template<typename T>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::insert	(	StaticVectorBase< T >::iterator	position,
		std::initializer_list< T >	list )

inlinenoexcept

Inserts a range of values via initializer list. Complexity: linear in size() and list.size().

Parameters

position	- where to insert the new elements.
list	- elements to insert.

Returns: badRange - position was not in a valid range. full - not enough capacity in the vector. iterator - iterator pointing to the first element inserted, or position if list.size() == 0.

◆ insert() [5/5]

template<typename T>

template<class InputIt>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::insert	(	iterator	position,
		InputIt	first,
		InputIt	last )

inlinenoexcept

Inserts elements from range [first, last) before position. Complexity: linear in size() and distance(first, last).

Template Parameters

InputIt - type of the input iterators.

Parameters

position	- where to insert the new elements.
first	- range start.
last	- range end.

Returns: badRange - [first, last) is not a valid range. full - not enough capacity in the vector. iterator - iterator pointing to the first element inserted, or position if first == last.

◆ move_insert()

template<typename T>

template<class InputIt>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::move_insert	(	iterator	position,
		InputIt	first,
		InputIt	last )

inlinenoexcept

Inserts elements from range [first, last) before position (by moving them). Complexity: linear in size() and distance(first, last).

Template Parameters

InputIt - type of the input iterators.

Parameters

position	- where to insert the new elements.
first	- range start.
last	- range end.

Returns: badRange - [first, last) is not a valid range. full - not enough capacity in the vector. iterator - iterator pointing to the first element inserted, or position if first == last.

◆ resize() [1/2]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::resize	(	StaticVectorBase< T >::size_type	newSize,
		const T &	value )

inlinenoexcept

Changes the size of the container to newSize. If need to be appended, elements are copy-constructed from value. Complexity: linear in newSize.

Parameters

newSize	- expected new size of the vector.
value	- to copy the new elements

Returns: full - not enough capacity in the vector. ok - successful operation.

◆ resize() [2/2]

template<typename T>

StaticVectorBase< T >::Maybe sen::StaticVectorBase< T >::resize ( StaticVectorBase< T >::size_type newSize )

inlinenoexcept

Changes the size of the container to newSize. If need to be appended, elements are move-constructed from T{}. Complexity: linear in newSize.

Parameters

newSize - expected new size of the vector.

Returns: full - not enough capacity in the vector. ok - successful operation.

◆ erase() [1/2]

template<typename T>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::erase ( StaticVectorBase< T >::iterator position )

inlinenoexcept

Remove an element at position from the container. Complexity: linear in size().

Invalidates iterators and references at or after the point of the erase, including the end() iterator. / The iterator position must be valid and dereferenceable. Thus the end() iterator (which is valid, but is not dereferenceable) cannot be used as a value for position.

Parameters

position - where to remove the element.

Returns: badRange - position is not in a valid range. iterator - Iterator following the last removed element. If position refers to the last element, then the end() iterator is returned.

◆ erase() [2/2]

template<typename T>

StaticVectorBase< T >::MaybeIterator sen::StaticVectorBase< T >::erase	(	StaticVectorBase< T >::iterator	first,
		StaticVectorBase< T >::iterator	last )

inlinenoexcept

Remove a range of elements from the container. Complexity: linear in size() and distance(first, last).

Invalidates iterators and references at or after the point of the erase, including the end() iterator. The iterator first does not need to be dereferenceable if first==last: erasing an empty range is a no-op.

Parameters

first
last

Returns: badRange - first, last is not a valid range. iterator - iterator following the last removed element. if [first, last) is an empty range, then last is returned.

◆ internalSetSize()

template<typename T>

void sen::StaticVectorBase< T >::internalSetSize ( std::size_t newSize )

inlineprotectednoexcept

Changes the container size to newSize.

Precondition: : newSize <= capacity().

Note: No elements are constructed or destroyed. Complexity: constant

◆ internalDestroy()

template<typename T>

template<class InputIt>

void sen::StaticVectorBase< T >::internalDestroy	(	InputIt	first,
		InputIt	last )

inlinenoexcept

Member Data Documentation

◆ nothrowDes

template<typename T>

bool sen::StaticVectorBase< T >::nothrowDes = std::is_nothrow_destructible_v<T>

staticconstexpr

◆ nothrowDefaultCons

template<typename T>

bool sen::StaticVectorBase< T >::nothrowDefaultCons = std::is_nothrow_default_constructible_v<T>

staticconstexpr

◆ nothrowCopyCons

template<typename T>

bool sen::StaticVectorBase< T >::nothrowCopyCons = std::is_nothrow_copy_constructible_v<T>

staticconstexpr

◆ nothrowMoveCons

template<typename T>

bool sen::StaticVectorBase< T >::nothrowMoveCons = std::is_nothrow_move_constructible_v<T>

staticconstexpr

◆ nothrowCopyAndDes

template<typename T>

bool sen::StaticVectorBase< T >::nothrowCopyAndDes = nothrowDes && nothrowCopyCons

staticconstexpr

◆ nothrowDefaultConsAndDes

template<typename T>

bool sen::StaticVectorBase< T >::nothrowDefaultConsAndDes = nothrowDefaultCons && nothrowDes

staticconstexpr

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

static_vector.h

Public Types

Public Member Functions

Static Public Attributes

Protected Member Functions

Detailed Description

Member Typedef Documentation

◆ value_type

◆ difference_type

◆ pointer

◆ const_pointer

◆ reference

◆ const_reference

◆ rvalue_reference

◆ iterator

◆ const_iterator

◆ size_type

◆ reverse_iterator

◆ const_reverse_iterator

◆ Maybe

◆ MaybeIterator

Constructor & Destructor Documentation

◆ StaticVectorBase() [1/3]

◆ StaticVectorBase() [2/3]

◆ StaticVectorBase() [3/3]

◆ ~StaticVectorBase()

Member Function Documentation

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ size()

◆ capacity()

◆ maxSize()

◆ data() [1/2]

◆ data() [2/2]

◆ empty()

◆ full()

◆ assign() [1/4]

◆ assign() [2/4]

◆ assign() [3/4]

◆ assign() [4/4]

◆ begin() [1/2]

◆ begin() [2/2]

◆ end() [1/2]

◆ end() [2/2]

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ cbegin() [1/2]

◆ cbegin() [2/2]

◆ cend() [1/2]

◆ cend() [2/2]

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ back() [1/2]

◆ back() [2/2]

◆ clear()

◆ push_back() [1/3]

◆ push_back() [2/3]

◆ push_back() [3/3]

◆ emplace()

◆ emplace_back()

◆ pop_back()

◆ insert() [1/5]

◆ insert() [2/5]

◆ insert() [3/5]

◆ insert() [4/5]

◆ insert() [5/5]

◆ move_insert()

◆ resize() [1/2]

◆ resize() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ internalSetSize()

◆ internalDestroy()

Member Data Documentation

◆ nothrowDes

◆ nothrowDefaultCons

◆ nothrowCopyCons