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

) {

struct DenseSetFilter(E, Growable growable = Growable.yes, Copyable copyable = Copyable.no) via import nxt.filters : DenseSetFilter, Growable, Copyable;;

enum Growable via import nxt.filters : DenseSetFilter, Growable, Copyable;;

enum Copyable via import nxt.filters : DenseSetFilter, Growable, Copyable;;

struct DynamicArray(T, alias Allocator = null, CapacityType = size_t) via import nxt.dynamic_array : DynamicArray;;

alias ElementType = E;

bool insert(E e);

alias put = insert;

bool contains(E e);

bool opBinaryRight(E e);

bool empty [@property getter];

size_t length [@property getter];

auto opSlice();

void clear();

}

Postblit

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

Members

Aliases

ElementType alias ElementType = E: Undocumented in source.
put alias put = insert: Undocumented in source.

Functions

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

Properties

empty bool empty [@property getter]: Check if empty.
length size_t length [@property getter]: Get length.

Meta

Source

See Implementation

nxt filterarray structs

DenseSetFilterGrowableArray