The value stored in a trie.
The array trie.
The string to search for the key from the trie
.
Optional
startIndex: number = 0Optional
endIndex: number = input.lengthOptional
result: ArrayTrieSearchResult<T>The in-out parameter, that holds the search result. If omitted, a new object is returned on every call.
Generated using TypeDoc
Searches for a leaf with the key that matches the longest substring in
input
that starts atstartIndex
and ends atendIndex
.Returns
The
result
object ornull
if there's no matching key.