Searched refs:Node (Results 1 - 25 of 620) sorted by relevance

1234567891011>>

/libcore/luni/src/main/java/org/w3c/dom/
H A DNamedNodeMap.java31 * @return A <code>Node</code> (of any type) with the specified
35 public Node getNamedItem(String name);
48 * @return If the new <code>Node</code> replaces an existing node the
49 * replaced <code>Node</code> is returned, otherwise <code>null</code>
65 public Node setNamedItem(Node arg)
82 public Node removeNamedItem(String name)
93 public Node item(int index);
108 * @return A <code>Node</code> (of any type) with the specified local
117 public Node getNamedItemN
[all...]
H A DDocumentFragment.java21 * which can hold such fragments and it is quite natural to use a Node for
28 * of another <code>Node</code> -- may take <code>DocumentFragment</code>
41 * <code>Document</code> (or indeed any other <code>Node</code> that may
44 * <code>Node</code>. This makes the <code>DocumentFragment</code> very
47 * the user can use the standard methods from the <code>Node</code>
48 * interface, such as <code>Node.insertBefore</code> and
49 * <code>Node.appendChild</code>.
52 public interface DocumentFragment extends Node {
H A DEntityReference.java42 public interface EntityReference extends Node {
H A DNodeList.java33 public Node item(int index);
H A DNode.java16 * The <code>Node</code> interface is the primary datatype for the entire
18 * While all objects implementing the <code>Node</code> interface expose
20 * <code>Node</code> interface may have children. For example,
136 public interface Node { interface
227 public Node getParentNode();
240 public Node getFirstChild();
246 public Node getLastChild();
252 public Node getPreviousSibling();
258 public Node getNextSibling();
309 public Node insertBefor
[all...]
H A DUserDataHandler.java17 * <code>Node.setUserData()</code> the application can provide a handler
28 * The node is cloned, using <code>Node.cloneNode()</code>.
69 Node src,
70 Node dst);
H A DNotation.java19 * <code>nodeName</code> attribute inherited from <code>Node</code> is set
26 public interface Notation extends Node {
H A DDOMLocator.java50 public Node getRelatedNode();
H A DProcessingInstruction.java27 public interface ProcessingInstruction extends Node {
/libcore/luni/src/main/java/org/w3c/dom/traversal/
H A DNodeIterator.java16 import org.w3c.dom.Node;
21 * governed by a particular <code>Node</code>, the results of a query, or
38 public Node getRoot();
80 * @return The next <code>Node</code> in the set being iterated over, or
86 public Node nextNode()
92 * @return The previous <code>Node</code> in the set being iterated over,
98 public Node previousNode()
/libcore/dom/src/test/java/org/w3c/domts/
H A DUserDataNotification.java14 import org.w3c.dom.Node;
25 private final Node src;
26 private final Node dst;
35 Node src,
36 Node dst) {
76 public final Node getSrc() {
85 public final Node getDst() {
/libcore/luni/src/main/java/java/util/prefs/
H A DNodeSet.java5 import org.w3c.dom.Node;
10 ArrayList<Node> list = new ArrayList<Node>();
12 public NodeSet(Iterator<Node> nodes) {
22 public Node item(int index) {
23 Node result = null;
/libcore/luni/src/main/java/javax/xml/transform/dom/
H A DDOMSource.java23 import org.w3c.dom.Node;
41 * <p><code>Node</code> to serve as DOM source.</p>
43 private Node node;
60 * no DOM source is set using {@link #setNode(Node node)} , then the
78 public DOMSource(Node n) {
89 public DOMSource(Node node, String systemID) {
99 public void setNode(Node node) {
108 public Node getNode() {
H A DDOMResult.java23 import org.w3c.dom.Node;
71 public DOMResult(Node node) {
91 public DOMResult(Node node, String systemId) {
113 * then the behavior is the same as calling {@link #DOMResult(Node node)},
126 public DOMResult(Node node, Node nextSibling) {
136 if ((node.compareDocumentPosition(nextSibling)&Node.DOCUMENT_POSITION_CONTAINED_BY)==0) {
163 * then the behavior is the same as calling {@link #DOMResult(Node node, String systemId)},
175 public DOMResult(Node node, Node nextSiblin
[all...]
H A DDOMLocator.java23 import org.w3c.dom.Node;
41 public Node getOriginatingNode();
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
H A DLeafNodeImpl.java19 import org.w3c.dom.Node;
31 * This class represents a Node that has a parent Node, but no children.
45 public Node getNextSibling() {
53 public Node getParentNode() {
57 public Node getPreviousSibling() {
65 boolean isParentOf(Node node) {
H A DDocumentFragmentImpl.java20 import org.w3c.dom.Node;
46 return Node.DOCUMENT_FRAGMENT_NODE;
H A DTextImpl.java20 import org.w3c.dom.Node;
46 return Node.TEXT_NODE;
54 Node refNode = getNextSibling();
89 Node parent = getParentNode();
102 Node toRemove = n; // because removeChild() detaches siblings
117 for (Node p = getPreviousSibling(); p != null; p = p.getPreviousSibling()) {
119 if (nodeType == Node.TEXT_NODE || nodeType == Node.CDATA_SECTION_NODE) {
133 Node nextSibling = getNextSibling();
139 return nodeType == Node
[all...]
/libcore/luni/src/main/java/org/w3c/dom/ls/
H A DLSSerializer.java17 import org.w3c.dom.Node;
28 * <code>namespaceURI</code> of a <code>Node</code> is empty string, the
87 * <p ><b>Note:</b> The serialization of a <code>Node</code> does not always
327 * to the filter before serializing each Node. The filter implementation
340 * to the filter before serializing each Node. The filter implementation
393 public boolean write(Node nodeArg,
415 public boolean writeToURI(Node nodeArg,
437 public String writeToString(Node nodeArg)
H A DLSParserFilter.java16 import org.w3c.dom.Node;
135 * <li> <code>FILTER_ACCEPT</code> if this <code>Node</code> should
139 * <code>FILTER_REJECT</code> if the <code>Node</code> and all of its
143 * <code>Node</code> should be skipped and the <code>Node</code>
144 * should be replaced by all the children of the <code>Node</code>.
150 * XML well-formed. The <code>Node</code> is accepted and will be the
155 public short acceptNode(Node nodeArg);
/libcore/luni/src/test/java/libcore/xml/
H A DNodeTest.java22 import org.w3c.dom.Node;
36 * For bug 779: Node#getNextSibling throws IndexOutOfBoundsException.
43 Node root = document.getDocumentElement();
55 for (Node node : flattenSubtree(documentElement)) {
56 if (node.getNodeType() == Node.ELEMENT_NODE
57 || node.getNodeType() == Node.DOCUMENT_NODE) {
75 private List<Node> flattenSubtree(Node subtree) {
76 List<Node> result = new ArrayList<Node>();
[all...]
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java127 static final class Node { class in class:AbstractQueuedLongSynchronizer
129 static final Node SHARED = new Node();
131 static final Node EXCLUSIVE = null;
192 volatile Node prev;
207 volatile Node next;
225 Node nextWaiter;
241 final Node predecessor() throws NullPointerException {
242 Node p = prev;
249 Node() { // Use method in class:AbstractQueuedLongSynchronizer.Node
252 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedLongSynchronizer.Node
257 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedLongSynchronizer.Node
[all...]
H A DAbstractQueuedSynchronizer.java356 static final class Node { class in class:AbstractQueuedSynchronizer
358 static final Node SHARED = new Node();
360 static final Node EXCLUSIVE = null;
421 volatile Node prev;
436 volatile Node next;
454 Node nextWaiter;
470 final Node predecessor() throws NullPointerException {
471 Node p = prev;
478 Node() { // Use method in class:AbstractQueuedSynchronizer.Node
481 Node(Thread thread, Node mode) { // Used by addWaiter method in class:AbstractQueuedSynchronizer.Node
486 Node(Thread thread, int waitStatus) { // Used by Condition method in class:AbstractQueuedSynchronizer.Node
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java92 * - There is exactly one (last) Node with a null next reference,
93 * which is CASed when enqueueing. This last Node can be
99 * reference of a Node to null atomically removes it from the
102 * head to advance. A dequeued Node may remain in use
107 * from a predecessor dequeued Node. That would cause two problems:
110 * a Node was tenured while live, which generational GCs have a
115 * linking a Node that has just been dequeued to itself. Such a
128 * CASing a Node's item reference to null atomically removes the
136 * When constructing a Node (before enqueuing it) we avoid paying
141 * Both head and tail may or may not point to a Node wit
149 private static class Node<E> { class in class:ConcurrentLinkedQueue
157 Node(E item) { method in class:ConcurrentLinkedQueue.Node
[all...]
/libcore/dom/src/test/java/org/w3c/domts/level1/core/
H A Dhc_nodeinsertbeforedocfragment.java69 Node employeeNode;
71 Node refChild;
73 Node newChild1;
74 Node newChild2;
75 Node child;
77 Node appendedChild;
78 Node insertedNode;

Completed in 1155 milliseconds

1234567891011>>