-
Notifications
You must be signed in to change notification settings - Fork 0
/
container_test.go
123 lines (118 loc) · 2.31 KB
/
container_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
package trie
import (
"testing"
)
func TestHexmap(t *testing.T) {
var m = NewHexMap()
var keys = []byte("0123456789abcdef")
for _, k := range keys {
m.Set(k, newTrieNode(k, NewHexMap))
}
for _, k := range keys {
v, ok := m.Get(k)
if !ok {
t.Logf("no key:%v fail\n", k)
t.Fail()
continue
}
if k != v.nodeKey {
t.Logf("key:%v-%v fail\n", k, v.nodeKey)
t.Fail()
}
if k != v.val.(byte) {
t.Logf("val:%v-%v fail\n", k, v.val)
t.Fail()
}
}
if ok, i := SliceEq(keys, m.Keys()); !ok {
t.Logf("key %d:%v\n%v fails\n", i, keys, m.Keys())
t.Fail()
}
}
func TestNmap(t *testing.T) {
var m = NewNmap()
var keys = []byte("0123456789")
for _, k := range keys {
m.Set(k, newTrieNode(k, NewNmap))
}
for _, k := range keys {
v, ok := m.Get(k)
if !ok {
t.Logf("no key:%v fail\n", k)
t.Fail()
continue
}
if k != v.nodeKey {
t.Logf("key:%v-%v fail\n", k, v.nodeKey)
t.Fail()
}
if k != v.val.(byte) {
t.Logf("val:%v-%v fail\n", k, v.val)
t.Fail()
}
}
if ok, i := SliceEq(keys, m.Keys()); !ok {
t.Logf("key %d:%v\n%v fails\n", i, keys, m.Keys())
t.Fail()
}
}
func TestLinkmap(t *testing.T) {
var m = NewLinkmap()
var keys = make([]byte, 0, 256)
for i := 0; i < 256; i++ {
keys = append(keys, byte(i))
}
for _, k := range keys {
m.Set(k, newTrieNode(k, NewLinkmap))
}
for _, k := range keys {
v, ok := m.Get(k)
if !ok {
t.Logf("no key:%v fail\n", k)
t.Fail()
continue
}
if k != v.nodeKey {
t.Logf("key:%v-%v fail\n", k, v.nodeKey)
t.Fail()
}
if k != v.val.(byte) {
t.Logf("val:%v-%v fail\n", k, v.val)
t.Fail()
}
}
if ok, i := SliceEq(keys, m.Keys()); !ok {
t.Logf("key %d:%v\n%v fails\n", i, keys, m.Keys())
t.Fail()
}
}
func TestBytemap(t *testing.T) {
var m = NewByteMap()
var keys = make([]byte, 0, 256)
for i := 0; i < 256; i++ {
keys = append(keys, byte(i))
}
for _, k := range keys {
m.Set(k, newTrieNode(k, NewByteMap))
}
for _, k := range keys {
v, ok := m.Get(k)
if !ok {
t.Logf("no key:%v fail\n", k)
t.Fail()
continue
}
if k != v.nodeKey {
t.Logf("key:%v-%v fail\n", k, v.nodeKey)
t.Fail()
}
if k != v.val.(byte) {
t.Logf("val:%v-%v fail\n", k, v.val)
t.Fail()
}
}
if ok, i := SliceEq(keys, m.Keys()); !ok {
t.Logf("key %d:%v\n%v fails\n", i, keys, m.Keys())
t.Fail()
}
}