DynamicArray

Array that is able to grow itself when items are appended to it. Uses malloc/free/realloc to manage its storage.

struct DynamicArray (

T

Allocator = Mallocator

bool supportGC = shouldAddGCRange!T

) {

this(Allocator allocator);

auto opSlice();

auto opSlice(size_t a, size_t b);

auto opIndex(size_t i);

void insert(T value);

alias put = insert;

void remove(size_t i);

void opIndexAssign(T value, size_t i);

void opSliceAssign(T value);

void opSliceAssign(T value, size_t i, size_t j);

size_t length();

bool empty();

}

Constructors

this this(): No default construction if an allocator must be provided.
this this(Allocator allocator): Use the given allocator for allocations.

Destructor

~this ~this(): Undocumented in source.

Postblit

this(this) this(this): Undocumented in source.

Members

Aliases

put alias put = insert: Inserts the given value into the end of the array.

Functions

back T back()
empty bool empty()
front T front()
insert void insert(T value): Inserts the given value into the end of the array.
length size_t length()
opIndex auto opIndex(size_t i): Index operator overload
opIndexAssign void opIndexAssign(T value, size_t i): Index assignment support
opSlice auto opSlice()
auto opSlice(size_t a, size_t b): Slice operator overload
opSliceAssign void opSliceAssign(T value)
void opSliceAssign(T value, size_t i, size_t j): Slice assignment support
ptr auto ptr()
remove void remove(size_t i): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

containers dynamicarray classes

Cls

structs

DynamicArray