/dalvik/libcore/xml/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 | 44 private Node node; field in class:DOMSource 61 * no DOM source is set using {@link #setNode(Node node)} , then the 71 * Create a new input source with a DOM node. The operation 72 * will be applied to the subtree rooted at this node. In XSLT, 75 * from the root node also. 77 * @param n The DOM node that will contain the Source tree. 84 * Create a new input source with a DOM node, and with the 87 * @param node The DOM node that will contain the Source tree. 88 * @param systemID Specifies the base URI associated with node 90 DOMSource(Node node, String systemID) argument 100 setNode(Node node) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMDefaultBaseIterators.java | 39 * Construct a DTMDefaultBaseTraversers object from a DOM node. 61 * Construct a DTMDefaultBaseTraversers object from a DOM node. 72 * @param usePrevsib true if we want to build the previous sibling node array. 92 * with a start node (using iterator.setStartNode()). 174 * with a start node (using iterator.setStartNode()). 257 * returned (starting point for the next() search); for single-node 258 * iterators it may instead be initialized to point to that single node. 263 * Remembers the current node for the next call to gotoMark(). 273 * Restores the current node remembered by setMark(). 285 * Iterator that returns all immediate children of a given node 302 setStartNode(int node) argument 356 setStartNode(int node) argument 447 setStartNode(int node) argument 538 setStartNode(int node) argument 604 setStartNode(int node) argument 709 setStartNode(int node) argument 828 setStartNode(int node) argument 875 setStartNode(int node) argument 981 setStartNode(int node) argument 1046 setStartNode(int node) argument 1107 setStartNode(int node) argument 1300 setStartNode(int node) argument 1501 setStartNode(int node) argument 1652 setStartNode(int node) argument 1761 setStartNode(int node) argument 1827 setStartNode(int node) argument 2053 SingletonIterator(int node) argument 2065 SingletonIterator(int node, boolean constant) argument 2079 setStartNode(int node) argument [all...] |
H A D | DTMAxisIterNodeList.java | 100 * @return The node at the <code>index</code>th position in the 106 int node; 110 node = m_cachedNodes.elementAt(index); 111 return m_dtm.getNode(node); 113 while (((node = m_iter.next()) != DTMAxisIterator.END) 115 m_cachedNodes.addElement(node); 118 if (node == DTMAxisIterator.END) { 121 return m_dtm.getNode(node); 129 * The number of nodes in the list. The range of valid child node indices 134 int node; [all...] |
H A D | DTMTreeWalker.java | 99 * (postorder) are invoked for each node as we traverse over them, 100 * with the result that the node is written out to m_contentHandler. 149 * (postorder) are invoked for each node as we traverse over them, 150 * with the result that the node is written out to m_contentHandler. 201 private final void dispatachChars(int node) argument 204 m_dtm.dispatchCharactersEvents(node, m_contentHandler, false); 208 * Start processing given node 211 * @param node Node to process 215 protected void startNode(int node) throws org.xml.sax.SAXException argument 221 // ((NodeConsumer) m_contentHandler).setOriginatingNode(node); 363 endNode(int node) argument [all...] |
H A D | DTMAxisIteratorBase.java | 32 /** The position of the last node within the iteration, as defined by XPath. 33 * Note that this is _not_ the node's handle within the DTM. Also, don't 38 /** The position of the current node within the iteration, as defined by XPath. 39 * Note that this is _not_ the node's handle within the DTM! 43 /** The position of the marked node within the iteration; 54 /** True if the start node should be considered part of the iteration. 69 * @return The root node of the iteration. 77 * @return A DTMAxisIterator which has been reset to the start node, 95 * Set the flag to include the start node in the iteration. 111 /** Returns the position of the last node withi 211 returnNode(final int node) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
H A D | ClonerToResultTree.java | 31 * Class used to clone a node, possibly including its children to 40 // * TODO: Fix or figure out node clone failure! 43 // * @param node The node to clone 49 // public void cloneToResultTree(int node, boolean shouldCloneAttributes) 56 // DTM dtm = xctxt.getDTM(node); 58 // int type = dtm.getNodeType(node); 62 // dtm.dispatchCharactersEvents(node, m_rth, false); 76 // m_rth.addAttributes(node); 77 // m_rth.processNSDecls(node, typ 132 cloneToResultTree(int node, int nodeType, DTM dtm, SerializationHandler rth, boolean shouldCloneAttributes) argument [all...] |
H A D | TreeWalker2Result.java | 65 * @param pos Start node for traversal 78 * End processing of given node 81 * @param node Node we just finished processing 85 protected void endNode(int node) throws org.xml.sax.SAXException argument 87 super.endNode(node); 88 if(DTM.ELEMENT_NODE == m_dtm.getNodeType(node)) 95 * Start traversal of the tree at the given node 98 * @param node Starting node for traversal 102 protected void startNode(int node) throw argument [all...] |
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | TreeMap.java | 50 final Node<K, V> node; field in class:TreeMap.MapEntry 53 MapEntry(Node<K, V> node, int offset) { argument 54 this.node = node; 56 key = node.keys[offset]; 89 if (node.keys[offset] == key) { 90 return node.values[offset]; 106 if (node.keys[offset] == key) { 107 V res = node.values[offset]; 108 node 172 Node<K, V> node; field in class:TreeMap.AbstractMapIterator 1660 appendFromLeft(Node<K, V> node, K keyObj, V value) argument 1674 attachToLeft(Node<K, V> node, Node<K, V> newNode) argument 1690 appendFromRight(Node<K, V> node, K keyObj, V value) argument 1705 attachToRight(Node<K, V> node, Node<K, V> newNode) argument 1895 removeLeftmost(Node<K, V> node) argument 1936 removeRightmost(Node<K, V> node) argument 1979 removeMiddleElement(Node<K, V> node, int index) argument 2050 removeFromIterator(Node<K, V> node, int index) argument 2098 deleteNode(Node<K, V> node) argument 2173 fixNextChain(Node<K, V> node) argument [all...] |
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/locks/ |
H A D | AbstractQueuedSynchronizer.java | 258 * Wait queue node class. 264 * information about a thread in the predecessor of its node. A 265 * "status" field in each node keeps track of whether a thread 266 * should block. A node is signalled when its predecessor 267 * releases. Each node of the queue otherwise serves as a 292 * needed to handle cancellation. If a node is cancelled, its 299 * The thread id for each node is kept in its own node, so a 300 * predecessor signals the next node to wake up by traversing 305 * updated "tail" when a node' 539 enq(final Node node) argument 583 setHead(Node node) argument 594 unparkSuccessor(Node node) argument 664 setHeadAndPropagate(Node node, int propagate) argument 696 cancelAcquire(Node node) argument 749 shouldParkAfterFailedAcquire(Node pred, Node node) argument 811 acquireQueued(final Node node, int arg) argument 1581 isOnSyncQueue(Node node) argument 1602 findNodeFromTail(Node node) argument 1620 transferForSignal(Node node) argument 1647 transferAfterCancelledWait(Node node) argument 1669 fullyRelease(Node node) argument 1954 checkInterruptWhileWaiting(Node node) argument 2290 compareAndSetWaitStatus(Node node, int expect, int update) argument 2300 compareAndSetNext(Node node, Node expect, Node update) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
H A D | SAX2DTM2.java | 69 * Iterator that returns all immediate children of a given node 80 * or set current node to END, to indicate request-not-honored? 82 * @param node Sets the root of the iteration. 86 public DTMAxisIterator setStartNode(int node) argument 89 if (node == DTMDefaultBase.ROOTNODE) 90 node = getDocument(); 93 _startNode = node; 94 _currentNode = (node == DTM.NULL) ? DTM.NULL 95 : _firstch2(makeNodeIdentity(node)); 104 * Get the next node i 140 setStartNode(int node) argument 243 setStartNode(int node) argument 416 setStartNode(int node) argument 512 setStartNode(int node) argument 577 setStartNode(int node) argument 638 setStartNode(int node) argument 859 setStartNode(int node) argument 1063 setStartNode(int node) argument 1287 setStartNode(int node) argument 1414 setStartNode(int node) argument 1522 setStartNode(int node) argument [all...] |
/dalvik/libcore/xml/src/test/java/tests/xml/ |
H A D | NodeTest.java | 57 for (Node node : flattenSubtree(documentElement)) { 58 if (node.getNodeType() == Node.ELEMENT_NODE 59 || node.getNodeType() == Node.DOCUMENT_NODE) { 60 assertFileUriEquals(file, node.getBaseURI()); 62 assertNull("Unexpected base URI for " + node, node.getBaseURI()); 66 // TODO: test other node types 83 private void traverse(Node node, List<Node> sink) { argument 84 sink.add(node); 86 NodeList children = node [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
H A D | DOMSerializer.java | 65 * Serializes the DOM node. Throws an exception only if an I/O 70 * @param node the DOM node to serialize 73 public void serialize(Node node) throws IOException; argument
|
H A D | TreeWalker.java | 236 private final void dispatachChars(Node node) argument 241 this.m_Serializer.characters(node); 245 String data = ((Text) node).getData(); 251 * Start processing given node 254 * @param node Node to process 258 protected void startNode(Node node) throws org.xml.sax.SAXException argument 267 // ((NodeConsumer) m_contentHandler).setOriginatingNode(node); 271 if (node instanceof Locator) 273 Locator loc = (Locator)node; 285 switch (node 448 endNode(Node node) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/harmony/xml/dom/ |
H A D | DocumentImpl.java | 71 * <p>Attaching user data directly to the corresponding node would cost a 72 * field per node. Under the assumption that user data is rarely needed, we 122 * Returns a shallow copy of the given node. If the node is an element node, 125 * @param node a node belonging to any document or DOM implementation. 128 * responsibility to notify user data handlers of the returned node. 129 * @return a new node whose document is this document and whose DOM 132 private NodeImpl shallowCopy(short operation, Node node) { argument 208 cloneOrImportNode(short operation, Node node, boolean deep) argument 231 adoptNode(Node node) argument 280 changeDocumentToThis(NodeImpl node) argument 302 renameNode(Node node, String namespaceURI, String qualifiedName) argument 484 getUserDataMap(NodeImpl node) argument 500 getUserDataMapForRead(NodeImpl node) argument [all...] |
H A D | NodeListImpl.java | 47 void add(NodeImpl node) { argument 48 children.add(node);
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/dom3/ |
H A D | DOM3TreeWalker.java | 108 /** Is the Node a Level 3 DOM node */
378 private final void dispatachChars(Node node)
argument 381 this.fSerializer.characters(node);
383 String data = ((Text) node).getData();
389 * Start processing given node
391 * @param node Node to process
395 protected void startNode(Node node) throws org.xml.sax.SAXException {
argument 396 if (node instanceof Locator) {
397 Locator loc = (Locator) node;
407 switch (node 446 endNode(Node node) argument 476 applyFilter(Node node, int nodeType) argument 496 serializeDocType(DocumentType node, boolean bStart) argument 570 serializeComment(Comment node) argument 598 serializeElement(Element node, boolean bStart) argument 663 serializeAttList(Element node) argument 887 serializePI(ProcessingInstruction node) argument 915 serializeCDATASection(CDATASection node) argument 998 serializeText(Text node) argument 1051 serializeEntityReference( EntityReference node, boolean bStart) argument 1397 isElementWellFormed(Node node) argument 1435 isAttributeWellFormed(Node node) argument 1530 isPIWellFormed(ProcessingInstruction node) argument 1581 isCDATASectionWellFormed(CDATASection node) argument 1610 isTextWellFormed(Text node) argument 1641 isEntityReferneceWellFormed(EntityReference node) argument 1749 checkUnboundPrefixInEntRef(Node node) argument 1823 recordLocalNSDecl(Node node) argument 1886 fixupElementNS(Node node) argument [all...] |
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
H A D | Exchanger.java | 254 /** The element offered by the Thread creating this node. */ 261 * Creates node with given item and empty hole. 333 me = new Node(item); // Throw away cancelled node 403 * Tries to cancel a wait for the given node waiting in the given 404 * slot, if so, helping clear the node from its slot to avoid 407 * @param node the waiting node 411 private static boolean tryCancel(Node node, Slot slot) { argument 412 if (!node.compareAndSet(null, CANCEL)) 414 if (slot.get() == node) // pr 430 spinWait(Node node, Slot slot) argument 460 await(Node node, Slot slot) argument 487 awaitNanos(Node node, Slot slot, long nanos) argument 530 scanOnTimeout(Node node) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
H A D | TreeWalker.java | 267 private final void dispatachChars(Node node) argument 272 ((org.apache.xml.dtm.ref.dom2dtm.DOM2DTM.CharacterNodeHandler)m_contentHandler).characters(node); 276 String data = ((Text) node).getData(); 282 * Start processing given node 285 * @param node Node to process 289 protected void startNode(Node node) throws org.xml.sax.SAXException argument 294 ((NodeConsumer) m_contentHandler).setOriginatingNode(node); 297 if (node instanceof Locator) 299 Locator loc = (Locator)node; 311 switch (node 453 endNode(Node node) argument [all...] |
/dalvik/libcore/prefs/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;
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
H A D | DOM2DTM.java | 57 * tree. You can wrap a DOM2DTM around a specific node and its subtree 75 /** The current position in the DOM tree. Last node examined for 90 synthesis of the implied xml: namespace declaration node. */ 98 /** The node objects. The instance part of the handle indexes 99 * directly into this vector. Each DTM node may actually be 102 * single DTM Text node); this table points only to the first in 107 * Construct a DOM2DTM object from a DOM node. 133 // Document node. If it's an Element node, we need to immediately 137 // (If it's an EntityReference node, w 182 addNode(Node node, int parentIndex, int previousSibling, int forceNodeType) argument 664 getHandleFromNode(Node node) argument 703 getHandleOfNode(Node node) argument 916 getNodeData(Node node, FastStringBuffer buf) argument 1655 dispatchNodeData(Node node, org.xml.sax.ContentHandler ch, int depth) argument 1737 characters(Node node) argument 1759 getSourceLocatorFor(int node) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xpath/ |
H A D | NodeSetDTM.java | 145 Node node; 148 while (null != (node = iterator.nextNode())) 150 int handle = xctxt.getDTMHandleFromNode(node); 170 Node node = nodeList.item(i); 171 int handle = xctxt.getDTMHandleFromNode(node); 181 * @param node Single node to be added to the new set. 183 public NodeSetDTM(int node, DTMManager dtmManager) argument 189 addNode(node); 194 * a node (th 792 addNodeInDocOrder(int node, boolean test, XPathContext support) argument 867 addNodeInDocOrder(int node, XPathContext support) argument 1008 setElementAt(int node, int index) argument 1025 setItem(int node, int index) argument [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
H A D | DTMAxisIterator.java | 24 * This class iterates over a single XPath Axis, and returns node handles. 33 * Get the next node in the iteration. 35 * @return The next node handle in the iteration, or END. 41 * Resets the iterator to the last start node. 55 * @return The position of the current node in the set, as defined by XPath. 60 * Remembers the current node for the next call to gotoMark(). 65 * Restores the current node remembered by setMark(). 73 * @param node Sets the root of the iteration. 77 public DTMAxisIterator setStartNode(int node); argument 83 * @return The root node o [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xpath/functions/ |
H A D | FuncNormalizeSpace.java | 72 int node = getArg0AsNode(xctxt); 73 if(DTM.NULL != node) 75 DTM dtm = xctxt.getDTM(node); 76 dtm.dispatchCharactersEvents(node, handler, true);
|
/dalvik/libcore/xml/src/main/java/org/apache/xalan/templates/ |
H A D | ElemTemplateElement.java | 52 * This class acts like a Element node, and implements the 95 * Return the node name. 97 * @return An invalid node name 245 * requires that if you *do* want to reparent a node, you use removeChild() 284 * requires that if you *do* want to reparent a node, you use removeChild() 328 * Get the type of the node. 330 * @return Constant for this node type 356 * if oldChild is not a child of this node. 359 * node was not a child of this element. 427 * @param newChild New child node t [all...] |