Struct cosmic_text::CacheKey

pub struct CacheKey {
    pub font_id: ID,
    pub glyph_id: u16,
    pub font_size: i32,
    pub x_bin: SubpixelBin,
    pub y_bin: SubpixelBin,
}

Key for building a glyph cache

Fields

font_id: ID

Font ID

glyph_id: u16

Glyph ID

font_size: i32

Font size in pixels

x_bin: SubpixelBin

Binning of fractional X offset

y_bin: SubpixelBin

Binning of fractional Y offset

Implementations

impl CacheKey

pub fn new(
    font_id: ID,
    glyph_id: u16,
    font_size: i32,
    pos: (f32, f32)
) -> (Self, i32, i32)

Examples found in repository

src/shape.rs (lines 254-259)

    fn layout(&self, font_size: i32, x: f32, y: f32, level: unicode_bidi::Level) -> LayoutGlyph {
        let x_offset = font_size as f32 * self.x_offset;
        let y_offset = font_size as f32 * self.y_offset;
        let x_advance = font_size as f32 * self.x_advance;

        let (cache_key, x_int, y_int) = CacheKey::new(
            self.font_id,
            self.glyph_id,
            font_size,
            (x + x_offset, y - y_offset)
        );
        LayoutGlyph {
            start: self.start,
            end: self.end,
            x,
            w: x_advance,
            level,
            cache_key,
            x_offset,
            y_offset,
            x_int,
            y_int,
            color_opt: self.color_opt,
            metadata: self.metadata,
        }
    }

Trait Implementations

impl Clone for CacheKey

fn clone(&self) -> CacheKey

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CacheKey

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for CacheKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for CacheKey

fn cmp(&self, other: &CacheKey) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<CacheKey> for CacheKey

fn eq(&self, other: &CacheKey) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd<CacheKey> for CacheKey

fn partial_cmp(&self, other: &CacheKey) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for CacheKey

impl Eq for CacheKey

impl StructuralEq for CacheKey

impl StructuralPartialEq for CacheKey