read_fonts/tables/
loca.rsuse crate::{
read::{FontRead, FontReadWithArgs, ReadArgs, ReadError},
table_provider::TopLevelTable,
FontData,
};
use types::{BigEndian, GlyphId, Tag};
#[cfg(feature = "experimental_traverse")]
use crate::traversal;
#[derive(Clone)]
pub enum Loca<'a> {
Short(&'a [BigEndian<u16>]),
Long(&'a [BigEndian<u32>]),
}
impl TopLevelTable for Loca<'_> {
const TAG: Tag = Tag::new(b"loca");
}
impl<'a> Loca<'a> {
pub fn read(data: FontData<'a>, is_long: bool) -> Result<Self, crate::ReadError> {
Self::read_with_args(data, &is_long)
}
pub fn len(&self) -> usize {
match self {
Loca::Short(data) => data.len().saturating_sub(1),
Loca::Long(data) => data.len().saturating_sub(1),
}
}
pub fn is_empty(&self) -> bool {
self.len() == 0
}
pub fn all_offsets_are_ascending(&self) -> bool {
match self {
Loca::Short(data) => !data
.iter()
.zip(data.iter().skip(1))
.any(|(start, end)| start > end),
Loca::Long(data) => !data
.iter()
.zip(data.iter().skip(1))
.any(|(start, end)| start > end),
}
}
pub fn get_raw(&self, idx: usize) -> Option<u32> {
match self {
Loca::Short(data) => data.get(idx).map(|x| x.get() as u32 * 2),
Loca::Long(data) => data.get(idx).map(|x| x.get()),
}
}
pub fn get_glyf(
&self,
gid: GlyphId,
glyf: &super::glyf::Glyf<'a>,
) -> Result<Option<super::glyf::Glyph<'a>>, ReadError> {
let idx = gid.to_u32() as usize;
let start = self.get_raw(idx).ok_or(ReadError::OutOfBounds)?;
let end = self.get_raw(idx + 1).ok_or(ReadError::OutOfBounds)?;
if start == end {
return Ok(None);
}
let data = glyf
.offset_data()
.slice(start as usize..end as usize)
.ok_or(ReadError::OutOfBounds)?;
match super::glyf::Glyph::read(data) {
Ok(glyph) => Ok(Some(glyph)),
Err(e) => Err(e),
}
}
}
impl ReadArgs for Loca<'_> {
type Args = bool;
}
impl<'a> FontReadWithArgs<'a> for Loca<'a> {
fn read_with_args(data: FontData<'a>, args: &Self::Args) -> Result<Self, crate::ReadError> {
let is_long = *args;
if is_long {
data.read_array(0..data.len()).map(Loca::Long)
} else {
data.read_array(0..data.len()).map(Loca::Short)
}
}
}
#[cfg(feature = "experimental_traverse")]
impl<'a> traversal::SomeTable<'a> for Loca<'a> {
fn type_name(&self) -> &str {
"loca"
}
fn get_field(&self, idx: usize) -> Option<traversal::Field<'a>> {
match idx {
0usize => Some(traversal::Field::new("offsets", self.clone())),
_ => None,
}
}
}
#[cfg(feature = "experimental_traverse")]
impl<'a> traversal::SomeArray<'a> for Loca<'a> {
fn len(&self) -> usize {
self.len()
}
fn get(&self, idx: usize) -> Option<traversal::FieldType<'a>> {
self.get_raw(idx).map(|off| off.into())
}
fn type_name(&self) -> &str {
"Offset32"
}
}
#[cfg(feature = "experimental_traverse")]
impl<'a> std::fmt::Debug for Loca<'a> {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
(self as &dyn traversal::SomeTable<'a>).fmt(f)
}
}
#[cfg(test)]
mod tests {
use types::Scalar;
use crate::test_helpers::BeBuffer;
use super::Loca;
fn to_loca_bytes<T: Scalar + Copy>(values: &[T]) -> (BeBuffer, bool) {
let value_num_bytes = std::mem::size_of::<T>();
let is_long = if value_num_bytes == 2 {
false
} else if value_num_bytes == 4 {
true
} else {
panic!("invalid integer type must be u32 or u16")
};
let mut buffer = BeBuffer::default();
for v in values {
buffer = buffer.push(*v);
}
(buffer, is_long)
}
fn check_loca_sorting(values: &[u16], is_sorted: bool) {
let (bytes, is_long) = to_loca_bytes(values);
let loca = Loca::read(bytes.font_data(), is_long).unwrap();
assert_eq!(loca.all_offsets_are_ascending(), is_sorted);
let u32_values: Vec<u32> = values.iter().map(|v| *v as u32).collect();
let (bytes, is_long) = to_loca_bytes(&u32_values);
let loca = Loca::read(bytes.font_data(), is_long).unwrap();
assert_eq!(loca.all_offsets_are_ascending(), is_sorted);
}
#[test]
fn all_offsets_are_ascending() {
let empty: &[u16] = &[];
check_loca_sorting(empty, true);
check_loca_sorting(&[0], true);
check_loca_sorting(&[0, 0], true);
check_loca_sorting(&[0, 1], true);
check_loca_sorting(&[1, 2, 2, 3, 7], true);
check_loca_sorting(&[1, 0], false);
check_loca_sorting(&[1, 3, 2], false);
check_loca_sorting(&[2, 1, 3], false);
check_loca_sorting(&[1, 2, 3, 2, 7], false);
}
}