aboutsummaryrefslogtreecommitdiff
path: root/src/content/chapter0_basics/lesson13_lists/text.html
diff options
context:
space:
mode:
authorLouis Pilfold <louis@lpil.uk>2023-12-21 14:03:41 +0000
committerLouis Pilfold <louis@lpil.uk>2023-12-21 14:03:41 +0000
commit4efb34bd728732101432843ed0bfbeb971272287 (patch)
tree71b3b767c417809d92280cec64424c31c9a475be /src/content/chapter0_basics/lesson13_lists/text.html
parent2a6ae1fa5408247c95bf4a7d59e5038342a2a125 (diff)
downloadtour-4efb34bd728732101432843ed0bfbeb971272287.tar.gz
tour-4efb34bd728732101432843ed0bfbeb971272287.zip
Add chapters
Diffstat (limited to 'src/content/chapter0_basics/lesson13_lists/text.html')
-rw-r--r--src/content/chapter0_basics/lesson13_lists/text.html19
1 files changed, 19 insertions, 0 deletions
diff --git a/src/content/chapter0_basics/lesson13_lists/text.html b/src/content/chapter0_basics/lesson13_lists/text.html
new file mode 100644
index 0000000..dd07cd7
--- /dev/null
+++ b/src/content/chapter0_basics/lesson13_lists/text.html
@@ -0,0 +1,19 @@
+<p>
+ Lists are ordered collections of values.
+</p>
+<p>
+ <code>List</code> is a generic type, having a type parameter
+ for the type of values it contains. A list of ints has the type
+ <code>List(Int)</code>, and a list of strings has the type
+ <code>List(String)</code>.
+</p>
+<p>
+ Lists are immutable single-linked lists, meaning they are very efficient to
+ add and remove elements from the front of the list.
+</p>
+<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
+ choice of data structure.
+</p>