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
|
package html // import "github.com/tdewolff/parse/html"
import (
"bytes"
"testing"
"github.com/tdewolff/test"
)
func TestHashTable(t *testing.T) {
test.T(t, ToHash([]byte("address")), Address, "'address' must resolve to Address")
test.T(t, Address.String(), "address")
test.T(t, Accept_Charset.String(), "accept-charset")
test.T(t, ToHash([]byte("")), Hash(0), "empty string must resolve to zero")
test.T(t, Hash(0xffffff).String(), "")
test.T(t, ToHash([]byte("iter")), Hash(0), "'iter' must resolve to zero")
test.T(t, ToHash([]byte("test")), Hash(0), "'test' must resolve to zero")
}
////////////////////////////////////////////////////////////////
var result int
// naive scenario
func BenchmarkCompareBytes(b *testing.B) {
var r int
val := []byte("span")
for n := 0; n < b.N; n++ {
if bytes.Equal(val, []byte("span")) {
r++
}
}
result = r
}
// using-atoms scenario
func BenchmarkFindAndCompareAtom(b *testing.B) {
var r int
val := []byte("span")
for n := 0; n < b.N; n++ {
if ToHash(val) == Span {
r++
}
}
result = r
}
// using-atoms worst-case scenario
func BenchmarkFindAtomCompareBytes(b *testing.B) {
var r int
val := []byte("zzzz")
for n := 0; n < b.N; n++ {
if h := ToHash(val); h == 0 && bytes.Equal(val, []byte("zzzz")) {
r++
}
}
result = r
}
|
