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.

Based on implementation by Johann Burkard

Download

Maven:

	<dependencies>
		<dependency>
			<groupId>com.elefana</groupId>
			<artifactId>stringsearch</artifactId>
			<version>2.2</version>
		</dependency>
	</dependencies>

Gradle:

	compile "com.elefana:stringsearch:2.2.0"

Documentation

This library contains implementations of the following pattern matching algorithms:

• General purpose
  • BNDM
  • BoyerMooreHorspool
  • BoyerMooreHorspoolRaita
• 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).

Other Resources

• StringSearch on johannburkard.de
• Maven-generated Site
• APIdoc