mindol1004/spring-boot-rest
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[BAEL-3480] - Java Fast pattern matching using trie and suffix tree

Browse Source
This commit is contained in:
macroscopic64
2020-02-23 20:55:32 +05:30
parent aa09538395
commit ee114c8a17
2 changed files with 13 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
algorithms-searching/src/test/java/com/baeldung/algorithms/suffixtree/SuffixTreeUnitTest.java
View File

@@ -16,8 +16,7 @@ public class SuffixTreeUnitTest {
@BeforeClass
public static void setUp() {
suffixTree = new SuffixTree();
suffixTree.addText("bananabanana");
suffixTree = new SuffixTree("havanabanana");
printTree();
}
@@ -26,7 +25,7 @@ public class SuffixTreeUnitTest {
List<String> matches = suffixTree.searchText("a");
matches.stream()
.forEach(m -> LOGGER.info(m));
Assert.assertArrayEquals(new String[] { "b[a]nanabanana", "ban[a]nabanana", "banan[a]banana", "bananab[a]nana", "bananaban[a]na", "bananabanan[a]" }, matches.toArray());
Assert.assertArrayEquals(new String[] { "h[a]vanabanana", "hav[a]nabanana", "havan[a]banana", "havanab[a]nana", "havanaban[a]na", "havanabanan[a]" }, matches.toArray());
}
@Test
@@ -34,7 +33,7 @@ public class SuffixTreeUnitTest {
List<String> matches = suffixTree.searchText("nab");
matches.stream()
.forEach(m -> LOGGER.info(m));
Assert.assertArrayEquals(new String[] { "bana[nab]anana" }, matches.toArray());
Assert.assertArrayEquals(new String[] { "hava[nab]anana" }, matches.toArray());
}
@Test
@@ -47,10 +46,10 @@ public class SuffixTreeUnitTest {
@Test
public void givenSuffixTree_whenSearchingForBanana_thenReturn2Matches() {
List<String> matches = suffixTree.searchText("banana");
List<String> matches = suffixTree.searchText("ana");
matches.stream()
.forEach(m -> LOGGER.info(m));
Assert.assertArrayEquals(new String[] { "[banana]banana", "banana[banana]" }, matches.toArray());
Assert.assertArrayEquals(new String[] { "hav[ana]banana", "havanab[ana]na", "havanaban[ana]" }, matches.toArray());
}
@Test
@@ -58,7 +57,7 @@ public class SuffixTreeUnitTest {
List<String> matches = suffixTree.searchText("na");
matches.stream()
.forEach(m -> LOGGER.info(m));
Assert.assertArrayEquals(new String[] { "ba[na]nabanana", "bana[na]banana", "bananaba[na]na", "bananabana[na]" }, matches.toArray());
Assert.assertArrayEquals(new String[] { "hava[na]banana", "havanaba[na]na", "havanabana[na]" }, matches.toArray());
}
@Test