@@ -36,7 +36,7 @@ discard block |
||
36 | 36 | /** |
37 | 37 | * @link http://www.thonky.com/qr-code-tutorial/alignment-pattern-locations |
38 | 38 | */ |
39 | - const alignmentPattern = [ 1 => // start at 1 |
|
39 | + const alignmentPattern = [1 => // start at 1 |
|
40 | 40 | [], |
41 | 41 | [6, 18], |
42 | 42 | [6, 22], |
@@ -57,14 +57,14 @@ discard block |
||
57 | 57 | [6, 30, 56, 82], |
58 | 58 | [6, 30, 58, 86], |
59 | 59 | [6, 34, 62, 90], |
60 | - [6, 28, 50, 72, 94], |
|
61 | - [6, 26, 50, 74, 98], |
|
60 | + [6, 28, 50, 72, 94], |
|
61 | + [6, 26, 50, 74, 98], |
|
62 | 62 | [6, 30, 54, 78, 102], |
63 | 63 | [6, 28, 54, 80, 106], |
64 | 64 | [6, 32, 58, 84, 110], |
65 | 65 | [6, 30, 58, 86, 114], |
66 | 66 | [6, 34, 62, 90, 118], |
67 | - [6, 26, 50, 74, 98, 122], |
|
67 | + [6, 26, 50, 74, 98, 122], |
|
68 | 68 | [6, 30, 54, 78, 102, 126], |
69 | 69 | [6, 26, 52, 78, 104, 130], |
70 | 70 | [6, 30, 56, 82, 108, 134], |
@@ -82,7 +82,7 @@ discard block |
||
82 | 82 | /** |
83 | 83 | * @link http://www.thonky.com/qr-code-tutorial/format-version-tables |
84 | 84 | */ |
85 | - const versionPattern = [ 7 => // no version pattern for QR Codes < 7 |
|
85 | + const versionPattern = [7 => // no version pattern for QR Codes < 7 |
|
86 | 86 | 0x07c94, 0x085bc, 0x09a99, 0x0a4d3, // 7-10 |
87 | 87 | 0x0bbf6, 0x0c762, 0x0d847, 0x0e60d, 0x0f928, 0x10b78, 0x1145d, 0x12a17, 0x13532, 0x149a6, |
88 | 88 | 0x15683, 0x168c9, 0x177ec, 0x18ec4, 0x191e1, 0x1afab, 0x1b08e, 0x1cc1a, 0x1d33f, 0x1ed75, |
@@ -297,8 +297,8 @@ discard block |
||
297 | 297 | |
298 | 298 | for($c = 0; $c < 3; $c++){ |
299 | 299 | for($i = 0; $i < 8; $i++){ |
300 | - $this->set($h[$c][0] , $h[$c][1] + $i, false, $t); |
|
301 | - $this->set($v[$c][0] - $i, $v[$c][1] , false, $t); |
|
300 | + $this->set($h[$c][0], $h[$c][1] + $i, false, $t); |
|
301 | + $this->set($v[$c][0] - $i, $v[$c][1], false, $t); |
|
302 | 302 | } |
303 | 303 | } |
304 | 304 | |
@@ -377,7 +377,7 @@ discard block |
||
377 | 377 | for($i = 0; $i < 18; $i++){ |
378 | 378 | $a = (int)floor($i / 3); |
379 | 379 | $b = $i % 3 + $this->moduleCount - 8 - 3; |
380 | - $v = !$test && (($bits >> $i) & 1) === 1; |
|
380 | + $v = !$test && (($bits >> $i)&1) === 1; |
|
381 | 381 | $t = $this::M_VERSION; |
382 | 382 | |
383 | 383 | $this->set($b, $a, $v, $t); // ne |
@@ -403,7 +403,7 @@ discard block |
||
403 | 403 | $t = $this::M_FORMAT; |
404 | 404 | |
405 | 405 | for($i = 0; $i < 15; $i++){ |
406 | - $v = !$test && (($bits >> $i) & 1) === 1; |
|
406 | + $v = !$test && (($bits >> $i)&1) === 1; |
|
407 | 407 | |
408 | 408 | if($i < 6){ |
409 | 409 | $this->set(8, $i, $v, $t); |
@@ -456,7 +456,7 @@ discard block |
||
456 | 456 | } |
457 | 457 | |
458 | 458 | $this->moduleCount += ($size * 2); |
459 | - $r = array_fill(0, $this->moduleCount, $t); |
|
459 | + $r = array_fill(0, $this->moduleCount, $t); |
|
460 | 460 | |
461 | 461 | for($i = 0; $i < $size; $i++){ |
462 | 462 | array_unshift($this->matrix, $r); |
@@ -481,7 +481,7 @@ discard block |
||
481 | 481 | $byteCount = count($data); |
482 | 482 | $size = $this->moduleCount - 1; |
483 | 483 | |
484 | - for($i = $size, $y = $size, $inc = -1, $byteIndex = 0, $bitIndex = 7; $i > 0; $i -= 2){ |
|
484 | + for($i = $size, $y = $size, $inc = -1, $byteIndex = 0, $bitIndex = 7; $i > 0; $i -= 2){ |
|
485 | 485 | |
486 | 486 | if($i === 6){ |
487 | 487 | $i--; |
@@ -495,7 +495,7 @@ discard block |
||
495 | 495 | $v = false; |
496 | 496 | |
497 | 497 | if($byteIndex < $byteCount){ |
498 | - $v = (($data[$byteIndex] >> $bitIndex) & 1) === 1; |
|
498 | + $v = (($data[$byteIndex] >> $bitIndex)&1) === 1; |
|
499 | 499 | } |
500 | 500 | |
501 | 501 | if($this->getMask($x, $y, $maskPattern) === 0){ |
@@ -516,7 +516,7 @@ discard block |
||
516 | 516 | $y += $inc; |
517 | 517 | |
518 | 518 | if($y < 0 || $this->moduleCount <= $y){ |
519 | - $y -= $inc; |
|
519 | + $y -= $inc; |
|
520 | 520 | $inc = -$inc; |
521 | 521 | |
522 | 522 | break; |