Searched defs:traverse (Results 1 - 11 of 11) sorted by relevance

/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/traversers/
H A DXSDNotationTraverser.java57 XSNotationDecl traverse(Element elmNode, method in class:XSDNotationTraverser
H A DXSDKeyrefTraverser.java33 * This class contains code that is used to traverse <keyref>s.
47 void traverse(Element krElem, XSElementDecl element, method in class:XSDKeyrefTraverser
124 } // traverse(Element,int,XSDocumentInfo, SchemaGrammar)
H A DXSDUniqueOrKeyTraverser.java32 * This class contains code that is used to traverse both <key>s and
48 void traverse(Element uElem, XSElementDecl element, method in class:XSDUniqueOrKeyTraverser
101 } // traverse(Element,XSDElementDecl,XSDocumentInfo, SchemaGrammar)
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMTreeWalker.java101 * (postorder) are invoked for each node as we traverse over them,
105 * in other words, the root of the subtree to traverse over.
108 public void traverse(int pos) throws org.xml.sax.SAXException method in class:DTMTreeWalker
110 // %REVIEW% Why isn't this just traverse(pos,pos)?
133 // %REVIEW% This condition isn't tested in traverse(pos,top)
151 * (postorder) are invoked for each node as we traverse over them,
160 public void traverse(int pos, int top) throws org.xml.sax.SAXException method in class:DTMTreeWalker
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/
H A DTreeWalker.java139 public void traverse(Node pos) throws org.xml.sax.SAXException method in class:TreeWalker
195 public void traverse(Node pos, Node top) throws org.xml.sax.SAXException method in class:TreeWalker
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DTreeWalker.java155 public void traverse(Node pos) throws org.xml.sax.SAXException method in class:TreeWalker
167 * In contrast to the traverse() method this method will not issue
226 public void traverse(Node pos, Node top) throws org.xml.sax.SAXException method in class:TreeWalker
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/
H A DNode.java98 public void traverse(Visitor v) { method in class:Node
H A DGroup.java143 public void traverse(Visitor v) { method in class:Group
144 super.traverse(v);
146 node.traverse(v);
214 root.traverse(new Visitor() {
222 root.traverse(new Visitor() {
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/opti/
H A DSchemaDOM.java306 //traverse(getDocumentElement(), 0);
312 public static void traverse(Node node, int depth) { method in class:SchemaDOM
327 traverse(child, depth);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DGraph.java210 traverse(tv, n);
214 private void traverse(DFSTraversalVisitor tv, Node<N, E> n) { method in class:Graph
228 traverse(tv, next);
/openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/
H A DBasicTreeUI.java2923 /** Determines direction to traverse, 1 means expand, -1 means
2942 SHARED_ACTION.traverse(tree, BasicTreeUI.this, direction,
4052 traverse(tree, ui, 1, true);
4055 traverse(tree, ui, 1, false);
4058 traverse(tree, ui, -1, true);
4061 traverse(tree, ui, -1, false);
4372 private void traverse(JTree tree, BasicTreeUI ui, int direction, method in class:BasicTreeUI.Actions

Completed in 70 milliseconds