There is an increasing count of applications which use Authy for two-factor authentication. However many users who aren't using Authy, have their own authenticator setup up already and do not wish to use two applications for generating passwords.
Since I use 1Password for all of my password storing/generating needs, I was looking for a solution to use Authy passwords on that. I couldn't find any completely working solutions, however I stumbled upon a gist by Brian Hartvigsen. His post had a neat code with it to generate QR codes (beware, through Google) for you to use on your favorite authenticator.
His method is to extract the secret keys using Authy's Google Chrome app via Developer Tools. If this was not possible, I guess people would be reverse engineering the Android app or something like that. But when I tried that code, nothing appeared on the screen. My guess is that Brian used the code to extract the keys that weren't necessarily tied to Authy.
I had to adapt the code a little and you can see the result below, but here's what I discovered about Authy's method:
- They use the exact same algorithm to generate passwords as Google Authenticator and similar (TOTP)
- The passwords are one digit longer - 7 digits (usually they're 6, with exceptions), but if you've looked at one of the Authy generated passwords already, you probably noticed it too
- The password validity period is 10 seconds (instead of usual 30). Authy shows 20 seconds, but that means a slightly different thing. Don't substitute this period longer in your Authenticator.
- Authy's secret keys are in hex already, so they need to be turned back to base32 for working QR codes
So as long as you have an authenticator which can do longer passwords than 6 characters and do custom time periods, then congratulations, you can use the following method. If you are not sure, scan this code with your authenticator to test. Don't forget to delete it afterwards. The code should have 7 digits and should change every 10 seconds.
Known to work:
- 1Password for OS X
- 1Password for iOS
- Google Authenticator
Known not to work:
- 1Password for Windows (doesn't support other digit counts and timeouts yet)
- Authy for iOS (doesn't support other timeouts than 30s, the irony!)
This method has only one gotcha - if you want add a new service that relies on Authy, you will need to run Authy again. I am assuming you know how to use Authy and have some services added already. You can probably get rid of Authy on your phone and log in to Authy on your Chrome app using SMS or keep it permanently disabled under your extensions once you have logged in. In that case set a master password for Authy, stay secure.
-
Install Authy from Chrome Web Store
-
Open Authy and log in, so you can see the codes being generated for you
-
Go to Extensions page in your browser (
chrome://extensions/or Menu -> More tools -> Extensions) -
Tick developer mode in top right corner
-
Find Authy from the list and then click on
main.html -
Chrome developer tools with Console selected should open. If it didn't, go to Console tab.
-
Paste following and press enter: (Un-minified code can be found at the bottom)
function quintetCount(e){var t=Math.floor(e.length/5);return e.length%5==0?t:t+1}function hexToInt(e){for(var t=[],n=0;n<e.length;n+=2)t.push(parseInt(e.substr(n,2),16));return t}function hexToB32(e){return encode(hexToInt(e))}var charTable="ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";encode=function(e){for(var t=0,n=0,o=0,r=0,a=new Array(8*quintetCount(e));t<e.length;){var c=e[t];o>3?(r=c&255>>o,o=(o+5)%8,r=r<<o|(t+1<e.length?e[t+1]:0)>>8-o,t++):(r=c>>8-(o+5)&31,o=(o+5)%8,0==o&&t++),a[n]=charTable.charAt(r),n++}return a.join("")},appManager.getModel().forEach(function(e){e.markedForDeletion===!1?console.log("otpauth://totp/"+encodeURIComponent(e.name)+"?secret="+e.decryptedSeed+"&issuer="+e.accountType):console.log("otpauth://totp/"+encodeURIComponent(e.name)+"?secret="+hexToB32(e.secretSeed)+"&issuer="+e.accountType+"&digits=8&period=10")});
-
The console will generate a list of
otpauth://URLs. -
Close opened window and developer tools.
-
Disable Authy app on Chrome or remove it
-
Disable Developer mode
In step 7 above, paste this code and press enter:
!function(j,q){"object"==typeof exports&&"undefined"!=typeof module?module.exports=q():"function"==typeof define&&define.amd?define(q):j.QRious=q()}(this,function(){"use strict";function j(ca,da){var ea;return"function"==typeof Object.create?ea=Object.create(ca):(C.prototype=ca,ea=new C,C.prototype=null),da&&x(!0,ea,da),ea}function x(ca,da,ea){for(var fa,ga,ha=0,ia=(ea=E.call(arguments,2)).length;ha<ia;ha++)for(fa in ga=ea[ha],ga)ca&&!D.call(ga,fa)||(da[fa]=ga[fa])}function z(){}var C=function(){},D=Object.prototype.hasOwnProperty,E=Array.prototype.slice;z.class_="Nevis",z.super_=Object,z.extend=function(ca,da,ea,fa){var ga=this;return"string"!=typeof ca&&(fa=ea,ea=da,da=ca,ca=null),"function"!=typeof da&&(fa=ea,ea=da,da=function(){return ga.apply(this,arguments)}),x(!1,da,ga,fa),da.prototype=j(ga.prototype,ea),da.prototype.constructor=da,da.class_=ca||ga.class_,da.super_=ga,da};var G=z,H=G.extend(function(ca,da,ea){this.qrious=ca,this.element=da,this.element.qrious=ca,this.enabled=!!ea},{draw:function(){},getElement:function(){return this.enabled||(this.enabled=!0,this.render()),this.element},getModuleSize:function(ca){var da=this.qrious,ea=da.padding||0,fa=Math.floor((da.size-2*ea)/ca.width);return Math.max(1,fa)},getOffset:function(ca){var da=this.qrious,ea=da.padding;if(null!=ea)return ea;var fa=this.getModuleSize(ca),ga=Math.floor((da.size-fa*ca.width)/2);return Math.max(0,ga)},render:function(ca){this.enabled&&(this.resize(),this.reset(),this.draw(ca))},reset:function(){},resize:function(){}}),I=H.extend({draw:function(ca){var da,ea,fa=this.qrious,ga=this.getModuleSize(ca),ha=this.getOffset(ca),ia=this.element.getContext("2d");for(ia.fillStyle=fa.foreground,ia.globalAlpha=fa.foregroundAlpha,da=0;da<ca.width;da++)for(ea=0;ea<ca.width;ea++)ca.buffer[ea*ca.width+da]&&ia.fillRect(ga*da+ha,ga*ea+ha,ga,ga)},reset:function(){var ca=this.qrious,da=this.element.getContext("2d"),ea=ca.size;da.lineWidth=1,da.clearRect(0,0,ea,ea),da.fillStyle=ca.background,da.globalAlpha=ca.backgroundAlpha,da.fillRect(0,0,ea,ea)},resize:function(){var ca=this.element;ca.width=ca.height=this.qrious.size}}),J=G.extend(null,{BLOCK:[0,11,15,19,23,27,31,16,18,20,22,24,26,28,20,22,24,24,26,28,28,22,24,24,26,26,28,28,24,24,26,26,26,28,28,24,26,26,26,28,28]}),K=G.extend(null,{BLOCKS:[1,0,19,7,1,0,16,10,1,0,13,13,1,0,9,17,1,0,34,10,1,0,28,16,1,0,22,22,1,0,16,28,1,0,55,15,1,0,44,26,2,0,17,18,2,0,13,22,1,0,80,20,2,0,32,18,2,0,24,26,4,0,9,16,1,0,108,26,2,0,43,24,2,2,15,18,2,2,11,22,2,0,68,18,4,0,27,16,4,0,19,24,4,0,15,28,2,0,78,20,4,0,31,18,2,4,14,18,4,1,13,26,2,0,97,24,2,2,38,22,4,2,18,22,4,2,14,26,2,0,116,30,3,2,36,22,4,4,16,20,4,4,12,24,2,2,68,18,4,1,43,26,6,2,19,24,6,2,15,28,4,0,81,20,1,4,50,30,4,4,22,28,3,8,12,24,2,2,92,24,6,2,36,22,4,6,20,26,7,4,14,28,4,0,107,26,8,1,37,22,8,4,20,24,12,4,11,22,3,1,115,30,4,5,40,24,11,5,16,20,11,5,12,24,5,1,87,22,5,5,41,24,5,7,24,30,11,7,12,24,5,1,98,24,7,3,45,28,15,2,19,24,3,13,15,30,1,5,107,28,10,1,46,28,1,15,22,28,2,17,14,28,5,1,120,30,9,4,43,26,17,1,22,28,2,19,14,28,3,4,113,28,3,11,44,26,17,4,21,26,9,16,13,26,3,5,107,28,3,13,41,26,15,5,24,30,15,10,15,28,4,4,116,28,17,0,42,26,17,6,22,28,19,6,16,30,2,7,111,28,17,0,46,28,7,16,24,30,34,0,13,24,4,5,121,30,4,14,47,28,11,14,24,30,16,14,15,30,6,4,117,30,6,14,45,28,11,16,24,30,30,2,16,30,8,4,106,26,8,13,47,28,7,22,24,30,22,13,15,30,10,2,114,28,19,4,46,28,28,6,22,28,33,4,16,30,8,4,122,30,22,3,45,28,8,26,23,30,12,28,15,30,3,10,117,30,3,23,45,28,4,31,24,30,11,31,15,30,7,7,116,30,21,7,45,28,1,37,23,30,19,26,15,30,5,10,115,30,19,10,47,28,15,25,24,30,23,25,15,30,13,3,115,30,2,29,46,28,42,1,24,30,23,28,15,30,17,0,115,30,10,23,46,28,10,35,24,30,19,35,15,30,17,1,115,30,14,21,46,28,29,19,24,30,11,46,15,30,13,6,115,30,14,23,46,28,44,7,24,30,59,1,16,30,12,7,121,30,12,26,47,28,39,14,24,30,22,41,15,30,6,14,121,30,6,34,47,28,46,10,24,30,2,64,15,30,17,4,122,30,29,14,46,28,49,10,24,30,24,46,15,30,4,18,122,30,13,32,46,28,48,14,24,30,42,32,15,30,20,4,117,30,40,7,47,28,43,22,24,30,10,67,15,30,19,6,118,30,18,31,47,28,34,34,24,30,20,61,15,30],FINAL_FORMAT:[30660,29427,32170,30877,26159,25368,27713,26998,21522,20773,24188,23371,17913,16590,20375,19104,13663,12392,16177,14854,9396,8579,11994,11245,5769,5054,7399,6608,1890,597,3340,2107],LEVELS:{L:1,M:2,Q:3,H:4}}),N=G.extend(null,{EXPONENT:[1,2,4,8,16,32,64,128,29,58,116,232,205,135,19,38,76,152,45,90,180,117,234,201,143,3,6,12,24,48,96,192,157,39,78,156,37,74,148,53,106,212,181,119,238,193,159,35,70,140,5,10,20,40,80,160,93,186,105,210,185,111,222,161,95,190,97,194,153,47,94,188,101,202,137,15,30,60,120,240,253,231,211,187,107,214,177,127,254,225,223,163,91,182,113,226,217,175,67,134,17,34,68,136,13,26,52,104,208,189,103,206,129,31,62,124,248,237,199,147,59,118,236,197,151,51,102,204,133,23,46,92,184,109,218,169,79,158,33,66,132,21,42,84,168,77,154,41,82,164,85,170,73,146,57,114,228,213,183,115,230,209,191,99,198,145,63,126,252,229,215,179,123,246,241,255,227,219,171,75,150,49,98,196,149,55,110,220,165,87,174,65,130,25,50,100,200,141,7,14,28,56,112,224,221,167,83,166,81,162,89,178,121,242,249,239,195,155,43,86,172,69,138,9,18,36,72,144,61,122,244,245,247,243,251,235,203,139,11,22,44,88,176,125,250,233,207,131,27,54,108,216,173,71,142,0],LOG:[255,0,1,25,2,50,26,198,3,223,51,238,27,104,199,75,4,100,224,14,52,141,239,129,28,193,105,248,200,8,76,113,5,138,101,47,225,36,15,33,53,147,142,218,240,18,130,69,29,181,194,125,106,39,249,185,201,154,9,120,77,228,114,166,6,191,139,98,102,221,48,253,226,152,37,179,16,145,34,136,54,208,148,206,143,150,219,189,241,210,19,92,131,56,70,64,30,66,182,163,195,72,126,110,107,58,40,84,250,133,186,61,202,94,155,159,10,21,121,43,78,212,229,172,115,243,167,87,7,112,192,247,140,128,99,13,103,74,222,237,49,197,254,24,227,165,153,119,38,184,180,124,17,68,146,217,35,32,137,46,55,63,209,91,149,188,207,205,144,135,151,178,220,252,190,97,242,86,211,171,20,42,93,158,132,60,57,83,71,109,65,162,31,45,67,216,183,123,164,118,196,23,73,236,127,12,111,246,108,161,59,82,41,157,85,170,251,96,134,177,187,204,62,90,203,89,95,176,156,169,160,81,11,245,22,235,122,117,44,215,79,174,213,233,230,231,173,232,116,214,244,234,168,80,88,175]}),P=G.extend(null,{BLOCK:[3220,1468,2713,1235,3062,1890,2119,1549,2344,2936,1117,2583,1330,2470,1667,2249,2028,3780,481,4011,142,3098,831,3445,592,2517,1776,2234,1951,2827,1070,2660,1345,3177]}),Q=G.extend(function(ca){var da,ea,fa,ga,ha,ia=ca.value.length;for(this._badness=[],this._level=K.LEVELS[ca.level],this._polynomial=[],this._value=ca.value,this._version=0,this._stringBuffer=[];40>this._version&&(this._version++,fa=4*(this._level-1)+16*(this._version-1),ga=K.BLOCKS[fa++],ha=K.BLOCKS[fa++],da=K.BLOCKS[fa++],ea=K.BLOCKS[fa],fa=da*(ga+ha)+ha-3+(9>=this._version),!(ia<=fa)););this._dataBlock=da,this._eccBlock=ea,this._neccBlock1=ga,this._neccBlock2=ha;var ja=this.width=17+4*this._version;this.buffer=Q._createArray(ja*ja),this._ecc=Q._createArray(da+(da+ea)*(ga+ha)+ha),this._mask=Q._createArray((ja*(ja+1)+1)/2),this._insertFinders(),this._insertAlignments(),this.buffer[8+ja*(ja-8)]=1,this._insertTimingGap(),this._reverseMask(),this._insertTimingRowAndColumn(),this._insertVersion(),this._syncMask(),this._convertBitStream(ia),this._calculatePolynomial(),this._appendEccToData(),this._interleaveBlocks(),this._pack(),this._finish()},{_addAlignment:function(ca,da){var ea,fa=this.buffer,ga=this.width;for(fa[ca+ga*da]=1,ea=-2;2>ea;ea++)fa[ca+ea+ga*(da-2)]=1,fa[ca-2+ga*(da+ea+1)]=1,fa[ca+2+ga*(da+ea)]=1,fa[ca+ea+1+ga*(da+2)]=1;for(ea=0;2>ea;ea++)this._setMask(ca-1,da+ea),this._setMask(ca+1,da-ea),this._setMask(ca-ea,da-1),this._setMask(ca+ea,da+1)},_appendData:function(ca,da,ea,fa){var ga,ha,ia,ja=this._polynomial,ka=this._stringBuffer;for(ha=0;ha<fa;ha++)ka[ea+ha]=0;for(ha=0;ha<da;ha++){if(255!==(ga=N.LOG[ka[ca+ha]^ka[ea]]))for(ia=1;ia<fa;ia++)ka[ea+ia-1]=ka[ea+ia]^N.EXPONENT[Q._modN(ga+ja[fa-ia])];else for(ia=ea;ia<ea+fa;ia++)ka[ia]=ka[ia+1];ka[ea+fa-1]=255===ga?0:N.EXPONENT[Q._modN(ga+ja[0])]}},_appendEccToData:function(){var ca,da=0,ea=this._dataBlock,fa=this._calculateMaxLength(),ga=this._eccBlock;for(ca=0;ca<this._neccBlock1;ca++)this._appendData(da,ea,fa,ga),da+=ea,fa+=ga;for(ca=0;ca<this._neccBlock2;ca++)this._appendData(da,ea+1,fa,ga),da+=ea+1,fa+=ga},_applyMask:function(ca){var da,ea,fa,ga,ha=this.buffer,ia=this.width;switch(ca){case 0:for(ga=0;ga<ia;ga++)for(fa=0;fa<ia;fa++)1&fa+ga||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 1:for(ga=0;ga<ia;ga++)for(fa=0;fa<ia;fa++)1&ga||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 2:for(ga=0;ga<ia;ga++)for(da=0,fa=0;fa<ia;fa++,da++)3===da&&(da=0),da||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 3:for(ea=0,ga=0;ga<ia;ga++,ea++)for(3===ea&&(ea=0),da=ea,fa=0;fa<ia;fa++,da++)3===da&&(da=0),da||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 4:for(ga=0;ga<ia;ga++)for(da=0,ea=1&ga>>1,fa=0;fa<ia;fa++,da++)3===da&&(da=0,ea=!ea),ea||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 5:for(ea=0,ga=0;ga<ia;ga++,ea++)for(3===ea&&(ea=0),da=0,fa=0;fa<ia;fa++,da++)3===da&&(da=0),(1&(fa&ga))+!(!da|!ea)||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 6:for(ea=0,ga=0;ga<ia;ga++,ea++)for(3===ea&&(ea=0),da=0,fa=0;fa<ia;fa++,da++)3===da&&(da=0),1&(1&(fa&ga))+(da&&da===ea)||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);break;case 7:for(ea=0,ga=0;ga<ia;ga++,ea++)for(3===ea&&(ea=0),da=0,fa=0;fa<ia;fa++,da++)3===da&&(da=0),1&(da&&da===ea)+(1&fa+ga)||this._isMasked(fa,ga)||(ha[fa+ga*ia]^=1);}},_calculateMaxLength:function(){return this._dataBlock*(this._neccBlock1+this._neccBlock2)+this._neccBlock2},_calculatePolynomial:function(){var ca,da,ea=this._eccBlock,fa=this._polynomial;for(fa[0]=1,ca=0;ca<ea;ca++){for(fa[ca+1]=1,da=ca;0<da;da--)fa[da]=fa[da]?fa[da-1]^N.EXPONENT[Q._modN(N.LOG[fa[da]]+ca)]:fa[da-1];fa[0]=N.EXPONENT[Q._modN(N.LOG[fa[0]]+ca)]}for(ca=0;ca<=ea;ca++)fa[ca]=N.LOG[fa[ca]]},_checkBadness:function(){var ca,da,ea,fa,ga,ha=0,ia=this._badness,ja=this.buffer,ka=this.width;for(ga=0;ga<ka-1;ga++)for(fa=0;fa<ka-1;fa++)(ja[fa+ka*ga]&&ja[fa+1+ka*ga]&&ja[fa+ka*(ga+1)]&&ja[fa+1+ka*(ga+1)]||!(ja[fa+ka*ga]||ja[fa+1+ka*ga]||ja[fa+ka*(ga+1)]||ja[fa+1+ka*(ga+1)]))&&(ha+=Q.N2);var la=0;for(ga=0;ga<ka;ga++){for(ea=0,ia[0]=0,ca=0,fa=0;fa<ka;fa++)ca===(da=ja[fa+ka*ga])?ia[ea]++:ia[++ea]=1,la+=(ca=da)?1:-1;ha+=this._getBadness(ea)}0>la&&(la=-la);var ma=0,na=la;for(na+=na<<2,na<<=1;na>ka*ka;)na-=ka*ka,ma++;for(ha+=ma*Q.N4,fa=0;fa<ka;fa++){for(ea=0,ia[0]=0,ca=0,ga=0;ga<ka;ga++)ca===(da=ja[fa+ka*ga])?ia[ea]++:ia[++ea]=1,ca=da;ha+=this._getBadness(ea)}return ha},_convertBitStream:function(ca){var da,ea,fa=this._ecc,ga=this._version;for(ea=0;ea<ca;ea++)fa[ea]=this._value.charCodeAt(ea);var ha=this._stringBuffer=fa.slice(),ia=this._calculateMaxLength();ca>=ia-2&&(ca=ia-2,9<ga&&ca--);var ja=ca;if(9<ga){for(ha[ja+2]=0,ha[ja+3]=0;ja--;)da=ha[ja],ha[ja+3]|=255&da<<4,ha[ja+2]=da>>4;ha[2]|=255&ca<<4,ha[1]=ca>>4,ha[0]=64|ca>>12}else{for(ha[ja+1]=0,ha[ja+2]=0;ja--;)da=ha[ja],ha[ja+2]|=255&da<<4,ha[ja+1]=da>>4;ha[1]|=255&ca<<4,ha[0]=64|ca>>4}for(ja=ca+3-(10>ga);ja<ia;)ha[ja++]=236,ha[ja++]=17},_getBadness:function(ca){var da,ea=0,fa=this._badness;for(da=0;da<=ca;da++)5<=fa[da]&&(ea+=Q.N1+fa[da]-5);for(da=3;da<ca-1;da+=2)fa[da-2]===fa[da+2]&&fa[da+2]===fa[da-1]&&fa[da-1]===fa[da+1]&&3*fa[da-1]===fa[da]&&(0===fa[da-3]||da+3>ca||3*fa[da-3]>=4*fa[da]||3*fa[da+3]>=4*fa[da])&&(ea+=Q.N3);return ea},_finish:function(){this._stringBuffer=this.buffer.slice();var ca,da,ea=0,fa=3e4;for(da=0;8>da&&(this._applyMask(da),(ca=this._checkBadness())<fa&&(fa=ca,ea=da),7!==ea);da++)this.buffer=this._stringBuffer.slice();ea!==da&&this._applyMask(ea),fa=K.FINAL_FORMAT[ea+(this._level-1<<3)];var ga=this.buffer,ha=this.width;for(da=0;8>da;da++,fa>>=1)1&fa&&(ga[ha-1-da+8*ha]=1,6>da?ga[8+ha*da]=1:ga[8+ha*(da+1)]=1);for(da=0;7>da;da++,fa>>=1)1&fa&&(ga[8+ha*(ha-7+da)]=1,da?ga[6-da+8*ha]=1:ga[7+8*ha]=1)},_interleaveBlocks:function(){var ca,da,ea=this._dataBlock,fa=this._ecc,ga=this._eccBlock,ha=0,ia=this._calculateMaxLength(),ja=this._neccBlock1,ka=this._neccBlock2,la=this._stringBuffer;for(ca=0;ca<ea;ca++){for(da=0;da<ja;da++)fa[ha++]=la[ca+da*ea];for(da=0;da<ka;da++)fa[ha++]=la[ja*ea+ca+da*(ea+1)]}for(da=0;da<ka;da++)fa[ha++]=la[ja*ea+ca+da*(ea+1)];for(ca=0;ca<ga;ca++)for(da=0;da<ja+ka;da++)fa[ha++]=la[ia+ca+da*ga];this._stringBuffer=fa},_insertAlignments:function(){var ca,da,ea,fa=this._version,ga=this.width;if(1<fa)for(ca=J.BLOCK[fa],ea=ga-7;;){for(da=ga-7;da>ca-3&&(this._addAlignment(da,ea),!(da<ca));)da-=ca;if(ea<=ca+9)break;ea-=ca,this._addAlignment(6,ea),this._addAlignment(ea,6)}},_insertFinders:function(){var ca,da,ea,fa,ga=this.buffer,ha=this.width;for(ca=0;3>ca;ca++){for(da=0,fa=0,1===ca&&(da=ha-7),2===ca&&(fa=ha-7),ga[fa+3+ha*(da+3)]=1,ea=0;6>ea;ea++)ga[fa+ea+ha*da]=1,ga[fa+ha*(da+ea+1)]=1,ga[fa+6+ha*(da+ea)]=1,ga[fa+ea+1+ha*(da+6)]=1;for(ea=1;5>ea;ea++)this._setMask(fa+ea,da+1),this._setMask(fa+1,da+ea+1),this._setMask(fa+5,da+ea),this._setMask(fa+ea+1,da+5);for(ea=2;4>ea;ea++)ga[fa+ea+ha*(da+2)]=1,ga[fa+2+ha*(da+ea+1)]=1,ga[fa+4+ha*(da+ea)]=1,ga[fa+ea+1+ha*(da+4)]=1}},_insertTimingGap:function(){var ca,da,ea=this.width;for(da=0;7>da;da++)this._setMask(7,da),this._setMask(ea-8,da),this._setMask(7,da+ea-7);for(ca=0;8>ca;ca++)this._setMask(ca,7),this._setMask(ca+ea-8,7),this._setMask(ca,ea-8)},_insertTimingRowAndColumn:function(){var ca,da=this.buffer,ea=this.width;for(ca=0;ca<ea-14;ca++)1&ca?(this._setMask(8+ca,6),this._setMask(6,8+ca)):(da[8+ca+6*ea]=1,da[6+ea*(8+ca)]=1)},_insertVersion:function(){var ca,da,ea,fa,ga=this.buffer,ha=this._version,ia=this.width;if(6<ha)for(ca=P.BLOCK[ha-7],da=17,ea=0;6>ea;ea++)for(fa=0;3>fa;fa++,da--)1&(11<da?ha>>da-12:ca>>da)?(ga[5-ea+ia*(2-fa+ia-11)]=1,ga[2-fa+ia-11+ia*(5-ea)]=1):(this._setMask(5-ea,2-fa+ia-11),this._setMask(2-fa+ia-11,5-ea))},_isMasked:function(ca,da){var ea=Q._getMaskBit(ca,da);return 1===this._mask[ea]},_pack:function(){var ca,da,ea,fa=1,ga=1,ha=this.width,ia=ha-1,ja=ha-1,ka=(this._dataBlock+this._eccBlock)*(this._neccBlock1+this._neccBlock2)+this._neccBlock2;for(da=0;da<ka;da++)for(ca=this._stringBuffer[da],ea=0;8>ea;ea++,ca<<=1){128&ca&&(this.buffer[ia+ha*ja]=1);do ga?ia--:(ia++,fa?0==ja?(fa=!fa,6==(ia-=2)&&(ia--,ja=9)):ja--:ja==ha-1?(fa=!fa,6==(ia-=2)&&(ia--,ja-=8)):ja++),ga=!ga;while(this._isMasked(ia,ja))}},_reverseMask:function(){var ca,da,ea=this.width;for(ca=0;9>ca;ca++)this._setMask(ca,8);for(ca=0;8>ca;ca++)this._setMask(ca+ea-8,8),this._setMask(8,ca);for(da=0;7>da;da++)this._setMask(8,da+ea-7)},_setMask:function(ca,da){var ea=Q._getMaskBit(ca,da);this._mask[ea]=1},_syncMask:function(){var ca,da,ea=this.width;for(da=0;da<ea;da++)for(ca=0;ca<=da;ca++)this.buffer[ca+ea*da]&&this._setMask(ca,da)}},{_createArray:function(ca){var da,ea=[];for(da=0;da<ca;da++)ea[da]=0;return ea},_getMaskBit:function(ca,da){var ea;return ca>da&&(ea=ca,ca=da,da=ea),ea=da,ea+=da*da,ea>>=1,ea+=ca},_modN:function(ca){for(;255<=ca;)ca=((ca-=255)>>8)+(255&ca);return ca},N1:3,N2:3,N3:40,N4:10}),S=H.extend({draw:function(){this.element.src=this.qrious.toDataURL()},reset:function(){this.element.src=""},resize:function(){var ca=this.element;ca.width=ca.height=this.qrious.size}}),T=G.extend(function(ca,da,ea,fa){this.name=ca,this.modifiable=!!da,this.defaultValue=ea,this._valueTransformer=fa},{transform:function(ca){var da=this._valueTransformer;return"function"==typeof da?da(ca,this):ca}}),U=G.extend(null,{abs:function(ca){return null==ca?null:Math.abs(ca)},hasOwn:function(ca,da){return Object.prototype.hasOwnProperty.call(ca,da)},noop:function(){},toUpperCase:function(ca){return null==ca?null:ca.toUpperCase()}}),V=G.extend(function(ca){this.options={},ca.forEach(function(da){this.options[da.name]=da},this)},{exists:function(ca){return null!=this.options[ca]},get:function(ca,da){return V._get(this.options[ca],da)},getAll:function(ca){var da,ea=this.options,fa={};for(da in ea)U.hasOwn(ea,da)&&(fa[da]=V._get(ea[da],ca));return fa},init:function(ca,da,ea){"function"!=typeof ea&&(ea=U.noop);var fa,ga;for(fa in this.options)U.hasOwn(this.options,fa)&&(ga=this.options[fa],V._set(ga,ga.defaultValue,da),V._createAccessor(ga,da,ea));this._setAll(ca,da,!0)},set:function(ca,da,ea){return this._set(ca,da,ea)},setAll:function(ca,da){return this._setAll(ca,da)},_set:function(ca,da,ea,fa){var ga=this.options[ca];if(!ga)throw new Error("Invalid option: "+ca);if(!ga.modifiable&&!fa)throw new Error("Option cannot be modified: "+ca);return V._set(ga,da,ea)},_setAll:function(ca,da,ea){if(!ca)return!1;var fa,ga=!1;for(fa in ca)U.hasOwn(ca,fa)&&this._set(fa,ca[fa],da,ea)&&(ga=!0);return ga}},{_createAccessor:function(ca,da,ea){var fa={get:function(){return V._get(ca,da)}};ca.modifiable&&(fa.set=function(ga){V._set(ca,ga,da)&&ea(ga,ca)}),Object.defineProperty(da,ca.name,fa)},_get:function(ca,da){return da["_"+ca.name]},_set:function(ca,da,ea){var fa="_"+ca.name,ga=ea[fa],ha=ca.transform(null==da?ca.defaultValue:da);return ea[fa]=ha,ha!==ga}}),X=G.extend(function(){this._services={}},{getService:function(ca){var da=this._services[ca];if(!da)throw new Error("Service is not being managed with name: "+ca);return da},setService:function(ca,da){if(this._services[ca])throw new Error("Service is already managed with name: "+ca);da&&(this._services[ca]=da)}}),Y=new V([new T("background",!0,"white"),new T("backgroundAlpha",!0,1,U.abs),new T("element"),new T("foreground",!0,"black"),new T("foregroundAlpha",!0,1,U.abs),new T("level",!0,"L",U.toUpperCase),new T("mime",!0,"image/png"),new T("padding",!0,null,U.abs),new T("size",!0,100,U.abs),new T("value",!0,"")]),Z=new X,$=G.extend(function(ca){Y.init(ca,this,this.update.bind(this));var da=Y.get("element",this),ea=Z.getService("element"),fa=da&&ea.isCanvas(da)?da:ea.createCanvas(),ga=da&&ea.isImage(da)?da:ea.createImage();this._canvasRenderer=new I(this,fa,!0),this._imageRenderer=new S(this,ga,ga===da),this.update()},{get:function(){return Y.getAll(this)},set:function(ca){Y.setAll(ca,this)&&this.update()},toDataURL:function(ca){return this.canvas.toDataURL(ca||this.mime)},update:function(){var ca=new Q({level:this.level,value:this.value});this._canvasRenderer.render(ca),this._imageRenderer.render(ca)}},{use:function(ca){Z.setService(ca.getName(),ca)}});Object.defineProperties($.prototype,{canvas:{get:function(){return this._canvasRenderer.getElement()}},image:{get:function(){return this._imageRenderer.getElement()}}});var aa=$,ba=G.extend({getName:function(){}}).extend({createCanvas:function(){},createImage:function(){},getName:function(){return"element"},isCanvas:function(){},isImage:function(){}}).extend({createCanvas:function(){return document.createElement("canvas")},createImage:function(){return document.createElement("img")},isCanvas:function(ca){return ca instanceof HTMLCanvasElement},isImage:function(ca){return ca instanceof HTMLImageElement}});return aa.use(new ba),aa});function hex_to_b32(j){let q="ABCDEFGHIJKLMNOPQRSTUVWXYZ234567",x=[];for(let E=0;E<j.length;E+=2)x.push(parseInt(j.substr(E,2),16));let z=0,C=0,D="";for(let E=0;E<x.length;E++)for(C=C<<8|x[E],z+=8;5<=z;)D+=q[31&C>>>z-5],z-=5;return 0<z&&(D+=q[31&C<<5-z]),D}function console_image(j,q){console.log("%c+","font-size: 1px; padding: "+Math.floor(q/2)+"px "+Math.floor(q/2)+"px; line-height: "+q+"px; background: url("+j+"); color: transparent;")}console.warn("Here's your Authy tokens:"),appManager.getModel().forEach(function(j){let q=200,x=!1===j.markedForDeletion?j.decryptedSeed:hex_to_b32(j.secretSeed),z=7===j.digits?10:30,C=`otpauth://totp/${encodeURIComponent(j.name)}?secret=${x}&digits=${j.digits}&period=${z}`;console.group(j.name),console.log("TOTP secret:",x),console.log("TOTP URI:",C);let D=new QRious({value:C,size:q}).toDataURL();console_image(D,q),console.groupEnd()});- Brian's gist
- JavaScript implementation of base32 encoding by Chris Umbel, et al.
- Google Authenticator URI format
- I am not responsible for your actions.
- I am sure someone has already discovered everything I wrote before, but I couldn't find anything written about it in detail, I didn't invent anything new here
- The code is a horrible hack, it works for what it does and that's the important bit, improvements are welcome
- If anyone from Authy reads this - security shouldn't rely on obfuscation or hiding of any sort and should take advantage of freedom of choice where possible. I love the idea of the keys being tied to ones phone number and making this system easy to use for everyone, but please make these URI-s exportable to other applications if users wish to do so - it's possible as demonstrated above and you probably know it. Transparency is what makes this system secure. If you don't wish to do that, then please don't break this method of acquiring keys.
Below are the un-minified versions of the snippets posted above.
/* base32 */
/*
Copyright (c) 2011, Chris Umbel
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
var charTable = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";
function quintetCount(buff) {
var quintets = Math.floor(buff.length / 5);
return buff.length % 5 == 0 ? quintets : quintets + 1;
}
encode = function(plain) {
var i = 0;
var j = 0;
var shiftIndex = 0;
var digit = 0;
var encoded = new Array(quintetCount(plain) * 8);
/* byte by byte isn't as pretty as quintet by quintet but tests a bit
faster. will have to revisit. */
while (i < plain.length) {
var current = plain[i];
if (shiftIndex > 3) {
digit = current & (0xff >> shiftIndex);
shiftIndex = (shiftIndex + 5) % 8;
digit = (digit << shiftIndex) | ((i + 1 < plain.length) ?
plain[i + 1] : 0) >> (8 - shiftIndex);
i++;
} else {
digit = (current >> (8 - (shiftIndex + 5))) & 0x1f;
shiftIndex = (shiftIndex + 5) % 8;
if (shiftIndex == 0) i++;
}
encoded[j] = charTable.charAt(digit);
j++;
}
return encoded.join('');
};
/* base32 end */
function hexToInt(str) {
var result = [];
for (var i = 0; i < str.length; i += 2) {
result.push(parseInt(str.substr(i, 2), 16));
}
return result;
}
function hexToB32(str) {
return encode(hexToInt(str));
}
appManager.getModel().forEach(function(i) {
if (i.markedForDeletion === false) {
console.log('otpauth://totp/' + encodeURIComponent(i.name) + '?secret=' + i.decryptedSeed + '&issuer=' + i.accountType);
} else {
console.log('otpauth://totp/' + encodeURIComponent(i.name) + '?secret=' + hexToB32(i.secretSeed) + '&issuer=' + i.accountType + '&digits=8&period=10');
}
});The code below was pulled from this comment and tweaked a bit (fully un-minified).
Really long code block inside
/*
* QRious v4.0.2
* Copyright (C) 2017 Alasdair Mercer
* Copyright (C) 2010 Tom Zerucha
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
(function(global, factory) {
typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
typeof define === 'function' && define.amd ? define(factory) :
(global.QRious = factory());
}(this, (function() {
'use strict';
/*
* Copyright (C) 2017 Alasdair Mercer, !ninja
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
/**
* A bare-bones constructor for surrogate prototype swapping.
*
* @private
* @constructor
*/
var Constructor = /* istanbul ignore next */ function() {};
/**
* A reference to <code>Object.prototype.hasOwnProperty</code>.
*
* @private
* @type {Function}
*/
var hasOwnProperty = Object.prototype.hasOwnProperty;
/**
* A reference to <code>Array.prototype.slice</code>.
*
* @private
* @type {Function}
*/
var slice = Array.prototype.slice;
/**
* Creates an object which inherits the given <code>prototype</code>.
*
* Optionally, the created object can be extended further with the specified <code>properties</code>.
*
* @param {Object} prototype - the prototype to be inherited by the created object
* @param {Object} [properties] - the optional properties to be extended by the created object
* @return {Object} The newly created object.
* @private
*/
function createObject(prototype, properties) {
var result;
/* istanbul ignore next */
if (typeof Object.create === 'function') {
result = Object.create(prototype);
} else {
Constructor.prototype = prototype;
result = new Constructor();
Constructor.prototype = null;
}
if (properties) {
extendObject(true, result, properties);
}
return result;
}
/**
* Extends the constructor to which this method is associated with the <code>prototype</code> and/or
* <code>statics</code> provided.
*
* If <code>name</code> is provided, it will be used as the class name and can be accessed via a special
* <code>class_</code> property on the child constructor, otherwise the class name of the super constructor will be used
* instead. The class name may also be used string representation for instances of the child constructor (via
* <code>toString</code>), but this is not applicable to the <i>lite</i> version of Nevis.
*
* If <code>constructor</code> is provided, it will be used as the constructor for the child, otherwise a simple
* constructor which only calls the super constructor will be used instead.
*
* The super constructor can be accessed via a special <code>super_</code> property on the child constructor.
*
* @param {string} [name=this.class_] - the class name to be used for the child constructor
* @param {Function} [constructor] - the constructor for the child
* @param {Object} [prototype] - the prototype properties to be defined for the child
* @param {Object} [statics] - the static properties to be defined for the child
* @return {Function} The child <code>constructor</code> provided or the one created if none was given.
* @public
*/
function extend(name, constructor, prototype, statics) {
var superConstructor = this;
if (typeof name !== 'string') {
statics = prototype;
prototype = constructor;
constructor = name;
name = null;
}
if (typeof constructor !== 'function') {
statics = prototype;
prototype = constructor;
constructor = function() {
return superConstructor.apply(this, arguments);
};
}
extendObject(false, constructor, superConstructor, statics);
constructor.prototype = createObject(superConstructor.prototype, prototype);
constructor.prototype.constructor = constructor;
constructor.class_ = name || superConstructor.class_;
constructor.super_ = superConstructor;
return constructor;
}
/**
* Extends the specified <code>target</code> object with the properties in each of the <code>sources</code> provided.
*
* if any source is <code>null</code> it will be ignored.
*
* @param {boolean} own - <code>true</code> to only copy <b>own</b> properties from <code>sources</code> onto
* <code>target</code>; otherwise <code>false</code>
* @param {Object} target - the target object which should be extended
* @param {...Object} [sources] - the source objects whose properties are to be copied onto <code>target</code>
* @return {void}
* @private
*/
function extendObject(own, target, sources) {
sources = slice.call(arguments, 2);
var property;
var source;
for (var i = 0, length = sources.length; i < length; i++) {
source = sources[i];
for (property in source) {
if (!own || hasOwnProperty.call(source, property)) {
target[property] = source[property];
}
}
}
}
var extend_1 = extend;
/**
* The base class from which all others should extend.
*
* @public
* @constructor
*/
function Nevis() {}
Nevis.class_ = 'Nevis';
Nevis.super_ = Object;
/**
* Extends the constructor to which this method is associated with the <code>prototype</code> and/or
* <code>statics</code> provided.
*
* If <code>name</code> is provided, it will be used as the class name and can be accessed via a special
* <code>class_</code> property on the child constructor, otherwise the class name of the super constructor will be used
* instead. The class name may also be used string representation for instances of the child constructor (via
* <code>toString</code>), but this is not applicable to the <i>lite</i> version of Nevis.
*
* If <code>constructor</code> is provided, it will be used as the constructor for the child, otherwise a simple
* constructor which only calls the super constructor will be used instead.
*
* The super constructor can be accessed via a special <code>super_</code> property on the child constructor.
*
* @param {string} [name=this.class_] - the class name to be used for the child constructor
* @param {Function} [constructor] - the constructor for the child
* @param {Object} [prototype] - the prototype properties to be defined for the child
* @param {Object} [statics] - the static properties to be defined for the child
* @return {Function} The child <code>constructor</code> provided or the one created if none was given.
* @public
* @static
* @memberof Nevis
*/
Nevis.extend = extend_1;
var nevis = Nevis;
var lite = nevis;
/**
* Responsible for rendering a QR code {@link Frame} on a specific type of element.
*
* A renderer may be dependant on the rendering of another element, so the ordering of their execution is important.
*
* The rendering of a element can be deferred by disabling the renderer initially, however, any attempt get the element
* from the renderer will result in it being immediately enabled and the element being rendered.
*
* @param {QRious} qrious - the {@link QRious} instance to be used
* @param {*} element - the element onto which the QR code is to be rendered
* @param {boolean} [enabled] - <code>true</code> this {@link Renderer} is enabled; otherwise <code>false</code>.
* @public
* @class
* @extends Nevis
*/
var Renderer = lite.extend(function(qrious, element, enabled) {
/**
* The {@link QRious} instance.
*
* @protected
* @type {QRious}
* @memberof Renderer#
*/
this.qrious = qrious;
/**
* The element onto which this {@link Renderer} is rendering the QR code.
*
* @protected
* @type {*}
* @memberof Renderer#
*/
this.element = element;
this.element.qrious = qrious;
/**
* Whether this {@link Renderer} is enabled.
*
* @protected
* @type {boolean}
* @memberof Renderer#
*/
this.enabled = Boolean(enabled);
}, {
/**
* Draws the specified QR code <code>frame</code> on the underlying element.
*
* Implementations of {@link Renderer} <b>must</b> override this method with their own specific logic.
*
* @param {Frame} frame - the {@link Frame} to be drawn
* @return {void}
* @protected
* @abstract
* @memberof Renderer#
*/
draw: function(frame) {},
/**
* Returns the element onto which this {@link Renderer} is rendering the QR code.
*
* If this method is called while this {@link Renderer} is disabled, it will be immediately enabled and rendered
* before the element is returned.
*
* @return {*} The element.
* @public
* @memberof Renderer#
*/
getElement: function() {
if (!this.enabled) {
this.enabled = true;
this.render();
}
return this.element;
},
/**
* Calculates the size (in pixel units) to represent an individual module within the QR code based on the
* <code>frame</code> provided.
*
* Any configured padding will be excluded from the returned size.
*
* The returned value will be at least one, even in cases where the size of the QR code does not fit its contents.
* This is done so that the inevitable clipping is handled more gracefully since this way at least something is
* displayed instead of just a blank space filled by the background color.
*
* @param {Frame} frame - the {@link Frame} from which the module size is to be derived
* @return {number} The pixel size for each module in the QR code which will be no less than one.
* @protected
* @memberof Renderer#
*/
getModuleSize: function(frame) {
var qrious = this.qrious;
var padding = qrious.padding || 0;
var pixels = Math.floor((qrious.size - (padding * 2)) / frame.width);
return Math.max(1, pixels);
},
/**
* Calculates the offset/padding (in pixel units) to be inserted before the QR code based on the <code>frame</code>
* provided.
*
* The returned value will be zero if there is no available offset or if the size of the QR code does not fit its
* contents. It will never be a negative value. This is done so that the inevitable clipping appears more naturally
* and it is not clipped from all directions.
*
* @param {Frame} frame - the {@link Frame} from which the offset is to be derived
* @return {number} The pixel offset for the QR code which will be no less than zero.
* @protected
* @memberof Renderer#
*/
getOffset: function(frame) {
var qrious = this.qrious;
var padding = qrious.padding;
if (padding != null) {
return padding;
}
var moduleSize = this.getModuleSize(frame);
var offset = Math.floor((qrious.size - (moduleSize * frame.width)) / 2);
return Math.max(0, offset);
},
/**
* Renders a QR code on the underlying element based on the <code>frame</code> provided.
*
* @param {Frame} frame - the {@link Frame} to be rendered
* @return {void}
* @public
* @memberof Renderer#
*/
render: function(frame) {
if (this.enabled) {
this.resize();
this.reset();
this.draw(frame);
}
},
/**
* Resets the underlying element, effectively clearing any previously rendered QR code.
*
* Implementations of {@link Renderer} <b>must</b> override this method with their own specific logic.
*
* @return {void}
* @protected
* @abstract
* @memberof Renderer#
*/
reset: function() {},
/**
* Ensures that the size of the underlying element matches that defined on the associated {@link QRious} instance.
*
* Implementations of {@link Renderer} <b>must</b> override this method with their own specific logic.
*
* @return {void}
* @protected
* @abstract
* @memberof Renderer#
*/
resize: function() {}
});
var Renderer_1 = Renderer;
/**
* An implementation of {@link Renderer} for working with <code>canvas</code> elements.
*
* @public
* @class
* @extends Renderer
*/
var CanvasRenderer = Renderer_1.extend({
/**
* @override
*/
draw: function(frame) {
var i, j;
var qrious = this.qrious;
var moduleSize = this.getModuleSize(frame);
var offset = this.getOffset(frame);
var context = this.element.getContext('2d');
context.fillStyle = qrious.foreground;
context.globalAlpha = qrious.foregroundAlpha;
for (i = 0; i < frame.width; i++) {
for (j = 0; j < frame.width; j++) {
if (frame.buffer[(j * frame.width) + i]) {
context.fillRect((moduleSize * i) + offset, (moduleSize * j) + offset, moduleSize, moduleSize);
}
}
}
},
/**
* @override
*/
reset: function() {
var qrious = this.qrious;
var context = this.element.getContext('2d');
var size = qrious.size;
context.lineWidth = 1;
context.clearRect(0, 0, size, size);
context.fillStyle = qrious.background;
context.globalAlpha = qrious.backgroundAlpha;
context.fillRect(0, 0, size, size);
},
/**
* @override
*/
resize: function() {
var element = this.element;
element.width = element.height = this.qrious.size;
}
});
var CanvasRenderer_1 = CanvasRenderer;
/* eslint no-multi-spaces: "off" */
/**
* Contains alignment pattern information.
*
* @public
* @class
* @extends Nevis
*/
var Alignment = lite.extend(null, {
/**
* The alignment pattern block.
*
* @public
* @static
* @type {number[]}
* @memberof Alignment
*/
BLOCK: [
0, 11, 15, 19, 23, 27, 31,
16, 18, 20, 22, 24, 26, 28, 20, 22, 24, 24, 26, 28, 28, 22, 24, 24,
26, 26, 28, 28, 24, 24, 26, 26, 26, 28, 28, 24, 26, 26, 26, 28, 28
]
});
var Alignment_1 = Alignment;
/* eslint no-multi-spaces: "off" */
/**
* Contains error correction information.
*
* @public
* @class
* @extends Nevis
*/
var ErrorCorrection = lite.extend(null, {
/**
* The error correction blocks.
*
* There are four elements per version. The first two indicate the number of blocks, then the data width, and finally
* the ECC width.
*
* @public
* @static
* @type {number[]}
* @memberof ErrorCorrection
*/
BLOCKS: [
1, 0, 19, 7, 1, 0, 16, 10, 1, 0, 13, 13, 1, 0, 9, 17,
1, 0, 34, 10, 1, 0, 28, 16, 1, 0, 22, 22, 1, 0, 16, 28,
1, 0, 55, 15, 1, 0, 44, 26, 2, 0, 17, 18, 2, 0, 13, 22,
1, 0, 80, 20, 2, 0, 32, 18, 2, 0, 24, 26, 4, 0, 9, 16,
1, 0, 108, 26, 2, 0, 43, 24, 2, 2, 15, 18, 2, 2, 11, 22,
2, 0, 68, 18, 4, 0, 27, 16, 4, 0, 19, 24, 4, 0, 15, 28,
2, 0, 78, 20, 4, 0, 31, 18, 2, 4, 14, 18, 4, 1, 13, 26,
2, 0, 97, 24, 2, 2, 38, 22, 4, 2, 18, 22, 4, 2, 14, 26,
2, 0, 116, 30, 3, 2, 36, 22, 4, 4, 16, 20, 4, 4, 12, 24,
2, 2, 68, 18, 4, 1, 43, 26, 6, 2, 19, 24, 6, 2, 15, 28,
4, 0, 81, 20, 1, 4, 50, 30, 4, 4, 22, 28, 3, 8, 12, 24,
2, 2, 92, 24, 6, 2, 36, 22, 4, 6, 20, 26, 7, 4, 14, 28,
4, 0, 107, 26, 8, 1, 37, 22, 8, 4, 20, 24, 12, 4, 11, 22,
3, 1, 115, 30, 4, 5, 40, 24, 11, 5, 16, 20, 11, 5, 12, 24,
5, 1, 87, 22, 5, 5, 41, 24, 5, 7, 24, 30, 11, 7, 12, 24,
5, 1, 98, 24, 7, 3, 45, 28, 15, 2, 19, 24, 3, 13, 15, 30,
1, 5, 107, 28, 10, 1, 46, 28, 1, 15, 22, 28, 2, 17, 14, 28,
5, 1, 120, 30, 9, 4, 43, 26, 17, 1, 22, 28, 2, 19, 14, 28,
3, 4, 113, 28, 3, 11, 44, 26, 17, 4, 21, 26, 9, 16, 13, 26,
3, 5, 107, 28, 3, 13, 41, 26, 15, 5, 24, 30, 15, 10, 15, 28,
4, 4, 116, 28, 17, 0, 42, 26, 17, 6, 22, 28, 19, 6, 16, 30,
2, 7, 111, 28, 17, 0, 46, 28, 7, 16, 24, 30, 34, 0, 13, 24,
4, 5, 121, 30, 4, 14, 47, 28, 11, 14, 24, 30, 16, 14, 15, 30,
6, 4, 117, 30, 6, 14, 45, 28, 11, 16, 24, 30, 30, 2, 16, 30,
8, 4, 106, 26, 8, 13, 47, 28, 7, 22, 24, 30, 22, 13, 15, 30,
10, 2, 114, 28, 19, 4, 46, 28, 28, 6, 22, 28, 33, 4, 16, 30,
8, 4, 122, 30, 22, 3, 45, 28, 8, 26, 23, 30, 12, 28, 15, 30,
3, 10, 117, 30, 3, 23, 45, 28, 4, 31, 24, 30, 11, 31, 15, 30,
7, 7, 116, 30, 21, 7, 45, 28, 1, 37, 23, 30, 19, 26, 15, 30,
5, 10, 115, 30, 19, 10, 47, 28, 15, 25, 24, 30, 23, 25, 15, 30,
13, 3, 115, 30, 2, 29, 46, 28, 42, 1, 24, 30, 23, 28, 15, 30,
17, 0, 115, 30, 10, 23, 46, 28, 10, 35, 24, 30, 19, 35, 15, 30,
17, 1, 115, 30, 14, 21, 46, 28, 29, 19, 24, 30, 11, 46, 15, 30,
13, 6, 115, 30, 14, 23, 46, 28, 44, 7, 24, 30, 59, 1, 16, 30,
12, 7, 121, 30, 12, 26, 47, 28, 39, 14, 24, 30, 22, 41, 15, 30,
6, 14, 121, 30, 6, 34, 47, 28, 46, 10, 24, 30, 2, 64, 15, 30,
17, 4, 122, 30, 29, 14, 46, 28, 49, 10, 24, 30, 24, 46, 15, 30,
4, 18, 122, 30, 13, 32, 46, 28, 48, 14, 24, 30, 42, 32, 15, 30,
20, 4, 117, 30, 40, 7, 47, 28, 43, 22, 24, 30, 10, 67, 15, 30,
19, 6, 118, 30, 18, 31, 47, 28, 34, 34, 24, 30, 20, 61, 15, 30
],
/**
* The final format bits with mask (level << 3 | mask).
*
* @public
* @static
* @type {number[]}
* @memberof ErrorCorrection
*/
FINAL_FORMAT: [
// L
0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976,
// M
0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0,
// Q
0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed,
// H
0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b
],
/**
* A map of human-readable ECC levels.
*
* @public
* @static
* @type {Object.<string, number>}
* @memberof ErrorCorrection
*/
LEVELS: {
L: 1,
M: 2,
Q: 3,
H: 4
}
});
var ErrorCorrection_1 = ErrorCorrection;
/**
* Contains Galois field information.
*
* @public
* @class
* @extends Nevis
*/
var Galois = lite.extend(null, {
/**
* The Galois field exponent table.
*
* @public
* @static
* @type {number[]}
* @memberof Galois
*/
EXPONENT: [
0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1d, 0x3a, 0x74, 0xe8, 0xcd, 0x87, 0x13, 0x26,
0x4c, 0x98, 0x2d, 0x5a, 0xb4, 0x75, 0xea, 0xc9, 0x8f, 0x03, 0x06, 0x0c, 0x18, 0x30, 0x60, 0xc0,
0x9d, 0x27, 0x4e, 0x9c, 0x25, 0x4a, 0x94, 0x35, 0x6a, 0xd4, 0xb5, 0x77, 0xee, 0xc1, 0x9f, 0x23,
0x46, 0x8c, 0x05, 0x0a, 0x14, 0x28, 0x50, 0xa0, 0x5d, 0xba, 0x69, 0xd2, 0xb9, 0x6f, 0xde, 0xa1,
0x5f, 0xbe, 0x61, 0xc2, 0x99, 0x2f, 0x5e, 0xbc, 0x65, 0xca, 0x89, 0x0f, 0x1e, 0x3c, 0x78, 0xf0,
0xfd, 0xe7, 0xd3, 0xbb, 0x6b, 0xd6, 0xb1, 0x7f, 0xfe, 0xe1, 0xdf, 0xa3, 0x5b, 0xb6, 0x71, 0xe2,
0xd9, 0xaf, 0x43, 0x86, 0x11, 0x22, 0x44, 0x88, 0x0d, 0x1a, 0x34, 0x68, 0xd0, 0xbd, 0x67, 0xce,
0x81, 0x1f, 0x3e, 0x7c, 0xf8, 0xed, 0xc7, 0x93, 0x3b, 0x76, 0xec, 0xc5, 0x97, 0x33, 0x66, 0xcc,
0x85, 0x17, 0x2e, 0x5c, 0xb8, 0x6d, 0xda, 0xa9, 0x4f, 0x9e, 0x21, 0x42, 0x84, 0x15, 0x2a, 0x54,
0xa8, 0x4d, 0x9a, 0x29, 0x52, 0xa4, 0x55, 0xaa, 0x49, 0x92, 0x39, 0x72, 0xe4, 0xd5, 0xb7, 0x73,
0xe6, 0xd1, 0xbf, 0x63, 0xc6, 0x91, 0x3f, 0x7e, 0xfc, 0xe5, 0xd7, 0xb3, 0x7b, 0xf6, 0xf1, 0xff,
0xe3, 0xdb, 0xab, 0x4b, 0x96, 0x31, 0x62, 0xc4, 0x95, 0x37, 0x6e, 0xdc, 0xa5, 0x57, 0xae, 0x41,
0x82, 0x19, 0x32, 0x64, 0xc8, 0x8d, 0x07, 0x0e, 0x1c, 0x38, 0x70, 0xe0, 0xdd, 0xa7, 0x53, 0xa6,
0x51, 0xa2, 0x59, 0xb2, 0x79, 0xf2, 0xf9, 0xef, 0xc3, 0x9b, 0x2b, 0x56, 0xac, 0x45, 0x8a, 0x09,
0x12, 0x24, 0x48, 0x90, 0x3d, 0x7a, 0xf4, 0xf5, 0xf7, 0xf3, 0xfb, 0xeb, 0xcb, 0x8b, 0x0b, 0x16,
0x2c, 0x58, 0xb0, 0x7d, 0xfa, 0xe9, 0xcf, 0x83, 0x1b, 0x36, 0x6c, 0xd8, 0xad, 0x47, 0x8e, 0x00
],
/**
* The Galois field log table.
*
* @public
* @static
* @type {number[]}
* @memberof Galois
*/
LOG: [
0xff, 0x00, 0x01, 0x19, 0x02, 0x32, 0x1a, 0xc6, 0x03, 0xdf, 0x33, 0xee, 0x1b, 0x68, 0xc7, 0x4b,
0x04, 0x64, 0xe0, 0x0e, 0x34, 0x8d, 0xef, 0x81, 0x1c, 0xc1, 0x69, 0xf8, 0xc8, 0x08, 0x4c, 0x71,
0x05, 0x8a, 0x65, 0x2f, 0xe1, 0x24, 0x0f, 0x21, 0x35, 0x93, 0x8e, 0xda, 0xf0, 0x12, 0x82, 0x45,
0x1d, 0xb5, 0xc2, 0x7d, 0x6a, 0x27, 0xf9, 0xb9, 0xc9, 0x9a, 0x09, 0x78, 0x4d, 0xe4, 0x72, 0xa6,
0x06, 0xbf, 0x8b, 0x62, 0x66, 0xdd, 0x30, 0xfd, 0xe2, 0x98, 0x25, 0xb3, 0x10, 0x91, 0x22, 0x88,
0x36, 0xd0, 0x94, 0xce, 0x8f, 0x96, 0xdb, 0xbd, 0xf1, 0xd2, 0x13, 0x5c, 0x83, 0x38, 0x46, 0x40,
0x1e, 0x42, 0xb6, 0xa3, 0xc3, 0x48, 0x7e, 0x6e, 0x6b, 0x3a, 0x28, 0x54, 0xfa, 0x85, 0xba, 0x3d,
0xca, 0x5e, 0x9b, 0x9f, 0x0a, 0x15, 0x79, 0x2b, 0x4e, 0xd4, 0xe5, 0xac, 0x73, 0xf3, 0xa7, 0x57,
0x07, 0x70, 0xc0, 0xf7, 0x8c, 0x80, 0x63, 0x0d, 0x67, 0x4a, 0xde, 0xed, 0x31, 0xc5, 0xfe, 0x18,
0xe3, 0xa5, 0x99, 0x77, 0x26, 0xb8, 0xb4, 0x7c, 0x11, 0x44, 0x92, 0xd9, 0x23, 0x20, 0x89, 0x2e,
0x37, 0x3f, 0xd1, 0x5b, 0x95, 0xbc, 0xcf, 0xcd, 0x90, 0x87, 0x97, 0xb2, 0xdc, 0xfc, 0xbe, 0x61,
0xf2, 0x56, 0xd3, 0xab, 0x14, 0x2a, 0x5d, 0x9e, 0x84, 0x3c, 0x39, 0x53, 0x47, 0x6d, 0x41, 0xa2,
0x1f, 0x2d, 0x43, 0xd8, 0xb7, 0x7b, 0xa4, 0x76, 0xc4, 0x17, 0x49, 0xec, 0x7f, 0x0c, 0x6f, 0xf6,
0x6c, 0xa1, 0x3b, 0x52, 0x29, 0x9d, 0x55, 0xaa, 0xfb, 0x60, 0x86, 0xb1, 0xbb, 0xcc, 0x3e, 0x5a,
0xcb, 0x59, 0x5f, 0xb0, 0x9c, 0xa9, 0xa0, 0x51, 0x0b, 0xf5, 0x16, 0xeb, 0x7a, 0x75, 0x2c, 0xd7,
0x4f, 0xae, 0xd5, 0xe9, 0xe6, 0xe7, 0xad, 0xe8, 0x74, 0xd6, 0xf4, 0xea, 0xa8, 0x50, 0x58, 0xaf
]
});
var Galois_1 = Galois;
/**
* Contains version pattern information.
*
* @public
* @class
* @extends Nevis
*/
var Version = lite.extend(null, {
/**
* The version pattern block.
*
* @public
* @static
* @type {number[]}
* @memberof Version
*/
BLOCK: [
0xc94, 0x5bc, 0xa99, 0x4d3, 0xbf6, 0x762, 0x847, 0x60d, 0x928, 0xb78, 0x45d, 0xa17, 0x532,
0x9a6, 0x683, 0x8c9, 0x7ec, 0xec4, 0x1e1, 0xfab, 0x08e, 0xc1a, 0x33f, 0xd75, 0x250, 0x9d5,
0x6f0, 0x8ba, 0x79f, 0xb0b, 0x42e, 0xa64, 0x541, 0xc69
]
});
var Version_1 = Version;
/**
* Generates information for a QR code frame based on a specific value to be encoded.
*
* @param {Frame~Options} options - the options to be used
* @public
* @class
* @extends Nevis
*/
var Frame = lite.extend(function(options) {
var dataBlock, eccBlock, index, neccBlock1, neccBlock2;
var valueLength = options.value.length;
this._badness = [];
this._level = ErrorCorrection_1.LEVELS[options.level];
this._polynomial = [];
this._value = options.value;
this._version = 0;
this._stringBuffer = [];
while (this._version < 40) {
this._version++;
index = ((this._level - 1) * 4) + ((this._version - 1) * 16);
neccBlock1 = ErrorCorrection_1.BLOCKS[index++];
neccBlock2 = ErrorCorrection_1.BLOCKS[index++];
dataBlock = ErrorCorrection_1.BLOCKS[index++];
eccBlock = ErrorCorrection_1.BLOCKS[index];
index = (dataBlock * (neccBlock1 + neccBlock2)) + neccBlock2 - 3 + (this._version <= 9);
if (valueLength <= index) {
break;
}
}
this._dataBlock = dataBlock;
this._eccBlock = eccBlock;
this._neccBlock1 = neccBlock1;
this._neccBlock2 = neccBlock2;
/**
* The data width is based on version.
*
* @public
* @type {number}
* @memberof Frame#
*/
// FIXME: Ensure that it fits instead of being truncated.
var width = this.width = 17 + (4 * this._version);
/**
* The image buffer.
*
* @public
* @type {number[]}
* @memberof Frame#
*/
this.buffer = Frame._createArray(width * width);
this._ecc = Frame._createArray(dataBlock + ((dataBlock + eccBlock) * (neccBlock1 + neccBlock2)) + neccBlock2);
this._mask = Frame._createArray(((width * (width + 1)) + 1) / 2);
this._insertFinders();
this._insertAlignments();
// Insert single foreground cell.
this.buffer[8 + (width * (width - 8))] = 1;
this._insertTimingGap();
this._reverseMask();
this._insertTimingRowAndColumn();
this._insertVersion();
this._syncMask();
this._convertBitStream(valueLength);
this._calculatePolynomial();
this._appendEccToData();
this._interleaveBlocks();
this._pack();
this._finish();
}, {
_addAlignment: function(x, y) {
var i;
var buffer = this.buffer;
var width = this.width;
buffer[x + (width * y)] = 1;
for (i = -2; i < 2; i++) {
buffer[x + i + (width * (y - 2))] = 1;
buffer[x - 2 + (width * (y + i + 1))] = 1;
buffer[x + 2 + (width * (y + i))] = 1;
buffer[x + i + 1 + (width * (y + 2))] = 1;
}
for (i = 0; i < 2; i++) {
this._setMask(x - 1, y + i);
this._setMask(x + 1, y - i);
this._setMask(x - i, y - 1);
this._setMask(x + i, y + 1);
}
},
_appendData: function(data, dataLength, ecc, eccLength) {
var bit, i, j;
var polynomial = this._polynomial;
var stringBuffer = this._stringBuffer;
for (i = 0; i < eccLength; i++) {
stringBuffer[ecc + i] = 0;
}
for (i = 0; i < dataLength; i++) {
bit = Galois_1.LOG[stringBuffer[data + i] ^ stringBuffer[ecc]];
if (bit !== 255) {
for (j = 1; j < eccLength; j++) {
stringBuffer[ecc + j - 1] = stringBuffer[ecc + j] ^
Galois_1.EXPONENT[Frame._modN(bit + polynomial[eccLength - j])];
}
} else {
for (j = ecc; j < ecc + eccLength; j++) {
stringBuffer[j] = stringBuffer[j + 1];
}
}
stringBuffer[ecc + eccLength - 1] = bit === 255 ? 0 : Galois_1.EXPONENT[Frame._modN(bit + polynomial[0])];
}
},
_appendEccToData: function() {
var i;
var data = 0;
var dataBlock = this._dataBlock;
var ecc = this._calculateMaxLength();
var eccBlock = this._eccBlock;
for (i = 0; i < this._neccBlock1; i++) {
this._appendData(data, dataBlock, ecc, eccBlock);
data += dataBlock;
ecc += eccBlock;
}
for (i = 0; i < this._neccBlock2; i++) {
this._appendData(data, dataBlock + 1, ecc, eccBlock);
data += dataBlock + 1;
ecc += eccBlock;
}
},
_applyMask: function(mask) {
var r3x, r3y, x, y;
var buffer = this.buffer;
var width = this.width;
switch (mask) {
case 0:
for (y = 0; y < width; y++) {
for (x = 0; x < width; x++) {
if (!((x + y) & 1) && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 1:
for (y = 0; y < width; y++) {
for (x = 0; x < width; x++) {
if (!(y & 1) && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 2:
for (y = 0; y < width; y++) {
for (r3x = 0, x = 0; x < width; x++, r3x++) {
if (r3x === 3) {
r3x = 0;
}
if (!r3x && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 3:
for (r3y = 0, y = 0; y < width; y++, r3y++) {
if (r3y === 3) {
r3y = 0;
}
for (r3x = r3y, x = 0; x < width; x++, r3x++) {
if (r3x === 3) {
r3x = 0;
}
if (!r3x && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 4:
for (y = 0; y < width; y++) {
for (r3x = 0, r3y = (y >> 1) & 1, x = 0; x < width; x++, r3x++) {
if (r3x === 3) {
r3x = 0;
r3y = !r3y;
}
if (!r3y && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 5:
for (r3y = 0, y = 0; y < width; y++, r3y++) {
if (r3y === 3) {
r3y = 0;
}
for (r3x = 0, x = 0; x < width; x++, r3x++) {
if (r3x === 3) {
r3x = 0;
}
if (!((x & y & 1) + !(!r3x | !r3y)) && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 6:
for (r3y = 0, y = 0; y < width; y++, r3y++) {
if (r3y === 3) {
r3y = 0;
}
for (r3x = 0, x = 0; x < width; x++, r3x++) {
if (r3x === 3) {
r3x = 0;
}
if (!((x & y & 1) + (r3x && r3x === r3y) & 1) && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
case 7:
for (r3y = 0, y = 0; y < width; y++, r3y++) {
if (r3y === 3) {
r3y = 0;
}
for (r3x = 0, x = 0; x < width; x++, r3x++) {
if (r3x === 3) {
r3x = 0;
}
if (!((r3x && r3x === r3y) + (x + y & 1) & 1) && !this._isMasked(x, y)) {
buffer[x + (y * width)] ^= 1;
}
}
}
break;
}
},
_calculateMaxLength: function() {
return (this._dataBlock * (this._neccBlock1 + this._neccBlock2)) + this._neccBlock2;
},
_calculatePolynomial: function() {
var i, j;
var eccBlock = this._eccBlock;
var polynomial = this._polynomial;
polynomial[0] = 1;
for (i = 0; i < eccBlock; i++) {
polynomial[i + 1] = 1;
for (j = i; j > 0; j--) {
polynomial[j] = polynomial[j] ? polynomial[j - 1] ^
Galois_1.EXPONENT[Frame._modN(Galois_1.LOG[polynomial[j]] + i)] : polynomial[j - 1];
}
polynomial[0] = Galois_1.EXPONENT[Frame._modN(Galois_1.LOG[polynomial[0]] + i)];
}
// Use logs for generator polynomial to save calculation step.
for (i = 0; i <= eccBlock; i++) {
polynomial[i] = Galois_1.LOG[polynomial[i]];
}
},
_checkBadness: function() {
var b, b1, h, x, y;
var bad = 0;
var badness = this._badness;
var buffer = this.buffer;
var width = this.width;
// Blocks of same colour.
for (y = 0; y < width - 1; y++) {
for (x = 0; x < width - 1; x++) {
// All foreground colour.
if ((buffer[x + (width * y)] &&
buffer[x + 1 + (width * y)] &&
buffer[x + (width * (y + 1))] &&
buffer[x + 1 + (width * (y + 1))]) ||
// All background colour.
!(buffer[x + (width * y)] ||
buffer[x + 1 + (width * y)] ||
buffer[x + (width * (y + 1))] ||
buffer[x + 1 + (width * (y + 1))])) {
bad += Frame.N2;
}
}
}
var bw = 0;
// X runs.
for (y = 0; y < width; y++) {
h = 0;
badness[0] = 0;
for (b = 0, x = 0; x < width; x++) {
b1 = buffer[x + (width * y)];
if (b === b1) {
badness[h]++;
} else {
badness[++h] = 1;
}
b = b1;
bw += b ? 1 : -1;
}
bad += this._getBadness(h);
}
if (bw < 0) {
bw = -bw;
}
var count = 0;
var big = bw;
big += big << 2;
big <<= 1;
while (big > width * width) {
big -= width * width;
count++;
}
bad += count * Frame.N4;
// Y runs.
for (x = 0; x < width; x++) {
h = 0;
badness[0] = 0;
for (b = 0, y = 0; y < width; y++) {
b1 = buffer[x + (width * y)];
if (b === b1) {
badness[h]++;
} else {
badness[++h] = 1;
}
b = b1;
}
bad += this._getBadness(h);
}
return bad;
},
_convertBitStream: function(length) {
var bit, i;
var ecc = this._ecc;
var version = this._version;
// Convert string to bit stream. 8-bit data to QR-coded 8-bit data (numeric, alphanumeric, or kanji not supported).
for (i = 0; i < length; i++) {
ecc[i] = this._value.charCodeAt(i);
}
var stringBuffer = this._stringBuffer = ecc.slice();
var maxLength = this._calculateMaxLength();
if (length >= maxLength - 2) {
length = maxLength - 2;
if (version > 9) {
length--;
}
}
// Shift and re-pack to insert length prefix.
var index = length;
if (version > 9) {
stringBuffer[index + 2] = 0;
stringBuffer[index + 3] = 0;
while (index--) {
bit = stringBuffer[index];
stringBuffer[index + 3] |= 255 & (bit << 4);
stringBuffer[index + 2] = bit >> 4;
}
stringBuffer[2] |= 255 & (length << 4);
stringBuffer[1] = length >> 4;
stringBuffer[0] = 0x40 | (length >> 12);
} else {
stringBuffer[index + 1] = 0;
stringBuffer[index + 2] = 0;
while (index--) {
bit = stringBuffer[index];
stringBuffer[index + 2] |= 255 & (bit << 4);
stringBuffer[index + 1] = bit >> 4;
}
stringBuffer[1] |= 255 & (length << 4);
stringBuffer[0] = 0x40 | (length >> 4);
}
// Fill to end with pad pattern.
index = length + 3 - (version < 10);
while (index < maxLength) {
stringBuffer[index++] = 0xec;
stringBuffer[index++] = 0x11;
}
},
_getBadness: function(length) {
var i;
var badRuns = 0;
var badness = this._badness;
for (i = 0; i <= length; i++) {
if (badness[i] >= 5) {
badRuns += Frame.N1 + badness[i] - 5;
}
}
// FBFFFBF as in finder.
for (i = 3; i < length - 1; i += 2) {
if (badness[i - 2] === badness[i + 2] &&
badness[i + 2] === badness[i - 1] &&
badness[i - 1] === badness[i + 1] &&
badness[i - 1] * 3 === badness[i] &&
// Background around the foreground pattern? Not part of the specs.
(badness[i - 3] === 0 || i + 3 > length ||
badness[i - 3] * 3 >= badness[i] * 4 ||
badness[i + 3] * 3 >= badness[i] * 4)) {
badRuns += Frame.N3;
}
}
return badRuns;
},
_finish: function() {
// Save pre-mask copy of frame.
this._stringBuffer = this.buffer.slice();
var currentMask, i;
var bit = 0;
var mask = 30000;
/*
* Using for instead of while since in original Arduino code if an early mask was "good enough" it wouldn't try for
* a better one since they get more complex and take longer.
*/
for (i = 0; i < 8; i++) {
// Returns foreground-background imbalance.
this._applyMask(i);
currentMask = this._checkBadness();
// Is current mask better than previous best?
if (currentMask < mask) {
mask = currentMask;
bit = i;
}
// Don't increment "i" to a void redoing mask.
if (bit === 7) {
break;
}
// Reset for next pass.
this.buffer = this._stringBuffer.slice();
}
// Redo best mask as none were "good enough" (i.e. last wasn't bit).
if (bit !== i) {
this._applyMask(bit);
}
// Add in final mask/ECC level bytes.
mask = ErrorCorrection_1.FINAL_FORMAT[bit + (this._level - 1 << 3)];
var buffer = this.buffer;
var width = this.width;
// Low byte.
for (i = 0; i < 8; i++, mask >>= 1) {
if (mask & 1) {
buffer[width - 1 - i + (width * 8)] = 1;
if (i < 6) {
buffer[8 + (width * i)] = 1;
} else {
buffer[8 + (width * (i + 1))] = 1;
}
}
}
// High byte.
for (i = 0; i < 7; i++, mask >>= 1) {
if (mask & 1) {
buffer[8 + (width * (width - 7 + i))] = 1;
if (i) {
buffer[6 - i + (width * 8)] = 1;
} else {
buffer[7 + (width * 8)] = 1;
}
}
}
},
_interleaveBlocks: function() {
var i, j;
var dataBlock = this._dataBlock;
var ecc = this._ecc;
var eccBlock = this._eccBlock;
var k = 0;
var maxLength = this._calculateMaxLength();
var neccBlock1 = this._neccBlock1;
var neccBlock2 = this._neccBlock2;
var stringBuffer = this._stringBuffer;
for (i = 0; i < dataBlock; i++) {
for (j = 0; j < neccBlock1; j++) {
ecc[k++] = stringBuffer[i + (j * dataBlock)];
}
for (j = 0; j < neccBlock2; j++) {
ecc[k++] = stringBuffer[(neccBlock1 * dataBlock) + i + (j * (dataBlock + 1))];
}
}
for (j = 0; j < neccBlock2; j++) {
ecc[k++] = stringBuffer[(neccBlock1 * dataBlock) + i + (j * (dataBlock + 1))];
}
for (i = 0; i < eccBlock; i++) {
for (j = 0; j < neccBlock1 + neccBlock2; j++) {
ecc[k++] = stringBuffer[maxLength + i + (j * eccBlock)];
}
}
this._stringBuffer = ecc;
},
_insertAlignments: function() {
var i, x, y;
var version = this._version;
var width = this.width;
if (version > 1) {
i = Alignment_1.BLOCK[version];
y = width - 7;
for (;;) {
x = width - 7;
while (x > i - 3) {
this._addAlignment(x, y);
if (x < i) {
break;
}
x -= i;
}
if (y <= i + 9) {
break;
}
y -= i;
this._addAlignment(6, y);
this._addAlignment(y, 6);
}
}
},
_insertFinders: function() {
var i, j, x, y;
var buffer = this.buffer;
var width = this.width;
for (i = 0; i < 3; i++) {
j = 0;
y = 0;
if (i === 1) {
j = width - 7;
}
if (i === 2) {
y = width - 7;
}
buffer[y + 3 + (width * (j + 3))] = 1;
for (x = 0; x < 6; x++) {
buffer[y + x + (width * j)] = 1;
buffer[y + (width * (j + x + 1))] = 1;
buffer[y + 6 + (width * (j + x))] = 1;
buffer[y + x + 1 + (width * (j + 6))] = 1;
}
for (x = 1; x < 5; x++) {
this._setMask(y + x, j + 1);
this._setMask(y + 1, j + x + 1);
this._setMask(y + 5, j + x);
this._setMask(y + x + 1, j + 5);
}
for (x = 2; x < 4; x++) {
buffer[y + x + (width * (j + 2))] = 1;
buffer[y + 2 + (width * (j + x + 1))] = 1;
buffer[y + 4 + (width * (j + x))] = 1;
buffer[y + x + 1 + (width * (j + 4))] = 1;
}
}
},
_insertTimingGap: function() {
var x, y;
var width = this.width;
for (y = 0; y < 7; y++) {
this._setMask(7, y);
this._setMask(width - 8, y);
this._setMask(7, y + width - 7);
}
for (x = 0; x < 8; x++) {
this._setMask(x, 7);
this._setMask(x + width - 8, 7);
this._setMask(x, width - 8);
}
},
_insertTimingRowAndColumn: function() {
var x;
var buffer = this.buffer;
var width = this.width;
for (x = 0; x < width - 14; x++) {
if (x & 1) {
this._setMask(8 + x, 6);
this._setMask(6, 8 + x);
} else {
buffer[8 + x + (width * 6)] = 1;
buffer[6 + (width * (8 + x))] = 1;
}
}
},
_insertVersion: function() {
var i, j, x, y;
var buffer = this.buffer;
var version = this._version;
var width = this.width;
if (version > 6) {
i = Version_1.BLOCK[version - 7];
j = 17;
for (x = 0; x < 6; x++) {
for (y = 0; y < 3; y++, j--) {
if (1 & (j > 11 ? version >> j - 12 : i >> j)) {
buffer[5 - x + (width * (2 - y + width - 11))] = 1;
buffer[2 - y + width - 11 + (width * (5 - x))] = 1;
} else {
this._setMask(5 - x, 2 - y + width - 11);
this._setMask(2 - y + width - 11, 5 - x);
}
}
}
}
},
_isMasked: function(x, y) {
var bit = Frame._getMaskBit(x, y);
return this._mask[bit] === 1;
},
_pack: function() {
var bit, i, j;
var k = 1;
var v = 1;
var width = this.width;
var x = width - 1;
var y = width - 1;
// Interleaved data and ECC codes.
var length = ((this._dataBlock + this._eccBlock) * (this._neccBlock1 + this._neccBlock2)) + this._neccBlock2;
for (i = 0; i < length; i++) {
bit = this._stringBuffer[i];
for (j = 0; j < 8; j++, bit <<= 1) {
if (0x80 & bit) {
this.buffer[x + (width * y)] = 1;
}
// Find next fill position.
do {
if (v) {
x--;
} else {
x++;
if (k) {
if (y !== 0) {
y--;
} else {
x -= 2;
k = !k;
if (x === 6) {
x--;
y = 9;
}
}
} else if (y !== width - 1) {
y++;
} else {
x -= 2;
k = !k;
if (x === 6) {
x--;
y -= 8;
}
}
}
v = !v;
} while (this._isMasked(x, y));
}
}
},
_reverseMask: function() {
var x, y;
var width = this.width;
for (x = 0; x < 9; x++) {
this._setMask(x, 8);
}
for (x = 0; x < 8; x++) {
this._setMask(x + width - 8, 8);
this._setMask(8, x);
}
for (y = 0; y < 7; y++) {
this._setMask(8, y + width - 7);
}
},
_setMask: function(x, y) {
var bit = Frame._getMaskBit(x, y);
this._mask[bit] = 1;
},
_syncMask: function() {
var x, y;
var width = this.width;
for (y = 0; y < width; y++) {
for (x = 0; x <= y; x++) {
if (this.buffer[x + (width * y)]) {
this._setMask(x, y);
}
}
}
}
}, {
_createArray: function(length) {
var i;
var array = [];
for (i = 0; i < length; i++) {
array[i] = 0;
}
return array;
},
_getMaskBit: function(x, y) {
var bit;
if (x > y) {
bit = x;
x = y;
y = bit;
}
bit = y;
bit += y * y;
bit >>= 1;
bit += x;
return bit;
},
_modN: function(x) {
while (x >= 255) {
x -= 255;
x = (x >> 8) + (x & 255);
}
return x;
},
// *Badness* coefficients.
N1: 3,
N2: 3,
N3: 40,
N4: 10
});
var Frame_1 = Frame;
/**
* The options used by {@link Frame}.
*
* @typedef {Object} Frame~Options
* @property {string} level - The ECC level to be used.
* @property {string} value - The value to be encoded.
*/
/**
* An implementation of {@link Renderer} for working with <code>img</code> elements.
*
* This depends on {@link CanvasRenderer} being executed first as this implementation simply applies the data URL from
* the rendered <code>canvas</code> element as the <code>src</code> for the <code>img</code> element being rendered.
*
* @public
* @class
* @extends Renderer
*/
var ImageRenderer = Renderer_1.extend({
/**
* @override
*/
draw: function() {
this.element.src = this.qrious.toDataURL();
},
/**
* @override
*/
reset: function() {
this.element.src = '';
},
/**
* @override
*/
resize: function() {
var element = this.element;
element.width = element.height = this.qrious.size;
}
});
var ImageRenderer_1 = ImageRenderer;
/**
* Defines an available option while also configuring how values are applied to the target object.
*
* Optionally, a default value can be specified as well a value transformer for greater control over how the option
* value is applied.
*
* If no value transformer is specified, then any specified option will be applied directly. All values are maintained
* on the target object itself as a field using the option name prefixed with a single underscore.
*
* When an option is specified as modifiable, the {@link OptionManager} will be required to include a setter for the
* property that is defined on the target object that uses the option name.
*
* @param {string} name - the name to be used
* @param {boolean} [modifiable] - <code>true</code> if the property defined on target objects should include a setter;
* otherwise <code>false</code>
* @param {*} [defaultValue] - the default value to be used
* @param {Option~ValueTransformer} [valueTransformer] - the value transformer to be used
* @public
* @class
* @extends Nevis
*/
var Option = lite.extend(function(name, modifiable, defaultValue, valueTransformer) {
/**
* The name for this {@link Option}.
*
* @public
* @type {string}
* @memberof Option#
*/
this.name = name;
/**
* Whether a setter should be included on the property defined on target objects for this {@link Option}.
*
* @public
* @type {boolean}
* @memberof Option#
*/
this.modifiable = Boolean(modifiable);
/**
* The default value for this {@link Option}.
*
* @public
* @type {*}
* @memberof Option#
*/
this.defaultValue = defaultValue;
this._valueTransformer = valueTransformer;
}, {
/**
* Transforms the specified <code>value</code> so that it can be applied for this {@link Option}.
*
* If a value transformer has been specified for this {@link Option}, it will be called upon to transform
* <code>value</code>. Otherwise, <code>value</code> will be returned directly.
*
* @param {*} value - the value to be transformed
* @return {*} The transformed value or <code>value</code> if no value transformer is specified.
* @public
* @memberof Option#
*/
transform: function(value) {
var transformer = this._valueTransformer;
if (typeof transformer === 'function') {
return transformer(value, this);
}
return value;
}
});
var Option_1 = Option;
/**
* Returns a transformed value for the specified <code>value</code> to be applied for the <code>option</code> provided.
*
* @callback Option~ValueTransformer
* @param {*} value - the value to be transformed
* @param {Option} option - the {@link Option} for which <code>value</code> is being transformed
* @return {*} The transform value.
*/
/**
* Contains utility methods that are useful throughout the library.
*
* @public
* @class
* @extends Nevis
*/
var Utilities = lite.extend(null, {
/**
* Returns the absolute value of a given number.
*
* This method is simply a convenient shorthand for <code>Math.abs</code> while ensuring that nulls are returned as
* <code>null</code> instead of zero.
*
* @param {number} value - the number whose absolute value is to be returned
* @return {number} The absolute value of <code>value</code> or <code>null</code> if <code>value</code> is
* <code>null</code>.
* @public
* @static
* @memberof Utilities
*/
abs: function(value) {
return value != null ? Math.abs(value) : null;
},
/**
* Returns whether the specified <code>object</code> has a property with the specified <code>name</code> as an own
* (not inherited) property.
*
* @param {Object} object - the object on which the property is to be checked
* @param {string} name - the name of the property to be checked
* @return {boolean} <code>true</code> if <code>object</code> has an own property with <code>name</code>.
* @public
* @static
* @memberof Utilities
*/
hasOwn: function(object, name) {
return Object.prototype.hasOwnProperty.call(object, name);
},
/**
* A non-operation method that does absolutely nothing.
*
* @return {void}
* @public
* @static
* @memberof Utilities
*/
noop: function() {},
/**
* Transforms the specified <code>string</code> to upper case while remaining null-safe.
*
* @param {string} string - the string to be transformed to upper case
* @return {string} <code>string</code> transformed to upper case if <code>string</code> is not <code>null</code>.
* @public
* @static
* @memberof Utilities
*/
toUpperCase: function(string) {
return string != null ? string.toUpperCase() : null;
}
});
var Utilities_1 = Utilities;
/**
* Manages multiple {@link Option} instances that are intended to be used by multiple implementations.
*
* Although the option definitions are shared between targets, the values are maintained on the targets themselves.
*
* @param {Option[]} options - the options to be used
* @public
* @class
* @extends Nevis
*/
var OptionManager = lite.extend(function(options) {
/**
* The available options for this {@link OptionManager}.
*
* @public
* @type {Object.<string, Option>}
* @memberof OptionManager#
*/
this.options = {};
options.forEach(function(option) {
this.options[option.name] = option;
}, this);
}, {
/**
* Returns whether an option with the specified <code>name</code> is available.
*
* @param {string} name - the name of the {@link Option} whose existence is to be checked
* @return {boolean} <code>true</code> if an {@link Option} exists with <code>name</code>; otherwise
* <code>false</code>.
* @public
* @memberof OptionManager#
*/
exists: function(name) {
return this.options[name] != null;
},
/**
* Returns the value of the option with the specified <code>name</code> on the <code>target</code> object provided.
*
* @param {string} name - the name of the {@link Option} whose value on <code>target</code> is to be returned
* @param {Object} target - the object from which the value of the named {@link Option} is to be returned
* @return {*} The value of the {@link Option} with <code>name</code> on <code>target</code>.
* @public
* @memberof OptionManager#
*/
get: function(name, target) {
return OptionManager._get(this.options[name], target);
},
/**
* Returns a copy of all of the available options on the <code>target</code> object provided.
*
* @param {Object} target - the object from which the option name/value pairs are to be returned
* @return {Object.<string, *>} A hash containing the name/value pairs of all options on <code>target</code>.
* @public
* @memberof OptionManager#
*/
getAll: function(target) {
var name;
var options = this.options;
var result = {};
for (name in options) {
if (Utilities_1.hasOwn(options, name)) {
result[name] = OptionManager._get(options[name], target);
}
}
return result;
},
/**
* Initializes the available options for the <code>target</code> object provided and then applies the initial values
* within the speciifed <code>options</code>.
*
* This method will throw an error if any of the names within <code>options</code> does not match an available option.
*
* This involves setting the default values and defining properties for all of the available options on
* <code>target</code> before finally calling {@link OptionMananger#setAll} with <code>options</code> and
* <code>target</code>. Any options that are configured to be modifiable will have a setter included in their defined
* property that will allow its corresponding value to be modified.
*
* If a change handler is specified, it will be called whenever the value changes on <code>target</code> for a
* modifiable option, but only when done so via the defined property's setter.
*
* @param {Object.<string, *>} options - the name/value pairs of the initial options to be set
* @param {Object} target - the object on which the options are to be initialized
* @param {Function} [changeHandler] - the function to be called whenever the value of an modifiable option changes on
* <code>target</code>
* @return {void}
* @throws {Error} If <code>options</code> contains an invalid option name.
* @public
* @memberof OptionManager#
*/
init: function(options, target, changeHandler) {
if (typeof changeHandler !== 'function') {
changeHandler = Utilities_1.noop;
}
var name, option;
for (name in this.options) {
if (Utilities_1.hasOwn(this.options, name)) {
option = this.options[name];
OptionManager._set(option, option.defaultValue, target);
OptionManager._createAccessor(option, target, changeHandler);
}
}
this._setAll(options, target, true);
},
/**
* Sets the value of the option with the specified <code>name</code> on the <code>target</code> object provided to
* <code>value</code>.
*
* This method will throw an error if <code>name</code> does not match an available option or matches an option that
* cannot be modified.
*
* If <code>value</code> is <code>null</code> and the {@link Option} has a default value configured, then that default
* value will be used instead. If the {@link Option} also has a value transformer configured, it will be used to
* transform whichever value was determined to be used.
*
* This method returns whether the value of the underlying field on <code>target</code> was changed as a result.
*
* @param {string} name - the name of the {@link Option} whose value is to be set
* @param {*} value - the value to be set for the named {@link Option} on <code>target</code>
* @param {Object} target - the object on which <code>value</code> is to be set for the named {@link Option}
* @return {boolean} <code>true</code> if the underlying field on <code>target</code> was changed; otherwise
* <code>false</code>.
* @throws {Error} If <code>name</code> is invalid or is for an option that cannot be modified.
* @public
* @memberof OptionManager#
*/
set: function(name, value, target) {
return this._set(name, value, target);
},
/**
* Sets all of the specified <code>options</code> on the <code>target</code> object provided to their corresponding
* values.
*
* This method will throw an error if any of the names within <code>options</code> does not match an available option
* or matches an option that cannot be modified.
*
* If any value within <code>options</code> is <code>null</code> and the corresponding {@link Option} has a default
* value configured, then that default value will be used instead. If an {@link Option} also has a value transformer
* configured, it will be used to transform whichever value was determined to be used.
*
* This method returns whether the value for any of the underlying fields on <code>target</code> were changed as a
* result.
*
* @param {Object.<string, *>} options - the name/value pairs of options to be set
* @param {Object} target - the object on which the options are to be set
* @return {boolean} <code>true</code> if any of the underlying fields on <code>target</code> were changed; otherwise
* <code>false</code>.
* @throws {Error} If <code>options</code> contains an invalid option name or an option that cannot be modiifed.
* @public
* @memberof OptionManager#
*/
setAll: function(options, target) {
return this._setAll(options, target);
},
_set: function(name, value, target, allowUnmodifiable) {
var option = this.options[name];
if (!option) {
throw new Error('Invalid option: ' + name);
}
if (!option.modifiable && !allowUnmodifiable) {
throw new Error('Option cannot be modified: ' + name);
}
return OptionManager._set(option, value, target);
},
_setAll: function(options, target, allowUnmodifiable) {
if (!options) {
return false;
}
var name;
var changed = false;
for (name in options) {
if (Utilities_1.hasOwn(options, name) && this._set(name, options[name], target, allowUnmodifiable)) {
changed = true;
}
}
return changed;
}
}, {
_createAccessor: function(option, target, changeHandler) {
var descriptor = {
get: function() {
return OptionManager._get(option, target);
}
};
if (option.modifiable) {
descriptor.set = function(value) {
if (OptionManager._set(option, value, target)) {
changeHandler(value, option);
}
};
}
Object.defineProperty(target, option.name, descriptor);
},
_get: function(option, target) {
return target['_' + option.name];
},
_set: function(option, value, target) {
var fieldName = '_' + option.name;
var oldValue = target[fieldName];
var newValue = option.transform(value != null ? value : option.defaultValue);
target[fieldName] = newValue;
return newValue !== oldValue;
}
});
var OptionManager_1 = OptionManager;
/**
* Called whenever the value of a modifiable {@link Option} is changed on a target object via the defined property's
* setter.
*
* @callback OptionManager~ChangeHandler
* @param {*} value - the new value for <code>option</code> on the target object
* @param {Option} option - the modifable {@link Option} whose value has changed on the target object.
* @return {void}
*/
/**
* A basic manager for {@link Service} implementations that are mapped to simple names.
*
* @public
* @class
* @extends Nevis
*/
var ServiceManager = lite.extend(function() {
this._services = {};
}, {
/**
* Returns the {@link Service} being managed with the specified <code>name</code>.
*
* @param {string} name - the name of the {@link Service} to be returned
* @return {Service} The {@link Service} is being managed with <code>name</code>.
* @throws {Error} If no {@link Service} is being managed with <code>name</code>.
* @public
* @memberof ServiceManager#
*/
getService: function(name) {
var service = this._services[name];
if (!service) {
throw new Error('Service is not being managed with name: ' + name);
}
return service;
},
/**
* Sets the {@link Service} implementation to be managed for the specified <code>name</code> to the
* <code>service</code> provided.
*
* @param {string} name - the name of the {@link Service} to be managed with <code>name</code>
* @param {Service} service - the {@link Service} implementation to be managed
* @return {void}
* @throws {Error} If a {@link Service} is already being managed with the same <code>name</code>.
* @public
* @memberof ServiceManager#
*/
setService: function(name, service) {
if (this._services[name]) {
throw new Error('Service is already managed with name: ' + name);
}
if (service) {
this._services[name] = service;
}
}
});
var ServiceManager_1 = ServiceManager;
var optionManager = new OptionManager_1([
new Option_1('background', true, 'white'),
new Option_1('backgroundAlpha', true, 1, Utilities_1.abs),
new Option_1('element'),
new Option_1('foreground', true, 'black'),
new Option_1('foregroundAlpha', true, 1, Utilities_1.abs),
new Option_1('level', true, 'L', Utilities_1.toUpperCase),
new Option_1('mime', true, 'image/png'),
new Option_1('padding', true, null, Utilities_1.abs),
new Option_1('size', true, 100, Utilities_1.abs),
new Option_1('value', true, '')
]);
var serviceManager = new ServiceManager_1();
/**
* Enables configuration of a QR code generator which uses HTML5 <code>canvas</code> for rendering.
*
* @param {QRious~Options} [options] - the options to be used
* @throws {Error} If any <code>options</code> are invalid.
* @public
* @class
* @extends Nevis
*/
var QRious = lite.extend(function(options) {
optionManager.init(options, this, this.update.bind(this));
var element = optionManager.get('element', this);
var elementService = serviceManager.getService('element');
var canvas = element && elementService.isCanvas(element) ? element : elementService.createCanvas();
var image = element && elementService.isImage(element) ? element : elementService.createImage();
this._canvasRenderer = new CanvasRenderer_1(this, canvas, true);
this._imageRenderer = new ImageRenderer_1(this, image, image === element);
this.update();
}, {
/**
* Returns all of the options configured for this {@link QRious}.
*
* Any changes made to the returned object will not be reflected in the options themselves or their corresponding
* underlying fields.
*
* @return {Object.<string, *>} A copy of the applied options.
* @public
* @memberof QRious#
*/
get: function() {
return optionManager.getAll(this);
},
/**
* Sets all of the specified <code>options</code> and automatically updates this {@link QRious} if any of the
* underlying fields are changed as a result.
*
* This is the preferred method for updating multiple options at one time to avoid unnecessary updates between
* changes.
*
* @param {QRious~Options} options - the options to be set
* @return {void}
* @throws {Error} If any <code>options</code> are invalid or cannot be modified.
* @public
* @memberof QRious#
*/
set: function(options) {
if (optionManager.setAll(options, this)) {
this.update();
}
},
/**
* Returns the image data URI for the generated QR code using the <code>mime</code> provided.
*
* @param {string} [mime] - the MIME type for the image
* @return {string} The image data URI for the QR code.
* @public
* @memberof QRious#
*/
toDataURL: function(mime) {
return this.canvas.toDataURL(mime || this.mime);
},
/**
* Updates this {@link QRious} by generating a new {@link Frame} and re-rendering the QR code.
*
* @return {void}
* @protected
* @memberof QRious#
*/
update: function() {
var frame = new Frame_1({
level: this.level,
value: this.value
});
this._canvasRenderer.render(frame);
this._imageRenderer.render(frame);
}
}, {
/**
* Configures the <code>service</code> provided to be used by all {@link QRious} instances.
*
* @param {Service} service - the {@link Service} to be configured
* @return {void}
* @throws {Error} If a {@link Service} has already been configured with the same name.
* @public
* @static
* @memberof QRious
*/
use: function(service) {
serviceManager.setService(service.getName(), service);
}
});
Object.defineProperties(QRious.prototype, {
canvas: {
/**
* Returns the <code>canvas</code> element being used to render the QR code for this {@link QRious}.
*
* @return {*} The <code>canvas</code> element.
* @public
* @memberof QRious#
* @alias canvas
*/
get: function() {
return this._canvasRenderer.getElement();
}
},
image: {
/**
* Returns the <code>img</code> element being used to render the QR code for this {@link QRious}.
*
* @return {*} The <code>img</code> element.
* @public
* @memberof QRious#
* @alias image
*/
get: function() {
return this._imageRenderer.getElement();
}
}
});
var QRious_1$2 = QRious;
/**
* The options used by {@link QRious}.
*
* @typedef {Object} QRious~Options
* @property {string} [background="white"] - The background color to be applied to the QR code.
* @property {number} [backgroundAlpha=1] - The background alpha to be applied to the QR code.
* @property {*} [element] - The element to be used to render the QR code which may either be an <code>canvas</code> or
* <code>img</code>. The element(s) will be created if needed.
* @property {string} [foreground="black"] - The foreground color to be applied to the QR code.
* @property {number} [foregroundAlpha=1] - The foreground alpha to be applied to the QR code.
* @property {string} [level="L"] - The error correction level to be applied to the QR code.
* @property {string} [mime="image/png"] - The MIME type to be used to render the image for the QR code.
* @property {number} [padding] - The padding for the QR code in pixels.
* @property {number} [size=100] - The size of the QR code in pixels.
* @property {string} [value=""] - The value to be encoded within the QR code.
*/
var index = QRious_1$2;
/**
* Defines a service contract that must be met by all implementations.
*
* @public
* @class
* @extends Nevis
*/
var Service = lite.extend({
/**
* Returns the name of this {@link Service}.
*
* @return {string} The service name.
* @public
* @abstract
* @memberof Service#
*/
getName: function() {}
});
var Service_1 = Service;
/**
* A service for working with elements.
*
* @public
* @class
* @extends Service
*/
var ElementService = Service_1.extend({
/**
* Creates an instance of a canvas element.
*
* Implementations of {@link ElementService} <b>must</b> override this method with their own specific logic.
*
* @return {*} The newly created canvas element.
* @public
* @abstract
* @memberof ElementService#
*/
createCanvas: function() {},
/**
* Creates an instance of a image element.
*
* Implementations of {@link ElementService} <b>must</b> override this method with their own specific logic.
*
* @return {*} The newly created image element.
* @public
* @abstract
* @memberof ElementService#
*/
createImage: function() {},
/**
* @override
*/
getName: function() {
return 'element';
},
/**
* Returns whether the specified <code>element</code> is a canvas.
*
* Implementations of {@link ElementService} <b>must</b> override this method with their own specific logic.
*
* @param {*} element - the element to be checked
* @return {boolean} <code>true</code> if <code>element</code> is a canvas; otherwise <code>false</code>.
* @public
* @abstract
* @memberof ElementService#
*/
isCanvas: function(element) {},
/**
* Returns whether the specified <code>element</code> is an image.
*
* Implementations of {@link ElementService} <b>must</b> override this method with their own specific logic.
*
* @param {*} element - the element to be checked
* @return {boolean} <code>true</code> if <code>element</code> is an image; otherwise <code>false</code>.
* @public
* @abstract
* @memberof ElementService#
*/
isImage: function(element) {}
});
var ElementService_1 = ElementService;
/**
* An implementation of {@link ElementService} intended for use within a browser environment.
*
* @public
* @class
* @extends ElementService
*/
var BrowserElementService = ElementService_1.extend({
/**
* @override
*/
createCanvas: function() {
return document.createElement('canvas');
},
/**
* @override
*/
createImage: function() {
return document.createElement('img');
},
/**
* @override
*/
isCanvas: function(element) {
return element instanceof HTMLCanvasElement;
},
/**
* @override
*/
isImage: function(element) {
return element instanceof HTMLImageElement;
}
});
var BrowserElementService_1 = BrowserElementService;
index.use(new BrowserElementService_1());
var QRious_1 = index;
return QRious_1;
})));
// Based on https://github.com/LinusU/base32-encode/blob/master/index.js
function hex_to_b32(hex) {
let alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";
let bytes = [];
for (let i = 0; i < hex.length; i += 2) {
bytes.push(parseInt(hex.substr(i, 2), 16));
}
let bits = 0;
let value = 0;
let output = '';
for (let i = 0; i < bytes.length; i++) {
value = (value << 8) | bytes[i];
bits += 8;
while (bits >= 5) {
output += alphabet[(value >>> (bits - 5)) & 31];
bits -= 5;
}
}
if (bits > 0) {
output += alphabet[(value << (5 - bits)) & 31];
}
return output;
}
// Based on https://github.com/adriancooney/console.image
function console_image(url, size) {
console.log("%c+", "font-size: 1px; padding: " + Math.floor(size / 2) + "px " + Math.floor(size / 2) + "px; line-height: " + size + "px; background: url(" + url + "); color: transparent;");
}
// Based on https://gist.github.com/gboudreau/94bb0c11a6209c82418d01a59d958c93#gistcomment-2224133
console.warn("Here's your Authy tokens:");
appManager.getModel().forEach(function(i) {
let qr_size = 200;
let secret = (i.markedForDeletion === false ? i.decryptedSeed : hex_to_b32(i.secretSeed));
let period = (i.digits === 7 ? 10 : 30);
let totp_uri = `otpauth://totp/${encodeURIComponent(i.name)}?secret=${secret}&digits=${i.digits}&period=${period}`;
console.group(i.name);
console.log('TOTP secret:', secret);
console.log('TOTP URI:', totp_uri);
let url = (new QRious({
value: totp_uri,
size: qr_size
})).toDataURL();
console_image(url, qr_size);
console.groupEnd();
});