fixup

Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk>

Author: joseph-isaacs

encodings/fsst/src/dfa/flat_contains.rs

@@ -10,7 +10,9 @@
 //!
 //! ## Construction (needle = `"aba"`, symbols = `[0:"ab", 1:"ba"]`)
 //!
-//! ### Step 1: KMP byte-level transition table
+//! ### Step 1: KMP (Knuth–Morris–Pratt) byte-level transition table
+//!
+//! See: https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm
 //!
 //! Build a `(state × byte) → state` table using the KMP failure function.
 //! States 0..2 track match progress, state 3 is accept (sticky).

encodings/fsst/src/dfa/prefix.rs

@@ -72,14 +72,11 @@ impl FlatPrefixDfa {
         let n_states = fail_state + 1;
         let sentinel = fail_state + 1;
 
-        // Step 1: byte-level transitions
         let byte_table = build_prefix_byte_table(prefix, accept_state, fail_state);
 
-        // Step 2: symbol-level transitions
         let sym_trans =
             build_symbol_transitions(symbols, symbol_lengths, &byte_table, n_states, accept_state);
 
-        // Step 3: fused table with escape sentinel
         let transitions = build_fused_table(
             &sym_trans,
             symbols.len(),
@@ -125,7 +122,7 @@ impl FlatPrefixDfa {
     }
 }
 
-/// Build a byte-level transition table for prefix matching (no KMP fallback).
+/// Build a byte-level transition table for prefix matching.
 ///
 /// For each state, only the correct next byte advances; everything else goes
 /// to the fail state.

fuzz/src/fsst_like.rs

@@ -42,9 +42,9 @@ struct SmallAlphabetString {
 impl SmallAlphabetString {
     fn generate(&self, u: &mut Unstructured<'_>) -> arbitrary::Result<String> {
         let len: usize = u.int_in_range(0..=self.max_len)?;
-        Ok((0..len)
-            .map(|_| u.int_in_range(b'a'..=b'h').expect("cannot make char") as char)
-            .collect())
+        (0..len)
+            .map(|_| Ok(u.int_in_range(b'a'..=b'h')? as char))
+            .collect()
     }
 }