2019-07-18 17:44:47 +00:00
|
|
|
package tree
|
|
|
|
|
|
|
|
|
|
import "github.com/miekg/dns"
|
|
|
|
|
|
2019-12-06 19:54:31 +00:00
|
|
|
// Walk performs fn on all authoritative values stored in the tree in
|
|
|
|
|
// in-order depth first. If a non-nil error is returned the Walk was interrupted
|
|
|
|
|
// by an fn returning that error. If fn alters stored values' sort
|
2019-07-18 17:44:47 +00:00
|
|
|
// relationships, future tree operation behaviors are undefined.
|
2019-12-06 19:54:31 +00:00
|
|
|
func (t *Tree) Walk(fn func(*Elem, map[uint16][]dns.RR) error) error {
|
2019-07-18 17:44:47 +00:00
|
|
|
if t.Root == nil {
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
return t.Root.walk(fn)
|
|
|
|
|
}
|
|
|
|
|
|
2019-12-06 19:54:31 +00:00
|
|
|
func (n *Node) walk(fn func(*Elem, map[uint16][]dns.RR) error) error {
|
2019-07-18 17:44:47 +00:00
|
|
|
if n.Left != nil {
|
|
|
|
|
if err := n.Left.walk(fn); err != nil {
|
|
|
|
|
return err
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-12-06 19:54:31 +00:00
|
|
|
|
2019-07-18 17:44:47 +00:00
|
|
|
if err := fn(n.Elem, n.Elem.m); err != nil {
|
|
|
|
|
return err
|
|
|
|
|
}
|
2019-12-06 19:54:31 +00:00
|
|
|
|
2019-07-18 17:44:47 +00:00
|
|
|
if n.Right != nil {
|
|
|
|
|
if err := n.Right.walk(fn); err != nil {
|
|
|
|
|
return err
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return nil
|
|
|
|
|
}
|