@@ -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, |
@@ -295,8 +295,8 @@ discard block |
||
295 | 295 | |
296 | 296 | for($c = 0; $c < 3; $c++){ |
297 | 297 | for($i = 0; $i < 8; $i++){ |
298 | - $this->set($h[$c][0] , $h[$c][1] + $i, false, $this::M_SEPARATOR); |
|
299 | - $this->set($v[$c][0] - $i, $v[$c][1] , false, $this::M_SEPARATOR); |
|
298 | + $this->set($h[$c][0], $h[$c][1] + $i, false, $this::M_SEPARATOR); |
|
299 | + $this->set($v[$c][0] - $i, $v[$c][1], false, $this::M_SEPARATOR); |
|
300 | 300 | } |
301 | 301 | } |
302 | 302 | |
@@ -373,7 +373,7 @@ discard block |
||
373 | 373 | for($i = 0; $i < 18; $i++){ |
374 | 374 | $a = (int)floor($i / 3); |
375 | 375 | $b = $i % 3 + $this->moduleCount - 8 - 3; |
376 | - $v = !$test && (($bits >> $i) & 1) === 1; |
|
376 | + $v = !$test && (($bits >> $i)&1) === 1; |
|
377 | 377 | |
378 | 378 | $this->set($b, $a, $v, $this::M_VERSION); // ne |
379 | 379 | $this->set($a, $b, $v, $this::M_VERSION); // sw |
@@ -398,7 +398,7 @@ discard block |
||
398 | 398 | $t = $this::M_FORMAT; |
399 | 399 | |
400 | 400 | for($i = 0; $i < 15; $i++){ |
401 | - $v = !$test && (($bits >> $i) & 1) === 1; |
|
401 | + $v = !$test && (($bits >> $i)&1) === 1; |
|
402 | 402 | |
403 | 403 | if($i < 6){ |
404 | 404 | $this->set(8, $i, $v, $t); |
@@ -452,7 +452,7 @@ discard block |
||
452 | 452 | } |
453 | 453 | |
454 | 454 | $this->moduleCount += ($size * 2); |
455 | - $r = array_fill(0, $this->moduleCount, $t); |
|
455 | + $r = array_fill(0, $this->moduleCount, $t); |
|
456 | 456 | |
457 | 457 | for($i = 0; $i < $size; $i++){ |
458 | 458 | array_unshift($this->matrix, $r); |
@@ -477,7 +477,7 @@ discard block |
||
477 | 477 | $byteCount = count($data); |
478 | 478 | $size = $this->moduleCount - 1; |
479 | 479 | |
480 | - for($i = $size, $y = $size, $inc = -1, $byteIndex = 0, $bitIndex = 7; $i > 0; $i -= 2){ |
|
480 | + for($i = $size, $y = $size, $inc = -1, $byteIndex = 0, $bitIndex = 7; $i > 0; $i -= 2){ |
|
481 | 481 | |
482 | 482 | if($i === 6){ |
483 | 483 | $i--; |
@@ -491,7 +491,7 @@ discard block |
||
491 | 491 | $v = false; |
492 | 492 | |
493 | 493 | if($byteIndex < $byteCount){ |
494 | - $v = (($data[$byteIndex] >> $bitIndex) & 1) === 1; |
|
494 | + $v = (($data[$byteIndex] >> $bitIndex)&1) === 1; |
|
495 | 495 | } |
496 | 496 | |
497 | 497 | if($this->getMask($x, $y, $maskPattern) === 0){ |
@@ -512,7 +512,7 @@ discard block |
||
512 | 512 | $y += $inc; |
513 | 513 | |
514 | 514 | if($y < 0 || $this->moduleCount <= $y){ |
515 | - $y -= $inc; |
|
515 | + $y -= $inc; |
|
516 | 516 | $inc = -$inc; |
517 | 517 | |
518 | 518 | break; |