Generalized merge API for sets
Open
feature-request
IntSet
Set
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
The idea to add a generalized merge API in the style of the `Data.[Int]Map.Merge.*` modules, but for `Set` and `IntSet`, has most recently come up in the context of the symmetric difference proposal: https://mail.haskell.org/pipermail/libraries/2020-June/030633.html
Contributor guide
Research direction
Start by reading the Data.[Int]Map.Merge.* modules and the linked symmetric difference proposal to understand the existing merge design and the requested Set and IntSet scope. Done means agreeing on and implementing a generalized merge API for both Set and IntSet, with behavior covering the motivating symmetric-difference use case.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100