@@ -10,10 +10,6 @@ import "iter"
1010
1111// Ancestors returns an iterator over the ancestors of n, starting with n.Parent.
1212//
13- // Example:
14- //
15- // for ancestor := range n.Ancestors() { ... }
16- //
1713// Mutating a Node or its parents while iterating may have unexpected results.
1814func (n * Node ) Ancestors () iter.Seq [* Node ] {
1915 _ = n .Parent // eager nil check
@@ -27,10 +23,6 @@ func (n *Node) Ancestors() iter.Seq[*Node] {
2723// ChildNodes returns an iterator over the immediate children of n,
2824// starting with n.FirstChild.
2925//
30- // Example:
31- //
32- // for child := range n.ChildNodes() { ... }
33- //
3426// Mutating a Node or its children while iterating may have unexpected results.
3527func (n * Node ) ChildNodes () iter.Seq [* Node ] {
3628 _ = n .FirstChild // eager nil check
@@ -45,16 +37,12 @@ func (n *Node) ChildNodes() iter.Seq[*Node] {
4537// Descendants returns an iterator over all nodes recursively beneath
4638// n, excluding n itself. Nodes are visited in depth-first preorder.
4739//
48- // Example:
49- //
50- // for desc := range n.Descendants() { ... }
51- //
5240// Mutating a Node or its descendants while iterating may have unexpected results.
5341func (n * Node ) Descendants () iter.Seq [* Node ] {
5442 _ = n .FirstChild // eager nil check
5543
5644 return func (yield func (* Node ) bool ) {
57- _ = n .descendants (yield )
45+ n .descendants (yield )
5846 }
5947}
6048
0 commit comments