Fix typos

src/filters/shuffle.rs

@@ -76,7 +76,7 @@ where
 /// processing.
 ///
 /// Other implementations have often used Duff's device. Newer compilers, using structured data
-/// types when possible, seems to result in similarily fast processing.
+/// types when possible, seems to result in similarly fast processing.
 pub fn unshuffle_structured<const N: usize>(src: &[u8], dest: &mut [u8]) {
     assert!(src.len() == dest.len());
     assert!(src.len() % N == 0);

src/idx/chunk.rs

@@ -102,7 +102,7 @@ impl<const D: usize> Chunk<D> {
         unsafe { &*(slice.as_ptr() as *const Chunk<D>) }
     }
 
-    /// Reintepret a slice of `Chunk<D>`s to a slice of `u64`. This is efficient, but relies
+    /// Reinterpret a slice of `Chunk<D>`s to a slice of `u64`. This is efficient, but relies
     /// on unsafe code.
     pub fn slice_as_u64s(chunks: &[Chunk<D>]) -> &[ULE] {
         let ptr = chunks.as_ptr();
@@ -122,7 +122,7 @@ impl<const D: usize> Chunk<D> {
         slice
     }
 
-    /// Reintepret a slice of `u64`s to a slice of `Chunk<D>`. This is efficient, but relies
+    /// Reinterpret a slice of `u64`s to a slice of `Chunk<D>`. This is efficient, but relies
     /// on unsafe code.
     pub fn slice_from_u64s(slice: &[ULE]) -> &[Chunk<D>] {
         assert_eq!(

src/reader/dataset.rs

@@ -42,7 +42,7 @@ where
 }
 
 pub trait ReaderExt: Reader {
-    /// Reads values into desitination slice. Returns values read.
+    /// Reads values into destination slice. Returns values read.
     fn values_to<T, E>(&mut self, extents: E, dst: &mut [T]) -> Result<usize, anyhow::Error>
     where
         T: ToMutByteSlice,
@@ -93,7 +93,7 @@ pub trait ParReader {
 }
 
 pub trait ParReaderExt: Reader + ParReader {
-    /// Reads values into desitination slice. Returns values read.
+    /// Reads values into destination slice. Returns values read.
     fn values_to_par<T, E>(&self, extents: E, dst: &mut [T]) -> Result<usize, anyhow::Error>
     where
         T: ToMutByteSlice,