bounded_tree

Documentation

Index

• type BoundedTree
  • func NewBoundedTree() *BoundedTree
  • func (t *BoundedTree) EnsureVisited(p util.FullPath, visitFn VisitNodeFunc)
  • func (t *BoundedTree) HasVisited(p util.FullPath) bool
• type Node
• type VisitNodeFunc

Types

type BoundedTree

type BoundedTree struct {
	sync.RWMutex
	// contains filtered or unexported fields
}

func NewBoundedTree

func NewBoundedTree() *BoundedTree

func (*BoundedTree) EnsureVisited

func (t *BoundedTree) EnsureVisited(p util.FullPath, visitFn VisitNodeFunc)

If the path is not visited, call the visitFn for each level of directory No action if the directory has been visited before or does not exist. A leaf node, which has no children, represents a directory not visited. A non-leaf node or a non-existing node represents a directory already visited, or does not need to visit.

func (*BoundedTree) HasVisited

func (t *BoundedTree) HasVisited(p util.FullPath) bool

type Node

type Node struct {
	Parent   *Node
	Name     string
	Children map[string]*Node
}

type VisitNodeFunc

type VisitNodeFunc func(path util.FullPath) (childDirectories []string, err error)