@@ -371,22 +371,24 @@ export class QrCode {
371371 if (
372372 boostEcl &&
373373 dataUsedBits <= QrCode . getNumDataCodewords ( version , newEcl ) * 8
374- )
374+ ) {
375375 ecl = newEcl ;
376+ }
376377 }
377378
378379 // Concatenate all segments to create the data bit string
379380 const bb : number [ ] = [ ] ;
380381 for ( const seg of segs ) {
381382 appendBits ( seg . mode . modeBits , 4 , bb ) ;
382383 appendBits ( seg . numChars , seg . mode . numCharCountBits ( version ) , bb ) ;
383- for ( const b of seg . getData ( ) ) bb . push ( b ) ;
384+ for ( const b of seg . getData ( ) ) {
385+ bb . push ( b ) ;
386+ }
384387 }
385388 assert ( bb . length == dataUsedBits ) ;
386389
387390 // Add terminator and pad up to a byte if applicable
388- const dataCapacityBits : number =
389- QrCode . getNumDataCodewords ( version , ecl ) * 8 ;
391+ const dataCapacityBits = QrCode . getNumDataCodewords ( version , ecl ) * 8 ;
390392 assert ( bb . length <= dataCapacityBits ) ;
391393 appendBits ( 0 , Math . min ( 4 , dataCapacityBits - bb . length ) , bb ) ;
392394 appendBits ( 0 , ( 8 - ( bb . length % 8 ) ) % 8 , bb ) ;
@@ -397,15 +399,16 @@ export class QrCode {
397399 let padByte = 0xec ;
398400 bb . length < dataCapacityBits ;
399401 padByte ^= 0xec ^ 0x11
400- )
402+ ) {
401403 appendBits ( padByte , 8 , bb ) ;
404+ }
402405
403406 // Pack bits numbero bytes in big endian
404407 const dataCodewords : number [ ] = [ ] ;
405- while ( dataCodewords . length * 8 < bb . length ) dataCodewords . push ( 0 ) ;
406- bb . forEach (
407- ( b : number , i : number ) => ( dataCodewords [ i >>> 3 ] |= b << ( 7 - ( i & 7 ) ) ) ,
408- ) ;
408+ while ( dataCodewords . length * 8 < bb . length ) {
409+ dataCodewords . push ( 0 ) ;
410+ }
411+ bb . forEach ( ( b , i ) => ( dataCodewords [ i >>> 3 ] |= b << ( 7 - ( i & 7 ) ) ) ) ;
409412
410413 // Create the QR Code object
411414 return new QrCode ( version , ecl , dataCodewords , mask ) ;
@@ -459,7 +462,9 @@ export class QrCode {
459462 // Check scalar arguments
460463 if ( version < QrCode . MIN_VERSION || version > QrCode . MAX_VERSION )
461464 throw new RangeError ( 'Version value out of range' ) ;
462- if ( msk < - 1 || msk > 7 ) throw new RangeError ( 'Mask value out of range' ) ;
465+ if ( msk < - 1 || msk > 7 ) {
466+ throw new RangeError ( 'Mask value out of range' ) ;
467+ }
463468 this . size = version * 4 + 17 ;
464469
465470 // Initialize both grids to be size*size arrays of Boolean false
@@ -558,7 +563,9 @@ export class QrCode {
558563 // Calculate error correction code and pack bits
559564 const data : number = ( this . errorCorrectionLevel . formatBits << 3 ) | mask ; // errCorrLvl is unumber2, mask is unumber3
560565 let rem : number = data ;
561- for ( let i = 0 ; i < 10 ; i ++ ) rem = ( rem << 1 ) ^ ( ( rem >>> 9 ) * 0x537 ) ;
566+ for ( let i = 0 ; i < 10 ; i ++ ) {
567+ rem = ( rem << 1 ) ^ ( ( rem >>> 9 ) * 0x537 ) ;
568+ }
562569 const bits = ( ( data << 10 ) | rem ) ^ 0x5412 ; // unumber15
563570 assert ( bits >>> 15 == 0 ) ;
564571
@@ -567,14 +574,16 @@ export class QrCode {
567574 this . setFunctionModule ( 8 , 7 , getBit ( bits , 6 ) ) ;
568575 this . setFunctionModule ( 8 , 8 , getBit ( bits , 7 ) ) ;
569576 this . setFunctionModule ( 7 , 8 , getBit ( bits , 8 ) ) ;
570- for ( let i = 9 ; i < 15 ; i ++ )
577+ for ( let i = 9 ; i < 15 ; i ++ ) {
571578 this . setFunctionModule ( 14 - i , 8 , getBit ( bits , i ) ) ;
572-
579+ }
573580 // Draw second copy
574- for ( let i = 0 ; i < 8 ; i ++ )
581+ for ( let i = 0 ; i < 8 ; i ++ ) {
575582 this . setFunctionModule ( this . size - 1 - i , 8 , getBit ( bits , i ) ) ;
576- for ( let i = 8 ; i < 15 ; i ++ )
583+ }
584+ for ( let i = 8 ; i < 15 ; i ++ ) {
577585 this . setFunctionModule ( 8 , this . size - 15 + i , getBit ( bits , i ) ) ;
586+ }
578587 this . setFunctionModule ( 8 , this . size - 8 , true ) ; // Always dark
579588 }
580589
@@ -587,7 +596,9 @@ export class QrCode {
587596
588597 // Calculate error correction code and pack bits
589598 let rem : number = this . version ; // version is unumber6, in the range [7, 40]
590- for ( let i = 0 ; i < 12 ; i ++ ) rem = ( rem << 1 ) ^ ( ( rem >>> 11 ) * 0x1f25 ) ;
599+ for ( let i = 0 ; i < 12 ; i ++ ) {
600+ rem = ( rem << 1 ) ^ ( ( rem >>> 11 ) * 0x1f25 ) ;
601+ }
591602 const bits : number = ( this . version << 12 ) | rem ; // unumber18
592603 assert ( bits >>> 18 == 0 ) ;
593604
0 commit comments