Function regex_automata::hybrid::dfa::minimum_lazy_state_id

fn minimum_lazy_state_id(
    classes: &ByteClasses,
) -> Result<LazyStateID, LazyStateIDError>

Based on the minimum number of states required for a useful lazy DFA cache, this returns the minimum lazy state ID that must be representable.

It’s not likely for this to have any impact 32-bit systems (or higher), but on 16-bit systems, the lazy state ID space is quite constrained and thus may be insufficient if our MIN_STATES value is (for some reason) too high.