| 1 |
|
| MODULE = Geo::Geos PACKAGE = Geo::Geos::IntersectionMatrix |
| 2 |
|
| PROTOTYPES: DISABLE |
| 3 |
|
| |
| 4 |
|
| IntersectionMatrix* new(SV*, SV* arg1 = NULL) { |
| 5 |
3 |
| if (!arg1) RETVAL = new IntersectionMatrix(); |
| 6 |
3 |
▶ | else { |
Branch: 4 branches
| Branch | True | False | Total |
| else { |
1 |
2 |
3 |
| else { |
1 |
0 |
1 |
| else { |
1 |
0 |
1 |
| else { |
0 |
0 |
0 |
|
| 7 |
|
| std::string elements { SvPV_nolen(arg1) }; |
| 8 |
4 |
▶ | RETVAL = new IntersectionMatrix(elements); |
Branch: 1 branch
| Branch | True | False | Total |
| RETVAL = new IntersectionMatrix(elements); |
2 |
0 |
2 |
|
| 9 |
2 |
▶ | } |
Branch: 3 branches
| Branch | True | False | Total |
| } |
2 |
0 |
2 |
| } |
2 |
0 |
2 |
| } |
0 |
0 |
0 |
|
| 10 |
2 |
| } |
| 11 |
|
| |
| 12 |
1 |
▶ | bool IntersectionMatrix::matches (std::string requiredDimensionSymbols) |
Branch: 2 branches
| Branch | True | False | Total |
| bool IntersectionMatrix::matches (std::string requiredDimensionSymbols) |
1 |
0 |
1 |
| bool IntersectionMatrix::matches (std::string requiredDimensionSymbols) |
1 |
0 |
1 |
|
| 13 |
|
| |
| 14 |
0 |
| void IntersectionMatrix::add(IntersectionMatrix& other) { THIS->add(&other); } |
| 15 |
|
| |
| 16 |
|
| void IntersectionMatrix::set(SV* arg1, SV* arg2 = NULL, SV* arg3 = NULL) { |
| 17 |
2 |
▶ | if(!arg1) throw("undef not allowed"); |
Branch: 1 branch
| Branch | True | False | Total |
| if(!arg1) throw("undef not allowed"); |
0 |
2 |
2 |
|
| 18 |
2 |
▶ | if (!arg2) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (!arg2) { |
1 |
1 |
2 |
|
| 19 |
2 |
▶ | std::string dimensionSymbols { SvPV_nolen(arg1) }; |
Branch: 1 branch
| Branch | True | False | Total |
| std::string dimensionSymbols { SvPV_nolen(arg1) }; |
1 |
0 |
1 |
|
| 20 |
1 |
▶ | THIS->set(dimensionSymbols); |
Branch: 1 branch
| Branch | True | False | Total |
| THIS->set(dimensionSymbols); |
1 |
0 |
1 |
|
| 21 |
1 |
| } else { |
| 22 |
1 |
▶ | if(!arg3) throw("undef not allowed"); |
Branch: 1 branch
| Branch | True | False | Total |
| if(!arg3) throw("undef not allowed"); |
0 |
1 |
1 |
|
| 23 |
1 |
| int row = SvIV(arg1); |
| 24 |
1 |
| int col = SvIV(arg2); |
| 25 |
1 |
| int val = SvIV(arg3); |
| 26 |
1 |
| THIS->set(row, col, val); |
| 27 |
|
| } |
| 28 |
|
| } |
| 29 |
|
| |
| 30 |
|
| void IntersectionMatrix::setAtLeast(SV* arg1, SV* arg2 = NULL, SV* arg3 = NULL) { |
| 31 |
2 |
▶ | if(!arg1) throw("undef not allowed"); |
Branch: 1 branch
| Branch | True | False | Total |
| if(!arg1) throw("undef not allowed"); |
0 |
2 |
2 |
|
| 32 |
2 |
▶ | if (!arg2) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (!arg2) { |
1 |
1 |
2 |
|
| 33 |
2 |
▶ | std::string dimensionSymbols { SvPV_nolen(arg1) }; |
Branch: 1 branch
| Branch | True | False | Total |
| std::string dimensionSymbols { SvPV_nolen(arg1) }; |
1 |
0 |
1 |
|
| 34 |
1 |
▶ | THIS->setAtLeast(dimensionSymbols); |
Branch: 2 branches
| Branch | True | False | Total |
| THIS->setAtLeast(dimensionSymbols); |
1 |
0 |
1 |
| THIS->setAtLeast(dimensionSymbols); |
1 |
0 |
1 |
|
| 35 |
1 |
| } else { |
| 36 |
1 |
▶ | if(!arg3) throw("undef not allowed"); |
Branch: 1 branch
| Branch | True | False | Total |
| if(!arg3) throw("undef not allowed"); |
0 |
1 |
1 |
|
| 37 |
1 |
| int row = SvIV(arg1); |
| 38 |
1 |
| int col = SvIV(arg2); |
| 39 |
1 |
| int val = SvIV(arg3); |
| 40 |
1 |
| THIS->setAtLeast(row, col, val); |
| 41 |
|
| } |
| 42 |
|
| } |
| 43 |
|
| |
| 44 |
1 |
| void IntersectionMatrix::setAll(int dimensionValue) |
| 45 |
|
| |
| 46 |
1 |
| void IntersectionMatrix::setAtLeastIfValid(int row, int column, int minimumDimensionValue) |
| 47 |
|
| |
| 48 |
1 |
▶ | int IntersectionMatrix::get(int row, int col) |
Branch: 1 branch
| Branch | True | False | Total |
| int IntersectionMatrix::get(int row, int col) |
0 |
1 |
1 |
|
| 49 |
|
| |
| 50 |
1 |
▶ | bool IntersectionMatrix::isDisjoint() |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isDisjoint() |
1 |
0 |
1 |
|
| 51 |
|
| |
| 52 |
1 |
▶ | bool IntersectionMatrix::isIntersects() |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isIntersects() |
0 |
1 |
1 |
|
| 53 |
|
| |
| 54 |
1 |
▶ | bool IntersectionMatrix::isWithin() |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isWithin() |
0 |
1 |
1 |
|
| 55 |
|
| |
| 56 |
1 |
▶ | bool IntersectionMatrix::isContains() |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isContains() |
0 |
1 |
1 |
|
| 57 |
|
| |
| 58 |
1 |
▶ | bool IntersectionMatrix::isCovers() |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isCovers() |
0 |
1 |
1 |
|
| 59 |
|
| |
| 60 |
1 |
▶ | bool IntersectionMatrix::isCoveredBy() |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isCoveredBy() |
0 |
1 |
1 |
|
| 61 |
|
| |
| 62 |
1 |
▶ | bool IntersectionMatrix::isTouches (int dimensionOfGeometryA, int dimensionOfGeometryB) |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isTouches (int dimensionOfGeometryA, int dimensionOfGeometryB) |
0 |
1 |
1 |
|
| 63 |
|
| |
| 64 |
1 |
▶ | bool IntersectionMatrix::isCrosses (int dimensionOfGeometryA, int dimensionOfGeometryB) |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isCrosses (int dimensionOfGeometryA, int dimensionOfGeometryB) |
0 |
1 |
1 |
|
| 65 |
|
| |
| 66 |
1 |
▶ | bool IntersectionMatrix::isEquals (int dimensionOfGeometryA, int dimensionOfGeometryB) |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isEquals (int dimensionOfGeometryA, int dimensionOfGeometryB) |
0 |
1 |
1 |
|
| 67 |
|
| |
| 68 |
1 |
▶ | bool IntersectionMatrix::isOverlaps (int dimensionOfGeometryA, int dimensionOfGeometryB) |
Branch: 1 branch
| Branch | True | False | Total |
| bool IntersectionMatrix::isOverlaps (int dimensionOfGeometryA, int dimensionOfGeometryB) |
0 |
1 |
1 |
|
| 69 |
|
| |
| 70 |
|
| # returns self |
| 71 |
1 |
| void IntersectionMatrix::transpose() { THIS->transpose(); XSRETURN(1); } |
| 72 |
|
| |
| 73 |
20 |
▶ | std::string IntersectionMatrix::toString (...) |
Branch: 1 branch
| Branch | True | False | Total |
| std::string IntersectionMatrix::toString (...) |
20 |
0 |
20 |
|
| 74 |
|
| |
| 75 |
0 |
▶ | int CLONE_SKIP (...) { PERL_UNUSED_VAR(items); RETVAL = 1; } |
Branch: 1 branch
| Branch | True | False | Total |
| int CLONE_SKIP (...) { PERL_UNUSED_VAR(items); RETVAL = 1; } |
0 |
0 |
0 |
|