| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.js | 4 * an existing subtree.
20 /** Once a node / subtree has been used in a stream, it must be dup'd
74 * Return a duplicate node/subtree if stream is out of elements and
91 * a tree node or subtree. Deal with the optimization of single-
|
| RewriteRuleSubtreeStream.js | 8 /** Treat next element as a single node even if it's a subtree.
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| XSLTVisitable.java | 34 * false, the subtree should not be called.
|
| AVTPart.java | 72 * the current subtree.
74 * @return true if traversal outside the context node's subtree can occur.
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPathVisitable.java | 34 * false, the subtree should not be called.
|
| /external/guava/guava/src/com/google/common/collect/ |
| BstAggregate.java | 32 * The total value on an entire subtree. Must be equal to the sum of the {@link #entryValue
|
| BstNode.java | 36 * value data, or it can be considered to be a <i>subtree</i>, representative of it and all its
46 * The key on which this binary search tree is ordered. All descendants of the left subtree of
|
| BstNodeFactory.java | 25 * often some kind of value or some aggregate data for the subtree. This factory is responsible for
|
| BstOperations.java | 160 * Returns the result of removing the minimum element from the specified subtree.
178 * Returns the result of removing the maximum element from the specified subtree.
196 * entry.getKey()} is less than the key of all nodes in the subtree {@code root}.
214 * entry.getKey()} is greater than the key of all nodes in the subtree {@code root}.
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.as | 33 * an existing subtree.
55 /** Once a node / subtree has been used in a stream, it must be dup'd
119 * Return a duplicate node/subtree if stream is out of elements and
136 * a tree node or subtree. Deal with the optimization of single-
165 * subtree. Dup'ing a token means just creating another AST node
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| RewriteRuleElementStream.cs | 41 * an existing subtree.
69 /** <summary>Once a node / subtree has been used in a stream, it must be dup'd
139 * Return a duplicate node/subtree if stream is out of elements and
157 * a tree node or subtree. Deal with the optimization of single-
188 * subtree. Dup'ing a token means just creating another AST node
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| RewriteRuleElementStream.cs | 42 * an existing subtree.
71 /** <summary>Once a node / subtree has been used in a stream, it must be dup'd
149 * Return a duplicate node/subtree if stream is out of elements and
169 * a tree node or subtree. Deal with the optimization of single-
205 * subtree. Dup'ing a token means just creating another AST node
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| RewriteRuleElementStream.java | 36 * an existing subtree.
58 /** Once a node / subtree has been used in a stream, it must be dup'd
133 * Return a duplicate node/subtree if stream is out of elements and
149 * a tree node or subtree. Deal with the optimization of single-
178 * subtree. Dup'ing a token means just creating another AST node
|
| /external/icu4c/tools/ctestfw/unicode/ |
| ctest.h | 126 * @param root Subtree of tests.
133 * Run a subtree of tests.
135 * @param root Subtree of tests.
142 * Add a test to the subtree.
168 * Retreive a specific subtest. (subtree).
|
| /external/apache-xml/src/main/java/org/apache/xpath/operations/ |
| UnaryOperation.java | 57 * the current subtree.
59 * @return true if traversal outside the context node's subtree can occur.
|
| /external/chromium-trace/src/shared/js/chromeos/ |
| ui_account_tweaks.js | 65 * Adds guest-disabled css class to all elements within given subtree,
69 * @param {Element} element Root element of DOM subtree that should be
|
| /external/clang/tools/clang-check/ |
| ClangCheck.cpp | 29 // For example, to use clang-check on all files in a subtree of the source
32 // /path/in/subtree $ find . -name '*.cpp'| xargs clang-check /path/to/source
|
| /external/jsilver/src/org/clearsilver/jni/ |
| JniHdf.java | 171 * subtree. If the value does not exist, or cannot be converted to an
180 /** Retrieves the value at the specified path in this HDF node's subtree.
189 /** Sets the value at the specified path in this HDF node's subtree. */
197 /** Remove the specified subtree. */
279 /** Retrieves the HDF object that is the root of the subtree at hdfpath, or
292 /** Retrieves the HDF for the first child of the root of the subtree
317 /** Retrieves the HDF object that is the root of the subtree at
318 * hdfpath, create the subtree if it doesn't exist */
|
| /development/samples/ApiDemos/src/com/example/android/apis/accessibility/ |
| _index.html | 26 View tree reported to accessibility services. The virtual subtree is rooted at a View
|
| /external/libxml2/include/libxml/ |
| xmlsave.h | 3 * Description: API to save document or subtree of document
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeIterator.java | 20 * the set of nodes in a <code>NodeList</code>, the document subtree
25 * document-order traversal of a document subtree. Instances of these
61 * <code>NodeIterators</code> may reject a complete subtree rather than
|
| /external/webkit/Source/WebCore/platform/graphics/gpu/ |
| PODRedBlackTree.h | 254 // is used to compute the maximum endpoint of the subtree below the
369 // Left-rotates the subtree rooted at x.
370 // Returns the new root of the subtree (x's right child).
376 // Turn y's left subtree into x's right subtree.
402 // Right-rotates the subtree rooted at y.
403 // Returns the new root of the subtree (y's left child).
409 // Turn x's right subtree into y's left subtree.
649 // Visits the subtree rooted at the given node in order
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3rewritestreams.c | 370 // Subtree rewrite stream
386 // Install the subtree based overrides
408 // Install the subtree based overrides
431 // Install the subtree based overrides
564 /// Return a duplicate node/subtree if stream is out of elements and
619 /// a tree node or subtree. Deal with the optimization of single-
678 /// subtree. Dup'ing a token means just creating another AST node
692 /// subtree. Dup'ing a token means just creating another AST node
706 /// subtree. Dup'ing a token means just creating another AST node
778 /// Treat next element as a single node even if it's a subtree
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 493 /// subtree - Access the i'th subtree reference in a branch node.
496 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
663 // The key array in a branch node holds the rightmost stop key of each subtree.
667 // It is unusual for a branch node to only have one subtree, but it can happen
680 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
683 NodeRef &subtree(unsigned i) { return this->first[i]; }
685 /// findFrom - Find the first subtree after i that may contain x.
690 /// This is the first subtree that can possibly contain x.
699 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /external/webkit/Source/WebCore/svg/ |
| SVGUseElement.cpp | 287 // Update whole subtree, scanning for shadow container elements, that correspond to <svg>/<symbol> tags
340 // Update whole subtree, scanning for shadow container elements, marking a cloned use subtree
782 void SVGUseElement::removeDisallowedElementsFromSubtree(Node* subtree)
784 ASSERT(!subtree->inDocument());
786 Node* node = subtree->firstChild();
789 Node* next = node->traverseNextSibling(subtree);
790 // The subtree is not in document so this won't generate events that could mutate the tree.
794 node = node->traverseNextNode(subtree);
809 // Though if there are disallowed elements in the subtree, we have to remove them
[all...] |
