class `TArray`

template<class Type, class Allocator = DefaultContainerAllocator>

Dynamically sized array, similar to std::vector.

Public

Constructors

TArray<Type, Allocator>

TArray<Type, Allocator>() = default

TArray<Type, Allocator>

TArray<Type, Allocator>(const TArray<Type, Allocator> &other)

TArray<Type, Allocator>

TArray<Type, Allocator>(TArray<Type, Allocator> &&other)

TArray<Type, Allocator>

TArray<Type, Allocator>(u64 size, const Type &value = Type())

TArray<Type, Allocator>

TArray<Type, Allocator>(std::initializer_list<Type> list)

Methods

~TArray<Type, Allocator>

~TArray<Type, Allocator>()

Empty

bool Empty() const

Begin

Iterator Begin()

End

Iterator End()

Begin

ConstIterator Begin() const

End

ConstIterator End() const

Cbegin

ConstIterator Cbegin() const

Cend

ConstIterator Cend() const

Rbegin

ReverseIterator Rbegin()

Rend

ReverseIterator Rend()

Rbegin

ConstReverseIterator Rbegin() const

Rend

ConstReverseIterator Rend() const

Crbegin

ConstReverseIterator Crbegin() const

Crend

ConstReverseIterator Crend() const

Size

u64 Size() const

Capacity

u64 Capacity() const

Data

Type *Data()

Data

const Type *Data() const

Front

Type &Front()

Back

Type &Back()

Front

const Type &Front() const

Back

const Type &Back() const

Add

void Add(const Type &element)

Add

void Add(Type &&element)

Append

void Append(u64 count, const Type &element)

Append

void Append(std::initializer_list<Type> list)

Pop

void Pop()

Erase

Iterator Erase(ConstIterator iter)

Erase

Iterator Erase(ConstIterator start, ConstIterator end)

Remove

void Remove(u64 index)

Contains

bool Contains(const Type &element)

RemoveValue

void RemoveValue(const Type &element)

Clear

void Clear()

Reserve

void Reserve(u64 capacity)

Resize

void Resize(u64 size, const Type &value = Type())

Shrink

void Shrink()

SwapAndErase

bool SwapAndErase(Iterator iter)

Insert

Iterator Insert(ConstIterator it, const Type &element)

Insert

Iterator Insert(ConstIterator it, Type &&element)

Insert

Iterator Insert(ConstIterator it, u32 count, const Type &element)

Insert

Iterator Insert(ConstIterator it, std::initializer_list<Type> list)

begin

Iterator begin()

end

Iterator end()

begin

ConstIterator begin() const

end

ConstIterator end() const

cbegin

ConstIterator cbegin() const

cend

ConstIterator cend() const

rbegin

ReverseIterator rbegin()

rend

ReverseIterator rend()

rbegin

ConstReverseIterator rbegin() const

rend

ConstReverseIterator rend() const

crbegin

ConstReverseIterator crbegin() const

crend

ConstReverseIterator crend() const

size

u64 size() const

capacity

u64 capacity() const

data

Type *data()

data

const Type *data() const

front

Type &front()

front

const Type &front() const

back

Type &back()

back

const Type &back() const

insert

Iterator insert(ConstIterator it, const Type &element)

erase

Iterator erase(ConstIterator iter)

erase

Iterator erase(ConstIterator start, ConstIterator end)

clear

void clear()

reserve

void reserve(u64 capacity)

resize

void resize(u64 size, const Type &value = Type())

Operators

operator=

TArray<Type, Allocator> &operator=(const TArray<Type, Allocator> &other)

operator=

TArray<Type, Allocator> &operator=(TArray<Type, Allocator> &&other)

operator=

TArray<Type, Allocator> &operator=(std::initializer_list<Type> list)

operator==

bool operator==(const TArray<Type, Allocator> &other) const

operator!=

bool operator!=(const TArray<Type, Allocator> &other) const

operator<

bool operator<(const TArray<Type, Allocator> &other) const

operator>

bool operator>(const TArray<Type, Allocator> &other) const

operator<=

bool operator<=(const TArray<Type, Allocator> &other) const

operator>=

bool operator>=(const TArray<Type, Allocator> &other) const

operator[]

Type &operator[](u64 index)

operator[]

const Type &operator[](u64 index) const

Private

Methods

ChangeCapacity

void ChangeCapacity(u64 capacity)

Fields

mAllocator

typename Allocator::template ForElementType<Type> mAllocator

mSize

u64 mSize

mCapacity

u64 mCapacity