Package | Description |
---|---|
nu.validator.saxtree |
This package provides SAX Tree: a tree model optimized for creation from SAX
events and replay as SAX events.
|
Modifier and Type | Class and Description |
---|---|
class |
CDATA
A CDATA section.
|
class |
Characters
A run of characters
|
class |
CharBufferNode
A common superclass for character buffer node classes.
|
class |
Comment
A comment.
|
class |
Document
A document.
|
class |
DocumentFragment
A document fragment.
|
class |
DTD
A doctype.
|
class |
Element
An element.
|
class |
Entity
An entity.
|
class |
IgnorableWhitespace
A run ignorable whitespace.
|
class |
ParentNode
Common superclass for parent nodes.
|
class |
ProcessingInstruction
A processing instruction.
|
class |
SkippedEntity
A skipped entity.
|
Modifier and Type | Method and Description |
---|---|
Node |
ParentNode.appendChild(Node child)
Append a child to this node and return the child.
|
Node |
Node.getFirstChild()
Return the first child.
|
Node |
ParentNode.getFirstChild()
Returns the firstChild.
|
Node |
ParentNode.getLastChild()
Returns the lastChild.
|
Node |
Node.getNextSibling()
Returns the nextSibling.
|
Node |
Node.getPreviousSibling()
Returns the previous sibling
|
Node |
ParentNode.insertBefore(Node child,
Node sibling)
Insert a new child before a pre-existing child and return the newly inserted child.
|
Node |
ParentNode.insertBetween(Node child,
Node prev,
Node next) |
Modifier and Type | Method and Description |
---|---|
Node |
ParentNode.appendChild(Node child)
Append a child to this node and return the child.
|
void |
ParentNode.appendChildren(Node parent)
Append the children of another node to this node removing them from the other node .
|
Node |
ParentNode.insertBefore(Node child,
Node sibling)
Insert a new child before a pre-existing child and return the newly inserted child.
|
Node |
ParentNode.insertBetween(Node child,
Node prev,
Node next) |
void |
TreeParser.parse(Node node)
Causes SAX events for the tree rooted at the argument to be emitted.
|
Copyright © 2017. All rights reserved.