pub(crate) struct LigatureSubst1<'a> {
seconds: SetDigest,
ligature_sets: Offsets<'a>,
width: u8,
}Expand description
Ligature substitution.
Fields§
§seconds: SetDigestThe second components of all ligatures.
ligature_sets: Offsets<'a>§width: u8Implementations§
Source§impl<'a> LigatureSubst1<'a>
impl<'a> LigatureSubst1<'a>
pub fn new( table: &LigatureSubstFormat1<'a>, budget: &Budget, ) -> Result<Self, Exhausted>
pub fn new_wide( table: &LigatureSubstFormat2<'a>, budget: &Budget, ) -> Result<Self, Exhausted>
fn from_sets( ligature_sets: Offsets<'a>, width: usize, budget: &Budget, ) -> Result<Self, Exhausted>
pub fn apply( &self, ctx: &mut ApplyContext<'_, '_, '_>, index: u32, ) -> Option<()>
pub fn would_apply( &self, ctx: &WouldApplyContext<'_>, coverage: &Coverage<'_>, ) -> bool
Trait Implementations§
Source§impl<'a> IntoKind<'a> for LigatureSubst1<'a>
impl<'a> IntoKind<'a> for LigatureSubst1<'a>
Source§impl<'a> SubtableDigests<'a> for LigatureSubst1<'a>
impl<'a> SubtableDigests<'a> for LigatureSubst1<'a>
Source§const CACHES_COVERAGE: bool = true
const CACHES_COVERAGE: bool = true
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 LigatureSubst1<'a>
impl<'a> RefUnwindSafe for LigatureSubst1<'a>
impl<'a> Send for LigatureSubst1<'a>
impl<'a> Sync for LigatureSubst1<'a>
impl<'a> Unpin for LigatureSubst1<'a>
impl<'a> UnsafeUnpin for LigatureSubst1<'a>
impl<'a> UnwindSafe for LigatureSubst1<'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