19 Feb
2011
19 Feb
'11
3:04 p.m.
On Sat, Feb 19, 2011 at 11:58 AM, Louis Wasserman
A couple thoughts: size takes O(n). That's just depressing. Really.
This applies to all the container types. We could support O(1) size at the cost of slowing down e.g lookup, insert, and delete a little bit. I haven't measure how much yet. Would it be worth it?
Do you think union, intersection, etc. could be supported? Louis Wasserman
Definitely. I plan to add most of the Data.Map API. We cannot support the ordered operations (such as min) but we should be able to support the rest. Johan