unweightedhashselector_bench_test.go

package gocrush

import (
	//"log"
	"fmt"
	"runtime"
	"strconv"
	"testing"
)

func BenchmarkUnwweightedHashSelector(b *testing.B) {
	b.StopTimer()
	memStats := new(runtime.MemStats)
	runtime.GC()
	runtime.ReadMemStats(memStats)
	node := new(TestingNode)
	node.Children = make([]Node, 10000)
	counter := make(map[string]int)
	for i := 0; i < 10000; i++ {
		child := new(TestingNode)
		child.Weight = 1
		child.Id = "Child" + strconv.Itoa(i)
		node.Children[i] = child
		counter[child.Id] = 0
	}
	b.StartTimer()
	for x := 0; x < b.N; x++ {

		selector := NewHashingSelector(node)

		for i := int64(0); i < 100000; i++ {
			// Get replicants
			for r := int64(0); r < 3; r++ {
				nn := selector.Select(i, r)
				counter[nn.GetId()] += 1
			}
		}

	}
	b.StopTimer()
	selectMemStats := new(runtime.MemStats)
	runtime.GC()
	runtime.ReadMemStats(selectMemStats)
	fmt.Printf("\nBefore alloc: %v; After selection: %v\n",
		memStats.Alloc/1000, selectMemStats.Alloc/1000)
	//for key, nn := range counter {
	//	log.Printf("Node: %s - %d", key, nn)
	//}

}