StringSearch

High-performance pattern matching algorithms in Java

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

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

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)

Documentation

This library contains implementations of the following pattern matching algorithms:

General purpose
Searching with wildcards (don't-care-symbols)
- BNDMWildcards
Searching with mismatches
- ShiftOrMismatches
Case-insensitive searching
- BNDMCI
Case-insensitive searching with wildcards (don't-care-symbols)
- BNDMWildcardsCI

License

StringSearch is licensed under the MIT License (OSI certified).

kryton/StringSearch