from the documentation prefix: Will return the longest entry in the trie that is a prefix of word.
usr/bin/perl use Tree::Trie; my $trie = Tree::Trie->new( { deepsearch => 'prefix' } ); $trie->add_data ("+61" => "Term", "+611411" => Outleg_1, "+6114110" +=> "Outleg_2" , "+65" => "Term_Ref", default => unknown ); $trie->lookup("+61"); $trie->lookup("+612");
In reply to Re^2: A question a Tree::Trie
by jhuijsing
in thread A question a Tree::Trie
by jhuijsing
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |