pub fn prepare(&mut self, glyphs: &'a [Glyph], stripped: bool) {
        // Assign the first node with all possible glyph indices.
        self.tree.glyphs = glyphs.iter().collect::<_>();
        // recurse from the first index and build out the tree.
        recurse_glyph_matching(&mut self.tree, &glyphs, 0, stripped);
    }
/// Prepare the glyph matcher from a set of glyphs.
/// If stripped is true, lstrip_hist is used.
/// If minimal is true, the decision graph is cut short if only one glyph remains.
Prepare the glyph matcher from a set of glyphs.
If stripped is true, lstrip_hist is used.
If minimal is true, the decision graph is cut short if only one glyph remains.
Prepare the glyph matcher from a set of glyphs . If stripped is true lstrip_hist is used . If minimal is true the decision graph is cut short if only one glyph remains .
pub fn prepare(&mut self, glyphs: &'a [Glyph], stripped: bool) {
        // Assign the first node with all possible glyph indices.
        self.tree.glyphs = glyphs.iter().collect::<_>();
        // recurse from the first index and build out the tree.
        recurse_glyph_matching(&mut self.tree, &glyphs, 0, stripped);
    }
pub fn prepare ( & mut self , glyphs : & ' a [ Glyph ] , stripped : bool ) { // Assign the first node with all possible glyph indices. self . tree . glyphs = glyphs . iter ( ) . collect :: < _ > ( ) ; // recurse from the first index and build out the tree. recurse_glyph_matching ( & mut self . tree , & glyphs , 0 , stripped ) ; }
Prepare the glyph matcher from a set of glyphs.
Prepare the glyph matcher from a set of glyphs .
&mut self
glyphs
&'a [Glyph]
stripped
bool