RawRadixTree.RawRadixTree

template RawRadixTree(Value = void)

struct RawRadixTree {

alias hasValue = isValue;

typeof(this) dup();

void clear();

inout(Node) prefix(UKey keyPrefix, UKey keyPrefixRest);

inout(Node) matchCommonPrefix(UKey key, UKey keyRest);

inout(Value*) contains(UKey key);

bool contains(UKey key);

Node insert(UKey key, Value value, ElementRef elementRef);

bool empty();

size_t length();

}

Destructor

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

Postblit

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

Members

Aliases

hasValue alias hasValue = isValue: Is true if this tree stores values of type Value along with keys. In other words: this is a map rather than a set.

Functions

clear void clear(): Removes all contents (elements).
contains inout(Value*) contains(UKey key)
contains bool contains(UKey key)
dup typeof(this) dup(): Returns a duplicate of this tree if present. Shallowly duplicates the values in the map case.
empty bool empty()
insert Node insert(UKey key, Value value, ElementRef elementRef): Insert key into this tree.
length size_t length()
matchCommonPrefix inout(Node) matchCommonPrefix(UKey key, UKey keyRest): Lookup deepest node having whose key starts with key.
prefix inout(Node) prefix(UKey keyPrefix, UKey keyPrefixRest)

Meta

Source

See Implementation