On 6/23/2010 11:36 PM, Andrei Alexandrescu wrote:
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 guess you're assuming some method of signaling on out of bounds
access, such as throwing an exception?
_______________________________________________
phobos mailing list
[email protected]
http://lists.puremagic.com/mailman/listinfo/phobos
