Builds the bad character table for the Boyer-Moore algorithm. This table stores the last occurrence of each character in the pattern. # Arguments `pat` - The pattern as a slice of characters. # Returns A `HashMap` where the keys are characters from the pattern and the values are their last known positions within the pattern.
(pat: &[char])
source not stored for this graph (policy: none)
no test coverage detected