aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJoseph T. Lyons <JosephTLyons@gmail.com>2024-10-20 03:13:16 -0400
committerLouis Pilfold <louis@lpil.uk>2024-10-20 11:16:29 +0100
commit5d7033c845469f9c70a6b877670319ae27c7b51a (patch)
tree55a3889bbedfee1709f2f0ba6991d11661d0eaf3
parentb277e58babd981112bf649f4e7f8a093937cfcbf (diff)
downloadgleam_stdlib-5d7033c845469f9c70a6b877670319ae27c7b51a.tar.gz
gleam_stdlib-5d7033c845469f9c70a6b877670319ae27c7b51a.zip
Fix comment typos
-rw-r--r--src/gleam/list.gleam4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/gleam/list.gleam b/src/gleam/list.gleam
index ea616de..f0248e7 100644
--- a/src/gleam/list.gleam
+++ b/src/gleam/list.gleam
@@ -1241,7 +1241,7 @@ type Sorting {
/// - `direction` is the growing direction of the slice being grown, it could
/// either be ascending or strictly descending
/// - `prev` is the previous element that needs to be added to the growing slice
-/// it is carried around to check wether we have to keep growing the current
+/// it is carried around to check whether we have to keep growing the current
/// slice or not
/// - `acc` is the accumulator containing the slices sorted in ascending order
///
@@ -1272,7 +1272,7 @@ fn sequences(
// In case the new element respects the ordering of the growing
// sequence, then we just keep growing it.
// Notice how a growing sequence is weakly growing (that is it can have
- // consecutive equal items) while a descreasing sequence is strictly
+ // consecutive equal items) while a decreasing sequence is strictly
// decreasing (no consecutive equal items), this is needed to make the
// algorithm stable!
order.Gt, Descending | order.Lt, Ascending | order.Eq, Ascending ->