RadixTree

Radix-Tree with key of type K and value of type V (if non-void).

Alias This

byKey Range byKey(): AA-style key range.
byKeyValue Range byKeyValue(): AA-style key-value range.
contains inout(V*) contains(K key)
contains bool contains(K key)
dup typeof(this) dup(): Returns a duplicate of this tree. Shallowly duplicates the values in the map case.
insert bool insert(K key, V value): Insert key.
insert bool insert(K key): Insert key.
opBinaryRight auto opBinaryRight(K key): Supports K in this syntax.
opIndex V opIndex(K key): Undocumented in source. Be warned that the author may not have intended to support it.
opIndexAssign auto opIndexAssign(V value, K key): Undocumented in source. Be warned that the author may not have intended to support it.
opSlice Range opSlice(): Undocumented in source. Be warned that the author may not have intended to support it.
prefix auto prefix(K keyPrefix): Get range over elements whose key starts with keyPrefix. The element equal to keyPrefix is return as an empty instance of the type.
upperBound auto upperBound(K key): This function searches with policy sp to find the largest right subrange on which pred(value, x) is true for all x (e.g., if pred is "less than", returns the portion of the range with elements strictly greater than value). TODO: Add template param (SearchPolicy sp)