more test cases
This commit is contained in:
@@ -1,8 +1,6 @@
|
||||
package bounded_tree
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
|
||||
"github.com/chrislusf/seaweedfs/weed/glog"
|
||||
"github.com/chrislusf/seaweedfs/weed/util"
|
||||
)
|
||||
@@ -135,7 +133,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)
|
||||
}
|
||||
|
||||
@@ -149,7 +147,7 @@ func (t *BoundedTree) hasVisited(n *Node, currentPath util.FullPath, components
|
||||
return false
|
||||
}
|
||||
|
||||
fmt.Printf(" hasVisited child %v %+v %d\n", currentPath, components, i)
|
||||
// fmt.Printf(" hasVisited child %v %+v %d\n", currentPath, components, i)
|
||||
|
||||
if i >= len(components) {
|
||||
return true
|
||||
|
||||
Reference in New Issue
Block a user