scalable

Documentation

Index

• func New(n uint) bloom.Bloom
• type ScalableBloom
  • func (this *ScalableBloom) Add(item []byte) bloom.Bloom
  • func (this *ScalableBloom) Check(item []byte) bool
  • func (this *ScalableBloom) Count() uint
  • func (this *ScalableBloom) EstimatedFillRatio() float64
  • func (this *ScalableBloom) FillRatio() float64
  • func (this *ScalableBloom) PrintStats()
  • func (this *ScalableBloom) Reset()
  • func (this *ScalableBloom) SetBloomFilter(f func(uint) bloom.Bloom)
  • func (this *ScalableBloom) SetErrorProbability(e float64)
  • func (this *ScalableBloom) SetHasher(h hash.Hash)

Functions

func New

func New(n uint) bloom.Bloom

New initializes a new partitioned bloom filter. n is the number of items this bloom filter predicted to hold.

Types

type ScalableBloom

type ScalableBloom struct {
	// contains filtered or unexported fields
}

ScalableBloom is an implementation of the Scalable Bloom Filter that "addresses the problem of having to choose an a priori maximum size for the set, and allows an arbitrary growth of the set being presented." Reference #2: Scalable Bloom Filters (http://gsd.di.uminho.pt/members/cbm/ps/dbloom.pdf)

func (*ScalableBloom) Add

func (this *ScalableBloom) Add(item []byte) bloom.Bloom

func (*ScalableBloom) Check

func (this *ScalableBloom) Check(item []byte) bool

func (*ScalableBloom) Count

func (this *ScalableBloom) Count() uint

func (*ScalableBloom) EstimatedFillRatio

func (this *ScalableBloom) EstimatedFillRatio() float64

func (*ScalableBloom) FillRatio

func (this *ScalableBloom) FillRatio() float64

func (*ScalableBloom) PrintStats

func (this *ScalableBloom) PrintStats()

func (*ScalableBloom) Reset

func (this *ScalableBloom) Reset()

func (*ScalableBloom) SetBloomFilter

func (this *ScalableBloom) SetBloomFilter(f func(uint) bloom.Bloom)

func (*ScalableBloom) SetErrorProbability

func (this *ScalableBloom) SetErrorProbability(e float64)

func (*ScalableBloom) SetHasher

func (this *ScalableBloom) SetHasher(h hash.Hash)