partitioned

Documentation

Index

• func New(n uint) bloom.Bloom
• type PartitionedBloom
  • func (this *PartitionedBloom) Add(item []byte) bloom.Bloom
  • func (this *PartitionedBloom) Check(item []byte) bool
  • func (this *PartitionedBloom) Count() uint
  • func (this *PartitionedBloom) EstimatedFillRatio() float64
  • func (this *PartitionedBloom) FillRatio() float64
  • func (this *PartitionedBloom) PrintStats()
  • func (this *PartitionedBloom) Reset()
  • func (this *PartitionedBloom) SetErrorProbability(e float64)
  • func (this *PartitionedBloom) 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 PartitionedBloom

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

PartitionedBloom is a variant implementation of the standard bloom filter. Reference #1: Approximate Caches for Packet Classification (http://www.ieee-infocom.org/2004/Papers/45_3.PDF) Reference #2: Scalable Bloom Filters (http://gsd.di.uminho.pt/members/cbm/ps/dbloom.pdf)

The name Partitioned Bloom Filter is my choice as there was no name assigned to this variant.

func (*PartitionedBloom) Add

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

func (*PartitionedBloom) Check

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

func (*PartitionedBloom) Count

func (this *PartitionedBloom) Count() uint

func (*PartitionedBloom) EstimatedFillRatio

func (this *PartitionedBloom) EstimatedFillRatio() float64

func (*PartitionedBloom) FillRatio

func (this *PartitionedBloom) FillRatio() float64

func (*PartitionedBloom) PrintStats

func (this *PartitionedBloom) PrintStats()

func (*PartitionedBloom) Reset

func (this *PartitionedBloom) Reset()

func (*PartitionedBloom) SetErrorProbability

func (this *PartitionedBloom) SetErrorProbability(e float64)

func (*PartitionedBloom) SetHasher

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