| /external/antlr/runtime/ObjC/Framework/ |
| StreamEnumerator.h | 39 AMutableArray *nodes; variable
47 @property (retain) AMutableArray *nodes; variable
|
| TreeIterator.h | 45 __strong FastQueue *nodes; variable
55 @property(retain) FastQueue *nodes; variable
|
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncSum.java | 49 DTMIterator nodes = m_arg0.asIterator(xctxt, xctxt.getCurrentNode()); local
53 while (DTM.NULL != (pos = nodes.nextNode()))
55 DTM dtm = nodes.getDTM(pos);
61 nodes.detach();
|
| /build/make/core/ |
| node_fns.mk | 121 # $(call get-inherited-nodes,PREFIX,A B)
128 define get-inherited-nodes
151 $(eval ### "Get the list of nodes that this variable inherits") \
198 $(call get-inherited-nodes,$(1).$(2),$(3)))
199 $(call _import-nodes-inner,$(1),$($(1).$(2).inherited),$(3))
216 # $(2): list of makefiles representing nodes to import
221 define _import-nodes-inner
238 # $(2): list of makefiles representing nodes to import
241 define import-nodes
248 $(call _import-nodes-inner,$(_node_import_context),$(_in),$(3))
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| State.java | 10 ArrayList nodes; field in class:State
12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes)
15 this.nodes = nodes;
|
| /external/llvm/utils/ |
| DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
35 <output_file> [list of nodes to extract]'
66 #for the node (it will be Node(hex number)) to our set of nodes
96 #check to make sure that both nodes are in the node list
98 nodes = arrowexp.split(buffer) variable
99 nodes[0] = string.strip(nodes[0])
100 nodes[1] = string.strip(nodes[1]
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| CollectionNode.java | 16 package org.yaml.snakeyaml.nodes;
|
| NodeId.java | 16 package org.yaml.snakeyaml.nodes;
|
| NodeTuple.java | 16 package org.yaml.snakeyaml.nodes;
28 throw new NullPointerException("Nodes must be provided.");
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| MappingNodeTest.java | 16 package org.yaml.snakeyaml.nodes;
|
| /external/swiftshader/third_party/LLVM/utils/ |
| DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
35 <output_file> [list of nodes to extract]'
66 #for the node (it will be Node(hex number)) to our set of nodes
96 #check to make sure that both nodes are in the node list
98 nodes = arrowexp.split(buffer) variable
99 nodes[0] = string.strip(nodes[0])
100 nodes[1] = string.strip(nodes[1]
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| GraphTraits.h | 48 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
64 // Return total number of nodes in the graph
99 // Provide iterator ranges for the graph traits nodes and children
102 nodes(const GraphType &G) { function in namespace:llvm
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/ |
| DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
35 <output_file> [list of nodes to extract]'
66 #for the node (it will be Node(hex number)) to our set of nodes
96 #check to make sure that both nodes are in the node list
98 nodes = arrowexp.split(buffer) variable
99 nodes[0] = string.strip(nodes[0])
100 nodes[1] = string.strip(nodes[1]
[all...] |
| /external/tensorflow/tensorflow/tools/graph_transforms/ |
| add_default_attributes_test.cc | 56 std::map<string, const NodeDef*> nodes; local
57 MapNamesToNodes(result, &nodes);
58 EXPECT_EQ(5, nodes.at("lrn_node1")->attr().at("depth_radius").i());
59 EXPECT_NEAR(1.0f, nodes.at("lrn_node1")->attr().at("bias").f(), 1e-5f);
60 EXPECT_NEAR(1.0f, nodes.at("lrn_node1")->attr().at("alpha").f(), 1e-5f);
61 EXPECT_NEAR(0.5f, nodes.at("lrn_node1")->attr().at("beta").f(), 1e-5f);
62 EXPECT_EQ(7, nodes.at("lrn_node2")->attr().at("depth_radius").i());
63 EXPECT_NEAR(2.0f, nodes.at("lrn_node2")->attr().at("bias").f(), 1e-5f);
64 EXPECT_NEAR(2.0f, nodes.at("lrn_node2")->attr().at("alpha").f(), 1e-5f);
65 EXPECT_NEAR(1.0f, nodes.at("lrn_node2")->attr().at("beta").f(), 1e-5f)
[all...] |
| /external/u-boot/board/freescale/bsc9131rdb/ |
| bsc9131rdb.c | 56 struct node_info nodes[] = { variable in typeref:struct:node_info
72 fdt_fixup_mtdparts(blob, nodes, ARRAY_SIZE(nodes));
|
| /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/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeIterator.java | 35 /** Return a node stream from a doubly-linked tree whose nodes
38 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
46 // navigation nodes to return during walk and at end
51 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
54 protected FastQueue<Object> nodes; field in class:TreeIterator
64 nodes = new FastQueue<Object>();
73 nodes.clear();
79 if ( nodes!=null && nodes.size()>0 ) return true
[all...] |
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 40 List<Node<T>> edges; // points at which nodes?
54 protected Map<T,Node<T>> nodes = new HashMap<T,Node<T>>(); field in class:Graph
64 Node<T> existing = nodes.get(a);
67 nodes.put(a, n);
85 while ( visited.size() < nodes.size() ) {
88 for (Node<T> tNode : nodes.values()) {
|
| /external/doclava/src/com/google/doclava/ |
| Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); local
32 TreeSet<String> me = nodes.get(name);
35 nodes.put(name, me);
41 TreeSet<String> s = nodes.get(sname);
44 nodes.put(sname, s);
51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n);
53 * TreeSet<String> values = nodes.get(n); for (String v: values) {
57 int depth = depth(nodes, "java.lang.Object");
62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth);
65 Set<String> keys = nodes.keySet()
[all...] |
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
65 nodes = new Queue<object>();
95 nodes.Enqueue(eof);
100 if (nodes != null && nodes.Count > 0)
[all...] |
| /external/antlr/runtime/ObjC/Framework/examples/treeparser/ |
| Main.java | 15 CommonTreeNodeStream nodes = new CommonTreeNodeStream(r0); local
16 nodes.setTokenStream(tokens);
17 LangDumpDecl walker = new LangDumpDecl(nodes);
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 55 List<String> nodes = g.sort(); local
56 String result = nodes.toString();
69 List<String> nodes = g.sort(); local
70 String result = nodes.toString();
83 List<String> nodes = g.sort(); local
84 String result = nodes.toString();
97 List<String> nodes = g.sort(); local
98 String result = nodes.toString();
111 List<String> nodes = g.sort(); local
112 String result = nodes.toString()
[all...] |
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 17 A nodes; member in struct:B
39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
|
| /external/curl/tests/unit/ |
| unit1309.c | 71 /* number of nodes to add to the splay tree */
75 struct Curl_tree nodes[NUM_NODES*3]; variable in typeref:struct:Curl_tree
82 /* add nodes */
89 nodes[i].payload = &storage[i];
90 root = Curl_splayinsert(key, root, &nodes[i]);
101 *(size_t *)nodes[rem].payload);
102 rc = Curl_splayremovebyaddr(root, &nodes[rem], &root);
110 fail_unless(root == NULL, "tree not empty after removing all nodes");
119 /* add some nodes with the same key */
122 nodes[i * 3 + j].payload = &storage[i * 3 + j]
[all...] |
| /external/deqp-deps/SPIRV-Tools/test/util/ |
| ilist_test.cpp | 49 TestNode nodes[10]; local
52 nodes[i].data_ = i;
53 list.push_back(&nodes[i]);
63 // nodes to build the list.
64 TestList BuildList(TestNode nodes[], int n) {
67 nodes[i].data_ = i;
68 list.push_back(&nodes[i]);
75 TestNode nodes[10]; local
76 TestList list = BuildList(nodes, 10);
82 TestNode nodes[10] local
89 TestNode nodes[10]; local
96 TestNode nodes[10]; local
103 TestNode nodes[10]; local
113 TestNode nodes[10]; local
123 TestNode nodes[10]; local
135 TestNode nodes[10]; local
150 TestNode nodes[10]; local
165 TestNode nodes[10]; local
178 TestNode nodes[10]; local
191 TestNode nodes[10]; local
204 TestNode nodes[10]; local
217 TestNode nodes[10]; local
230 TestNode nodes[10]; local
243 TestNode nodes[10]; local
256 TestNode nodes[10]; local
274 TestNode nodes[10]; local
291 TestNode nodes[10]; local
308 TestNode nodes[10]; local
[all...] |
