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>
60 lines
1.4 KiB
Go
60 lines
1.4 KiB
Go
package underscore_test
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
u "github.com/rjNemo/underscore"
|
|
)
|
|
|
|
func TestPartition(t *testing.T) {
|
|
nums := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
|
|
isEven := func(n int) bool { return n%2 == 0 }
|
|
|
|
wantEvens := []int{0, 2, 4, 6, 8}
|
|
wantOdds := []int{1, 3, 5, 7, 9}
|
|
|
|
evens, odds := u.Partition(nums, isEven)
|
|
|
|
assert.Equal(t, wantEvens, evens)
|
|
assert.Equal(t, wantOdds, odds)
|
|
}
|
|
|
|
func TestPartitionEmpty(t *testing.T) {
|
|
keep, reject := u.Partition([]int{}, func(n int) bool { return n > 0 })
|
|
assert.Empty(t, keep)
|
|
assert.Empty(t, reject)
|
|
}
|
|
|
|
func TestPartitionSingleElement(t *testing.T) {
|
|
keep, reject := u.Partition([]int{5}, func(n int) bool { return n > 3 })
|
|
assert.Equal(t, []int{5}, keep)
|
|
assert.Empty(t, reject)
|
|
}
|
|
|
|
func TestPartitionAllPass(t *testing.T) {
|
|
nums := []int{2, 4, 6, 8}
|
|
keep, reject := u.Partition(nums, func(n int) bool { return n%2 == 0 })
|
|
assert.Equal(t, nums, keep)
|
|
assert.Empty(t, reject)
|
|
}
|
|
|
|
func TestPartitionAllReject(t *testing.T) {
|
|
nums := []int{1, 3, 5, 7}
|
|
keep, reject := u.Partition(nums, func(n int) bool { return n%2 == 0 })
|
|
assert.Empty(t, keep)
|
|
assert.Equal(t, nums, reject)
|
|
}
|
|
|
|
func BenchmarkPartition(b *testing.B) {
|
|
data := make([]int, 1000)
|
|
for i := range data {
|
|
data[i] = i
|
|
}
|
|
|
|
b.ResetTimer()
|
|
for i := 0; i < b.N; i++ {
|
|
u.Partition(data, func(n int) bool { return n%2 == 0 })
|
|
}
|
|
}
|