Calculates the shift when a full match occurs in the Boyer-Moore algorithm. It uses the bad character table to determine how much to shift the pattern. # Arguments `shift` - The current shift of the pattern on the text. `pat_len` - The length of the pattern. `text_len` - The length of the text. `bad_char_table` - The bad character table built for the pattern. `text` - The text as a slice of chara
(
shift: isize,
pat_len: isize,
text_len: isize,
bad_char_table: &HashMap<char, isize>,
text: &[char],
)
source not stored for this graph (policy: none)
no test coverage detected