|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--org.apache.xml.utils.NodeVector | +--org.apache.xpath.NodeSet
**For advanced use only**
The NodeSet class can act as either a NodeVector, NodeList, or NodeIterator. However, in order for it to act as a NodeVector or NodeList, it's required that setShouldCacheNodes(true) be called before the first nextNode() is called, in order that nodes can be added as they are fetched. Derived classes that implement iterators must override runTo(int index), in order that they may run the iteration to the given index.
Note that we directly implement the DOM's NodeIterator interface. We do not emulate all the behavior of the standard NodeIterator. In particular, we do not guarantee to present a "live view" of the document ... but in XSLT, the source document should never be mutated, so this should never be an issue.
Thought: Should NodeSet really implement NodeList and NodeIterator, or should there be specific subclasses of it which do so? The advantage of doing it all here is that all NodeSets will respond to the same calls; the disadvantage is that some of them may return less-than-enlightening results when you do so.
Constructor Summary | |
NodeSet()
Create an empty nodelist. |
|
NodeSet(int blocksize)
Create an empty, using the given block size. |
|
NodeSet(Node node)
Create a NodeSet which contains the given Node. |
|
NodeSet(NodeIterator ni)
Create a NodeSet, and copy the members of the given NodeIterator into it. |
|
NodeSet(NodeList nodelist)
Create a NodeSet, and copy the members of the given nodelist into it. |
|
NodeSet(NodeSet nodelist)
Create a NodeSet, and copy the members of the given NodeSet into it. |
Method Summary | |
void |
addElement(Node value)
Append a Node onto the vector. |
void |
addNode(Node n)
Add a node to the NodeSet. |
int |
addNodeInDocOrder(Node node,
boolean test,
XPathContext support)
Add the node into a vector of nodes where it should occur in document order. |
int |
addNodeInDocOrder(Node node,
XPathContext support)
Add the node into a vector of nodes where it should occur in document order. |
void |
addNodes(NodeIterator iterator)
Copy NodeList members into this nodelist, adding in document order. |
void |
addNodes(NodeList nodelist)
Copy NodeList members into this nodelist, adding in document order. |
void |
addNodes(NodeSet ns)
Copy NodeList members into this nodelist, adding in document order. |
void |
addNodesInDocOrder(NodeIterator iterator,
XPathContext support)
Copy NodeList members into this nodelist, adding in document order. |
void |
addNodesInDocOrder(NodeList nodelist,
XPathContext support)
Copy NodeList members into this nodelist, adding in document order. |
void |
appendNodes(NodeVector nodes)
Append the nodes to the list. |
java.lang.Object |
clone()
Clone this NodeSet. |
NodeIterator |
cloneWithReset()
Get a cloned Iterator, and reset its state to the beginning of the iteration. |
boolean |
contains(Node s)
Tell if the table contains the given node. |
void |
detach()
Detaches the iterator from the set which it iterated over, releasing any computational resources and placing the iterator in the INVALID state. |
Node |
elementAt(int i)
Get the nth element. |
Node |
getCurrentNode()
Return the last fetched node. |
int |
getCurrentPos()
Get the current position, which is one less than the next nextNode() call will retrieve. |
boolean |
getExpandEntityReferences()
The value of this flag determines whether the children of entity reference nodes are visible to the iterator. |
NodeFilter |
getFilter()
The filter object used to screen nodes. |
int |
getLast()
|
int |
getLength()
The number of nodes in the list. |
Node |
getRoot()
|
boolean |
getShouldCacheNodes()
Get whether or not this is a cached node set. |
int |
getWhatToShow()
This attribute determines which node types are presented via the iterator. |
int |
indexOf(Node elem)
Searches for the first occurence of the given argument, beginning the search at index, and testing for equality using the equals method. |
int |
indexOf(Node elem,
int index)
Searches for the first occurence of the given argument, beginning the search at index, and testing for equality using the equals method. |
void |
insertElementAt(Node value,
int at)
Inserts the specified node in this vector at the specified index. |
void |
insertNode(Node n,
int pos)
Insert a node at a given position. |
boolean |
isFresh()
Tells if this NodeSet is "fresh", in other words, if the first nextNode() that is called will return the first node in the set. |
Node |
item(int index)
Returns the index th item in the collection. |
Node |
nextNode()
Returns the next node in the set and advances the position of the iterator in the set. |
Node |
previousNode()
Returns the previous node in the set and moves the position of the iterator backwards in the set. |
void |
removeAllElements()
Inserts the specified node in this vector at the specified index. |
boolean |
removeElement(Node s)
Removes the first occurrence of the argument from this vector. |
void |
removeElementAt(int i)
Deletes the component at the specified index. |
void |
removeNode(Node n)
Remove a node. |
void |
reset()
Reset the iterator. |
void |
runTo(int index)
If an index is requested, NodeSet will call this method to run the iterator to the index. |
void |
setCurrentPos(int i)
Set the current position in the node set. |
void |
setElementAt(Node node,
int index)
Sets the component at the specified index of this vector to be the specified object. |
void |
setLast(int last)
|
void |
setShouldCacheNodes(boolean b)
If setShouldCacheNodes(true) is called, then nodes will be cached. |
int |
size()
Get the length of the list. |
Methods inherited from class org.apache.xml.utils.NodeVector |
peepOrNull,
peepTail,
peepTailSub1,
pop,
popAndTop,
popPair,
popQuick,
push,
pushPair,
setTail,
setTailSub1 |
Methods inherited from class java.lang.Object |
equals,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
Constructor Detail |
public NodeSet()
public NodeSet(int blocksize)
blocksize
- Size of blocks to allocatepublic NodeSet(NodeList nodelist)
nodelist
- List of Nodes to be made members of the new set.public NodeSet(NodeSet nodelist)
nodelist
- Set of Nodes to be made members of the new set.public NodeSet(NodeIterator ni)
ni
- Iterator which yields Nodes to be made members of the new set.public NodeSet(Node node)
node
- Single node to be added to the new set.Method Detail |
public Node getRoot()
public java.lang.Object clone() throws java.lang.CloneNotSupportedException
public NodeIterator cloneWithReset() throws java.lang.CloneNotSupportedException
public void reset()
public int getWhatToShow()
NodeFilter
interface. For NodeSets, the mask has been
hardcoded to show all nodes except EntityReference nodes, which have
no equivalent in the XPath data model.SHOW_ALL & ~SHOW_ENTITY_REFERENCE
, meaning that
only entity references are suppressed.public NodeFilter getFilter()
public boolean getExpandEntityReferences()
public Node nextNode() throws DOMException
Node
in the set being iterated over, or
null
if there are no more members in that set.detach
method was invoked.public Node previousNode() throws DOMException
Node
in the set being iterated over,
ornull
if there are no more members in that set.detach
method was invoked.public void detach()
detach
has been invoked, calls to
nextNode
orpreviousNode
will raise the
exception INVALID_STATE_ERR.
This operation is a no-op in NodeSet, and will not cause INVALID_STATE_ERR to be raised by later operations.
public boolean isFresh()
public void runTo(int index)
index
- Position to advance (or retreat) to, with
0 requesting the reset ("fresh") position and -1 (or indeed
any out-of-bounds value) requesting the final position.public Node item(int index)
index
th item in the collection. If
index
is greater than or equal to the number of nodes in
the list, this returns null
.
TODO: What happens if index is out of range?index
- Index into the collection.index
th position in the
NodeList
, or null
if that is not a valid
index.public int getLength()
length-1
inclusive. Note that this operation requires
finding all the matching nodes, which may defeat attempts to defer
that work.public void addNode(Node n)
n
- Node to be addedpublic void insertNode(Node n, int pos)
n
- Node to be addedpos
- Offset at which the node is to be inserted,
with 0 being the first position.public void removeNode(Node n)
n
- Node to be addedpublic void addNodes(NodeList nodelist)
nodelist
- List of nodes which should now be referenced by
this NodeSet.public void addNodes(NodeSet ns)
Copy NodeList members into this nodelist, adding in document order. Only genuine node references will be copied; nulls appearing in the source NodeSet will not be added to this one.
In case you're wondering why this function is needed: NodeSet implements both NodeIterator and NodeList. If this method isn't provided, Java can't decide which of those to use when addNodes() is invoked. Providing the more-explicit match avoids that ambiguity.)
ns
- NodeSet whose members should be merged into this NodeSet.public void addNodes(NodeIterator iterator)
iterator
- NodeIterator which yields the nodes to be added.public void addNodesInDocOrder(NodeList nodelist, XPathContext support)
nodelist
- List of nodes to be addedsupport
- The XPath runtime context.public void addNodesInDocOrder(NodeIterator iterator, XPathContext support)
iterator
- NodeIterator which yields the nodes to be added.support
- The XPath runtime context.public int addNodeInDocOrder(Node node, boolean test, XPathContext support)
v
- Vector of nodes, presumably containing Nodesobj
- Node object.node
- The node to be added.test
- true if we should test for doc ordersupport
- The XPath runtime context.public int addNodeInDocOrder(Node node, XPathContext support)
v
- Vector of nodes, presumably containing Nodesobj
- Node object.node
- The node to be added.support
- The XPath runtime context.public int size()
public void addElement(Node value)
value
- The node to be added.public void insertElementAt(Node value, int at)
value
- The node to be inserted.at
- The index where the insert should occur.public void appendNodes(NodeVector nodes)
nodes
- The nodes to be appended to this node set.public void removeAllElements()
public boolean removeElement(Node s)
s
- The node to be removed.public void removeElementAt(int i)
i
- The index of the node to be removed.public void setElementAt(Node node, int index)
node
- The node to be set.index
- The index of the node to be replaced.public Node elementAt(int i)
i
- The index of the requested node.public boolean contains(Node s)
s
- Node to look forpublic int indexOf(Node elem, int index)
elem
- Node to look forindex
- Index of where to start the searchpublic int indexOf(Node elem)
elem
- Node to look forpublic int getCurrentPos()
public void setCurrentPos(int i)
i
- Must be a valid index.public Node getCurrentNode()
public boolean getShouldCacheNodes()
public void setShouldCacheNodes(boolean b)
b
- true if this node set should be cached.public int getLast()
public void setLast(int last)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |