Struct ClosureCtx

pub(super) struct ClosureCtx<'a> {
    glyphs: &'a mut IntSet<GlyphId>,
    active_glyphs_stack: Vec<IntSet<GlyphId>>,
    output: IntSet<GlyphId>,
    lookup_count: u16,
    nesting_level_left: u8,
    done_lookups_glyphs: HashMap<u16, (u64, IntSet<GlyphId>)>,
}

Fields

glyphs: &'a mut IntSet<GlyphId>

the current closure glyphs. This is updated as we go.

active_glyphs_stack: Vec<IntSet<GlyphId>>

output: IntSet<GlyphId>

lookup_count: u16

nesting_level_left: u8

done_lookups_glyphs: HashMap<u16, (u64, IntSet<GlyphId>)>

Implementations

impl<'a> ClosureCtx<'a>

pub(super) fn new(glyphs: &'a mut IntSet<GlyphId>) -> Self

pub(super) fn lookup_limit_exceed(&self) -> bool

pub(super) fn parent_active_glyphs(&self) -> &IntSet<GlyphId>

pub(super) fn push_cur_active_glyphs(&mut self, glyphs: IntSet<GlyphId>)

pub(super) fn pop_cur_done_glyphs(&mut self)

pub(super) fn recurse( &mut self, lookup_list: &SubstitutionLookupList<'_>, lookup: &SubstitutionLookup<'_>, lookup_index: u16, glyphs: IntSet<GlyphId>, ) -> Result<(), ReadError>

pub(super) fn reset_lookup_visit_count(&mut self)

pub(super) fn should_visit_lookup(&mut self, lookup_index: u16) -> bool

pub(super) fn is_lookup_done(&mut self, lookup_index: u16) -> bool

pub(super) fn glyphs(&self) -> &IntSet<GlyphId>

pub(super) fn add(&mut self, gid: GlyphId)

pub(super) fn add_glyphs(&mut self, iter: impl IntoIterator<Item = GlyphId>)

pub(super) fn flush(&mut self)