Home
last modified time | relevance | path

Searched refs:output_edges (Results 1 – 3 of 3) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/vm/
Dgraph_partition.cc320 std::string ParallelSortDecideNextHandleTarget(const std::vector<AnfNodePtr> &output_edges, in ParallelSortDecideNextHandleTarget() argument
325 for (auto &dst_node : output_edges) { in ParallelSortDecideNextHandleTarget()
337 for (auto &dst_node : output_edges) { in ParallelSortDecideNextHandleTarget()
343 void ParallelSortVisitNodeEdges(const std::vector<AnfNodePtr> &output_edges, GraphNodesDependencyIn… in ParallelSortVisitNodeEdges() argument
347 for (auto &dst_node : output_edges) { in ParallelSortVisitNodeEdges()
404 auto &output_edges = output_edges_iter->second; in ParallelSort() local
405 …handle_target = ParallelSortDecideNextHandleTarget(output_edges, handle_target, &node_input_target… in ParallelSort()
406 ParallelSortVisitNodeEdges(output_edges, &dependency_info, &visit_nodes_info, default_target); in ParallelSort()
/third_party/boost/boost/polygon/detail/
Dpolygon_45_touch.hpp117 std::set<int>& output_edges = (*(output.second))[*inner_itr]; in process_previous_x() local
121 output_edges.insert(output_edges.end(), *inner_inner_itr); in process_previous_x()
Dscan_arbitrary.hpp2770 std::set<property_type>& output_edges = (*(output.second))[*inner_itr]; in process_previous_x() local
2774 output_edges.insert(output_edges.end(), *inner_inner_itr); in process_previous_x()