Set

Set implemented on top of ranges. Unique and ordered (at time of adding)

struct Set (

T

) {

void add(E element);

void add(RANGE elements);

void remove(E element);

void remove(RANGE elements);

void popFront();

bool empty();

size_t length();

T opIndex(size_t id);

}

Members

Functions

add void add(E element): Add an element to the set
add void add(RANGE elements): Add a range of elements
array T[] array(): Return an array version of the set
empty bool empty(): Returns true when the set is empty
front T front(): Returns the front/first element of the set
length size_t length(): Number of elements in the set
opIndex T opIndex(size_t id): Access by id.
popFront void popFront(): Removes the front element from the set
remove void remove(E element): Remove an element from the set
remove void remove(RANGE elements): Remove a range of elements

Meta

Source

See Implementation

todod set functions

structs

Set