| /libcore/ojluni/src/main/java/java/util/stream/ |
| Nodes.java | 96 * of each child. Traversal of the concatenated node traverses the content
[all...] |
| package-info.java | 105 * the initial stream that match the given predicate. Traversal
115 * completing their traversal of the data source and processing of the pipeline
[all...] |
| /prebuilts/tools/common/m2/repository/xerces/xmlParserAPIs/2.6.2/ |
| xmlParserAPIs-2.6.2.jar | |
| /prebuilts/tools/common/m2/repository/xml-apis/xml-apis/1.0.b2/ |
| xml-apis-1.0.b2.jar | |
| /art/compiler/optimizing/ |
| induction_var_analysis.cc | 23 * Since graph traversal may enter a SCC at any position, an initial representation may be rotated,
101 // traversal of all loops using Gerlek's algorithm. The order is important to enable
194 // or assigned in inner loop (inner exit value), the traversal stops.
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3commontoken.h | 58 /** Imaginary token type to cause a traversal of child nodes in a tree parser
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| AVT.java | 535 * @return true if traversal outside the context node's subtree can occur.
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMManager.java | 256 * and a DTMFilter. The traversal semantics are defined as the
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| CachedXPathAPI.java | 32 import org.w3c.dom.traversal.NodeIterator;
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| PredicatedNodeTest.java | 528 * @return true if traversal outside the context node's subtree can occur.
|
| /external/apache-xml/src/main/java/org/apache/xpath/jaxp/ |
| XPathExpressionImpl.java | 41 import org.w3c.dom.traversal.NodeIterator;
|
| /external/chromium-trace/catapult/third_party/Paste/docs/ |
| url-parsing-with-wsgi.txt | 284 (a way of overriding the traversal without having an attribute for
|
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersMacros.h | 374 /// For a specific \c SpecificType, the traversal is done using
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CheckerDocumentation.cpp | 304 /// An AST traversal callback, which should only be used when the checker is
|
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 31 template<int Traversal, int UnrollingIndex, typename Lhs, typename Rhs, typename RetScalar>
|
| GeneralMatrixMatrixTriangular.h | 129 // triangular traversal.
|
| /external/fio/lib/ |
| prio_tree.c | 397 * traversal of the tree.
|
| /external/libvncserver/webclients/java-applet/ssl/ |
| README | 20 server instead of doing widget traversal.
|
| /external/llvm/lib/Analysis/ |
| IVUsers.cpp | 151 // If we've come to an uninteresting expression, stop the traversal and
|
| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 178 // Compute from the block above. A post-order traversal ensures the
214 // Compute from the block below. A post-order traversal ensures the
419 // Specialize po_iterator_storage in order to prune the post-order traversal so
456 // Set up loop bounds for the backwards post-order traversal.
[all...] |
| /external/selinux/policycoreutils/setfiles/ |
| restore.c | 279 * the directory traversal.
|
| /external/v8/src/compiler/ |
| loop-analysis.cc | 28 // Temporary loop info needed during traversal and building the loop tree.
|
| node.h | 22 // Marks are used during traversal of the graph to distinguish states of nodes.
|
| /external/v8/src/crankshaft/ia32/ |
| lithium-gap-resolver-ia32.cc | 81 // Perform a depth-first traversal of the move graph to resolve
|
| /external/v8/src/crankshaft/x87/ |
| lithium-gap-resolver-x87.cc | 82 // Perform a depth-first traversal of the move graph to resolve
|
