Construct an AbstractMatcher::Iterator such that Iterator() == AbstractMatcher::Operation(*this, method).end().

Invoked by reflex-generated yyFlexLexer when an error occurs.

Construct matcher engine from an input character sequence.

Default constructor.

Construct a lexer matcher from a matcher's pattern type.

Construct a FlexLexer matcher from a matcher's pattern type.

Construct an empty range.

Construct an AbstractMatcher::Operation functor to scan, search, or split an input character sequence.

constructor

Default constructor.

Default constructor.

Construct an unset pattern.

< pattern class of this matcher, a typedef of the PatternMatcher template parameter Copy constructor, the underlying pattern object is shared (not dee

< pattern class of this matcher Copy constructor, the underlying pattern string is copied.

< accept, not a regex position

Construct an empty range.

< maps lo to hi and state to transition to on char in range [lo,hi]

Default constructor.

Default constructor.

Default constructor.

The matched text length.

The matched text.

constructor

Returns a positive integer (true) indicating the capture index of the matched text in the pattern or zero (false) for a mismatch.

acquire output access

One char

One char followed by some pattern

Default method is none (unset)

Minimal 1 byte long patterns with min=0 or 1 using 4-way bitap hashed pairs and PM

Minimal 2 byte long patterns with min=2 using bitap hashed pairs then PM

Minimal 3 byte long pattern with min=3 using bitap hashed pairs then PM4+PM4

Minimal k byte long patterns (MIN>=k) using bitap hashed pairs and PMk+PMx

My homegrown "needle search" method when needle pin=1 and min=0 or 1 therefore lcp=0

My homegrown "needle search" method when needle pin=1

String

My homegrown improved Boyer-Moore string search, a fallback method

My homegrown improved Boyer-Moore string search followed by minimal 1 byte long patterns, using PM

String followed by 1 to 4 characters