VDS.Common 1.6.4

A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.

Install-Package VDS.Common -Version 1.6.4

dotnet add package VDS.Common --version 1.6.4

<PackageReference Include="VDS.Common" Version="1.6.4" />

paket add VDS.Common --version 1.6.4

Release Notes

- Three hashing approaches are now available for Bloom Filters:
   - Naive - the existing implementation that gives full control to devlopers
   - Fast - uses approach from http://citeseer.ist.psu.edu/viewdoc/download?doi=10.1.1.152.579&rep=rep1&type=pdf
   - Hybrid - uses a hybrid of the naive and fast approaches
- ISparseArray now has a Clear() method
- New DuplicateSortedList for cases where you need to have a sorted list that supports duplicate items
- New Collections.Enumerations namespace with various useful enumerables and suitable extension methods for invoking these in fluent style
- New ReferenceEqualityComparer for when you need reference equality only
- New ReversedComparer for reversing the ordering given by another comparer
- Support for indexed access into binary trees
- Improved locking strategy for non-sparse tries to improve performance
- Filled out missing XML doc comments

Dependencies

This package has no dependencies.

GitHub Usage

Version History