@@ -24,7 +24,7 @@ var intMap = map[int]string{
24
24
1_000_000 : "1_000_000" ,
25
25
}
26
26
27
- func BenchmarkLookupIP (b * testing.B ) {
27
+ func BenchmarkLookup (b * testing.B ) {
28
28
for k := 1 ; k <= 1_000_000 ; k *= 10 {
29
29
rt := new (cidrtree.Table )
30
30
cidrs := shuffleFullTable (k )
@@ -44,7 +44,7 @@ func BenchmarkLookupIP(b *testing.B) {
44
44
}
45
45
}
46
46
47
- func BenchmarkLookupCIDR (b * testing.B ) {
47
+ func BenchmarkLookupPrefix (b * testing.B ) {
48
48
for k := 1 ; k <= 1_000_000 ; k *= 10 {
49
49
rt := new (cidrtree.Table )
50
50
cidrs := shuffleFullTable (k )
@@ -63,7 +63,7 @@ func BenchmarkLookupCIDR(b *testing.B) {
63
63
}
64
64
}
65
65
66
- func BenchmarkNew (b * testing.B ) {
66
+ func BenchmarkInsertImmutable (b * testing.B ) {
67
67
for k := 1 ; k <= 1_000_000 ; k *= 10 {
68
68
cidrs := shuffleFullTable (k )
69
69
name := fmt .Sprintf ("%10s" , intMap [k ])
@@ -82,7 +82,7 @@ func BenchmarkClone(b *testing.B) {
82
82
for k := 1 ; k <= 1_000_000 ; k *= 10 {
83
83
rt := new (cidrtree.Table )
84
84
for _ , cidr := range shuffleFullTable (k ) {
85
- rt = rt . InsertImmutable (cidr , nil )
85
+ rt . Insert (cidr , nil )
86
86
}
87
87
name := fmt .Sprintf ("%10s" , intMap [k ])
88
88
b .ResetTimer ()
@@ -99,25 +99,7 @@ func BenchmarkInsert(b *testing.B) {
99
99
rt := new (cidrtree.Table )
100
100
cidrs := shuffleFullTable (k )
101
101
for _ , cidr := range cidrs {
102
- rt = rt .InsertImmutable (cidr , 0 )
103
- }
104
- probe := routes [mrand .Intn (len (routes ))]
105
- name := fmt .Sprintf ("Into%10s" , intMap [k ])
106
- b .ResetTimer ()
107
- b .Run (name , func (b * testing.B ) {
108
- for n := 0 ; n < b .N ; n ++ {
109
- _ = rt .InsertImmutable (probe .cidr , 0 )
110
- }
111
- })
112
- }
113
- }
114
-
115
- func BenchmarkInsertMutable (b * testing.B ) {
116
- for k := 1 ; k <= 1_000_000 ; k *= 10 {
117
- rt := new (cidrtree.Table )
118
- cidrs := shuffleFullTable (k )
119
- for _ , cidr := range cidrs {
120
- rt = rt .InsertImmutable (cidr , 0 )
102
+ rt .Insert (cidr , 0 )
121
103
}
122
104
probe := routes [mrand .Intn (len (routes ))]
123
105
name := fmt .Sprintf ("Into%10s" , intMap [k ])
@@ -135,34 +117,34 @@ func BenchmarkDelete(b *testing.B) {
135
117
rt := new (cidrtree.Table )
136
118
cidrs := shuffleFullTable (k )
137
119
for _ , cidr := range cidrs {
138
- rt = rt . InsertImmutable (cidr , nil )
120
+ rt . Insert (cidr , nil )
139
121
}
140
122
probe := routes [mrand .Intn (len (routes ))]
141
123
name := fmt .Sprintf ("From%10s" , intMap [k ])
142
124
143
125
b .ResetTimer ()
144
126
b .Run (name , func (b * testing.B ) {
145
127
for n := 0 ; n < b .N ; n ++ {
146
- _ , _ = rt .DeleteImmutable (probe .cidr )
128
+ _ = rt .Delete (probe .cidr )
147
129
}
148
130
})
149
131
}
150
132
}
151
133
152
- func BenchmarkDeleteMutable (b * testing.B ) {
134
+ func BenchmarkDeleteImmutable (b * testing.B ) {
153
135
for k := 1 ; k <= 1_000_000 ; k *= 10 {
154
136
rt := new (cidrtree.Table )
155
137
cidrs := shuffleFullTable (k )
156
138
for _ , cidr := range cidrs {
157
- rt = rt . InsertImmutable (cidr , nil )
139
+ rt . Insert (cidr , nil )
158
140
}
159
141
probe := routes [mrand .Intn (len (routes ))]
160
142
name := fmt .Sprintf ("From%10s" , intMap [k ])
161
143
162
144
b .ResetTimer ()
163
145
b .Run (name , func (b * testing.B ) {
164
146
for n := 0 ; n < b .N ; n ++ {
165
- _ = rt .Delete (probe .cidr )
147
+ _ , _ = rt .DeleteImmutable (probe .cidr )
166
148
}
167
149
})
168
150
}
0 commit comments