Boyer–Moore string search is faster but not the same semantics

1 files changed, 32 insertions, 0 deletions

diff --git a/src/test/java/org/javacs/StringSearchTest.java b/src/test/java/org/javacs/StringSearchTest.java
new file mode 100644
index 0000000..7827fcd
--- /dev/null
+++ b/src/test/java/org/javacs/StringSearchTest.java
@@ -0,0 +1,32 @@
+package org.javacs;
+
+import static org.hamcrest.Matchers.*;
+import static org.junit.Assert.*;
+
+import org.junit.Test;
+
+public class StringSearchTest {
+    private void testNext(String pat, String text, int index) {
+        var got = new StringSearch(pat).next(text);
+        assertThat(got, equalTo(index));
+    }
+
+    @Test
+    public void testFinderNext() {
+        testNext("", "", 0);
+        testNext("", "abc", 0);
+        testNext("abc", "", -1);
+        testNext("abc", "abc", 0);
+        testNext("d", "abcdefg", 3);
+        testNext("nan", "banana", 2);
+        testNext("pan", "anpanman", 2);
+        testNext("nnaaman", "anpanmanam", -1);
+        testNext("abcd", "abc", -1);
+        testNext("abcd", "bcd", -1);
+        testNext("bcd", "abcd", 1);
+        testNext("abc", "acca", -1);
+        testNext("aa", "aaa", 0);
+        testNext("baa", "aaaaa", -1);
+        testNext("at that", "which finally halts.  at that point", 22);
+    }
+}