pub(crate) struct ReverseChainSubst1<'a> {
substitutes: Uints<'a>,
backtrack: CoverageArray<'a>,
lookahead: CoverageArray<'a>,
}Expand description
Reverse chaining single substitution.
Fields§
§substitutes: Uints<'a>§backtrack: CoverageArray<'a>The backtrack coverages, None where one can’t be read.
lookahead: CoverageArray<'a>Implementations§
Source§impl<'a> ReverseChainSubst1<'a>
impl<'a> ReverseChainSubst1<'a>
pub fn new( table: &ReverseChainSingleSubstFormat1<'a>, budget: &Budget, ) -> Result<Option<Self>, Exhausted>
pub fn new_wide( table: &ReverseChainSingleSubstFormat2<'a>, budget: &Budget, ) -> Result<Option<Self>, Exhausted>
pub fn apply( &self, ctx: &mut ApplyContext<'_, '_, '_>, index: u32, ) -> Option<()>
Trait Implementations§
Source§impl<'a> IntoKind<'a> for ReverseChainSubst1<'a>
impl<'a> IntoKind<'a> for ReverseChainSubst1<'a>
Source§impl<'a> SubtableDigests<'a> for ReverseChainSubst1<'a>
impl<'a> SubtableDigests<'a> for ReverseChainSubst1<'a>
Source§const CACHES_COVERAGE: bool = false
const CACHES_COVERAGE: bool = false
Whether looking up the first glyph’s coverage gains from a cache.
Source§fn digest_second(&self, _budget: &Budget) -> Result<SetDigest, Exhausted>
fn digest_second(&self, _budget: &Budget) -> Result<SetDigest, Exhausted>
The glyphs that may follow the first one in a match.
Source§fn cache_cost(&self) -> u32
fn cache_cost(&self) -> u32
How much the subtable gains from the glyph-info class cache.
Auto Trait Implementations§
impl<'a> Freeze for ReverseChainSubst1<'a>
impl<'a> RefUnwindSafe for ReverseChainSubst1<'a>
impl<'a> Send for ReverseChainSubst1<'a>
impl<'a> Sync for ReverseChainSubst1<'a>
impl<'a> Unpin for ReverseChainSubst1<'a>
impl<'a> UnsafeUnpin for ReverseChainSubst1<'a>
impl<'a> UnwindSafe for ReverseChainSubst1<'a>
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