void TrieSTStart()
{
string[] strs = txt.text.Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
// build symbol table from standard input
TrieST <int> st = new TrieST <int>();
for (int i = 0; i < strs.Length; i++)
{
string key = strs[i];
st.put(key, i);
}
// print results
if (st.size() < 100)
{
string str = "keys(\"\"):";
foreach (string key in st.keys())
{
str += ("\t" + key + " " + st.get(key));
}
print(str);
}
print("longestPrefixOf(\"shellsort\"):");
print(st.longestPrefixOf("shellsort"));
print("longestPrefixOf(\"quicksort\"):");
print(st.longestPrefixOf("quicksort"));
print("keysWithPrefix(\"shor\"):");
foreach (string s in st.keysWithPrefix("shor"))
{
print(s);
}
print("keysThatMatch(\".he.l.\"):");
foreach (string s in st.keysThatMatch(".he.l."))
{
print(s);
}
}
