| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/partialconstruct/ |
| FragmentComposer.java | 19 import org.yaml.snakeyaml.nodes.MappingNode;
20 import org.yaml.snakeyaml.nodes.Node;
21 import org.yaml.snakeyaml.nodes.NodeTuple;
22 import org.yaml.snakeyaml.nodes.ScalarNode;
|
| /external/snakeyaml/src/test/resources/pyyaml/ |
| construct-seq.data | 1 # Ordered sequence of nodes
|
| /external/snakeyaml/src/test/resources/specification/types/ |
| seq.yaml | 1 # Ordered sequence of nodes
|
| /external/v8/src/regexp/ |
| regexp-ast.cc | 40 return ListCaptureRegisters(nodes());
76 ZoneList<RegExpTree*>* nodes = this->nodes(); local
77 for (int i = 0; i < nodes->length(); i++) {
78 RegExpTree* node = nodes->at(i);
91 ZoneList<RegExpTree*>* nodes = this->nodes(); local
92 for (int i = nodes->length() - 1; i >= 0; i--) {
93 RegExpTree* node = nodes->at(i);
165 for (int i = 0; i < that->nodes()->length(); i++)
[all...] |
| /packages/services/Car/car_product/sepolicy/ |
| bluetooth.te | 16 # Allow access to bt_power sysfs nodes.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/asm/ |
| e820.h | 7 * Legacy E820 BIOS limits us to 128 (E820MAX) nodes due to the
8 * constrained space in the zeropage. If we have more nodes than
10 * passed us from the EFI firmware can list more nodes. Size our
12 * nodes, based on up to three entries per node for which the
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| initorder.go | 20 // of graph nodes
38 // repeatedly, until there are no nodes left.
39 // In a valid Go program, those nodes always have zero dependencies (after
48 // if n still depends on other nodes, we have a cycle
50 mark++ // mark nodes using a different value each time
60 // reduce dependency count of all dependent nodes
100 // findPath returns the (reversed) list of nodes z, ... c, b, a,
103 // Nodes marked with the value mark are considered "visited";
104 // unvisited nodes are marked during the graph search.
154 // Nodes may be marked for cycle detection. A node n is marke
[all...] |
| /prebuilts/go/linux-x86/src/go/types/ |
| initorder.go | 20 // of graph nodes
38 // repeatedly, until there are no nodes left.
39 // In a valid Go program, those nodes always have zero dependencies (after
48 // if n still depends on other nodes, we have a cycle
50 mark++ // mark nodes using a different value each time
60 // reduce dependency count of all dependent nodes
100 // findPath returns the (reversed) list of nodes z, ... c, b, a,
103 // Nodes marked with the value mark are considered "visited";
104 // unvisited nodes are marked during the graph search.
154 // Nodes may be marked for cycle detection. A node n is marke
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 67 /// common case in an ExplodedGraph, where most nodes have only one
71 /// empty and no nodes may be added.
75 // for the nodes in the group.
260 /// The nodes in the simulation graph which have been
264 /// Nodes - The nodes in the graph.
265 llvm::FoldingSet<ExplodedNode> Nodes;
267 /// BVC - Allocator and context for allocating nodes and their predecessor
271 /// NumNodes - The number of nodes in the graph.
274 /// A list of recently allocated nodes that can potentially be recycled
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationbuilder.h | 61 * node=nodes[index].
88 * Skips over nodes of weaker strength to maintain collation order
105 * Skips weaker nodes and tailored nodes if the current node is stronger
153 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
155 * The nodes array can then be used only as a source of tailored CEs.
159 * Counts the tailored nodes of the given strength up to the next node
223 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
226 * Node bit 6 is set on a primary node if there are nodes
231 * Node bit 5 is set on a primary or secondary node if there are nodes
401 UVector64 nodes; member in class:CollationBuilder
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| DomFront.java | 35 private final ArrayList<SsaBasicBlock> nodes; field in class:DomFront
60 nodes = meth.getBlocks();
62 int szNodes = nodes.size();
76 int szNodes = nodes.size();
80 SsaBasicBlock node = nodes.get(i);
120 int szNodes = nodes.size();
123 SsaBasicBlock node = nodes.get(i);
148 int szNodes = nodes.size();
155 SsaBasicBlock domParent = nodes.get(info.idom);
156 domParent.addDomChild(nodes.get(i))
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| DomFront.java | 39 private final ArrayList<SsaBasicBlock> nodes; field in class:DomFront
64 nodes = meth.getBlocks();
66 int szNodes = nodes.size();
80 int szNodes = nodes.size();
84 SsaBasicBlock node = nodes.get(i);
124 int szNodes = nodes.size();
127 SsaBasicBlock node = nodes.get(i);
152 int szNodes = nodes.size();
159 SsaBasicBlock domParent = nodes.get(info.idom);
160 domParent.addDomChild(nodes.get(i))
[all...] |
| /external/freetype/src/cache/ |
| ftcmru.c | 177 list->nodes = NULL;
187 while ( list->nodes )
188 FTC_MruList_Remove( list, list->nodes );
210 first = list->nodes;
221 FTC_MruNode_Up( &list->nodes, node );
247 node = list->nodes->prev;
253 FTC_MruNode_Up( &list->nodes, node );
260 FTC_MruNode_Remove( &list->nodes, node );
273 FTC_MruNode_Prepend( &list->nodes, node );
311 FTC_MruNode_Remove( &list->nodes, node )
[all...] |
| /external/guice/extensions/grapher/test/com/google/inject/grapher/ |
| AbstractInjectorGrapherTest.java | 48 final Set<Node> nodes = Sets.newHashSet(); field in class:AbstractInjectorGrapherTest.FakeGrapher
52 nodes.clear();
57 assertFalse(nodes.contains(node));
58 nodes.add(node);
62 assertFalse(nodes.contains(node));
63 nodes.add(node);
67 assertFalse(nodes.contains(node));
68 nodes.add(node);
140 assertEquals(expectedNodes, grapher.nodes);
165 assertEquals("wrong nodes", expectedNodes, grapher.nodes)
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| SyntaxTreeOptimizer.java | 24 * Visitor that can be applied to the AST to optimize it by replacing nodes with more efficient
30 * Replace AMultipleCommand nodes with AOptimizedMultipleCommands, which iterates over children
35 // Recurse through child nodes first. Because the optimised node doesn't
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
| ftcmru.c | 177 list->nodes = NULL;
187 while ( list->nodes )
188 FTC_MruList_Remove( list, list->nodes );
210 first = list->nodes;
221 FTC_MruNode_Up( &list->nodes, node );
247 node = list->nodes->prev;
253 FTC_MruNode_Up( &list->nodes, node );
260 FTC_MruNode_Remove( &list->nodes, node );
273 FTC_MruNode_Prepend( &list->nodes, node );
311 FTC_MruNode_Remove( &list->nodes, node )
[all...] |
| /external/libxml2/result/XPath/tests/ |
| idsimple | 5 Set contains 1 nodes:
20 Set contains 1 nodes:
29 Set contains 1 nodes:
|
| nodespat | 5 Set contains 1 nodes:
11 Set contains 12 nodes:
36 Set contains 11 nodes:
60 Set contains 12 nodes:
85 Set contains 5 nodes:
|
| /external/pdfium/xfa/src/fxfa/src/parser/ |
| xfa_script_resolveprocessor.cpp | 111 CXFA_ObjArray& nodes = rnd.m_Nodes;
local
116 nodes.Add(rnd.m_CurNode);
125 nodes.Add(rnd.m_pSC->GetDocument()->GetRoot());
216 CXFA_ObjArray& nodes = rnd.m_Nodes;
local
217 int32_t nNum = nodes.GetSize();
256 nodes.Add(pVariablesNode);
265 nodes.Append(rndFind.m_Nodes);
269 if (nodes.GetSize() > nNum) {
271 if (nodes.GetSize() > 0) {
286 nodes.Add(child);
503 CXFA_ObjArray& nodes = rnd.m_Nodes; local
[all...] |
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/res/ |
| XpathResourceXmlLoader.java | 23 NodeList nodes = (NodeList) stringsXPath.evaluate(document, XPathConstants.NODESET); local
24 for (int i = 0; i < nodes.getLength(); i++) {
25 Node node = nodes.item(i);
|
| /external/v8/src/compiler/ |
| common-node-cache.h | 22 // Bundles various caches for common nodes.
55 // Return all nodes from the cache.
56 void GetCachedNodes(ZoneVector<Node*>* nodes);
|
| graph-trimmer.h | 18 // Trims dead nodes from the node graph.
24 // Trim nodes in the {graph} that are not reachable from {graph->end()}.
27 // Trim nodes in the {graph} that are not reachable from either {graph->end()}
|
| /system/update_engine/payload_generator/ |
| topological_sort.cc | 32 vector<Vertex::Index>* nodes,
41 TopologicalSortVisit(graph, visited_nodes, nodes, it->first);
44 nodes->push_back(node);
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| Axis.java | 26 * document (ignoring attribute and namespace nodes): they do not overlap
27 * and together they contain all the nodes in the document.</p>
60 * descendant axis never contains attribute or namespace nodes.
71 * the following axis contains all nodes in the same document as the
73 * any descendants and excluding attribute nodes and namespace nodes.
85 * The namespace axis contains the namespace nodes of the context node; the
91 * The namespace axis contains the namespace nodes of the context node; the
103 * The preceding axis contains all nodes in the same document as the context
105 * ancestors and excluding attribute nodes and namespace node
[all...] |
| /external/libxml2/include/libxml/ |
| c14n.h | 38 * a) default attributes (if any) are added to all nodes
69 xmlNodeSetPtr nodes,
77 xmlNodeSetPtr nodes,
85 xmlNodeSetPtr nodes,
102 * Signature for a C14N callback on visible nodes
|
