Lines Matching refs:components
200 // Computes the maximum topological numbers of (1) target node components
202 // components for each recomputed node. We will not attach any control
208 const std::unordered_map<const NodeDef*, int>& components) {
216 int current_target_component = components.find(output)->second;
229 // components and its own targets.
234 [&components](const NodeDef* first, const NodeDef* second) {
235 return components.find(first)->second <
236 components.find(second)->second;
268 // graph (using the component numberings in `components` and
276 const std::unordered_map<const NodeDef*, int>& components,
280 // Sort recomputed nodes based on max downstream components.
310 components.find(target_node)->second ==
311 components.find(target_input)->second) {
318 [&components](const NodeDef* first, const NodeDef* second) {
319 return components.find(first)->second >
320 components.find(second)->second;
340 components.find(*target_input_iterator)->second >
370 const std::unordered_map<const NodeDef*, int>& components,
377 node_map, components);
384 node_map, components,
