Skip to content
/ talan Public

Probabilistic data structures (bloom filter / counting bloom filter / linear counter)

License

Notifications You must be signed in to change notification settings

preciz/talan

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Talán

test

Probabilistic data structures in Elixir:

  • Bloom filter for membership estimation
  • Counting bloom filter for membership & cardinality estimation with delete support
  • Linear probabilistic counter for cardinality estimation

Documentation can be found at https://hexdocs.pm/talan.

Talán is a Hungarian adverb meaning: maybe, perhaps, probably.

Installation

Add talan to your list of dependencies in mix.exs:

Note: it requires OTP-21.2.1 or later.

def deps do
  [
    {:talan, "~> 0.2.0"}
  ]
end

Usage

alias Talan.BloomFilter

bloom_filter = BloomFilter.new(1000)
bloom_filter |> BloomFilter.put("Barna")
bloom_filter |> BloomFilter.member?("Barna")
true
bloom_filter |> BloomFilter.member?("Kovacs")
false

License

Talán is MIT licensed.

About

Probabilistic data structures (bloom filter / counting bloom filter / linear counter)

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages