Issues

ExceptWith / IntersectWith / SymmetricExceptWith on InsertionOrderSet and OrderedSet, and ContiguousSet.ExceptWith, are O(n·m): excepting 40k items from an 80k set takes 3–6 s

ktsu-dev/Containers#108 · opened

on Oct 7, 2026

1

OrderedCollection.IndexOf(x) returns the index of a different element with the same key, so RemoveAt(IndexOf(x)) removes the wrong item

ktsu-dev/Containers#107 · opened

on Oct 6, 2026

1

SpscRingBuffer and DelayLine have no benchmarks, though the benchmarking plan requires one per container and marks coverage as complete

ktsu-dev/Containers#106 · opened

on Oct 6, 2026

1

OrderedMap/InsertionOrderMap.TryGetValue lose [MaybeNullWhen(false)] in the netstandard builds, so .NET Framework/Unity consumers get no null warning after a miss

ktsu-dev/Containers#105 · opened

on Oct 6, 2026

1

ContiguousCollection<T> isn't an IList<T> despite having every member, so it can't be passed as IList<T> and LINQ ElementAt/Last scan the whole collection

ktsu-dev/Containers#104 · opened

on Oct 6, 2026

1

ContiguousMap.GetKeysSpan/GetValuesSpan allocate and copy the whole map on every call, making indexed loops O(n²)

ktsu-dev/Containers#102 · opened

on Oct 6, 2026

1

Evicting oldest-first from InsertionOrderMap/ContiguousMap is quadratic: emptying a 40k map takes ~3.6 s

ktsu-dev/Containers#101 · opened

on Oct 6, 2026

1

RingBuffer.Resample on a part-filled buffer stretches the samples across the whole new length, inventing data and marking the buffer full

ktsu-dev/Containers#98 · opened

on Oct 5, 2026

1

ContiguousMap.TryGetValue lacks [MaybeNullWhen(false)], so using `value` after a miss compiles with no warning and throws NullReferenceException

ktsu-dev/Containers#96 · opened

on Sep 29, 2026

1

DelayLine.Process with an out-of-range delay throws after writing the sample, so a rejected call still shifts every later tap by one sample

ktsu-dev/Containers#95 · opened

on Sep 29, 2026

1

DelayLine.ReadInterpolated(Capacity) returns the newest sample instead of the oldest when Capacity is 2^k − 1 (k ≥ 25), and Capacity + 1 doesn't throw

ktsu-dev/Containers#93 · opened

on Sep 29, 2026

1

Contiguous* containers can't grow past 2^30 elements: `Grow` doubles into an overflow and `Add` throws `ArgumentException`

ktsu-dev/Containers#90 · opened

on Sep 28, 2026

1

RingBuffer, SpscRingBuffer and DelayLine throw an undocumented `OverflowException` for sizes above 2^30, and a failed `RingBuffer.Resize` corrupts the buffer

ktsu-dev/Containers#89 · opened

on Sep 28, 2026

1

Navigation Menu

Repository navigation

Issues

ExceptWith / IntersectWith / SymmetricExceptWith on InsertionOrderSet and OrderedSet, and ContiguousSet.ExceptWith, are O(n·m): excepting 40k items from an 80k set takes 3–6 s

OrderedCollection.IndexOf(x) returns the index of a different element with the same key, so RemoveAt(IndexOf(x)) removes the wrong item

SpscRingBuffer and DelayLine have no benchmarks, though the benchmarking plan requires one per container and marks coverage as complete

OrderedMap/InsertionOrderMap.TryGetValue lose [MaybeNullWhen(false)] in the netstandard builds, so .NET Framework/Unity consumers get no null warning after a miss

ContiguousCollection<T> isn't an IList<T> despite having every member, so it can't be passed as IList<T> and LINQ ElementAt/Last scan the whole collection

ContiguousMap.GetKeysSpan/GetValuesSpan allocate and copy the whole map on every call, making indexed loops O(n²)

Evicting oldest-first from InsertionOrderMap/ContiguousMap is quadratic: emptying a 40k map takes ~3.6 s

RingBuffer.Resample on a part-filled buffer stretches the samples across the whole new length, inventing data and marking the buffer full

ContiguousMap.TryGetValue lacks [MaybeNullWhen(false)], so using `value` after a miss compiles with no warning and throws NullReferenceException

DelayLine.Process with an out-of-range delay throws after writing the sample, so a rejected call still shifts every later tap by one sample

DelayLine.ReadInterpolated(Capacity) returns the newest sample instead of the oldest when Capacity is 2^k − 1 (k ≥ 25), and Capacity + 1 doesn't throw

Contiguous* containers can't grow past 2^30 elements: `Grow` doubles into an overflow and `Add` throws `ArgumentException`

RingBuffer, SpscRingBuffer and DelayLine throw an undocumented `OverflowException` for sizes above 2^30, and a failed `RingBuffer.Resize` corrupts the buffer