TDeque

API > API/Runtime > API/Runtime/Core > API/Runtime/Core/Containers

References


Module	Core
Header	/Engine/Source/Runtime/Core/Public/Containers/Deque.h
Include	#include "Containers/Deque.h"

Syntax

template<typename InElementType, typename InAllocatorType>  
class TDeque

Remarks

Sequential double-ended queue (deque) container class.

A dynamically sized sequential queue of arbitrary size.

Constructors

	Type	Name	Description
		TDeque ()
		TDeque ( TDeque&& Other )
		TDeque ( const TDeque& Other )
		TDeque ( std::initializer_list< ElementType > InList )

Destructors

	Type	Name	Description
		~TDeque ()

Functions

Type	Name	Description
IteratorType	begin ()
ConstIteratorType	begin ()	STL IteratorType model compliance methods.
ElementType &	EmplaceFirst ( ArgsType&&... Args )	Constructs an element in place using the parameter arguments and adds it at the front of the queue.
ElementType &	EmplaceLast ( ArgsType&&... Args )	Constructs an element in place using the parameter arguments and adds it at the back of the queue.
void	Empty ()	Empties the queue effectively destroying all contained elements and releases any acquired storage.
IteratorType	end ()
ConstIteratorType	end ()
ElementType &	First ()
const ElementType &	First ()
SIZE_T	GetAllocatedSize ()	Helper function to return the amount of memory allocated by this container.
bool	IsEmpty ()
const ElementType &	Last ()
ElementType &	Last ()
SizeType	Max ()
SizeType	Num ()
void	PopFirst ()	Removes the element at the front of the queue. This method requires a non-empty queue.
void	PopLast ()	Removes the element at the back of the queue. This method requires a non-empty queue.
void	PushFirst ( const ElementType& Element )	Adds the parameter element at the front of the queue.
void	PushFirst ( ElementType&& Element )
void	PushLast ( const ElementType& Element )	Adds the parameter element at the back of the queue.
void	PushLast ( ElementType&& Element )
void	Reserve ( SizeType InCount )	Reserves storage for the parameter element count.
void	Reset ()	Destroys all contained elements but doesn't release the container's storage.
bool	TryPopFirst ( ElementType& OutValue )	Removes the element at the front of the queue if existent after copying it to the parameter out value.
bool	TryPopLast ( ElementType& OutValue )	Removes the element at the back of the queue if existent after copying it to the parameter out value.

Operators

Type	Name	Description
bool	operator!= ( const TDeque& Right )
const ElementType &	operator[] ( SizeType Index )
ElementType &	operator[] ( SizeType Index )
TDeque &	operator= ( TDeque&& Other )
TDeque &	operator= ( const TDeque& Other )
TDeque &	operator= ( std::initializer_list< ElementType > InList )
bool	operator== ( const TDeque& Right )	TDeque comparison operators.