diff options
| author | Louis Pilfold <louis@lpil.uk> | 2022-10-27 22:38:35 +0100 |
|---|---|---|
| committer | Louis Pilfold <louis@lpil.uk> | 2022-10-27 22:38:35 +0100 |
| commit | 1cd95fb58fcddb3bc27e8f8dfeca8d898fbc1806 (patch) | |
| tree | 611b510cd9f2a0b566cc53116db27610507c0f16 | |
| parent | 5cd94fd14ae3d674b679542f56c73247dd7a2e77 (diff) | |
| download | gleam_stdlib-1cd95fb58fcddb3bc27e8f8dfeca8d898fbc1806.tar.gz gleam_stdlib-1cd95fb58fcddb3bc27e8f8dfeca8d898fbc1806.zip | |
Remove note
| -rw-r--r-- | src/gleam/list.gleam | 8 |
1 files changed, 0 insertions, 8 deletions
diff --git a/src/gleam/list.gleam b/src/gleam/list.gleam index 9a875d0..362156b 100644 --- a/src/gleam/list.gleam +++ b/src/gleam/list.gleam @@ -1443,14 +1443,6 @@ pub fn partition( /// [[1, 2], [2, 1]] /// ``` /// -/// Notice, that this function is not tail recursive: -/// -/// The execution limits on permutations are iterations rather than stack size; -/// for a permutation with `10` items a non tail recursive algorithm will at -/// worst built up a stack size of `10` before it goes back to `1` eventually, -/// while a permutation of say `5_000` items will not compute, in reasonable -/// time, despite not exceeding stack size. -/// pub fn permutations(l: List(a)) -> List(List(a)) { case l { [] -> [[]] |