I'd like to complain about that, too ;)<div><br clear="all">Louis Wasserman<br><a href="mailto:wasserman.louis@gmail.com">wasserman.louis@gmail.com</a><br><a href="http://profiles.google.com/wasserman.louis">http://profiles.google.com/wasserman.louis</a><br>
<br><br><div class="gmail_quote">On Sat, Feb 19, 2011 at 9:02 PM, Edward Kmett <span dir="ltr"><<a href="mailto:ekmett@gmail.com">ekmett@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div class="gmail_quote"><div><div></div><div class="h5">On Sat, Feb 19, 2011 at 7:27 PM, Sterling Clover <span dir="ltr"><<a href="mailto:s.clover@gmail.com" target="_blank">s.clover@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div>On Sat, Feb 19, 2011 at 3:04 PM, Johan Tibell <<a href="mailto:johan.tibell@gmail.com" target="_blank">johan.tibell@gmail.com</a>> wrote:<br>
> On Sat, Feb 19, 2011 at 11:58 AM, Louis Wasserman<br>
> <<a href="mailto:wasserman.louis@gmail.com" target="_blank">wasserman.louis@gmail.com</a>> wrote:<br>
>> A couple thoughts:<br>
>> size takes O(n). That's just depressing. Really.<br>
><br>
> This applies to all the container types. We could support O(1) size at<br>
> the cost of slowing down e.g lookup, insert, and delete a little bit.<br>
> I haven't measure how much yet. Would it be worth it?<br>
<br>
</div>Getting a bit picky, but for the record, Data.Map and Data.Sequence<br>
provide O(1) size, and Data.HashTable I believe stores the information<br>
but doesn't expose it from its tiny API. That's not an argument either<br>
way for what a HashMap should do, however :-)<br></blockquote><div><br></div></div></div><div>NB: Data.IntMap, which Data.HashMap is based on, actually only provides O(n) size.</div><div><br></div><font color="#888888"><div>
-Edward</div></font></div>
</blockquote></div><br></div>