[chore] Fix some typos (#2005)

Author: cmyr

.typos.toml

@@ -40,6 +40,8 @@ ND = "ND"
 
 # Match Inside a Word - Case Insensitive
 [default.extend-words]
+# 'bimap' as in bidirectional map (IncBiMap), not 'bitmap'
+bimap = "bimap"
 loca = "loca"
 wdth = "wdth"
 ot = "ot"

font-types/src/tag.rs

@@ -99,7 +99,7 @@ impl Tag {
 
     /// Check that the tag conforms with the spec.
     ///
-    /// This is intended for use during things like santization or lint passes
+    /// This is intended for use during things like sanitization or lint passes
     /// on existing fonts; if you are creating a new tag, you should prefer
     /// [`Tag::new_checked`].
     ///

read-fonts/src/read.rs

@@ -61,7 +61,7 @@ pub trait Format<T> {
 
 /// A trait for tables that contain offsets to subtables of heterogeneous types.
 ///
-/// The type of the subtable is determiend by an inline discriminant; this trait
+/// The type of the subtable is determined by an inline discriminant; this trait
 /// reads that discriminant.
 pub trait Discriminant {
     /// Read the discriminant for this table.

skera/src/layout.rs

@@ -1754,14 +1754,14 @@ impl<'a> SubsetTable<'a> for FeatureTableSubstitutionRecord {
             return Err(SerializeErrorFlags::SERIALIZE_ERROR_EMPTY);
         }
         let (feature_index_map, c, font_data) = args;
-        let Some(new_feature_indx) = feature_index_map.get(&self.feature_index()) else {
+        let Some(new_feature_index) = feature_index_map.get(&self.feature_index()) else {
             return Err(SerializeErrorFlags::SERIALIZE_ERROR_EMPTY);
         };
 
         let alternate_feature = self
             .alternate_feature(font_data)
             .map_err(|_| s.set_err(SerializeErrorFlags::SERIALIZE_ERROR_READ_ERROR))?;
-        s.embed(*new_feature_indx)?;
+        s.embed(*new_feature_index)?;
 
         let feature_offset_pos = s.embed(0_u32)?;
         Offset32::serialize_subset(&alternate_feature, s, plan, c, feature_offset_pos)

skera/src/serialize.rs

@@ -1352,7 +1352,7 @@ mod test {
             assert_eq!(s.packed_map.hash_table.len(), 1);
             // share=true, duplicate object won't be added into packed vector
             assert_eq!(s.packed.len(), 1);
-            //check to make sure head is rewinded
+            //check to make sure head is rewound
             assert_eq!(s.head, 3);
             assert_eq!(s.tail, 97);
 
@@ -1365,7 +1365,7 @@ mod test {
             assert_eq!(s.pop_pack(true), Some(1));
             assert_eq!(s.packed_map.hash_table.len(), 2);
             assert_eq!(s.packed.len(), 2);
-            //check to make sure head is rewinded
+            //check to make sure head is rewound
             assert_eq!(s.head, 3);
             //check that tail is updated
             assert_eq!(s.tail, 95);
@@ -1383,7 +1383,7 @@ mod test {
             assert_eq!(s.packed_map.hash_table.len(), 2);
             // share=true, duplicate object will be added into the packed vector
             assert_eq!(s.packed.len(), 3);
-            //check to make sure head is rewinded
+            //check to make sure head is rewound
             assert_eq!(s.head, 3);
             assert_eq!(s.tail, 92);
         }
@@ -1411,7 +1411,7 @@ mod test {
             assert_eq!(s.pop_pack(true), Some(3));
             assert_eq!(s.packed_map.hash_table.len(), 3);
             assert_eq!(s.packed.len(), 4);
-            //check to make sure head is rewinded
+            //check to make sure head is rewound
             assert_eq!(s.head, 3);
             assert_eq!(s.tail, 89);
 
@@ -1433,7 +1433,7 @@ mod test {
                 objidx: 1,
             };
             obj.virtual_links.push(link);
-            // check that virtual links doesn't affect euqality
+            // check that virtual links doesn't affect equality
             assert_eq!(s.pop_pack(true), Some(3));
             assert_eq!(s.packed_map.hash_table.len(), 3);
             assert_eq!(s.packed.len(), 4);
@@ -1471,7 +1471,7 @@ mod test {
             assert_eq!(s.pop_pack(true), Some(4));
             assert_eq!(s.packed_map.hash_table.len(), 4);
             assert_eq!(s.packed.len(), 5);
-            //check to make sure head is rewinded
+            //check to make sure head is rewound
             assert_eq!(s.head, 3);
             assert_eq!(s.tail, 86);
 
@@ -1498,7 +1498,7 @@ mod test {
             // obj is added into both hash_table and packed vector
             assert_eq!(s.packed_map.hash_table.len(), 5);
             assert_eq!(s.packed.len(), 6);
-            //check to make sure head is rewinded
+            //check to make sure head is rewound
             assert_eq!(s.head, 3);
             assert_eq!(s.tail, 83);
         }
@@ -1531,7 +1531,7 @@ mod test {
         assert_eq!(s.head, 6);
         assert_eq!(s.tail, 97);
         s.pop_discard();
-        //check that head is rewinded
+        //check that head is rewound
         assert_eq!(s.head, 3);
         assert_eq!(s.tail, 97);
         //discarded obj is not added into packed vector

write-fonts/src/tables/glyf.rs

@@ -46,7 +46,7 @@ pub enum Glyph {
 ///
 /// This should be the minimum rectangle which fully encloses the glyph outline;
 /// importantly this can only be determined by computing the individual Bezier
-/// segments, and cannot be determiend from points alone.
+/// segments, and cannot be determined from points alone.
 #[derive(Clone, Copy, Debug, Default, PartialEq, Eq, Hash)]
 pub struct Bbox {
     pub x_min: i16,

write-fonts/src/tables/gvar.rs

@@ -905,7 +905,7 @@ mod tests {
     #[test]
     fn compute_shared_points_is_deterministic() {
         // The deltas for glyph "etatonos.sc.ss06" in GoogleSans-VF are such that the
-        // TupleVariationStore's shared set of point numbers could potentionally be
+        // TupleVariationStore's shared set of point numbers could potentially be
         // computed as either PackedPointNumbers::All or PackedPointNumbers::Some([1, 3])
         // without affecting the size (or correctness) of the serialized data.
         // However we want to ensure that the result is deterministic, and doesn't