-
Notifications
You must be signed in to change notification settings - Fork 1
/
llrb_iterator_test.go
83 lines (78 loc) · 2.23 KB
/
llrb_iterator_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
// Copyright 2010 Petar Maymounkov. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// xiaonanln: since I am going to give SkipList the same interface
// as github.com/petar/GoLLRB/llrb, so I just use the same test file to test.
package skiplist
import (
"reflect"
"testing"
)
func TestAscendGreaterOrEqual(t *testing.T) {
tree := New()
tree.InsertNoReplace(Int(4))
tree.InsertNoReplace(Int(6))
tree.InsertNoReplace(Int(1))
tree.InsertNoReplace(Int(3))
var ary []Item
tree.AscendGreaterOrEqual(Int(-1), func(i Item) bool {
ary = append(ary, i)
return true
})
expected := []Item{Int(1), Int(3), Int(4), Int(6)}
if !reflect.DeepEqual(ary, expected) {
t.Errorf("expected %v but got %v", expected, ary)
}
ary = nil
tree.AscendGreaterOrEqual(Int(3), func(i Item) bool {
ary = append(ary, i)
return true
})
expected = []Item{Int(3), Int(4), Int(6)}
if !reflect.DeepEqual(ary, expected) {
t.Errorf("expected %v but got %v", expected, ary)
}
ary = nil
tree.AscendGreaterOrEqual(Int(2), func(i Item) bool {
ary = append(ary, i)
return true
})
expected = []Item{Int(3), Int(4), Int(6)}
if !reflect.DeepEqual(ary, expected) {
t.Errorf("expected %v but got %v", expected, ary)
}
}
//func TestDescendLessOrEqual(t *testing.T) {
// tree := New()
// tree.InsertNoReplace(Int(4))
// tree.InsertNoReplace(Int(6))
// tree.InsertNoReplace(Int(1))
// tree.InsertNoReplace(Int(3))
// var ary []Item
// tree.DescendLessOrEqual(Int(10), func(i Item) bool {
// ary = append(ary, i)
// return true
// })
// expected := []Item{Int(6), Int(4), Int(3), Int(1)}
// if !reflect.DeepEqual(ary, expected) {
// t.Errorf("expected %v but got %v", expected, ary)
// }
// ary = nil
// tree.DescendLessOrEqual(Int(4), func(i Item) bool {
// ary = append(ary, i)
// return true
// })
// expected = []Item{Int(4), Int(3), Int(1)}
// if !reflect.DeepEqual(ary, expected) {
// t.Errorf("expected %v but got %v", expected, ary)
// }
// ary = nil
// tree.DescendLessOrEqual(Int(5), func(i Item) bool {
// ary = append(ary, i)
// return true
// })
// expected = []Item{Int(4), Int(3), Int(1)}
// if !reflect.DeepEqual(ary, expected) {
// t.Errorf("expected %v but got %v", expected, ary)
// }
//}