On 10/08/2015 10:08 PM, Kagamin wrote:
OK, I thought a little more and... Name: divisible range. It occurred to me that we only need to reverse logic of bidirectional range: while bidirectional range is a pair of ranges that shrink towards each other, divisible range is divided into two ranges that shrink away from each other. The C++ example implies that begin and end must be bidirectional iterators, but that is not really needed as they are used for bounds checks only, ranges have empty for that, so the divisible range can be a normal input range that provides access to its left part that shrinks from back (backward input range?) and provides access to the right part.
Isn't this the same as my suggestion? http://forum.dlang.org/post/[email protected] If not, what is the difference?
