Searched refs:is_candidate (Results 1 – 4 of 4) sorted by relevance
92 bool* is_candidate) { in IsNodeOutputPortHostFriendly() argument93 *is_candidate = false; in IsNodeOutputPortHostFriendly()129 *is_candidate = true; in IsNodeOutputPortHostFriendly()135 *is_candidate = true; in IsNodeOutputPortHostFriendly()168 *is_candidate = true; in IsNodeOutputPortHostFriendly()219 const NodeDef& node, bool* is_candidate) { in IsNodeHostCandidate() argument220 *is_candidate = false; in IsNodeHostCandidate()224 *is_candidate = true; in IsNodeHostCandidate()262 *is_candidate = true; in IsNodeHostCandidate()335 bool is_candidate = false; in Optimize() local[all …]
73 const std::function<bool(const NodeDef&)>& is_candidate, in FindCandidateRecomputeNodes() argument77 if (!is_candidate(node)) { in FindCandidateRecomputeNodes()111 const std::function<bool(const NodeDef&)>& is_candidate, in connected_subgraph() argument130 is_candidate(*input_node)) { in connected_subgraph()137 if (expanded_nodes->count(output) == 0 && is_candidate(*output)) { in connected_subgraph()
324 auto is_candidate = [this](const BeamProbability& prob) { in Step()330 if (!is_candidate(b->oldp)) { in Step()359 if (is_candidate(c.newp)) { in Step()
327 auto is_candidate = [this](const BeamProbability& prob) { in Step()333 if (!is_candidate(b->oldp)) { in Step()362 if (is_candidate(c.newp)) { in Step()