public void Test()
{
var sampleWord = "aardvark";
trie.Add(sampleWord);
var words = new List <string>();
Assert.IsTrue(trie.Contains(sampleWord, out words));
}
static void Main(string[] args)
{
//FIFO
Queue queue = new Queue();
Console.WriteLine(queue.IsEmpty());
queue.Add(1);
queue.Add(3);
queue.Print();
Console.WriteLine(queue.Peek());
queue.Add(5);
queue.Add(2);
queue.Print();
queue.Remove();
queue.Print();
//LIFO
Stack stack = new Stack();
Console.WriteLine(stack.IsEmpty());
stack.Push(1);
stack.Push(3);
stack.Print();
Console.WriteLine(stack.Peek());
stack.Push(5);
stack.Push(2);
stack.Print();
stack.Pop();
stack.Print();
Console.ReadKey();
LinkedList linkedList = new LinkedList(1);
linkedList.PrindList();
linkedList.Delete();
linkedList.Append(2);
linkedList.PrindList();
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete();
linkedList.PrindList();
linkedList.Clear();
linkedList.PrindList();
linkedList.Append(2);
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete(4);
linkedList.PrindList();
linkedList.Clear();
linkedList.PrindList();
linkedList.Append(2);
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete(2);
linkedList.PrindList();
linkedList.Clear();
linkedList.PrindList();
linkedList.Append(2);
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete(10);
linkedList.PrindList();
Console.ReadKey();
Console.WriteLine("Hello World!");
HeapMin heapMin = new HeapMin();
heapMin.printArray = true;
heapMin.Add(3);
heapMin.Add(4);
heapMin.Add(8);
heapMin.Add(1);
heapMin.Add(7);
heapMin.Add(2);
heapMin.Add(5);
int min = heapMin.Peek();
Console.WriteLine(min); // should == 1
heapMin.Pool();
heapMin.Pool();
heapMin.Pool();
min = heapMin.Peek();
Console.WriteLine(min); // should == 4
//Console.ReadKey();
//BSTree bSTree = new BSTree(10);
//bSTree.Insert(15);
//bSTree.Insert(5);
//bSTree.PrintInOrder();
//bSTree.Insert(8);
//bSTree.PrintInOrder();
//Console.WriteLine(bSTree.Contains(8));
//Console.WriteLine(bSTree.Contains(18));
//Console.ReadKey();
string[] keys = { "the", "a", "there", "answer",
"any", "by", "bye", "their" };
string[] output = { "Not present in trie", "Present in trie" };
Trie trie = new Trie();
// Construct trie
for (int i = 0; i < keys.Length; i++)
{
trie.Insert(keys[i]);
}
// Search for different keys
if (trie.Contains("the") == true)
{
Console.WriteLine("the --- " + output[1]);
}
else
{
Console.WriteLine("the --- " + output[0]);
}
if (trie.Contains("these") == true)
{
Console.WriteLine("these --- " + output[1]);
}
else
{
Console.WriteLine("these --- " + output[0]);
}
if (trie.Contains("their") == true)
{
Console.WriteLine("their --- " + output[1]);
}
else
{
Console.WriteLine("their --- " + output[0]);
}
if (trie.Contains("thaw") == true)
{
Console.WriteLine("thaw --- " + output[1]);
}
else
{
Console.WriteLine("thaw --- " + output[0]);
}
if (trie.Contains("thei") == true)
{
Console.WriteLine("thei --- " + output[1]);
}
else
{
Console.WriteLine("thei --- " + output[0]);
}
if (trie.Contains("thei", true) == true)
{
Console.WriteLine("thei (full word search) --- " + output[1]);
}
else
{
Console.WriteLine("thei (full word search) --- " + output[0]);
}
Console.ReadKey();
}
private static void Main(string[] args)
{
AppDomain.CurrentDomain.AssemblyResolve += OnAssemblyResolve;
Stream stream =
Assembly.GetExecutingAssembly().GetManifestResourceStream("DataStructures.Resources.words.txt");
if (stream == null)
{
throw new Exception("Could not read words.txt");
}
var words = new List <string>();
var stopWatch = new Stopwatch();
stopWatch.Start();
int notFoundWords = 0;
long totalBytesUsedStart = GC.GetTotalMemory(true);
using (var reader = new StreamReader(stream))
{
while (!reader.EndOfStream)
{
var word = reader.ReadLine();
trie.Add(word);
}
stream.Position = 0;
stream.Seek(0, SeekOrigin.Begin);
while (!reader.EndOfStream)
{
var word = reader.ReadLine();
var exists = trie.Contains(word, out words);
if (!exists)
{
notFoundWords++;
Console.WriteLine("Trie does not contain word {0}", word);
}
}
}
stopWatch.Stop();
long totalBytesUsedEnd = GC.GetTotalMemory(true);
Console.WriteLine("Trie has {0} words (not found {1}). Took {2}", trie.TotalWords, notFoundWords, stopWatch.Elapsed);
Console.WriteLine("Before trie loaded {0} KB ; After {1} MB", totalBytesUsedStart / 1024, totalBytesUsedEnd / (1024 * 1024));
//trie.PrintWords();
var sw = new Stopwatch();
while (true)
{
Console.Write("Type your word: ");
var c = Console.ReadLine();
sw.Restart();
trie.Contains(c, out words);
sw.Stop();
Console.WriteLine("{0} matching words found in {1}ms :", words.Count, sw.Elapsed.TotalMilliseconds);
foreach (var word in words)
{
Console.WriteLine(word);
}
}
Console.WriteLine("Press a key to exit");
Console.ReadLine();
}