TEMPLATES
/
tests
1
0
Fork 0
Code Pull Requests Activity

Fix benchmarks
continuous-integration/drone/push Build is passing Details

main
Андрей Иванов 2024-09-13 13:26:36 +03:00
parent c6d33c500d
commit fd95e9ee13
1 changed files with 11 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
cut_the_tree/funcs_test.go
View File

@ -31,11 +31,11 @@ func Benchmark(b *testing.B) {
branches int
depth int
}{
"Small tree":{4, 4}, // 85 nodes,
"Wide tree": {515, 3}, // 265'741 nodes,
"Deep tree": {3, 12}, // 265'720 nodes,
"Huge tree": {5, 10}, // 2'441'406 nodes,
"Pathological tree": {1, 10000}, // 10'000 nodes,
"Small tree (85 nodes)":{4, 4}, // 85 nodes,
"Wide tree (2,65K nodes)": {515, 3}, // 265'741 nodes,
"Deep tree (2,65K nodes)": {3, 12}, // 265'720 nodes,
"Huge tree (2,44M nodes)": {5, 10}, // 2'441'406 nodes,
"Pathological tree (10K nodes)": {1, 10000}, // 10'000 nodes,
}{
b.Run(name, func(b *testing.B) {
tree := getTestTree(tt.branches, tt.depth)
@ -43,19 +43,25 @@ func Benchmark(b *testing.B) {
tree = TestTree{nil, nil}
})
b.Run("Weighing with recursion", func(b *testing.B) {
for i := 0; i < b.N; i++ {
b.StartTimer()
assert.EqualValues(b, tree.Weights, tree.Tree.WeightingTreeWithRecursion())
b.StopTimer()
}
})
b.Run("Weighting with stack", func(b *testing.B) {
for i := 0; i < b.N; i++ {
b.StartTimer()
assert.EqualValues(b, tree.Weights, tree.Tree.WeightingTreeWithStack())
b.StopTimer()
}
})
b.Run("Weighting with DLL", func(b *testing.B) {
for i := 0; i < b.N; i++ {
b.StartTimer()
assert.EqualValues(b, tree.Weights, tree.Tree.WeightingTreeWithDLL())
b.StopTimer()
}
})
})