> On 9. Aug 2017, at 06:51, Taylor Swift via swift-users 
> <swift-us...@swift.org> wrote:
> It’s possible to implement a classic red-black tree in Swift that performs 
> better than a sorted Array, down to about n = 1,500 items, not n = 100,000 
> items as it claims. (Actually, heap allocators these days are good enough 
> that performance is on par with Array all the way down to n = 1.)

I’m not sure how that can be because you lose locality (but that probably 
depends on what operations “perform” includes). And IMO, heap allocations 
remain (and will remain) a bottleneck for small allocations.

swift-evolution mailing list

Reply via email to