There's no inherent reason for which SortedRange shouldn't support all kinds of ranges. There are e.g. files that are known to be sorted, and there are algorithms on sorted ranges that don't need random access, such as merge, diff etc.
Comment #1 by bearophile_hugs — 2013-02-28T15:50:26Z
I have converted this to an enhancement request, if that's OK.
Is this ER vaguely related to this question I have asked?
http://forum.dlang.org/thread/[email protected]
If SortedRange supports Input Ranges too, then group(SortedRange) is able to be a SortedRange.
But unfortunately if you apply an array on that lazy SortedRange, you get an array and you lose the SortedRange quality.
In my code I'd like to perform a binary search on the result of a "sort.group.array". Currently I have to use "sort.group.array.assumeSorted".
Comment #2 by github-bugzilla — 2014-05-01T18:03:24Z