Std.PrefixTrie.longestPrefixOf
1 declaration
fn
longestPrefixOf: &Std.PrefixTrie.PrefixTrie[V] -> Str -> Option[(Str, V)]This is a callable function.
What it does
The longest key that is a prefix of the given text, and its value.
What a routing table asks: the most specific rule that covers this path.
Every prefix of the text is on one walk, so the last match found on the way
down is the longest, and nothing needs comparing afterwards.
Read the signature
- The text after the name is the type checked by Pudu.
- Read arrows from left to right: inputs come first, and the final type is returned.
- & borrows a value for this call instead of moving or copying it.
- Names inside [ ] are type arguments, such as the item type held by a collection.
- Option holds Some(value) or None when no value is available.