On Wed, Aug 9, 2017 at 5:54 AM, Daniel Vollmer via swift-evolution <
swift-evolution@swift.org> wrote:
>
> > 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 s
> On 9. Aug 2017, at 06:51, Taylor Swift via swift-users
> 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 en
The benefit that standard library containers have over containers from other
modules is that they're optimized as if they were part of your own module, so
you can get the same thing by including the collection classes in your own
executable instead of linking with the module. It's my understandi
On Wed, Aug 9, 2017 at 1:50 AM, Rob Mayoff wrote:
> On Tue, Aug 8, 2017 at 11:51 PM, Taylor Swift via swift-users <
> swift-us...@swift.org> wrote:
>
>>
>>
>> On Wed, Aug 9, 2017 at 12:29 AM, Félix Cloutier via swift-evolution <
>> swift-evolution@swift.org> wrote:
>>
>>> Yes, exactly. An Array i
On Tue, Aug 8, 2017 at 11:51 PM, Taylor Swift via swift-users <
swift-us...@swift.org> wrote:
>
>
> On Wed, Aug 9, 2017 at 12:29 AM, Félix Cloutier via swift-evolution <
> swift-evolution@swift.org> wrote:
>
>> Yes, exactly. An Array is a struct wrapper for a reference type
>> representing storage
