golang-levenshtein benchmark

levenshtein_perf_test.go

package levenshtein

import (
	"math/rand"
	"testing"
)

func randomString(r *rand.Rand, choice []rune, length int) []rune {
	str := make([]rune, 0, length)

	for i := 0; i < length; i++ {
		randRune := choice[rand.Intn(len(choice))]
		str = append(str, randRune)
	}

	return str
}

var alphabet = []rune{'a', 'b', 'c', 'd', 'e'}

type benchPair struct {
	s1 []rune
	s2 []rune
}

func BenchmarkDistanceForStrings(b *testing.B) {
	r := rand.New(rand.NewSource(42))
	pairs := make([]benchPair, b.N)

	for i := 0; i < b.N; i++ {
		s1 := randomString(r, alphabet, r.Intn(20))
		s2 := randomString(r, alphabet, r.Intn(20))
		pairs[i] = benchPair{s1, s2}
	}

	b.ResetTimer()

	for n := 0; n < b.N; n++ {
		pair := pairs[n]
		DistanceForStrings(pair.s1, pair.s2, DefaultLevenshtein)
	}
}