| /libcore/luni/src/test/java/libcore/xml/ |
| NodeTest.java | 77 traverse(subtree, result); method
81 private void traverse(Node node, List<Node> sink) { method in class:NodeTest
86 traverse(children.item(i), sink);
|
| /external/chromium_org/chrome/common/media_galleries/ |
| itunes_xml_utils.h | 18 // Traverse |reader| looking for a node named |name| at the current depth
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/ |
| UnfoldShortCircuit.h | 24 void traverse(TIntermNode *node);
|
| intermediate.h | 220 virtual void traverse(TIntermTraverser*) = 0;
297 virtual void traverse(TIntermTraverser*);
327 virtual void traverse(TIntermTraverser*);
356 virtual void traverse(TIntermTraverser*);
376 virtual void traverse(TIntermTraverser*);
409 virtual void traverse(TIntermTraverser*);
436 virtual void traverse(TIntermTraverser*);
467 virtual void traverse(TIntermTraverser*);
510 virtual void traverse(TIntermTraverser*);
534 // it to a Traverse method
[all...] |
| intermOut.cpp | 12 // also directly call Traverse() on children themselves to
295 node->getCondition()->traverse(this);
300 node->getTrueBlock()->traverse(this);
307 node->getFalseBlock()->traverse(this);
364 node->getCondition()->traverse(this);
371 node->getBody()->traverse(this);
378 node->getExpression()->traverse(this);
403 node->getExpression()->traverse(this);
423 root->traverse(&it);
|
| QualifierAlive.cpp | 38 node->traverse(&it);
|
| RemoveTree.cpp | 75 root->traverse(&it);
|
| TranslatorESSL.cpp | 30 root->traverse(&outputESSL);
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 84 // to traverse: use 1 for matching the children and INT_MAX for
106 // - Traverse(node) calls BaseTraverse(node) when it needs
108 // - BaseTraverse(node) then calls (via VisitorBase::Traverse*(node))
109 // Traverse*(c) for each child c of 'node'.
110 // - Traverse*(c) in turn calls Traverse(c), completing the
115 traverse(*D);
117 traverse(*S);
120 traverse(*NNS);
123 traverse(*NNSLoc)
274 bool traverse(const T &Node) { function in class:clang::ast_matchers::internal::__anon17547::MatchChildASTVisitor
[all...] |
| /external/iptables/extensions/ |
| libipt_TTL.man | 2 how many hops (routers) a packet can traverse until it's time to live is
|
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/ |
| SceneGraphVisitorAdapter.java | 4 * <code>SceneGraphVisitorAdapter</code> is used to traverse the scene
|
| /external/chromium_org/chrome/browser/media_galleries/win/ |
| mtp_device_object_enumerator.h | 40 // Returns true if the enumerator has more entries to traverse, false
45 // has more entries to traverse.
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisTraverser.java | 24 * A class that implements traverses DTMAxisTraverser interface can traverse
31 * <p>A DTMAxisTraverser can probably not traverse a reverse axis in
49 * returned or the iteration will go into an infinate loop. So to traverse
66 * returned or the iteration will go into an infinate loop. So to traverse
84 * Traverse to the next node after the current node.
100 * Traverse to the next node after the current node that is matched
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 204 * Traverse to the next node after the current node.
217 * Traverse to the next node after the current node that is matched
287 * Traverse to the next node after the current node.
301 * Traverse to the next node after the current node that is matched
398 * returned or the iteration will go into an infinate loop. So to traverse
415 * returned or the iteration will go into an infinate loop. So to traverse
453 * Traverse to the next node after the current node.
466 * Traverse to the next node after the current node that is matched
667 * returned or the iteration will go into an infinate loop. So to traverse
694 * Traverse to the next node after the current node
[all...] |
| /external/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 82 /// 1. traverse the AST (i.e. go to each node);
104 /// These three method groups are tiered (Traverse* > WalkUpFrom* >
105 /// Visit*). A method (e.g. Traverse*) may call methods from the same
106 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*).
121 /// template pattern) and override any of the Traverse*, WalkUpFrom*,
125 /// users may override Traverse* and WalkUpFrom* to implement custom
165 /// dispatching to Traverse*() based on the argument's dynamic type.
172 /// Traverse*Type() based on the argument's getTypeClass() property.
179 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property.
186 /// Traverse*Decl() based on the argument's dynamic type
[all...] |
| /external/clang/tools/libclang/ |
| RecursiveASTVisitor.h | 83 /// 1. traverse the AST (i.e. go to each node);
105 /// These three method groups are tiered (Traverse* > WalkUpFrom* >
106 /// Visit*). A method (e.g. Traverse*) may call methods from the same
107 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*).
125 /// template pattern) and override any of the Traverse*, WalkUpFrom*,
129 /// users may override Traverse* and WalkUpFrom* to implement custom
158 /// dispatching to Traverse*() based on the argument's dynamic type.
165 /// Traverse*Type() based on the argument's getTypeClass() property.
172 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property.
179 /// Traverse*Decl() based on the argument's dynamic type
[all...] |
| /frameworks/compile/mclinker/lib/Fragment/ |
| FragmentGraph.cpp | 140 // Traverse all defined symbols, including global and local symbols, to add
172 // Traverse all input relocations to set connection
226 // Traverse all pseudo relocations in the pseudo nodes to set the connection
270 // Traverse all global defined symbols to build the pseudo nodes.
297 // Traverse all sections to build the Nodes. We build nodes only for Regular,
312 // Traverse all fragments in the sections, create Nodes and push the
373 // Traverse all regular nodes to find the connection to pNode
389 // create nodes - traverse all fragments to create the regular nodes, and
390 // then traverse all global defined symbols to create pseudo nodes
400 // set slots - traverse all symbols to set the slots of regular node
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/accessibility/ |
| _index.html | 19 including the ability for an AccessibilityService to traverse the view
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| TokenConstants.as | 5 /** imaginary tree navigation type; traverse "get child" link */
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| Token.js | 14 /** imaginary tree navigation type; traverse "get child" link */
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| XSLTVisitable.java | 32 * This will traverse the heararchy, calling the visitor for
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPathVisitable.java | 32 * This will traverse the heararchy, calling the visitor for
|
| /external/bison/src/ |
| relation.c | 48 | digraph & traverse. |
62 traverse (relation_node i) function
74 traverse (R[i][j]);
111 traverse (i);
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/ |
| DependencyGraphOutput.cpp | 62 symbol->traverse(this);
|
| /external/chromium_org/v8/test/cctest/ |
| test-symbols.cc | 3 // Check that we can traverse very deep stacks of ConsStrings using
|
