On 06/23/2010 10:22 PM, David Simcha wrote:
Should we just redefine random access ranges such that they must either have a length or be infinite?
I think that's reasonable. If a finite range didn't define length, it would be easy to find it in O(log n) by binary search.
I'm trying to improve the unit tests in std.range in preparation for some bug fixing and consistency improvements and I'm finding the mother lode of bugs in the process (which I'll file or fix relatively soon).
Congrats to you and everybody else for the great work. Phobos is really starting to come together.
Andrei _______________________________________________ phobos mailing list [email protected] http://lists.puremagic.com/mailman/listinfo/phobos
