Bump BitFaster.Caching from 2.2.0 to 2.3.3

[dependabot[bot]]

Bumps BitFaster.Caching from 2.2.0 to 2.3.3.

Release notes

Sourced from BitFaster.Caching's releases.

v2.3.3

What's changed

• Eliminated all races in ConcurrentLru eviction logic, and the transition between the cold cache and warm cache eviction routines. This prevents a variety of rare 'off by one item count' situations that could needlessly evict items when the cache is within bounds.
• Fix ConcurrentLru.Clear() to always clear the cache when items in the warm queue are marked as accessed.
• Optimize ConcurrentLfu drain buffers logic to give ~5% better throughput (measured by the eviction throughput test).
• Cache the ConcurrentLfu drain buffers delegate to prevent allocating a closure when scheduling maintenance.
• BackgroundThreadScheduler and ThreadPoolScheduler now use TaskScheduler.Default, instead of implicitly using TaskScheduler.Current (fixes CA2008).
• ScopedAsyncCache now internally calls ConfigureAwait(false) when awaiting tasks (fixes CA2007).
• Fix ConcurrentLru debugger display on .NET Standard.

Full changelog: https://github.com/bitfaster/BitFaster.Caching/compare/v2.3.2...v2.3.3

v2.3.2

What's changed

• Fix ConcurrentLru NullReferenceException when expiring and disposing null values (i.e. the cached value is a reference type, and the caller cached a null value).
• Fix ConcurrentLfu handling of updates to detached nodes, caused by concurrent reads and writes. Detached nodes could be re-attached to the probation LRU pushing out fresh items prematurely, but would eventually expire since they can no longer be accessed.

Full changelog: https://github.com/bitfaster/BitFaster.Caching/compare/v2.3.1...v2.3.2

v2.3.1

What's changed

• Introduce a simple heuristic to estimate the optimal ConcurrentDictionary bucket count for ConcurrentLru/ConcurrentLfu/ClassicLru based on the capacity constructor arg. When the cache is at capacity, the ConcurrentDictionary will have a prime number bucket count and a load factor of 0.75.
  • When capacity is less than 150 elements, start with a ConcurrentDictionary capacity that is a prime number 33% larger than cache capacity. Initial size is large enough to avoid resizing.
  • For larger caches, pick ConcurrentDictionary initial size using a lookup table. Initial size is approximately 10% of the cache capacity such that 4 ConcurrentDictionary grow operations will arrive at a hash table size that is a prime number approximately 33% larger than cache capacity.
• SingletonCache sets the internal ConcurrentDictionary capacity to the next prime number greater than the capacity constructor argument.
• Fix ABA concurrency bug in Scoped by changing ReferenceCount to use reference equality (via object.ReferenceEquals).
• .NET6 target now compiled with SkipLocalsInit. Minor performance gains.
• Simplified AtomicFactory/AsyncAtomicFactory/ScopedAtomicFactory/ScopedAsyncAtomicFactory by removing redundant reads, reducing code size.
• ConcurrentLfu.Count now does not lock the underlying ConcurrentDictionary, matching ConcurrentLru.Count.
• Use CollectionsMarshal.AsSpan to enumerate candidates within ConcurrentLfu.Trim on .NET6.

Full changelog: https://github.com/bitfaster/BitFaster.Caching/compare/v2.3.0...v2.3.1

v2.3.0

What's changed

• Align TryRemove overloads with ConcurrentDictionary for ICache (including WithAtomicGetOrAdd). This adds two new overloads:
  • bool TryRemove(K key, out V value) - enables getting the value that was removed.
  • bool TryRemove(KeyValuePair<K, V> item) - enables removing an item only when the key and value are the same.
• Fix ConcurrentLfu.Clear() to remove all values when using BackgroundThreadScheduler. Previously values may be left behind after clear was called due to removed items present in window/protected/probation polluting the list of candidates to remove.
• Fix ConcurrentLru.Clear() to reset the isWarm flag. Now cache warmup behaves the same for a new instance of ConcurrentLru vs an existing instance that was full then cleared. Previously ConcurrentLru could have reduced capacity during warmup after calling clear, depending on the access pattern.
• Add extension methods to make it more convenient to use AtomicFactory with a plain ConcurrentDictionary. This is similar to storing a Lazy<T> instead of T, but with the same exception propagation semantics and API as ConcurrentDictionary.GetOrAdd.

Full changelog: https://github.com/bitfaster/BitFaster.Caching/compare/v2.2.1...v2.3.0

v2.2.1

What's changed

• Fix a ConcurrentLru bug where a repeated pattern of sequential key access could lead to unbounded growth.
• Use Span APIs within MpscBoundedBuffer/StripedMpscBuffer/ConcurrentLfu on .NET6/.NETCore3.1 build targets. Reduces ConcurrentLfu lookup latency by about 5-7% in the lookup benchmark.

Full changelog: https://github.com/bitfaster/BitFaster.Caching/compare/v2.2.0...v2.2.1

Commits

• 532db75 2.3.3 (#463)
• 23778c2 Cache LFU drain buffers delegate (#461)
• 0588062 Fix HitRateAnalysis test suite OOM (#460)
• 0bc75e9 Don't inline LRU warmup method (#459)
• 8b5e246 Verify LRU stability during warmup (#420)
• b027a68 Eliminate races during LRU warmup (#457)
• 8ac5f56 Revise LRU eviction logic (#456)
• bebba07 Fix LRU debugger display on net standard (#458)
• a99aa78 optimize LFU (#438)
• d3a781c Update README.md (#454)
• Additional commits viewable in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR: - `@dependabot rebase` will rebase this PR - `@dependabot recreate` will recreate this PR, overwriting any edits that have been made to it - `@dependabot merge` will merge this PR after your CI passes on it - `@dependabot squash and merge` will squash and merge this PR after your CI passes on it - `@dependabot cancel merge` will cancel a previously requested merge and block automerging - `@dependabot reopen` will reopen this PR if it is closed - `@dependabot close` will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually - `@dependabot show ignore conditions` will show all of the ignore conditions of the specified dependency - `@dependabot ignore this major version` will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this minor version` will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this dependency` will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)

[coveralls]

Pull Request Test Coverage Report for Build 6856661575

• 0 of 0 changed or added relevant lines in 0 files are covered.
• No unchanged relevant lines lost coverage.
• Overall coverage increased (+0.07%) to 18.382%

---

Totals
Change from base Build 6509105194:	0.07%
Covered Lines:	2384
Relevant Lines:	11967

---

💛 - Coveralls

[dependabot[bot]]

Superseded by #330.