Skip to content

Commit 5c58a96

Browse files
committed
remove comparison benchmarks
1 parent d2b6bab commit 5c58a96

File tree

3 files changed

+0
-29
lines changed

3 files changed

+0
-29
lines changed

go.mod

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,6 @@ require github.com/stretchr/testify v1.10.0
66

77
require (
88
github.com/davecgh/go-spew v1.1.1 // indirect
9-
github.com/emirpasic/gods v1.18.1 // indirect
109
github.com/pmezard/go-difflib v1.0.0 // indirect
1110
gopkg.in/yaml.v3 v3.0.1 // indirect
1211
)

go.sum

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,5 @@
11
github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
22
github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
3-
github.com/emirpasic/gods v1.18.1 h1:FXtiHYKDGKCW2KzwZKx0iC0PQmdlorYgdFG9jPXJ1Bc=
4-
github.com/emirpasic/gods v1.18.1/go.mod h1:8tpGGwCnJ5H4r6BWwaV6OrWmMoPhUl5jm/FMNAnJvWQ=
53
github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
64
github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
75
github.com/stretchr/testify v1.10.0 h1:Xv5erBjTwe/5IxqUQTdXv5kgmIvbHo3QQyRwhJsOfJA=

rbtree/benchmarks_test.go

Lines changed: 0 additions & 26 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
package rbtree
22

33
import (
4-
"github.com/emirpasic/gods/trees/redblacktree"
54
"github.com/mikenye/gotrees/bst"
65
"testing"
76
)
@@ -28,22 +27,6 @@ func BenchmarkTree_SearchDelete(b *testing.B) {
2827
}
2928
}
3029

31-
func BenchmarkGoDSRedBlackTree_SearchDelete(b *testing.B) {
32-
tree := redblacktree.NewWithIntComparator()
33-
34-
// create large tree to delete from
35-
for i := 0; i <= 10_000_000; i++ {
36-
tree.Put(i, struct{}{})
37-
}
38-
39-
// delete
40-
i := 0
41-
for b.Loop() {
42-
tree.Remove(i)
43-
i++
44-
}
45-
}
46-
4730
func BenchmarkTree_Insert(b *testing.B) {
4831
// create a tree with integer key & no value,
4932
tree := New[int, struct{}](func(a, b int) bool {
@@ -55,12 +38,3 @@ func BenchmarkTree_Insert(b *testing.B) {
5538
i++
5639
}
5740
}
58-
59-
func BenchmarkGoDSRedBlackTree_Insert(b *testing.B) {
60-
tree := redblacktree.NewWithIntComparator()
61-
i := 0
62-
for b.Loop() {
63-
tree.Put(i, struct{}{})
64-
i++
65-
}
66-
}

0 commit comments

Comments
 (0)