README
¶
Bloom
A bloom filter implementation using 32bit fnv and murmur3 hash functions.
Adding an item to the filter:
m := 32768
f := bloom.New(m)
f.Add([]byte("item"))
Checkng if an item might be in the filter:
if f.Check([]byte("item"))
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Filter ¶
type Filter struct {
Bitset []byte
// contains filtered or unexported fields
}
Filter is the representation of the bloom filter
type MMapFilter ¶
type MMapFilter struct {
Bitset mmap.MMap
// contains filtered or unexported fields
}
MMapFilter implements a bloom filter on a memory map
func (*MMapFilter) Add ¶
func (m *MMapFilter) Add(item []byte)
Add adds a new item to the mmap filter
func (*MMapFilter) Check ¶
func (m *MMapFilter) Check(item []byte) bool
Check tests whether an item is in the mmap filter
Source Files
Click to show internal directories.
Click to hide internal directories.