-
Notifications
You must be signed in to change notification settings - Fork 0
/
radix_string_test.go
88 lines (77 loc) · 1.71 KB
/
radix_string_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
// Copyright (C) 2022 Thierry Fournier <tfournier@arpalert.org>
package radix
import "testing"
func Test_string(t *testing.T) {
var r *Radix
var n *Node
var ns []*Node
var s string
/* Init DB */
r = NewRadix()
/* Insert string */
r.StringInsert("aaaa", "key aaaa")
r.StringInsert("aaa", "key aaa")
r.StringInsert("aa", "key aa")
/* Lookup exact */
n = r.StringGet("aaaa")
if n == nil {
t.Errorf("aaaa should be found")
} else {
if n.StringGetKey() != "aaaa" {
t.Errorf("aaaa should be found")
}
s, _ = n.Data.(string)
if s != "key aaaa" {
t.Errorf("\"key aaaa\" should be found")
}
}
/* Lookup exact */
n = r.StringGet("aa")
if n == nil {
t.Errorf("aa should be found")
} else {
if n.StringGetKey() != "aa" {
t.Errorf("aa should be found")
}
s, _ = n.Data.(string)
if s != "key aa" {
t.Errorf("\"key aa\" should be found")
}
}
/* lookup longest prefix */
n = r.StringLookupLonguest("aaaa stayin alive")
if n == nil {
t.Errorf("aaaa should be found")
} else {
if n.StringGetKey() != "aaaa" {
t.Errorf("aaaa should be found")
}
s, _ = n.Data.(string)
if s != "key aaaa" {
t.Errorf("\"key aaaa\" should be found")
}
}
/* lookup longest prefix */
n = r.StringLookupLonguest("aa stayin alive")
if n == nil {
t.Errorf("aa should be found")
} else {
if n.StringGetKey() != "aa" {
t.Errorf("aa should be found")
}
s, _ = n.Data.(string)
if s != "key aa" {
t.Errorf("\"key aa\" should be found")
}
}
/* lookup longest prefix */
n = r.StringLookupLonguest("ar stayin alive")
if n != nil {
t.Errorf("lookup should be nil")
}
/* Lookup longest path */
ns = r.StringLookupLonguestPath("aaaa")
if len(ns) != 3 {
t.Errorf("Expect 3 entries")
}
}