PageSourceSearch

https://electricfireplacesdepot.com/cdn/shopifycloud/checkout-web/assets/c1/dee982c9.kOR4j4QG.js

js electricfireplacesdepot.com collected 2026-10-03 21:30:40 UTC 11,635 bytes, 1 lines download raw bytes

vendor: 11,635 bytes, line 1
1var t,e;(t=>{const e=class e{constructor(t,r,s,n){if(this.version=t,this.errorCorrectionLevel=r,this.modules=[],this.isFunction=[],t<e.MIN_VERSION||t>e.MAX_VERSION)throw new RangeError("Version value out of range");if(n<-1||n>7)throw new RangeError("Mask value out of range");this.size=4*t+17;let i=[];for(let e=0;e<this.size;e++)i.push(!1);for(let e=0;e<this.size;e++)this.modules.push(i.slice()),this.isFunction.push(i.slice());this.drawFunctionPatterns();const a=this.addEccAndInterleave(s);if(this.drawCodewords(a),-1==n){let t=1e9;for(let e=0;e<8;e++){this.applyMask(e),this.drawFormatBits(e);const r=this.getPenaltyScore();r<t&&(n=e,t=r),this.applyMask(e)}}o(0<=n&&n<=7),this.mask=n,this.applyMask(n),this.drawFormatBits(n),this.isFunction=[]}static encodeText(r,s){const n=t.QrSegment.makeSegments(r);return e.encodeSegments(n,s)}static encodeBinary(r,s){const n=t.QrSegment.makeBytes(r);return e.encodeSegments([n],s)}static encodeSegments(t,r,n=1,i=40,l=-1,h=!0){if(!(e.MIN_VERSION<=n&&n<=i&&i<=e.MAX_VERSION)||l<-1||l>7)throw new RangeError("Invalid value");let u,c;for(u=n;;u++){const s=8*e.getNumDataCodewords(u,r),n=a.getTotalBits(t,u);if(n<=s){c=n;break}if(u>=i)throw new RangeError("Data too long")}for(const s of[e.Ecc.MEDIUM,e.Ecc.QUARTILE,e.Ecc.HIGH])h&&c<=8*e.getNumDataCodewords(u,s)&&(r=s);let d=[];for(const e of t){s(e.mode.modeBits,4,d),s(e.numChars,e.mode.numCharCountBits(u),d);for(const t of e.getData())d.push(t)}o(d.length==c);const f=8*e.getNumDataCodewords(u,r);o(d.length<=f),s(0,Math.min(4,f-d.length),d),s(0,(8-d.length%8)%8,d),o(d.length%8==0);for(let e=236;d.length<f;e^=253)s(e,8,d);let m=[];for(;8*m.length<d.length;)m.push(0);return d.forEach((t,e)=>m[e>>>3]|=t<<7-(7&e)),new e(u,r,m,l)}getModule(t,e){return 0<=t&&t<this.size&&0<=e&&e<this.size&&this.modules[e][t]}getModules(){return this.modules}drawFunctionPatterns(){for(let r=0;r<this.size;r++)this.setFunctionModule(6,r,r%2==0),this.setFunctionModule(r,6,r%2==0);this.drawFinderPattern(3,3),this.drawFinderPattern(this.size-4,3),this.drawFinderPattern(3,this.size-4);const t=this.getAlignmentPatternPositions(),e=t.length;for(let r=0;r<e;r++)for(let s=0;s<e;s++)0==r&&0==s||0==r&&s==e-1||r==e-1&&0==s||this.drawAlignmentPattern(t[r],t[s]);this.drawFormatBits(0),this.drawVersion()}drawFormatBits(t){const e=this.errorCorrectionLevel.formatBits<<3|t;let r=e;for(let n=0;n<10;n++)r=r<<1^1335*(r>>>9);const s=21522^(e<<10|r);o(s>>>15==0);for(let o=0;o<=5;o++)this.setFunctionModule(8,o,n(s,o));this.setFunctionModule(8,7,n(s,6)),this.setFunctionModule(8,8,n(s,7)),this.setFunctionModule(7,8,n(s,8));for(let o=9;o<15;o++)this.setFunctionModule(14-o,8,n(s,o));for(let o=0;o<8;o++)this.setFunctionModule(this.size-1-o,8,n(s,o));for(let o=8;o<15;o++)this.setFunctionModule(8,this.size-15+o,n(s,o));this.setFunctionModule(8,this.size-8,!0)}drawVersion(){if(this.version<7)return;let t=this.version;for(let r=0;r<12;r++)t=t<<1^7973*(t>>>11);const e=this.version<<12|t;o(e>>>18==0);for(let r=0;r<18;r++){const t=n(e,r),s=this.size-11+r%3,o=Math.floor(r/3);this.setFunctionModule(s,o,t),this.setFunctionModule(o,s,t)}}drawFinderPattern(t,e){for(let r=-4;r<=4;r++)for(let s=-4;s<=4;s++){const n=Math.max(Math.abs(s),Math.abs(r)),o=t+s,i=e+r;0<=o&&o<this.size&&0<=i&&i<this.size&&this.setFunctionModule(o,i,2!=n&&4!=n)}}drawAlignmentPattern(t,e){for(let r=-2;r<=2;r++)for(let s=-2;s<=2;s++)this.setFunctionModule(t+s,e+r,1!=Math.max(Math.abs(s),Math.abs(r)))}setFunctionModule(t,e,r){this.modules[e][t]=r,this.isFunction[e][t]=!0}addEccAndInterleave(t){const r=this.version,s=this.errorCorrectionLevel;if(t.length!=e.getNumDataCodewords(r,s))throw new RangeError("Invalid argument");const n=e.NUM_ERROR_CORRECTION_BLOCKS[s.ordinal][r],i=e.ECC_CODEWORDS_PER_BLOCK[s.ordinal][r],a=Math.floor(e.getNumRawDataModules(r)/8),l=n-a%n,h=Math.floor(a/n);let u=[];const c=e.reedSolomonComputeDivisor(i);for(let o=0,f=0;o<n;o++){let r=t.slice(f,f+h-i+(o<l?0:1));f+=r.length;const s=e.reedSolomonComputeRemainder(r,c);o<l&&r.push(0),u.push(r.concat(s))}let d=[];for(let e=0;e<u[0].length;e++)u.forEach((t,r)=>{(e!=h-i||r>=l)&&d.push(t[e])});return o(d.length==a),d}drawCodewords(t){if(t.length!=Math.floor(e.getNumRawDataModules(this.version)/8))throw new RangeError("Invalid argument");let r=0;for(let e=this.size-1;e>=1;e-=2){6==e&&(e=5);for(let s=0;s<this.size;s++)for(let o=0;o<2;o++){const i=e-o,a=e+1&2?s:this.size-1-s;!this.isFunction[a][i]&&r<8*t.length&&(this.modules[a][i]=n(t[r>>>3],7-(7&r)),r++)}}o(r==8*t.length)}applyMask(t){if(t<0||t>7)throw new RangeError("Mask value out of range");for(let e=0;e<this.size;e++)for(let r=0;r<this.size;r++){let s;switch(t){case 0:s=(r+e)%2==0;break;case 1:s=e%2==0;break;case 2:s=r%3==0;break;case 3:s=(r+e)%3==0;break;case 4:s=(Math.floor(r/3)+Math.floor(e/2))%2==0;break;case 5:s=r*e%2+r*e%3==0;break;case 6:s=(r*e%2+r*e%3)%2==0;break;case 7:s=((r+e)%2+r*e%3)%2==0;break;default:throw new Error("Unreachable")}!this.isFunction[e][r]&&s&&(this.modules[e][r]=!this.modules[e][r])}}getPenaltyScore(){let t=0;for(let o=0;o<this.size;o++){let r=!1,s=0,n=[0,0,0,0,0,0,0];for(let i=0;i<this.size;i++)this.modules[o][i]==r?(s++,5==s?t+=e.PENALTY_N1:s>5&&t++):(this.finderPenaltyAddHistory(s,n),r||(t+=this.finderPenaltyCountPatterns(n)*e.PENALTY_N3),r=this.modules[o][i],s=1);t+=this.finderPenaltyTerminateAndCount(r,s,n)*e.PENALTY_N3}for(let o=0;o<this.size;o++){let r=!1,s=0,n=[0,0,0,0,0,0,0];for(let i=0;i<this.size;i++)this.modules[i][o]==r?(s++,5==s?t+=e.PENALTY_N1:s>5&&t++):(this.finderPenaltyAddHistory(s,n),r||(t+=this.finderPenaltyCountPatterns(n)*e.PENALTY_N3),r=this.modules[i][o],s=1);t+=this.finderPenaltyTerminateAndCount(r,s,n)*e.PENALTY_N3}for(let o=0;o<this.size-1;o++)for(let r=0;r<this.size-1;r++){const s=this.modules[o][r];s==this.modules[o][r+1]&&s==this.modules[o+1][r]&&s==this.modules[o+1][r+1]&&(t+=e.PENALTY_N2)}let r=0;for(const e of this.modules)r=e.reduce((t,e)=>t+(e?1:0),r);const s=this.size*this.size,n=Math.ceil(Math.abs(20*r-10*s)/s)-1;return o(0<=n&&n<=9),t+=n*e.PENALTY_N4,o(0<=t&&t<=2568888),t}getAlignmentPatternPositions(){if(1==this.version)return[];{const t=Math.floor(this.version/7)+2,e=32==this.version?26:2*Math.ceil((4*this.version+4)/(2*t-2));let r=[6];for(let s=this.size-7;r.length<t;s-=e)r.splice(1,0,s);return r}}static getNumRawDataModules(t){if(t<e.MIN_VERSION||t>e.MAX_VERSION)throw new RangeError("Version number out of range");let r=(16*t+128)*t+64;if(t>=2){const e=Math.floor(t/7)+2;r-=(25*e-10)*e-55,t>=7&&(r-=36)}return o(208<=r&&r<=29648),r}static getNumDataCodewords(t,r){return Math.floor(e.getNumRawDataModules(t)/8)-e.ECC_CODEWORDS_PER_BLOCK[r.ordinal][t]*e.NUM_ERROR_CORRECTION_BLOCKS[r.ordinal][t]}static reedSolomonComputeDivisor(t){if(t<1||t>255)throw new RangeError("Degree out of range");let r=[];for(let e=0;e<t-1;e++)r.push(0);r.push(1);let s=1;for(let n=0;n<t;n++){for(let t=0;t<r.length;t++)r[t]=e.reedSolomonMultiply(r[t],s),t+1<r.length&&(r[t]^=r[t+1]);s=e.reedSolomonMultiply(s,2)}return r}static reedSolomonComputeRemainder(t,r){let s=r.map(t=>0);for(const n of t){const t=n^s.shift();s.push(0),r.forEach((r,n)=>s[n]^=e.reedSolomonMultiply(r,t))}return s}static reedSolomonMultiply(t,e){if(t>>>8!=0||e>>>8!=0)throw new RangeError("Byte out of range");let r=0;for(let s=7;s>=0;s--)r=r<<1^285*(r>>>7),r^=(e>>>s&1)*t;return o(r>>>8==0),r}finderPenaltyCountPatterns(t){const e=t[1];o(e<=3*this.size);const r=e>0&&t[2]==e&&t[3]==3*e&&t[4]==e&&t[5]==e;return(r&&t[0]>=4*e&&t[6]>=e?1:0)+(r&&t[6]>=4*e&&t[0]>=e?1:0)}finderPenaltyTerminateAndCount(t,e,r){return t&&(this.finderPenaltyAddHistory(e,r),e=0),e+=this.size,this.finderPenaltyAddHistory(e,r),this.finderPenaltyCountPatterns(r)}finderPenaltyAddHistory(t,e){0==e[0]&&(t+=this.size),e.pop(),e.unshift(t)}};e.MIN_VERSION=1,e.MAX_VERSION=40,e.PENALTY_N1=3,e.PENALTY_N2=3,e.PENALTY_N3=40,e.PENALTY_N4=10,e.ECC_CODEWORDS_PER_BLOCK=[[-1,7,10,15,20,26,18,20,24,30,18,20,24,26,30,22,24,28,30,28,28,28,28,30,30,26,28,30,30,30,30,30,30,30,30,30,30,30,30,30,30],[-1,10,16,26,18,24,16,18,22,22,26,30,22,22,24,24,28,28,26,26,26,26,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28],[-1,13,22,18,26,18,24,18,22,20,24,28,26,24,20,30,24,28,28,26,30,28,30,30,30,30,28,30,30,30,30,30,30,30,30,30,30,30,30,30,30],[-1,17,28,22,16,22,28,26,26,24,28,24,28,22,24,24,30,28,28,26,28,30,24,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30]],e.NUM_ERROR_CORRECTION_BLOCKS=[[-1,1,1,1,1,1,2,2,2,2,4,4,4,4,4,6,6,6,6,7,8,8,9,9,10,12,12,12,13,14,15,16,17,18,19,19,20,21,22,24,25],[-1,1,1,1,2,2,4,4,4,5,5,5,8,9,9,10,10,11,13,14,16,17,17,18,20,21,23,25,26,28,29,31,33,35,37,38,40,43,45,47,49],[-1,1,1,2,2,4,4,6,6,8,8,8,10,12,16,12,17,16,18,21,20,23,23,25,27,29,34,34,35,38,40,43,45,48,51,53,56,59,62,65,68],[-1,1,1,2,4,4,4,5,6,8,8,11,11,16,16,18,16,19,21,25,25,25,34,30,32,35,37,40,42,45,48,51,54,57,60,63,66,70,74,77,81]];let r=e;function s(t,e,r){if(e<0||e>31||t>>>e!=0)throw new RangeError("Value out of range");for(let s=e-1;s>=0;s--)r.push(t>>>s&1)}function n(t,e){return!!(t>>>e&1)}function o(t){if(!t)throw new Error("Assertion error")}t.QrCode=r;const i=class t{constructor(t,e,r){if(this.mode=t,this.numChars=e,this.bitData=r,e<0)throw new RangeError("Invalid argument");this.bitData=r.slice()}static makeBytes(e){let r=[];for(const t of e)s(t,8,r);return new t(t.Mode.BYTE,e.length,r)}static makeNumeric(e){if(!t.isNumeric(e))throw new RangeError("String contains non-numeric characters");let r=[];for(let t=0;t<e.length;){const n=Math.min(e.length-t,3);s(parseInt(e.substring(t,t+n),10),3*n+1,r),t+=n}return new t(t.Mode.NUMERIC,e.length,r)}static makeAlphanumeric(e){if(!t.isAlphanumeric(e))throw new RangeError("String contains unencodable characters in alphanumeric mode");let r,n=[];for(r=0;r+2<=e.length;r+=2){let o=45*t.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r));o+=t.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r+1)),s(o,11,n)}return r<e.length&&s(t.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r)),6,n),new t(t.Mode.ALPHANUMERIC,e.length,n)}static makeSegments(e){return""==e?[]:t.isNumeric(e)?[t.makeNumeric(e)]:t.isAlphanumeric(e)?[t.makeAlphanumeric(e)]:[t.makeBytes(t.toUtf8ByteArray(e))]}static makeEci(e){let r=[];if(e<0)throw new RangeError("ECI assignment value out of range");if(e<128)s(e,8,r);else if(e<16384)s(2,2,r),s(e,14,r);else{if(!(e<1e6))throw new RangeError("ECI assignment value out of range");s(6,3,r),s(e,21,r)}return new t(t.Mode.ECI,0,r)}static isNumeric(e){return t.NUMERIC_REGEX.test(e)}static isAlphanumeric(e){return t.ALPHANUMERIC_REGEX.test(e)}getData(){return this.bitData.slice()}static getTotalBits(t,e){let r=0;for(const s of t){const t=s.mode.numCharCountBits(e);if(s.numChars>=1<<t)return 1/0;r+=4+t+s.bitData.length}return r}static toUtf8ByteArray(t){t=encodeURI(t);let e=[];for(let r=0;r<t.length;r++)"%"!=t.charAt(r)?e.push(t.charCodeAt(r)):(e.push(parseInt(t.substring(r+1,r+3),16)),r+=2);return e}};i.NUMERIC_REGEX=/^[0-9]*$/,i.ALPHANUMERIC_REGEX=/^[A-Z0-9 $%*+.\/:-]*$/,i.ALPHANUMERIC_CHARSET="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";let a=i;t.QrSegment=a})(t||(t={})),(t=>{const e=class{constructor(t,e){this.ordinal=t,this.formatBits=e}};e.LOW=new e(0,1),e.MEDIUM=new e(1,0),e.QUARTILE=new e(2,3),e.HIGH=new e(3,2);let r=e;t.Ecc=r})((e=t||(t={})).QrCode||(e.QrCode={})),(t=>{(t=>{const e=class{constructor(t,e){this.modeBits=t,this.numBitsCharCount=e}numCharCountBits(t){return this.numBitsCharCount[Math.floor((t+7)/17)]}};e.NUMERIC=new e(1,[10,12,14]),e.ALPHANUMERIC=new e(2,[9,11,13]),e.BYTE=new e(4,[8,16,16]),e.KANJI=new e(8,[8,10,12]),e.ECI=new e(7,[0,0,0]);let r=e;t.Mode=r})(t.QrSegment||(t.QrSegment={}))})(t||(t={}));const r=t;export{r as default};

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.