本文整理汇总了C#中Trie.PrefixMatch方法的典型用法代码示例。如果您正苦于以下问题：C# Trie.PrefixMatch方法的具体用法？C# Trie.PrefixMatch怎么用？C# Trie.PrefixMatch使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Trie的用法示例。
在下文中一共展示了Trie.PrefixMatch方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: PrefixMatchTest
public void PrefixMatchTest()
{
string s = @"
In computer science, a trie, or prefix tree,
is an ordered tree data structure that is used to
store an associative array where the keys are strings.
Unlike a binary search tree, no node in the tree
stores the key associated with that node;
instead, its position in the tree shows what key
it is associated with. All the descendants
of any one node have a common prefix of the string
associated with that node, and the root is associated
with the empty string. Values are normally not associated
with every node, only with leaves and some inner nodes
that happen to correspond to keys of interest.
";
Trie<char, string> wordIndex = new Trie<char, string>(new LettersDomain());
foreach (string word in s.Replace("\r", "").Replace("\n", " ").Replace("\t", "").Split(' ', ',', ';', '.'))
{
if (word.Length > 0)
{
wordIndex.Add(word, word);
}
}
ITrieEnumerator<char, string> matches = wordIndex.PrefixMatch("p");
while (matches.MoveNext())
{
Console.WriteLine(matches.Current.Value);
}
}