| /external/webkit/LayoutTests/fast/dom/TreeWalker/resources/ |
| TreeWalker-currentNode.js | 3 var subTree = document.createElement('div');
4 subTree.innerHTML = "<p>Lorem ipsum <span>dolor <b>sit</b> amet</span>, consectetur <i>adipisicing</i> elit, sed do eiusmod <tt>tempor <b><i>incididunt ut</i> labore</b> et dolore magna</tt> aliqua.</p>"
5 document.body.appendChild(subTree);
8 var w = document.createTreeWalker(subTree, 0x01 | 0x08 | 0x10 | 0x20, all, true);
13 shouldBe("w.currentNode", "subTree");
15 shouldBe("w.currentNode", "subTree");
47 w.currentNode = subTree.previousSibling;
48 shouldBe("w.nextNode()", "subTree");
50 shouldBe("w.lastChild()", "subTree");
53 document.body.removeChild(subTree);
[all...] |
| /external/dbus/dbus/ |
| dbus-object-tree.c | 51 static DBusObjectSubtree* _dbus_object_subtree_ref (DBusObjectSubtree *subtree);
52 static void _dbus_object_subtree_unref (DBusObjectSubtree *subtree);
66 * Struct representing a single registered subtree handler, or node
67 * that's a parent of a registered subtree handler. If
158 * subtree nodes
163 find_subtree_recurse (DBusObjectSubtree *subtree,
180 subtree->name);
184 return subtree;
189 subtree->name, path[0]);
193 j = subtree->n_subtrees
327 DBusObjectSubtree *subtree; local
398 DBusObjectSubtree *subtree; local
448 DBusObjectSubtree *subtree; local
576 DBusObjectSubtree *subtree; local
755 DBusObjectSubtree *subtree; local
919 DBusObjectSubtree *subtree; local
946 DBusObjectSubtree *subtree; local
968 DBusObjectSubtree *subtree; local
[all...] |
| /external/gcc-demangle/ |
| demangle.h | 204 right (a component type with only one subtree puts it in the left
205 subtree). */
211 /* A qualified name. The left subtree is a class or namespace or
212 some such thing, and the right subtree is a name qualified by
215 /* A local name. The left subtree describes a function, and the
216 right subtree is a name which is local to that function. */
218 /* A typed name. The left subtree is a name, and the right subtree
221 /* A template. The left subtree is a template name, and the right
222 subtree is a template argument list. *
[all...] |
| /external/valgrind/main/coregrind/m_demangle/ |
| demangle.h | 203 right (a component type with only one subtree puts it in the left
204 subtree). */
210 /* A qualified name. The left subtree is a class or namespace or
211 some such thing, and the right subtree is a name qualified by
214 /* A local name. The left subtree describes a function, and the
215 right subtree is a name which is local to that function. */
217 /* A typed name. The left subtree is a name, and the right subtree
220 /* A template. The left subtree is a template name, and the right
221 subtree is a template argument list. *
[all...] |
| /external/webkit/LayoutTests/fast/dom/TreeWalker/ |
| TreeWalker-currentNode-expected.txt | 8 PASS w.currentNode is subTree
10 PASS w.currentNode is subTree
31 PASS w.nextNode() is subTree
32 PASS w.lastChild() is subTree
|
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second));
39 // NR is the subtree containing our left sibling.
40 NodeRef NR = path[l].subtree(path[l].offset - 1);
44 NR = NR.subtree(NR.size() - 1);
63 // NR is the subtree containing our left sibling.
65 NodeRef NR = subtree(l);
67 // Get the rightmost node in the subtree.
70 NR = NR.subtree(NR.size() - 1);
89 // NR is the subtree containing our right sibling.
90 NodeRef NR = path[l].subtree(path[l].offset + 1)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| BstBalancePolicy.java | 33 * the same inorder traversal order as the subtree {@code left}, then the entry {@code source},
34 * then the subtree {@code right}.
40 * guaranteed that the resulting tree will have the same inorder traversal order as the subtree
41 * {@code left}, then the subtree {@code right}.
|
| BstMutationResult.java | 43 * @param originalRoot The root of the subtree that was modified.
44 * @param changedRoot The root of the subtree, after the modification and any rebalancing.
79 * Returns the root of the subtree that was modified.
87 * Returns the root of the subtree, after the modification and any rebalancing was performed.
95 * Returns the entry in the original subtree with key {@code targetKey}, if any. This should not
96 * be treated as a subtree, but only as an entry, and no guarantees are made about its children
97 * when viewed as a subtree.
106 * treated as a subtree, but only as an entry, and no guarantees are made about its children when
107 * viewed as a subtree.
119 * If this mutation was to an immediate child subtree of the specified root on the specifie
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| AbstractData.java | 47 * Retrieves the value at the specified path in this HDF node's subtree.
62 * Retrieves the integer value at the specified path in this HDF node's subtree. If the value does
82 * Retrieves the value at the specified path in this HDF node's subtree. If not found, returns
90 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid,
98 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid,
106 * Sets the value at the specified path in this HDF node's subtree.
|
| Data.java | 151 * Retrieves the object that is the root of the subtree at hdfpath, returning null if the subtree
157 * Retrieves the HDF object that is the root of the subtree at hdfpath, create the subtree if it
163 * Remove the specified subtree.
209 * Retrieves the value at the specified path in this HDF node's subtree.
214 * Retrieves the integer value at the specified path in this HDF node's subtree. If the value does
220 * Retrieves the value at the specified path in this HDF node's subtree. If not found, returns
226 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid,
232 * Retrieves the value at the specified path in this HDF node's subtree. If not found or invalid
[all...] |
| /external/jsilver/src/org/clearsilver/ |
| HDF.java | 71 * subtree. If the value does not exist, or cannot be converted to an
77 * Retrieves the value at the specified path in this HDF node's subtree.
82 * Sets the value at the specified path in this HDF node's subtree.
87 * Remove the specified subtree.
107 * Retrieves the HDF object that is the root of the subtree at hdfpath, or
113 * Retrieves the HDF for the first child of the root of the subtree
139 * Retrieves the HDF object that is the root of the subtree at
140 * hdfpath, create the subtree if it doesn't exist
|
| /external/webkit/Source/WebCore/rendering/svg/ |
| RenderSVGHiddenContainer.cpp | 44 // This subtree does not paint.
49 // This subtree does not take up space or paint
|
| /external/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 202 /* Balances subtree, returns handle of root node of subtree after balancing.
208 /* Either the "greater than" or the "less than" subtree of
214 /* "Greater than" subtree is deeper. */
276 /* "Less than" subtree is deeper. */
625 ** node in the less subtree (of the node to remove), or the least
626 ** node in the greater subtree. We take the leaf node from the
627 ** deeper subtree, if there is one. */
689 /* "path" is the parent of the subtree being eliminated or reduced
856 /* Gives path to subtree being built. If bit n is false, branc
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| AVLTree.h | 352 // Gives path to subtree being built. If branch[N] is false, branch
356 // If rem[N] is true, then for the current subtree at depth N, it's
357 // greater subtree has one more node than it's less subtree.
360 // Depth of root node of current subtree.
363 // Number of nodes in current subtree.
366 // The algorithm relies on a stack of nodes whose less subtree has
367 // been built, but whose right subtree has not yet been built. The
374 // h is root of current subtree, child is one of its children.
379 // Subtract one for root of subtree
[all...] |
| /external/bouncycastle/src/main/java/org/bouncycastle/asn1/x509/ |
| NameConstraints.java | 62 private DERSequence createSequence(Vector subtree)
65 Enumeration e = subtree.elements();
|
| /external/chromium/chrome/browser/resources/bookmark_manager/js/ |
| bmm.js | 35 * Loads a subtree of the bookmark tree and returns a {@code cr.Promise} that
37 * load the same subtree more than once at the same time.
|
| /external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/ |
| PKIXNameConstraintValidator.java | 48 ASN1Sequence subtree)
50 if (subtree.size() < 1)
55 if (subtree.size() > dns.size())
60 for (int j = subtree.size() - 1; j >= 0; j--)
62 if (!subtree.getObjectAt(j).equals(dns.getObjectAt(j)))
99 ASN1Sequence subtree = (ASN1Sequence)it.next(); local
101 if (withinDNSubtree(dns, subtree))
108 "Subject distinguished name is not from a permitted subtree");
123 ASN1Sequence subtree = (ASN1Sequence)it.next(); local
125 if (withinDNSubtree(dns, subtree))
152 ASN1Sequence subtree = (ASN1Sequence)_iter.next(); local
187 ASN1Sequence subtree = (ASN1Sequence)it.next(); local
1535 GeneralSubtree subtree = GeneralSubtree.getInstance(e.nextElement()); local
[all...] |
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_nodeclonenodetrue.js | 79 and the subtree under it if deep=true.
83 method should clone this node and the subtree under it.
85 checked to insure the entire subtree under the second
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_nodeclonenodetrue.js | 79 and the subtree under it if deep=true.
83 method should clone this node and the subtree under it.
85 checked to insure the entire subtree under the second
|
| /external/webkit/Source/WebKit/mac/WebView/ |
| WebPDFDocumentExtras.mm | 40 static void appendValuesInPDFNameSubtreeToVector(CGPDFDictionaryRef subtree, Vector<CGPDFObjectRef>& values)
43 if (CGPDFDictionaryGetArray(subtree, "Names", &names)) {
54 if (!CGPDFDictionaryGetArray(subtree, "Kids", &kids))
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_nodeclonenodetrue.java | 32 * and the subtree under it if deep=true.
36 * method should clone this node and the subtree under it.
38 * checked to insure the entire subtree under the second
|
| nodeclonenodetrue.java | 32 * and the subtree under it if deep=true.
36 * method should clone this node and the subtree under it.
38 * checked to insure the entire subtree under the second
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| EntityReference.java | 25 * entity an <code>Entity</code> exists, and the subtree of the
27 * node subtree. However, the latter may not be true when an entity contains
|
| /libcore/luni/src/test/java/libcore/xml/ |
| NodeTest.java | 75 private List<Node> flattenSubtree(Node subtree) {
77 traverse(subtree, result);
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3rewritestreams.h | 92 /// Once a node / subtree has been used in a stream, it must be dup'ed
123 /// subtree. Dup'ing a token means just creating another AST node
137 /// Treat next element as a single node even if it's a subtree.
166 /// This is an implementation of a subtree stream which is a set of trees
|
