HomeSort by relevance Sort by last modified time
    Searched refs:n_root (Results 1 - 3 of 3) sorted by null

  /external/tensorflow/tensorflow/tools/graph_transforms/
fold_constants_test.cc 237 auto n_root = tensorflow::Scope::NewRootScope(); local
238 _Recv(n_root.WithOpName("original_recv"), DT_FLOAT, "", "", 0, "");
240 Const(n_root.WithOpName("a_const"), Input::Initializer(a_const_data));
241 _Recv(n_root.WithOpName("_recv_placeholder_0"), DT_FLOAT, "", "", 0, "");
242 _Send(n_root.WithOpName("original_send"), n_a_const, "", "", 0, "");
243 _Send(n_root.WithOpName("new_send"), n_a_const, "", "", 0, "");
245 TF_ASSERT_OK(n_root.ToGraphDef(&n_graph_def));
272 auto n_root = tensorflow::Scope::NewRootScope(); local
273 auto c = _Recv(n_root.WithOpName("_recv_placeholder_0"), DT_FLOAT, "", "",
275 auto d = _Recv(n_root.WithOpName("_recv_placeholder_1_0"), DT_FLOAT, "", ""
    [all...]
  /system/update_engine/payload_generator/
cycle_breaker_unittest.cc 138 const Vertex::Index n_root = counter++; local
140 Vertex::Index last_hub = n_root;
158 graph[last_hub].out_edges.insert(EdgeWithWeight(n_root, 5));
170 for (Vertex::EdgeMap::const_iterator it = graph[n_root].out_edges.begin(),
171 e = graph[n_root].out_edges.end(); it != e; ++it) {
172 expected_cuts.insert(make_pair(n_root, it->first));
  /external/libxml2/
testapi.c 20435 int n_root; local
    [all...]

Completed in 222 milliseconds