// THIS FILE IS AUTOGENERATED. // Any changes to this file will be overwritten. // For more information about how codegen works, see font-codegen/README.md #[allow(unused_imports)] use crate::codegen_prelude::*; #[derive(Clone)] pub enum Ift<'a> { Format1(PatchMapFormat1<'a>), Format2(PatchMapFormat2<'a>), } impl Default for Ift<'_> { fn default() -> Self { Self::Format1(Default::default()) } } impl<'a> Ift<'a> { ///Return the `FontData` used to resolve offsets for this table. pub fn offset_data(&self) -> FontData<'a> { match self { Self::Format1(item) => item.offset_data(), Self::Format2(item) => item.offset_data(), } } /// Format identifier: format = 1 pub fn format(&self) -> u8 { match self { Self::Format1(item) => item.format(), Self::Format2(item) => item.format(), } } pub fn field_flags(&self) -> PatchMapFieldPresenceFlags { match self { Self::Format1(item) => item.field_flags(), Self::Format2(item) => item.field_flags(), } } /// Unique ID that identifies compatible patches. pub fn compatibility_id(&self) -> CompatibilityId { match self { Self::Format1(item) => item.compatibility_id(), Self::Format2(item) => item.compatibility_id(), } } pub fn url_template_length(&self) -> u16 { match self { Self::Format1(item) => item.url_template_length(), Self::Format2(item) => item.url_template_length(), } } pub fn url_template(&self) -> &'a [u8] { match self { Self::Format1(item) => item.url_template(), Self::Format2(item) => item.url_template(), } } pub fn cff_charstrings_offset(&self) -> Option { match self { Self::Format1(item) => item.cff_charstrings_offset(), Self::Format2(item) => item.cff_charstrings_offset(), } } pub fn cff2_charstrings_offset(&self) -> Option { match self { Self::Format1(item) => item.cff2_charstrings_offset(), Self::Format2(item) => item.cff2_charstrings_offset(), } } } impl<'a> FontRead<'a> for Ift<'a> { fn read(data: FontData<'a>) -> Result { let format: u8 = data.read_at(0usize)?; match format { PatchMapFormat1::FORMAT => Ok(Self::Format1(FontRead::read(data)?)), PatchMapFormat2::FORMAT => Ok(Self::Format2(FontRead::read(data)?)), other => Err(ReadError::InvalidFormat(other.into())), } } } impl<'a> MinByteRange<'a> for Ift<'a> { fn min_byte_range(&self) -> Range { match self { Self::Format1(item) => item.min_byte_range(), Self::Format2(item) => item.min_byte_range(), } } fn min_table_bytes(&self) -> &'a [u8] { match self { Self::Format1(item) => item.min_table_bytes(), Self::Format2(item) => item.min_table_bytes(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> Ift<'a> { fn dyn_inner<'b>(&'b self) -> &'b dyn SomeTable<'a> { match self { Self::Format1(table) => table, Self::Format2(table) => table, } } } #[cfg(feature = "experimental_traverse")] impl std::fmt::Debug for Ift<'_> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { self.dyn_inner().fmt(f) } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for Ift<'a> { fn type_name(&self) -> &str { self.dyn_inner().type_name() } fn get_field(&self, idx: usize) -> Option> { self.dyn_inner().get_field(idx) } } #[derive(Clone, Copy, Default, PartialEq, Eq, PartialOrd, Ord, Hash, bytemuck :: AnyBitPattern)] #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] #[repr(transparent)] pub struct PatchMapFieldPresenceFlags { bits: u8, } impl PatchMapFieldPresenceFlags { pub const CFF_CHARSTRINGS_OFFSET: Self = Self { bits: 0b00000001 }; pub const CFF2_CHARSTRINGS_OFFSET: Self = Self { bits: 0b00000010 }; } impl PatchMapFieldPresenceFlags { /// Returns an empty set of flags. #[inline] pub const fn empty() -> Self { Self { bits: 0 } } /// Returns the set containing all flags. #[inline] pub const fn all() -> Self { Self { bits: Self::CFF_CHARSTRINGS_OFFSET.bits | Self::CFF2_CHARSTRINGS_OFFSET.bits, } } /// Returns the raw value of the flags currently stored. #[inline] pub const fn bits(&self) -> u8 { self.bits } /// Convert from underlying bit representation, unless that /// representation contains bits that do not correspond to a flag. #[inline] pub const fn from_bits(bits: u8) -> Option { if (bits & !Self::all().bits()) == 0 { Some(Self { bits }) } else { None } } /// Convert from underlying bit representation, dropping any bits /// that do not correspond to flags. #[inline] pub const fn from_bits_truncate(bits: u8) -> Self { Self { bits: bits & Self::all().bits, } } /// Returns `true` if no flags are currently stored. #[inline] pub const fn is_empty(&self) -> bool { self.bits() == Self::empty().bits() } /// Returns `true` if there are flags common to both `self` and `other`. #[inline] pub const fn intersects(&self, other: Self) -> bool { !(Self { bits: self.bits & other.bits, }) .is_empty() } /// Returns `true` if all of the flags in `other` are contained within `self`. #[inline] pub const fn contains(&self, other: Self) -> bool { (self.bits & other.bits) == other.bits } /// Inserts the specified flags in-place. #[inline] pub fn insert(&mut self, other: Self) { self.bits |= other.bits; } /// Removes the specified flags in-place. #[inline] pub fn remove(&mut self, other: Self) { self.bits &= !other.bits; } /// Toggles the specified flags in-place. #[inline] pub fn toggle(&mut self, other: Self) { self.bits ^= other.bits; } /// Returns the intersection between the flags in `self` and /// `other`. /// /// Specifically, the returned set contains only the flags which are /// present in *both* `self` *and* `other`. /// /// This is equivalent to using the `&` operator (e.g. /// [`ops::BitAnd`]), as in `flags & other`. /// /// [`ops::BitAnd`]: https://doc.rust-lang.org/std/ops/trait.BitAnd.html #[inline] #[must_use] pub const fn intersection(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } /// Returns the union of between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags which are /// present in *either* `self` *or* `other`, including any which are /// present in both. /// /// This is equivalent to using the `|` operator (e.g. /// [`ops::BitOr`]), as in `flags | other`. /// /// [`ops::BitOr`]: https://doc.rust-lang.org/std/ops/trait.BitOr.html #[inline] #[must_use] pub const fn union(self, other: Self) -> Self { Self { bits: self.bits | other.bits, } } /// Returns the difference between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags present in /// `self`, except for the ones present in `other`. /// /// It is also conceptually equivalent to the "bit-clear" operation: /// `flags & !other` (and this syntax is also supported). /// /// This is equivalent to using the `-` operator (e.g. /// [`ops::Sub`]), as in `flags - other`. /// /// [`ops::Sub`]: https://doc.rust-lang.org/std/ops/trait.Sub.html #[inline] #[must_use] pub const fn difference(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::BitOr for PatchMapFieldPresenceFlags { type Output = Self; /// Returns the union of the two sets of flags. #[inline] fn bitor(self, other: PatchMapFieldPresenceFlags) -> Self { Self { bits: self.bits | other.bits, } } } impl std::ops::BitOrAssign for PatchMapFieldPresenceFlags { /// Adds the set of flags. #[inline] fn bitor_assign(&mut self, other: Self) { self.bits |= other.bits; } } impl std::ops::BitXor for PatchMapFieldPresenceFlags { type Output = Self; /// Returns the left flags, but with all the right flags toggled. #[inline] fn bitxor(self, other: Self) -> Self { Self { bits: self.bits ^ other.bits, } } } impl std::ops::BitXorAssign for PatchMapFieldPresenceFlags { /// Toggles the set of flags. #[inline] fn bitxor_assign(&mut self, other: Self) { self.bits ^= other.bits; } } impl std::ops::BitAnd for PatchMapFieldPresenceFlags { type Output = Self; /// Returns the intersection between the two sets of flags. #[inline] fn bitand(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } } impl std::ops::BitAndAssign for PatchMapFieldPresenceFlags { /// Disables all flags disabled in the set. #[inline] fn bitand_assign(&mut self, other: Self) { self.bits &= other.bits; } } impl std::ops::Sub for PatchMapFieldPresenceFlags { type Output = Self; /// Returns the set difference of the two sets of flags. #[inline] fn sub(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::SubAssign for PatchMapFieldPresenceFlags { /// Disables all flags enabled in the set. #[inline] fn sub_assign(&mut self, other: Self) { self.bits &= !other.bits; } } impl std::ops::Not for PatchMapFieldPresenceFlags { type Output = Self; /// Returns the complement of this set of flags. #[inline] fn not(self) -> Self { Self { bits: !self.bits } & Self::all() } } impl std::fmt::Debug for PatchMapFieldPresenceFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { let members: &[(&str, Self)] = &[ ("CFF_CHARSTRINGS_OFFSET", Self::CFF_CHARSTRINGS_OFFSET), ("CFF2_CHARSTRINGS_OFFSET", Self::CFF2_CHARSTRINGS_OFFSET), ]; let mut first = true; for (name, value) in members { if self.contains(*value) { if !first { f.write_str(" | ")?; } first = false; f.write_str(name)?; } } if first { f.write_str("(empty)")?; } Ok(()) } } impl std::fmt::Binary for PatchMapFieldPresenceFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Binary::fmt(&self.bits, f) } } impl std::fmt::Octal for PatchMapFieldPresenceFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Octal::fmt(&self.bits, f) } } impl std::fmt::LowerHex for PatchMapFieldPresenceFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::LowerHex::fmt(&self.bits, f) } } impl std::fmt::UpperHex for PatchMapFieldPresenceFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::UpperHex::fmt(&self.bits, f) } } impl font_types::Scalar for PatchMapFieldPresenceFlags { type Raw = ::Raw; fn to_raw(self) -> Self::Raw { self.bits().to_raw() } fn from_raw(raw: Self::Raw) -> Self { let t = ::from_raw(raw); Self::from_bits_truncate(t) } } #[cfg(feature = "experimental_traverse")] impl<'a> From for FieldType<'a> { fn from(src: PatchMapFieldPresenceFlags) -> FieldType<'a> { src.bits().into() } } impl Format for PatchMapFormat1<'_> { const FORMAT: u8 = 1; } impl<'a> MinByteRange<'a> for PatchMapFormat1<'a> { fn min_byte_range(&self) -> Range { 0..self.patch_format_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for PatchMapFormat1<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } /// [Patch Map Format Format 1](https://w3c.github.io/IFT/Overview.html#patch-map-format-1) #[derive(Clone)] pub struct PatchMapFormat1<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> PatchMapFormat1<'a> { pub const MIN_SIZE: usize = (u8::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + PatchMapFieldPresenceFlags::RAW_BYTE_LEN + CompatibilityId::RAW_BYTE_LEN + u16::RAW_BYTE_LEN + u16::RAW_BYTE_LEN + Uint24::RAW_BYTE_LEN + Offset32::RAW_BYTE_LEN + Offset32::RAW_BYTE_LEN + u16::RAW_BYTE_LEN + u8::RAW_BYTE_LEN); basic_table_impls!(impl_the_methods); /// Format identifier: format = 1 pub fn format(&self) -> u8 { let range = self.format_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn field_flags(&self) -> PatchMapFieldPresenceFlags { let range = self.field_flags_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Unique ID that identifies compatible patches. pub fn compatibility_id(&self) -> CompatibilityId { let range = self.compatibility_id_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Largest entry index which appears in either the glyph map or feature map. pub fn max_entry_index(&self) -> u16 { let range = self.max_entry_index_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Largest entry index which appears in the glyph map. pub fn max_glyph_map_entry_index(&self) -> u16 { let range = self.max_glyph_map_entry_index_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn glyph_count(&self) -> Uint24 { let range = self.glyph_count_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Sub table that maps glyph ids to entry indices. pub fn glyph_map_offset(&self) -> Offset32 { let range = self.glyph_map_offset_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Attempt to resolve [`glyph_map_offset`][Self::glyph_map_offset]. pub fn glyph_map(&self) -> Result, ReadError> { let data = self.data; let args = (self.glyph_count(), self.max_entry_index()); self.glyph_map_offset().resolve_with_args(data, &args) } /// Sub table that maps feature and glyph ids to entry indices. pub fn feature_map_offset(&self) -> Nullable { let range = self.feature_map_offset_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Attempt to resolve [`feature_map_offset`][Self::feature_map_offset]. pub fn feature_map(&self) -> Option, ReadError>> { let data = self.data; let args = self.max_entry_index(); self.feature_map_offset().resolve_with_args(data, &args) } pub fn applied_entries_bitmap(&self) -> &'a [u8] { let range = self.applied_entries_bitmap_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn url_template_length(&self) -> u16 { let range = self.url_template_length_byte_range(); self.data.read_at(range.start).ok().unwrap_or_default() } pub fn url_template(&self) -> &'a [u8] { let range = self.url_template_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } /// Patch format number for patches referenced by this mapping. pub fn patch_format(&self) -> u8 { let range = self.patch_format_byte_range(); self.data.read_at(range.start).ok().unwrap_or_default() } pub fn cff_charstrings_offset(&self) -> Option { let range = self.cff_charstrings_offset_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn cff2_charstrings_offset(&self) -> Option { let range = self.cff2_charstrings_offset_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn format_byte_range(&self) -> Range { let start = 0; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn _reserved_0_byte_range(&self) -> Range { let start = self.format_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn _reserved_1_byte_range(&self) -> Range { let start = self._reserved_0_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn _reserved_2_byte_range(&self) -> Range { let start = self._reserved_1_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn field_flags_byte_range(&self) -> Range { let start = self._reserved_2_byte_range().end; let end = start + PatchMapFieldPresenceFlags::RAW_BYTE_LEN; start..end } pub fn compatibility_id_byte_range(&self) -> Range { let start = self.field_flags_byte_range().end; let end = start + CompatibilityId::RAW_BYTE_LEN; start..end } pub fn max_entry_index_byte_range(&self) -> Range { let start = self.compatibility_id_byte_range().end; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn max_glyph_map_entry_index_byte_range(&self) -> Range { let start = self.max_entry_index_byte_range().end; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn glyph_count_byte_range(&self) -> Range { let start = self.max_glyph_map_entry_index_byte_range().end; let end = start + Uint24::RAW_BYTE_LEN; start..end } pub fn glyph_map_offset_byte_range(&self) -> Range { let start = self.glyph_count_byte_range().end; let end = start + Offset32::RAW_BYTE_LEN; start..end } pub fn feature_map_offset_byte_range(&self) -> Range { let start = self.glyph_map_offset_byte_range().end; let end = start + Offset32::RAW_BYTE_LEN; start..end } pub fn applied_entries_bitmap_byte_range(&self) -> Range { let max_entry_index = self.max_entry_index(); let start = self.feature_map_offset_byte_range().end; let end = start + (transforms::max_value_bitmap_len(max_entry_index)).saturating_mul(u8::RAW_BYTE_LEN); start..end } pub fn url_template_length_byte_range(&self) -> Range { let start = self.applied_entries_bitmap_byte_range().end; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn url_template_byte_range(&self) -> Range { let url_template_length = self.url_template_length(); let start = self.url_template_length_byte_range().end; let end = start + (transforms::to_usize(url_template_length)).saturating_mul(u8::RAW_BYTE_LEN); start..end } pub fn patch_format_byte_range(&self) -> Range { let start = self.url_template_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn cff_charstrings_offset_byte_range(&self) -> Range { let start = self.patch_format_byte_range().end; let end = if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF_CHARSTRINGS_OFFSET) { start + u32::RAW_BYTE_LEN } else { start }; start..end } pub fn cff2_charstrings_offset_byte_range(&self) -> Range { let start = self.cff_charstrings_offset_byte_range().end; let end = if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF2_CHARSTRINGS_OFFSET) { start + u32::RAW_BYTE_LEN } else { start }; start..end } } const _: () = assert!(FontData::default_data_long_enough( PatchMapFormat1::MIN_SIZE )); impl Default for PatchMapFormat1<'_> { fn default() -> Self { Self { data: FontData::default_format_1_u8_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for PatchMapFormat1<'a> { fn type_name(&self) -> &str { "PatchMapFormat1" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("format", self.format())), 1usize => Some(Field::new("field_flags", self.field_flags())), 2usize => Some(Field::new( "compatibility_id", traversal::FieldType::Unknown, )), 3usize => Some(Field::new("max_entry_index", self.max_entry_index())), 4usize => Some(Field::new( "max_glyph_map_entry_index", self.max_glyph_map_entry_index(), )), 5usize => Some(Field::new("glyph_count", self.glyph_count())), 6usize => Some(Field::new( "glyph_map_offset", FieldType::offset(self.glyph_map_offset(), self.glyph_map()), )), 7usize => Some(Field::new( "feature_map_offset", FieldType::offset(self.feature_map_offset(), self.feature_map()), )), 8usize => Some(Field::new( "applied_entries_bitmap", self.applied_entries_bitmap(), )), 9usize => Some(Field::new( "url_template_length", self.url_template_length(), )), 10usize => Some(Field::new("url_template", self.url_template())), 11usize => Some(Field::new("patch_format", self.patch_format())), 12usize if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF_CHARSTRINGS_OFFSET) => { Some(Field::new( "cff_charstrings_offset", self.cff_charstrings_offset().unwrap(), )) } 13usize if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF2_CHARSTRINGS_OFFSET) => { Some(Field::new( "cff2_charstrings_offset", self.cff2_charstrings_offset().unwrap(), )) } _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for PatchMapFormat1<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for GlyphMap<'a> { fn min_byte_range(&self) -> Range { 0..self.entry_index_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl ReadArgs for GlyphMap<'_> { type Args = (Uint24, u16); } impl<'a> FontReadWithArgs<'a> for GlyphMap<'a> { fn read_with_args(data: FontData<'a>, args: &(Uint24, u16)) -> Result { let (glyph_count, max_entry_index) = *args; #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data, glyph_count, max_entry_index, }) } } impl<'a> GlyphMap<'a> { /// A constructor that requires additional arguments. /// /// This type requires some external state in order to be /// parsed. pub fn read( data: FontData<'a>, glyph_count: Uint24, max_entry_index: u16, ) -> Result { let args = (glyph_count, max_entry_index); Self::read_with_args(data, &args) } } #[derive(Clone)] pub struct GlyphMap<'a> { data: FontData<'a>, glyph_count: Uint24, max_entry_index: u16, } #[allow(clippy::needless_lifetimes)] impl<'a> GlyphMap<'a> { pub const MIN_SIZE: usize = u16::RAW_BYTE_LEN; basic_table_impls!(impl_the_methods); pub fn first_mapped_glyph(&self) -> u16 { let range = self.first_mapped_glyph_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn entry_index(&self) -> ComputedArray<'a, U8Or16> { let range = self.entry_index_byte_range(); self.data .read_with_args(range, &self.max_entry_index()) .unwrap_or_default() } pub(crate) fn glyph_count(&self) -> Uint24 { self.glyph_count } pub(crate) fn max_entry_index(&self) -> u16 { self.max_entry_index } pub fn first_mapped_glyph_byte_range(&self) -> Range { let start = 0; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn entry_index_byte_range(&self) -> Range { let glyph_count = self.glyph_count(); let first_mapped_glyph = self.first_mapped_glyph(); let start = self.first_mapped_glyph_byte_range().end; let end = start + (transforms::subtract(glyph_count, first_mapped_glyph)).saturating_mul( ::compute_size(&self.max_entry_index()).unwrap_or(0), ); start..end } } const _: () = assert!(FontData::default_data_long_enough(GlyphMap::MIN_SIZE)); impl Default for GlyphMap<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), glyph_count: Default::default(), max_entry_index: Default::default(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for GlyphMap<'a> { fn type_name(&self) -> &str { "GlyphMap" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("first_mapped_glyph", self.first_mapped_glyph())), 1usize => Some(Field::new("entry_index", traversal::FieldType::Unknown)), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for GlyphMap<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for FeatureMap<'a> { fn min_byte_range(&self) -> Range { 0..self.entry_map_data_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl ReadArgs for FeatureMap<'_> { type Args = u16; } impl<'a> FontReadWithArgs<'a> for FeatureMap<'a> { fn read_with_args(data: FontData<'a>, args: &u16) -> Result { let max_entry_index = *args; #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data, max_entry_index, }) } } impl<'a> FeatureMap<'a> { /// A constructor that requires additional arguments. /// /// This type requires some external state in order to be /// parsed. pub fn read(data: FontData<'a>, max_entry_index: u16) -> Result { let args = max_entry_index; Self::read_with_args(data, &args) } } #[derive(Clone)] pub struct FeatureMap<'a> { data: FontData<'a>, max_entry_index: u16, } #[allow(clippy::needless_lifetimes)] impl<'a> FeatureMap<'a> { pub const MIN_SIZE: usize = u16::RAW_BYTE_LEN; basic_table_impls!(impl_the_methods); pub fn feature_count(&self) -> u16 { let range = self.feature_count_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn feature_records(&self) -> ComputedArray<'a, FeatureRecord> { let range = self.feature_records_byte_range(); self.data .read_with_args(range, &self.max_entry_index()) .unwrap_or_default() } pub fn entry_map_data(&self) -> &'a [u8] { let range = self.entry_map_data_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub(crate) fn max_entry_index(&self) -> u16 { self.max_entry_index } pub fn feature_count_byte_range(&self) -> Range { let start = 0; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn feature_records_byte_range(&self) -> Range { let feature_count = self.feature_count(); let start = self.feature_count_byte_range().end; let end = start + (transforms::to_usize(feature_count)).saturating_mul( ::compute_size(&self.max_entry_index()).unwrap_or(0), ); start..end } pub fn entry_map_data_byte_range(&self) -> Range { let start = self.feature_records_byte_range().end; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } const _: () = assert!(FontData::default_data_long_enough(FeatureMap::MIN_SIZE)); impl Default for FeatureMap<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), max_entry_index: Default::default(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for FeatureMap<'a> { fn type_name(&self) -> &str { "FeatureMap" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("feature_count", self.feature_count())), 1usize => Some(Field::new("feature_records", traversal::FieldType::Unknown)), 2usize => Some(Field::new("entry_map_data", self.entry_map_data())), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for FeatureMap<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } #[derive(Clone, Debug)] pub struct FeatureRecord { pub feature_tag: BigEndian, pub first_new_entry_index: U8Or16, pub entry_map_count: U8Or16, } impl FeatureRecord { pub fn feature_tag(&self) -> Tag { self.feature_tag.get() } pub fn first_new_entry_index(&self) -> &U8Or16 { &self.first_new_entry_index } pub fn entry_map_count(&self) -> &U8Or16 { &self.entry_map_count } } impl ReadArgs for FeatureRecord { type Args = u16; } impl ComputeSize for FeatureRecord { #[allow(clippy::needless_question_mark)] fn compute_size(args: &u16) -> Result { let max_entry_index = *args; let mut result = 0usize; result = result .checked_add(Tag::RAW_BYTE_LEN) .ok_or(ReadError::OutOfBounds)?; result = result .checked_add(::compute_size(&max_entry_index).unwrap_or(0)) .ok_or(ReadError::OutOfBounds)?; result = result .checked_add(::compute_size(&max_entry_index).unwrap_or(0)) .ok_or(ReadError::OutOfBounds)?; Ok(result) } } impl<'a> FontReadWithArgs<'a> for FeatureRecord { fn read_with_args(data: FontData<'a>, args: &u16) -> Result { let mut cursor = data.cursor(); let max_entry_index = *args; Ok(Self { feature_tag: cursor.read_be()?, first_new_entry_index: cursor.read_with_args(&max_entry_index)?, entry_map_count: cursor.read_with_args(&max_entry_index)?, }) } } #[allow(clippy::needless_lifetimes)] impl<'a> FeatureRecord { /// A constructor that requires additional arguments. /// /// This type requires some external state in order to be /// parsed. pub fn read(data: FontData<'a>, max_entry_index: u16) -> Result { let args = max_entry_index; Self::read_with_args(data, &args) } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeRecord<'a> for FeatureRecord { fn traverse(self, data: FontData<'a>) -> RecordResolver<'a> { RecordResolver { name: "FeatureRecord", get_field: Box::new(move |idx, _data| match idx { 0usize => Some(Field::new("feature_tag", self.feature_tag())), 1usize => Some(Field::new( "first_new_entry_index", traversal::FieldType::Unknown, )), 2usize => Some(Field::new("entry_map_count", traversal::FieldType::Unknown)), _ => None, }), data, } } } #[derive(Clone, Debug)] pub struct EntryMapRecord { pub first_entry_index: U8Or16, pub last_entry_index: U8Or16, } impl EntryMapRecord { pub fn first_entry_index(&self) -> &U8Or16 { &self.first_entry_index } pub fn last_entry_index(&self) -> &U8Or16 { &self.last_entry_index } } impl ReadArgs for EntryMapRecord { type Args = u16; } impl ComputeSize for EntryMapRecord { #[allow(clippy::needless_question_mark)] fn compute_size(args: &u16) -> Result { let max_entry_index = *args; let mut result = 0usize; result = result .checked_add(::compute_size(&max_entry_index).unwrap_or(0)) .ok_or(ReadError::OutOfBounds)?; result = result .checked_add(::compute_size(&max_entry_index).unwrap_or(0)) .ok_or(ReadError::OutOfBounds)?; Ok(result) } } impl<'a> FontReadWithArgs<'a> for EntryMapRecord { fn read_with_args(data: FontData<'a>, args: &u16) -> Result { let mut cursor = data.cursor(); let max_entry_index = *args; Ok(Self { first_entry_index: cursor.read_with_args(&max_entry_index)?, last_entry_index: cursor.read_with_args(&max_entry_index)?, }) } } #[allow(clippy::needless_lifetimes)] impl<'a> EntryMapRecord { /// A constructor that requires additional arguments. /// /// This type requires some external state in order to be /// parsed. pub fn read(data: FontData<'a>, max_entry_index: u16) -> Result { let args = max_entry_index; Self::read_with_args(data, &args) } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeRecord<'a> for EntryMapRecord { fn traverse(self, data: FontData<'a>) -> RecordResolver<'a> { RecordResolver { name: "EntryMapRecord", get_field: Box::new(move |idx, _data| match idx { 0usize => Some(Field::new( "first_entry_index", traversal::FieldType::Unknown, )), 1usize => Some(Field::new( "last_entry_index", traversal::FieldType::Unknown, )), _ => None, }), data, } } } impl Format for PatchMapFormat2<'_> { const FORMAT: u8 = 2; } impl<'a> MinByteRange<'a> for PatchMapFormat2<'a> { fn min_byte_range(&self) -> Range { 0..self.url_template_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for PatchMapFormat2<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } /// [Patch Map Format Format 2](https://w3c.github.io/IFT/Overview.html#patch-map-format-2) #[derive(Clone)] pub struct PatchMapFormat2<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> PatchMapFormat2<'a> { pub const MIN_SIZE: usize = (u8::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + PatchMapFieldPresenceFlags::RAW_BYTE_LEN + CompatibilityId::RAW_BYTE_LEN + u8::RAW_BYTE_LEN + Uint24::RAW_BYTE_LEN + Offset32::RAW_BYTE_LEN + Offset32::RAW_BYTE_LEN + u16::RAW_BYTE_LEN); basic_table_impls!(impl_the_methods); /// Format identifier: format = 2 pub fn format(&self) -> u8 { let range = self.format_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn field_flags(&self) -> PatchMapFieldPresenceFlags { let range = self.field_flags_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Unique ID that identifies compatible patches. pub fn compatibility_id(&self) -> CompatibilityId { let range = self.compatibility_id_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Patch format number for patches referenced by this mapping. pub fn default_patch_format(&self) -> u8 { let range = self.default_patch_format_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn entry_count(&self) -> Uint24 { let range = self.entry_count_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn entries_offset(&self) -> Offset32 { let range = self.entries_offset_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Attempt to resolve [`entries_offset`][Self::entries_offset]. pub fn entries(&self) -> Result, ReadError> { let data = self.data; self.entries_offset().resolve(data) } pub fn entry_id_string_data_offset(&self) -> Nullable { let range = self.entry_id_string_data_offset_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Attempt to resolve [`entry_id_string_data_offset`][Self::entry_id_string_data_offset]. pub fn entry_id_string_data(&self) -> Option, ReadError>> { let data = self.data; self.entry_id_string_data_offset().resolve(data) } pub fn url_template_length(&self) -> u16 { let range = self.url_template_length_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn url_template(&self) -> &'a [u8] { let range = self.url_template_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn cff_charstrings_offset(&self) -> Option { let range = self.cff_charstrings_offset_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn cff2_charstrings_offset(&self) -> Option { let range = self.cff2_charstrings_offset_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn format_byte_range(&self) -> Range { let start = 0; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn _reserved_0_byte_range(&self) -> Range { let start = self.format_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn _reserved_1_byte_range(&self) -> Range { let start = self._reserved_0_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn _reserved_2_byte_range(&self) -> Range { let start = self._reserved_1_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn field_flags_byte_range(&self) -> Range { let start = self._reserved_2_byte_range().end; let end = start + PatchMapFieldPresenceFlags::RAW_BYTE_LEN; start..end } pub fn compatibility_id_byte_range(&self) -> Range { let start = self.field_flags_byte_range().end; let end = start + CompatibilityId::RAW_BYTE_LEN; start..end } pub fn default_patch_format_byte_range(&self) -> Range { let start = self.compatibility_id_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn entry_count_byte_range(&self) -> Range { let start = self.default_patch_format_byte_range().end; let end = start + Uint24::RAW_BYTE_LEN; start..end } pub fn entries_offset_byte_range(&self) -> Range { let start = self.entry_count_byte_range().end; let end = start + Offset32::RAW_BYTE_LEN; start..end } pub fn entry_id_string_data_offset_byte_range(&self) -> Range { let start = self.entries_offset_byte_range().end; let end = start + Offset32::RAW_BYTE_LEN; start..end } pub fn url_template_length_byte_range(&self) -> Range { let start = self.entry_id_string_data_offset_byte_range().end; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn url_template_byte_range(&self) -> Range { let url_template_length = self.url_template_length(); let start = self.url_template_length_byte_range().end; let end = start + (transforms::to_usize(url_template_length)).saturating_mul(u8::RAW_BYTE_LEN); start..end } pub fn cff_charstrings_offset_byte_range(&self) -> Range { let start = self.url_template_byte_range().end; let end = if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF_CHARSTRINGS_OFFSET) { start + u32::RAW_BYTE_LEN } else { start }; start..end } pub fn cff2_charstrings_offset_byte_range(&self) -> Range { let start = self.cff_charstrings_offset_byte_range().end; let end = if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF2_CHARSTRINGS_OFFSET) { start + u32::RAW_BYTE_LEN } else { start }; start..end } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for PatchMapFormat2<'a> { fn type_name(&self) -> &str { "PatchMapFormat2" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("format", self.format())), 1usize => Some(Field::new("field_flags", self.field_flags())), 2usize => Some(Field::new( "compatibility_id", traversal::FieldType::Unknown, )), 3usize => Some(Field::new( "default_patch_format", self.default_patch_format(), )), 4usize => Some(Field::new("entry_count", self.entry_count())), 5usize => Some(Field::new( "entries_offset", FieldType::offset(self.entries_offset(), self.entries()), )), 6usize => Some(Field::new( "entry_id_string_data_offset", FieldType::offset( self.entry_id_string_data_offset(), self.entry_id_string_data(), ), )), 7usize => Some(Field::new( "url_template_length", self.url_template_length(), )), 8usize => Some(Field::new("url_template", self.url_template())), 9usize if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF_CHARSTRINGS_OFFSET) => { Some(Field::new( "cff_charstrings_offset", self.cff_charstrings_offset().unwrap(), )) } 10usize if self .field_flags() .contains(PatchMapFieldPresenceFlags::CFF2_CHARSTRINGS_OFFSET) => { Some(Field::new( "cff2_charstrings_offset", self.cff2_charstrings_offset().unwrap(), )) } _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for PatchMapFormat2<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for MappingEntries<'a> { fn min_byte_range(&self) -> Range { 0..self.entry_data_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for MappingEntries<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } #[derive(Clone)] pub struct MappingEntries<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> MappingEntries<'a> { pub const MIN_SIZE: usize = 0; basic_table_impls!(impl_the_methods); pub fn entry_data(&self) -> &'a [u8] { let range = self.entry_data_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn entry_data_byte_range(&self) -> Range { let start = 0; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } #[allow(clippy::absurd_extreme_comparisons)] const _: () = assert!(FontData::default_data_long_enough(MappingEntries::MIN_SIZE)); impl Default for MappingEntries<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for MappingEntries<'a> { fn type_name(&self) -> &str { "MappingEntries" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("entry_data", self.entry_data())), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for MappingEntries<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for EntryData<'a> { fn min_byte_range(&self) -> Range { 0..self.trailing_data_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for EntryData<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } #[derive(Clone)] pub struct EntryData<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> EntryData<'a> { pub const MIN_SIZE: usize = EntryFormatFlags::RAW_BYTE_LEN; basic_table_impls!(impl_the_methods); pub fn format_flags(&self) -> EntryFormatFlags { let range = self.format_flags_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn feature_count(&self) -> Option { let range = self.feature_count_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn feature_tags(&self) -> Option<&'a [BigEndian]> { let range = self.feature_tags_byte_range(); (!range.is_empty()) .then(|| self.data.read_array(range).ok()) .flatten() } pub fn design_space_count(&self) -> Option { let range = self.design_space_count_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn design_space_segments(&self) -> Option<&'a [DesignSpaceSegment]> { let range = self.design_space_segments_byte_range(); (!range.is_empty()) .then(|| self.data.read_array(range).ok()) .flatten() } pub fn match_mode_and_count(&self) -> Option { let range = self.match_mode_and_count_byte_range(); (!range.is_empty()) .then(|| self.data.read_at(range.start).ok()) .flatten() } pub fn child_indices(&self) -> Option<&'a [BigEndian]> { let range = self.child_indices_byte_range(); (!range.is_empty()) .then(|| self.data.read_array(range).ok()) .flatten() } pub fn format_flags_byte_range(&self) -> Range { let start = 0; let end = start + EntryFormatFlags::RAW_BYTE_LEN; start..end } pub fn feature_count_byte_range(&self) -> Range { let start = self.format_flags_byte_range().end; let end = if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) { start + u8::RAW_BYTE_LEN } else { start }; start..end } pub fn feature_tags_byte_range(&self) -> Range { let feature_count = self.feature_count().unwrap_or_default(); let start = self.feature_count_byte_range().end; let end = if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) { start + (transforms::to_usize(feature_count)).saturating_mul(Tag::RAW_BYTE_LEN) } else { start }; start..end } pub fn design_space_count_byte_range(&self) -> Range { let start = self.feature_tags_byte_range().end; let end = if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) { start + u16::RAW_BYTE_LEN } else { start }; start..end } pub fn design_space_segments_byte_range(&self) -> Range { let design_space_count = self.design_space_count().unwrap_or_default(); let start = self.design_space_count_byte_range().end; let end = if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) { start + (transforms::to_usize(design_space_count)) .saturating_mul(DesignSpaceSegment::RAW_BYTE_LEN) } else { start }; start..end } pub fn match_mode_and_count_byte_range(&self) -> Range { let start = self.design_space_segments_byte_range().end; let end = if self .format_flags() .contains(EntryFormatFlags::CHILD_INDICES) { start + MatchModeAndCount::RAW_BYTE_LEN } else { start }; start..end } pub fn child_indices_byte_range(&self) -> Range { let match_mode_and_count = self.match_mode_and_count().unwrap_or_default(); let start = self.match_mode_and_count_byte_range().end; let end = if self .format_flags() .contains(EntryFormatFlags::CHILD_INDICES) { start + (transforms::to_usize(match_mode_and_count)).saturating_mul(Uint24::RAW_BYTE_LEN) } else { start }; start..end } pub fn trailing_data_byte_range(&self) -> Range { let start = self.child_indices_byte_range().end; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } const _: () = assert!(FontData::default_data_long_enough(EntryData::MIN_SIZE)); impl Default for EntryData<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for EntryData<'a> { fn type_name(&self) -> &str { "EntryData" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("format_flags", self.format_flags())), 1usize if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) => { Some(Field::new("feature_count", self.feature_count().unwrap())) } 2usize if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) => { Some(Field::new("feature_tags", self.feature_tags().unwrap())) } 3usize if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) => { Some(Field::new( "design_space_count", self.design_space_count().unwrap(), )) } 4usize if self .format_flags() .contains(EntryFormatFlags::FEATURES_AND_DESIGN_SPACE) => { Some(Field::new( "design_space_segments", traversal::FieldType::array_of_records( stringify!(DesignSpaceSegment), self.design_space_segments().unwrap(), self.offset_data(), ), )) } 5usize if self .format_flags() .contains(EntryFormatFlags::CHILD_INDICES) => { Some(Field::new( "match_mode_and_count", traversal::FieldType::Unknown, )) } 6usize if self .format_flags() .contains(EntryFormatFlags::CHILD_INDICES) => { Some(Field::new("child_indices", self.child_indices().unwrap())) } _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for EntryData<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } #[derive(Clone, Copy, Default, PartialEq, Eq, PartialOrd, Ord, Hash, bytemuck :: AnyBitPattern)] #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] #[repr(transparent)] pub struct EntryFormatFlags { bits: u8, } impl EntryFormatFlags { pub const FEATURES_AND_DESIGN_SPACE: Self = Self { bits: 0b00000001 }; pub const CHILD_INDICES: Self = Self { bits: 0b00000010 }; pub const ENTRY_ID_DELTA: Self = Self { bits: 0b00000100 }; pub const PATCH_FORMAT: Self = Self { bits: 0b00001000 }; pub const CODEPOINTS_BIT_1: Self = Self { bits: 0b00010000 }; pub const CODEPOINTS_BIT_2: Self = Self { bits: 0b00100000 }; pub const IGNORED: Self = Self { bits: 0b01000000 }; pub const RESERVED: Self = Self { bits: 0b10000000 }; } impl EntryFormatFlags { /// Returns an empty set of flags. #[inline] pub const fn empty() -> Self { Self { bits: 0 } } /// Returns the set containing all flags. #[inline] pub const fn all() -> Self { Self { bits: Self::FEATURES_AND_DESIGN_SPACE.bits | Self::CHILD_INDICES.bits | Self::ENTRY_ID_DELTA.bits | Self::PATCH_FORMAT.bits | Self::CODEPOINTS_BIT_1.bits | Self::CODEPOINTS_BIT_2.bits | Self::IGNORED.bits | Self::RESERVED.bits, } } /// Returns the raw value of the flags currently stored. #[inline] pub const fn bits(&self) -> u8 { self.bits } /// Convert from underlying bit representation, unless that /// representation contains bits that do not correspond to a flag. #[inline] pub const fn from_bits(bits: u8) -> Option { if (bits & !Self::all().bits()) == 0 { Some(Self { bits }) } else { None } } /// Convert from underlying bit representation, dropping any bits /// that do not correspond to flags. #[inline] pub const fn from_bits_truncate(bits: u8) -> Self { Self { bits: bits & Self::all().bits, } } /// Returns `true` if no flags are currently stored. #[inline] pub const fn is_empty(&self) -> bool { self.bits() == Self::empty().bits() } /// Returns `true` if there are flags common to both `self` and `other`. #[inline] pub const fn intersects(&self, other: Self) -> bool { !(Self { bits: self.bits & other.bits, }) .is_empty() } /// Returns `true` if all of the flags in `other` are contained within `self`. #[inline] pub const fn contains(&self, other: Self) -> bool { (self.bits & other.bits) == other.bits } /// Inserts the specified flags in-place. #[inline] pub fn insert(&mut self, other: Self) { self.bits |= other.bits; } /// Removes the specified flags in-place. #[inline] pub fn remove(&mut self, other: Self) { self.bits &= !other.bits; } /// Toggles the specified flags in-place. #[inline] pub fn toggle(&mut self, other: Self) { self.bits ^= other.bits; } /// Returns the intersection between the flags in `self` and /// `other`. /// /// Specifically, the returned set contains only the flags which are /// present in *both* `self` *and* `other`. /// /// This is equivalent to using the `&` operator (e.g. /// [`ops::BitAnd`]), as in `flags & other`. /// /// [`ops::BitAnd`]: https://doc.rust-lang.org/std/ops/trait.BitAnd.html #[inline] #[must_use] pub const fn intersection(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } /// Returns the union of between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags which are /// present in *either* `self` *or* `other`, including any which are /// present in both. /// /// This is equivalent to using the `|` operator (e.g. /// [`ops::BitOr`]), as in `flags | other`. /// /// [`ops::BitOr`]: https://doc.rust-lang.org/std/ops/trait.BitOr.html #[inline] #[must_use] pub const fn union(self, other: Self) -> Self { Self { bits: self.bits | other.bits, } } /// Returns the difference between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags present in /// `self`, except for the ones present in `other`. /// /// It is also conceptually equivalent to the "bit-clear" operation: /// `flags & !other` (and this syntax is also supported). /// /// This is equivalent to using the `-` operator (e.g. /// [`ops::Sub`]), as in `flags - other`. /// /// [`ops::Sub`]: https://doc.rust-lang.org/std/ops/trait.Sub.html #[inline] #[must_use] pub const fn difference(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::BitOr for EntryFormatFlags { type Output = Self; /// Returns the union of the two sets of flags. #[inline] fn bitor(self, other: EntryFormatFlags) -> Self { Self { bits: self.bits | other.bits, } } } impl std::ops::BitOrAssign for EntryFormatFlags { /// Adds the set of flags. #[inline] fn bitor_assign(&mut self, other: Self) { self.bits |= other.bits; } } impl std::ops::BitXor for EntryFormatFlags { type Output = Self; /// Returns the left flags, but with all the right flags toggled. #[inline] fn bitxor(self, other: Self) -> Self { Self { bits: self.bits ^ other.bits, } } } impl std::ops::BitXorAssign for EntryFormatFlags { /// Toggles the set of flags. #[inline] fn bitxor_assign(&mut self, other: Self) { self.bits ^= other.bits; } } impl std::ops::BitAnd for EntryFormatFlags { type Output = Self; /// Returns the intersection between the two sets of flags. #[inline] fn bitand(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } } impl std::ops::BitAndAssign for EntryFormatFlags { /// Disables all flags disabled in the set. #[inline] fn bitand_assign(&mut self, other: Self) { self.bits &= other.bits; } } impl std::ops::Sub for EntryFormatFlags { type Output = Self; /// Returns the set difference of the two sets of flags. #[inline] fn sub(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::SubAssign for EntryFormatFlags { /// Disables all flags enabled in the set. #[inline] fn sub_assign(&mut self, other: Self) { self.bits &= !other.bits; } } impl std::ops::Not for EntryFormatFlags { type Output = Self; /// Returns the complement of this set of flags. #[inline] fn not(self) -> Self { Self { bits: !self.bits } & Self::all() } } impl std::fmt::Debug for EntryFormatFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { let members: &[(&str, Self)] = &[ ("FEATURES_AND_DESIGN_SPACE", Self::FEATURES_AND_DESIGN_SPACE), ("CHILD_INDICES", Self::CHILD_INDICES), ("ENTRY_ID_DELTA", Self::ENTRY_ID_DELTA), ("PATCH_FORMAT", Self::PATCH_FORMAT), ("CODEPOINTS_BIT_1", Self::CODEPOINTS_BIT_1), ("CODEPOINTS_BIT_2", Self::CODEPOINTS_BIT_2), ("IGNORED", Self::IGNORED), ("RESERVED", Self::RESERVED), ]; let mut first = true; for (name, value) in members { if self.contains(*value) { if !first { f.write_str(" | ")?; } first = false; f.write_str(name)?; } } if first { f.write_str("(empty)")?; } Ok(()) } } impl std::fmt::Binary for EntryFormatFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Binary::fmt(&self.bits, f) } } impl std::fmt::Octal for EntryFormatFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Octal::fmt(&self.bits, f) } } impl std::fmt::LowerHex for EntryFormatFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::LowerHex::fmt(&self.bits, f) } } impl std::fmt::UpperHex for EntryFormatFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::UpperHex::fmt(&self.bits, f) } } impl font_types::Scalar for EntryFormatFlags { type Raw = ::Raw; fn to_raw(self) -> Self::Raw { self.bits().to_raw() } fn from_raw(raw: Self::Raw) -> Self { let t = ::from_raw(raw); Self::from_bits_truncate(t) } } #[cfg(feature = "experimental_traverse")] impl<'a> From for FieldType<'a> { fn from(src: EntryFormatFlags) -> FieldType<'a> { src.bits().into() } } #[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Copy, bytemuck :: AnyBitPattern)] #[repr(C)] #[repr(packed)] pub struct DesignSpaceSegment { pub axis_tag: BigEndian, pub start: BigEndian, pub end: BigEndian, } impl DesignSpaceSegment { pub fn axis_tag(&self) -> Tag { self.axis_tag.get() } pub fn start(&self) -> Fixed { self.start.get() } pub fn end(&self) -> Fixed { self.end.get() } } impl FixedSize for DesignSpaceSegment { const RAW_BYTE_LEN: usize = Tag::RAW_BYTE_LEN + Fixed::RAW_BYTE_LEN + Fixed::RAW_BYTE_LEN; } #[cfg(feature = "experimental_traverse")] impl<'a> SomeRecord<'a> for DesignSpaceSegment { fn traverse(self, data: FontData<'a>) -> RecordResolver<'a> { RecordResolver { name: "DesignSpaceSegment", get_field: Box::new(move |idx, _data| match idx { 0usize => Some(Field::new("axis_tag", self.axis_tag())), 1usize => Some(Field::new("start", self.start())), 2usize => Some(Field::new("end", self.end())), _ => None, }), data, } } } impl<'a> MinByteRange<'a> for IdStringData<'a> { fn min_byte_range(&self) -> Range { 0..self.id_data_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for IdStringData<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } #[derive(Clone)] pub struct IdStringData<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> IdStringData<'a> { pub const MIN_SIZE: usize = 0; basic_table_impls!(impl_the_methods); pub fn id_data(&self) -> &'a [u8] { let range = self.id_data_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn id_data_byte_range(&self) -> Range { let start = 0; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } #[allow(clippy::absurd_extreme_comparisons)] const _: () = assert!(FontData::default_data_long_enough(IdStringData::MIN_SIZE)); impl Default for IdStringData<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for IdStringData<'a> { fn type_name(&self) -> &str { "IdStringData" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("id_data", self.id_data())), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for IdStringData<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for TableKeyedPatch<'a> { fn min_byte_range(&self) -> Range { 0..self.patch_offsets_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for TableKeyedPatch<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } /// [Table Keyed Patch](https://w3c.github.io/IFT/Overview.html#table-keyed) #[derive(Clone)] pub struct TableKeyedPatch<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> TableKeyedPatch<'a> { pub const MIN_SIZE: usize = (Tag::RAW_BYTE_LEN + u32::RAW_BYTE_LEN + CompatibilityId::RAW_BYTE_LEN + u16::RAW_BYTE_LEN); basic_table_impls!(impl_the_methods); pub fn format(&self) -> Tag { let range = self.format_byte_range(); self.data.read_at(range.start).ok().unwrap() } /// Unique ID that identifies compatible patches. pub fn compatibility_id(&self) -> CompatibilityId { let range = self.compatibility_id_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn patches_count(&self) -> u16 { let range = self.patches_count_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn patch_offsets(&self) -> &'a [BigEndian] { let range = self.patch_offsets_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } /// A dynamically resolving wrapper for [`patch_offsets`][Self::patch_offsets]. pub fn patches(&self) -> ArrayOfOffsets<'a, TablePatch<'a>, Offset32> { let data = self.data; let offsets = self.patch_offsets(); ArrayOfOffsets::new(offsets, data, ()) } pub fn format_byte_range(&self) -> Range { let start = 0; let end = start + Tag::RAW_BYTE_LEN; start..end } pub fn _reserved_byte_range(&self) -> Range { let start = self.format_byte_range().end; let end = start + u32::RAW_BYTE_LEN; start..end } pub fn compatibility_id_byte_range(&self) -> Range { let start = self._reserved_byte_range().end; let end = start + CompatibilityId::RAW_BYTE_LEN; start..end } pub fn patches_count_byte_range(&self) -> Range { let start = self.compatibility_id_byte_range().end; let end = start + u16::RAW_BYTE_LEN; start..end } pub fn patch_offsets_byte_range(&self) -> Range { let patches_count = self.patches_count(); let start = self.patches_count_byte_range().end; let end = start + (transforms::add(patches_count, 1_usize)).saturating_mul(Offset32::RAW_BYTE_LEN); start..end } } const _: () = assert!(FontData::default_data_long_enough( TableKeyedPatch::MIN_SIZE )); impl Default for TableKeyedPatch<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for TableKeyedPatch<'a> { fn type_name(&self) -> &str { "TableKeyedPatch" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("format", self.format())), 1usize => Some(Field::new( "compatibility_id", traversal::FieldType::Unknown, )), 2usize => Some(Field::new("patches_count", self.patches_count())), 3usize => Some(Field::new("patch_offsets", FieldType::from(self.patches()))), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for TableKeyedPatch<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for TablePatch<'a> { fn min_byte_range(&self) -> Range { 0..self.brotli_stream_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for TablePatch<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } /// [TablePatch](https://w3c.github.io/IFT/Overview.html#tablepatch) #[derive(Clone)] pub struct TablePatch<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> TablePatch<'a> { pub const MIN_SIZE: usize = (Tag::RAW_BYTE_LEN + TablePatchFlags::RAW_BYTE_LEN + u32::RAW_BYTE_LEN); basic_table_impls!(impl_the_methods); pub fn tag(&self) -> Tag { let range = self.tag_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn flags(&self) -> TablePatchFlags { let range = self.flags_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn max_uncompressed_length(&self) -> u32 { let range = self.max_uncompressed_length_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn brotli_stream(&self) -> &'a [u8] { let range = self.brotli_stream_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn tag_byte_range(&self) -> Range { let start = 0; let end = start + Tag::RAW_BYTE_LEN; start..end } pub fn flags_byte_range(&self) -> Range { let start = self.tag_byte_range().end; let end = start + TablePatchFlags::RAW_BYTE_LEN; start..end } pub fn max_uncompressed_length_byte_range(&self) -> Range { let start = self.flags_byte_range().end; let end = start + u32::RAW_BYTE_LEN; start..end } pub fn brotli_stream_byte_range(&self) -> Range { let start = self.max_uncompressed_length_byte_range().end; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } const _: () = assert!(FontData::default_data_long_enough(TablePatch::MIN_SIZE)); impl Default for TablePatch<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for TablePatch<'a> { fn type_name(&self) -> &str { "TablePatch" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("tag", self.tag())), 1usize => Some(Field::new("flags", self.flags())), 2usize => Some(Field::new( "max_uncompressed_length", self.max_uncompressed_length(), )), 3usize => Some(Field::new("brotli_stream", self.brotli_stream())), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for TablePatch<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } #[derive(Clone, Copy, Default, PartialEq, Eq, PartialOrd, Ord, Hash, bytemuck :: AnyBitPattern)] #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] #[repr(transparent)] pub struct TablePatchFlags { bits: u8, } impl TablePatchFlags { pub const REPLACE_TABLE: Self = Self { bits: 0b01 }; pub const DROP_TABLE: Self = Self { bits: 0b10 }; } impl TablePatchFlags { /// Returns an empty set of flags. #[inline] pub const fn empty() -> Self { Self { bits: 0 } } /// Returns the set containing all flags. #[inline] pub const fn all() -> Self { Self { bits: Self::REPLACE_TABLE.bits | Self::DROP_TABLE.bits, } } /// Returns the raw value of the flags currently stored. #[inline] pub const fn bits(&self) -> u8 { self.bits } /// Convert from underlying bit representation, unless that /// representation contains bits that do not correspond to a flag. #[inline] pub const fn from_bits(bits: u8) -> Option { if (bits & !Self::all().bits()) == 0 { Some(Self { bits }) } else { None } } /// Convert from underlying bit representation, dropping any bits /// that do not correspond to flags. #[inline] pub const fn from_bits_truncate(bits: u8) -> Self { Self { bits: bits & Self::all().bits, } } /// Returns `true` if no flags are currently stored. #[inline] pub const fn is_empty(&self) -> bool { self.bits() == Self::empty().bits() } /// Returns `true` if there are flags common to both `self` and `other`. #[inline] pub const fn intersects(&self, other: Self) -> bool { !(Self { bits: self.bits & other.bits, }) .is_empty() } /// Returns `true` if all of the flags in `other` are contained within `self`. #[inline] pub const fn contains(&self, other: Self) -> bool { (self.bits & other.bits) == other.bits } /// Inserts the specified flags in-place. #[inline] pub fn insert(&mut self, other: Self) { self.bits |= other.bits; } /// Removes the specified flags in-place. #[inline] pub fn remove(&mut self, other: Self) { self.bits &= !other.bits; } /// Toggles the specified flags in-place. #[inline] pub fn toggle(&mut self, other: Self) { self.bits ^= other.bits; } /// Returns the intersection between the flags in `self` and /// `other`. /// /// Specifically, the returned set contains only the flags which are /// present in *both* `self` *and* `other`. /// /// This is equivalent to using the `&` operator (e.g. /// [`ops::BitAnd`]), as in `flags & other`. /// /// [`ops::BitAnd`]: https://doc.rust-lang.org/std/ops/trait.BitAnd.html #[inline] #[must_use] pub const fn intersection(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } /// Returns the union of between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags which are /// present in *either* `self` *or* `other`, including any which are /// present in both. /// /// This is equivalent to using the `|` operator (e.g. /// [`ops::BitOr`]), as in `flags | other`. /// /// [`ops::BitOr`]: https://doc.rust-lang.org/std/ops/trait.BitOr.html #[inline] #[must_use] pub const fn union(self, other: Self) -> Self { Self { bits: self.bits | other.bits, } } /// Returns the difference between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags present in /// `self`, except for the ones present in `other`. /// /// It is also conceptually equivalent to the "bit-clear" operation: /// `flags & !other` (and this syntax is also supported). /// /// This is equivalent to using the `-` operator (e.g. /// [`ops::Sub`]), as in `flags - other`. /// /// [`ops::Sub`]: https://doc.rust-lang.org/std/ops/trait.Sub.html #[inline] #[must_use] pub const fn difference(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::BitOr for TablePatchFlags { type Output = Self; /// Returns the union of the two sets of flags. #[inline] fn bitor(self, other: TablePatchFlags) -> Self { Self { bits: self.bits | other.bits, } } } impl std::ops::BitOrAssign for TablePatchFlags { /// Adds the set of flags. #[inline] fn bitor_assign(&mut self, other: Self) { self.bits |= other.bits; } } impl std::ops::BitXor for TablePatchFlags { type Output = Self; /// Returns the left flags, but with all the right flags toggled. #[inline] fn bitxor(self, other: Self) -> Self { Self { bits: self.bits ^ other.bits, } } } impl std::ops::BitXorAssign for TablePatchFlags { /// Toggles the set of flags. #[inline] fn bitxor_assign(&mut self, other: Self) { self.bits ^= other.bits; } } impl std::ops::BitAnd for TablePatchFlags { type Output = Self; /// Returns the intersection between the two sets of flags. #[inline] fn bitand(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } } impl std::ops::BitAndAssign for TablePatchFlags { /// Disables all flags disabled in the set. #[inline] fn bitand_assign(&mut self, other: Self) { self.bits &= other.bits; } } impl std::ops::Sub for TablePatchFlags { type Output = Self; /// Returns the set difference of the two sets of flags. #[inline] fn sub(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::SubAssign for TablePatchFlags { /// Disables all flags enabled in the set. #[inline] fn sub_assign(&mut self, other: Self) { self.bits &= !other.bits; } } impl std::ops::Not for TablePatchFlags { type Output = Self; /// Returns the complement of this set of flags. #[inline] fn not(self) -> Self { Self { bits: !self.bits } & Self::all() } } impl std::fmt::Debug for TablePatchFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { let members: &[(&str, Self)] = &[ ("REPLACE_TABLE", Self::REPLACE_TABLE), ("DROP_TABLE", Self::DROP_TABLE), ]; let mut first = true; for (name, value) in members { if self.contains(*value) { if !first { f.write_str(" | ")?; } first = false; f.write_str(name)?; } } if first { f.write_str("(empty)")?; } Ok(()) } } impl std::fmt::Binary for TablePatchFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Binary::fmt(&self.bits, f) } } impl std::fmt::Octal for TablePatchFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Octal::fmt(&self.bits, f) } } impl std::fmt::LowerHex for TablePatchFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::LowerHex::fmt(&self.bits, f) } } impl std::fmt::UpperHex for TablePatchFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::UpperHex::fmt(&self.bits, f) } } impl font_types::Scalar for TablePatchFlags { type Raw = ::Raw; fn to_raw(self) -> Self::Raw { self.bits().to_raw() } fn from_raw(raw: Self::Raw) -> Self { let t = ::from_raw(raw); Self::from_bits_truncate(t) } } #[cfg(feature = "experimental_traverse")] impl<'a> From for FieldType<'a> { fn from(src: TablePatchFlags) -> FieldType<'a> { src.bits().into() } } impl<'a> MinByteRange<'a> for GlyphKeyedPatch<'a> { fn min_byte_range(&self) -> Range { 0..self.brotli_stream_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for GlyphKeyedPatch<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } /// [Glyph Keyed Patch](https://w3c.github.io/IFT/Overview.html#glyph-keyed) #[derive(Clone)] pub struct GlyphKeyedPatch<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> GlyphKeyedPatch<'a> { pub const MIN_SIZE: usize = (Tag::RAW_BYTE_LEN + u32::RAW_BYTE_LEN + GlyphKeyedFlags::RAW_BYTE_LEN + CompatibilityId::RAW_BYTE_LEN + u32::RAW_BYTE_LEN); basic_table_impls!(impl_the_methods); pub fn format(&self) -> Tag { let range = self.format_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn flags(&self) -> GlyphKeyedFlags { let range = self.flags_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn compatibility_id(&self) -> CompatibilityId { let range = self.compatibility_id_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn max_uncompressed_length(&self) -> u32 { let range = self.max_uncompressed_length_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn brotli_stream(&self) -> &'a [u8] { let range = self.brotli_stream_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn format_byte_range(&self) -> Range { let start = 0; let end = start + Tag::RAW_BYTE_LEN; start..end } pub fn _reserved_byte_range(&self) -> Range { let start = self.format_byte_range().end; let end = start + u32::RAW_BYTE_LEN; start..end } pub fn flags_byte_range(&self) -> Range { let start = self._reserved_byte_range().end; let end = start + GlyphKeyedFlags::RAW_BYTE_LEN; start..end } pub fn compatibility_id_byte_range(&self) -> Range { let start = self.flags_byte_range().end; let end = start + CompatibilityId::RAW_BYTE_LEN; start..end } pub fn max_uncompressed_length_byte_range(&self) -> Range { let start = self.compatibility_id_byte_range().end; let end = start + u32::RAW_BYTE_LEN; start..end } pub fn brotli_stream_byte_range(&self) -> Range { let start = self.max_uncompressed_length_byte_range().end; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } const _: () = assert!(FontData::default_data_long_enough( GlyphKeyedPatch::MIN_SIZE )); impl Default for GlyphKeyedPatch<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for GlyphKeyedPatch<'a> { fn type_name(&self) -> &str { "GlyphKeyedPatch" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("format", self.format())), 1usize => Some(Field::new("flags", self.flags())), 2usize => Some(Field::new( "compatibility_id", traversal::FieldType::Unknown, )), 3usize => Some(Field::new( "max_uncompressed_length", self.max_uncompressed_length(), )), 4usize => Some(Field::new("brotli_stream", self.brotli_stream())), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for GlyphKeyedPatch<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } #[derive(Clone, Copy, Default, PartialEq, Eq, PartialOrd, Ord, Hash, bytemuck :: AnyBitPattern)] #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] #[repr(transparent)] pub struct GlyphKeyedFlags { bits: u8, } impl GlyphKeyedFlags { pub const NONE: Self = Self { bits: 0b0 }; pub const WIDE_GLYPH_IDS: Self = Self { bits: 0b1 }; } impl GlyphKeyedFlags { /// Returns an empty set of flags. #[inline] pub const fn empty() -> Self { Self { bits: 0 } } /// Returns the set containing all flags. #[inline] pub const fn all() -> Self { Self { bits: Self::NONE.bits | Self::WIDE_GLYPH_IDS.bits, } } /// Returns the raw value of the flags currently stored. #[inline] pub const fn bits(&self) -> u8 { self.bits } /// Convert from underlying bit representation, unless that /// representation contains bits that do not correspond to a flag. #[inline] pub const fn from_bits(bits: u8) -> Option { if (bits & !Self::all().bits()) == 0 { Some(Self { bits }) } else { None } } /// Convert from underlying bit representation, dropping any bits /// that do not correspond to flags. #[inline] pub const fn from_bits_truncate(bits: u8) -> Self { Self { bits: bits & Self::all().bits, } } /// Returns `true` if no flags are currently stored. #[inline] pub const fn is_empty(&self) -> bool { self.bits() == Self::empty().bits() } /// Returns `true` if there are flags common to both `self` and `other`. #[inline] pub const fn intersects(&self, other: Self) -> bool { !(Self { bits: self.bits & other.bits, }) .is_empty() } /// Returns `true` if all of the flags in `other` are contained within `self`. #[inline] pub const fn contains(&self, other: Self) -> bool { (self.bits & other.bits) == other.bits } /// Inserts the specified flags in-place. #[inline] pub fn insert(&mut self, other: Self) { self.bits |= other.bits; } /// Removes the specified flags in-place. #[inline] pub fn remove(&mut self, other: Self) { self.bits &= !other.bits; } /// Toggles the specified flags in-place. #[inline] pub fn toggle(&mut self, other: Self) { self.bits ^= other.bits; } /// Returns the intersection between the flags in `self` and /// `other`. /// /// Specifically, the returned set contains only the flags which are /// present in *both* `self` *and* `other`. /// /// This is equivalent to using the `&` operator (e.g. /// [`ops::BitAnd`]), as in `flags & other`. /// /// [`ops::BitAnd`]: https://doc.rust-lang.org/std/ops/trait.BitAnd.html #[inline] #[must_use] pub const fn intersection(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } /// Returns the union of between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags which are /// present in *either* `self` *or* `other`, including any which are /// present in both. /// /// This is equivalent to using the `|` operator (e.g. /// [`ops::BitOr`]), as in `flags | other`. /// /// [`ops::BitOr`]: https://doc.rust-lang.org/std/ops/trait.BitOr.html #[inline] #[must_use] pub const fn union(self, other: Self) -> Self { Self { bits: self.bits | other.bits, } } /// Returns the difference between the flags in `self` and `other`. /// /// Specifically, the returned set contains all flags present in /// `self`, except for the ones present in `other`. /// /// It is also conceptually equivalent to the "bit-clear" operation: /// `flags & !other` (and this syntax is also supported). /// /// This is equivalent to using the `-` operator (e.g. /// [`ops::Sub`]), as in `flags - other`. /// /// [`ops::Sub`]: https://doc.rust-lang.org/std/ops/trait.Sub.html #[inline] #[must_use] pub const fn difference(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::BitOr for GlyphKeyedFlags { type Output = Self; /// Returns the union of the two sets of flags. #[inline] fn bitor(self, other: GlyphKeyedFlags) -> Self { Self { bits: self.bits | other.bits, } } } impl std::ops::BitOrAssign for GlyphKeyedFlags { /// Adds the set of flags. #[inline] fn bitor_assign(&mut self, other: Self) { self.bits |= other.bits; } } impl std::ops::BitXor for GlyphKeyedFlags { type Output = Self; /// Returns the left flags, but with all the right flags toggled. #[inline] fn bitxor(self, other: Self) -> Self { Self { bits: self.bits ^ other.bits, } } } impl std::ops::BitXorAssign for GlyphKeyedFlags { /// Toggles the set of flags. #[inline] fn bitxor_assign(&mut self, other: Self) { self.bits ^= other.bits; } } impl std::ops::BitAnd for GlyphKeyedFlags { type Output = Self; /// Returns the intersection between the two sets of flags. #[inline] fn bitand(self, other: Self) -> Self { Self { bits: self.bits & other.bits, } } } impl std::ops::BitAndAssign for GlyphKeyedFlags { /// Disables all flags disabled in the set. #[inline] fn bitand_assign(&mut self, other: Self) { self.bits &= other.bits; } } impl std::ops::Sub for GlyphKeyedFlags { type Output = Self; /// Returns the set difference of the two sets of flags. #[inline] fn sub(self, other: Self) -> Self { Self { bits: self.bits & !other.bits, } } } impl std::ops::SubAssign for GlyphKeyedFlags { /// Disables all flags enabled in the set. #[inline] fn sub_assign(&mut self, other: Self) { self.bits &= !other.bits; } } impl std::ops::Not for GlyphKeyedFlags { type Output = Self; /// Returns the complement of this set of flags. #[inline] fn not(self) -> Self { Self { bits: !self.bits } & Self::all() } } impl std::fmt::Debug for GlyphKeyedFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { let members: &[(&str, Self)] = &[ ("NONE", Self::NONE), ("WIDE_GLYPH_IDS", Self::WIDE_GLYPH_IDS), ]; let mut first = true; for (name, value) in members { if self.contains(*value) { if !first { f.write_str(" | ")?; } first = false; f.write_str(name)?; } } if first { f.write_str("(empty)")?; } Ok(()) } } impl std::fmt::Binary for GlyphKeyedFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Binary::fmt(&self.bits, f) } } impl std::fmt::Octal for GlyphKeyedFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::Octal::fmt(&self.bits, f) } } impl std::fmt::LowerHex for GlyphKeyedFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::LowerHex::fmt(&self.bits, f) } } impl std::fmt::UpperHex for GlyphKeyedFlags { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { std::fmt::UpperHex::fmt(&self.bits, f) } } impl font_types::Scalar for GlyphKeyedFlags { type Raw = ::Raw; fn to_raw(self) -> Self::Raw { self.bits().to_raw() } fn from_raw(raw: Self::Raw) -> Self { let t = ::from_raw(raw); Self::from_bits_truncate(t) } } #[cfg(feature = "experimental_traverse")] impl<'a> From for FieldType<'a> { fn from(src: GlyphKeyedFlags) -> FieldType<'a> { src.bits().into() } } impl<'a> MinByteRange<'a> for GlyphPatches<'a> { fn min_byte_range(&self) -> Range { 0..self.glyph_data_offsets_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl ReadArgs for GlyphPatches<'_> { type Args = GlyphKeyedFlags; } impl<'a> FontReadWithArgs<'a> for GlyphPatches<'a> { fn read_with_args(data: FontData<'a>, args: &GlyphKeyedFlags) -> Result { let flags = *args; #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data, flags }) } } impl<'a> GlyphPatches<'a> { /// A constructor that requires additional arguments. /// /// This type requires some external state in order to be /// parsed. pub fn read(data: FontData<'a>, flags: GlyphKeyedFlags) -> Result { let args = flags; Self::read_with_args(data, &args) } } /// [GlyphPatches](https://w3c.github.io/IFT/Overview.html#glyphpatches) #[derive(Clone)] pub struct GlyphPatches<'a> { data: FontData<'a>, flags: GlyphKeyedFlags, } #[allow(clippy::needless_lifetimes)] impl<'a> GlyphPatches<'a> { pub const MIN_SIZE: usize = (u32::RAW_BYTE_LEN + u8::RAW_BYTE_LEN); basic_table_impls!(impl_the_methods); pub fn glyph_count(&self) -> u32 { let range = self.glyph_count_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn table_count(&self) -> u8 { let range = self.table_count_byte_range(); self.data.read_at(range.start).ok().unwrap() } pub fn glyph_ids(&self) -> ComputedArray<'a, U16Or24> { let range = self.glyph_ids_byte_range(); self.data .read_with_args(range, &self.flags()) .unwrap_or_default() } pub fn tables(&self) -> &'a [BigEndian] { let range = self.tables_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn glyph_data_offsets(&self) -> &'a [BigEndian] { let range = self.glyph_data_offsets_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } /// A dynamically resolving wrapper for [`glyph_data_offsets`][Self::glyph_data_offsets]. pub fn glyph_data(&self) -> ArrayOfOffsets<'a, GlyphData<'a>, Offset32> { let data = self.data; let offsets = self.glyph_data_offsets(); ArrayOfOffsets::new(offsets, data, ()) } pub(crate) fn flags(&self) -> GlyphKeyedFlags { self.flags } pub fn glyph_count_byte_range(&self) -> Range { let start = 0; let end = start + u32::RAW_BYTE_LEN; start..end } pub fn table_count_byte_range(&self) -> Range { let start = self.glyph_count_byte_range().end; let end = start + u8::RAW_BYTE_LEN; start..end } pub fn glyph_ids_byte_range(&self) -> Range { let glyph_count = self.glyph_count(); let start = self.table_count_byte_range().end; let end = start + (transforms::to_usize(glyph_count)) .saturating_mul(::compute_size(&self.flags()).unwrap_or(0)); start..end } pub fn tables_byte_range(&self) -> Range { let table_count = self.table_count(); let start = self.glyph_ids_byte_range().end; let end = start + (transforms::to_usize(table_count)).saturating_mul(Tag::RAW_BYTE_LEN); start..end } pub fn glyph_data_offsets_byte_range(&self) -> Range { let glyph_count = self.glyph_count(); let table_count = self.table_count(); let start = self.tables_byte_range().end; let end = start + (transforms::multiply_add(glyph_count, table_count, 1_usize)) .saturating_mul(Offset32::RAW_BYTE_LEN); start..end } } const _: () = assert!(FontData::default_data_long_enough(GlyphPatches::MIN_SIZE)); impl Default for GlyphPatches<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), flags: Default::default(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for GlyphPatches<'a> { fn type_name(&self) -> &str { "GlyphPatches" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("glyph_count", self.glyph_count())), 1usize => Some(Field::new("table_count", self.table_count())), 2usize => Some(Field::new("glyph_ids", traversal::FieldType::Unknown)), 3usize => Some(Field::new("tables", self.tables())), 4usize => Some(Field::new( "glyph_data_offsets", FieldType::from(self.glyph_data()), )), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for GlyphPatches<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } } impl<'a> MinByteRange<'a> for GlyphData<'a> { fn min_byte_range(&self) -> Range { 0..self.data_byte_range().end } fn min_table_bytes(&self) -> &'a [u8] { let range = self.min_byte_range(); self.data.as_bytes().get(range).unwrap_or_default() } } impl<'a> FontRead<'a> for GlyphData<'a> { fn read(data: FontData<'a>) -> Result { #[allow(clippy::absurd_extreme_comparisons)] if data.len() < Self::MIN_SIZE { return Err(ReadError::OutOfBounds); } Ok(Self { data }) } } #[derive(Clone)] pub struct GlyphData<'a> { data: FontData<'a>, } #[allow(clippy::needless_lifetimes)] impl<'a> GlyphData<'a> { pub const MIN_SIZE: usize = 0; basic_table_impls!(impl_the_methods); pub fn data(&self) -> &'a [u8] { let range = self.data_byte_range(); self.data.read_array(range).ok().unwrap_or_default() } pub fn data_byte_range(&self) -> Range { let start = 0; let end = start + self.data.len().saturating_sub(start) / u8::RAW_BYTE_LEN * u8::RAW_BYTE_LEN; start..end } } #[allow(clippy::absurd_extreme_comparisons)] const _: () = assert!(FontData::default_data_long_enough(GlyphData::MIN_SIZE)); impl Default for GlyphData<'_> { fn default() -> Self { Self { data: FontData::default_table_data(), } } } #[cfg(feature = "experimental_traverse")] impl<'a> SomeTable<'a> for GlyphData<'a> { fn type_name(&self) -> &str { "GlyphData" } fn get_field(&self, idx: usize) -> Option> { match idx { 0usize => Some(Field::new("data", self.data())), _ => None, } } } #[cfg(feature = "experimental_traverse")] #[allow(clippy::needless_lifetimes)] impl<'a> std::fmt::Debug for GlyphData<'a> { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { (self as &dyn SomeTable<'a>).fmt(f) } }