pub(crate) struct PairKern1<'a> {
pair_sets: Offsets<'a>,
pair_set_digests: Box<[SetDigest]>,
}Expand description
Kerning by glyph pairs: pair adjustment format 1 whose records hold only an advance for the first glyph.
Fields§
§pair_sets: Offsets<'a>§pair_set_digests: Box<[SetDigest]>The second glyphs of each pair set.
Implementations§
Trait Implementations§
Source§impl<'a> SubtableDigests<'a> for PairKern1<'a>
impl<'a> SubtableDigests<'a> for PairKern1<'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 PairKern1<'a>
impl<'a> RefUnwindSafe for PairKern1<'a>
impl<'a> Send for PairKern1<'a>
impl<'a> Sync for PairKern1<'a>
impl<'a> Unpin for PairKern1<'a>
impl<'a> UnsafeUnpin for PairKern1<'a>
impl<'a> UnwindSafe for PairKern1<'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