Lines Matching refs:node
130 * @param node Single node to be added to the new set.
132 public NodeSet(Node node)
137 addNode(node);
141 * @return The root node of the Iterator, as specified when it was created.
178 * This attribute determines which node types are presented via the
217 * expanded and does not expose the entity reference node itself, use the
218 * whatToShow flags to hide the entity reference node and set
221 * expansion, use the whatToShow flags to show the entity reference node
234 * Returns the next node in the set and advances the position of the
236 * to nextNode() returns the first node in the set.
259 * Returns the previous node in the set and moves the position of the
267 * a cached type, and hence doesn't know what the previous node was.
274 XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NODESET_CANNOT_ITERATE, null)); //"This NodeSet can not iterate to a previous node!");
302 * first node in the set.
304 * @return true if nextNode() would return the first node in the set,
345 * @return The node at the <code>index</code>th position in the
358 * The number of nodes in the list. The range of valid child node indices is
374 * Add a node to the NodeSet. Not all types of NodeSets support this
391 * Insert a node at a given position.
394 * @param pos Offset at which the node is to be inserted,
409 * Remove a node.
426 * document order. If a node is null, don't add it.
459 * document order. Only genuine node references will be copied;
511 * document order. If a node is null, don't add it.
528 Node node = nodelist.item(i);
530 if (null != node)
532 addNodeInDocOrder(node, support);
539 * document order. If a node is null, don't add it.
552 Node node;
554 while (null != (node = iterator.nextNode()))
556 addNodeInDocOrder(node, support);
561 * Add the node list to this node set in document order.
582 Node node = nodelist.item(testIndex);
588 if (child == node)
595 if (!DOM2Helper.isNodeAfter(node, child))
597 insertElementAt(node, i + 1);
618 insertElementAt(node, 0);
625 * Add the node into a vector of nodes where it should occur in
627 * @param node The node to be added.
634 public int addNodeInDocOrder(Node node, boolean test, XPathContext support)
654 if (child == node)
661 if (!DOM2Helper.isNodeAfter(node, child))
671 insertElementAt(node, insertIndex);
682 if (this.item(i).equals(node))
691 addElement(node);
699 * Add the node into a vector of nodes where it should occur in
701 * @param node The node to be added.
708 public int addNodeInDocOrder(Node node, XPathContext support)
714 return addNodeInDocOrder(node, true, support);
718 /** If this node is being used as an iterator, the next index that nextNode()
736 * Set the current position in the node set.
752 * Return the last fetched node. Needed to support the UnionPathIterator.
754 * @return the last fetched node.
779 * Get whether or not this is a cached node set.
795 * @param b true if this node set should be cached.
943 * Pop a node from the tail of the vector and return the result.
945 * @return the node at the tail of the vector
960 * Pop a node from the tail of the vector and return the
976 * Pop a node from the tail of the vector.
987 * Return the node at the top of the stack without popping the stack.
1004 * @param v1 First node to add to vector
1005 * @param v2 Second node to add to vector
1048 * Set the tail of the stack to the given node.
1060 * Set the given node one position from the tail.
1072 * Return the node at the tail of the vector without popping
1084 * Return the node one position from the tail without popping.
1096 * Inserts the specified node in this vector at the specified index.
1167 * Inserts the specified node in this vector at the specified index.
1195 * @return True if the node was successfully removed
1207 Node node = m_map[i];
1209 if ((null != node) && node.equals(s))
1230 * @param i Index of node to remove
1257 * @param node Node to set
1258 * @param index Index of where to set the node
1260 public void setElementAt(Node node, int index)
1271 m_map[index] = node;
1277 * @param i Index of node to get
1291 * Tell if the table contains the given node.
1295 * @return True if the given node was found.
1306 Node node = m_map[i];
1308 if ((null != node) && node.equals(s))
1335 Node node = m_map[i];
1337 if ((null != node) && node.equals(elem))
1363 Node node = m_map[i];
1365 if ((null != node) && node.equals(elem))