Computes the suffix table used for the KMP (Knuth-Morris-Pratt) string matching algorithm. # Arguments `chars` - A slice of characters for which the suffix table is computed. # Returns Returns a vector of `usize` representing the suffix table. Each element at index `i` indicates the longest proper suffix which is also a proper prefix of the substring `chars[0..=i]`.
(chars: &[char])
source not stored for this graph (policy: none)
no test coverage detected