Issues

OrderedSet/OrderedMap have no Min/Max or positional access, so `set.Last()` walks all n elements (~2.4 ms on a 1M set) where SortedSet.Max is O(log n)

ktsu-dev/Containers#121 · opened

on Oct 20, 2026

1

Every documented benchmark command calls scripts/run-benchmarks.ps1, which was deleted in 59bde7f, so "Running Benchmarks" fails at the first step

ktsu-dev/Containers#120 · opened

on Oct 19, 2026

1

OrderedSet<T>.UnionWith is O(n·m): 200k-element union is ~12x slower than constructing the same set

ktsu-dev/Containers#119 · opened

on Oct 18, 2026

1

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

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

2

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

2

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

Navigation Menu

Repository navigation

Issues

OrderedSet/OrderedMap have no Min/Max or positional access, so `set.Last()` walks all n elements (~2.4 ms on a 1M set) where SortedSet.Max is O(log n)

Every documented benchmark command calls scripts/run-benchmarks.ps1, which was deleted in 59bde7f, so "Running Benchmarks" fails at the first step

OrderedSet<T>.UnionWith is O(n·m): 200k-element union is ~12x slower than constructing the same set

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

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.ReadInterpolated(Capacity) returns the newest sample instead of the oldest when Capacity is 2^k − 1 (k ≥ 25), and Capacity + 1 doesn't throw