Skip to main content

PairKern2

Struct PairKern2 

Source
pub(crate) struct PairKern2<'a> {
    class_def1: ClassDef<'a>,
    class_def2: ClassDef<'a>,
    caches: Option<Box<PairPos2Caches>>,
    matrix: &'a [BigEndian<i16>],
    class1_count: u16,
    class2_count: u16,
}
Expand description

Kerning by glyph classes: class pair adjustment whose matrix holds only an advance for the first glyph.

Fields§

§class_def1: ClassDef<'a>§class_def2: ClassDef<'a>§caches: Option<Box<PairPos2Caches>>§matrix: &'a [BigEndian<i16>]

The kern of each first class and second class.

§class1_count: u16§class2_count: u16

Implementations§

Source§

impl<'a> PairKern2<'a>

Source

pub fn new( pairs: &ClassPairs<'a>, with_caches: bool, budget: &Budget, ) -> Result<Option<Self>, Exhausted>

Returns None unless the subtable holds only kerning, in a matrix that can be read.

Source

pub fn apply( &self, ctx: &mut ApplyContext<'_, '_, '_>, _index: u32, second: &mut SecondGlyph, ) -> Option<()>

Trait Implementations§

Source§

impl<'a> IntoKind<'a> for PairKern2<'a>

Source§

impl<'a> SubtableDigests<'a> for PairKern2<'a>

Source§

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>

The glyphs that may follow the first one in a match.
Source§

fn cache_cost(&self) -> u32

How much the subtable gains from the glyph-info class cache.

Auto Trait Implementations§

§

impl<'a> Freeze for PairKern2<'a>

§

impl<'a> RefUnwindSafe for PairKern2<'a>

§

impl<'a> Send for PairKern2<'a>

§

impl<'a> Sync for PairKern2<'a>

§

impl<'a> Unpin for PairKern2<'a>

§

impl<'a> UnsafeUnpin for PairKern2<'a>

§

impl<'a> UnwindSafe for PairKern2<'a>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.