Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/font.rs
Original file line number Diff line number Diff line change
Expand Up @@ -410,7 +410,7 @@ impl Font {
self.horizontal_kern_indexed(self.lookup_glyph_index(left), self.lookup_glyph_index(right), px)
}

/// Retrieves the horizontal scaled kerning value for two adjacent glyph indicies.
/// Retrieves the horizontal scaled kerning value for two adjacent glyph indices.
/// # Arguments
///
/// * `left` - The glyph index on the left hand side of the pairing.
Expand Down
2 changes: 1 addition & 1 deletion src/hash.rs
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@
//! not use this hash for cryptographic purproses. Furthermore, this hashing algorithm was
//! not designed to prevent any attacks for determining collisions which could be used to
//! potentially cause quadratic behavior in `HashMap`s. So it is not recommended to expose
//! this hash in places where collissions or DDOS attacks may be a concern.
//! this hash in places where collisions or DDOS attacks may be a concern.

use core::convert::TryInto;
use core::ops::BitXor;
Expand Down
2 changes: 1 addition & 1 deletion src/unicode/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -179,7 +179,7 @@ impl CharacterData {
}
}

/// A heuristic for if the glpyh this was classified from should be rasterized. Missing glyphs,
/// A heuristic for if the glyph this was classified from should be rasterized. Missing glyphs,
/// whitespace, and control characters will return false.
pub fn rasterize(&self) -> bool {
self.bits == 0
Expand Down