/dports/databases/postgis31/postgis-3.1.4/liblwgeom/ |
H A D | lwtin.c | 98 tin_arcs arcs; in lwtin_is_closed() local 131 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwtin_is_closed() 132 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwtin_is_closed() 133 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwtin_is_closed() 136 arcs[k].cnt++; in lwtin_is_closed() 143 lwfree(arcs); in lwtin_is_closed() 151 arcs[carc].cnt=1; in lwtin_is_closed() 152 arcs[carc].face=i; in lwtin_is_closed() 165 lwfree(arcs); in lwtin_is_closed() 178 lwfree(arcs); in lwtin_is_closed() [all …]
|
H A D | lwpsurface.c | 104 psurface_arcs arcs; in lwpsurface_is_closed() local 147 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwpsurface_is_closed() 148 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwpsurface_is_closed() 149 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwpsurface_is_closed() 152 arcs[k].cnt++; in lwpsurface_is_closed() 159 lwfree(arcs); in lwpsurface_is_closed() 167 arcs[carc].cnt=1; in lwpsurface_is_closed() 168 arcs[carc].face=i; in lwpsurface_is_closed() 181 lwfree(arcs); in lwpsurface_is_closed() 194 lwfree(arcs); in lwpsurface_is_closed() [all …]
|
/dports/databases/postgis25/postgis-2.5.5/liblwgeom/ |
H A D | lwtin.c | 98 tin_arcs arcs; in lwtin_is_closed() local 131 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwtin_is_closed() 132 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwtin_is_closed() 133 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwtin_is_closed() 136 arcs[k].cnt++; in lwtin_is_closed() 143 lwfree(arcs); in lwtin_is_closed() 151 arcs[carc].cnt=1; in lwtin_is_closed() 152 arcs[carc].face=i; in lwtin_is_closed() 165 lwfree(arcs); in lwtin_is_closed() 178 lwfree(arcs); in lwtin_is_closed() [all …]
|
H A D | lwpsurface.c | 104 psurface_arcs arcs; in lwpsurface_is_closed() local 147 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwpsurface_is_closed() 148 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwpsurface_is_closed() 149 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwpsurface_is_closed() 152 arcs[k].cnt++; in lwpsurface_is_closed() 159 lwfree(arcs); in lwpsurface_is_closed() 167 arcs[carc].cnt=1; in lwpsurface_is_closed() 168 arcs[carc].face=i; in lwpsurface_is_closed() 181 lwfree(arcs); in lwpsurface_is_closed() 194 lwfree(arcs); in lwpsurface_is_closed() [all …]
|
/dports/devel/librttopo/librttopo-1.1.0/src/ |
H A D | rttin.c | 100 tin_arcs arcs; in rttin_is_closed() local 133 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in rttin_is_closed() 134 arcs[k].az == pa.z && arcs[k].bx == pb.x && in rttin_is_closed() 135 arcs[k].by == pb.y && arcs[k].bz == pb.z && in rttin_is_closed() 138 arcs[k].cnt++; in rttin_is_closed() 153 arcs[carc].cnt=1; in rttin_is_closed() 154 arcs[carc].face=i; in rttin_is_closed() 167 rtfree(ctx, arcs); in rttin_is_closed() 178 if (arcs[k].cnt != 2) in rttin_is_closed() 180 rtfree(ctx, arcs); in rttin_is_closed() [all …]
|
H A D | rtpsurface.c | 106 psurface_arcs arcs; in rtpsurface_is_closed() local 149 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in rtpsurface_is_closed() 150 arcs[k].az == pa.z && arcs[k].bx == pb.x && in rtpsurface_is_closed() 151 arcs[k].by == pb.y && arcs[k].bz == pb.z && in rtpsurface_is_closed() 154 arcs[k].cnt++; in rtpsurface_is_closed() 169 arcs[carc].cnt=1; in rtpsurface_is_closed() 170 arcs[carc].face=i; in rtpsurface_is_closed() 183 rtfree(ctx, arcs); in rtpsurface_is_closed() 194 if (arcs[k].cnt != 2) in rtpsurface_is_closed() 196 rtfree(ctx, arcs); in rtpsurface_is_closed() [all …]
|
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/ |
H A D | lwpsurface.c | 104 psurface_arcs arcs; in lwpsurface_is_closed() local 147 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwpsurface_is_closed() 148 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwpsurface_is_closed() 149 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwpsurface_is_closed() 152 arcs[k].cnt++; in lwpsurface_is_closed() 159 lwfree(arcs); in lwpsurface_is_closed() 167 arcs[carc].cnt=1; in lwpsurface_is_closed() 168 arcs[carc].face=i; in lwpsurface_is_closed() 181 lwfree(arcs); in lwpsurface_is_closed() 194 lwfree(arcs); in lwpsurface_is_closed() [all …]
|
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/ |
H A D | lwpsurface.c | 104 psurface_arcs arcs; in lwpsurface_is_closed() local 147 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwpsurface_is_closed() 148 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwpsurface_is_closed() 149 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwpsurface_is_closed() 152 arcs[k].cnt++; in lwpsurface_is_closed() 159 lwfree(arcs); in lwpsurface_is_closed() 167 arcs[carc].cnt=1; in lwpsurface_is_closed() 168 arcs[carc].face=i; in lwpsurface_is_closed() 181 lwfree(arcs); in lwpsurface_is_closed() 194 lwfree(arcs); in lwpsurface_is_closed() [all …]
|
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/netflow/ |
H A D | DomainStructure.java | 65 public final Arc[] arcs; field in DomainStructure 99 this.arcs = arcs; in DomainStructure() 106 if (!arcs[id].forward) in DomainStructure() 111 arcs[id].companion = companion = new ArcCompanion(arcs[id], 0); in DomainStructure() 165 Arc arc = arcs[arcID]; in groundArc() 207 network.remove(arcs[arcID]); in groundArc() 221 Arc temp2 = arcs[i]; in swap() 222 arcs[i] = arcs[j]; in swap() 223 arcs[j] = temp2; in swap() 225 arcs[j].companion.arcID = j; in swap() [all …]
|
/dports/math/gravity/Gravity-da941e9/solvers/AlpineX/ |
H A D | AlpineX.cpp | 100 auto arcs = indices(grid.arcs); in main() local 166 SOCP->add(Pf_from.in(arcs), Qf_from.in(arcs), Pf_to.in(arcs), Qf_to.in(arcs)); in main() 203 T.real_imag(cc.in(arcs), dd.in(arcs)); in main() 204 Y.real_imag(g.in(arcs), b.in(arcs)); in main() 209 Wij.real_imag(R_Wij.in_pairs(arcs), Im_Wij.in_pairs(arcs)); in main() 232 I_to_Pf=lji.in(arcs)*Wii.to(arcs)-(pow(Pf_to.in(arcs),2) + pow(Qf_to.in(arcs), 2)); in main() 289 …Flow_P_From = Pf_from - (g_ff*Wii.from(arcs) + g_ft*R_Wij.in_pairs(arcs) + b_ft*Im_Wij.in_pairs(ar… in main() 293 … Flow_P_To = Pf_to - (g_tt*Wii.to(arcs) + g_tf*R_Wij.in_pairs(arcs) - b_tf*Im_Wij.in_pairs(arcs)); in main() 297 …Flow_Q_From = Qf_from - (g_ft*Im_Wij.in_pairs(arcs) - b_ff*Wii.from(arcs) - b_ft*R_Wij.in_pairs(ar… in main() 301 Flow_Q_To = Qf_to + b_tt*Wii.to(arcs) + b_tf*R_Wij.in_pairs(arcs) + g_tf*Im_Wij.in_pairs(arcs); in main() [all …]
|
/dports/biology/biosig/biosig-2.3.3/biosig4c++/t240/ |
H A D | OBJECT_IDENTIFIER.c | 275 long *arcs = s_arcs; in OBJECT_IDENTIFIER__xer_body_decode() local 307 ret = OBJECT_IDENTIFIER_set_arcs(st, arcs, sizeof(*arcs), arcs_count); in OBJECT_IDENTIFIER__xer_body_decode() 308 if(arcs != s_arcs) FREEMEM(arcs); in OBJECT_IDENTIFIER__xer_body_decode() 401 arcs = ((char *)arcs) + arc_type_size; in OBJECT_IDENTIFIER_get_arcs() 405 if(arcs < arcs_end) { in OBJECT_IDENTIFIER_get_arcs() 408 arcs, arc_type_size)) in OBJECT_IDENTIFIER_get_arcs() 411 arcs = ((char *)arcs) + arc_type_size; in OBJECT_IDENTIFIER_get_arcs() 597 arcs = ((const char *)arcs) + arc_type_size; in OBJECT_IDENTIFIER_set_arcs() 626 for(arcs = ((const char *)arcs) + arc_type_size, i = 2; in OBJECT_IDENTIFIER_set_arcs() 628 i++, arcs = ((const char *)arcs) + arc_type_size) { in OBJECT_IDENTIFIER_set_arcs() [all …]
|
/dports/math/py-or-tools/or-tools-9.2/ortools/graph/ |
H A D | topologicalsorter.h | 81 int num_nodes, const std::vector<std::pair<int, int>>& arcs, 86 int num_nodes, const std::vector<std::pair<int, int>>& arcs, 96 int num_nodes, const std::vector<std::pair<int, int>>& arcs); 126 Sorter* sorter, const std::vector<std::pair<T, T>>& arcs, 388 Sorter* sorter, const std::vector<std::pair<T, T>>& arcs, in RunTopologicalSorter() argument 391 for (const auto& arc : arcs) { in RunTopologicalSorter() 409 &sorter, arcs, topological_order, nullptr); in DenseIntTopologicalSortImpl() 438 return RunTopologicalSorterOrDie(&sorter, arcs); in DenseIntTopologicalSortOrDieImpl() 448 return RunTopologicalSorterOrDie(&sorter, arcs); in TopologicalSortOrDieImpl() 471 return internal::TopologicalSortImpl<T, false>(nodes, arcs, in TopologicalSort() [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/mul/mmn/tests/ |
H A D | test_make_tri_tree.cxx | 15 std::vector<mmn_arc> arcs; in test_make_tri_tree_a() local 22 mmn_make_tri_tree(D,arcs); in test_make_tri_tree_a() 23 TEST("N.arcs",arcs.size(),3); in test_make_tri_tree_a() 25 std::cout<<arcs<<std::endl; in test_make_tri_tree_a() 30 mmn_make_tri_tree(D,arcs); in test_make_tri_tree_a() 33 std::cout<<arcs<<std::endl; in test_make_tri_tree_a() 38 mmn_make_tri_tree(D,arcs); in test_make_tri_tree_a() 41 std::cout<<arcs<<std::endl; in test_make_tri_tree_a() 52 std::vector<mmn_arc> arcs; in test_make_tri_tree_b() local 54 mmn_make_tri_tree(D,arcs); in test_make_tri_tree_b() [all …]
|
H A D | test_parse_arcs.cxx | 51 std::vector<mmn_arc> arcs; in test_parse_arcs_a() local 52 mmn_parse_arcs(ss,nodeNames,arcs); in test_parse_arcs_a() 54 TEST("Test arc numbers",arcs.size()==15,true); in test_parse_arcs_a() 55 TEST("Test first arc ",arcs[0].v1==0 && arcs[0].v2==1,true ); in test_parse_arcs_a() 56 TEST("Test second arc ",arcs[1].v1==0 && arcs[1].v2==2,true ); in test_parse_arcs_a() 57 TEST("Test last arc ",arcs.back().v1==9 && arcs.back().v2==5,true ); in test_parse_arcs_a() 60 std::copy(arcs.begin(),arcs.end(), in test_parse_arcs_a()
|
/dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/ |
H A D | spherical_insert.cpp | 25 std::list<X_monotone_curve_2> arcs; in main() local 27 arcs.push_back(X_monotone_curve_2(Point_2(1, 0, 0), Point_2(0, 1, 0))); in main() 28 arcs.push_back(X_monotone_curve_2(Point_2(0, 1, 0), Point_2(0, 0, 1))); in main() 29 arcs.push_back(X_monotone_curve_2(Point_2(0, 0, 1), Point_2(1, 0, 0))); in main() 31 arcs.push_back(X_monotone_curve_2(Point_2(0, -1, 0), Point_2(0, 0, 1))); in main() 32 arcs.push_back(X_monotone_curve_2(Point_2(0, -1, 0), Point_2(1, 0, 0))); in main() 33 arcs.push_back(X_monotone_curve_2(Point_2(0, 1, 0), Point_2(-1, 0, 0))); in main() 35 arcs.push_back(X_monotone_curve_2(Point_2(0, 0, -1), Point_2(1, 0, 0))); in main() 36 arcs.push_back(X_monotone_curve_2(Point_2(0, 1, 0), Point_2(0, 0, -1))); in main() 41 CGAL::insert(arr, arcs.begin(), arcs.end()); in main() [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/mul/fhs/tests/ |
H A D | test_searcher.cxx | 17 std::vector<fhs_arc> arcs(1); in test_searcher1() local 19 arcs[0]=fhs_arc(0,1, dx,dy, 2, 2); in test_searcher1() 31 searcher.set_tree(arcs,0); in test_searcher1() 48 searcher.set_tree(arcs,0); in test_searcher1() 58 searcher.set_tree(arcs,0); in test_searcher1() 69 searcher.set_tree(arcs,0); in test_searcher1() 84 std::vector<fhs_arc> arcs(4); in test_searcher2() local 103 searcher.set_tree(arcs,0); in test_searcher2() 127 searcher.set_tree(arcs,0); in test_searcher2() 168 searcher.set_tree(arcs,0); in test_searcher3() [all …]
|
/dports/lang/asn1c/asn1c-0.9.27/skeletons/tests/ |
H A D | check-OIDs.c | 19 unsigned long arcs[10]; in check_OID() local 42 memset(arcs, 'A', sizeof(arcs)); in check_OID() 44 arcs, sizeof(arcs[0]), sizeof(arcs)/sizeof(arcs[0])); in check_OID() 66 unsigned long arcs[10]; in check_ROID() local 89 memset(arcs, 'A', sizeof(arcs)); in check_ROID() 91 arcs, sizeof(arcs[0]), sizeof(arcs)/sizeof(arcs[0])); in check_ROID() 126 ret = RELATIVE_OID_set_arcs(&oid, arcs, sizeof(arcs[0]), acount); in check_REGEN() 168 ret = OBJECT_IDENTIFIER_set_arcs(&oid, arcs, sizeof(arcs[0]), acount); in check_REGEN_OID() 244 long arcs[10]; in check_xer() local 260 ret = RELATIVE_OID_get_arcs(st, arcs, sizeof(arcs[0]), in check_xer() [all …]
|
/dports/lang/asn1c/asn1c-0.9.27/skeletons/ |
H A D | OBJECT_IDENTIFIER.c | 276 long *arcs = s_arcs; in OBJECT_IDENTIFIER__xer_body_decode() local 306 ret = OBJECT_IDENTIFIER_set_arcs(st, arcs, sizeof(*arcs), arcs_count); in OBJECT_IDENTIFIER__xer_body_decode() 307 if(arcs != s_arcs) FREEMEM(arcs); in OBJECT_IDENTIFIER__xer_body_decode() 400 arcs = ((char *)arcs) + arc_type_size; in OBJECT_IDENTIFIER_get_arcs() 404 if(arcs < arcs_end) { in OBJECT_IDENTIFIER_get_arcs() 407 arcs, arc_type_size)) in OBJECT_IDENTIFIER_get_arcs() 410 arcs = ((char *)arcs) + arc_type_size; in OBJECT_IDENTIFIER_get_arcs() 596 arcs = ((const char *)arcs) + arc_type_size; in OBJECT_IDENTIFIER_set_arcs() 625 for(arcs = ((const char *)arcs) + arc_type_size, i = 2; in OBJECT_IDENTIFIER_set_arcs() 627 i++, arcs = ((const char *)arcs) + arc_type_size) { in OBJECT_IDENTIFIER_set_arcs() [all …]
|
H A D | RELATIVE-OID.c | 99 long *arcs = s_arcs; in RELATIVE_OID__xer_body_decode() local 107 arcs, sizeof(s_arcs)/sizeof(s_arcs[0]), &endptr); in RELATIVE_OID__xer_body_decode() 118 if(!arcs) return XPBD_SYSTEM_FAILURE; in RELATIVE_OID__xer_body_decode() 121 arcs, arcs_count, &endptr); in RELATIVE_OID__xer_body_decode() 129 ret = RELATIVE_OID_set_arcs(st, arcs, sizeof(*arcs), arcs_count); in RELATIVE_OID__xer_body_decode() 130 if(arcs != s_arcs) FREEMEM(arcs); in RELATIVE_OID__xer_body_decode() 182 if(arcs < arcs_end) { in RELATIVE_OID_get_arcs() 186 arcs, arc_type_size)) in RELATIVE_OID_get_arcs() 188 arcs = ((char *)arcs) + arc_type_size; in RELATIVE_OID_get_arcs() 223 for(i = 0; i < arcs_slots; i++, arcs = ((char *)arcs) + arc_type_size) { in RELATIVE_OID_set_arcs() [all …]
|
/dports/games/xscrabble/xscrabble-2.12/src/ |
H A D | CircPerc.c | 162 XArc *arcs; 172 arcs[0].width = our_widget -> core.width - arcs[0].x * 2; 173 arcs[0].height = our_widget -> core.height - arcs[0].x * 2; 181 (int) arcs[0].x,(int)arcs[0].y, 182 (int)arcs[0].width,(int)arcs[0].height, 183 (int)arcs[0].angle1,(int)arcs[0].angle2); 188 arcs[1].width = our_widget -> core.width - arcs[1].x * 2; 197 (int) arcs[1].x,(int)arcs[1].y, 198 (int)arcs[1].width,(int)arcs[1].height, 199 (int)arcs[1].angle1,(int)arcs[1].angle2); [all …]
|
/dports/devel/tcllibc/tcllib-1.20/modules/struct/graph/tests/ |
H A D | XOpsSupport | 30 proc EulerTour {g arcs} { 31 Euler 1 $g $arcs 35 Euler 0 $g $arcs 39 if {[llength [lsort -unique $arcs]] < [llength $arcs]} { 40 #puts [lsort $arcs] 41 return dup-arcs 42 } elseif {![struct::set equal $arcs [$g arcs]]} { 43 #puts [lsort $arcs] 44 #puts [lsort [$g arcs] 45 return missing-arcs [all …]
|
/dports/devel/tcllib/tcllib-1.20/modules/struct/graph/tests/ |
H A D | XOpsSupport | 30 proc EulerTour {g arcs} { 31 Euler 1 $g $arcs 35 Euler 0 $g $arcs 39 if {[llength [lsort -unique $arcs]] < [llength $arcs]} { 40 #puts [lsort $arcs] 41 return dup-arcs 42 } elseif {![struct::set equal $arcs [$g arcs]]} { 43 #puts [lsort $arcs] 44 #puts [lsort [$g arcs] 45 return missing-arcs [all …]
|
/dports/devel/sgb/sgb-20090810_1/ |
H A D | sample.correct | 4 12 vertices, 96 arcs, util_types ZZZIIIIZZZZZZZ 16 2048 vertices, 14336 arcs, util_types ZZZIIIZZZZZZZZ 26 3 vertices, 2 arcs, util_types ZZZIIIZZZZZZZZ 31 3 vertices, 30 arcs, util_types ZZZZZZZZZZZZZZ 45 100 vertices, 4 arcs, util_types IZZIISIZZZZZZZ 50 40 vertices, 512 arcs, util_types ZZZZIAIZZZZZZZ 60 60 vertices, 114 arcs, util_types IIZSSSIIZZZZZZ 66 50 vertices, 164 arcs, util_types ZZIIIIZZZZZZZZ 80 51 vertices, 96 arcs, util_types ZZIIIIZZZZZZZZ 93 1000 vertices, 3573 arcs, util_types IZZZZZZZZZZZZZ [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/mul/mmn/ |
H A D | mmn_make_tri_tree.cxx | 18 unsigned v1=arcs[a].v1; in update_best_arcs() 19 unsigned v2=arcs[a].v2; in update_best_arcs() 63 arcs.resize(0); in mmn_make_tri_tree() 94 arcs.push_back(arc); in mmn_make_tri_tree() 117 arc = arcs[best_arc[best_i]]; in mmn_make_tri_tree() 120 arcs.emplace_back(best_i,arc.v1); in mmn_make_tri_tree() 124 update_best_arcs(D,node_free,arcs,arcs.size()-2,best_arc,best_d); in mmn_make_tri_tree() 125 update_best_arcs(D,node_free,arcs,arcs.size()-1,best_arc,best_d); in mmn_make_tri_tree() 160 arcs.resize(0); in mmn_make_tri_tree() 194 arcs.push_back(arc); in mmn_make_tri_tree() [all …]
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/qa/pns/ |
H A D | playground.cpp | 157 std::vector<SHAPE_ARC> arcs; in playground_main_func() local 170 arcs.push_back( arc ); in playground_main_func() 187 bool collides = collideArc2Arc( arcs[i], arcs[i+1], 0, closestDist ); in playground_main_func() 188 int ni = arcs[i].Intersect( arcs[i+1], &ips ); in playground_main_func() 208 overlay->AnnotatedPoint( arcs[i].GetP0(), arcs[i].GetWidth() / 2 ); in playground_main_func() 209 overlay->AnnotatedPoint( arcs[i + 1].GetP0(), arcs[i + 1].GetWidth() / 2 ); in playground_main_func() 210 overlay->AnnotatedPoint( arcs[i].GetArcMid(), arcs[i].GetWidth() / 2 ); in playground_main_func() 211 overlay->AnnotatedPoint( arcs[i + 1].GetArcMid(), arcs[i + 1].GetWidth() / 2 ); in playground_main_func() 212 overlay->AnnotatedPoint( arcs[i].GetP1(), arcs[i].GetWidth() / 2 ); in playground_main_func() 213 overlay->AnnotatedPoint( arcs[i + 1].GetP1(), arcs[i + 1].GetWidth() / 2 ); in playground_main_func() [all …]
|