/libcore/luni/src/main/java/org/w3c/dom/ |
H A D | NamedNodeMap.java | 31 * @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 D | DocumentFragment.java | 21 * 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 D | EntityReference.java | 42 public interface EntityReference extends Node {
|
H A D | NodeList.java | 33 public Node item(int index);
|
H A D | Node.java | 16 * 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 D | UserDataHandler.java | 17 * <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 D | Notation.java | 19 * <code>nodeName</code> attribute inherited from <code>Node</code> is set 26 public interface Notation extends Node {
|
H A D | DOMLocator.java | 50 public Node getRelatedNode();
|
H A D | ProcessingInstruction.java | 27 public interface ProcessingInstruction extends Node {
|
H A D | Document.java | 22 * to create these objects. The <code>Node</code> objects created have a 27 public interface Document extends Node { 38 * nodes manipulation methods, such as <code>Node.insertBefore</code>, 39 * or <code>Node.replaceChild</code>. Note, however, that while some 312 public Node importNode(Node importedNode, 332 * <td valign='top' rowspan='1' colspan='1'><code>Node.nodeName</code></td> 337 * <td valign='top' rowspan='1' colspan='1'><code>Node.namespaceURI</code></td> 342 * <td valign='top' rowspan='1' colspan='1'><code>Node.prefix</code></td> 348 * <td valign='top' rowspan='1' colspan='1'><code>Node [all...] |
/libcore/luni/src/main/java/org/w3c/dom/traversal/ |
H A D | NodeIterator.java | 16 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 D | UserDataNotification.java | 14 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/javax/xml/transform/dom/ |
H A D | DOMSource.java | 23 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 D | DOMResult.java | 23 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 D | DOMLocator.java | 23 import org.w3c.dom.Node; 41 public Node getOriginatingNode();
|
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
H A D | LeafNodeImpl.java | 19 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 D | DocumentFragmentImpl.java | 20 import org.w3c.dom.Node; 46 return Node.DOCUMENT_FRAGMENT_NODE;
|
H A D | TextImpl.java | 20 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...] |
H A D | InnerNodeImpl.java | 24 import org.w3c.dom.Node; 37 * <p>This class represents a Node that has a parent Node as well as 51 public Node appendChild(Node newChild) throws DOMException { 65 public Node getFirstChild() { 69 public Node getLastChild() { 73 public Node getNextSibling() { 85 public Node insertBefore(Node newChil [all...] |
/libcore/luni/src/main/java/org/w3c/dom/ls/ |
H A D | LSSerializer.java | 17 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 D | LSParserFilter.java | 16 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 D | NodeTest.java | 22 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 D | AbstractQueuedSynchronizer.java | 352 static final class Node { class in class:AbstractQueuedSynchronizer 354 static final Node SHARED = new Node(); 356 static final Node EXCLUSIVE = null; 417 volatile Node prev; 432 volatile Node next; 450 Node nextWaiter; 466 final Node predecessor() throws NullPointerException { 467 Node p = prev; 475 Node() {} method in class:AbstractQueuedSynchronizer.Node 478 Node(Node nextWaiter) { method in class:AbstractQueuedSynchronizer.Node 484 Node(int waitStatus) { method in class:AbstractQueuedSynchronizer.Node [all...] |
/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
H A D | hc_nodeinsertbeforedocfragment.java | 69 Node employeeNode; 71 Node refChild; 73 Node newChild1; 74 Node newChild2; 75 Node child; 77 Node appendedChild; 78 Node insertedNode;
|
H A D | nodeinsertbeforedocfragment.java | 69 Node employeeNode; 71 Node refChild; 73 Node newChild1; 74 Node newChild2; 75 Node child; 77 Node appendedChild; 78 Node insertedNode;
|