On Fri, Jul 9, 2010 at 2:32 AM, Craig DeForest <[email protected]>wrote:
> Wow, Puneet really stirred us all up (again). Puneet, as David said, your > PDL code is slow because you are using a complicated expression, which > forced PDL to create and destroy intermediate PDLs (every binary operation > has to have a complete temporary PDL allocated and then freed to store its > result!). I attach a variant of your test, with the operation carried out > as much in-place as possible to eliminate extra allocations. PDL runs > almost exactly a factor of 10 faster on my computer than does raw Perl in > this case. > Would this be a problem if we had lazy evaluation implemented? David -- Sent via my carrier pigeon.
_______________________________________________ Perldl mailing list [email protected] http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
