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

README: update function comment

This commit is contained in:
Oystein Kristoffer Tveit 2024-09-27 21:59:11 +02:00
parent 842f60715b
commit 2236fec907
Signed by: oysteikt
GPG Key ID: 9F2F7D8250F35146
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -18,7 +18,7 @@ solution that could be applied to other functions as well, without too much over
| Name | Expected complexity | Comment | | Name | Expected complexity | Comment |
|------------------|---------------------|---------| |------------------|---------------------|---------|
| `hasAttr` | O(1) | this is the only real kind of lookup table we have with low overhead. I need to verify that it is actually amortized O(1) | | `hasAttr` | O(1) | this is the only real kind of lookup table we have with low overhead. I need to verify that it is actually amortized O(1) |
| `catAttrs` | O(n) | could this fix the O(n^2) fold collection resizing problem? | | `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? |
| `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? |