Package com.jaxfront.core.util.stringSearch

Implementations of high-performance String searching algorithms.

See:
          Description

Class Summary
BNDM An implementation of the Backwards Non-deterministic Dawg (Directed acyclic word graph) Matching algorithm by Gonzalo Navarro and Mathieu Raffinot.
BNDMWildcards An implementation of the BNDM algorithm with wildcards ("don't care" symbols).
BoyerMooreHorspool An implementation of Horspool's improved version of the Boyer-Moore String searching algorithm.
BoyerMooreHorspoolRaita An implementation of Raita's enhancement to the Boyer-Moore-Horspool String searching algorithm.
BoyerMooreSunday An implementation of Sunday's simplified "Quick Finder" version of the Boyer-Moore algorithm.
CharIntMap The CharIntMap is a collection to save char to int mappings in.
MismatchSearch Subclasses of MismatchSearch allow for searching with a fixed number of possible errors.
ShiftOr An implementation of the Shift-Or algorithm by Ricardo Baeza-Yates and Gaston Gonnet as outlined in "A New Approach to Text Searching" (appeared in Proceedings of the 12th International Conference on Research and Development in Datum Retrieval).
ShiftOrClasses An implementation of the Shift-Or algorithm that supports character classes.
ShiftOrMismatches An implementation of the Shift-Or algorithm with mismatches.
ShiftOrWildcards An implementation of the Shift-Or algorithm with wildcards ("don't care" symbols).
StringCutter  
StringSearch The base class for String searching implementations.
 

Package com.jaxfront.core.util.stringSearch Description

Implementations of high-performance String searching algorithms. Includes several algorithms of the Boyer-Moore family and the Shift-Or algorithm which allows for searching with "don't care" symbols.

Algorithms overview: