Searched refs:node (Results 1 - 25 of 510) sorted by relevance

1234567891011>>

/openjdk7/langtools/src/share/classes/com/sun/source/util/
H A DSimpleTreeVisitor.java47 protected R defaultAction(Tree node, P p) { argument
51 public final R visit(Tree node, P p) { argument
52 return (node == null) ? null : node.accept(this, p);
58 for (Tree node : nodes)
59 r = visit(node, p);
63 public R visitCompilationUnit(CompilationUnitTree node, P p) { argument
64 return defaultAction(node, p);
67 public R visitImport(ImportTree node, P p) { argument
68 return defaultAction(node,
71 visitClass(ClassTree node, P p) argument
75 visitMethod(MethodTree node, P p) argument
79 visitVariable(VariableTree node, P p) argument
83 visitEmptyStatement(EmptyStatementTree node, P p) argument
87 visitBlock(BlockTree node, P p) argument
91 visitDoWhileLoop(DoWhileLoopTree node, P p) argument
95 visitWhileLoop(WhileLoopTree node, P p) argument
99 visitForLoop(ForLoopTree node, P p) argument
103 visitEnhancedForLoop(EnhancedForLoopTree node, P p) argument
107 visitLabeledStatement(LabeledStatementTree node, P p) argument
111 visitSwitch(SwitchTree node, P p) argument
115 visitCase(CaseTree node, P p) argument
119 visitSynchronized(SynchronizedTree node, P p) argument
123 visitTry(TryTree node, P p) argument
127 visitCatch(CatchTree node, P p) argument
131 visitConditionalExpression(ConditionalExpressionTree node, P p) argument
135 visitIf(IfTree node, P p) argument
139 visitExpressionStatement(ExpressionStatementTree node, P p) argument
143 visitBreak(BreakTree node, P p) argument
147 visitContinue(ContinueTree node, P p) argument
151 visitReturn(ReturnTree node, P p) argument
155 visitThrow(ThrowTree node, P p) argument
159 visitAssert(AssertTree node, P p) argument
163 visitMethodInvocation(MethodInvocationTree node, P p) argument
167 visitNewClass(NewClassTree node, P p) argument
171 visitNewArray(NewArrayTree node, P p) argument
175 visitParenthesized(ParenthesizedTree node, P p) argument
179 visitAssignment(AssignmentTree node, P p) argument
183 visitCompoundAssignment(CompoundAssignmentTree node, P p) argument
187 visitUnary(UnaryTree node, P p) argument
191 visitBinary(BinaryTree node, P p) argument
195 visitTypeCast(TypeCastTree node, P p) argument
199 visitInstanceOf(InstanceOfTree node, P p) argument
203 visitArrayAccess(ArrayAccessTree node, P p) argument
207 visitMemberSelect(MemberSelectTree node, P p) argument
211 visitIdentifier(IdentifierTree node, P p) argument
215 visitLiteral(LiteralTree node, P p) argument
219 visitPrimitiveType(PrimitiveTypeTree node, P p) argument
223 visitArrayType(ArrayTypeTree node, P p) argument
227 visitParameterizedType(ParameterizedTypeTree node, P p) argument
231 visitUnionType(UnionTypeTree node, P p) argument
235 visitTypeParameter(TypeParameterTree node, P p) argument
239 visitWildcard(WildcardTree node, P p) argument
243 visitModifiers(ModifiersTree node, P p) argument
247 visitAnnotation(AnnotationTree node, P p) argument
251 visitErroneous(ErroneousTree node, P p) argument
255 visitOther(Tree node, P p) argument
[all...]
H A DTreeScanner.java40 * <li>If the node being visited has no children, the result will be null.
41 * <li>If the node being visited has one child, the result will be the
42 * result of calling {@code scan} on that child. The child may be a simple node
44 * <li> If the node being visited has more than one child, the result will
48 * a simple node of a list of nodes. The default behavior of the {@code reduce}
57 * public Integer visitIdentifier(IdentifierTree node, Void p) {
73 /** Scan a single node.
75 public R scan(Tree node, P p) { argument
76 return (node == null) ? null : node
79 scanAndReduce(Tree node, P p, R r) argument
115 visitCompilationUnit(CompilationUnitTree node, P p) argument
123 visitImport(ImportTree node, P p) argument
127 visitClass(ClassTree node, P p) argument
136 visitMethod(MethodTree node, P p) argument
147 visitVariable(VariableTree node, P p) argument
154 visitEmptyStatement(EmptyStatementTree node, P p) argument
158 visitBlock(BlockTree node, P p) argument
162 visitDoWhileLoop(DoWhileLoopTree node, P p) argument
168 visitWhileLoop(WhileLoopTree node, P p) argument
174 visitForLoop(ForLoopTree node, P p) argument
182 visitEnhancedForLoop(EnhancedForLoopTree node, P p) argument
189 visitLabeledStatement(LabeledStatementTree node, P p) argument
193 visitSwitch(SwitchTree node, P p) argument
199 visitCase(CaseTree node, P p) argument
205 visitSynchronized(SynchronizedTree node, P p) argument
211 visitTry(TryTree node, P p) argument
219 visitCatch(CatchTree node, P p) argument
225 visitConditionalExpression(ConditionalExpressionTree node, P p) argument
232 visitIf(IfTree node, P p) argument
239 visitExpressionStatement(ExpressionStatementTree node, P p) argument
243 visitBreak(BreakTree node, P p) argument
247 visitContinue(ContinueTree node, P p) argument
251 visitReturn(ReturnTree node, P p) argument
255 visitThrow(ThrowTree node, P p) argument
259 visitAssert(AssertTree node, P p) argument
265 visitMethodInvocation(MethodInvocationTree node, P p) argument
272 visitNewClass(NewClassTree node, P p) argument
281 visitNewArray(NewArrayTree node, P p) argument
288 visitParenthesized(ParenthesizedTree node, P p) argument
292 visitAssignment(AssignmentTree node, P p) argument
298 visitCompoundAssignment(CompoundAssignmentTree node, P p) argument
304 visitUnary(UnaryTree node, P p) argument
308 visitBinary(BinaryTree node, P p) argument
314 visitTypeCast(TypeCastTree node, P p) argument
320 visitInstanceOf(InstanceOfTree node, P p) argument
326 visitArrayAccess(ArrayAccessTree node, P p) argument
332 visitMemberSelect(MemberSelectTree node, P p) argument
336 visitIdentifier(IdentifierTree node, P p) argument
340 visitLiteral(LiteralTree node, P p) argument
344 visitPrimitiveType(PrimitiveTypeTree node, P p) argument
348 visitArrayType(ArrayTypeTree node, P p) argument
352 visitParameterizedType(ParameterizedTypeTree node, P p) argument
358 visitUnionType(UnionTypeTree node, P p) argument
362 visitTypeParameter(TypeParameterTree node, P p) argument
367 visitWildcard(WildcardTree node, P p) argument
371 visitModifiers(ModifiersTree node, P p) argument
375 visitAnnotation(AnnotationTree node, P p) argument
381 visitOther(Tree node, P p) argument
385 visitErroneous(ErroneousTree node, P p) argument
[all...]
/openjdk7/jdk/test/java/util/prefs/
H A DConflictInFlush.java27 * @summary flush() throws an IllegalStateException on a removed node
39 Preferences node = root.node("1/2/3");
40 node.flush();
41 System.out.println("Node "+node+" has been created");
42 System.out.println("Removing node "+node);
43 node.removeNode();
44 node.flush();
/openjdk7/langtools/src/share/classes/com/sun/source/tree/
H A DTreeVisitor.java60 R visitAnnotation(AnnotationTree node, P p); argument
61 R visitMethodInvocation(MethodInvocationTree node, P p); argument
62 R visitAssert(AssertTree node, P p); argument
63 R visitAssignment(AssignmentTree node, P p); argument
64 R visitCompoundAssignment(CompoundAssignmentTree node, P p); argument
65 R visitBinary(BinaryTree node, P p); argument
66 R visitBlock(BlockTree node, P p); argument
67 R visitBreak(BreakTree node, P p); argument
68 R visitCase(CaseTree node, P p); argument
69 R visitCatch(CatchTree node, argument
70 visitClass(ClassTree node, P p) argument
71 visitConditionalExpression(ConditionalExpressionTree node, P p) argument
72 visitContinue(ContinueTree node, P p) argument
73 visitDoWhileLoop(DoWhileLoopTree node, P p) argument
74 visitErroneous(ErroneousTree node, P p) argument
75 visitExpressionStatement(ExpressionStatementTree node, P p) argument
76 visitEnhancedForLoop(EnhancedForLoopTree node, P p) argument
77 visitForLoop(ForLoopTree node, P p) argument
78 visitIdentifier(IdentifierTree node, P p) argument
79 visitIf(IfTree node, P p) argument
80 visitImport(ImportTree node, P p) argument
81 visitArrayAccess(ArrayAccessTree node, P p) argument
82 visitLabeledStatement(LabeledStatementTree node, P p) argument
83 visitLiteral(LiteralTree node, P p) argument
84 visitMethod(MethodTree node, P p) argument
85 visitModifiers(ModifiersTree node, P p) argument
86 visitNewArray(NewArrayTree node, P p) argument
87 visitNewClass(NewClassTree node, P p) argument
88 visitParenthesized(ParenthesizedTree node, P p) argument
89 visitReturn(ReturnTree node, P p) argument
90 visitMemberSelect(MemberSelectTree node, P p) argument
91 visitEmptyStatement(EmptyStatementTree node, P p) argument
92 visitSwitch(SwitchTree node, P p) argument
93 visitSynchronized(SynchronizedTree node, P p) argument
94 visitThrow(ThrowTree node, P p) argument
95 visitCompilationUnit(CompilationUnitTree node, P p) argument
96 visitTry(TryTree node, P p) argument
97 visitParameterizedType(ParameterizedTypeTree node, P p) argument
98 visitUnionType(UnionTypeTree node, P p) argument
99 visitArrayType(ArrayTypeTree node, P p) argument
100 visitTypeCast(TypeCastTree node, P p) argument
101 visitPrimitiveType(PrimitiveTypeTree node, P p) argument
102 visitTypeParameter(TypeParameterTree node, P p) argument
103 visitInstanceOf(InstanceOfTree node, P p) argument
104 visitUnary(UnaryTree node, P p) argument
105 visitVariable(VariableTree node, P p) argument
106 visitWhileLoop(WhileLoopTree node, P p) argument
107 visitWildcard(WildcardTree node, P p) argument
108 visitOther(Tree node, P p) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/xml/crypto/dom/
H A DDOMStructure.java36 * allow a DOM node to be used to represent extensible content (any elements
39 * <p>If a sequence of nodes is needed, the node contained in the
40 * <code>DOMStructure</code> is the first node of the sequence and successive
45 * {@link XMLSignature#sign(XMLSignContext)} method imports the node into the
54 private final Node node; field in class:DOMStructure
57 * Creates a <code>DOMStructure</code> containing the specified node.
59 * @param node the node
60 * @throws NullPointerException if <code>node</code> is <code>null</code>
62 public DOMStructure(Node node) { argument
[all...]
/openjdk7/jdk/test/javax/imageio/metadata/
H A DDOML3Node.java45 IIOMetadataNode node = new IIOMetadataNode("node");
48 node.setIdAttribute("name", true);
54 node.setIdAttributeNS("namespaceURI", "localName", true);
60 node.setIdAttributeNode((Attr)null, true);
66 node.getSchemaTypeInfo();
72 node.setUserData("key", null, (UserDataHandler)null);
78 node.getUserData("key");
84 node.getFeature("feature", "version");
90 node
[all...]
/openjdk7/jaxp/src/javax/xml/transform/dom/
H A DDOMResult.java34 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation,
50 * <p><code>node</code>,
62 * <p>Use a DOM node to create a new output target.</p>
64 * <p>In practice, the node should be
65 * a {@link org.w3c.dom.Document} node,
66 * a {@link org.w3c.dom.DocumentFragment} node, or
67 * a {@link org.w3c.dom.Element} node.
68 * In other words, a node that accepts children.</p>
74 * @param node The DOM node tha
76 DOMResult(Node node) argument
96 DOMResult(Node node, String systemId) argument
132 DOMResult(Node node, Node nextSibling) argument
183 DOMResult(Node node, Node nextSibling, String systemId) argument
226 setNode(Node node) argument
349 private Node node = null; field in class:DOMResult
[all...]
H A DDOMSource.java49 private Node node; field in class:DOMSource
66 * no DOM source is set using {@link #setNode(Node node)} , then the
76 * Create a new input source with a DOM node. The operation
77 * will be applied to the subtree rooted at this node. In XSLT,
80 * from the root node also.
82 * @param n The DOM node that will contain the Source tree.
89 * Create a new input source with a DOM node, and with the
92 * @param node The DOM node that will contain the Source tree.
93 * @param systemID Specifies the base URI associated with node
95 DOMSource(Node node, String systemID) argument
105 setNode(Node node) argument
[all...]
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/gif/
H A DGIFImageMetadata.java143 IIOMetadataNode node; // scratch node
148 node = new IIOMetadataNode("ImageDescriptor");
149 node.setAttribute("imageLeftPosition",
151 node.setAttribute("imageTopPosition",
153 node.setAttribute("imageWidth", Integer.toString(imageWidth));
154 node.setAttribute("imageHeight", Integer.toString(imageHeight));
155 node.setAttribute("interlaceFlag",
157 root.appendChild(node);
161 node
[all...]
H A DGIFStreamMetadata.java99 IIOMetadataNode node; // scratch node
103 node = new IIOMetadataNode("Version");
104 node.setAttribute("value", version);
105 root.appendChild(node);
108 node = new IIOMetadataNode("LogicalScreenDescriptor");
113 node.setAttribute("logicalScreenWidth",
116 node.setAttribute("logicalScreenHeight",
120 node.setAttribute("colorResolution",
123 node
[all...]
H A DGIFWritableStreamMetadata.java94 Node node = root;
95 if (!node.getNodeName().equals(nativeMetadataFormatName)) {
96 fatal(node, "Root must be " + nativeMetadataFormatName);
99 node = node.getFirstChild();
100 while (node != null) {
101 String name = node.getNodeName();
104 version = getStringAttribute(node, "value", null,
112 logicalScreenWidth = getIntAttribute(node,
118 logicalScreenHeight = getIntAttribute(node,
[all...]
H A DGIFWritableImageMetadata.java106 Node node = root;
107 if (!node.getNodeName().equals(nativeMetadataFormatName)) {
108 fatal(node, "Root must be " + nativeMetadataFormatName);
111 node = node.getFirstChild();
112 while (node != null) {
113 String name = node.getNodeName();
116 imageLeftPosition = getIntAttribute(node,
121 imageTopPosition = getIntAttribute(node,
126 imageWidth = getIntAttribute(node,
[all...]
/openjdk7/jdk/src/share/back/
H A DcommonRef.c89 RefNode *node; local
94 node = (RefNode*)jvmtiAllocate((int)sizeof(RefNode));
95 if (node == NULL) {
102 jvmtiDeallocate(node);
108 (gdata->jvmti, weakRef, ptr_to_jlong(node));
111 jvmtiDeallocate(node);
116 node->ref = weakRef;
117 node->isStrong = JNI_FALSE;
118 node->count = 1;
119 node
128 deleteNode(JNIEnv *env, RefNode *node) argument
148 strengthenNode(JNIEnv *env, RefNode *node) argument
175 weakenNode(JNIEnv *env, RefNode *node) argument
207 RefNode *node; local
220 RefNode *node; local
267 RefNode *node; local
303 hashIn(RefNode *node) argument
317 RefNode *node; local
379 RefNode *node; local
416 RefNode *node; local
445 RefNode *node; local
491 RefNode *node; local
522 RefNode *node; local
560 RefNode *node; local
[all...]
H A DeventFilter.h33 jvmtiError eventFilter_setConditionalFilter(HandlerNode *node,
35 jvmtiError eventFilter_setCountFilter(HandlerNode *node,
37 jvmtiError eventFilter_setThreadOnlyFilter(HandlerNode *node,
39 jvmtiError eventFilter_setLocationOnlyFilter(HandlerNode *node,
44 jvmtiError eventFilter_setFieldOnlyFilter(HandlerNode *node,
48 jvmtiError eventFilter_setClassOnlyFilter(HandlerNode *node,
51 jvmtiError eventFilter_setExceptionOnlyFilter(HandlerNode *node,
56 jvmtiError eventFilter_setInstanceOnlyFilter(HandlerNode *node,
59 jvmtiError eventFilter_setClassMatchFilter(HandlerNode *node,
62 jvmtiError eventFilter_setClassExcludeFilter(HandlerNode *node,
[all...]
/openjdk7/jdk/src/share/classes/javax/imageio/spi/
H A DDigraphNode.java34 * A node in a directed graph. In addition to an arbitrary
35 * <code>Object</code> containing user data associated with the node,
36 * each node maintains a <code>Set</code>s of nodes which are pointed
37 * to by the current node (available from <code>getOutNodes</code>).
38 * The in-degree of the node (that is, number of nodes that point to
39 * the current node) may be queried.
44 /** The data associated with this node. */
49 * node.
53 /** The in-degree of the node. */
58 * node
88 addEdge(DigraphNode node) argument
107 hasEdge(DigraphNode node) argument
118 removeEdge(DigraphNode node) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/util/
H A DDOMInputSource.java38 public DOMInputSource(Node node) { argument
39 super(null, getSystemIdFromNode(node), null);
40 fNode = node;
43 public DOMInputSource(Node node, String systemId) { argument
45 fNode = node;
52 public void setNode(Node node) { argument
53 fNode = node;
56 private static String getSystemIdFromNode(Node node) { argument
57 if (node != null) {
59 return node
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/
H A DDTMDefaultBaseIterators.java42 * Construct a DTMDefaultBaseTraversers object from a DOM node.
64 * Construct a DTMDefaultBaseTraversers object from a DOM node.
75 * @param usePrevsib true if we want to build the previous sibling node array.
95 * with a start node (using iterator.setStartNode()).
177 * with a start node (using iterator.setStartNode()).
260 * returned (starting point for the next() search); for single-node
261 * iterators it may instead be initialized to point to that single node.
266 * Remembers the current node for the next call to gotoMark().
276 * Restores the current node remembered by setMark().
288 * Iterator that returns all immediate children of a given node
305 setStartNode(int node) argument
359 setStartNode(int node) argument
450 setStartNode(int node) argument
541 setStartNode(int node) argument
607 setStartNode(int node) argument
712 setStartNode(int node) argument
831 setStartNode(int node) argument
878 setStartNode(int node) argument
984 setStartNode(int node) argument
1049 setStartNode(int node) argument
1110 setStartNode(int node) argument
1303 setStartNode(int node) argument
1504 setStartNode(int node) argument
1655 setStartNode(int node) argument
1764 setStartNode(int node) argument
1830 setStartNode(int node) argument
2056 SingletonIterator(int node) argument
2068 SingletonIterator(int node, boolean constant) argument
2082 setStartNode(int node) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/
H A DTreeWalkerImpl.java101 public void setCurrentNode(Node node) { argument
102 if (node == null) {
107 fCurrentNode = node;
110 /** Return the parent Node from the current node,
118 Node node = getParentNode(fCurrentNode);
119 if (node !=null) {
120 fCurrentNode = node;
122 return node;
126 /** Return the first child Node from the current node,
134 Node node
274 getParentNode(Node node) argument
299 getNextSibling(Node node) argument
309 getNextSibling(Node node, Node root) argument
354 getPreviousSibling(Node node) argument
364 getPreviousSibling(Node node, Node root) argument
408 getFirstChild(Node node) argument
445 getLastChild(Node node) argument
481 acceptNode(Node node) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/xml/crypto/dsig/dom/
H A DDOMValidateContext.java62 private Node node; field in class:DOMValidateContext
66 * selector and node.
69 * @param node the node
70 * @throws NullPointerException if <code>ks</code> or <code>node</code> is
73 public DOMValidateContext(KeySelector ks, Node node) { argument
77 init(node, ks);
82 * and node. The validating key will be stored in a
88 * @param node the node
92 DOMValidateContext(Key validatingKey, Node node) argument
99 init(Node node, KeySelector ks) argument
119 setNode(Node node) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DTrie.java38 /** The root node of the tree. */
70 Node node = m_Root;
74 Node nextNode = node.m_nextChar[Character.toUpperCase(key.charAt(i))];
78 node = nextNode;
86 node.m_nextChar[Character.toUpperCase(key.charAt(i))] = newNode;
87 node.m_nextChar[Character.toLowerCase(key.charAt(i))] = newNode;
88 node = newNode;
94 Object ret = node.m_Value;
96 node.m_Value = value;
119 Node node
[all...]
/openjdk7/jdk/src/share/classes/com/sun/jndi/dns/
H A DNameNode.java33 * A NameNode represents a node in the DNS namespace. Each node
35 * node at Sun.COM has label "Sun"). Each node has a hashtable of
38 * <p> A node may be addressed from another by giving a DnsName
39 * consisting of the sequence of labels from one node to the other.
41 * <p> Each node also has an <tt>isZoneCut</tt> flag, used to indicate
42 * if the node is a zone cut. A zone cut is a node with an NS record
53 private String label; // name of this node relativ
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/runtime/
H A DNode.java28 * a node is passed as a parameter to a template.
33 public int node; field in class:Node
37 node = n;
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/model/
H A DConstant.java30 public Constant(final Node node, final Framework parent) { argument
31 super(node, parent);
H A DFunctionAlias.java30 public FunctionAlias(final Node node, final Framework parent) { argument
31 super(node, parent);
H A DInformalProtocol.java30 public InformalProtocol(final Node node, final Framework parent) { argument
31 super(node, parent);

Completed in 163 milliseconds

1234567891011>>