From c6d6a6decb0d4cc43d38dac5ff634527b48edcc2 Mon Sep 17 00:00:00 2001
From: mo8it <mo8it@proton.me>
Date: Sat, 17 Feb 2024 23:49:01 +0100
Subject: [PATCH] Fix typos

---
 src/errors.rs   | 2 +-
 src/sequence.rs | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/errors.rs b/src/errors.rs
index d0c57c3..302116f 100644
--- a/src/errors.rs
+++ b/src/errors.rs
@@ -23,7 +23,7 @@ impl fmt::Display for ErrorPosition {
     }
 }
 
-/// The type of error that occured during file parsing
+/// The type of error that occurred during file parsing
 #[derive(Clone, Debug, PartialEq)]
 pub enum ParseErrorKind {
     /// An error happened during file/stream input/output
diff --git a/src/sequence.rs b/src/sequence.rs
index dc38f9a..e5aa4c1 100644
--- a/src/sequence.rs
+++ b/src/sequence.rs
@@ -117,7 +117,7 @@ pub fn complement(n: u8) -> u8 {
 }
 
 /// Taking in a sequence string, return the canonical form of the sequence
-/// (e.g. the lexigraphically lowest of either the original sequence or its
+/// (e.g. the lexicographically lowest of either the original sequence or its
 /// reverse complement)
 pub fn canonical(seq: &[u8]) -> Cow<[u8]> {
     let mut buf: Vec<u8> = Vec::with_capacity(seq.len());
@@ -145,7 +145,7 @@ pub fn canonical(seq: &[u8]) -> Cow<[u8]> {
     }
 }
 
-/// Find the lexigraphically smallest substring of `seq` of length `length`
+/// Find the lexicographically smallest substring of `seq` of length `length`
 ///
 /// There's probably a faster algorithm for this somewhere...
 pub fn minimizer(seq: &[u8], length: usize) -> Cow<[u8]> {