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

123

/libcore/luni/src/main/java/javax/xml/transform/dom/
H A DDOMResult.java28 * <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 DDOMSource.java43 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 DAbstractQueuedLongSynchronizer.java61 * method enq to add new wait node.
115 * Inserts node into queue, initializing if necessary. See picture above.
116 * @param node the node to insert
117 * @return node's predecessor
119 private Node enq(Node node) { argument
123 U.putObject(node, Node.PREV, oldTail);
124 if (compareAndSetTail(oldTail, node)) {
125 oldTail.next = node;
135 * Creates and enqueues node fo
164 setHead(Node node) argument
175 unparkSuccessor(Node node) argument
245 setHeadAndPropagate(Node node, long propagate) argument
279 cancelAcquire(Node node) argument
332 shouldParkAfterFailedAcquire(Node pred, Node node) argument
394 acquireQueued(final Node node, long arg) argument
1156 isOnSyncQueue(Node node) argument
1177 findNodeFromTail(Node node) argument
1197 transferForSignal(Node node) argument
1224 transferAfterCancelledWait(Node node) argument
1246 fullyRelease(Node node) argument
1528 checkInterruptWhileWaiting(Node node) argument
[all...]
H A DAbstractQueuedSynchronizer.java274 * Wait queue node class.
280 * information about a thread in the predecessor of its node. A
281 * "status" field in each node keeps track of whether a thread
282 * should block. A node is signalled when its predecessor
283 * releases. Each node of the queue otherwise serves as a
308 * needed to handle cancellation. If a node is cancelled, its
315 * The thread id for each node is kept in its own node, so a
316 * predecessor signals the next node to wake up by traversing
321 * updated "tail" when a node'
586 enq(Node node) argument
631 setHead(Node node) argument
642 unparkSuccessor(Node node) argument
712 setHeadAndPropagate(Node node, int propagate) argument
746 cancelAcquire(Node node) argument
799 shouldParkAfterFailedAcquire(Node pred, Node node) argument
862 acquireQueued(final Node node, int arg) argument
1627 isOnSyncQueue(Node node) argument
1648 findNodeFromTail(Node node) argument
1668 transferForSignal(Node node) argument
1695 transferAfterCancelledWait(Node node) argument
1717 fullyRelease(Node node) argument
1997 checkInterruptWhileWaiting(Node node) argument
[all...]
H A DStampedLock.java183 * a fuller account), where each node is tagged (field mode) as
185 * (linked) under a common node (field cowait) so act as a single
186 * node with respect to most CLH mechanics. By virtue of the
270 // Values for node status; order matters
1005 WNode node = null, p;
1023 else if (node == null)
1024 node = new WNode(WMODE, p);
1025 else if (node.prev != p)
1026 node.prev = p;
1027 else if (U.compareAndSwapObject(this, WTAIL, p, node)) {
1304 cancelWaiter(WNode node, WNode group, boolean interrupted) argument
[all...]
/libcore/luni/src/test/java/libcore/xml/
H A DNodeTest.java55 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 DSimpleBuilderTest.java46 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 DXsltXPathConformanceTestSuite.java428 * 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/org/apache/harmony/xml/dom/
H A DDocumentImpl.java69 * <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 DNodeListImpl.java46 void add(NodeImpl node) { argument
47 children.add(node);
H A DInnerNodeImpl.java58 for (NodeImpl node : children) {
59 list.add(node);
105 * another node, it is removed from there.
137 public boolean isParentOf(Node node) { argument
138 LeafNodeImpl nodeImpl = (LeafNodeImpl) node;
158 for (Node node = getFirstChild(); node != null; node = next) {
159 next = node.getNextSibling();
160 node
[all...]
H A DNodeImpl.java37 * 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 DLeafNodeImpl.java65 boolean isParentOf(Node node) { argument
/libcore/ojluni/src/main/java/sun/security/provider/certpath/
H A DPolicyNodeImpl.java55 // every node has one parent, and zero or more children
73 * parent in the Policy Tree to this node. If null, this is the
75 * for this node, as found in the certificate. It also takes a boolean
76 * argument specifying whether this node is being created as a result
80 * node is the tree's root node
81 * @param validPolicy a String representing this node's valid policy OID
87 * node was generated by a policy mapping
125 * Alternate constructor which makes a new node with the policy data
128 * @param parent a PolicyNode that's the new parent of the node, o
132 PolicyNodeImpl(PolicyNodeImpl parent, PolicyNodeImpl node) argument
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/prefs/
H A DFilePreferencesImplTest.java38 uroot = factory.userRoot().node("harmony_test");
39 sroot = factory.systemRoot().node("harmony_test");
75 Preferences child1 = uroot.node("child1");
76 Preferences child2 = uroot.node("\u4e2d child2");
77 Preferences grandchild = child1.node("grand");
97 child1 = sroot.node("child1");
98 child2 = sroot.node("child2");
101 Preferences grandchild2 = child1.node("grand");
111 assertNotSame(child1, sroot.node("child1"));
112 assertSame(sroot.node("child
[all...]
H A DAbstractPreferencesTest.java97 pref = (AbstractPreferences) parent.node("mock");
156 p = (MockAbstractPreferences) pref.node("child");
193 Preferences child1 = pref.node("child1");
195 pref.node("child2");
196 pref.node("child3");
197 child1.node("subchild1");
416 assertSame(pref.node("samechild"), pref.node("samechild"));
417 assertNotSame(pref.node("sameChild"), pref.node("samechil
[all...]
/libcore/ojluni/src/main/java/java/util/prefs/
H A DPreferenceChangeEvent.java31 * An event emitted by a <tt>Preferences</tt> node to indicate that
64 * @param node The Preferences node that emitted the event.
69 public PreferenceChangeEvent(Preferences node, String key, argument
71 super(node);
77 * Returns the preference node that emitted the event.
79 * @return The preference node that emitted the event.
/libcore/dom/src/test/java/org/w3c/domts/level2/core/
H A DimportNode16.java36 * the type of node being imported is DocumentType.
74 Node node;
82 node = doc.importNode(docType, false);
H A DimportNode17.java36 * the type of node being imported is Document.
73 Node node;
80 node = doc.importNode(anotherDoc, false);
/libcore/luni/src/test/java/libcore/java/util/prefs/
H A DOldFilePreferencesImplTest.java47 Preferences sroot = Preferences.systemRoot().node("test");
49 Preferences child1 = sroot.node("child1");
50 Preferences child2 = sroot.node("child2");
51 Preferences grandchild = child1.node("grand");
H A DOldAbstractPreferencesTest.java64 pref = (AbstractPreferences) parent.node(nodeName);
160 pref.node("New node");
171 pref.remove("New node");
177 pref.remove("New node");
185 AbstractPreferences ap = (AbstractPreferences) pref.node("New node");
641 String nodeStr = "New node";
642 pref.node(nodeStr);
674 AbstractPreferences first = (AbstractPreferences) pref.node("Firs
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DPhaser.java724 QNode node = new QNode(this, phase, true, false, 0L);
725 p = root.internalAwaitAdvance(phase, node);
726 if (node.wasInterrupted)
762 QNode node = new QNode(this, phase, true, true, nanos);
763 p = root.internalAwaitAdvance(phase, node);
764 if (node.wasInterrupted)
998 * @param node if non-null, the wait node to track interrupt and timeout;
1002 private int internalAwaitAdvance(int phase, QNode node) { argument
1005 boolean queued = false; // true when node i
[all...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DAbstractTask.java44 * Internal node tasks will likely override the {@code onCompletion} method from
54 * to perform a reduction on that leaf node's chunk using the
125 /** The result of this node, if completed */
147 * @param parent this node's parent task
149 * this node, obtained by splitting the parent {@code Spliterator}
160 * Constructs a new node of type T whose parent is the receiver; must call
165 * this node, obtained by splitting the parent {@code Spliterator}
166 * @return newly constructed child node
171 * Computes the result associated with a leaf node. Will be called by
174 * @return the computed result of a leaf node
[all...]
H A DNodes.java72 // General shape-based node creation methods
75 * Produces an empty node whose count is zero, has no children and no content.
77 * @param <T> the type of elements of the created node
78 * @param shape the shape of the node to be created
79 * @return an empty node.
95 * <p>The count of the concatenated node is equal to the sum of the count
96 * of each child. Traversal of the concatenated node traverses the content
98 * spliterator obtained from the concatenated node preserves the encounter
101 * <p>The result may be a concatenated node, the input sole node i
139 static <T> Node<T> node(T[] array) { method in class:Nodes
152 static <T> Node<T> node(Collection<T> c) { method in class:Nodes
192 static Node.OfInt node(int[] array) { method in class:Nodes
229 static Node.OfLong node(final long[] array) { method in class:Nodes
266 static Node.OfDouble node(final double[] array) { method in class:Nodes
464 flatten(Node<T> node, IntFunction<T[]> generator) argument
490 flattenInt(Node.OfInt node) argument
516 flattenLong(Node.OfLong node) argument
542 flattenDouble(Node.OfDouble node) argument
2028 protected final T_NODE node; field in class:Nodes.ToArrayTask
2031 ToArrayTask(T_NODE node, int offset) argument
2036 ToArrayTask(K parent, T_NODE node, int offset) argument
2075 OfRef(Node<T> node, T[] array, int offset) argument
2080 OfRef(OfRef<T> parent, Node<T> node, int offset) argument
2103 OfPrimitive(T_NODE node, T_ARR array, int offset) argument
2108 OfPrimitive(OfPrimitive<T, T_CONS, T_ARR, T_SPLITR, T_NODE> parent, T_NODE node, int offset) argument
2127 OfInt(Node.OfInt node, int[] array, int offset) argument
2135 OfLong(Node.OfLong node, long[] array, int offset) argument
2143 OfDouble(Node.OfDouble node, double[] array, int offset) argument
[all...]
/libcore/benchmarks/src/benchmarks/
H A DXmlParseBenchmark.java114 private int countDomElements(Node node) { argument
116 for (; node != null; node = node.getNextSibling()) {
117 if (node.getNodeType() == Node.ELEMENT_NODE) {
120 result += countDomElements(node.getFirstChild());

Completed in 964 milliseconds

123