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
|
package iradix
import (
"testing"
)
func TestNodeWalk(t *testing.T) {
r := New[any]()
keys := []string{"001", "002", "005", "010", "100"}
for _, k := range keys {
r, _, _ = r.Insert([]byte(k), nil)
}
i := 0
r.Root().Walk(func(k []byte, _ any) bool {
got := string(k)
want := keys[i]
if got != want {
t.Errorf("got %s, want: %s", got, want)
}
i++
if i >= len(keys) {
return true
}
return false
})
}
func TestNodeWalkBackwards(t *testing.T) {
r := New[any]()
keys := []string{"001", "002", "005", "010", "100"}
for _, k := range keys {
r, _, _ = r.Insert([]byte(k), nil)
}
i := len(keys) - 1
r.Root().WalkBackwards(func(k []byte, _ any) bool {
got := string(k)
want := keys[i]
if got != want {
t.Errorf("got %s, want: %s", got, want)
}
i--
if i < 0 {
return true
}
return false
})
}
|
