The Java language lacks fast string searching algorithms. StringSearch provides implementations of the Boyer-Moore and the Shift-Or (bit-parallel) algorithms. These algorithms are easily five to ten times faster than the naïve implementation found in java.lang.String.
Download StringSearch 2.2 (JAR)
Download StringSearch 2.2 (Source JAR)
Or get StringSearch through Maven:
<dependencies>
<dependency>
<groupId>com.eaio.stringsearch</groupId>
<artifactId>stringsearch</artifactId>
<version>2.2</version>
</dependency>
</dependencies>
…
<repositories>
<repository>
<id>eaio.com</id>
<url>http://repo.eaio.com/maven2</url>
</repository>
</repositories>StringSearch 1.2, which includes a native library and a different selection of algorithms, is still available.
Download StringSearch 1.2 (ZIP)
Download StringSearch 1.2 (TAR.GZ)
This library contains implementations of the following pattern matching algorithms:
- General purpose
- Searching with wildcards (don't-care-symbols)
- Searching with mismatches
- Case-insensitive searching
- Case-insensitive searching with wildcards (don't-care-symbols)
StringSearch is licensed under the MIT License (OSI certified).