-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbtree_arenas_test.go
137 lines (108 loc) · 2.09 KB
/
btree_arenas_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
//go:build goexperiment.arenas
package btree
import (
"arena"
"flag"
"math/rand"
"runtime"
"testing"
)
var btreeDegree = flag.Int("degree", 32, "B-Tree degree")
type testInt int
func newTestInt(i int) *testInt {
ti := testInt(i)
return &ti
}
func (n *testInt) Less(n2 *testInt) bool {
return *n < *n2
}
func (n *testInt) DeepCopy() *testInt {
var np testInt
np = testInt(*n)
return &np
}
func (n *testInt) DeepCopyWithArena(a *arena.Arena) *testInt {
np := arena.New[testInt](a)
*np = *n
return np
}
func intRange(s int, reverse bool) []*testInt {
out := make([]*testInt, s)
for i := 0; i < s; i++ {
v := i
if reverse {
v = s - i - 1
}
ti := testInt(v)
out[i] = &ti
}
return out
}
func testIntAll(t *BTree[*testInt]) (out []*testInt) {
t.Ascend(func(a *testInt) bool {
out = append(out, a)
return true
})
return
}
func testIntAllRev(t *BTree[*testInt]) (out []*testInt) {
t.Descend(func(a *testInt) bool {
out = append(out, a)
return true
})
return
}
func BenchmarkBothDeepCopy(b *testing.B) {
items := rand.Perm(16392)
tr := New[*testInt](*btreeDegree)
for _, v := range items {
tr.ReplaceOrInsert(newTestInt(v))
}
b.ResetTimer()
b.Run(`DeepCoopy`, func(b *testing.B) {
for i := 0; i < b.N; i++ {
tr2 := tr.DeepCopy()
tr2.Len()
tr2 = nil
}
runtime.GC()
})
b.Run(`DeepCopyWithArena`, func(b *testing.B) {
a := arena.NewArena()
for i := 0; i < b.N; i++ {
tr2 := tr.DeepCopyWithArena(a)
tr2.Len()
}
a.Free()
runtime.GC()
})
}
func BenchmarkDeepCopy(b *testing.B) {
items := rand.Perm(16392)
tr := New[*testInt](*btreeDegree)
for _, v := range items {
tr.ReplaceOrInsert(newTestInt(v))
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
tr2 := tr.DeepCopy()
tr2.Len()
tr2 = nil
}
runtime.GC()
}
func BenchmarkDeepCopyWithArena(b *testing.B) {
items := rand.Perm(16392)
tr := New[*testInt](*btreeDegree)
for _, v := range items {
tr.ReplaceOrInsert(newTestInt(v))
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
a := arena.NewArena()
tr2 := tr.DeepCopyWithArena(a)
tr2.Len()
a.Free()
}
runtime.GC()
}