What features of D are you using now which you thought you'd never goint to use?

[Timon Gehr]

On 06/23/2013 11:20 PM, Timon Gehr wrote:
> On 06/23/2013 01:34 PM, monarch_dodra wrote:
>> ...
>>
>> But as soon as you need an algorithm that actually *handles* ranges:
>> swaps them, merges them, searches in them and splices them, then things
>> get hairy.
>>
>> For example, try implementing a sort (either merge or q) with a
>> non-sliceable range... very very hard...
>
> Challenge accepted.
>
> http://dpaste.dzfl.pl/4407c36f

(stable merge sort, comparison function as template argument: 
http://dpaste.dzfl.pl/9bf21773)