As @MaisaMilena suggested, I'm opening this issue to let you guys know what I plan to work on.
I'll be working on generic versions of
[x] Set
[x] Map
based on sized balanced binary trees, following Stephen Adams' "Implementing Sets Efficiently in a Functional Language" / "Efficient Sets - A Balancing Act". This implementation will be similar to what you can find in Haskell's containers package
As @MaisaMilena suggested, I'm opening this issue to let you guys know what I plan to work on.
I'll be working on generic versions of
based on sized balanced binary trees, following Stephen Adams' "Implementing Sets Efficiently in a Functional Language" / "Efficient Sets - A Balancing Act". This implementation will be similar to what you can find in Haskell's
containers
package