RawRadixTree.RawRadixTree

Undocumented in source.

template RawRadixTree(Value = void, A_)

struct RawRadixTree {

alias NodeType = Node;

alias BranchType = Branch;

alias DefaultBranchType = DefaultBranch;

alias ValueType = Value;

alias RangeType = Range;

alias StatsType = Stats;

alias SparseBranchType = SparseBranch;

alias DenseBranchType = DenseBranch;

alias ElementRefType = ElementRef;

alias hasValue = isValue;

Range opSlice();

typeof(this) dup();

Stats usageHistograms();

this(Node root, size_t length, A alloc);

this(Node root, size_t length);

void clear();

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

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

static if(isValue)

inout(Value*) contains(UKey key);

static if(!(isValue))

bool contains(UKey key);

static if(isValue)

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

static if(!(isValue))

Node insert(UKey key, ElementRef elementRef);

size_t countHeapNodes();

bool empty();

size_t length();

Node rootNode();

void print();

}

Constructors

this this(Node root, size_t length, A alloc): Undocumented in source.
this this(A alloc): Undocumented in source.
this this(): Undocumented in source.
this this(Node root, size_t length): Undocumented in source.

Destructor

~this ~this(): Undocumented in source.

Postblit

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

Members

Aliases

BranchType alias BranchType = Branch: Undocumented in source.
DefaultBranchType alias DefaultBranchType = DefaultBranch: Undocumented in source.
DenseBranchType alias DenseBranchType = DenseBranch: Undocumented in source.
ElementRefType alias ElementRefType = ElementRef: Undocumented in source.
NodeType alias NodeType = Node: Undocumented in source.
RangeType alias RangeType = Range: Undocumented in source.
SparseBranchType alias SparseBranchType = SparseBranch: Undocumented in source.
StatsType alias StatsType = Stats: Undocumented in source.
ValueType alias ValueType = Value: Undocumented in source.
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)
countHeapNodes size_t countHeapNodes(): Undocumented in source. Be warned that the author may not have intended to support it.
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.
insert Node insert(UKey key, ElementRef elementRef): Undocumented in source. Be warned that the author may not have intended to support it.
length size_t length()
matchCommonPrefix inout(Node) matchCommonPrefix(UKey key, UKey keyRest): Lookup deepest node having whose key starts with key.
opSlice Range opSlice(): Undocumented in source. Be warned that the author may not have intended to support it.
prefix inout(Node) prefix(UKey keyPrefix, UKey keyPrefixRest)
print void print(): Undocumented in source. Be warned that the author may not have intended to support it.
root Node root(): Undocumented in source. Be warned that the author may not have intended to support it.
rootNode Node rootNode(): Undocumented in source. Be warned that the author may not have intended to support it.
usageHistograms Stats usageHistograms(): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation