Expand description
Fast substring search for strings and byte strings, using the two-way algorithm.
This is the same code as is included in Rust’s libstd that powers
str::find(&str), but here it is exposed with some improvements:
- Available for byte string searches using
&[u8] - Having an optional SSE4.2 accelerated version (if detected at runtime) which is even faster. Runtime detection requires the default std feature.
- Using
memchrfor the single byte case, which is ultra fast.
Functions
find_bytes finds the first ocurrence of pattern in the text.find_str finds the first ocurrence of pattern in the text.rfind_bytes finds the last ocurrence of pattern in the text,
and returns the index of the start of the match.rfind_str finds the last ocurrence of pattern in the text
and returns the index of the start of the match.