/libcore/luni/src/main/java/javax/xml/transform/dom/ |
H A D | DOMResult.java | 28 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation, 45 * <p><code>node</code>, 57 * <p>Use a DOM node to create a new output target.</p> 59 * <p>In practice, the node should be 60 * a {@link org.w3c.dom.Document} node, 61 * a {@link org.w3c.dom.DocumentFragment} node, or 62 * a {@link org.w3c.dom.Element} node. 63 * In other words, a node that accepts children.</p> 69 * @param node The DOM node tha 71 DOMResult(Node node) argument 91 DOMResult(Node node, String systemId) argument 126 DOMResult(Node node, Node nextSibling) argument 175 DOMResult(Node node, Node nextSibling, String systemId) argument 216 setNode(Node node) argument 337 private Node node = null; field in class:DOMResult [all...] |
H A D | DOMSource.java | 43 private Node node; field in class:DOMSource 60 * no DOM source is set using {@link #setNode(Node node)} , then the 70 * Create a new input source with a DOM node. The operation 71 * will be applied to the subtree rooted at this node. In XSLT, 74 * from the root node also. 76 * @param n The DOM node that will contain the Source tree. 83 * Create a new input source with a DOM node, and with the 86 * @param node The DOM node that will contain the Source tree. 87 * @param systemID Specifies the base URI associated with node 89 DOMSource(Node node, String systemID) argument 99 setNode(Node node) argument [all...] |
/libcore/luni/src/main/java/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 49 * Wait queue node class. 55 * information about a thread in the predecessor of its node. A 56 * "status" field in each node keeps track of whether a thread 57 * should block. A node is signalled when its predecessor 58 * releases. Each node of the queue otherwise serves as a 83 * needed to handle cancellation. If a node is cancelled, its 90 * The thread id for each node is kept in its own node, so a 91 * predecessor signals the next node to wake up by traversing 96 * updated "tail" when a node' 330 enq(final Node node) argument 374 setHead(Node node) argument 385 unparkSuccessor(Node node) argument 455 setHeadAndPropagate(Node node, long propagate) argument 487 cancelAcquire(Node node) argument 540 shouldParkAfterFailedAcquire(Node pred, Node node) argument 602 acquireQueued(final Node node, long arg) argument 1377 isOnSyncQueue(Node node) argument 1398 findNodeFromTail(Node node) argument 1416 transferForSignal(Node node) argument 1443 transferAfterCancelledWait(Node node) argument 1465 fullyRelease(Node node) argument 1752 checkInterruptWhileWaiting(Node node) argument 2063 compareAndSetWaitStatus(Node node, int expect, int update) argument 2073 compareAndSetNext(Node node, Node expect, Node update) argument [all...] |
H A D | AbstractQueuedSynchronizer.java | 278 * Wait queue node class. 284 * information about a thread in the predecessor of its node. A 285 * "status" field in each node keeps track of whether a thread 286 * should block. A node is signalled when its predecessor 287 * releases. Each node of the queue otherwise serves as a 312 * needed to handle cancellation. If a node is cancelled, its 319 * The thread id for each node is kept in its own node, so a 320 * predecessor signals the next node to wake up by traversing 325 * updated "tail" when a node' 559 enq(final Node node) argument 603 setHead(Node node) argument 614 unparkSuccessor(Node node) argument 684 setHeadAndPropagate(Node node, int propagate) argument 716 cancelAcquire(Node node) argument 769 shouldParkAfterFailedAcquire(Node pred, Node node) argument 831 acquireQueued(final Node node, int arg) argument 1607 isOnSyncQueue(Node node) argument 1628 findNodeFromTail(Node node) argument 1646 transferForSignal(Node node) argument 1673 transferAfterCancelledWait(Node node) argument 1695 fullyRelease(Node node) argument 1980 checkInterruptWhileWaiting(Node node) argument 2291 compareAndSetWaitStatus(Node node, int expect, int update) argument 2301 compareAndSetNext(Node node, Node expect, Node update) argument [all...] |
/libcore/luni/src/test/java/libcore/xml/ |
H A D | NodeTest.java | 55 for (Node node : flattenSubtree(documentElement)) { 56 if (node.getNodeType() == Node.ELEMENT_NODE 57 || node.getNodeType() == Node.DOCUMENT_NODE) { 58 assertFileUriEquals(file, node.getBaseURI()); 60 assertNull("Unexpected base URI for " + node, node.getBaseURI()); 64 // TODO: test other node types 81 private void traverse(Node node, List<Node> sink) { argument 82 sink.add(node); 84 NodeList children = node [all...] |
H A D | SimpleBuilderTest.java | 46 private String getTextContent(Node node) { argument 47 String result = (node instanceof Text ? ((Text) node).getData() : ""); 49 Node child = node.getFirstChild(); 97 Node node = list.item(i); 99 if (node instanceof ProcessingInstruction) { 100 proinst = proinst + node.getNodeValue(); 101 } else if (node instanceof Comment) { 102 comment = comment + node.getNodeValue();
|
H A D | XsltXPathConformanceTestSuite.java | 428 * Returns the given file's XML fragment as a single node, wrapped in 470 private String nodeToNormalizedString(Node node) argument 476 emitNode(xmlSerializer, node); 481 private void emitNode(XmlSerializer serializer, Node node) throws IOException { argument 482 if (node == null) { 485 } else if (node.getNodeType() == Node.ELEMENT_NODE) { 486 Element element = (Element) node; 492 } else if (node.getNodeType() == Node.TEXT_NODE 493 || node.getNodeType() == Node.CDATA_SECTION_NODE) { 496 String trimmed = node 526 emitAttributes(XmlSerializer serializer, Node node) argument 556 emitChildren(XmlSerializer serializer, Node node) argument [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | Exchanger.java | 253 /** The element offered by the Thread creating this node. */ 260 * Creates node with given item and empty hole. 336 me = new Node(item); // Throw away cancelled node 406 * Tries to cancel a wait for the given node waiting in the given 407 * slot, if so, helping clear the node from its slot to avoid 410 * @param node the waiting node 414 private static boolean tryCancel(Node node, Slot slot) { argument 415 if (!node.compareAndSet(null, CANCEL)) 417 if (slot.get() == node) // pr 433 spinWait(Node node, Slot slot) argument 463 await(Node node, Slot slot) argument 490 awaitNanos(Node node, Slot slot, long nanos) argument 533 scanOnTimeout(Node node) argument [all...] |
H A D | Phaser.java | 729 QNode node = new QNode(this, phase, true, false, 0L); 730 p = root.internalAwaitAdvance(phase, node); 731 if (node.wasInterrupted) 767 QNode node = new QNode(this, phase, true, true, nanos); 768 p = root.internalAwaitAdvance(phase, node); 769 if (node.wasInterrupted) 1004 * @param node if non-null, the wait node to track interrupt and timeout; 1008 private int internalAwaitAdvance(int phase, QNode node) { argument 1011 boolean queued = false; // true when node i [all...] |
H A D | LinkedBlockingDeque.java | 77 /** Doubly-linked list node class */ 80 * The item, or null if this node has been removed. 106 * Pointer to first node. 113 * Pointer to last node. 183 * Links node as first element, or returns false if full. 185 private boolean linkFirst(Node<E> node) { argument 190 node.next = f; 191 first = node; 193 last = node; 195 f.prev = node; 204 linkLast(Node<E> node) argument [all...] |
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
H A D | DocumentImpl.java | 69 * <p>Attaching user data directly to the corresponding node would cost a 70 * field per node. Under the assumption that user data is rarely needed, we 119 * Returns a shallow copy of the given node. If the node is an element node, 122 * @param node a node belonging to any document or DOM implementation. 125 * responsibility to notify user data handlers of the returned node. 126 * @return a new node whose document is this document and whose DOM 129 private NodeImpl shallowCopy(short operation, Node node) { argument 219 cloneOrImportNode(short operation, Node node, boolean deep) argument 242 adoptNode(Node node) argument 291 changeDocumentToThis(NodeImpl node) argument 313 renameNode(Node node, String namespaceURI, String qualifiedName) argument 495 getUserDataMap(NodeImpl node) argument 511 getUserDataMapForRead(NodeImpl node) argument [all...] |
H A D | NodeListImpl.java | 46 void add(NodeImpl node) { argument 47 children.add(node);
|
H A D | InnerNodeImpl.java | 58 for (NodeImpl node : children) { 59 list.add(node); 101 * another node, it is removed from there. 133 public boolean isParentOf(Node node) { argument 134 LeafNodeImpl nodeImpl = (LeafNodeImpl) node; 154 for (Node node = getFirstChild(); node != null; node = next) { 155 next = node.getNextSibling(); 156 node [all...] |
H A D | NodeImpl.java | 37 * A straightforward implementation of the corresponding W3C DOM node. 190 "Unsupported node type " + getNodeType()); 198 * Validates the element or attribute namespace prefix on this node. 200 * @param namespaceAware whether this node is namespace aware 201 * @param namespaceURI this node's namespace URI 221 * Sets {@code node} to be namespace-aware and assigns its namespace URI 224 * @param node an element or attribute node. 225 * @param namespaceURI this node's namespace URI. May be null. 228 static void setNameNS(NodeImpl node, Strin argument 277 setName(NodeImpl node, String name) argument 600 createEqualityKey(Node node) argument [all...] |
H A D | LeafNodeImpl.java | 65 boolean isParentOf(Node node) { argument
|
/libcore/luni/src/main/java/java/util/prefs/ |
H A D | PreferenceChangeEvent.java | 43 private final Preferences node; field in class:PreferenceChangeEvent 63 node = p; 94 return node;
|
H A D | Preferences.java | 26 * An instance of the class {@code Preferences} represents one node in a 33 * Every node has one name and one unique absolute path following the same 34 * notational conventions as directories in a file system. The root node's 35 * name is "", and other node name strings cannot contain the slash character 36 * and cannot be empty. The root node's absolute path is "/", and all other 38 * absolute path> + "/" + <node's name>. Since the set of nodes forms a 39 * tree with the root node at its base, all absolute paths start with the slash 40 * character. Every node has one relative path to each of its ancestors. The 41 * relative path doesn't start with slash: it equals the node's absolute path 125 * Gets the absolute path string of this preference node 494 public abstract Preferences node(String path); method in class:Preferences [all...] |
/libcore/luni/src/test/java/libcore/java/util/prefs/ |
H A D | OldFilePreferencesImplTest.java | 26 Preferences sroot = Preferences.systemRoot().node("test"); 28 Preferences child1 = sroot.node("child1"); 29 Preferences child2 = sroot.node("child2"); 30 Preferences grandchild = child1.node("grand");
|
H A D | OldAbstractPreferencesTest.java | 45 root.node(child).removeNode(); 50 pref = (AbstractPreferences) parent.node(nodeName); 140 pref.node("New node"); 151 pref.remove("New node"); 157 pref.remove("New node"); 165 AbstractPreferences ap = (AbstractPreferences) pref.node("New node"); 621 String nodeStr = "New node"; 622 pref.node(nodeSt [all...] |
H A D | OldNodeChangeEventTest.java | 32 AbstractPreferences pref = (AbstractPreferences) parent.node("mock"); 61 Preferences child1 = pref.node("mock1"); 80 AbstractPreferences pref = (AbstractPreferences) parent.node("mock"); 109 Preferences child1 = pref.node("mock1");
|
H A D | OldPreferencesTest.java | 56 pref.node(child).removeNode(); 79 p.node(null); 124 Preferences child1 = pref.node("child1"); 126 pref.node("child2"); 127 pref.node("child3"); 128 child1.node("subchild1"); 150 Preferences pref = root.node("mock"); 309 Preferences child = pref.node("mock"); 322 Preferences pref = parent.node("mock"); 325 pref.node(nul 1029 public Preferences node(String name) { method in class:OldPreferencesTest.MockPreferences [all...] |
H A D | OldPreferenceChangeEventTest.java | 31 AbstractPreferences pref = (AbstractPreferences) parent.node("mock"); 56 AbstractPreferences pref = (AbstractPreferences) parent.node("mock"); 86 AbstractPreferences pref = (AbstractPreferences) parent.node("mock");
|
/libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
H A D | importNode16.java | 36 * the type of node being imported is DocumentType. 74 Node node; 82 node = doc.importNode(docType, false);
|
H A D | importNode17.java | 36 * the type of node being imported is Document. 73 Node node; 80 node = doc.importNode(anotherDoc, false);
|
/libcore/luni/src/main/java/java/util/ |
H A D | TreeMap.java | 196 Node<K, V> node = removeInternalByKey(key); 197 return node != null ? node.value : null; 247 * Returns the node at or adjacent to the given key, creating it if requested. 305 * We found a nearest node. Every key not in the tree has up to two 370 * Removes {@code node} from this tree, rearranging the tree's structure as 373 void removeInternal(Node<K, V> node) { argument 374 Node<K, V> left = node.left; 375 Node<K, V> right = node.right; 376 Node<K, V> originalParent = node 433 replaceInParent(Node<K, V> node, Node<K, V> replacement) argument 1191 bound(Node<K, V> node, Bound fromBound, Bound toBound) argument [all...] |