Red-Black tree with customized sorting

[Ivan Kazmenko]

On Monday, 13 May 2013 at 15:26:12 UTC, Steven Schveighoffer 
wrote:
> On Sun, 12 May 2013 17:09:56 -0400, Paolo Bolzoni 
> <paolo.bolzoni at g.invalid> wrote:
>
>> What is wrong? How I am supposed to pass less address to do 
>> the comparison?
>
> I think it is this issue:
>
> http://d.puremagic.com/issues/show_bug.cgi?id=9513
>
> I am going to fix this, soon.

Seems so.  For now, you can cheat the too strict "binaryFun" 
condition in this way:

bool less (T) (auto ref T lhs, auto ref T rhs)

As I understand it, this creates one instance (without refs) for 
the "binaryFun" condition, while another (with refs) is actually 
used.