| Constructor and Description |
|---|
BodyNode() |
| Modifier and Type | Method and Description |
|---|---|
Node |
copyTree() |
List<Node> |
getMinimalDeletedSet(long id)
This recursive method considers a descendant deleted if all its
children had
TextNodes that now are marked as removed
with the provided id. |
addChild, addChild, equals, expandWhiteSpace, getAttributes, getChild, getEndTag, getIndexOf, getLeftMostChild, getMatchRatio, getNbChildren, getOpeningTag, getQName, getRightMostChild, hashCode, isBlockLevel, isBlockLevel, isBlockLevel, isInline, isInline, isInline, isPre, isSameTag, isSimilarTag, iterator, setRoot, splitUntill, toStringdetectIgnorableWhiteSpace, getLastCommonParent, getParent, getParentTree, getRoot, inPre, isWhiteAfter, isWhiteBefore, setParent, setWhiteAfter, setWhiteBeforeclone, finalize, getClass, notify, notifyAll, wait, wait, waitforEach, spliteratorpublic List<Node> getMinimalDeletedSet(long id)
TagNode This recursive method considers a descendant deleted if all its
children had TextNodes that now are marked as removed
with the provided id. If all children of a descendant is considered
deleted, only that descendant is kept in the collection of the
deleted nodes, and its children are removed from the collection
of the deleted nodes.
The HTML tag nodes that never had any text content are never considered
removed
It actually might have nothing to do with being really deleted, because
the element might be kept after its text content was deleted.
Example:
table cells can be kept after its text content was deleted
horizontal rule has never had text content, but can be deleted
getMinimalDeletedSet in class TagNodeCopyright © 2022. All rights reserved.