1. Epic GamesDeveloper
  3. TDeque

TDeque

Sequential double-ended queue (deque) container class.

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
Public function  

TDeque ()

  
Public function  

TDeque ( TDeque&& Other
)

  
Public function  

TDeque ( const TDeque& Other
)

  
Public function  

TDeque ( std::initializer_list< ElementType > InList
)

  

Destructors

  Type Name Description
Public function  

~TDeque ()

  

Functions

  Type Name Description
Public function IteratorType

begin ()

  
Public function Const ConstIteratorType

begin ()

 STL IteratorType model compliance methods.
Public function ElementType &

EmplaceFirst ( ArgsType&&... Args
)

 Constructs an element in place using the parameter arguments and adds it at the front of the queue.
Public function ElementType &

EmplaceLast ( ArgsType&&... Args
)

 Constructs an element in place using the parameter arguments and adds it at the back of the queue.
Public function void

Empty ()

 Empties the queue effectively destroying all contained elements and releases any acquired storage.
Public function IteratorType

end ()

  
Public function Const ConstIteratorType

end ()

  
Public function ElementType &

First ()

  
Public function Const const ElementType &

First ()

  
Public function Const SIZE_T Helper function to return the amount of memory allocated by this container.
Public function Const bool

IsEmpty ()

  
Public function Const const ElementType &

Last ()

  
Public function ElementType &

Last ()

  
Public function Const SizeType

Max ()

  
Public function Const SizeType

Num ()

  
Public function void Removes the element at the front of the queue. This method requires a non-empty queue.
Public function void

PopLast ()

 Removes the element at the back of the queue. This method requires a non-empty queue.
Public function void

PushFirst ( const ElementType& Element
)

 Adds the parameter element at the front of the queue.
Public function void

PushFirst ( ElementType&& Element
)

  
Public function void

PushLast ( const ElementType& Element
)

 Adds the parameter element at the back of the queue.
Public function void

PushLast ( ElementType&& Element
)

  
Public function void

Reserve ( SizeType InCount
)

 Reserves storage for the parameter element count.
Public function void

Reset ()

 Destroys all contained elements but doesn't release the container's storage.
Public function bool

TryPopFirst ( ElementType& OutValue
)

 Removes the element at the front of the queue if existent after copying it to the parameter out value.
Public function 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
Public function Const bool

operator!= ( const TDeque& Right
)

  
Public function Const const ElementType &

operator[] ( SizeType Index
)

  
Public function ElementType &

operator[] ( SizeType Index
)

  
Public function TDeque &

operator= ( TDeque&& Other
)

  
Public function TDeque &

operator= ( const TDeque& Other
)

  
Public function TDeque &

operator= ( std::initializer_list< ElementType > InList
)

  
Public function Const bool

operator== ( const TDeque& Right
)

 TDeque comparison operators.

Typedefs

Name Description
AllocatorType  
ConstIteratorType  
ElementAllocatorType  
ElementType  
IteratorType  
SizeType  

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page