Iterator 添加GetNode函数, 修改SeNode缺字母SetNode

priority_queue/iterator.go

@@ -30,7 +30,11 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
-func (iter *Iterator) SeNode(n *Node) {
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
+func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0
 	iter.tstack.Clear()
@@ -61,7 +65,7 @@ func (iter *Iterator) Right() bool {
 func (iter *Iterator) GetNext(cur *Node, idx int) *Node {
 
 	// iter := NewIterator(cur)
-	iter.SeNode(cur)
+	iter.SetNode(cur)
 	iter.curPushNextStack(iter.up)
 	iter.up = iter.getNextUp(iter.up)
 
@@ -120,7 +124,7 @@ func (iter *Iterator) Next() (result bool) {
 func (iter *Iterator) GetPrev(cur *Node, idx int) *Node {
 
 	// iter := NewIterator(cur)
-	iter.SeNode(cur)
+	iter.SetNode(cur)
 	iter.curPushPrevStack(iter.up)
 	iter.up = iter.getPrevUp(iter.up)
 

priority_queuekey/iterator.go

@@ -30,7 +30,11 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
-func (iter *Iterator) SeNode(n *Node) {
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
+func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0
 	iter.tstack.Clear()
@@ -61,7 +65,7 @@ func (iter *Iterator) Right() bool {
 func (iter *Iterator) GetNext(cur *Node, idx int) *Node {
 
 	// iter := NewIterator(cur)
-	iter.SeNode(cur)
+	iter.SetNode(cur)
 	iter.curPushNextStack(iter.up)
 	iter.up = iter.getNextUp(iter.up)
 
@@ -120,7 +124,7 @@ func (iter *Iterator) Next() (result bool) {
 func (iter *Iterator) GetPrev(cur *Node, idx int) *Node {
 
 	// iter := NewIterator(cur)
-	iter.SeNode(cur)
+	iter.SetNode(cur)
 	iter.curPushPrevStack(iter.up)
 	iter.up = iter.getPrevUp(iter.up)
 

set/treeset/treeset.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"strings"
 
-	"github.com/474420502/focus/avldup"
+	"github.com/474420502/focus/tree/avldup"
 	"github.com/474420502/focus/compare"
 )
 

tree/avl/iterator.go

@@ -30,6 +30,10 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
 func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0

tree/avldup/iterator.go

@@ -30,6 +30,10 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
 func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0

tree/avlkey/iterator.go

@@ -30,6 +30,10 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
 func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0

tree/avlkeydup/iterator.go

@@ -30,6 +30,10 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
 func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0

tree/vbt/iterator.go

@@ -30,6 +30,10 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
 func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0

tree/vbtkey/iterator.go

@@ -30,6 +30,10 @@ func NewIteratorWithCap(n *Node, cap int) *Iterator {
 	return iter
 }
 
+func (iter *Iterator) GetNode() *Node {
+	return iter.cur
+}
+
 func (iter *Iterator) SetNode(n *Node) {
 	iter.up = n
 	iter.dir = 0