Struct GlyphOrder 

pub struct GlyphOrder(/* private fields */);

The name of every glyph, in the order it will be emitted

https://rsheeter.github.io/font101/#glyph-ids-and-the-cmap-table

Implementations

impl GlyphOrder

pub fn new() -> Self

pub fn glyph_id<Q>(&self, name: &Q) -> Option<GlyphId16>

where Q: Hash + Equivalent<GlyphName> + ?Sized,

pub fn glyph_name(&self, index: usize) -> Option<&GlyphName>

pub fn contains<Q>(&self, name: &Q) -> bool

where Q: Hash + Equivalent<GlyphName> + ?Sized,

pub fn iter(&self) -> impl Iterator<Item = (GlyphId16, &GlyphName)>

Iterate over ids and names

pub fn names(&self) -> impl Iterator<Item = &GlyphName>

Iterate glyph names, in order

pub fn remove(&mut self, name: &GlyphName) -> bool

pub fn difference<'a>( &'a self, other: &'a GlyphOrder, ) -> Difference<'a, GlyphName, RandomState>

pub fn insert(&mut self, name: GlyphName) -> bool

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

Trait Implementations

impl Clone for GlyphOrder

fn clone(&self) -> GlyphOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GlyphOrder

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

Formats the value using the given formatter.

impl Default for GlyphOrder

fn default() -> GlyphOrder

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GlyphOrder

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for GlyphOrder

impl Extend<GlyphName> for GlyphOrder

fn extend<T: IntoIterator<Item = GlyphName>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<GlyphName> for GlyphOrder

fn from_iter<T: IntoIterator<Item = GlyphName>>(iter: T) -> Self

Creates a value from an iterator.

impl IntoIterator for GlyphOrder

type Item = GlyphName

The type of the elements being iterated over.

type IntoIter = <IndexSet<GlyphName> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for GlyphOrder

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Persistable for GlyphOrder

fn read(from: &mut dyn Read) -> Self

fn write(&self, to: &mut dyn Write)

impl Serialize for GlyphOrder

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.