diff options
| author | Louis Pilfold <louis@lpil.uk> | 2024-04-20 13:31:51 +0100 |
|---|---|---|
| committer | Louis Pilfold <louis@lpil.uk> | 2024-04-20 13:31:51 +0100 |
| commit | 00af688138ab8605e774c07d01032d3fc3a07954 (patch) | |
| tree | f4252b1d694561f1726d5abd1dea39156e89d33d | |
| parent | d545f4acf7c66d28f6aa4bebdcee3edf99c99877 (diff) | |
| download | gleam_stdlib-00af688138ab8605e774c07d01032d3fc3a07954.tar.gz gleam_stdlib-00af688138ab8605e774c07d01032d3fc3a07954.zip | |
Add space
| -rw-r--r-- | src/gleam/list.gleam | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/src/gleam/list.gleam b/src/gleam/list.gleam index 9693c05..d53e95e 100644 --- a/src/gleam/list.gleam +++ b/src/gleam/list.gleam @@ -1116,7 +1116,9 @@ pub fn intersperse(list: List(a), with elem: a) -> List(a) { /// // -> Error(Nil) /// ``` /// -@deprecated("Gleam lists are immutable linked lists, so indexing into them is a slow operation that must traverse the list. +@deprecated(" + +Gleam lists are immutable linked lists, so indexing into them is a slow operation that must traverse the list. In functional programming it is very rare to use indexing, so if you are using indexing then a different algorithm or a different data structure is likely more appropriate. ") |