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>
63 lines
1.1 KiB
Go
63 lines
1.1 KiB
Go
package underscore_test
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
u "github.com/rjNemo/underscore"
|
|
)
|
|
|
|
func TestUnique(t *testing.T) {
|
|
nums := []int{1, 4, 2, 5, 3, 1, 5, 2, 8, 9}
|
|
want := []int{1, 4, 2, 5, 3, 8, 9}
|
|
|
|
assert.Equal(t, want, u.Unique(nums))
|
|
}
|
|
|
|
func TestUniqueEmpty(t *testing.T) {
|
|
result := u.Unique([]int{})
|
|
assert.Empty(t, result)
|
|
}
|
|
|
|
func TestUniqueSingleElement(t *testing.T) {
|
|
result := u.Unique([]int{42})
|
|
assert.Equal(t, []int{42}, result)
|
|
}
|
|
|
|
func TestUniqueNoDuplicates(t *testing.T) {
|
|
nums := []int{1, 2, 3, 4, 5}
|
|
result := u.Unique(nums)
|
|
assert.Equal(t, nums, result)
|
|
}
|
|
|
|
func TestUniqueAllSame(t *testing.T) {
|
|
nums := []int{5, 5, 5, 5, 5}
|
|
result := u.Unique(nums)
|
|
assert.Equal(t, []int{5}, result)
|
|
}
|
|
|
|
func BenchmarkUnique(b *testing.B) {
|
|
data := make([]int, 1000)
|
|
for i := range data {
|
|
data[i] = i % 100 // Many duplicates
|
|
}
|
|
|
|
b.ResetTimer()
|
|
for i := 0; i < b.N; i++ {
|
|
u.Unique(data)
|
|
}
|
|
}
|
|
|
|
func BenchmarkUniqueInPlace(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
b.StopTimer()
|
|
data := make([]int, 1000)
|
|
for j := range data {
|
|
data[j] = j % 100
|
|
}
|
|
b.StartTimer()
|
|
|
|
u.UniqueInPlace(data)
|
|
}
|
|
}
|