907         let needle = vec![0, 1, 1, 0];  in bm_skip_reset_bug()  localVariable
909         let searcher = BoyerMooreSearch::new(needle);  in bm_skip_reset_bug()
917         let needle = vec![0, 0];  in bm_backstop_underflow_bug()  localVariable
919         let searcher = BoyerMooreSearch::new(needle);  in bm_backstop_underflow_bug()
927         let needle = vec![91];  in bm_naive_off_by_one_bug()  localVariable
929         let naive_offset = naive_find(&needle, &haystack).unwrap();  in bm_naive_off_by_one_bug()
942         let needle = vec![1, 1, 1, 1, 32, 32, 87];  in bm_memchr_fallback_indexing_bug()  localVariable
944         haystack.extend(needle.clone());  in bm_memchr_fallback_indexing_bug()
946         let searcher = BoyerMooreSearch::new(needle);  in bm_memchr_fallback_indexing_bug()
959         let needle = b"clone_created".to_vec();  in bm_backstop_boundary()  localVariable
961         let searcher = BoyerMooreSearch::new(needle);  in bm_backstop_boundary()
974         let needle = vec![1, 1, 1, 1, 1, 1, 1];  in bm_win_gnu_indexing_bug()  localVariable
977         BoyerMooreSearch::new(needle.clone()).find(haystack);  in bm_win_gnu_indexing_bug()
986     fn naive_find(needle: &[u8], haystack: &[u8]) -> Option<usize> {  in naive_find()
987         assert!(needle.len() <= haystack.len());  in naive_find()
989         for i in 0..(haystack.len() - (needle.len() - 1)) {  in naive_find()
990             if haystack[i] == needle[0]  in naive_find()
991                 && &haystack[i..(i + needle.len())] == needle  in naive_find()
1006             let (needle, haystack) = if pile1.len() < pile2.len() {
1012             let searcher = BoyerMooreSearch::new(needle.clone());
1014                 searcher.find(haystack) == naive_find(&needle, haystack))
1022             let (needle, haystack) = if pile1.len() < pile2.len() {
1028             let bm_searcher = BoyerMooreSearch::new(needle.clone());
1029             let freqy_memchr = FreqyPacked::new(needle);
1036             needle: Vec<u8>
1038             if needle.len() == 0 {
1043             let searcher = BoyerMooreSearch::new(needle.clone());
1045             if haystack.len() >= needle.len() &&
1050             haystack.extend(needle.clone());
1055                 .checked_sub(needle.len())
1057             for i in 0..(needle.len() - 1) {
1092             let needle = &haystack[needle_start..(needle_start + needle_length)];  localVariable
1094             let bm_searcher = BoyerMooreSearch::new(needle.to_vec());
1096             let start = naive_find(&needle, &haystack);
1107         fn qc_bm_finds_first(needle: Vec<u8>) -> TestResult {
1108             if needle.len() == 0 {
1112             let mut haystack = needle.clone();
1113             let searcher = BoyerMooreSearch::new(needle.clone());
1114             haystack.extend(needle);