pub struct Sequence { /* private fields */ }Expand description
The automaton for some pieces that have to appear in order.
Implementations§
Source§impl Sequence
impl Sequence
Sourcepub fn new(pieces: &[&[u8]]) -> Option<Self>
pub fn new(pieces: &[&[u8]]) -> Option<Self>
The automaton for pieces in this order, or None when there is nothing to find or too much.
Empty pieces are dropped, since finding nothing is always done. With nothing left every string holds the pieces, which is not a question worth a walk, and pieces longer than 254 bytes between them would need more states than a byte counts.
Sourcepub fn needs(&self) -> u64
pub fn needs(&self) -> u64
The sketch bits a string has to have to hold the pieces. A string whose grams lack any
of them does not hold the pieces, and one that has them all may.
Zero when no piece is three bytes long, which every string passes.
Sourcepub fn over<'a>(&'a self, table: &'a SymbolTable) -> Coded<'a>
pub fn over<'a>(&'a self, table: &'a SymbolTable) -> Coded<'a>
A walker over strings compressed against table.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Sequence
impl RefUnwindSafe for Sequence
impl Send for Sequence
impl Sync for Sequence
impl Unpin for Sequence
impl UnsafeUnpin for Sequence
impl UnwindSafe for Sequence
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more