Data.Sequence time bounds: emphasize (stronger) that they are amortized?
Open
docs
Seq
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
All time bounds are amortized (as in the Hinze/Paterson paper) but API docs mention that word only once "An amortized running time is given for each operation". A casual reader might miss that, especially when looking up just one function, and not reading the full document?
Contributor guide
Assessment
This issue has not been assessed yet.