sorting and stability
paul.sandoz at oracle.com
Thu Mar 28 09:12:25 PDT 2013
On Mar 27, 2013, at 5:05 PM, Doug Lea <dl at cs.oswego.edu> wrote:
>> Algorithmically, the cost of this might on average be zero.
>> Even though it does add cost in general, it can be made
>> immeasurably small when there are no duplicate keys, and
>> as fast as any other strategy when there are duplicates.
> This still holds for versions ready enough to tentatively
> commit. Paul will help integrate into lambda repo within
> a few days.
Tis now integrated.
More information about the lambda-libs-spec-experts