Lines Matching refs:regex
304 /// regex's implementation of substring search.
306 /// regex is where the concept of using heuristics based on an a priori
307 /// assumption of byte frequency originated. Eventually, regex will just use the
309 /// regex tends to have higher latency. It would be good to measure that.
311 /// For regex, we don't provide oneshots, since that requires compiling the
312 /// regex which we know is going to be ridiculously slow. No real need to
314 pub(crate) mod regex {
321 unimplemented!("regex does not support oneshot searches")
327 let finder = regex::Regex::new(®ex::escape(needle)).unwrap();
336 unimplemented!("regex does not support oneshot searches")
341 PrebuiltIter(regex::Regex::new(®ex::escape(needle)).unwrap())
345 pub(crate) struct PrebuiltIter(regex::Regex);
359 unimplemented!("regex does not support reverse searches")
365 |_| unimplemented!("regex does not support reverse searches")
373 unimplemented!("regex does not support reverse searches")
378 unimplemented!("regex does not support reverse searches")
532 /// but also from regex's original idea to use heuristics based on an a priori