public class NodeTraversor extends Object
This implementation does not use recursion, so a deep DOM does not risk blowing the stack.
Constructor and Description |
---|
NodeTraversor() |
Modifier and Type | Method and Description |
---|---|
static void |
filter(NodeFilter filter,
Elements elements)
Start a depth-first filtering of all elements.
|
static NodeFilter.FilterResult |
filter(NodeFilter filter,
Node root)
Start a depth-first filtering of the root and all of its descendants.
|
static void |
traverse(NodeVisitor visitor,
Elements elements)
Start a depth-first traverse of all elements.
|
static void |
traverse(NodeVisitor visitor,
Node root)
Start a depth-first traverse of the root and all of its descendants.
|
public static void traverse(NodeVisitor visitor, Node root)
visitor
- Node visitor.root
- the root node point to traverse.public static void traverse(NodeVisitor visitor, Elements elements)
visitor
- Node visitor.elements
- Elements to filter.public static NodeFilter.FilterResult filter(NodeFilter filter, Node root)
filter
- Node visitor.root
- the root node point to traverse.NodeFilter.FilterResult.STOP
.public static void filter(NodeFilter filter, Elements elements)
filter
- Node filter.elements
- Elements to filter.Copyright © 2009–2024 Jonathan Hedley. All rights reserved.