Struct MultiSieve 

pub struct MultiSieve<'a> { /* private fields */ }

A multi-pass sieve that supports any number of patterns.

Internally, patterns are partitioned into groups of at most 16 entries so each group can reuse the existing SimdSieve implementation. Candidate offsets from every group are then merged with a k-way merge, preserving ascending order and removing duplicates.

Errors

Returns the same construction errors as SimdSieve::new. In practice, only an empty pattern set can fail because MultiSieve never forwards more than 16 patterns to a single underlying sieve.

Example

use simdsieve::MultiSieve;

let haystack = b"alpha beta gamma delta";
let patterns: &[&[u8]] = &[b"alpha", b"beta", b"gamma", b"delta"];

let matches: Vec<usize> = MultiSieve::new(haystack, patterns)
    .unwrap()
    .candidates()
    .collect();

assert_eq!(matches, vec![0, 6, 11, 17]);

Implementations

impl<'a> MultiSieve<'a>

pub fn new(haystack: &'a [u8], patterns: &[&'a [u8]]) -> Result<Self>

Creates a new exact-match multi-pass sieve.

Patterns are grouped into chunks of 16 so each chunk can be searched by a regular SimdSieve (AVX2 supports up to 16 patterns per filter).

Errors

Returns an error if the pattern set is empty.

pub fn new_case_insensitive( haystack: &'a [u8], patterns: &[&'a [u8]], ) -> Result<Self>

Creates a case-insensitive multi-pass sieve (ASCII a–z only).

Patterns are grouped into chunks of 16 so each chunk can be searched by a regular SimdSieve.

Errors

Returns an error if the pattern set is empty.

pub fn candidates(self) -> impl Iterator<Item = usize> + 'a

Iterates candidate positions from all pattern groups in sorted order.

If multiple groups report the same position, that offset is yielded only once.