memoize_with_cache_bench_test.go

package memoize

import (
	"fmt"
	"math"
	"testing"

	"github.com/emad-elsaid/memoize/cache"
)

func BenchmarkMemoizerWithCache(b *testing.B) {
	for i := 1; i < maxKeySpace; i++ {
		keysN := math.Pow(10, float64(i))
		name := fmt.Sprintf("Keys:%.f", keysN)

		b.Run(name, func(b *testing.B) {

			mem := NewWithCache(
				cache.New[string, int](),
				func(k string) int { return len(k) })

			keys := []string{}
			for i := range int64(keysN) {
				keys = append(keys, string(fmt.Sprintf("Key%d", i)))
			}

			b.ResetTimer()
			for i := range b.N {
				k := keys[i%len(keys)]
				r := mem(k)
				returns = r
			}

		})
	}
}

func BenchmarkMemoizerWithCacheParallel(b *testing.B) {
	for i := 1; i < maxKeySpace; i++ {
		keysN := math.Pow(10, float64(i))
		name := fmt.Sprintf("Keys:%.f", keysN)

		b.Run(name, func(b *testing.B) {

			mem := NewWithCache(
				cache.New[string, int](),
				func(k string) int { return len(k) })

			keys := []string{}
			for i := range int64(keysN) {
				keys = append(keys, string(fmt.Sprintf("Key%d", i)))
			}

			b.ResetTimer()
			b.RunParallel(func(b *testing.PB) {
				i := 0
				for b.Next() {
					k := keys[i%len(keys)]
					r := mem(k)
					returns = r
					i++
				}
			})

		})
	}
}