Struct GlyphNameIndex 

pub(crate) struct GlyphNameIndex {
    names: Box<[u8]>,
    entries: Box<[(u32, u32, u32)]>,
}

A font’s glyph names, sorted so a name can be found by binary search.

Fields

names: Box<[u8]>

entries: Box<[(u32, u32, u32)]>

Implementations

impl GlyphNameIndex

pub(crate) fn new(font: &Font) -> Self

pub(crate) fn get(&self, name: &str) -> Option<GlyphId>

fn name(&self, entry: &(u32, u32, u32)) -> &[u8]