athanclark / sets

Sets in Haskell.
MIT License
0 stars 0 forks source link

UMSet.difference removes all occurences of element #6

Open Fabus1184 opened 1 year ago

Fabus1184 commented 1 year ago

UMSet.difference removes all occurences of all elements present in both sets, but in an "unordered many" set, you would expect it to remove only the present number of occurences. The same applies for delete.

toUMSet [1, 2, 3, 3] `UM.difference` UM.singleton 3
> UMSet {unUMSet = [1,2]} -- expected [1, 2, 3]