@@ -7,7 +7,7 @@ import (
77
88func BenchmarkAnimationUpdate(b *testing.B) {
99 anim := New(30, "Loading test data")
10−
10+
1111 b.ResetTimer()
1212 for i := 0; i < b.N; i++ {
1313 // Simulate character cycling update
@@ -17,12 +17,12 @@ func BenchmarkAnimationUpdate(b *testing.B) {
1717
1818func BenchmarkAnimationView(b *testing.B) {
1919 anim := New(30, "Loading test data")
20−
20+
2121 // Initialize with some cycling
2222 for i := 0; i < 10; i++ {
2323 anim.Update(StepCharsMsg{id: anim.ID()})
2424 }
25−
25+
2626 b.ResetTimer()
2727 for i := 0; i < b.N; i++ {
2828 _ = anim.View()
@@ -31,7 +31,7 @@ func BenchmarkAnimationView(b *testing.B) {
3131
3232func BenchmarkRandomRune(b *testing.B) {
3333 c := cyclingChar{}
34−
34+
3535 b.ResetTimer()
3636 for i := 0; i < b.N; i++ {
3737 _ = c.randomRune()
@@ -40,24 +40,24 @@ func BenchmarkRandomRune(b *testing.B) {
4040
4141func TestAnimationPerformance(t *testing.T) {
4242 anim := New(30, "Performance test")
43−
43+
4444 start := time.Now()
4545 iterations := 1000
46−
46+
4747 // Simulate rapid updates
4848 for i := 0; i < iterations; i++ {
4949 anim.Update(StepCharsMsg{id: anim.ID()})
5050 _ = anim.View()
5151 }
52−
52+
5353 duration := time.Since(start)
5454 avgPerUpdate := duration / time.Duration(iterations)
55−
55+
5656 // Should complete 1000 updates in reasonable time
5757 if avgPerUpdate > time.Millisecond {
5858 t.Errorf("Animation update too slow: %v per update (should be < 1ms)", avgPerUpdate)
5959 }
60−
61− t.Logf("Animation performance: %v per update (%d updates in %v)",
60+
61+ t.Logf("Animation performance: %v per update (%d updates in %v)",
6262 avgPerUpdate, iterations, duration)
63−}
63+}