最大長固定の静的vector [詳解]

#include <wordring/static_vector/static_vector.hpp>

公開型
using	value_type = typename container::value_type

using	size_type = typename container::size_type

using	difference_type = typename container::difference_type

using	reference = typename container::reference

using	const_reference = typename container::const_reference

using	pointer = typename container::pointer

using	const_pointer = typename container::const_pointer

using	iterator = detail::static_vector_iterator< container >

using	const_iterator = detail::static_vector_iterator< container const >

using	reverse_iterator = std::reverse_iterator< iterator >

using	const_reverse_iterator = std::reverse_iterator< const_iterator >

公開メンバ関数
	static_vector (size_type count, value_type const &value)

	static_vector (size_type count)

template<typename InputIterator >
	static_vector (InputIterator first, InputIterator last)

	static_vector (static_vector const &)=default

	static_vector (static_vector &&)=default

	static_vector (std::initializer_list< value_type > ilist)

static_vector &	operator= (static_vector const &)=default

static_vector &	operator= (static_vector &&)=default

static_vector &	operator= (std::initializer_list< value_type > ilist)

void	assign (size_type count, value_type const &value)

template<typename InputIterator >
void	assign (InputIterator first, InputIterator last)

void	assign (std::initializer_list< value_type > ilist)

reference	at (size_type pos)

const_reference	at (size_type pos) const

reference	operator[] (size_type pos)

const_reference	operator[] (size_type pos) const

reference	front ()

const_reference	front () const

reference	back ()

const_reference	back () const

pointer	data () noexcept

const_pointer	data () const noexcept

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

bool	empty () const noexcept

size_type	size () const noexcept

size_type	max_size () const noexcept

size_type	capacity () const noexcept

void	clear () noexcept

iterator	insert (const_iterator pos, value_type const &value)

iterator	insert (const_iterator pos, value_type &&value)

iterator	insert (const_iterator pos, size_type count, value_type const &value)

template<typename InputIterator >
iterator	insert (const_iterator pos, InputIterator first, InputIterator last)

iterator	insert (const_iterator pos, std::initializer_list< value_type > ilist)

iterator	erase (const_iterator pos)

iterator	erase (const_iterator first, const_iterator last)

void	push_back (value_type const &value)

void	push_back (value_type &&value)

void	pop_back ()

void	resize (size_type count)

void	resize (size_type count, value_type const &value)

void	swap (static_vector &other)

限定公開型
using	container = std::array< T, N >

限定公開変数類
container	m_container

size_type	m_size

フレンド
template<typename T1 , std::size_t N1>
bool	operator== (static_vector< T1, N1 > const &lhs, static_vector< T1, N1 > const &rhs)

template<typename T1 , std::size_t N1>
bool	operator!= (static_vector< T1, N1 > const &lhs, static_vector< T1, N1 > const &rhs)

template<typename T1 , std::size_t N1>
bool	operator< (static_vector< T1, N1 > const &lhs, static_vector< T1, N1 > const &rhs)

template<typename T1 , std::size_t N1>
bool	operator<= (static_vector< T1, N1 > const &lhs, static_vector< T1, N1 > const &rhs)

template<typename T1 , std::size_t N1>
bool	operator> (static_vector< T1, N1 > const &lhs, static_vector< T1, N1 > const &rhs)

template<typename T1 , std::size_t N1>
bool	operator>= (static_vector< T1, N1 > const &lhs, static_vector< T1, N1 > const &rhs)

詳解

最大長固定の静的vector

メモリーの動的確保を避ける目的で用意した。

このクラス詳解は次のファイルから抽出されました:

static_vector.hpp

公開型

公開メンバ関数

限定公開型

限定公開変数類

フレンド

詳解