Convert to lower case

Initialize the base abstract matcher at construction.

Returns the number of bits set.

Returns the number of edits made for the match, edits() <= max, not guaranteed to be the minimum edit distance.

Advance pos over '=' and whitespace when present, return true if OK

do we have AVX512BW?

append the second backpatch list to the first list, either one can be NULL

Write lex.yy.cpp

FSM code INIT.

Abort with an error message

Add file extension if not present, modifies the string argument and returns a copy

Set interactive input with buffer size of 1 to read data bytewise which is very slow.

Truncate the AbstractMatcher::text length of the match to n characters in length and reposition for next match.

Returns true if input matched the pattern using method Const::SCAN, Const::FIND, Const::SPLIT, or Const::MATCH.

Append the next match to the currently matched text returned by AbstractMatcher::text, when the next match found is adjacent to the current match.

Returns true when match is predicted using my PM3 logic for min>=1 prior to PM3+PM5.

Check if subpattern is reachable by a match.

Returns the length of the matched text in number of bytes, including pattern-matched `\0`s, a constant-time operation.

Get the size of the input character sequence in number of ASCII/UTF-8 bytes (zero if size is not determinable from a `FILE*` or `std::istream` source)

Display version info

Read one wide character, returns zero when EOF.

Check if this Input object was assigned a character sequence.

The match method Const::SCAN, Const::FIND, Const::SPLIT, or Const::MATCH, implemented with std::regex.

root of the DFA is the first state created or NULL.

FSM code META BWB.

Invoked by ECHO and FlexLexer::output.

Clear and delete pattern data.

Get the number of finite state machine edges (transitions on input characters).

Get elapsed DFA edges construction time.

Returns the position of the first bit set in the bit vector, or Bits::npos if none.

Returns the next position of a bit set in the bit vector, or Bits::npos if none.

do we have SSE2?

Get the number of finite state machine nodes (vertices).

Get elapsed DFA vertices construction time.

Get elapsed regex parsing and analysis time.