BloomFilterCore 1.0.0

Package Description

There is a newer version of this package available.
See the version list below for details.
Install-Package BloomFilterCore -Version 1.0.0
dotnet add package BloomFilterCore --version 1.0.0
<PackageReference Include="BloomFilterCore" Version="1.0.0" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add BloomFilterCore --version 1.0.0
The NuGet Team does not provide support for this client. Please contact its maintainers for support.
#r "nuget: BloomFilterCore, 1.0.0"
#r directive can be used in F# Interactive, C# scripting and .NET Interactive. Copy this into the interactive tool or source code of the script to reference the package.
// Install BloomFilterCore as a Cake Addin
#addin nuget:?package=BloomFilterCore&version=1.0.0

// Install BloomFilterCore as a Cake Tool
#tool nuget:?package=BloomFilterCore&version=1.0.0
The NuGet Team does not provide support for this client. Please contact its maintainers for support.

Bloom Filter Core
This library was decompiled from an MIT licensed library obtained from Nuget and recompiled for .NET Standard. All credit goes to Graham Henry who is the original creator. Unfortunately I could not find the code online.

Description (copied from original Nuget description)
A Bloom Filter is a probabalistic data structure that Implements the Add() and Contains() methods in a memory efficient manner when compared to the more traditional Hash Set. However, the Bloom Filter has some draw backs:

  • It will sometimes indicate that an element is in the set when it isn't. The False Positive rate can be decreased by using more memory.

  • The capacity of the Bloom Filter is fixed at creation time. (You can add more elements than the target capacity, but the False Positive rate continues to increase thereafter).

Bloom Filter Core
This library was decompiled from an MIT licensed library obtained from Nuget and recompiled for .NET Standard. All credit goes to Graham Henry who is the original creator. Unfortunately I could not find the code online.

Description (copied from original Nuget description)
A Bloom Filter is a probabalistic data structure that Implements the Add() and Contains() methods in a memory efficient manner when compared to the more traditional Hash Set. However, the Bloom Filter has some draw backs:

  • It will sometimes indicate that an element is in the set when it isn't. The False Positive rate can be decreased by using more memory.

  • The capacity of the Bloom Filter is fixed at creation time. (You can add more elements than the target capacity, but the False Positive rate continues to increase thereafter).

  • .NETStandard 2.0

    • No dependencies.

NuGet packages

This package is not used by any NuGet packages.

GitHub repositories

This package is not used by any popular GitHub repositories.

Version History

Version Downloads Last updated
1.0.1 1,663 12/13/2018
1.0.0 351 12/12/2018