Profiling graph library

John Colvin john.loughran.colvin at gmail.com
Tue Jul 30 16:05:19 PDT 2013


On Tuesday, 30 July 2013 at 23:02:40 UTC, bearophile wrote:
> Sometimes you can keep memory allocation low, performance 
> almost acceptable, and code easy to read using a pre-allocated 
> scratch space plus using map() and copy() from std.algorithm.

Any chance of some nice examples of this?


More information about the Digitalmars-d-learn mailing list