| /third_party/boost/boost/graph/ |
| D | boykov_kolmogorov_max_flow.hpp | 290 vertex_descriptor other_node in grow() local
292 if (get_tree(other_node) == tColorTraits::gray()) in grow()
294 set_tree(other_node, in grow()
299 other_node, out_edge); // set us as parent in grow()
300 put(m_dist_map, other_node, in grow()
304 put(m_time_map, other_node, in grow()
306 add_active_node(other_node); in grow()
308 else if (get_tree(other_node) in grow()
314 current_node, other_node)) in grow()
316 set_edge_to_parent(other_node, out_edge); in grow()
[all …]
|
| /third_party/boost/boost/intrusive/ |
| D | circular_slist_algorithms.hpp | 252 static void swap_nodes(node_ptr this_node, node_ptr other_node) in swap_nodes() argument
254 if (other_node == this_node) in swap_nodes()
257 const node_ptr other_next = NodeTraits::get_next(other_node); in swap_nodes()
261 const bool other_empty = other_next == other_node; in swap_nodes()
264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes()
267 …Traits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_node ); in swap_nodes()
269 …_next(this_node, other_empty ? this_node : (other_next == this_node ? other_node : other_next) ); in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| D | circular_list_algorithms.hpp | 214 static void swap_nodes(node_ptr this_node, node_ptr other_node) in swap_nodes() argument
216 if (other_node == this_node) in swap_nodes()
219 bool other_inited = inited(other_node); in swap_nodes()
224 init_header(other_node); in swap_nodes()
229 node_ptr next_other(NodeTraits::get_next(other_node)); in swap_nodes()
230 node_ptr prev_other(NodeTraits::get_previous(other_node)); in swap_nodes()
234 swap_next(this_node, other_node); in swap_nodes()
235 swap_prev(this_node, other_node); in swap_nodes()
238 init(other_node); in swap_nodes()
438 BOOST_INTRUSIVE_FORCEINLINE static void swap_prev(node_ptr this_node, node_ptr other_node) in swap_prev() argument
[all …]
|
| D | linear_slist_algorithms.hpp | 187 static void swap_trailing_nodes(node_ptr this_node, node_ptr other_node) in swap_trailing_nodes() argument
190 node_ptr other_nxt = NodeTraits::get_next(other_node); in swap_trailing_nodes()
192 NodeTraits::set_next(other_node, this_nxt); in swap_trailing_nodes()
|
| D | slist.hpp | 2111 static void priv_swap_lists(node_ptr this_node, node_ptr other_node, detail::bool_<false>) in priv_swap_lists() argument
2112 { node_algorithms::swap_nodes(this_node, other_node); } in priv_swap_lists()
2115 static void priv_swap_lists(node_ptr this_node, node_ptr other_node, detail::bool_<true>) in priv_swap_lists() argument
2116 { node_algorithms::swap_trailing_nodes(this_node, other_node); } in priv_swap_lists()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/model/ |
| D | node.cc | 68 void Node::ReplaceWith(const NodePtr &other_node) { in ReplaceWith() argument
74 user.first->SetInput(idx, other_node); in ReplaceWith()
|
| D | node.h | 88 void ReplaceWith(const NodePtr &other_node);
|
| /third_party/boost/libs/graph/test/ |
| D | boykov_kolmogorov_max_flow_test.cpp | 282 const tVertex& other_node = target(*ei, tSuper::m_g); in invariant_four() local
283 if (this->get_tree(other_node) != this->get_tree(v)) in invariant_four()
|
| /third_party/mesa3d/src/compiler/spirv/ |
| D | vtn_cfg.c | 988 vtn_foreach_cf_node(other_node, &swtch->cases) { in vtn_switch_case_condition()
989 struct vtn_case *other = vtn_cf_node_as_case(other_node); in vtn_switch_case_condition()
|
| /third_party/gettext/build-aux/ |
| D | texi2html | 8996 foreach my $other_node (@{$other_node_array})
8998 $node_seen = $other_node;
8999 last if ($nodes{$other_node}->{'seen'})
|