23 Oct
2008
23 Oct
'08
1:20 p.m.
Bart Massey wrote:
Hmm, this reminds us that Data.Set really needs insertMember :: Ord a => a -> Set a -> (Bool, Set a) so that we don't need to traverse the tree twice each time. And the same for Data.IntSet, of course. Analogous to existing things like Data.Set.deleteFindMin Data.Map.insertLookupWithKey Hasn't someone made this obvious proposal before?