RawRadixTree.matchCommonPrefix

Lookup deepest node having whose key starts with key.

struct RawRadixTree

@safe pure nothrow @nogc inout

inout(Node)

matchCommonPrefix

(

UKey key

,

out UKey keyRest

)

Meta

Source

See Implementation

nxt trie RawRadixTree RawRadixTree aliases

hasValue

functions