Converted Trie and PatriciaTrie to use char instead of Char

git-svn-id: https://java-algorithms-implementation.googlecode.com/svn/trunk@408 032fbc0f-8cab-eb90-e552-f08422b9a96a

Author: phishman3579

src/com/jwetherell/algorithms/data_structures/BTree.java

@@ -587,8 +587,7 @@ private T getKey(int index) {
 
         private int indexOf(T value) {
             for (int i = 0; i < keysSize; i++) {
-                if (keys[i].equals(value))
-                    return i;
+                if (keys[i].equals(value)) return i;
             }
             return -1;
         }

src/com/jwetherell/algorithms/data_structures/CompactSuffixTrie.java

@@ -60,10 +60,10 @@ public boolean add(C sequence) {
     public boolean doesSubStringExist(C sequence) {
         char[] chars = sequence.toString().toCharArray();
         int length = chars.length;
-        PatriciaTrie.Node<C> current = tree.root;
+        PatriciaTrie.Node current = tree.root;
         int index = 0;
         for (int i = 0; i < length; i++) {
-            int innerStringLength = (current.string != null) ? current.string.length() : 0;
+            int innerStringLength = (current.string != null) ? current.string.length : 0;
             char c = chars[i];
             if (innerStringLength > index) {
                 boolean inThis = current.partOfThis(c, index++);
@@ -96,7 +96,7 @@ public Set<String> getSuffixes() {
      *            to get all suffixes at.
      * @return set of suffixes in trie at node.
      */
-    private Set<String> getSuffixes(PatriciaTrie.Node<C> node) {
+    private Set<String> getSuffixes(PatriciaTrie.Node node) {
         StringBuilder builder = new StringBuilder();
         if (node.string != null)
             builder.append(node.string);
@@ -105,7 +105,7 @@ private Set<String> getSuffixes(PatriciaTrie.Node<C> node) {
             set.add(builder.toString());
         }
         for (int i = 0; i < node.getChildrenSize(); i++) {
-            PatriciaTrie.Node<C> c = node.getChild(i);
+            PatriciaTrie.Node c = node.getChild(i);
             set.addAll(getSuffixes(c, builder.toString()));
         }
         return set;
@@ -120,7 +120,7 @@ private Set<String> getSuffixes(PatriciaTrie.Node<C> node) {
      *            to prepend to suffixes.
      * @return set of suffixes in trie at node.
      */
-    private Set<String> getSuffixes(PatriciaTrie.Node<C> node, String prefix) {
+    private Set<String> getSuffixes(PatriciaTrie.Node node, String prefix) {
         StringBuilder builder = new StringBuilder(prefix);
         if (node.string != null)
             builder.append(node.string);
@@ -129,7 +129,7 @@ private Set<String> getSuffixes(PatriciaTrie.Node<C> node, String prefix) {
             set.add(builder.toString());
         }
         for (int i = 0; i < node.getChildrenSize(); i++) {
-            PatriciaTrie.Node<C> c = node.getChild(i);
+            PatriciaTrie.Node c = node.getChild(i);
             set.addAll(getSuffixes(c, builder.toString()));
         }
         return set;