|
@ -41,7 +41,7 @@ func (t *BoundedTree) EnsureVisited(p util.FullPath, visitFn VisitNodeFunc) (vis |
|
|
if t.root == nil { |
|
|
if t.root == nil { |
|
|
return |
|
|
return |
|
|
} |
|
|
} |
|
|
components := p.Split() |
|
|
|
|
|
|
|
|
components := util.FullPath(p[len(t.baseDir):]).Split() |
|
|
// fmt.Printf("components %v %d\n", components, len(components))
|
|
|
// fmt.Printf("components %v %d\n", components, len(components))
|
|
|
canDelete, err := t.ensureVisited(t.root, t.baseDir, components, 0, visitFn) |
|
|
canDelete, err := t.ensureVisited(t.root, t.baseDir, components, 0, visitFn) |
|
|
if err != nil { |
|
|
if err != nil { |
|
|