@@ -14,7 +14,7 @@ discard block |
||
| 14 | 14 | */ |
| 15 | 15 | public function read($wkb, $is_hex_string = FALSE) { |
| 16 | 16 | if ($is_hex_string) { |
| 17 | - $wkb = pack('H*',$wkb); |
|
| 17 | + $wkb = pack('H*', $wkb); |
|
| 18 | 18 | } |
| 19 | 19 | |
| 20 | 20 | // Open the wkb up in memory so we can examine the SRID |
@@ -51,41 +51,41 @@ discard block |
||
| 51 | 51 | */ |
| 52 | 52 | public function write(Geometry $geometry, $write_as_hex = FALSE) { |
| 53 | 53 | // We always write into NDR (little endian) |
| 54 | - $wkb = pack('c',1); |
|
| 54 | + $wkb = pack('c', 1); |
|
| 55 | 55 | |
| 56 | 56 | switch ($geometry->getGeomType()) { |
| 57 | 57 | case 'Point'; |
| 58 | - $wkb .= pack('L',1); |
|
| 58 | + $wkb .= pack('L', 1); |
|
| 59 | 59 | $wkb .= $this->writePoint($geometry); |
| 60 | 60 | break; |
| 61 | 61 | case 'LineString'; |
| 62 | - $wkb .= pack('L',2); |
|
| 62 | + $wkb .= pack('L', 2); |
|
| 63 | 63 | $wkb .= $this->writeLineString($geometry); |
| 64 | 64 | break; |
| 65 | 65 | case 'Polygon'; |
| 66 | - $wkb .= pack('L',3); |
|
| 66 | + $wkb .= pack('L', 3); |
|
| 67 | 67 | $wkb .= $this->writePolygon($geometry); |
| 68 | 68 | break; |
| 69 | 69 | case 'MultiPoint'; |
| 70 | - $wkb .= pack('L',4); |
|
| 70 | + $wkb .= pack('L', 4); |
|
| 71 | 71 | $wkb .= $this->writeMulti($geometry); |
| 72 | 72 | break; |
| 73 | 73 | case 'MultiLineString'; |
| 74 | - $wkb .= pack('L',5); |
|
| 74 | + $wkb .= pack('L', 5); |
|
| 75 | 75 | $wkb .= $this->writeMulti($geometry); |
| 76 | 76 | break; |
| 77 | 77 | case 'MultiPolygon'; |
| 78 | - $wkb .= pack('L',6); |
|
| 78 | + $wkb .= pack('L', 6); |
|
| 79 | 79 | $wkb .= $this->writeMulti($geometry); |
| 80 | 80 | break; |
| 81 | 81 | case 'GeometryCollection'; |
| 82 | - $wkb .= pack('L',7); |
|
| 82 | + $wkb .= pack('L', 7); |
|
| 83 | 83 | $wkb .= $this->writeMulti($geometry); |
| 84 | 84 | break; |
| 85 | 85 | } |
| 86 | 86 | |
| 87 | 87 | if ($write_as_hex) { |
| 88 | - $unpacked = unpack('H*',$wkb); |
|
| 88 | + $unpacked = unpack('H*', $wkb); |
|
| 89 | 89 | return $unpacked[1]; |
| 90 | 90 | } |
| 91 | 91 | else { |
@@ -6,7 +6,7 @@ discard block |
||
| 6 | 6 | * @see http://en.wikipedia.org/wiki/Geohash |
| 7 | 7 | * |
| 8 | 8 | */ |
| 9 | -class GeoHash extends GeoAdapter{ |
|
| 9 | +class GeoHash extends GeoAdapter { |
|
| 10 | 10 | private $table = "0123456789bcdefghjkmnpqrstuvwxyz"; |
| 11 | 11 | |
| 12 | 12 | /** |
@@ -39,10 +39,10 @@ discard block |
||
| 39 | 39 | * @param Point $geometry |
| 40 | 40 | * @see GeoAdapter::write() |
| 41 | 41 | */ |
| 42 | - public function write(Geometry $geometry, $precision = NULL){ |
|
| 42 | + public function write(Geometry $geometry, $precision = NULL) { |
|
| 43 | 43 | if ($geometry->isEmpty()) return ''; |
| 44 | 44 | |
| 45 | - if($geometry->geometryType() === 'Point'){ |
|
| 45 | + if ($geometry->geometryType() === 'Point') { |
|
| 46 | 46 | return $this->encodePoint($geometry, $precision); |
| 47 | 47 | } |
| 48 | 48 | else { |
@@ -74,30 +74,30 @@ discard block |
||
| 74 | 74 | * @author algorithm based on code by Alexander Songe <[email protected]> |
| 75 | 75 | * @see https://github.com/asonge/php-geohash/issues/1 |
| 76 | 76 | */ |
| 77 | - private function encodePoint($point, $precision = NULL){ |
|
| 77 | + private function encodePoint($point, $precision = NULL) { |
|
| 78 | 78 | if ($precision === NULL) { |
| 79 | - $lap = strlen($point->y())-strpos($point->y(),"."); |
|
| 80 | - $lop = strlen($point->x())-strpos($point->x(),"."); |
|
| 81 | - $precision = pow(10,-max($lap-1,$lop-1,0))/2; |
|
| 79 | + $lap = strlen($point->y()) - strpos($point->y(), "."); |
|
| 80 | + $lop = strlen($point->x()) - strpos($point->x(), "."); |
|
| 81 | + $precision = pow(10, -max($lap - 1, $lop - 1, 0))/2; |
|
| 82 | 82 | } |
| 83 | 83 | |
| 84 | - $minlat = -90; |
|
| 85 | - $maxlat = 90; |
|
| 84 | + $minlat = -90; |
|
| 85 | + $maxlat = 90; |
|
| 86 | 86 | $minlon = -180; |
| 87 | - $maxlon = 180; |
|
| 88 | - $latE = 90; |
|
| 89 | - $lonE = 180; |
|
| 87 | + $maxlon = 180; |
|
| 88 | + $latE = 90; |
|
| 89 | + $lonE = 180; |
|
| 90 | 90 | $i = 0; |
| 91 | 91 | $error = 180; |
| 92 | - $hash=''; |
|
| 93 | - while($error>=$precision) { |
|
| 92 | + $hash = ''; |
|
| 93 | + while ($error >= $precision) { |
|
| 94 | 94 | $chr = 0; |
| 95 | - for($b=4;$b>=0;--$b) { |
|
| 96 | - if((1&$b) == (1&$i)) { |
|
| 95 | + for ($b = 4; $b >= 0; --$b) { |
|
| 96 | + if ((1&$b) == (1&$i)) { |
|
| 97 | 97 | // even char, even bit OR odd char, odd bit...a lon |
| 98 | - $next = ($minlon+$maxlon)/2; |
|
| 99 | - if($point->x()>$next) { |
|
| 100 | - $chr |= pow(2,$b); |
|
| 98 | + $next = ($minlon + $maxlon)/2; |
|
| 99 | + if ($point->x() > $next) { |
|
| 100 | + $chr |= pow(2, $b); |
|
| 101 | 101 | $minlon = $next; |
| 102 | 102 | } else { |
| 103 | 103 | $maxlon = $next; |
@@ -105,9 +105,9 @@ discard block |
||
| 105 | 105 | $lonE /= 2; |
| 106 | 106 | } else { |
| 107 | 107 | // odd char, even bit OR even char, odd bit...a lat |
| 108 | - $next = ($minlat+$maxlat)/2; |
|
| 109 | - if($point->y()>$next) { |
|
| 110 | - $chr |= pow(2,$b); |
|
| 108 | + $next = ($minlat + $maxlat)/2; |
|
| 109 | + if ($point->y() > $next) { |
|
| 110 | + $chr |= pow(2, $b); |
|
| 111 | 111 | $minlat = $next; |
| 112 | 112 | } else { |
| 113 | 113 | $maxlat = $next; |
@@ -117,7 +117,7 @@ discard block |
||
| 117 | 117 | } |
| 118 | 118 | $hash .= $this->table[$chr]; |
| 119 | 119 | $i++; |
| 120 | - $error = min($latE,$lonE); |
|
| 120 | + $error = min($latE, $lonE); |
|
| 121 | 121 | } |
| 122 | 122 | return $hash; |
| 123 | 123 | } |
@@ -127,30 +127,30 @@ discard block |
||
| 127 | 127 | * @author algorithm based on code by Alexander Songe <[email protected]> |
| 128 | 128 | * @see https://github.com/asonge/php-geohash/issues/1 |
| 129 | 129 | */ |
| 130 | - private function decode($hash){ |
|
| 130 | + private function decode($hash) { |
|
| 131 | 131 | $ll = array(); |
| 132 | - $minlat = -90; |
|
| 133 | - $maxlat = 90; |
|
| 132 | + $minlat = -90; |
|
| 133 | + $maxlat = 90; |
|
| 134 | 134 | $minlon = -180; |
| 135 | - $maxlon = 180; |
|
| 136 | - $latE = 90; |
|
| 137 | - $lonE = 180; |
|
| 138 | - for($i=0,$c=strlen($hash);$i<$c;$i++) { |
|
| 139 | - $v = strpos($this->table,$hash[$i]); |
|
| 140 | - if(1&$i) { |
|
| 141 | - if(16&$v)$minlat = ($minlat+$maxlat)/2; else $maxlat = ($minlat+$maxlat)/2; |
|
| 142 | - if(8&$v) $minlon = ($minlon+$maxlon)/2; else $maxlon = ($minlon+$maxlon)/2; |
|
| 143 | - if(4&$v) $minlat = ($minlat+$maxlat)/2; else $maxlat = ($minlat+$maxlat)/2; |
|
| 144 | - if(2&$v) $minlon = ($minlon+$maxlon)/2; else $maxlon = ($minlon+$maxlon)/2; |
|
| 145 | - if(1&$v) $minlat = ($minlat+$maxlat)/2; else $maxlat = ($minlat+$maxlat)/2; |
|
| 135 | + $maxlon = 180; |
|
| 136 | + $latE = 90; |
|
| 137 | + $lonE = 180; |
|
| 138 | + for ($i = 0, $c = strlen($hash); $i < $c; $i++) { |
|
| 139 | + $v = strpos($this->table, $hash[$i]); |
|
| 140 | + if (1&$i) { |
|
| 141 | + if (16&$v)$minlat = ($minlat + $maxlat)/2; else $maxlat = ($minlat + $maxlat)/2; |
|
| 142 | + if (8&$v) $minlon = ($minlon + $maxlon)/2; else $maxlon = ($minlon + $maxlon)/2; |
|
| 143 | + if (4&$v) $minlat = ($minlat + $maxlat)/2; else $maxlat = ($minlat + $maxlat)/2; |
|
| 144 | + if (2&$v) $minlon = ($minlon + $maxlon)/2; else $maxlon = ($minlon + $maxlon)/2; |
|
| 145 | + if (1&$v) $minlat = ($minlat + $maxlat)/2; else $maxlat = ($minlat + $maxlat)/2; |
|
| 146 | 146 | $latE /= 8; |
| 147 | 147 | $lonE /= 4; |
| 148 | 148 | } else { |
| 149 | - if(16&$v)$minlon = ($minlon+$maxlon)/2; else $maxlon = ($minlon+$maxlon)/2; |
|
| 150 | - if(8&$v) $minlat = ($minlat+$maxlat)/2; else $maxlat = ($minlat+$maxlat)/2; |
|
| 151 | - if(4&$v) $minlon = ($minlon+$maxlon)/2; else $maxlon = ($minlon+$maxlon)/2; |
|
| 152 | - if(2&$v) $minlat = ($minlat+$maxlat)/2; else $maxlat = ($minlat+$maxlat)/2; |
|
| 153 | - if(1&$v) $minlon = ($minlon+$maxlon)/2; else $maxlon = ($minlon+$maxlon)/2; |
|
| 149 | + if (16&$v)$minlon = ($minlon + $maxlon)/2; else $maxlon = ($minlon + $maxlon)/2; |
|
| 150 | + if (8&$v) $minlat = ($minlat + $maxlat)/2; else $maxlat = ($minlat + $maxlat)/2; |
|
| 151 | + if (4&$v) $minlon = ($minlon + $maxlon)/2; else $maxlon = ($minlon + $maxlon)/2; |
|
| 152 | + if (2&$v) $minlat = ($minlat + $maxlat)/2; else $maxlat = ($minlat + $maxlat)/2; |
|
| 153 | + if (1&$v) $minlon = ($minlon + $maxlon)/2; else $maxlon = ($minlon + $maxlon)/2; |
|
| 154 | 154 | $latE /= 4; |
| 155 | 155 | $lonE /= 8; |
| 156 | 156 | } |
@@ -159,8 +159,8 @@ discard block |
||
| 159 | 159 | $ll['minlon'] = $minlon; |
| 160 | 160 | $ll['maxlat'] = $maxlat; |
| 161 | 161 | $ll['maxlon'] = $maxlon; |
| 162 | - $ll['medlat'] = round(($minlat+$maxlat)/2, max(1, -round(log10($latE)))-1); |
|
| 163 | - $ll['medlon'] = round(($minlon+$maxlon)/2, max(1, -round(log10($lonE)))-1); |
|
| 162 | + $ll['medlat'] = round(($minlat + $maxlat)/2, max(1, -round(log10($latE))) - 1); |
|
| 163 | + $ll['medlon'] = round(($minlon + $maxlon)/2, max(1, -round(log10($lonE))) - 1); |
|
| 164 | 164 | return $ll; |
| 165 | 165 | } |
| 166 | 166 | } |
@@ -45,21 +45,21 @@ discard block |
||
| 45 | 45 | public function geomFromText($text) {
|
| 46 | 46 | // Change to lower-case and strip all CDATA |
| 47 | 47 | $text = strtolower($text); |
| 48 | - $text = preg_replace('/<!\[cdata\[(.*?)\]\]>/s','',$text);
|
|
| 48 | + $text = preg_replace('/<!\[cdata\[(.*?)\]\]>/s', '', $text);
|
|
| 49 | 49 | |
| 50 | 50 | // Load into DOMDocument |
| 51 | 51 | $xmlobj = new DOMDocument(); |
| 52 | 52 | @$xmlobj->loadXML($text); |
| 53 | 53 | if ($xmlobj === false) {
|
| 54 | - throw new Exception("Invalid GPX: ". $text);
|
|
| 54 | + throw new Exception("Invalid GPX: ".$text);
|
|
| 55 | 55 | } |
| 56 | 56 | |
| 57 | 57 | $this->xmlobj = $xmlobj; |
| 58 | 58 | try {
|
| 59 | 59 | $geom = $this->geomFromXML(); |
| 60 | - } catch(InvalidText $e) {
|
|
| 61 | - throw new Exception("Cannot Read Geometry From GPX: ". $text);
|
|
| 62 | - } catch(Exception $e) {
|
|
| 60 | + } catch (InvalidText $e) {
|
|
| 61 | + throw new Exception("Cannot Read Geometry From GPX: ".$text);
|
|
| 62 | + } catch (Exception $e) {
|
|
| 63 | 63 | throw $e; |
| 64 | 64 | } |
| 65 | 65 | |
@@ -112,7 +112,7 @@ discard block |
||
| 112 | 112 | $components[] = new Point($lon, $lat); |
| 113 | 113 | } |
| 114 | 114 | } |
| 115 | - if ($components) {$lines[] = new LineString($components);}
|
|
| 115 | + if ($components) {$lines[] = new LineString($components); }
|
|
| 116 | 116 | } |
| 117 | 117 | return $lines; |
| 118 | 118 | } |
@@ -50,7 +50,7 @@ |
||
| 50 | 50 | if ($type == 'GeometryCollection') { |
| 51 | 51 | return $this->objToGeometryCollection($obj); |
| 52 | 52 | } |
| 53 | - $method = 'arrayTo' . $type; |
|
| 53 | + $method = 'arrayTo'.$type; |
|
| 54 | 54 | return $this->$method($obj->coordinates); |
| 55 | 55 | } |
| 56 | 56 | |
@@ -30,11 +30,11 @@ discard block |
||
| 30 | 30 | */ |
| 31 | 31 | public function read($wkb, $is_hex_string = FALSE) {
|
| 32 | 32 | if ($is_hex_string) {
|
| 33 | - $wkb = pack('H*',$wkb);
|
|
| 33 | + $wkb = pack('H*', $wkb);
|
|
| 34 | 34 | } |
| 35 | 35 | |
| 36 | 36 | if (empty($wkb)) {
|
| 37 | - throw new Exception('Cannot read empty WKB geometry. Found ' . gettype($wkb));
|
|
| 37 | + throw new Exception('Cannot read empty WKB geometry. Found '.gettype($wkb));
|
|
| 38 | 38 | } |
| 39 | 39 | |
| 40 | 40 | $mem = fopen('php://memory', 'r+');
|
@@ -74,37 +74,37 @@ discard block |
||
| 74 | 74 | case 3: |
| 75 | 75 | return $this->getPolygon($mem); |
| 76 | 76 | case 4: |
| 77 | - return $this->getMulti($mem,'point'); |
|
| 77 | + return $this->getMulti($mem, 'point'); |
|
| 78 | 78 | case 5: |
| 79 | - return $this->getMulti($mem,'line'); |
|
| 79 | + return $this->getMulti($mem, 'line'); |
|
| 80 | 80 | case 6: |
| 81 | - return $this->getMulti($mem,'polygon'); |
|
| 81 | + return $this->getMulti($mem, 'polygon'); |
|
| 82 | 82 | case 7: |
| 83 | - return $this->getMulti($mem,'geometry'); |
|
| 83 | + return $this->getMulti($mem, 'geometry'); |
|
| 84 | 84 | } |
| 85 | 85 | } |
| 86 | 86 | |
| 87 | 87 | function getPoint(&$mem) {
|
| 88 | - $point_coords = unpack("d*", fread($mem,$this->dimension*8));
|
|
| 89 | - return new Point($point_coords[1],$point_coords[2]); |
|
| 88 | + $point_coords = unpack("d*", fread($mem, $this->dimension*8));
|
|
| 89 | + return new Point($point_coords[1], $point_coords[2]); |
|
| 90 | 90 | } |
| 91 | 91 | |
| 92 | 92 | function getLinstring(&$mem) {
|
| 93 | 93 | // Get the number of points expected in this string out of the first 4 bytes |
| 94 | - $line_length = unpack('L',fread($mem,4));
|
|
| 94 | + $line_length = unpack('L', fread($mem, 4));
|
|
| 95 | 95 | |
| 96 | 96 | // Return an empty linestring if there is no line-length |
| 97 | 97 | if (!$line_length[1]) return new LineString(); |
| 98 | 98 | |
| 99 | 99 | // Read the nubmer of points x2 (each point is two coords) into decimal-floats |
| 100 | - $line_coords = unpack('d*', fread($mem,$line_length[1]*$this->dimension*8));
|
|
| 100 | + $line_coords = unpack('d*', fread($mem, $line_length[1]*$this->dimension*8));
|
|
| 101 | 101 | |
| 102 | 102 | // We have our coords, build up the linestring |
| 103 | 103 | $components = array(); |
| 104 | 104 | $i = 1; |
| 105 | 105 | $num_coords = count($line_coords); |
| 106 | 106 | while ($i <= $num_coords) {
|
| 107 | - $components[] = new Point($line_coords[$i],$line_coords[$i+1]); |
|
| 107 | + $components[] = new Point($line_coords[$i], $line_coords[$i + 1]); |
|
| 108 | 108 | $i += 2; |
| 109 | 109 | } |
| 110 | 110 | return new LineString($components); |
@@ -112,7 +112,7 @@ discard block |
||
| 112 | 112 | |
| 113 | 113 | function getPolygon(&$mem) {
|
| 114 | 114 | // Get the number of linestring expected in this poly out of the first 4 bytes |
| 115 | - $poly_length = unpack('L',fread($mem,4));
|
|
| 115 | + $poly_length = unpack('L', fread($mem, 4));
|
|
| 116 | 116 | |
| 117 | 117 | $components = array(); |
| 118 | 118 | $i = 1; |
@@ -125,7 +125,7 @@ discard block |
||
| 125 | 125 | |
| 126 | 126 | function getMulti(&$mem, $type) {
|
| 127 | 127 | // Get the number of items expected in this multi out of the first 4 bytes |
| 128 | - $multi_length = unpack('L',fread($mem,4));
|
|
| 128 | + $multi_length = unpack('L', fread($mem, 4));
|
|
| 129 | 129 | |
| 130 | 130 | $components = array(); |
| 131 | 131 | $i = 1; |
@@ -154,41 +154,41 @@ discard block |
||
| 154 | 154 | */ |
| 155 | 155 | public function write(Geometry $geometry, $write_as_hex = FALSE) {
|
| 156 | 156 | // We always write into NDR (little endian) |
| 157 | - $wkb = pack('c',1);
|
|
| 157 | + $wkb = pack('c', 1);
|
|
| 158 | 158 | |
| 159 | 159 | switch ($geometry->getGeomType()) {
|
| 160 | 160 | case 'Point'; |
| 161 | - $wkb .= pack('L',1);
|
|
| 161 | + $wkb .= pack('L', 1);
|
|
| 162 | 162 | $wkb .= $this->writePoint($geometry); |
| 163 | 163 | break; |
| 164 | 164 | case 'LineString'; |
| 165 | - $wkb .= pack('L',2);
|
|
| 165 | + $wkb .= pack('L', 2);
|
|
| 166 | 166 | $wkb .= $this->writeLineString($geometry); |
| 167 | 167 | break; |
| 168 | 168 | case 'Polygon'; |
| 169 | - $wkb .= pack('L',3);
|
|
| 169 | + $wkb .= pack('L', 3);
|
|
| 170 | 170 | $wkb .= $this->writePolygon($geometry); |
| 171 | 171 | break; |
| 172 | 172 | case 'MultiPoint'; |
| 173 | - $wkb .= pack('L',4);
|
|
| 173 | + $wkb .= pack('L', 4);
|
|
| 174 | 174 | $wkb .= $this->writeMulti($geometry); |
| 175 | 175 | break; |
| 176 | 176 | case 'MultiLineString'; |
| 177 | - $wkb .= pack('L',5);
|
|
| 177 | + $wkb .= pack('L', 5);
|
|
| 178 | 178 | $wkb .= $this->writeMulti($geometry); |
| 179 | 179 | break; |
| 180 | 180 | case 'MultiPolygon'; |
| 181 | - $wkb .= pack('L',6);
|
|
| 181 | + $wkb .= pack('L', 6);
|
|
| 182 | 182 | $wkb .= $this->writeMulti($geometry); |
| 183 | 183 | break; |
| 184 | 184 | case 'GeometryCollection'; |
| 185 | - $wkb .= pack('L',7);
|
|
| 185 | + $wkb .= pack('L', 7);
|
|
| 186 | 186 | $wkb .= $this->writeMulti($geometry); |
| 187 | 187 | break; |
| 188 | 188 | } |
| 189 | 189 | |
| 190 | 190 | if ($write_as_hex) {
|
| 191 | - $unpacked = unpack('H*',$wkb);
|
|
| 191 | + $unpacked = unpack('H*', $wkb);
|
|
| 192 | 192 | return $unpacked[1]; |
| 193 | 193 | } |
| 194 | 194 | else {
|
@@ -198,18 +198,18 @@ discard block |
||
| 198 | 198 | |
| 199 | 199 | function writePoint($point) {
|
| 200 | 200 | // Set the coords |
| 201 | - $wkb = pack('dd',$point->x(), $point->y());
|
|
| 201 | + $wkb = pack('dd', $point->x(), $point->y());
|
|
| 202 | 202 | |
| 203 | 203 | return $wkb; |
| 204 | 204 | } |
| 205 | 205 | |
| 206 | 206 | function writeLineString($line) {
|
| 207 | 207 | // Set the number of points in this line |
| 208 | - $wkb = pack('L',$line->numPoints());
|
|
| 208 | + $wkb = pack('L', $line->numPoints());
|
|
| 209 | 209 | |
| 210 | 210 | // Set the coords |
| 211 | 211 | foreach ($line->getComponents() as $point) {
|
| 212 | - $wkb .= pack('dd',$point->x(), $point->y());
|
|
| 212 | + $wkb .= pack('dd', $point->x(), $point->y());
|
|
| 213 | 213 | } |
| 214 | 214 | |
| 215 | 215 | return $wkb; |
@@ -217,7 +217,7 @@ discard block |
||
| 217 | 217 | |
| 218 | 218 | function writePolygon($poly) {
|
| 219 | 219 | // Set the number of lines in this poly |
| 220 | - $wkb = pack('L',$poly->numGeometries());
|
|
| 220 | + $wkb = pack('L', $poly->numGeometries());
|
|
| 221 | 221 | |
| 222 | 222 | // Write the lines |
| 223 | 223 | foreach ($poly->getComponents() as $line) {
|
@@ -229,7 +229,7 @@ discard block |
||
| 229 | 229 | |
| 230 | 230 | function writeMulti($geometry) {
|
| 231 | 231 | // Set the number of components |
| 232 | - $wkb = pack('L',$geometry->numGeometries());
|
|
| 232 | + $wkb = pack('L', $geometry->numGeometries());
|
|
| 233 | 233 | |
| 234 | 234 | // Write the components |
| 235 | 235 | foreach ($geometry->getComponents() as $component) {
|
@@ -53,21 +53,21 @@ discard block |
||
| 53 | 53 | |
| 54 | 54 | // Change to lower-case and strip all CDATA |
| 55 | 55 | $text = mb_strtolower($text, mb_detect_encoding($text)); |
| 56 | - $text = preg_replace('/<!\[cdata\[(.*?)\]\]>/s','',$text);
|
|
| 56 | + $text = preg_replace('/<!\[cdata\[(.*?)\]\]>/s', '', $text);
|
|
| 57 | 57 | |
| 58 | 58 | // Load into DOMDOcument |
| 59 | 59 | $xmlobj = new DOMDocument(); |
| 60 | 60 | @$xmlobj->loadXML($text); |
| 61 | 61 | if ($xmlobj === false) {
|
| 62 | - throw new Exception("Invalid KML: ". $text);
|
|
| 62 | + throw new Exception("Invalid KML: ".$text);
|
|
| 63 | 63 | } |
| 64 | 64 | |
| 65 | 65 | $this->xmlobj = $xmlobj; |
| 66 | 66 | try {
|
| 67 | 67 | $geom = $this->geomFromXML(); |
| 68 | - } catch(InvalidText $e) {
|
|
| 69 | - throw new Exception("Cannot Read Geometry From KML: ". $text);
|
|
| 70 | - } catch(Exception $e) {
|
|
| 68 | + } catch (InvalidText $e) {
|
|
| 69 | + throw new Exception("Cannot Read Geometry From KML: ".$text);
|
|
| 70 | + } catch (Exception $e) {
|
|
| 71 | 71 | throw $e; |
| 72 | 72 | } |
| 73 | 73 | |
@@ -115,14 +115,14 @@ discard block |
||
| 115 | 115 | |
| 116 | 116 | protected function parsePoint($xml) {
|
| 117 | 117 | $coordinates = $this->_extractCoordinates($xml); |
| 118 | - return new Point($coordinates[0][0],$coordinates[0][1]); |
|
| 118 | + return new Point($coordinates[0][0], $coordinates[0][1]); |
|
| 119 | 119 | } |
| 120 | 120 | |
| 121 | 121 | protected function parseLineString($xml) {
|
| 122 | 122 | $coordinates = $this->_extractCoordinates($xml); |
| 123 | 123 | $point_array = array(); |
| 124 | 124 | foreach ($coordinates as $set) {
|
| 125 | - $point_array[] = new Point($set[0],$set[1]); |
|
| 125 | + $point_array[] = new Point($set[0], $set[1]); |
|
| 126 | 126 | } |
| 127 | 127 | return new LineString($point_array); |
| 128 | 128 | } |
@@ -173,7 +173,7 @@ discard block |
||
| 173 | 173 | foreach ($coord_sets as $set_string) {
|
| 174 | 174 | $set_string = trim($set_string); |
| 175 | 175 | if ($set_string) {
|
| 176 | - $set_array = explode(',',$set_string);
|
|
| 176 | + $set_array = explode(',', $set_string);
|
|
| 177 | 177 | if (count($set_array) >= 2) {
|
| 178 | 178 | $coordinates[] = $set_array; |
| 179 | 179 | } |
@@ -214,21 +214,21 @@ discard block |
||
| 214 | 214 | $type = $geom->getGeomType(); |
| 215 | 215 | } |
| 216 | 216 | |
| 217 | - $str = '<'.$this->nss . $type .'>'; |
|
| 217 | + $str = '<'.$this->nss.$type.'>'; |
|
| 218 | 218 | |
| 219 | 219 | if (!$geom->isEmpty()) {
|
| 220 | 220 | $str .= '<'.$this->nss.'coordinates>'; |
| 221 | - $i=0; |
|
| 221 | + $i = 0; |
|
| 222 | 222 | foreach ($geom->getComponents() as $comp) {
|
| 223 | 223 | if ($i != 0) $str .= ' '; |
| 224 | - $str .= $comp->getX() .','. $comp->getY(); |
|
| 224 | + $str .= $comp->getX().','.$comp->getY(); |
|
| 225 | 225 | $i++; |
| 226 | 226 | } |
| 227 | 227 | |
| 228 | 228 | $str .= '</'.$this->nss.'coordinates>'; |
| 229 | 229 | } |
| 230 | 230 | |
| 231 | - $str .= '</'. $this->nss . $type .'>'; |
|
| 231 | + $str .= '</'.$this->nss.$type.'>'; |
|
| 232 | 232 | |
| 233 | 233 | return $str; |
| 234 | 234 | } |
@@ -236,13 +236,13 @@ discard block |
||
| 236 | 236 | public function polygonToKML($geom) {
|
| 237 | 237 | $components = $geom->getComponents(); |
| 238 | 238 | if (!empty($components)) {
|
| 239 | - $str = '<'.$this->nss.'outerBoundaryIs>' . $this->linestringToKML($components[0], 'LinearRing') . '</'.$this->nss.'outerBoundaryIs>'; |
|
| 239 | + $str = '<'.$this->nss.'outerBoundaryIs>'.$this->linestringToKML($components[0], 'LinearRing').'</'.$this->nss.'outerBoundaryIs>'; |
|
| 240 | 240 | foreach (array_slice($components, 1) as $comp) {
|
| 241 | - $str .= '<'.$this->nss.'innerBoundaryIs>' . $this->linestringToKML($comp) . '</'.$this->nss.'innerBoundaryIs>'; |
|
| 241 | + $str .= '<'.$this->nss.'innerBoundaryIs>'.$this->linestringToKML($comp).'</'.$this->nss.'innerBoundaryIs>'; |
|
| 242 | 242 | } |
| 243 | 243 | } |
| 244 | 244 | |
| 245 | - return '<'.$this->nss.'Polygon>'. $str .'</'.$this->nss.'Polygon>'; |
|
| 245 | + return '<'.$this->nss.'Polygon>'.$str.'</'.$this->nss.'Polygon>'; |
|
| 246 | 246 | } |
| 247 | 247 | |
| 248 | 248 | public function collectionToKML($geom) {
|
@@ -253,7 +253,7 @@ discard block |
||
| 253 | 253 | $str .= $sub_adapter->write($comp); |
| 254 | 254 | } |
| 255 | 255 | |
| 256 | - return $str .'</'.$this->nss.'MultiGeometry>'; |
|
| 256 | + return $str.'</'.$this->nss.'MultiGeometry>'; |
|
| 257 | 257 | } |
| 258 | 258 | |
| 259 | 259 | } |
@@ -19,15 +19,15 @@ discard block |
||
| 19 | 19 | $pts = $exterior_ring->getComponents(); |
| 20 | 20 | |
| 21 | 21 | $c = count($pts); |
| 22 | - if((int)$c == '0') return NULL; |
|
| 22 | + if ((int) $c == '0') return NULL; |
|
| 23 | 23 | $a = '0'; |
| 24 | - foreach($pts as $k => $p){ |
|
| 25 | - $j = ($k + 1) % $c; |
|
| 26 | - $a = $a + ($p->getX() * $pts[$j]->getY()) - ($p->getY() * $pts[$j]->getX()); |
|
| 24 | + foreach ($pts as $k => $p) { |
|
| 25 | + $j = ($k + 1)%$c; |
|
| 26 | + $a = $a + ($p->getX()*$pts[$j]->getY()) - ($p->getY()*$pts[$j]->getX()); |
|
| 27 | 27 | } |
| 28 | 28 | |
| 29 | - if ($signed) $area = ($a / 2); |
|
| 30 | - else $area = abs(($a / 2)); |
|
| 29 | + if ($signed) $area = ($a/2); |
|
| 30 | + else $area = abs(($a/2)); |
|
| 31 | 31 | |
| 32 | 32 | if ($exterior_only == TRUE) { |
| 33 | 33 | return $area; |
@@ -52,7 +52,7 @@ discard block |
||
| 52 | 52 | $pts = $exterior_ring->getComponents(); |
| 53 | 53 | |
| 54 | 54 | $c = count($pts); |
| 55 | - if((int)$c == '0') return NULL; |
|
| 55 | + if ((int) $c == '0') return NULL; |
|
| 56 | 56 | $cn = array('x' => '0', 'y' => '0'); |
| 57 | 57 | $a = $this->area(TRUE, TRUE); |
| 58 | 58 | |
@@ -61,15 +61,15 @@ discard block |
||
| 61 | 61 | return $this->exteriorRing()->pointN(1); |
| 62 | 62 | } |
| 63 | 63 | |
| 64 | - foreach($pts as $k => $p){ |
|
| 65 | - $j = ($k + 1) % $c; |
|
| 66 | - $P = ($p->getX() * $pts[$j]->getY()) - ($p->getY() * $pts[$j]->getX()); |
|
| 67 | - $cn['x'] = $cn['x'] + ($p->getX() + $pts[$j]->getX()) * $P; |
|
| 68 | - $cn['y'] = $cn['y'] + ($p->getY() + $pts[$j]->getY()) * $P; |
|
| 64 | + foreach ($pts as $k => $p) { |
|
| 65 | + $j = ($k + 1)%$c; |
|
| 66 | + $P = ($p->getX()*$pts[$j]->getY()) - ($p->getY()*$pts[$j]->getX()); |
|
| 67 | + $cn['x'] = $cn['x'] + ($p->getX() + $pts[$j]->getX())*$P; |
|
| 68 | + $cn['y'] = $cn['y'] + ($p->getY() + $pts[$j]->getY())*$P; |
|
| 69 | 69 | } |
| 70 | 70 | |
| 71 | - $cn['x'] = $cn['x'] / ( 6 * $a); |
|
| 72 | - $cn['y'] = $cn['y'] / ( 6 * $a); |
|
| 71 | + $cn['x'] = $cn['x']/(6*$a); |
|
| 72 | + $cn['y'] = $cn['y']/(6*$a); |
|
| 73 | 73 | |
| 74 | 74 | $centroid = new Point($cn['x'], $cn['y']); |
| 75 | 75 | return $centroid; |
@@ -85,10 +85,10 @@ discard block |
||
| 85 | 85 | |
| 86 | 86 | $max = array('length' => 0, 'point' => null); |
| 87 | 87 | |
| 88 | - foreach($this->getPoints() as $point) { |
|
| 88 | + foreach ($this->getPoints() as $point) { |
|
| 89 | 89 | $lineString = new LineString(array($centroid, $point)); |
| 90 | 90 | |
| 91 | - if($lineString->length() > $max['length']) { |
|
| 91 | + if ($lineString->length() > $max['length']) { |
|
| 92 | 92 | $max['length'] = $lineString->length(); |
| 93 | 93 | $max['point'] = $point; |
| 94 | 94 | } |
@@ -104,11 +104,11 @@ discard block |
||
| 104 | 104 | |
| 105 | 105 | public function numInteriorRings() { |
| 106 | 106 | if ($this->isEmpty()) return 0; |
| 107 | - return $this->numGeometries()-1; |
|
| 107 | + return $this->numGeometries() - 1; |
|
| 108 | 108 | } |
| 109 | 109 | |
| 110 | 110 | public function interiorRingN($n) { |
| 111 | - return $this->geometryN($n+1); |
|
| 111 | + return $this->geometryN($n + 1); |
|
| 112 | 112 | } |
| 113 | 113 | |
| 114 | 114 | public function dimension() { |
@@ -157,8 +157,8 @@ discard block |
||
| 157 | 157 | $intersections = 0; |
| 158 | 158 | $vertices_count = count($vertices); |
| 159 | 159 | |
| 160 | - for ($i=1; $i < $vertices_count; $i++) { |
|
| 161 | - $vertex1 = $vertices[$i-1]; |
|
| 160 | + for ($i = 1; $i < $vertices_count; $i++) { |
|
| 161 | + $vertex1 = $vertices[$i - 1]; |
|
| 162 | 162 | $vertex2 = $vertices[$i]; |
| 163 | 163 | if ($vertex1->y() == $vertex2->y() |
| 164 | 164 | && $vertex1->y() == $point->y() |
@@ -172,7 +172,7 @@ discard block |
||
| 172 | 172 | && $point->x() <= max($vertex1->x(), $vertex2->x()) |
| 173 | 173 | && $vertex1->y() != $vertex2->y()) { |
| 174 | 174 | $xinters = |
| 175 | - ($point->y() - $vertex1->y()) * ($vertex2->x() - $vertex1->x()) |
|
| 175 | + ($point->y() - $vertex1->y())*($vertex2->x() - $vertex1->x()) |
|
| 176 | 176 | / ($vertex2->y() - $vertex1->y()) |
| 177 | 177 | + $vertex1->x(); |
| 178 | 178 | if ($xinters == $point->x()) { |
@@ -185,7 +185,7 @@ discard block |
||
| 185 | 185 | } |
| 186 | 186 | } |
| 187 | 187 | // If the number of edges we passed through is even, then it's in the polygon. |
| 188 | - if ($intersections % 2 != 0) { |
|
| 188 | + if ($intersections%2 != 0) { |
|
| 189 | 189 | return TRUE; |
| 190 | 190 | } |
| 191 | 191 | else { |
@@ -194,7 +194,7 @@ discard block |
||
| 194 | 194 | } |
| 195 | 195 | |
| 196 | 196 | public function pointOnVertex($point) { |
| 197 | - foreach($this->getPoints() as $vertex) { |
|
| 197 | + foreach ($this->getPoints() as $vertex) { |
|
| 198 | 198 | if ($point->equals($vertex)) { |
| 199 | 199 | return true; |
| 200 | 200 | } |
@@ -139,17 +139,17 @@ |
||
| 139 | 139 | } |
| 140 | 140 | |
| 141 | 141 | // Not valid for this geometry type |
| 142 | - public function numGeometries() { return NULL; } |
|
| 143 | - public function geometryN($n) { return NULL; } |
|
| 144 | - public function startPoint() { return NULL; } |
|
| 145 | - public function endPoint() { return NULL; } |
|
| 146 | - public function isRing() { return NULL; } |
|
| 147 | - public function isClosed() { return NULL; } |
|
| 148 | - public function pointN($n) { return NULL; } |
|
| 149 | - public function exteriorRing() { return NULL; } |
|
| 142 | + public function numGeometries() { return NULL; } |
|
| 143 | + public function geometryN($n) { return NULL; } |
|
| 144 | + public function startPoint() { return NULL; } |
|
| 145 | + public function endPoint() { return NULL; } |
|
| 146 | + public function isRing() { return NULL; } |
|
| 147 | + public function isClosed() { return NULL; } |
|
| 148 | + public function pointN($n) { return NULL; } |
|
| 149 | + public function exteriorRing() { return NULL; } |
|
| 150 | 150 | public function numInteriorRings() { return NULL; } |
| 151 | - public function interiorRingN($n) { return NULL; } |
|
| 152 | - public function pointOnSurface() { return NULL; } |
|
| 153 | - public function explode() { return NULL; } |
|
| 151 | + public function interiorRingN($n) { return NULL; } |
|
| 152 | + public function pointOnSurface() { return NULL; } |
|
| 153 | + public function explode() { return NULL; } |
|
| 154 | 154 | } |
| 155 | 155 | |
@@ -147,8 +147,8 @@ discard block |
||
| 147 | 147 | // Note that the standard is 1 based indexing |
| 148 | 148 | public function geometryN($n) { |
| 149 | 149 | $n = intval($n); |
| 150 | - if (array_key_exists($n-1, $this->components)) { |
|
| 151 | - return $this->components[$n-1]; |
|
| 150 | + if (array_key_exists($n - 1, $this->components)) { |
|
| 151 | + return $this->components[$n - 1]; |
|
| 152 | 152 | } |
| 153 | 153 | else { |
| 154 | 154 | return NULL; |
@@ -279,16 +279,16 @@ discard block |
||
| 279 | 279 | |
| 280 | 280 | // Not valid for this geometry type |
| 281 | 281 | // -------------------------------- |
| 282 | - public function x() { return NULL; } |
|
| 283 | - public function y() { return NULL; } |
|
| 284 | - public function startPoint() { return NULL; } |
|
| 285 | - public function endPoint() { return NULL; } |
|
| 286 | - public function isRing() { return NULL; } |
|
| 287 | - public function isClosed() { return NULL; } |
|
| 288 | - public function pointN($n) { return NULL; } |
|
| 289 | - public function exteriorRing() { return NULL; } |
|
| 282 | + public function x() { return NULL; } |
|
| 283 | + public function y() { return NULL; } |
|
| 284 | + public function startPoint() { return NULL; } |
|
| 285 | + public function endPoint() { return NULL; } |
|
| 286 | + public function isRing() { return NULL; } |
|
| 287 | + public function isClosed() { return NULL; } |
|
| 288 | + public function pointN($n) { return NULL; } |
|
| 289 | + public function exteriorRing() { return NULL; } |
|
| 290 | 290 | public function numInteriorRings() { return NULL; } |
| 291 | - public function interiorRingN($n) { return NULL; } |
|
| 292 | - public function pointOnSurface() { return NULL; } |
|
| 291 | + public function interiorRingN($n) { return NULL; } |
|
| 292 | + public function pointOnSurface() { return NULL; } |
|
| 293 | 293 | } |
| 294 | 294 | |