eson/focus
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

测试

Browse Source
This commit is contained in:
huangsimin 2019-07-18 14:32:37 +08:00
parent ff2ec652c9
commit 54dcdec379
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
priority_queue/vbt.go
View File

@ -114,7 +114,7 @@ func (tree *vbTree) IndexRange(idx1, idx2 int) (result []interface{}, ok bool) {
} }
n := tree.indexNode(idx1) n := tree.indexNode(idx1)
tree.iter.SeNode(n) tree.iter.SetNode(n)
iter := tree.iter iter := tree.iter
result = make([]interface{}, 0, idx1-idx2) result = make([]interface{}, 0, idx1-idx2)
for i := idx2; i <= idx1; i++ { for i := idx2; i <= idx1; i++ {
@ -136,7 +136,7 @@ func (tree *vbTree) IndexRange(idx1, idx2 int) (result []interface{}, ok bool) {
} }
if n := tree.indexNode(idx1); n != nil { if n := tree.indexNode(idx1); n != nil {
tree.iter.SeNode(n) tree.iter.SetNode(n)
iter := tree.iter iter := tree.iter
result = make([]interface{}, 0, idx2-idx1) result = make([]interface{}, 0, idx2-idx1)
for i := idx1; i <= idx2; i++ { for i := idx1; i <= idx2; i++ {
@ -276,7 +276,7 @@ func (tree *vbTree) GetRange(k1, k2 interface{}) (result []interface{}) {
result = make([]interface{}, 0, 8) result = make([]interface{}, 0, 8)
// iter := NewIterator(min) // iter := NewIterator(min)
tree.iter.SeNode(min) tree.iter.SetNode(min)
iter := tree.iter iter := tree.iter
for iter.Next() { for iter.Next() {
result = append(result, iter.Value()) result = append(result, iter.Value())
@ -303,7 +303,7 @@ func (tree *vbTree) GetRange(k1, k2 interface{}) (result []interface{}) {
result = make([]interface{}, 0, 8) result = make([]interface{}, 0, 8)
// iter := NewIterator(max) // iter := NewIterator(max)
tree.iter.SeNode(max) tree.iter.SetNode(max)
iter := tree.iter iter := tree.iter
for iter.Prev() { for iter.Prev() {
result = append(result, iter.Value()) result = append(result, iter.Value())
@ -356,7 +356,7 @@ func (tree *vbTree) getArounNode(key interface{}) (result [3]*Node) {
lastc = c lastc = c
case 0: case 0:
tree.iter.SeNode(n) tree.iter.SetNode(n)
iter := tree.iter iter := tree.iter
iter.Prev() iter.Prev()
for iter.Prev() { for iter.Prev() {
@ -416,7 +416,7 @@ func (tree *vbTree) GetNode(value interface{}) (*Node, bool) {
n = n.children[1] n = n.children[1]
case 0: case 0:
tree.iter.SeNode(n) tree.iter.SetNode(n)
iter := tree.iter iter := tree.iter
iter.Prev() iter.Prev()
for iter.Prev() { for iter.Prev() {