lookup_test.go

package test

import (
	"sort"
	"testing"
)

type (
	People []*Person
	Person struct {
		Id int
	}
)

const (
	N = 256
	z = 2
)

var (
	m = map[int]*Person{}
	a = make(People, N)
	p *Person
)

func (p People) Len() int {
	return len(p)
}

func (p People) Swap(i, j int) {
	p[i], p[j] = p[j], p[i]
}

func (p People) Less(i, j int) bool {
	return p[i].Id < p[j].Id
}

func BenchmarkFindInMap(b *testing.B) {
	for i := 0; i < b.N; i++ {
		p = m[z]
	}
}

func BenchmarkFindInSlice(b *testing.B) {
	for i := 0; i < b.N; i++ {
		p = a[z]
	}
}

func BenchmarkFindInList(b *testing.B) {
	for i := 0; i < b.N; i++ {
		for j := 0; j < N; j++ {
			if j == z {
				break
			}
		}
	}
}

func BenchmarkFindInTree(b *testing.B) {
	for i := 0; i < b.N; i++ {
		sort.Search(len(a), func(i int) bool {
			return a[i].Id == z
		})
	}
}

func init() {
	// Populate map and slice
	for i := 0; i < N; i++ {
		p := &Person{i}
		m[i] = p
		a[i] = p
	}

	// Sort slice
	sort.Sort(a)
}