Class Cleaner.CleaningVisitor
- java.lang.Object
-
- com.itextpdf.styledxmlparser.jsoup.safety.Cleaner.CleaningVisitor
-
- All Implemented Interfaces:
NodeVisitor
- Enclosing class:
- Cleaner
private final class Cleaner.CleaningVisitor extends java.lang.Object implements NodeVisitor
Iterates the input and copies trusted nodes (tags, attributes, text) into the destination.
-
-
Field Summary
Fields Modifier and Type Field Description private Elementdestination(package private) intnumDiscardedprivate Elementroot
-
Constructor Summary
Constructors Constructor Description CleaningVisitor(Element root, Element destination)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidhead(Node source, int depth)Callback for when a node is first visited.voidtail(Node source, int depth)Callback for when a node is last visited, after all of its descendants have been visited.
-
-
-
Method Detail
-
head
public void head(Node source, int depth)
Description copied from interface:NodeVisitorCallback for when a node is first visited.The node may be modified (e.g.
Node.attr(String)or replacedNode.replaceWith(Node)). If it'sinstanceOf Element, you may cast it to anElementand access those methods.Note that nodes may not be removed during traversal using this method; use
NodeTraversor.filter(NodeFilter, Node)with aNodeFilter.FilterResult.REMOVEreturn instead.- Specified by:
headin interfaceNodeVisitor- Parameters:
source- the node being visited.depth- the depth of the node, relative to the root node. E.g., the root node has depth 0, and a child node of that will have depth 1.
-
tail
public void tail(Node source, int depth)
Description copied from interface:NodeVisitorCallback for when a node is last visited, after all of its descendants have been visited.Note that replacement with
Node.replaceWith(Node)is not supported intail.- Specified by:
tailin interfaceNodeVisitor- Parameters:
source- the node being visited.depth- the depth of the node, relative to the root node. E.g., the root node has depth 0, and a child node of that will have depth 1.
-
-