On Wednesday, 19 March 2014 at 01:52:07 UTC, bearophile wrote:
nor to contain the most optimized algorithms around.

This D1 code adapted from C code is much more efficient (and in D2 with ranges and TypeTuple-foreach it could become more efficient and much shorter), but I think something like this is overkill for Phobos:

http://dpaste.dzfl.pl/cf97d15ade27

Bye,
bearophile

If all that complexity is nicely encapsulated from the user, then why not put it in some theoretical Phobos package? Are you thinking of highly-optimized functionality that makes a usability tradeoff to be even faster?

Reply via email to