fix checking visited nodes

1 files changed, 8 insertions, 6 deletions

diff --git a/weed/util/bounded_tree/bounded_tree.go b/weed/util/bounded_tree/bounded_tree.go
index 5aa31ef74..efe2ff93a 100644
--- a/weed/util/bounded_tree/bounded_tree.go
+++ b/weed/util/bounded_tree/bounded_tree.go
@@ -1,6 +1,8 @@
 package bounded_tree
 
 import (
+	"fmt"
+
 	"github.com/chrislusf/seaweedfs/weed/glog"
 	"github.com/chrislusf/seaweedfs/weed/util"
 )
@@ -133,7 +135,7 @@ func (t *BoundedTree) HasVisited(p util.FullPath) bool {
 	}
 
 	components := p.Split()
-	// fmt.Printf("components %v %d\n", components, len(components))
+	fmt.Printf("components %v %d\n", components, len(components))
 	return t.hasVisited(t.root, util.FullPath("/"), components, 0)
 }
 
@@ -147,15 +149,15 @@ func (t *BoundedTree) hasVisited(n *Node, currentPath util.FullPath, components
 		return false
 	}
 
-	// fmt.Printf("  hasVisited child %v %v\n", currentPath, components[i])
+	fmt.Printf("  hasVisited child %v %+v %d\n", currentPath, components, i)
 
-	toVisitNode, found := n.Children[components[i]]
-	if !found {
+	if i >= len(components) {
 		return true
 	}
 
-	if i+1 >= len(components) {
-		return false
+	toVisitNode, found := n.Children[components[i]]
+	if !found {
+		return true
 	}
 
 	return t.hasVisited(toVisitNode, currentPath.Child(components[i]), components, i+1)