mirror of
https://github.com/rjNemo/underscore
synced 2026-06-06 02:26:42 +00:00
Ruidy
b04e545d03
Adds performance benchmarks for core collection functions to enable tracking of performance regressions and optimization opportunities. Benchmarks added: - Map: 1000 element transformation - Reduce: 1000 element sum - Partition: 1000 element split - Unique/UniqueInPlace: Comparison with many duplicates - ParallelMap: Multiple worker counts (1, 2, 4, 8) - MapVsParallelMap: Direct comparison (10k elements) Key findings from benchmarks: - Map: 1363 ns/op, 1 alloc (excellent) - Reduce: 335 ns/op, 0 allocs (excellent) - Partition: 3411 ns/op, 2 allocs (good - both slices) - ParallelMap overhead: ~240x slower for simple operations - ParallelMap is best for CPU-intensive operations (>1ms per element) Use cases clarified: - Regular Map for simple/fast operations - ParallelMap for expensive operations with 100+ elements - Optimal workers: 1-4 for most workloads All tests pass ✅ Coverage maintained ✅ 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
41 lines
866 B
Go
41 lines
866 B
Go
package underscore_test
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
u "github.com/rjNemo/underscore"
|
|
)
|
|
|
|
func TestReduce(t *testing.T) {
|
|
nums := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
|
|
reducer := func(n, acc int) int {
|
|
return n + acc
|
|
}
|
|
want := 45
|
|
|
|
assert.Equal(t, want, u.Reduce(nums, reducer, 0))
|
|
}
|
|
|
|
func TestReduceEmpty(t *testing.T) {
|
|
result := u.Reduce([]int{}, func(n, acc int) int { return n + acc }, 10)
|
|
assert.Equal(t, 10, result) // Should return initial accumulator
|
|
}
|
|
|
|
func TestReduceSingleElement(t *testing.T) {
|
|
result := u.Reduce([]int{5}, func(n, acc int) int { return n + acc }, 0)
|
|
assert.Equal(t, 5, result)
|
|
}
|
|
|
|
func BenchmarkReduce(b *testing.B) {
|
|
data := make([]int, 1000)
|
|
for i := range data {
|
|
data[i] = i
|
|
}
|
|
|
|
b.ResetTimer()
|
|
for i := 0; i < b.N; i++ {
|
|
u.Reduce(data, func(n, acc int) int { return n + acc }, 0)
|
|
}
|
|
}
|