Searched defs:startNode (Results 1 - 7 of 7) sorted by relevance

/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMTreeWalker.java100 * operating as a Visitor. startNode (preorder) and endNode
116 startNode(pos);
150 * operating as a Visitor. startNode (preorder) and endNode
169 startNode(pos);
217 protected void startNode(int node) throws org.xml.sax.SAXException method in class:DTMTreeWalker
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/
H A DTreeWalker.java148 startNode(pos);
202 startNode(pos);
261 protected void startNode(Node node) throws org.xml.sax.SAXException method in class:TreeWalker
325 // System.out.println("TreeWalker#startNode: "+node.getNodeName());
337 // System.out.println("TreeWalker#startNode: attr["+i+"] = "+attrName+", "+attr.getNodeValue());
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DTreeWalker.java180 startNode(pos);
233 startNode(pos);
292 protected void startNode(Node node) throws org.xml.sax.SAXException method in class:TreeWalker
338 // System.out.println("TreeWalker#startNode: "+node.getNodeName());
345 // System.out.println("TreeWalker#startNode: attr["+i+"] = "+attrName+", "+attr.getNodeValue());
348 // System.out.println("TreeWalker#startNode: attr["+i+"] = "+attrName+", "+attr.getNodeValue());
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/utils/
H A DXMLUtils.java726 public static boolean protectAgainstWrappingAttack(Node startNode, argument
729 Node startParent = startNode.getParentNode();
738 while (startNode != null) {
739 if (startNode.getNodeType() == Node.ELEMENT_NODE) {
740 Element se = (Element) startNode;
759 processedNode = startNode;
760 startNode = startNode.getFirstChild();
763 if (startNode == null) {
765 startNode
788 protectAgainstWrappingAttack(Node startNode, Element knownElement, String value) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentLinkedDeque.java1327 abstract Node<E> startNode(); method in class:ConcurrentLinkedDeque.AbstractItr
1341 Node<E> p = (nextNode == null) ? startNode() : nextNode(nextNode);
1380 Node<E> startNode() { return first(); } method in class:ConcurrentLinkedDeque.Itr
1386 Node<E> startNode() { return last(); } method in class:ConcurrentLinkedDeque.DescendingItr
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java1915 private void DFS(LayoutNode startNode) { argument
1916 if (visited.contains(startNode)) {
1921 stack.push(startNode);
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dtd/
H A DDTDGrammar.java2320 private final CMNode buildSyntaxTree(int startNode, argument
2325 getContentSpec(startNode, contentSpec);

Completed in 3886 milliseconds