Keeping a dynamic sorted range

[Andrei Alexandrescu via Digitalmars-d]

On 11/10/14 5:06 AM, Vladimir Panteleev wrote:
> On Monday, 10 November 2014 at 02:19:33 UTC, Andrei Alexandrescu wrote:
>> One possibility is a function sortedChain that takes two or more
>> sorted ranges and returns a lazy sorted range. -- Andrei
>
> setUnion?
>
> http://dlang.org/phobos/std_algorithm.html#.setUnion

That's right! -- Andrei