Keeping a dynamic sorted range

[Sean Kelly via Digitalmars-d]

On Monday, 10 November 2014 at 19:59:02 UTC, Andrei Alexandrescu 
wrote:
> On 11/10/14 7:42 AM, Sean Kelly wrote:
>> To address your question a bit more fully, it seems like this 
>> is
>> something the range proposal for C++ is better suited for. Then
>> appending would just be a special case of inserting at a 
>> specific
>> position. I've got to say, if I had the time I'd implement the 
>> C++
>> ranges in D. They seem more powerful and easier to use.
>
> What would be their advantages?

The ability to denote a position within a range is an important 
facet of some algorithms, such as rotate.  For example, see:

https://ericniebler.github.io/std/wg21/D4128.html#iterator-operations-are-primitive