NonBlocking by Vladimir Sadov

<PackageReference Include="NonBlocking" Version="2.1.0" />

 NonBlocking 2.1.0

Implementation of a lock-free dictionary on .Net Included types: === NonBlocking.ConcurrentDictionary Lock-free, wait-free implementation of a dictionary. - has the same API as System.Collections.Concurrent.ConcurrentDictionary. - No locks are taken during any operation including Get, Add, Remove, internal resizes etc... - While multiple threads accessing NonBlocking dictionary will help each other in operations such as table resizing, there is no dependency on such behavior. If any thread get unscheduled or delayed for whatever reason, other threads will be able to make progress independently. - NonBlocking dictionary scales linearly with the number of active threads if hardware permits. On most operations NonBlocking dictionary is faster than Concurrent, especially in write-heavy scenarios. Core algorithms are based on NonBlockingHashMap, written and released to the public domain by Dr. Cliff Click. A good overview could be found here: https://www.youtube.com/watch?v=HJ-719EGIts === Counter32 === Counter64 Low-overhead scalable counters.

<package xmlns="http://schemas.microsoft.com/packaging/2013/05/nuspec.xsd">
  <metadata>
    <id>NonBlocking</id>
    <version>2.1.0</version>
    <authors>Vladimir Sadov</authors>
    <license type="expression">MIT</license>
    <licenseUrl>https://licenses.nuget.org/MIT</licenseUrl>
    <projectUrl>https://github.com/VSadov/NonBlocking</projectUrl>
    <description>Implementation of a lock-free dictionary on .Net

      Included types:
      === NonBlocking.ConcurrentDictionary
      Lock-free, wait-free implementation of a dictionary.
      - has the same API as System.Collections.Concurrent.ConcurrentDictionary.
      - No locks are taken during any operation including Get, Add, Remove, internal resizes etc...
      - While multiple threads accessing NonBlocking dictionary will help each other in operations such as table resizing, there is no dependency on such behavior. If any thread get unscheduled or delayed for whatever reason, other threads will be able to make progress independently.
      - NonBlocking dictionary scales linearly with the number of active threads if hardware permits.

      On most operations NonBlocking dictionary is faster than Concurrent, especially in write-heavy scenarios.

      Core algorithms are based on NonBlockingHashMap, written and released to the public domain by Dr. Cliff Click. A good overview could be found here: https://www.youtube.com/watch?v=HJ-719EGIts

      === Counter32
      === Counter64
      Low-overhead scalable counters.</description>
    <releaseNotes>Adds support for netstandard2.0
        Adds trimming support  (IsTrimmable)
	NaiveAOT compatibility fixes</releaseNotes>
    <copyright>Copyright 2022 (c) Vladimir Sadov. All rights reserved.</copyright>
    <tags>lock-free wait-free dictionary high-performance</tags>
    <dependencies>
      <group targetFramework=".NETStandard2.0">
        <dependency id="System.Runtime.CompilerServices.Unsafe" version="4.3.0" exclude="Build,Analyzers" />
      </group>
      <group targetFramework=".NETStandard2.1">
        <dependency id="System.Runtime.CompilerServices.Unsafe" version="4.3.0" exclude="Build,Analyzers" />
      </group>
    </dependencies>
  </metadata>
</package>