Expand description
Generic crate-internal routines for the “packed pair” SIMD algorithm.
The “packed pair” algorithm is based on the generic SIMD algorithm. The main difference is that it (by default) uses a background distribution of byte frequencies to heuristically select the pair of bytes to search for.
Structs§
- Finder 🔒
- A generic architecture dependent “packed pair” finder.
Functions§
- matched 🔒 ⚠
- Accepts a chunk-relative offset and returns a haystack relative offset.