// prune finds children of n that match sel, and adds them to toDelete.
prune finds children of n that match sel, and adds them to toDelete.
// prune finds children of n that match sel and adds them to toDelete .
func prune(n *html.Node, sel selector, toDelete map[*html.Node]bool) {
	for child := n.FirstChild; child != nil; child = child.NextSibling {
		switch {
		case toDelete[child]:
		case sel.Selector(child):
			toDelete[child] = true
		default:
			prune(child, sel, toDelete)
		}
	}
}
func prune ( n * html . Node , sel selector , toDelete map [ * html . Node ] bool ) { for child := n . FirstChild ; child != nil ; child = child . NextSibling { switch { case toDelete [ child ] : case sel . Selector ( child ) : toDelete [ child ] = true default : prune ( child , sel , toDelete ) } } }
prune finds children of n that match sel, and adds them to toDelete.
prune finds children of n that match sel and adds them to toDelete .
// Ignore it.