Merge branch 'pch'

Author: ParkChangHan

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

@@ -141,4 +141,9 @@ private Set<String> getSuffixes(PatriciaTrie.Node node, String prefix) {
     public String toString() {
         return PatriciaTrie.PatriciaTriePrinter.getString(tree);
     }
+
+    public boolean equals(CompactSuffixTrie<C> trie){
+        if(this.getSuffixes().equals(trie.getSuffixes())) return true;
+        return false;
+    }
 }

test/com/jwetherell/algorithms/data_structures/test/CompactSuffixTrieTests.java

@@ -25,4 +25,26 @@ public void testCompactSuffixTrie() {
         exists = trie.doesSubStringExist(pass);
         assertTrue("YIKES!! " + pass + " doesn't exists.", exists);
     }
+
+    @Test
+    public void testCompactSuffixTrie_equals() {
+        String bookkeeper = "bookkeeper";
+        CompactSuffixTrie<String> trie = new CompactSuffixTrie<String>(bookkeeper);
+
+        String bookkeeper_1 = "bookkeeper";
+        CompactSuffixTrie<String> trie_1 = new CompactSuffixTrie<String>(bookkeeper_1);
+
+        boolean equal = trie.equals(trie_1);
+        assertTrue("YIKES!! " + bookkeeper + " and " + bookkeeper_1 + " are not equal.", equal);
+
+
+        String failed = "failed";
+        trie = new CompactSuffixTrie<String>(failed);
+
+        String failed_1 = "failet";
+        trie_1 = new CompactSuffixTrie<String>(failed_1);
+
+        equal = trie.equals(trie_1);
+        assertFalse("YIKES!! " + failed + " and " + failed_1 + " are equal.", equal);
+    }
 }