Returns a welterweight pattern matcher, good for long patterns and/or extensive content. Based on the QS algorithm which is a Boyer-Moore variant. Does not allocate memory for the alphabet.
Generally becomes faster as the match-length grows
See Implementation
Returns a welterweight pattern matcher, good for long patterns and/or extensive content. Based on the QS algorithm which is a Boyer-Moore variant. Does not allocate memory for the alphabet.
Generally becomes faster as the match-length grows