| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| MappingNodeTest.java | 16 package org.yaml.snakeyaml.nodes;
|
| /external/v8/src/compiler/ |
| loop-analysis.h | 34 // Represents a loop in the tree of loops, including the header nodes,
88 // Return a range which can iterate over the header nodes of {loop}.
97 // Return a range which can iterate over the body nodes of {loop}.
103 // Return a range which can iterate over the nodes of {loop}.
|
| loop-peeling.h | 15 // from the body of the loop to the corresponding nodes in the peeled
|
| select-lowering.h | 22 // Lowers Select nodes to diamonds.
|
| tail-call-optimization.h | 20 // and Call nodes with a single TailCall.
|
| /external/v8/test/cctest/ |
| expression-type-collector.h | 15 // to the expression nodes of an AST.
|
| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| wpd_tree.h | 26 // The number of nodes in the tree will be 2 ^ levels - 1.
48 // Returns the number of nodes at any given level.
67 // Updates all the nodes of the tree with the new data. |data_length| must be
76 // Returns the total number of nodes.
|
| /hardware/ti/omap3/dspbridge/libbridge/inc/ |
| qos_ti_uuid.h | 21 * Auto-generated UUID structures for DSP/BIOS Bridge nodes.
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| nodegetnamespaceuri03.java | 35 * For nodes of any type other than ELEMENT_NODE and ATTRIBUTE_NODE and nodes created with
38 * Ceate two new element nodes and atribute nodes, with and without namespace prefixes.
|
| /libcore/luni/src/test/java/tests/org/w3c/dom/ |
| NodeGetNamespaceURI.java | 34 * For nodes of any type other than ELEMENT_NODE and ATTRIBUTE_NODE and nodes created with
37 * Ceate two new element nodes and atribute nodes, with and without namespace prefixes.
|
| /packages/services/Car/car_product/sepolicy/ |
| mpdecision.te | 20 # Access to sysfs_thermal nodes.
|
| thermal-engine.te | 27 # Write access to thermal related sysfs nodes.
|
| /prebuilts/tools/common/lombok-ast/ |
| PREBUILT | 15 which basically adds an extra field to the nodes to track
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_dot.py | 35 self.assertEqual(dot.nodes, dict([(x, {}) for x in g]))
47 dot = Dot.Dot(g, nodes=[1,2],
66 self.assertEqual(dot.nodes, dict([(x, {'label': x}) for x in [1,2]]))
78 self.assertRaises(GraphError, Dot.Dot, g, nodes=[1,2, 9])
108 self.assertEqual(dot.nodes[1], {})
111 self.assertEqual(dot.nodes[1], {'key': 'value'})
114 self.assertEqual(dot.nodes[1], {'key2': 'value2'})
115 self.assertEqual(dot.nodes[2], {})
119 self.assertEqual(dot.nodes[n], {'key3': 'value3'})
121 self.assertTrue(9 not in dot.nodes)
[all...] |
| /external/libxml2/ |
| testC14N.c | 57 /* static void print_xpath_nodes(xmlNodeSetPtr nodes); */
331 print_xpath_nodes(xmlNodeSetPtr nodes) {
335 if(nodes == NULL ){
336 fprintf(stderr, "Error: no nodes set defined\n");
340 fprintf(stderr, "Nodes Set:\n-----\n");
341 for(i = 0; i < nodes->nodeNr; ++i) {
342 if(nodes->nodeTab[i]->type == XML_NAMESPACE_DECL) {
345 ns = (xmlNsPtr)nodes->nodeTab[i];
350 } else if(nodes->nodeTab[i]->type == XML_ELEMENT_NODE) {
351 cur = nodes->nodeTab[i]
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 14 // 1. A Function* object, composed of BasicBlock nodes.
15 // 2. An IntervalPartition& object, composed of Interval nodes.
69 Int->Nodes.push_back(BB);
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
170 // the ProcessNode method to add all of the nodes to the interval
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ |
| Node.java | 21 * <code>Text</code> nodes may not have children, and adding children to
22 * such nodes results in a <code>DOMException</code> being raised.
220 * The parent of this node. All nodes, except <code>Attr</code>,
232 * nodes.
268 * also the <code>Document</code> object used to create new nodes. When
405 * constructor for nodes. The duplicate node has no parent (
428 * . In addition, clones of unspecified <code>Attr</code> nodes are
431 * <code>Notation</code> nodes is implementation dependent.
440 * Puts all <code>Text</code> nodes in the full depth of the sub-tree
441 * underneath this <code>Node</code>, including attribute nodes, into
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| RecognitionException.as | 93 * imaginary nodes w/o line/col info. We now search backwards looking
124 var nodes:TreeNodeStream = TreeNodeStream(input);
125 this.node = nodes.LT(1);
126 var adaptor:TreeAdaptor = nodes.treeAdaptor;
133 var priorNode:Object = nodes.LT(i);
144 priorNode = nodes.LT(i);
172 var nodes:TreeNodeStream = TreeNodeStream(input);
173 var adaptor:TreeAdaptor = nodes.treeAdaptor;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| RecognitionException.java | 92 * imaginary nodes w/o line/col info. We now search backwards looking
124 TreeNodeStream nodes = (TreeNodeStream)input; local
125 this.node = nodes.LT(1);
126 TreeAdaptor adaptor = nodes.getTreeAdaptor();
133 Object priorNode = nodes.LT(i);
144 priorNode = nodes.LT(i);
172 TreeNodeStream nodes = (TreeNodeStream)input; local
173 TreeAdaptor adaptor = nodes.getTreeAdaptor();
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| RecognitionException.js | 106 * imaginary nodes w/o line/col info. We now search backwards looking
117 var nodes = input,
124 this.node = nodes.LT(1);
125 var adaptor = nodes.getTreeAdaptor(),
132 priorNode = nodes.LT(i);
143 priorNode = nodes.LT(i);
173 var nodes = this.input;
174 var adaptor = nodes.getTreeAdaptor();
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable
47 @property (retain) AMutableArray *nodes; variable
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| SubContextList.java | 34 * Get the number of nodes in the node list, which, in the XSLT 1 based
40 * @return the number of nodes in the node list.
|
| /external/clang/docs/ |
| IntroductionToTheClangAST.rst | 25 Documentation for all Clang AST nodes is available via the generated
75 whose child nodes are a `declaration
92 AST Nodes
95 Clang's AST nodes are modeled on a class hierarchy that does not have a
100 important AST nodes derive from
107 There are also a multitude of nodes in the AST that are not part of a
108 larger hierarchy, and are only reachable from specific other nodes, like
120 The two most basic nodes in the Clang AST are statements
|
| LibASTMatchers.rst | 6 nodes of the AST and execute code that uses the matched nodes. Combined with
21 to write a single program to both match AST nodes and access the node's C++
25 AST matchers are predicates on nodes in the AST. Matchers are created by
73 Binding nodes in match expressions
77 for a certain task. Often you will want to then do something with the nodes
80 To that end, matchers that match specific AST nodes (so called node matchers)
98 Those match all nodes of type *Base* if they can be dynamically casted to
|
| RAVFrontendAction.rst | 9 a RecursiveASTVisitor to find CXXRecordDecl AST nodes with a specified
50 // will visit all nodes in the AST.
65 VisitNodeType(NodeType \*) for most AST nodes; the exception are TypeLoc
66 nodes, which are passed by-value. We only need to implement the methods
78 // For debugging, dumping the AST nodes will show which nodes are already
105 identifier information, are not stored in the AST nodes themselves, but
122 do more interesting things with AST nodes, like looking up their source
|
