| /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeWizard.java | 42 * In order to create nodes and navigate, this class needs a TreeAdaptor.
45 * iterating over the various nodes with a particular type.
110 * nodes such as function definition nodes (you'll want to seek
112 * dynamic searches; i.e., go find me all PLUS nodes.
170 /** Walk the entire tree and make a node name to nodes mapping.
202 /** Return a List of tree nodes with token type ttype */
204 final List<Object> nodes = new ArrayList<Object>(); local
208 nodes.add(t);
211 return nodes;
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncDocument.java | 103 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
104 return nodes;
144 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
145 NodeSetDTM mnl = nodes.mutableNodeset();
196 // nodes.mutableNodeset().addNode(newDoc);
210 return nodes;
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 35 * This class can sort vectors of DOM nodes according to a select pattern.
65 * Given a vector of nodes, sort each node according to
67 * @param v an vector of Nodes.
87 // based on the input vector of nodes
88 Vector nodes = new Vector(); local
94 nodes.addElement(elem);
99 mergesort(nodes, scratchVector, 0, n - 1, support);
101 // return sorted vector of nodes
104 v.setItem(((NodeCompareElem) nodes.elementAt(i)).m_node, i);
114 * Return the results of a compare of two nodes
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/icu/ |
| FixEras.java | 47 "This program is used to extract nodes from extract LDML file and merge \n" +
48 "the extracted nodes with the main LDML file\n" +
111 Node[] nodes = LDMLUtilities.getElementsByTagName(doc, LDMLConstants.ERA); local
112 if (nodes != null) {
113 for (int i = 0; i < nodes.length; i++) {
114 NamedNodeMap attr = nodes[i].getAttributes();
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 139 const RealScalar nodes[][maxPadeDegree] = { local
215 RealScalar node = nodes[degree-minPadeDegree][k];
|
| /external/icu/icu4c/source/i18n/ |
| collationbuilder.h | 63 * node=nodes[index].
90 * Skips over nodes of weaker strength to maintain collation order
107 * Skips weaker nodes and tailored nodes if the current node is stronger
155 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
157 * The nodes array can then be used only as a source of tailored CEs.
161 * Counts the tailored nodes of the given strength up to the next node
225 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
228 * Node bit 6 is set on a primary node if there are nodes
233 * Node bit 5 is set on a primary or secondary node if there are nodes
403 UVector64 nodes; member in class:CollationBuilder
[all...] |
| /external/kernel-headers/original/uapi/linux/ |
| scif_ioctl.h | 188 * @nodes: pointer to an array of node_ids
193 __u64 nodes; member in struct:scifioctl_node_ids
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 203 nodes = new Graph::Node * [graph->getSize() + 1];
206 nodes[graph->getSize()] = 0;
216 if (nodes)
217 delete[] nodes;
223 nodes[count++] = node;
230 nodes[count++] = node;
235 virtual void *get() const { return nodes[pos]; }
239 Graph::Node **nodes; member in class:nv50_ir::DFSIterator
259 nodes = new Graph::Node * [graph->getSize() + 1];
262 nodes[graph->getSize()] = 0
324 Graph::Node **nodes; member in class:nv50_ir::CFGIterator
[all...] |
| /external/skia/src/compute/skc/platforms/cl_12/ |
| raster_builder_cl_12.h | 109 skc_uint nodes; // # of nodes in raster -- necessary for walking member in struct:skc_raster_cohort_meta_out::__anon38035
|
| /external/skia/src/compute/skc/ |
| raster.h | 64 // u32[0]: header.blocks | header.nodes | bounds.x0 | bounds.y0 | TTXK.lo[] ...
77 skc_uint nodes; // # of nodes -- not including header -- uint2.lo member in struct:skc_raster_header::__anon38040
114 #define SKC_RASTER_HEAD_OFFSET_COUNTS_NODES_CALC (SKC_OFFSET_OF(struct skc_raster_head,header.nodes) / sizeof(skc_uint))
|
| /external/skqp/src/compute/skc/platforms/cl_12/ |
| raster_builder_cl_12.h | 109 skc_uint nodes; // # of nodes in raster -- necessary for walking member in struct:skc_raster_cohort_meta_out::__anon38838
|
| /external/skqp/src/compute/skc/ |
| raster.h | 64 // u32[0]: header.blocks | header.nodes | bounds.x0 | bounds.y0 | TTXK.lo[] ...
77 skc_uint nodes; // # of nodes -- not including header -- uint2.lo member in struct:skc_raster_header::__anon38843
114 #define SKC_RASTER_HEAD_OFFSET_COUNTS_NODES_CALC (SKC_OFFSET_OF(struct skc_raster_head,header.nodes) / sizeof(skc_uint))
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| Tag.java | 16 package org.yaml.snakeyaml.nodes;
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| graphcycles.cc | 58 NodeSet in; // List of immediate predecessor nodes in graph
59 NodeSet out; // List of immediate successor nodes in graph
71 Vec<int32> list_; // All nodes to reprocess
162 static void ClearVisitedBits(GraphCycles::Rep* r, const Vec<int32>& nodes);
182 // We only need to consider nodes that fall in the range [ny->rank,nx->rank].
199 // We instead keep a stack of nodes to visit.
267 static void Sort(const Vec<Node*>& nodes, Vec<int32>* delta) {
269 const Vec<Node*>* nodes; member in struct:tensorflow::ByRank
271 return (*nodes)[a]->rank < (*nodes)[b]->rank
[all...] |
| graphcycles_test.cc | 35 typedef std::vector<int> Nodes;
61 static void PrintNodes(Nodes *nodes) {
62 LOG(INFO) << "NODES (" << nodes->size() << ")";
63 for (int i = 0; i != nodes->size(); i++) {
64 LOG(INFO) << (*nodes)[i];
78 static void PrintGCEdges(Nodes *nodes, tensorflow::GraphCycles *gc) {
80 for (int i = 0; i != nodes->size(); i++)
199 Nodes nodes; local
514 int32 *nodes = new int32[num_nodes]; local
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_while.cc | 55 // arguments must have all of the following nodes:
77 // Set of nodes that belong to the loop frame.
78 std::unordered_set<Node*> nodes; member in struct:tensorflow::__anon44103::Frame
82 // starting at nodes in vector `stack`.
83 // `node_map` is a vector indexed by source node ID to dest nodes.
84 // Does not traverse into nodes in `node_map`, so by adding nodes to `node_map`
87 // traversal leaves 'frame'; the client must add enough nodes to `node_map` to
94 // nodes only have one output. By adding the Switch node to `squash_src_outputs`
113 if (frame != nullptr && frame->nodes.find(src) == frame->nodes.end())
[all...] |
| tf2xla_util_test.cc | 229 for (Node* n : graph->nodes()) {
285 // Nodes
407 std::unordered_map<string, NodeDef> nodes; local
409 nodes[node_def.name()] = node_def;
411 auto noop_def = nodes.find("duplicate_name");
412 ASSERT_NE(noop_def, nodes.end());
414 auto const_def = nodes.find("duplicate_name/_0");
415 ASSERT_NE(const_def, nodes.end());
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| executor_test.cc | 174 // All nodes are executed by one thread.
207 std::vector<Node*> nodes; local
211 nodes.push_back(test::graph::Identity(g, in, 0));
215 while (nodes.size() > 1) {
216 // Randomly pick two from nodes and add them. The resulting node
217 // is named lik n10, n11, .... and is put back into "nodes".
218 int x = rnd.Uniform(nodes.size());
219 auto in0 = nodes[x];
220 nodes[x] = nodes.back()
[all...] |
| placer_test.cc | 222 for (Node* node : out_graph->nodes()) {
232 for (Node* node : out_graph->nodes()) {
315 // Test that a graph with no constraints will successfully assign nodes to the
334 // device priority will successfully assign nodes to the device with higher
579 // some of the ops will successfully assign nodes to the constrained
580 // device, and colocate nodes with reference connections.
1793 std::unordered_map<string, Node*> nodes = g.BuildNodeNameIndex(); local
[all...] |
| /external/tensorflow/tensorflow/core/grappler/graph_analyzer/ |
| sig_node.h | 40 // To find nodes by name. Having the map ordered makes the tests easier,
69 // from the nodes in the full graph to the matching nodes in subgraph.
74 // A link is an edge of the graph that connects 2 nodes. Each of the connected
75 // nodes has its own perspective on the link, seeing its local port, remote
115 // with the same tag (other than by the "peer" nodes on their other ends),
129 // The enumeration of all the peer nodes in a predictable order.
149 // Compares two nodes in two different graphs for equivalence (two nodes in
173 // lower distances must be already computed for all the nodes in the graph
269 std::vector<SigNode*> nodes; member in struct:tensorflow::grappler::graph_analyzer::Signature
[all...] |
| /external/tensorflow/tensorflow/core/grappler/ |
| graph_view.h | 49 // an immutable view of the nodes and edges represented by a GraphDef protocol
56 // have const pointers to nodes).
60 // pointers to nodes), and also have couple additional functions to
61 // add/remove/replace nodes in the graph.
64 // Removing nodes from the graph outside of MutableGraphView will
125 // used to access the controlling nodes (i.e. the nodes connected to node_name
132 // used to access the controlled nodes (i.e. the nodes connected to node_name
205 // controlled nodes iff include_controlled_nodes is true
358 absl::flat_hash_map<absl::string_view, NodeDefT*>& nodes() { return nodes_; } function in class:tensorflow::grappler::internal::GraphViewInternal
[all...] |
| grappler_item_builder.cc | 200 // Fill in feed nodes from config, if any provided.
212 const CollectionDef& nodes = meta_graph.collection_def().at("train_op"); local
213 if (nodes.has_node_list()) {
214 for (const auto& node : nodes.node_list().value()) {
220 // Detect feed and fetch nodes from signature defs. Signatures may share same
335 // to initialize all variables that are required to run fetch nodes. We may
372 // the values of these constant nodes with their actual asset file paths.
431 // Add each node referenced in a collection to the list of nodes to keep.
468 // Some placeholder nodes have a mis-match between the node
500 // No specific feed nodes were given. Assume all placeholders are fed
618 std::unordered_set<string> nodes; local
[all...] |
| /external/tensorflow/tensorflow/core/kernels/data/ |
| single_threaded_executor_test.cc | 165 // All nodes are executed by one thread.
196 std::vector<Node*> nodes; local
200 nodes.push_back(test::graph::Identity(g, in, 0));
204 while (nodes.size() > 1) {
205 // Randomly pick two from nodes and add them. The resulting node
206 // is named lik n10, n11, .... and is put back into "nodes".
207 int x = rnd.Uniform(nodes.size());
208 auto in0 = nodes[x];
209 nodes[x] = nodes.back()
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| lrn_op.cc | 90 const int nodes = cols * rows; local
97 auto in_shaped = in.shaped<T, 2>({nodes * batch, depth});
104 auto out_shaped = output->shaped<T, 2>({nodes * batch, depth});
324 const auto nodes = cols * rows; local
325 auto grads_shaped = in_grads.shaped<T, 2>({nodes * batch, depth});
326 auto in_shaped = in_image.shaped<T, 2>({nodes * batch, depth});
327 auto activations = out_image.shaped<T, 2>({nodes * batch, depth});
329 auto out_shaped = output->shaped<T, 2>({nodes * batch, depth});
374 Shard(worker_threads.num_threads, worker_threads.workers, nodes * batch,
|
| /external/tensorflow/tensorflow/lite/ |
| arena_planner_test.cc | 46 // A test graph where inputs are processed by the given nodes to produce
51 std::initializer_list<TestOp> nodes,
62 for (const auto& node : nodes) {
101 const std::vector<TfLiteNode>& nodes() { return nodes_; } function in class:tflite::__anon45832::TestGraph
136 size_t num_nodes() const override { return graph_->nodes().size(); }
138 return graph_->nodes()[index];
|
