Detailed Description

template<typename T>
class fl::deque< T >

Definition at line 14 of file deque.h.

#include <deque.h>

Inheritance diagram for fl::deque< T >:

Collaboration diagram for fl::deque< T >:

Classes
class	const_iterator

class	iterator

Public Types
typedef fl::reverse_iterator< const_iterator >	const_reverse_iterator

typedef fl::reverse_iterator< iterator >	reverse_iterator

Public Member Functions
	deque () FL_NOEXCEPT

	deque (const deque &other) FL_NOEXCEPT

	deque (deque &&other) FL_NOEXCEPT

	deque (fl::initializer_list< T > init)

	deque (fl::size count, const T &value=T())

	deque (memory_resource *resource)

	~deque () FL_NOEXCEPT

void	assign (fl::size count, const T &value)

T &	at (fl::size index)

const T &	at (fl::size index) const

T &	back ()

const T &	back () const

iterator	begin ()

const_iterator	begin () const

fl::size	capacity () const

const_iterator	cbegin () const

const_iterator	cend () const

void	clear ()

const_reverse_iterator	crbegin () const

const_reverse_iterator	crend () const

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

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

template<typename... Args>
T &	emplace_front (Args &&... args)

bool	empty () const

iterator	end ()

const_iterator	end () const

iterator	erase (const_iterator first, const_iterator last)

iterator	erase (const_iterator pos)

T &	front ()

const T &	front () const

memory_resource *	get_memory_resource () const

iterator	insert (const_iterator pos, const T &value)

iterator	insert (const_iterator pos, fl::size count, const T &value)

iterator	insert (const_iterator pos, T &&value)

fl::size	max_size () const

bool	operator!= (const deque &other) const

bool	operator< (const deque &other) const

bool	operator<= (const deque &other) const

deque &	operator= (const deque &other) FL_NOEXCEPT

deque &	operator= (deque &&other) FL_NOEXCEPT

bool	operator== (const deque &other) const

bool	operator> (const deque &other) const

bool	operator>= (const deque &other) const

T &	operator[] (fl::size index)

const T &	operator[] (fl::size index) const

void	pop_back ()

void	pop_front ()

void	push_back (const T &value)

void	push_back (T &&value)

void	push_front (const T &value)

void	push_front (T &&value)

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

void	reserve (fl::size new_capacity)

void	resize (fl::size new_size)

void	resize (fl::size new_size, const T &value)

void	shrink_to_fit ()

fl::size	size () const

void	swap (deque &other)

Private Member Functions
void	ensure_capacity (fl::size min_capacity)

fl::size	get_index (fl::size logical_index) const

Private Attributes
fl::size	mCapacity = 0

T *	mData = nullptr

fl::size	mFront = 0

memory_resource *	mResource = default_memory_resource()

fl::size	mSize = 0

Static Private Attributes
static const fl::size	kInitialCapacity = 8

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

fl/stl/deque.h

Detailed Description

Classes

Public Types

Public Member Functions

Private Member Functions

Private Attributes

Static Private Attributes