oysteikt/nixpkgs-lib-profiling
oysteikt
/
nixpkgs-lib-profiling
0
1
Fork 0
Code Issues Pull Requests Releases Activity

README: add `foldl'` to the function table

This commit is contained in:
Oystein Kristoffer Tveit 2024-10-29 00:54:40 +01:00
parent d3213f076e
commit 9bf766f74a
Signed by: oysteikt
GPG Key ID: 9F2F7D8250F35146
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
README.md
View File

@ -21,6 +21,7 @@ solution that could be applied to other functions as well, without too much over
| `catAttrs` | O(n) | `filter`-like, [attrs] -> Attrs. Can remove many items at once, as well as convert from list to attrs | | `catAttrs` | O(n) | `filter`-like, [attrs] -> Attrs. Can remove many items at once, as well as convert from list to attrs |
| `concatMap` | O(n * f) | could this be used with attr lookups to fix the O(n^2) fold collection resizing problem? | | `concatMap` | O(n * f) | could this be used with attr lookups to fix the O(n^2) fold collection resizing problem? |
| `concatLists` | O(n) | could this be used with attr lookups to fix the O(n^2) fold collection resizing problem? | | `concatLists` | O(n) | could this be used with attr lookups to fix the O(n^2) fold collection resizing problem? |
| `foldl'` | O(n * f) | could be used to implement tail recursion |
| `filter` | O(n * f) | could potentially remove many items at once without realloc? | | `filter` | O(n * f) | could potentially remove many items at once without realloc? |
| `genList` | O(n * f) | can seemingly allocate an arbitrarily sized list? | | `genList` | O(n * f) | can seemingly allocate an arbitrarily sized list? |
| `intersectAttrs` | O(n log m) (known) | could be used as a shorthand for binary merge? | | `intersectAttrs` | O(n log m) (known) | could be used as a shorthand for binary merge? |