Performs the Boyer-Moore string search algorithm, which searches for all occurrences of a pattern within a text. The Boyer-Moore algorithm is efficient for large texts and patterns, as it skips sections of the text based on the bad character rule and other optimizations. # Arguments `text` - The text to search within as a string slice. `pat` - The pattern to search for as a string slice. # Retu
(text: &str, pat: &str)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected