On 01/14/2014 11:09 AM, Tobias Pankrath wrote:
On Tuesday, 14 January 2014 at 09:55:42 UTC, bearophile wrote:
As D programs use more and more algorithm UFCS chains, D compilers
will need to optimize that kind of code better, adding specific
high-level and mid-level optimizations (rewrite rules, deforestations,
etc).
You came up with deforestation several times now, so I digged up this
paper from wikipedia
http://homepages.inf.ed.ac.uk/wadler/papers/deforest/deforest.ps
I skimmed it and it seems that the advantage is elimination of
intermediate data structures (i.e. lists), which is std.algorithm
achieves by design. Could you elaborate how deforestation might apply to
std.algorithm?
I guess it would be about eliminating intermediate arrays.
