Modifier and Type	Class and Description
pack-priv static class	DOMSubTreeData.DelayedNodeIterator This is an Iterator that contains a backing node-set that is not populated until the caller first attempts to advance the iterator.

Modifier and Type	Field and Description
private boolean	excludeComments
private Node	root

Access	Constructor and Description
public	DOMSubTreeData(Node root, boolean excludeComments)

Modifier and Type	Method and Description
public boolean	excludeComments()
public Node	getRoot()
public Iterator<Node>	iterator() Implements javax.xml.crypto.NodeSetData.iterator. Returns a read-only iterator over the nodes contained in this `NodeSetData` in document order.

excludeComments	back to summary
private boolean excludeComments

root	back to summary
private Node root

DOMSubTreeData	back to summary
public DOMSubTreeData(Node root, boolean excludeComments)

excludeComments	back to summary
public boolean excludeComments()

getRoot	back to summary
public Node getRoot()

iterator	back to summary
public Iterator<Node> iterator() Implements javax.xml.crypto.NodeSetData.iterator. Doc from javax.xml.crypto.NodeSetData.iterator. Returns a read-only iterator over the nodes contained in this `NodeSetData` in document order. Attempts to modify the returned iterator via the `remove` method throw `UnsupportedOperationException`. Annotations @Override

org.jcp.xml.dsig.internal.dom back to summary

pack-priv Class DOMSubTreeData.DelayedNodeIterator

Class Inheritance

extends Object
implements Iterator<Node>

java.lang.Object
org.jcp.xml.dsig.internal.dom.DOMSubTreeData.DelayedNodeIterator

All Implemented Interfaces

java.util.Iterator

This is an Iterator that contains a backing node-set that is not populated until the caller first attempts to advance the iterator.

Field Summary

Modifier and Type	Field and Description
private ListIterator<Node>	li
private List<Node>	nodeSet
private Node	root
private boolean	withComments

Constructor Summary

Access	Constructor and Description
pack-priv	DelayedNodeIterator(Node root, boolean excludeComments)

Method Summary

Modifier and Type	Method and Description
private List<Node>	Returns: a set of nodes (minus any comment nodes) dereferenceSameDocumentURI(Node the node (document or element) referenced by the URI fragment. If null, returns an empty set. node) Dereferences a same-document URI fragment.
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public Node	next() Implements java.util.Iterator.next. Returns the next element in the iteration.
private void	nodeSetMinusCommentNodes(Node the node to traverse node, List<Node> the set of nodes traversed so far nodeSet, Node the previous sibling node prevSibling) Recursively traverses the subtree, and returns an XPath-equivalent node-set of all nodes traversed, excluding any comment nodes, if specified.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

li	back to summary
private ListIterator<Node> li

nodeSet	back to summary
private List<Node> nodeSet

root	back to summary
private Node root

withComments	back to summary
private boolean withComments

Constructor Detail

DelayedNodeIterator	back to summary
pack-priv DelayedNodeIterator(Node root, boolean excludeComments)

Method Detail

dereferenceSameDocumentURI	back to summary
private List<Node> dereferenceSameDocumentURI(Node node) Dereferences a same-document URI fragment. Parameters node:Node the node (document or element) referenced by the URI fragment. If null, returns an empty set. Returns:List<Node> a set of nodes (minus any comment nodes)

dereferenceSameDocumentURI

back to summary

private List<Node> dereferenceSameDocumentURI(Node node)

Dereferences a same-document URI fragment.

Parameters

node:Node: the node (document or element) referenced by the URI fragment. If null, returns an empty set.

Returns:List<Node>

a set of nodes (minus any comment nodes)

hasNext back to summary

hasNext	back to summary
public boolean hasNext() Implements java.util.Iterator.hasNext. Doc from java.util.Iterator.hasNext. Returns `true` if the iteration has more elements. (In other words, returns `true` if `next` would return an element rather than throwing an exception.) Annotations @Override

public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Annotations

@Override

next	back to summary
public Node next() Implements java.util.Iterator.next. Doc from java.util.Iterator.next. Returns the next element in the iteration. Annotations @Override

back to summary

public Node next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Annotations

@Override

nodeSetMinusCommentNodes	back to summary
private void nodeSetMinusCommentNodes(Node node, List<Node> nodeSet, Node prevSibling) Recursively traverses the subtree, and returns an XPath-equivalent node-set of all nodes traversed, excluding any comment nodes, if specified. Parameters node:Node the node to traverse nodeSet:List<Node> the set of nodes traversed so far prevSibling:Node the previous sibling node Annotations @SuppressWarnings:fallthrough

nodeSetMinusCommentNodes

back to summary

private void nodeSetMinusCommentNodes(Node node, List<Node> nodeSet, Node prevSibling)

Recursively traverses the subtree, and returns an XPath-equivalent node-set of all nodes traversed, excluding any comment nodes, if specified.

Parameters

node:Node: the node to traverse
nodeSet:List<Node>: the set of nodes traversed so far
prevSibling:Node: the previous sibling node

Annotations

@SuppressWarnings:fallthrough

remove back to summary

remove	back to summary
public void remove() Overrides default java.util.Iterator.remove. Doc from java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to `next`. The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy. The behavior of an iterator is unspecified if this method is called after a call to the `forEachRemaining` method. Annotations @Override

public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

Annotations

@Override

public Class DOMSubTreeData

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class DOMSubTreeData.DelayedNodeIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail