This repository was archived by the owner on May 15, 2021. It is now read-only.

Description
I took over rnon's ordered-containers package some while ago and randomly stumbled upon your ordered dict implementation. I was curious whether you were interested in merging the two implementations into one? I think this could make it easier for people to choose, but I'd also happily share maintership (which I didn't do much of anyway for now).
There are a few apparent differences that I see between ordered-containers and elm-ordered-dict.
- Your API is more minimal, while
ordered-containers mirrors the entire Dict API (except for merge which is non-obvious on ordered dicts).
- Your API includes
insertAt which sounds like a good addition to the API.
- You expose a type alias, whereas
ordered-containers uses an opaque type.
- Your implementation looks more efficient (
ordered-containers runs the updater multiple times and checks for member on the list instead of the dict).
- Your implementation remembers the position of elements that are removed with
update. (I will open a separate issue for this.)
I think it sounds pretty straightforward to merge the two implementations into one. There are only minor design and API decisions would need discussion. I am also open to who would own the repository (you, me, a GitHub organization).
What do you think of a merge?