TDeque

Sequential double-ended queue (deque) container class.

Choose your operating system:

Windows

macOS

Linux

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

Name Description

Public function

TDeque()

Public function

TDeque

(
    TDeque&& Other
)

Public function

TDeque

(
    const TDeque& Other
)

Public function

TDeque

(
    std::initializer_list< ElementType ...
)

Destructors

Name Description

Public function

~TDeque()

Functions

Name Description

Public function

IteratorType

 

begin()

Public function Const

ConstIterato...

 

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 Const

ConstIterato...

 

end()

Public function

IteratorType

 

end()

Public function Const

const Elemen...

 

First()

Public function

ElementType ...

 

First()

Public function Const

bool

 

IsEmpty()

Public function

ElementType ...

 

Last()

Public function Const

const Elemen...

 

Last()

Public function Const

SizeType

 

Max()

Public function Const

SizeType

 

Num()

Public function

void

 

PopFirst()

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

Name Description

Public function

ElementType ...

 

operator[]

(
    SizeType Index
)

Public function Const

const Elemen...

 

operator[]

(
    SizeType Index
)

Public function

TDeque &

 

operator=

(
    std::initializer_list< ElementType ...
)

Public function

TDeque &

 

operator=

(
    const TDeque& Other
)

Public function

TDeque &

 

operator=

(
    TDeque&& Other
)

Typedefs