alirec/vendor/github.com/goburrow/cache/sketch.go

package cache

const sketchDepth = 4

// countMinSketch is an implementation of count-min sketch with 4-bit counters.
// See http://dimacs.rutgers.edu/~graham/pubs/papers/cmsoft.pdf
type countMinSketch struct {
	counters []uint64
	mask     uint32
}

// init initialize count-min sketch with the given width.
func (c *countMinSketch) init(width int) {
	// Need (width x 4 x 4) bits = width/4 x uint64
	size := nextPowerOfTwo(uint32(width)) >> 2
	if size < 1 {
		size = 1
	}
	c.mask = size - 1
	if len(c.counters) == int(size) {
		c.clear()
	} else {
		c.counters = make([]uint64, size)
	}
}

// add increases counters associated with the given hash.
func (c *countMinSketch) add(h uint64) {
	h1, h2 := uint32(h), uint32(h>>32)

	for i := uint32(0); i < sketchDepth; i++ {
		idx, off := c.position(h1 + i*h2)
		c.inc(idx, (16*i)+off)
	}
}

// estimate returns minimum value of counters associated with the given hash.
func (c *countMinSketch) estimate(h uint64) uint8 {
	h1, h2 := uint32(h), uint32(h>>32)

	var min uint8 = 0xFF
	for i := uint32(0); i < sketchDepth; i++ {
		idx, off := c.position(h1 + i*h2)
		count := c.val(idx, (16*i)+off)
		if count < min {
			min = count
		}
	}
	return min
}

// reset divides all counters by two.
func (c *countMinSketch) reset() {
	for i, v := range c.counters {
		if v != 0 {
			c.counters[i] = (v >> 1) & 0x7777777777777777
		}
	}
}

func (c *countMinSketch) position(h uint32) (idx uint32, off uint32) {
	idx = (h >> 2) & c.mask
	off = (h & 3) << 2
	return
}

// inc increases value at index idx.
func (c *countMinSketch) inc(idx, off uint32) {
	v := c.counters[idx]
	count := uint8(v>>off) & 0x0F
	if count < 15 {
		c.counters[idx] = v + (1 << off)
	}
}

// val returns value at index idx.
func (c *countMinSketch) val(idx, off uint32) uint8 {
	v := c.counters[idx]
	return uint8(v>>off) & 0x0F
}

func (c *countMinSketch) clear() {
	for i := range c.counters {
		c.counters[i] = 0
	}
}

// nextPowerOfTwo returns the smallest power of two which is greater than or equal to i.
func nextPowerOfTwo(i uint32) uint32 {
	n := i - 1
	n |= n >> 1
	n |= n >> 2
	n |= n >> 4
	n |= n >> 8
	n |= n >> 16
	n++
	return n
}