Struct ResolvedFontChains 

pub struct ResolvedFontChains {
    pub chains: HashMap<FontChainKeyOrRef, FontFallbackChain>,
}

Resolved font chains ready for use in layout This is the result of resolving font stacks against FcFontCache

Fields

chains: HashMap<FontChainKeyOrRef, FontFallbackChain>

Map from FontChainKeyOrRef to the resolved FontFallbackChain For FontChainKeyOrRef::Ref variants, the FontFallbackChain contains a single-font chain that covers the entire Unicode range.

Implementations

impl ResolvedFontChains

pub fn get(&self, key: &FontChainKeyOrRef) -> Option<&FontFallbackChain>

Get a font chain by its key

pub fn get_by_chain_key(&self, key: &FontChainKey) -> Option<&FontFallbackChain>

Get a font chain by FontChainKey (for system fonts)

pub fn get_for_font_stack( &self, font_stack: &[FontSelector], ) -> Option<&FontFallbackChain>

Get a font chain for a font stack (via fontconfig)

pub fn get_for_font_ref(&self, ptr: usize) -> Option<&FontFallbackChain>

Get a font chain for a FontRef pointer

pub fn into_inner(self) -> HashMap<FontChainKeyOrRef, FontFallbackChain>

Consume self and return the inner HashMap with FontChainKeyOrRef keys

This is useful when you need access to both Chain and Ref variants.

pub fn into_fontconfig_chains(self) -> HashMap<FontChainKey, FontFallbackChain>

Consume self and return only the fontconfig-resolved chains

This filters out FontRef entries and returns only the chains resolved via fontconfig. This is what FontManager expects.

pub fn len(&self) -> usize

Get the number of resolved chains

pub fn is_empty(&self) -> bool

Check if there are no resolved chains

pub fn font_refs_len(&self) -> usize

Get the number of direct FontRefs

Trait Implementations

impl Clone for ResolvedFontChains

fn clone(&self) -> ResolvedFontChains

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ResolvedFontChains

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

Formats the value using the given formatter.