Data.Set.fromDistinctAscListN
Open
feature-request
Set
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
just making a note that such a function (with N = length of second argument) could be useful, since an implementation can use N to determine the shape of the tree in advance, so there's no need to re-balance during construction.
see https://github.com/haskell/containers/issues/890#issuecomment-1380917641
I made some experiments here https://gitlab.imn.htwk-leipzig.de/waldmann/fdaln and the timing data looks very strange...
Contributor guide
Assessment
This issue has not been assessed yet.