Joel Mueller

@Wixred just to be clear, when indexing in to a stack, would you expect `stack[0]` to return the same element that would be returned by `stack.Peek()` (the most-recently-added element) and...

I'm not necessarily opposed to making the class indexable, I'm just not sure of the semantics. Internally items are stored with the most-recently-added item as the last item in the...

Sorry for the delayed response. Here's what I'm currently seeing without your suggested optimization, run from the "core3" branch: | Method | Runtime | N | Mean | Error |...

Sounds good, thanks guys. Once the final .NET Core 3.0 comes out I'll re-run benchmarks and publish the Index/Range supporting version targeting Standard 2.0 and 2.1 with a major version...

If you review the source code for MemoryPool, it's just a wrapper around ArrayPool that implements IDisposable to allow you to return arrays to the pool with the using pattern....

I had originally converted PooledList over to work in terms of Span. I thought it would be just as fast, and with much simpler code, as the Span API is...

I mention 4.6.1 because that is the lowest version of .NET Framework that supports .NET Standard 2.0. If Collections.Pooled supports .NET Standard 2.0, it needs to work as well as...

I've got some preliminary code going in a branch. For AddRange, what would you expect to happen to the CollectionChanged events that would normally fire for each item added? *...

Unless things have changed since 2009, it seems like the main motivation for having AddRange is to avoid firing an event for each item added. However, at least at the...

@Symbai That's great that it's working for you! However, I'm going to re-open this for now, as I haven't ported over any of the unit tests or benchmarks for Collection/ObservableCollection,...