Inner.IndexMixin

index implementation

template Inner(ThisContainer, ThisNode, Value, ValueView, size_t N, Allocator)

mixin template IndexMixin (

size_t N

alias KeyFromValue

alias Compare

ThisContainer

) {

struct HeapRangeT(bool is_const);

ThisNode*[] _heap;

HeapRange opSlice();

size_t length [@property getter];

bool empty [@property getter];

front [@property getter];

back [@property getter];

void clear();

size_t capacity();

void reserve(size_t count);

size_t insert(SomeValue value);

void removeFront();

alias removeAny = removeFront;

void removeBack();

}

Members

Aliases

removeAny alias removeAny = removeFront: Forwards to removeFront

Functions

capacity size_t capacity(): Returns the capacity of the index, which is the length of the underlying store
clear void clear(): ??
insert size_t insert(SomeValue value): Inserts value into this heap, unless another index refuses it.
opSlice HeapRange opSlice(): Fetch a range that spans all the elements in the container.
removeBack void removeBack(): removes the back of this index from the container. Why would you do this? No idea. Complexity: O(d(n));
O(1) for this index
removeFront void removeFront(): Removes the max element of this index from the container. Complexity: O(d(n));
O(log(n)) for this index
reserve void reserve(size_t count): Ensures sufficient capacity to accommodate n elements.

Properties

back back [@property getter]
empty bool empty [@property getter]: Property returning true if and only if the container has no elements.
front front [@property getter]
length size_t length [@property getter]: Returns the number of elements in the container.

Structs

HeapRangeT struct HeapRangeT(bool is_const): The primary range of the index, which embodies a bidirectional range.

Meta

Source

See Implementation

util multi_index Heap Inner mixin templates

IndexMixin