本文整理汇总了C#中Trie.GetWordOccurance方法的典型用法代码示例。如果您正苦于以下问题：C# Trie.GetWordOccurance方法的具体用法？C# Trie.GetWordOccurance怎么用？C# Trie.GetWordOccurance使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Trie的用法示例。
在下文中一共展示了Trie.GetWordOccurance方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Main
public static void Main()
{
string inputText;
StreamReader reader = new StreamReader("test.txt");
using (reader)
{
inputText = reader.ReadToEnd().ToLower();
}
var matches = Regex.Matches(inputText, @"[a-zA-Z]+");
HashSet<string> uniqueWords = new HashSet<string>();
var trie = new Trie();
for (int i = 0; i < matches.Count; i++)
{
uniqueWords.Add(matches[i].ToString());
trie.Add(matches[i].ToString());
}
foreach (var word in uniqueWords)
{
Console.WriteLine("{0} -> {1} times", word, trie.GetWordOccurance(word));
}
}示例2: Main
static void Main()
{
/*Implement a class PriorityQueue<T> based on the data structure "binary heap".
Write a program to read a large collection of products(name + price) and efficiently find the first 20 products in the price range[a…b].
Test for 500 000 products and 10 000 price searches.
Hint: you may use OrderedBag<T> and sub-ranges.
Write a program that finds a set of words (e.g. 1000 words) in a large text(e.g. 100 MB text file).
Print how many times each word occurs in the text.
Hint: you may find a C# trie in Internet.*/
var priorityQueue = new MyPriorityQueue<int>();
priorityQueue.Enqueue(1);
priorityQueue.Enqueue(3);
priorityQueue.Enqueue(18);
priorityQueue.Enqueue(4);
priorityQueue.Enqueue(105);
priorityQueue.Enqueue(213);
var last = priorityQueue.Dequeue();
Console.WriteLine("TASK 1:");
Console.WriteLine("Dequed: " + last);
Console.WriteLine("Size of queue: " + priorityQueue.Count());
Console.WriteLine("All elements: \n" + String.Join(", ", priorityQueue.All()));
Console.WriteLine();
/*Write a program to read a large collection of products (name + price) and efficiently find
the first 20 products in the price range [a…b].
Test for 500 000 products and 10 000 price searches.
Hint: you may use OrderedBag<T> and sub-ranges.*/
var db = new ProductsDb();
for (int i = 0; i < 500000; i++)
{
db.AddProduct(new Product(GetRandomName(), GetRandomPriceInRange(0, 100000)));
}
Console.WriteLine("TASK 2:");
Console.WriteLine("500 000 products added");
var stopWatch = new Stopwatch();
stopWatch.Start();
var productsInRange = db.GetProductsInPriceRange(100, 3000);
stopWatch.Stop();
Console.WriteLine("Alll products in this range: " + productsInRange.Count);
Console.WriteLine("Elapsed time to find all products: "+ stopWatch.Elapsed);
Console.WriteLine();
/*Write a program that finds a set of words(e.g. 1000 words) in a large text(e.g. 100 MB text file).
Print how many times each word occurs in the text.
Hint: you may find a C# trie in Internet.*/
var sw = new Stopwatch();
var trie = new Trie();
for (int i = 0; i < wordsToAdd; i++)
{
string word = GetRandomName();
sw.Start();
trie.Add(word);
sw.Stop();
}
Console.WriteLine("TASK 3");
Console.WriteLine("Added {0} words for {1} time", wordsToAdd, sw.Elapsed);
sw.Reset();
for (int i = 0; i < wordsToSearch; i++)
{
string word = GetRandomName();
sw.Start();
trie.GetWordOccurance(word);
sw.Stop();
}
Console.WriteLine("Found {0} words for {1} time", wordsToSearch, sw.Elapsed);
Console.WriteLine("Most common word: {0}", trie.GetMostCommonWord());
}