sorting and stability
josh at bloch.us
Thu Mar 28 09:39:17 PDT 2013
Good. I like stable sorts.
On Thu, Mar 28, 2013 at 9:12 AM, Paul Sandoz <paul.sandoz at oracle.com> wrote:
> 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.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the lambda-libs-spec-experts