added another code example

[feisty_meow.git] / kona / src / org / feistymeow / textual / SimpleDictionary.java

diff --git a/kona/src/org/feistymeow/textual/SimpleDictionary.java b/kona/src/org/feistymeow/textual/SimpleDictionary.java
index 6d71f9b83c16e202b6b5486e562f43f51e4495c9..9008ac97246456d40fe852aa4b9e4b76cdca4d04 100644 (file)
--- a/kona/src/org/feistymeow/textual/SimpleDictionary.java
+++ b/kona/src/org/feistymeow/textual/SimpleDictionary.java
@@ -4,39 +4,46 @@ import java.util.HashSet;
 import java.util.Set;
 
 public class SimpleDictionary extends HashSet<String>
-//or alternatively, BinaryTree<String>
-//=> what is BST implem for java!  is it balanced?
+// or alternatively, BinaryTree<String>
+// => what is BST implem for java! is it balanced?
 {
-  public SimpleDictionary (Set<String> words) {
-    addAll(words);
-    computeLongestWord();
-  }
-  
-  public SimpleDictionary (String words[]) {
-       for (String word : words) {
-               add(word);
+
+       private static final long serialVersionUID = 1L;
+
+       public SimpleDictionary(Set<String> words)
+       {
+               addAll(words);
+               computeLongestWord();
        }
-    computeLongestWord();
-  }
-
-  public int computeLongestWord() {
-    previouslyComputedLongestWord = 1;
-    
-    //hmmm: iterate on set to find longest.
-    
-//kludge implem placeholder.
-previouslyComputedLongestWord = 100;
-       return previouslyComputedLongestWord;
-  }
-  
-  public boolean lookup(String toFind) {
-    return contains(toFind);
-  }
-
-  public int longestWord() {
-    return previouslyComputedLongestWord;
-  }
-
-  int previouslyComputedLongestWord;
-}
 
+       public SimpleDictionary(String words[])
+       {
+               for (String word : words) {
+                       add(word);
+               }
+               computeLongestWord();
+       }
+
+       public int computeLongestWord()
+       {
+               previouslyComputedLongestWord = 1;
+
+               // hmmm: iterate on set to find longest.
+
+               // kludge implem placeholder.
+               previouslyComputedLongestWord = 100;
+               return previouslyComputedLongestWord;
+       }
+
+       public boolean lookup(String toFind)
+       {
+               return contains(toFind);
+       }
+
+       public int longestWord()
+       {
+               return previouslyComputedLongestWord;
+       }
+
+       int previouslyComputedLongestWord;
+}