neemek/anglais
1
1
Fork 0
Code Issues Pull requests Releases 1 Wiki Activity Actions

Reduce automated stack benchmarks

Browse source
This commit is contained in:
Neemek 2025-01-03 22:55:57 +01:00
parent 7eb0e1b1fd
commit 8d9138479d
Signed by: neemek
GPG key ID: 28360A8951CD0E9B
1 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

8
core/stack_test.go
View file

@ -45,8 +45,8 @@ func TestNewStack(t *testing.T) {
} }
func BenchmarkNewStack(b *testing.B) { func BenchmarkNewStack(b *testing.B) {
for n := 0; n <= 2048; n += 256 { for n := 0; n <= 512; n += 256 {
b.Run(fmt.Sprintf("size_%d", n), func(b *testing.B) { b.Run(fmt.Sprintf("size=%d", n), func(b *testing.B) {
for i := 0; i < b.N; i++ { for i := 0; i < b.N; i++ {
_ = NewStack[any](Pos(n)) _ = NewStack[any](Pos(n))
} }
@ -116,10 +116,10 @@ func TestStackOverflow(t *testing.T) {
} }
func BenchmarkStack(b *testing.B) { func BenchmarkStack(b *testing.B) {
for n := 256; n <= 2048; n += 256 { for n := 256; n <= 512; n += 256 {
b.Run(fmt.Sprintf("size_%d", n), func(b *testing.B) { b.Run(fmt.Sprintf("size_%d", n), func(b *testing.B) {
for i := 0; i < b.N; i++ {
s := NewStack[any](Pos(n)) s := NewStack[any](Pos(n))
for i := 0; i < b.N; i++ {
s.Push(2) s.Push(2)
s.Pop() s.Pop()