diff options
author | Tom Kenny <tom@twome.name> | 2024-01-21 14:38:03 +0800 |
---|---|---|
committer | Louis Pilfold <louis@lpil.uk> | 2024-01-21 10:19:36 +0000 |
commit | c4cace1654989d3e1bbbf97040fb69c7f6bc1ca6 (patch) | |
tree | b290dabb8c87d4303dee5868545b4ea846eb571e /src | |
parent | 88a7eb9c161d0d3678cdb4d6226df7a1dff9a055 (diff) | |
download | tour-c4cace1654989d3e1bbbf97040fb69c7f6bc1ca6.tar.gz tour-c4cace1654989d3e1bbbf97040fb69c7f6bc1ca6.zip |
Remove duplicate "but" in Lesson 14
Diffstat (limited to 'src')
-rw-r--r-- | src/content/chapter0_basics/lesson14_lists/text.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/content/chapter0_basics/lesson14_lists/text.html b/src/content/chapter0_basics/lesson14_lists/text.html index dd07cd7..c29758a 100644 --- a/src/content/chapter0_basics/lesson14_lists/text.html +++ b/src/content/chapter0_basics/lesson14_lists/text.html @@ -14,6 +14,6 @@ <p> Counting the length of a list or getting elements from other positions in the list is expensive and rarely done. It is rare to write algorithms that index - into sequences in Gleam, but but when they are written a list is not the right + into sequences in Gleam, but when they are written a list is not the right choice of data structure. </p> |