| 1 |
|
| #ifndef clipper_poly2av_h_ |
| 2 |
|
| #define clipper_poly2av_h_ |
| 3 |
|
| |
| 4 |
|
| #include "myinit.h" |
| 5 |
|
| |
| 6 |
|
| SV* |
| 7 |
43 |
| polygon2perl(pTHX_ const ClipperLib::Polygon& poly) |
| 8 |
|
| { |
| 9 |
43 |
| AV* av = newAV(); |
| 10 |
|
| AV* innerav; |
| 11 |
43 |
| const unsigned int len = poly.size(); |
| 12 |
43 |
▶ | av_extend(av, len == 0 ? 0 : len-1); |
Branch: 1 branch
| Branch | True | False | Total |
| av_extend(av, len == 0 ? 0 : len-1); |
43 |
0 |
43 |
|
| 13 |
227 |
▶ | for (unsigned int i = 0; i < len; i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (unsigned int i = 0; i < len; i++) { |
184 |
43 |
227 |
|
| 14 |
184 |
| innerav = newAV(); |
| 15 |
184 |
| av_store(av, i, newRV_noinc((SV*)innerav)); |
| 16 |
184 |
| av_fill(innerav, 1); |
| 17 |
|
| // IVSIZE is from perl/lib/CORE/config.h, defined as sizeof(IV) |
| 18 |
|
| #if IVSIZE >= 8 |
| 19 |
|
| // if Perl integers are 64 bit, use newSViv() |
| 20 |
184 |
| av_store(innerav, 0, newSViv(poly[i].X)); |
| 21 |
184 |
| av_store(innerav, 1, newSViv(poly[i].Y)); |
| 22 |
|
| #else |
| 23 |
|
| // otherwise we expect Clipper integers to fit in the |
| 24 |
|
| // 53 bit mantissa of a Perl double |
| 25 |
|
| av_store(innerav, 0, newSVnv(poly[i].X)); |
| 26 |
|
| av_store(innerav, 1, newSVnv(poly[i].Y)); |
| 27 |
|
| #endif |
| 28 |
|
| |
| 29 |
|
| |
| 30 |
|
| } |
| 31 |
43 |
| return (SV*)newRV_noinc((SV*)av); |
| 32 |
|
| } |
| 33 |
|
| |
| 34 |
|
| |
| 35 |
|
| SV* |
| 36 |
27 |
| polygons2perl(pTHX_ const ClipperLib::Polygons& poly) |
| 37 |
|
| { |
| 38 |
27 |
| AV* av = newAV(); |
| 39 |
|
| SV* innerav; |
| 40 |
27 |
| const unsigned int len = poly.size(); |
| 41 |
27 |
▶ | av_extend(av, len == 0 ? 0 : len-1); |
Branch: 1 branch
| Branch | True | False | Total |
| av_extend(av, len == 0 ? 0 : len-1); |
25 |
2 |
27 |
|
| 42 |
63 |
▶ | for (unsigned int i = 0; i < len; i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (unsigned int i = 0; i < len; i++) { |
36 |
27 |
63 |
|
| 43 |
36 |
| innerav = polygon2perl(aTHX_ poly[i]); |
| 44 |
36 |
| av_store(av, i, innerav); |
| 45 |
|
| } |
| 46 |
27 |
| return (SV*)newRV_noinc((SV*)av); |
| 47 |
|
| } |
| 48 |
|
| |
| 49 |
|
| |
| 50 |
|
| SV* |
| 51 |
4 |
| expolygon2perl(pTHX_ const ExPolygon& poly) |
| 52 |
|
| { |
| 53 |
4 |
| HV* hv = newHV(); |
| 54 |
4 |
| (void)hv_stores( hv, "outer", (SV*)polygon2perl(aTHX_ poly.outer) ); |
| 55 |
4 |
| (void)hv_stores( hv, "holes", (SV*)polygons2perl(aTHX_ poly.holes) ); |
| 56 |
4 |
| return (SV*)newRV_noinc((SV*)hv); |
| 57 |
|
| } |
| 58 |
|
| |
| 59 |
|
| |
| 60 |
|
| SV* |
| 61 |
4 |
| expolygons2perl(pTHX_ const ExPolygons& polys) |
| 62 |
|
| { |
| 63 |
4 |
| AV* av = newAV(); |
| 64 |
|
| SV* innerav; |
| 65 |
4 |
| const unsigned int len = polys.size(); |
| 66 |
4 |
▶ | av_extend(av, len == 0 ? 0 : len-1); |
Branch: 1 branch
| Branch | True | False | Total |
| av_extend(av, len == 0 ? 0 : len-1); |
4 |
0 |
4 |
|
| 67 |
8 |
▶ | for (unsigned int i = 0; i < len; i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (unsigned int i = 0; i < len; i++) { |
4 |
4 |
8 |
|
| 68 |
4 |
| innerav = expolygon2perl(aTHX_ polys[i]); |
| 69 |
4 |
| av_store(av, i, innerav); |
| 70 |
|
| } |
| 71 |
4 |
| return (SV*)newRV_noinc((SV*)av); |
| 72 |
|
| } |
| 73 |
|
| |
| 74 |
|
| SV* polynode2perl(const PolyNode& node); |
| 75 |
|
| |
| 76 |
|
| SV* |
| 77 |
5 |
| polynode_children_2_perl(const PolyNode& node) |
| 78 |
|
| { |
| 79 |
5 |
| AV* av = newAV(); |
| 80 |
5 |
| const unsigned int len = node.ChildCount(); |
| 81 |
5 |
▶ | av_extend(av, len == 0 ? 0 : len-1); |
Branch: 1 branch
| Branch | True | False | Total |
| av_extend(av, len == 0 ? 0 : len-1); |
3 |
2 |
5 |
|
| 82 |
8 |
▶ | for (int i = 0; i < len; ++i) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (int i = 0; i < len; ++i) { |
3 |
5 |
8 |
|
| 83 |
3 |
| av_store(av, i, polynode2perl(*node.Childs[i])); |
| 84 |
|
| } |
| 85 |
5 |
| return (SV*)newRV_noinc((SV*)av); |
| 86 |
|
| } |
| 87 |
|
| |
| 88 |
|
| SV* |
| 89 |
3 |
| polynode2perl(const PolyNode& node) |
| 90 |
|
| { |
| 91 |
3 |
| HV* hv = newHV(); |
| 92 |
3 |
▶ | if (node.IsHole()) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (node.IsHole()) { |
1 |
2 |
3 |
|
| 93 |
1 |
| (void)hv_stores( hv, "hole", (SV*)polygon2perl(aTHX_ node.Contour) ); |
| 94 |
|
| } else { |
| 95 |
2 |
| (void)hv_stores( hv, "outer", (SV*)polygon2perl(aTHX_ node.Contour) ); |
| 96 |
|
| } |
| 97 |
3 |
| (void)hv_stores( hv, "children", (SV*)polynode_children_2_perl(node) ); |
| 98 |
3 |
| return (SV*)newRV_noinc((SV*)hv); |
| 99 |
|
| } |
| 100 |
|
| |
| 101 |
|
| SV* |
| 102 |
2 |
| polytree2perl(pTHX_ const PolyTree& polytree) |
| 103 |
|
| { |
| 104 |
2 |
| return polynode_children_2_perl(polytree); |
| 105 |
|
| } |
| 106 |
|
| |
| 107 |
|
| |
| 108 |
|
| |
| 109 |
|
| ClipperLib::Polygon* |
| 110 |
85 |
| perl2polygon(pTHX_ AV* theAv) |
| 111 |
|
| { |
| 112 |
85 |
| const unsigned int len = av_len(theAv)+1; |
| 113 |
170 |
▶ | ClipperLib::Polygon* retval = new ClipperLib::Polygon(len); |
Branch: 2 branches
| Branch | True | False | Total |
| ClipperLib::Polygon* retval = new ClipperLib::Polygon(len); |
85 |
0 |
85 |
| ClipperLib::Polygon* retval = new ClipperLib::Polygon(len); |
0 |
0 |
0 |
|
| 114 |
|
| SV** elem; |
| 115 |
|
| AV* innerav; |
| 116 |
437 |
▶ | for (unsigned int i = 0; i < len; i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (unsigned int i = 0; i < len; i++) { |
352 |
85 |
437 |
|
| 117 |
352 |
| elem = av_fetch(theAv, i, 0); |
| 118 |
704 |
| if (!SvROK(*elem) |
| 119 |
352 |
▶ | || SvTYPE(SvRV(*elem)) != SVt_PVAV |
Branch: 1 branch
| Branch | True | False | Total |
| || SvTYPE(SvRV(*elem)) != SVt_PVAV |
352 |
0 |
352 |
|
| 120 |
704 |
▶ | || av_len((AV*)SvRV(*elem)) < 1) |
Branch: 3 branches
| Branch | True | False | Total |
| || av_len((AV*)SvRV(*elem)) < 1) |
352 |
0 |
352 |
| || av_len((AV*)SvRV(*elem)) < 1) |
0 |
352 |
352 |
| || av_len((AV*)SvRV(*elem)) < 1) |
0 |
352 |
352 |
|
| 121 |
|
| { |
| 122 |
0 |
▶ | delete retval; |
Branch: 1 branch
| Branch | True | False | Total |
| delete retval; |
0 |
0 |
0 |
|
| 123 |
0 |
| return NULL; |
| 124 |
|
| } |
| 125 |
352 |
| innerav = (AV*)SvRV(*elem); |
| 126 |
352 |
| ClipperLib::IntPoint& p = (*retval)[i]; |
| 127 |
|
| // IVSIZE is from perl/lib/CORE/config.h, defined as sizeof(IV) |
| 128 |
|
| #if IVSIZE >= 8 |
| 129 |
|
| // if Perl integers are 64 bit, use SvIV() |
| 130 |
|
| // Clipper.pm then supports 64 bit ints. |
| 131 |
352 |
| p.X = (ClipperLib::long64)SvIV(*av_fetch(innerav, 0, 0)); |
| 132 |
352 |
| p.Y = (ClipperLib::long64)SvIV(*av_fetch(innerav, 1, 0)); |
| 133 |
|
| #else |
| 134 |
|
| // otherwise coerce the Perl scalar to a double, with SvNV() |
| 135 |
|
| // Perl doubles commonly allow 53 bits for the mantissa. |
| 136 |
|
| // So in the common case, Clipper.pm supports 53 bit integers, stored in doubles on the Perl side. |
| 137 |
|
| p.X = (ClipperLib::long64)SvNV(*av_fetch(innerav, 0, 0)); |
| 138 |
|
| p.Y = (ClipperLib::long64)SvNV(*av_fetch(innerav, 1, 0)); |
| 139 |
|
| #endif |
| 140 |
|
| } |
| 141 |
85 |
| return retval; |
| 142 |
|
| } |
| 143 |
|
| |
| 144 |
|
| |
| 145 |
|
| ClipperLib::Polygons* |
| 146 |
13 |
| perl2polygons(pTHX_ AV* theAv) |
| 147 |
|
| { |
| 148 |
13 |
| const unsigned int len = av_len(theAv)+1; |
| 149 |
26 |
▶ | ClipperLib::Polygons* retval = new ClipperLib::Polygons(len); |
Branch: 2 branches
| Branch | True | False | Total |
| ClipperLib::Polygons* retval = new ClipperLib::Polygons(len); |
13 |
0 |
13 |
| ClipperLib::Polygons* retval = new ClipperLib::Polygons(len); |
0 |
0 |
0 |
|
| 150 |
|
| SV** elem; |
| 151 |
|
| AV* innerav; |
| 152 |
33 |
▶ | for (unsigned int i = 0; i < len; i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (unsigned int i = 0; i < len; i++) { |
20 |
13 |
33 |
|
| 153 |
20 |
| elem = av_fetch(theAv, i, 0); |
| 154 |
40 |
| if (!SvROK(*elem) |
| 155 |
20 |
▶ | || SvTYPE(SvRV(*elem)) != SVt_PVAV |
Branch: 1 branch
| Branch | True | False | Total |
| || SvTYPE(SvRV(*elem)) != SVt_PVAV |
20 |
0 |
20 |
|
| 156 |
40 |
▶ | || av_len((AV*)SvRV(*elem)) < 1) |
Branch: 3 branches
| Branch | True | False | Total |
| || av_len((AV*)SvRV(*elem)) < 1) |
20 |
0 |
20 |
| || av_len((AV*)SvRV(*elem)) < 1) |
0 |
20 |
20 |
| || av_len((AV*)SvRV(*elem)) < 1) |
0 |
20 |
20 |
|
| 157 |
|
| { |
| 158 |
0 |
▶ | delete retval; |
Branch: 1 branch
| Branch | True | False | Total |
| delete retval; |
0 |
0 |
0 |
|
| 159 |
0 |
| return NULL; |
| 160 |
|
| } |
| 161 |
20 |
| innerav = (AV*)SvRV(*elem); |
| 162 |
20 |
| ClipperLib::Polygon* tmp = perl2polygon(aTHX_ innerav); |
| 163 |
20 |
▶ | if (tmp == NULL) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (tmp == NULL) { |
0 |
20 |
20 |
|
| 164 |
0 |
▶ | delete retval; |
Branch: 1 branch
| Branch | True | False | Total |
| delete retval; |
0 |
0 |
0 |
|
| 165 |
0 |
| return NULL; |
| 166 |
|
| } |
| 167 |
20 |
| (*retval)[i] = *tmp; |
| 168 |
20 |
▶ | delete tmp; |
Branch: 1 branch
| Branch | True | False | Total |
| delete tmp; |
20 |
0 |
20 |
|
| 169 |
|
| } |
| 170 |
13 |
| return retval; |
| 171 |
|
| } |
| 172 |
|
| |
| 173 |
|
| |
| 174 |
|
| #define AV_CHECK(outav, hv, key) \ |
| 175 |
|
| STMT_START { \ |
| 176 |
|
| SV** buf = hv_fetchs(hv, key, 0); \ |
| 177 |
|
| if (!buf || !*buf) { \ |
| 178 |
|
| croak("Missing ExPolygon hash key: '" key "' or not an array reference."); \ |
| 179 |
|
| } \ |
| 180 |
|
| SvGETMAGIC(*buf); \ |
| 181 |
|
| if (SvROK(*buf) && SvTYPE(SvRV(*buf)) == SVt_PVAV) { \ |
| 182 |
|
| outav = (AV*)SvRV(*buf); \ |
| 183 |
|
| } \ |
| 184 |
|
| else { \ |
| 185 |
|
| croak(key " is not an ARRAY reference"); \ |
| 186 |
|
| } \ |
| 187 |
|
| } STMT_END |
| 188 |
|
| |
| 189 |
|
| ExPolygon* |
| 190 |
0 |
| perl2expolygon(pTHX_ HV* theHv) |
| 191 |
|
| { |
| 192 |
|
| AV* outerav; |
| 193 |
|
| AV* holesav; |
| 194 |
0 |
▶ | AV_CHECK(outerav, theHv, "outer"); |
Branch: 4 branches
| Branch | True | False | Total |
| AV_CHECK(outerav, theHv, "outer"); |
0 |
0 |
0 |
| AV_CHECK(outerav, theHv, "outer"); |
0 |
0 |
0 |
| AV_CHECK(outerav, theHv, "outer"); |
0 |
0 |
0 |
| AV_CHECK(outerav, theHv, "outer"); |
0 |
0 |
0 |
|
| 195 |
0 |
▶ | AV_CHECK(holesav, theHv, "holes"); |
Branch: 4 branches
| Branch | True | False | Total |
| AV_CHECK(holesav, theHv, "holes"); |
0 |
0 |
0 |
| AV_CHECK(holesav, theHv, "holes"); |
0 |
0 |
0 |
| AV_CHECK(holesav, theHv, "holes"); |
0 |
0 |
0 |
| AV_CHECK(holesav, theHv, "holes"); |
0 |
0 |
0 |
|
| 196 |
|
| |
| 197 |
0 |
| ExPolygon* retval = new ExPolygon(); |
| 198 |
0 |
| ClipperLib::Polygon* tmp = perl2polygon(aTHX_ outerav); |
| 199 |
0 |
▶ | if (!tmp) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (!tmp) { |
0 |
0 |
0 |
|
| 200 |
0 |
▶ | delete retval; |
Branch: 1 branch
| Branch | True | False | Total |
| delete retval; |
0 |
0 |
0 |
|
| 201 |
0 |
| return NULL; |
| 202 |
|
| } |
| 203 |
0 |
| retval->outer = *tmp; |
| 204 |
|
| |
| 205 |
0 |
| ClipperLib::Polygons* tmps = perl2polygons(aTHX_ holesav); |
| 206 |
0 |
▶ | if (!tmps) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (!tmps) { |
0 |
0 |
0 |
|
| 207 |
0 |
▶ | delete retval; |
Branch: 1 branch
| Branch | True | False | Total |
| delete retval; |
0 |
0 |
0 |
|
| 208 |
0 |
| return NULL; |
| 209 |
|
| } |
| 210 |
0 |
| retval->holes = *tmps; |
| 211 |
|
| |
| 212 |
0 |
| return retval; |
| 213 |
|
| } |
| 214 |
|
| #undef AV_CHECK |
| 215 |
|
| |
| 216 |
|
| |
| 217 |
|
| ExPolygons* |
| 218 |
0 |
| perl2expolygons(pTHX_ AV* theAv) |
| 219 |
|
| { |
| 220 |
0 |
▶ | const unsigned int len = av_len(theAv)+1; |
Branch: 1 branch
| Branch | True | False | Total |
| const unsigned int len = av_len(theAv)+1; |
0 |
0 |
0 |
|
| 221 |
0 |
| std::vector<ExPolygon> tmpEx; // Done because of croak |
| 222 |
|
| |
| 223 |
|
| SV** elem; |
| 224 |
|
| HV* innerhv; |
| 225 |
0 |
▶ | for (unsigned int i = 0; i < len; i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (unsigned int i = 0; i < len; i++) { |
0 |
0 |
0 |
|
| 226 |
0 |
▶ | elem = av_fetch(theAv, i, 0); |
Branch: 1 branch
| Branch | True | False | Total |
| elem = av_fetch(theAv, i, 0); |
0 |
0 |
0 |
|
| 227 |
0 |
▶ | if (!SvROK(*elem) |
Branch: 1 branch
| Branch | True | False | Total |
| if (!SvROK(*elem) |
0 |
0 |
0 |
|
| 228 |
0 |
▶ | || SvTYPE(SvRV(*elem)) != SVt_PVHV) |
Branch: 1 branch
| Branch | True | False | Total |
| || SvTYPE(SvRV(*elem)) != SVt_PVHV) |
0 |
0 |
0 |
|
| 229 |
0 |
| return NULL; |
| 230 |
0 |
| innerhv = (HV*)SvRV(*elem); |
| 231 |
0 |
▶ | ExPolygon* tmp = perl2expolygon(aTHX_ innerhv); |
Branch: 1 branch
| Branch | True | False | Total |
| ExPolygon* tmp = perl2expolygon(aTHX_ innerhv); |
0 |
0 |
0 |
|
| 232 |
0 |
▶ | if (tmp == NULL) |
Branch: 1 branch
| Branch | True | False | Total |
| if (tmp == NULL) |
0 |
0 |
0 |
|
| 233 |
0 |
| return NULL; |
| 234 |
0 |
▶ | tmpEx[i] = *tmp; |
Branch: 1 branch
| Branch | True | False | Total |
| tmpEx[i] = *tmp; |
0 |
0 |
0 |
|
| 235 |
0 |
▶ | delete tmp; |
Branch: 1 branch
| Branch | True | False | Total |
| delete tmp; |
0 |
0 |
0 |
|
| 236 |
|
| } |
| 237 |
|
| |
| 238 |
0 |
▶ | ExPolygons* retval = new ExPolygons(tmpEx); |
Branch: 3 branches
| Branch | True | False | Total |
| ExPolygons* retval = new ExPolygons(tmpEx); |
0 |
0 |
0 |
| ExPolygons* retval = new ExPolygons(tmpEx); |
0 |
0 |
0 |
| ExPolygons* retval = new ExPolygons(tmpEx); |
0 |
0 |
0 |
|
| 239 |
0 |
| return retval; |
| 240 |
0 |
| } |
| 241 |
|
| |
| 242 |
|
| |
| 243 |
|
| #endif |