Proposal: Non-allocating way to iterate over a Data.Map: traverseWithKey_
John Lato
jwlato at gmail.com
Fri Jul 5 04:48:00 CEST 2013
Slightly off-topic, but why do you care about the performance of code
compiled with -O0? I can think of at least one valid reason for doing so,
but even for that particular instance I doubt that changing the code is the
proper solution.
Aside from that, I definitely agree that most packages could do a better
job documenting the heap usage of functions.
On Fri, Jul 5, 2013 at 8:41 AM, Ryan Newton <rrnewton at gmail.com> wrote:
>
> After playing a bit with Ryan's benchmark, I no longer think that the
>> order matters much for the total number of allocations. Nor do I believe
>> in first-class vs non-first-class IO actions. All that should matter is
>> how many allocations we can move to the stack. But I haven't yet figured
>> out why exactly different versions differ so drastically in this regard.
>
>
> Yeah, it's all rather different to predict in advance, isn't it?
>
> I tried your alternate foldrWithKey and I saw it heap allocating as well.
>
> Further, -O0 vs. -O2 can make a big difference. It's a little frustrating
> because for dealing efficiently with big data sets, especially in parallel.
> It would be nice to have big-O numbers in the docs for heap allocation as
> well as time cost -- and ones you could trust irrespective of optimize
> level.
>
> By the way, is traverse/traverseWithKey supposed to guarantee a specific
> order? The doc uses this code in the definition:
>
> traverse<http://hackage.haskell.org/packages/archive/base/4.6.0.0/doc/html/Data-Traversable.html#v:traverse> ((k,
> v) -> (,) k $<http://hackage.haskell.org/packages/archive/containers/latest/doc/html/$> f
> k v) (toList<http://hackage.haskell.org/packages/archive/containers/latest/doc/html/Data-Map-Strict.html#v:toList>
> m)
>
> And I thought "toList" didn't guarantee anything (as opposed to
> toAscList)...
>
>
> _______________________________________________
> Libraries mailing list
> Libraries at haskell.org
> http://www.haskell.org/mailman/listinfo/libraries
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/libraries/attachments/20130705/be13b4e8/attachment-0001.htm>
More information about the Libraries
mailing list