Home
last modified time | relevance | path

Searched refs:next_op (Results 1 – 7 of 7) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/
Dedge_costmodel.h41 …const std::shared_ptr<OperatorInfo> &next_op, const size_t &output_index_, const size_t &input_ind… in Edge() argument
45 next_op_(next_op), in Edge()
53 …const std::shared_ptr<OperatorInfo> &next_op, const size_t &output_index_, const size_t &input_ind… in Edge() argument
57 next_op_(next_op), in Edge()
64 const std::shared_ptr<OperatorInfo> &next_op, const std::vector<size_t> &output_indexs_, in Edge() argument
68 next_op_(next_op), in Edge()
Dgraph_costmodel.cc129 const auto &next_op = edge->next_operator(); in BFS() local
130 if (visited->at(next_op)) { in BFS()
131 …const auto cost = edge->GetCostByStrategyPair({curr_op->selected_strategy(), next_op->selected_str… in BFS()
132 CheckShardingConsisitency(configured_ops, curr_op, next_op, cost, edge); in BFS()
135 if ((curr_depth > 0) && (configured_ops.find(next_op) != configured_ops.end())) { in BFS()
136 const auto &next_op_conf_stra = configured_ops[next_op]; in BFS()
140 … << "Currently reaching " << curr_op->name() << " and " << next_op->name() << "." in BFS()
142 << " and " << next_op->cnode()->fullname_with_scope(); in BFS()
145 if (configured_ops.find(next_op) != configured_ops.end()) { in BFS()
151 … MS_LOG(EXCEPTION) << next_op->name() << "'s strategy is null in the edge: " << edge->edge_name(); in BFS()
[all …]
/third_party/boost/boost/geometry/algorithms/detail/overlay/
Denrich_intersection_points.hpp149 op_type const& next_op = next_turn.operations[next->operation_index]; in enrich_assign() local
156 if (op.seg_id.segment_index == next_op.seg_id.segment_index in enrich_assign()
157 && op.fraction < next_op.fraction) in enrich_assign()
234 op_type const& next_op = next_turn.operations[operations[n].operation_index]; in enrich_adapt() local
236 if (op.seg_id.segment_index == next_op.seg_id.segment_index) in enrich_adapt()
Dtraversal.hpp308 turn_operation_type const& next_op = next_turn.operations[i]; in get_shortcut_level() local
309 if (next_op.operation == target_operation in get_shortcut_level()
310 && ! next_op.visited.finished() in get_shortcut_level()
311 && ! next_op.visited.visited()) in get_shortcut_level()
314 if (get_shortcut_level(next_op, start_turn_index, in get_shortcut_level()
362 turn_operation_type const& next_op = m_turns[next[i]].operations[i]; in select_cc_operation() local
363 is_target[i] = next_op.operation == target_operation; in select_cc_operation()
/third_party/boost/libs/spirit/example/qi/compiler_tutorial/conjure2/
Dcompiler.cpp399 token_ids::type next_op = rbegin->operator_; in compile_expression() local
400 compile_expression(precedence_of(next_op), rbegin, rend); in compile_expression()
/third_party/boost/libs/spirit/example/qi/compiler_tutorial/conjure1/
Dcompiler.cpp405 ast::optoken next_op = rbegin->operator_; in compile_expression() local
406 compile_expression(precedence[next_op], rbegin, rend); in compile_expression()
/third_party/boost/libs/spirit/example/qi/compiler_tutorial/conjure3/
Dcompiler.cpp761 token_ids::type next_op = rest_begin->operator_; in compile_expression() local
763 precedence_of(next_op), rhs, rest_begin, rest_end); in compile_expression()