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
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.
Documentation
This library contains implementations of the following pattern matching algorithms:
- General purpose
BNDM
BoyerMooreHorspool
(fastest for searching inbyte
arrays)BoyerMooreHorspoolRaita
(fastest for searching inchar
arrays and Strings)
- Searching with wildcards (don’t-care-symbols)
- Searching with mismatches
- Case-insensitive searching
- Case-insensitive searching with wildcards (don’t-care-symbols)
License
StringSearch is licensed under the MIT License (OSI certified).
Other resources
Subscribe
RSS 2.0, Atom or subscribe by Email.
Top Posts
- DynaCloud - a dynamic JavaScript tag/keyword cloud with jQuery
- 6 fast jQuery Tips: More basic Snippets
- xslt.js version 3.2 released
- xslt.js version 3.0 released XML XSLT now with jQuery plugin
- Forum Scanners - prevent forum abuse
- Automate JavaScript compression with YUI Compressor and /packer/