Ternary Search Tree Dictionary in C#: Faster String Dictionary!

// Ternary Search Tree Implementation for C# 
// 
// Copyright (c) 2004 Jonathan de Halleux
//
// This software is provided 'as-is', without any express or implied warranty. 
// 
// In no event will the authors be held liable for any damages arising from 
// the use of this software.
// Permission is granted to anyone to use this software for any purpose, 
// including commercial applications, and to alter it and redistribute it 
// freely, subject to the following restrictions:
//
//		1. The origin of this software must not be misrepresented; 
//		you must not claim that you wrote the original software. 
//		If you use this software in a product, an acknowledgment in the product 
//		documentation would be appreciated but is not required.
//
//		2. Altered source versions must be plainly marked as such, and must 
//		not be misrepresented as being the original software.
//
//		3. This notice may not be removed or altered from any source 
//		distribution.
//	
//	Ternary Search Tree Implementation for C# Library HomePage: 
//		http://www.dotnetwiki.org
//	Author: Jonathan de Halleux
//  Algorithm found in J. L. Bentley and R. Sedgewick, 
//      Fast algorithms for sorting and searching strings, 
//      in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 
//      New Orleans Louisiana, January 5-7, 
//      1997  

using System;

namespace Tst.Utility
{
	///<summary></summary>
	public sealed class TstUtility
	{
		private TstUtility()
		{}

		///<summary></summary>
		public static void Trace(TstDictionary dic, string fileName)
		{
			if (dic==null)
				throw new ArgumentNullException("dic");

			QuickGraphTraverserVisitor vis = new QuickGraphTraverserVisitor();
			TstTraverser trav = new TstTraverser();

			trav.TreeEntry += new TstDictionaryEntryEventHandler(vis.TreeEntry);
			trav.LowChild += new TstDictionaryEntryEventHandler(vis.LowChild);
			trav.EqChild += new TstDictionaryEntryEventHandler(vis.EqChild);
			trav.HighChild += new TstDictionaryEntryEventHandler(vis.HighChild);
			trav.Traverse(dic);

			vis.Render(fileName);
		}
	}
}