On Wednesday, 7 October 2015 at 14:59:28 UTC, Trass3r wrote:
On Tuesday, 6 October 2015 at 22:39:01 UTC, Ulrich Küttler
wrote:
Yes, this is an explanation. Thanks. So the argument being C++
customs. Now that you mention it, this seems to be the
argument in Eric's D4128 paper, too.
I was hoping for a somewhat deeper reasoning. Out of
curiously, I am still trying to grasp all the implications.
Ranges are hard.
Another one is "odd number of iterators algorithms"
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4128.html#appendix-3-d-ranges-and-algorithmic-complexity
D’s choice of algorithmic basis operations is inherently less
efficient than C++’s.
Hmm. That seems really contrived and/or missing the point. You
would never design a function like that for use with ranges, but
that doesn't mean you're any less able to efficiently find word
boundaries using ranges.
