Struct InsertionEntryData

#[repr(C, packed(1))]
pub struct InsertionEntryData {
    pub current_insert_index: BigEndian<u16>,
    pub marked_insert_index: BigEndian<u16>,
}

Entry payload in an insertion subtable state machine.

Fields

current_insert_index: BigEndian<u16>

Zero-based index into the insertion glyph table. The number of glyphs to be inserted is contained in the currentInsertCount field in the flags (see below). A value of 0xFFFF indicates no insertion is to be done.

marked_insert_index: BigEndian<u16>

Zero-based index into the insertion glyph table. The number of glyphs to be inserted is contained in the markedInsertCount field in the flags (see below). A value of 0xFFFF indicates no insertion is to be done.

Implementations

impl InsertionEntryData

pub fn current_insert_index(&self) -> u16

Zero-based index into the insertion glyph table. The number of glyphs to be inserted is contained in the currentInsertCount field in the flags (see below). A value of 0xFFFF indicates no insertion is to be done.

pub fn marked_insert_index(&self) -> u16

Zero-based index into the insertion glyph table. The number of glyphs to be inserted is contained in the markedInsertCount field in the flags (see below). A value of 0xFFFF indicates no insertion is to be done.

Trait Implementations

impl Clone for InsertionEntryData

fn clone(&self) -> InsertionEntryData

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InsertionEntryData

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

Formats the value using the given formatter.

impl FixedSize for InsertionEntryData

const RAW_BYTE_LEN: usize = 4usize

The raw size of this type, in bytes.

impl Hash for InsertionEntryData

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for InsertionEntryData

fn cmp(&self, other: &InsertionEntryData) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for InsertionEntryData

fn eq(&self, other: &InsertionEntryData) -> 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 PartialOrd for InsertionEntryData

fn partial_cmp(&self, other: &InsertionEntryData) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Zeroable for InsertionEntryData

fn zeroed() -> Self

Calls zeroed.

impl AnyBitPattern for InsertionEntryData

impl Copy for InsertionEntryData

impl Eq for InsertionEntryData

impl StructuralPartialEq for InsertionEntryData