Searched refs:Teddy (Results 1 - 4 of 4) sorted by relevance
| /third_party/rust/crates/aho-corasick/src/packed/ |
| H A D | api.rs | 5 use crate::packed::teddy::{self, Teddy};
108 Teddy,
144 /// An undocumented method for forcing the use of the Teddy algorithm.
152 self.force = Some(ForceAlgorithm::Teddy); in force_teddy()
159 /// An undocumented method for forcing the use of the Fat Teddy algorithm.
254 // Effectively, we only want to return a searcher if we can use Teddy, in build()
255 // since Teddy is our only fast packed searcher at the moment. in build()
257 // Teddy can support. Thus, the only way to get a Rabin-Karp searcher in build()
260 None | Some(ForceAlgorithm::Teddy) => { in build()
266 (SearchKind::Teddy(tedd in build()
[all...] |
| /third_party/rust/crates/aho-corasick/src/packed/teddy/ |
| H A D | compile.rs | 1 // See the README in this directory for an explanation of the Teddy algorithm.
8 use crate::packed::teddy::Teddy;
10 /// A builder for constructing a Teddy matcher.
12 /// The builder primarily permits fine grained configuration of the Teddy
19 /// slim Teddy is used (8 buckets) and `true` means fat Teddy is used
20 /// (16 buckets). Fat Teddy requires AVX2, so if that CPU feature isn't
21 /// available and Fat Teddy was requested, no matcher will be built.
38 /// Create a new builder for configuring a Teddy matcher.
49 pub fn build(&self, patterns: &Patterns) -> Option<Teddy> { in build()
[all...] |
| H A D | mod.rs | 6 pub use crate::packed::teddy::fallback::Teddy;
8 pub use crate::packed::teddy::runtime::Teddy;
28 pub fn build(&self, _: &Patterns) -> Option<Teddy> { in build()
42 pub struct Teddy(()); structure names
44 impl Teddy { impls
|
| H A D | runtime.rs | 1 // See the README in this directory for an explanation of the Teddy algorithm.
7 // repeated variants of the same thing. Specifically, there are three Teddy
8 // variants: Slim 128-bit Teddy (8 buckets), Slim 256-bit Teddy (8 buckets)
9 // and Fat 256-bit Teddy (16 buckets). For each variant, there are three
20 // verification routine (for slim vs fat Teddy) and the candidate extraction
59 /// The Teddy runtime.
61 /// A Teddy runtime can be used to quickly search for occurrences of one or
66 /// Teddy cannot run on small haystacks below a certain size, which is
70 /// Finally, when callers use a Teddy runtim
75 pub struct Teddy { global() structure names
94 impl Teddy { global() impls
[all...] |
Completed in 3 milliseconds