pub(crate) struct PairPos2<'a> {
class_def1: ClassDef<'a>,
class_def2: ClassDef<'a>,
caches: Option<Box<PairPos2Caches>>,
records: ClassValueRecords<'a>,
}Expand description
Pair adjustment by glyph classes.
Fields§
§class_def1: ClassDef<'a>§class_def2: ClassDef<'a>§caches: Option<Box<PairPos2Caches>>§records: ClassValueRecords<'a>The matrix of value records, by first and second class.
Implementations§
Source§impl<'a> PairPos2<'a>
impl<'a> PairPos2<'a>
pub fn new( pairs: &ClassPairs<'a>, with_caches: bool, budget: &Budget, ) -> Result<Option<Self>, Exhausted>
Sourcepub fn apply(
&self,
ctx: &mut ApplyContext<'_, '_, '_>,
_index: u32,
second: &mut SecondGlyph,
) -> Option<()>
pub fn apply( &self, ctx: &mut ApplyContext<'_, '_, '_>, _index: u32, second: &mut SecondGlyph, ) -> Option<()>
Applies, sharing the search for the second glyph with the lookup’s other subtables.
Trait Implementations§
Source§impl<'a> SubtableDigests<'a> for PairPos2<'a>
impl<'a> SubtableDigests<'a> for PairPos2<'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 PairPos2<'a>
impl<'a> RefUnwindSafe for PairPos2<'a>
impl<'a> Send for PairPos2<'a>
impl<'a> Sync for PairPos2<'a>
impl<'a> Unpin for PairPos2<'a>
impl<'a> UnsafeUnpin for PairPos2<'a>
impl<'a> UnwindSafe for PairPos2<'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