| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bgrl/ |
| H A D | bgrl_vertex.cxx | 23 for (const auto & out_edge : vertex.out_edges_){ in bgrl_vertex() local
24 bgrl_edge_sptr edge_copy(out_edge->clone()); in bgrl_vertex()
36 for (const auto & out_edge : out_edges_) in strip() local
38 if (out_edge->to_) { in strip()
39 out_edge->to_->in_edges_.erase(out_edge); in strip()
40 out_edge->to_ = nullptr; in strip()
42 out_edge->from_ = nullptr; in strip()
106 for (const auto & out_edge : out_edges_) in add_edge_to() local
107 if (out_edge->to_ == vertex) in add_edge_to()
213 for (const auto & out_edge : out_edges_) in b_read() local
[all …]
|
| /dports/devel/ode/ode-0.13/GIMPACT/src/ |
| H A D | gim_trimesh_capsule_collision.cpp | 45 GUINT32 intersection_type, out_edge= 10; in gim_closest_point_triangle_segment() local
72 POINT_IN_HULL(closest_points[0],(&triangle->m_planes.m_planes[1]),3,out_edge); in gim_closest_point_triangle_segment()
74 if(out_edge==0)//Point over face in gim_closest_point_triangle_segment()
87 if(out_edge==0)//Point over face in gim_closest_point_triangle_segment()
103 out_edge = 0; in gim_closest_point_triangle_segment()
112 out_edge = 1; in gim_closest_point_triangle_segment()
121 out_edge = 2; in gim_closest_point_triangle_segment()
126 if(out_edge>2) // Over triangle in gim_closest_point_triangle_segment()
136 out_edge = 10; in gim_closest_point_triangle_segment()
147 out_edge = i; in gim_closest_point_triangle_segment()
[all …]
|
| /dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/cranelift/codegen/src/machinst/ |
| H A D | blockorder.rs | 175 pub fn out_edge(self) -> Option<(Block, Inst, Block)> { in out_edge() method
503 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_diamond()
517 assert!(order.lowered_order[3].out_edge().is_none()); in test_blockorder_diamond()
526 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_diamond()
564 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_critedge()
570 assert!(order.lowered_order[1].out_edge().is_none()); in test_blockorder_critedge()
576 assert!(order.lowered_order[2].out_edge().is_none()); in test_blockorder_critedge()
594 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_critedge()
605 assert!(order.lowered_order[7].out_edge().is_none()); in test_blockorder_critedge()
611 assert!(order.lowered_order[8].out_edge().is_none()); in test_blockorder_critedge()
[all …]
|
| /dports/www/firefox/firefox-99.0/third_party/rust/cranelift-codegen/src/machinst/ |
| H A D | blockorder.rs | 175 pub fn out_edge(self) -> Option<(Block, Inst, Block)> { in out_edge() method
503 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_diamond()
517 assert!(order.lowered_order[3].out_edge().is_none()); in test_blockorder_diamond()
526 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_diamond()
564 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_critedge()
570 assert!(order.lowered_order[1].out_edge().is_none()); in test_blockorder_critedge()
576 assert!(order.lowered_order[2].out_edge().is_none()); in test_blockorder_critedge()
594 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_critedge()
605 assert!(order.lowered_order[7].out_edge().is_none()); in test_blockorder_critedge()
611 assert!(order.lowered_order[8].out_edge().is_none()); in test_blockorder_critedge()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/cranelift-codegen/src/machinst/ |
| H A D | blockorder.rs | 175 pub fn out_edge(self) -> Option<(Block, Inst, Block)> { in out_edge() method
503 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_diamond()
517 assert!(order.lowered_order[3].out_edge().is_none()); in test_blockorder_diamond()
526 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_diamond()
564 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_critedge()
570 assert!(order.lowered_order[1].out_edge().is_none()); in test_blockorder_critedge()
576 assert!(order.lowered_order[2].out_edge().is_none()); in test_blockorder_critedge()
594 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_critedge()
605 assert!(order.lowered_order[7].out_edge().is_none()); in test_blockorder_critedge()
611 assert!(order.lowered_order[8].out_edge().is_none()); in test_blockorder_critedge()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/cranelift-codegen/src/machinst/ |
| H A D | blockorder.rs | 174 pub fn out_edge(self) -> Option<(Block, Inst, Block)> { in out_edge() method
488 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_diamond()
502 assert!(order.lowered_order[3].out_edge().is_none()); in test_blockorder_diamond()
511 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_diamond()
549 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_critedge()
555 assert!(order.lowered_order[1].out_edge().is_none()); in test_blockorder_critedge()
561 assert!(order.lowered_order[2].out_edge().is_none()); in test_blockorder_critedge()
579 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_critedge()
590 assert!(order.lowered_order[7].out_edge().is_none()); in test_blockorder_critedge()
596 assert!(order.lowered_order[8].out_edge().is_none()); in test_blockorder_critedge()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/cranelift-codegen/src/machinst/ |
| H A D | blockorder.rs | 175 pub fn out_edge(self) -> Option<(Block, Inst, Block)> { in out_edge() method
503 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_diamond()
517 assert!(order.lowered_order[3].out_edge().is_none()); in test_blockorder_diamond()
526 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_diamond()
564 assert!(order.lowered_order[0].out_edge().is_none()); in test_blockorder_critedge()
570 assert!(order.lowered_order[1].out_edge().is_none()); in test_blockorder_critedge()
576 assert!(order.lowered_order[2].out_edge().is_none()); in test_blockorder_critedge()
594 assert!(order.lowered_order[5].out_edge().is_none()); in test_blockorder_critedge()
605 assert!(order.lowered_order[7].out_edge().is_none()); in test_blockorder_critedge()
611 assert!(order.lowered_order[8].out_edge().is_none()); in test_blockorder_critedge()
[all …]
|
| /dports/games/abstreet/fast_paths-192ae1997f9857791826ac5ed16892b2f692920c/src/ |
| H A D | fast_graph_builder.rs | 97 for out_edge in &preparation_graph.out_edges[node] { in run_contraction()
98 neighbors.insert(out_edge.adj_node); in run_contraction()
101 out_edge.adj_node, in run_contraction()
102 out_edge.weight, in run_contraction()
106 self.center_nodes_fwd.push(out_edge.center_node); in run_contraction()
156 for out_edge in &preparation_graph.out_edges[node] { in run_contraction_with_order()
159 out_edge.adj_node, in run_contraction_with_order()
160 out_edge.weight, in run_contraction_with_order()
164 self.center_nodes_fwd.push(out_edge.center_node); in run_contraction_with_order()
|
| H A D | preparation_graph.rs | 85 for out_edge in &mut self.out_edges[from] { in reduce_edge()
86 if out_edge.adj_node == to { in reduce_edge()
87 if out_edge.weight <= weight { in reduce_edge()
92 out_edge.weight = weight; in reduce_edge()
94 out_edge.center_node = center_node; in reduce_edge()
|
| /dports/math/vtk9/VTK-9.1.0/Infovis/Layout/ |
| H A D | vtkSimple3DCirclesStrategy.cxx | 564 vtkOutEdgeType out_edge; in BuildLayers() local
578 out_edge = edge_out_iterator->Next(); in BuildLayers()
579 if (layers->GetValue(out_edge.Target) == -1) in BuildLayers()
596 source->push_back(out_edge.Target); in BuildLayers()
597 layers->SetValue(out_edge.Target, layer + 1); in BuildLayers()
615 vtkOutEdgeType out_edge; in BuildPointOrder() local
635 out_edge = edge_out_iterator->Next(); in BuildPointOrder()
636 if (mark->GetValue(out_edge.Target) == 0) in BuildPointOrder()
638 if (layers->GetValue(out_edge.Target) == layer) in BuildPointOrder()
640 mark->SetValue(out_edge.Target, 1); in BuildPointOrder()
[all …]
|
| /dports/math/vtk8/VTK-8.2.0/Infovis/Layout/ |
| H A D | vtkSimple3DCirclesStrategy.cxx | 548 vtkOutEdgeType out_edge; in BuildLayers() local
562 out_edge = edge_out_iterator->Next(); in BuildLayers()
563 if ( layers->GetValue( out_edge.Target ) == -1 ) in BuildLayers()
580 source->push_back( out_edge.Target ); in BuildLayers()
581 layers->SetValue( out_edge.Target, layer + 1 ); in BuildLayers()
596 vtkOutEdgeType out_edge; in BuildPointOrder() local
616 out_edge = edge_out_iterator->Next(); in BuildPointOrder()
617 if ( mark->GetValue( out_edge.Target ) == 0 ) in BuildPointOrder()
619 if ( layers->GetValue( out_edge.Target ) == layer ) in BuildPointOrder()
621 mark->SetValue( out_edge.Target, 1 ); in BuildPointOrder()
[all …]
|
| /dports/math/vtk6/VTK-6.2.0/Infovis/Layout/ |
| H A D | vtkSimple3DCirclesStrategy.cxx | 552 vtkOutEdgeType out_edge; in BuildLayers() local
566 out_edge = edge_out_iterator->Next(); in BuildLayers()
567 if ( layers->GetValue( out_edge.Target ) == -1 ) in BuildLayers()
584 source->push_back( out_edge.Target ); in BuildLayers()
585 layers->SetValue( out_edge.Target, layer + 1 ); in BuildLayers()
600 vtkOutEdgeType out_edge; in BuildPointOrder() local
620 out_edge = edge_out_iterator->Next(); in BuildPointOrder()
621 if ( mark->GetValue( out_edge.Target ) == 0 ) in BuildPointOrder()
623 if ( layers->GetValue( out_edge.Target ) == layer ) in BuildPointOrder()
625 mark->SetValue( out_edge.Target, 1 ); in BuildPointOrder()
[all …]
|
| /dports/databases/pgrouting/pgrouting-3.2.0/sql/topology/ |
| H A D | extractVertices.sql | 156 SELECT id::BIGINT AS out_edge, ST_StartPoint(geom) AS geom
161 … SELECT array_agg(out_edge ORDER BY out_edge) AS out_edges, ST_x(geom) AS x, ST_Y(geom) AS y, geom
230 SELECT id::BIGINT AS out_edge, startpoint AS geom
235 … SELECT array_agg(out_edge ORDER BY out_edge) AS out_edges, ST_x(geom) AS x, ST_Y(geom) AS y, geom
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 254 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
256 vertex_descriptor other_node = target(out_edge, m_g); in grow()
267 set_edge_to_parent(other_node, out_edge); in grow()
275 return std::make_pair(out_edge, true); in grow()
466 const edge_descriptor out_edge = *ei; in adopt() local
467 if(m_res_cap_map[out_edge] > 0){ in adopt()
468 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
472 new_parent_edge = out_edge; in adopt()
483 const edge_descriptor out_edge = *ei; in adopt() local
484 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | loop-unroll.c | 427 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in peel_loop_completely()
595 if ((is_bct = is_bct_cond (BB_END (desc->out_edge->src))) in unroll_loop_constant_iterations()
634 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_constant_iterations()
660 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_constant_iterations()
674 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_constant_iterations()
869 if ((is_bct = is_bct_cond (BB_END (desc->out_edge->src))) in unroll_loop_runtime_iterations()
916 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_runtime_iterations()
932 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_runtime_iterations()
1329 bct_insn = BB_END (desc->out_edge->src); in discard_increment()
1359 if (body[i] != desc->out_edge->src) in discard_increment()
[all …]
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | loop-unroll.c | 427 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in peel_loop_completely()
595 if ((is_bct = is_bct_cond (BB_END (desc->out_edge->src))) in unroll_loop_constant_iterations()
634 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_constant_iterations()
660 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_constant_iterations()
674 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_constant_iterations()
869 if ((is_bct = is_bct_cond (BB_END (desc->out_edge->src))) in unroll_loop_runtime_iterations()
916 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_runtime_iterations()
932 wont_exit, desc->out_edge, remove_edges, &n_remove_edges, in unroll_loop_runtime_iterations()
1329 bct_insn = BB_END (desc->out_edge->src); in discard_increment()
1359 if (body[i] != desc->out_edge->src) in discard_increment()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 255 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
257 vertex_descriptor other_node = target(out_edge, m_g); in grow()
268 set_edge_to_parent(other_node, out_edge); in grow()
276 return std::make_pair(out_edge, true); in grow()
467 const edge_descriptor out_edge = *ei; in adopt() local
468 if(get(m_res_cap_map, out_edge) > 0){ in adopt()
469 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
473 new_parent_edge = out_edge; in adopt()
484 const edge_descriptor out_edge = *ei; in adopt() local
485 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 287 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
288 if (get(m_res_cap_map, out_edge) > 0) in grow()
291 = target(out_edge, m_g); in grow()
330 return std::make_pair(out_edge, true); in grow()
601 const edge_descriptor out_edge = *ei; in adopt() local
602 if (get(m_res_cap_map, out_edge) > 0) in adopt()
605 = target(out_edge, m_g); in adopt()
611 new_parent_edge = out_edge; in adopt()
629 const edge_descriptor out_edge = *ei; in adopt() local
631 = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/graphics/krita/krita-4.4.8/libs/image/lazybrush/ |
| H A D | patched_boykov_kolmogorov_max_flow.hpp | 255 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
257 vertex_descriptor other_node = target(out_edge, m_g); in grow()
268 set_edge_to_parent(other_node, out_edge); in grow()
276 return std::make_pair(out_edge, true); in grow()
475 const edge_descriptor out_edge = *ei; in adopt() local
476 if(get(m_res_cap_map, out_edge) > 0){ in adopt()
477 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
481 new_parent_edge = out_edge; in adopt()
492 const edge_descriptor out_edge = *ei; in adopt() local
493 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 255 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
257 vertex_descriptor other_node = target(out_edge, m_g); in grow()
268 set_edge_to_parent(other_node, out_edge); in grow()
276 return std::make_pair(out_edge, true); in grow()
467 const edge_descriptor out_edge = *ei; in adopt() local
468 if(get(m_res_cap_map, out_edge) > 0){ in adopt()
469 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
473 new_parent_edge = out_edge; in adopt()
484 const edge_descriptor out_edge = *ei; in adopt() local
485 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 287 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
288 if (get(m_res_cap_map, out_edge) > 0) in grow()
291 = target(out_edge, m_g); in grow()
330 return std::make_pair(out_edge, true); in grow()
601 const edge_descriptor out_edge = *ei; in adopt() local
602 if (get(m_res_cap_map, out_edge) > 0) in adopt()
605 = target(out_edge, m_g); in adopt()
611 new_parent_edge = out_edge; in adopt()
629 const edge_descriptor out_edge = *ei; in adopt() local
631 = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 287 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
288 if (get(m_res_cap_map, out_edge) > 0) in grow()
291 = target(out_edge, m_g); in grow()
330 return std::make_pair(out_edge, true); in grow()
601 const edge_descriptor out_edge = *ei; in adopt() local
602 if (get(m_res_cap_map, out_edge) > 0) in adopt()
605 = target(out_edge, m_g); in adopt()
611 new_parent_edge = out_edge; in adopt()
629 const edge_descriptor out_edge = *ei; in adopt() local
631 = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 255 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
257 vertex_descriptor other_node = target(out_edge, m_g); in grow()
268 set_edge_to_parent(other_node, out_edge); in grow()
276 return std::make_pair(out_edge, true); in grow()
467 const edge_descriptor out_edge = *ei; in adopt() local
468 if(get(m_res_cap_map, out_edge) > 0){ in adopt()
469 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
473 new_parent_edge = out_edge; in adopt()
484 const edge_descriptor out_edge = *ei; in adopt() local
485 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 255 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
257 vertex_descriptor other_node = target(out_edge, m_g); in grow()
268 set_edge_to_parent(other_node, out_edge); in grow()
276 return std::make_pair(out_edge, true); in grow()
467 const edge_descriptor out_edge = *ei; in adopt() local
468 if(get(m_res_cap_map, out_edge) > 0){ in adopt()
469 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
473 new_parent_edge = out_edge; in adopt()
484 const edge_descriptor out_edge = *ei; in adopt() local
485 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 255 edge_descriptor out_edge = *m_last_grow_edge_it; in grow() local
257 vertex_descriptor other_node = target(out_edge, m_g); in grow()
268 set_edge_to_parent(other_node, out_edge); in grow()
276 return std::make_pair(out_edge, true); in grow()
467 const edge_descriptor out_edge = *ei; in adopt() local
468 if(get(m_res_cap_map, out_edge) > 0){ in adopt()
469 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
473 new_parent_edge = out_edge; in adopt()
484 const edge_descriptor out_edge = *ei; in adopt() local
485 const vertex_descriptor other_node = target(out_edge, m_g); in adopt()
[all …]
|