Returns a lightweight pattern matcher, good for short patterns and/or short to medium length content. Brute-force approach with fast multi-byte comparisons
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.
Convenient bundle of lightweight find utilities, without the hassle of IFTI problems. Create one of these using the find() function:
Convenient bundle of welterweight search utilities, without the hassle of IFTI problems. Create one of these using the search() function: