Skip to content

Tip #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Jun 2, 2017
Merged

Tip #8

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
68481d1
Improve package doc
korthaj Jun 1, 2017
abc8c52
Add limitations section
korthaj Jun 2, 2017
641687e
Remove counting example
korthaj Jun 2, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Add limitations section
  • Loading branch information
@korthaj
korthaj committed Jun 2, 2017
commit abc8c52b486a6fca536f00a1196b905e78737eb9
10 changes: 8 additions & 2 deletions filter.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@
// Elements can be added, but not removed. With more elements in the filter,
// the probability of false positives increases.
//
// Implementation
// Performance
//
// A full filter with a false-positives rate of 1/p uses roughly
// 0.26ln(p) bytes per element and performs ⌈1.4ln(p)⌉ bit array lookups
Expand All @@ -38,11 +38,17 @@
// 512 1.6 9
// 1024 1.8 10
//
// This implementation is not intended for cryptographic use.
// Each membership test makes a single call to a 128-bit hash function.
// This improves speed without increasing the false-positives rate
// as shown by Kirsch and Mitzenmacher.
//
// Limitations
//
// This implementation is not intended for cryptographic use.
//
// The internal data representation is different for big-endian
// and little-endian machines.
//
package bloom

import (
Expand Down