88             Bytes(ref sset) => sset.find(haystack).map(|i| (i, i + 1)),  in find()
130             Matcher::Bytes(ref sset) => LiteralIter::Bytes(&sset.dense),  in iter()
158             Bytes(ref sset) => sset.dense.len(),  in len()
171             Bytes(ref sset) => sset.approximate_size(),  in approximate_size()
182         let sset = SingleByteSet::prefixes(lits);  in prefixes()  localVariable
183         Matcher::new(lits, sset)  in prefixes()
187         let sset = SingleByteSet::suffixes(lits);  in suffixes()  localVariable
188         Matcher::new(lits, sset)  in suffixes()
191     fn new(lits: &Literals, sset: SingleByteSet) -> Self {  in new()
195         if sset.dense.len() >= 26 {  in new()
204         if sset.complete {  in new()
205             return Matcher::Bytes(sset);  in new()
217         let is_aho_corasick_fast = sset.dense.len() <= 1 && sset.all_ascii;  in new()
309         let mut sset = SingleByteSet::new();  in prefixes()  localVariable
311             sset.complete = sset.complete && lit.len() == 1;  in prefixes()
313                 if !sset.sparse[b as usize] {  in prefixes()
315                         sset.all_ascii = false;  in prefixes()
317                     sset.dense.push(b);  in prefixes()
318                     sset.sparse[b as usize] = true;  in prefixes()
322         sset  in prefixes()
326         let mut sset = SingleByteSet::new();  in suffixes()  localVariable
328             sset.complete = sset.complete && lit.len() == 1;  in suffixes()
330                 if !sset.sparse[b as usize] {  in suffixes()
332                         sset.all_ascii = false;  in suffixes()
334                     sset.dense.push(b);  in suffixes()
335                     sset.sparse[b as usize] = true;  in suffixes()
339         sset  in suffixes()