DenseSetFilterGrowableArray

Container combining DenseSetFilter with growable array store.

Has O(1) unordered element access via slicing.

For use in graph algorithms with limited index ranges.

TODO better name?

struct DenseSetFilterGrowableArray (

E

alias Allocator = null

) if (

isDenseSetFilterable!E

) {

bool insert(E e);

bool contains(E e);

bool opBinaryRight(E e);

bool empty();

size_t length();

auto opSlice();

void clear();

}

Postblit

A postblit is present on this object, but not explicitly documented in the source.

Members

Functions

clear void clear(): Clear contents.
contains bool contains(E e): Check if element e is stored/contained.
empty bool empty(): Check if empty.
insert bool insert(E e): Insert element e.
length size_t length(): Get length.
opBinaryRight bool opBinaryRight(E e): Check if element e is stored/contained.
opSlice auto opSlice(): Non-mutable slicing.

Meta

Source

See Implementation

nxt filterarray structs

DenseSetFilterGrowableArray