{"version":3,"sources":["jsdelivr-header.js","/npm/nayuki-qr-code-generator@1.8.0/index.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,ACgBA,aACA,IAAI,WACJ,SAAW,GAkBP,MAAM,EAMF,WAAA,CAGA,EAEA,EAAsB,EAAe,GASjC,GARA,KAAK,QAAU,EACf,KAAK,qBAAuB,EAG5B,KAAK,QAAU,GAEf,KAAK,WAAa,GAEd,EAAU,EAAO,aAAe,EAAU,EAAO,YACjD,MAAM,IAAI,WAAW,8BACzB,GAAI,GAAO,GAAK,EAAM,EAClB,MAAM,IAAI,WAAW,2BACzB,KAAK,KAAiB,EAAV,EAAc,GAE1B,IAAI,EAAM,GACV,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAC3B,EAAI,MAAK,GACb,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAC3B,KAAK,QAAQ,KAAK,EAAI,SACtB,KAAK,WAAW,KAAK,EAAI,SAG7B,KAAK,uBACL,MAAM,EAAe,KAAK,oBAAoB,GAG9C,GAFA,KAAK,cAAc,IAEP,GAAR,EAAW,CACX,IAAI,EAAa,IACjB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,KAAK,UAAU,GACf,KAAK,eAAe,GACpB,MAAM,EAAU,KAAK,kBACjB,EAAU,IACV,EAAM,EACN,EAAa,GAEjB,KAAK,UAAU,EACnB,CACJ,CACA,EAAO,GAAK,GAAO,GAAO,GAC1B,KAAK,KAAO,EACZ,KAAK,UAAU,GACf,KAAK,eAAe,GACpB,KAAK,WAAa,EACtB,CAOA,iBAAO,CAAW,EAAM,GACpB,MAAM,EAAO,EAAU,UAAU,aAAa,GAC9C,OAAO,EAAO,eAAe,EAAM,EACvC,CAKA,mBAAO,CAAa,EAAM,GACtB,MAAM,EAAM,EAAU,UAAU,UAAU,GAC1C,OAAO,EAAO,eAAe,CAAC,GAAM,EACxC,CAWA,qBAAO,CAAe,EAAM,EAAK,EAAa,EAAG,EAAa,GAAI,GAAO,EAAI,GAAW,GACpF,KAAM,EAAO,aAAe,GAAc,GAAc,GAAc,GAAc,EAAO,cACpF,GAAQ,GAAK,EAAO,EACvB,MAAM,IAAI,WAAW,iBAEzB,IAAI,EACA,EACJ,IAAK,EAAU,GAAa,IAAW,CACnC,MAAM,EAA8D,EAA3C,EAAO,oBAAoB,EAAS,GACvD,EAAW,EAAU,aAAa,EAAM,GAC9C,GAAI,GAAY,EAAkB,CAC9B,EAAe,EACf,KACJ,CACA,GAAI,GAAW,EACX,MAAM,IAAI,WAAW,gBAC7B,CAEA,IAAK,MAAM,IAAU,CAAC,EAAO,IAAI,OAAQ,EAAO,IAAI,SAAU,EAAO,IAAI,MACjE,GAAY,GAA8D,EAA9C,EAAO,oBAAoB,EAAS,KAChE,EAAM,GAGd,IAAI,EAAK,GACT,IAAK,MAAM,KAAO,EAAM,CACpB,EAAW,EAAI,KAAK,SAAU,EAAG,GACjC,EAAW,EAAI,SAAU,EAAI,KAAK,iBAAiB,GAAU,GAC7D,IAAK,MAAM,KAAK,EAAI,UAChB,EAAG,KAAK,EAChB,CACA,EAAO,EAAG,QAAU,GAEpB,MAAM,EAA8D,EAA3C,EAAO,oBAAoB,EAAS,GAC7D,EAAO,EAAG,QAAU,GACpB,EAAW,EAAG,KAAK,IAAI,EAAG,EAAmB,EAAG,QAAS,GACzD,EAAW,GAAI,EAAI,EAAG,OAAS,GAAK,EAAG,GACvC,EAAO,EAAG,OAAS,GAAK,GAExB,IAAK,IAAI,EAAU,IAAM,EAAG,OAAS,EAAkB,GAAW,IAC9D,EAAW,EAAS,EAAG,GAE3B,IAAI,EAAgB,GACpB,KAA8B,EAAvB,EAAc,OAAa,EAAG,QACjC,EAAc,KAAK,GAGvB,OAFA,EAAG,SAAQ,CAAC,EAAG,IAAM,EAAc,IAAM,IAAM,GAAM,GAAS,EAAJ,KAEnD,IAAI,EAAO,EAAS,EAAK,EAAe,EACnD,CAKA,SAAA,CAAU,EAAG,GACT,OAAO,GAAK,GAAK,EAAI,KAAK,MAAQ,GAAK,GAAK,EAAI,KAAK,MAAQ,KAAK,QAAQ,GAAG,EACjF,CAGA,oBAAA,GAEI,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAC3B,KAAK,kBAAkB,EAAG,EAAG,EAAI,GAAK,GACtC,KAAK,kBAAkB,EAAG,EAAG,EAAI,GAAK,GAG1C,KAAK,kBAAkB,EAAG,GAC1B,KAAK,kBAAkB,KAAK,KAAO,EAAG,GACtC,KAAK,kBAAkB,EAAG,KAAK,KAAO,GAEtC,MAAM,EAAc,KAAK,+BACnB,EAAW,EAAY,OAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,IAC1B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,IAEf,GAAL,GAAe,GAAL,GAAe,GAAL,GAAU,GAAK,EAAW,GAAK,GAAK,EAAW,GAAU,GAAL,GAC1E,KAAK,qBAAqB,EAAY,GAAI,EAAY,IAIlE,KAAK,eAAe,GACpB,KAAK,aACT,CAGA,cAAA,CAAe,GAEX,MAAM,EAAO,KAAK,qBAAqB,YAAc,EAAI,EACzD,IAAI,EAAM,EACV,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,EAAO,GAAO,EAAoB,MAAb,IAAQ,GACjC,MAAM,EAA4B,OAApB,GAAQ,GAAK,GAC3B,EAAO,IAAS,IAAM,GAEtB,IAAK,IAAI,EAAI,EAAG,GAAK,EAAG,IACpB,KAAK,kBAAkB,EAAG,EAAG,EAAO,EAAM,IAC9C,KAAK,kBAAkB,EAAG,EAAG,EAAO,EAAM,IAC1C,KAAK,kBAAkB,EAAG,EAAG,EAAO,EAAM,IAC1C,KAAK,kBAAkB,EAAG,EAAG,EAAO,EAAM,IAC1C,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,KAAK,kBAAkB,GAAK,EAAG,EAAG,EAAO,EAAM,IAEnD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACnB,KAAK,kBAAkB,KAAK,KAAO,EAAI,EAAG,EAAG,EAAO,EAAM,IAC9D,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,KAAK,kBAAkB,EAAG,KAAK,KAAO,GAAK,EAAG,EAAO,EAAM,IAC/D,KAAK,kBAAkB,EAAG,KAAK,KAAO,GAAG,EAC7C,CAGA,WAAA,GACI,GAAI,KAAK,QAAU,EACf,OAEJ,IAAI,EAAM,KAAK,QACf,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,EAAO,GAAO,EAAqB,MAAd,IAAQ,IACjC,MAAM,EAAO,KAAK,SAAW,GAAK,EAClC,EAAO,IAAS,IAAM,GAEtB,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IAAK,CACzB,MAAM,EAAQ,EAAO,EAAM,GACrB,EAAI,KAAK,KAAO,GAAK,EAAI,EACzB,EAAI,KAAK,MAAM,EAAI,GACzB,KAAK,kBAAkB,EAAG,EAAG,GAC7B,KAAK,kBAAkB,EAAG,EAAG,EACjC,CACJ,CAGA,iBAAA,CAAkB,EAAG,GACjB,IAAK,IAAI,GAAM,EAAG,GAAM,EAAG,IACvB,IAAK,IAAI,GAAM,EAAG,GAAM,EAAG,IAAM,CAC7B,MAAM,EAAO,KAAK,IAAI,KAAK,IAAI,GAAK,KAAK,IAAI,IACvC,EAAK,EAAI,EACT,EAAK,EAAI,EACX,GAAK,GAAM,EAAK,KAAK,MAAQ,GAAK,GAAM,EAAK,KAAK,MAClD,KAAK,kBAAkB,EAAI,EAAY,GAAR,GAAqB,GAAR,EACpD,CAER,CAGA,oBAAA,CAAqB,EAAG,GACpB,IAAK,IAAI,GAAM,EAAG,GAAM,EAAG,IACvB,IAAK,IAAI,GAAM,EAAG,GAAM,EAAG,IACvB,KAAK,kBAAkB,EAAI,EAAI,EAAI,EAA4C,GAAxC,KAAK,IAAI,KAAK,IAAI,GAAK,KAAK,IAAI,IAEnF,CAGA,iBAAA,CAAkB,EAAG,EAAG,GACpB,KAAK,QAAQ,GAAG,GAAK,EACrB,KAAK,WAAW,GAAG,IAAK,CAC5B,CAIA,mBAAA,CAAoB,GAChB,MAAM,EAAM,KAAK,QACX,EAAM,KAAK,qBACjB,GAAI,EAAK,QAAU,EAAO,oBAAoB,EAAK,GAC/C,MAAM,IAAI,WAAW,oBAEzB,MAAM,EAAY,EAAO,4BAA4B,EAAI,SAAS,GAC5D,EAAc,EAAO,wBAAwB,EAAI,SAAS,GAC1D,EAAe,KAAK,MAAM,EAAO,qBAAqB,GAAO,GAC7D,EAAiB,EAAY,EAAe,EAC5C,EAAgB,KAAK,MAAM,EAAe,GAEhD,IAAI,EAAS,GACb,MAAM,EAAQ,EAAO,0BAA0B,GAC/C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,EAAI,EAAW,IAAK,CACvC,IAAI,EAAM,EAAK,MAAM,EAAG,EAAI,EAAgB,GAAe,EAAI,EAAiB,EAAI,IACpF,GAAK,EAAI,OACT,MAAM,EAAM,EAAO,4BAA4B,EAAK,GAChD,EAAI,GACJ,EAAI,KAAK,GACb,EAAO,KAAK,EAAI,OAAO,GAC3B,CAEA,IAAI,EAAS,GACb,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,GAAG,OAAQ,IAClC,EAAO,SAAQ,CAAC,EAAO,MAEf,GAAK,EAAgB,GAAe,GAAK,IACzC,EAAO,KAAK,EAAM,GAAG,IAIjC,OADA,EAAO,EAAO,QAAU,GACjB,CACX,CAGA,aAAA,CAAc,GACV,GAAI,EAAK,QAAU,KAAK,MAAM,EAAO,qBAAqB,KAAK,SAAW,GACtE,MAAM,IAAI,WAAW,oBACzB,IAAI,EAAI,EAER,IAAK,IAAI,EAAQ,KAAK,KAAO,EAAG,GAAS,EAAG,GAAS,EAAG,CACvC,GAAT,IACA,EAAQ,GACZ,IAAK,IAAI,EAAO,EAAG,EAAO,KAAK,KAAM,IACjC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,MAAM,EAAI,EAAQ,EAEZ,IADW,EAAQ,EAAK,GACX,KAAK,KAAO,EAAI,EAAO,GACrC,KAAK,WAAW,GAAG,IAAM,EAAkB,EAAd,EAAK,SACnC,KAAK,QAAQ,GAAG,GAAK,EAAO,EAAK,IAAM,GAAI,GAAS,EAAJ,IAChD,IAIR,CAER,CACA,EAAO,GAAmB,EAAd,EAAK,OACrB,CAMA,SAAA,CAAU,GACN,GAAI,EAAO,GAAK,EAAO,EACnB,MAAM,IAAI,WAAW,2BACzB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAC3B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAAK,CAChC,IAAI,EACJ,OAAQ,GACJ,KAAK,EACD,GAAU,EAAI,GAAK,GAAK,EACxB,MACJ,KAAK,EACD,EAAS,EAAI,GAAK,EAClB,MACJ,KAAK,EACD,EAAS,EAAI,GAAK,EAClB,MACJ,KAAK,EACD,GAAU,EAAI,GAAK,GAAK,EACxB,MACJ,KAAK,EACD,GAAU,KAAK,MAAM,EAAI,GAAK,KAAK,MAAM,EAAI,IAAM,GAAK,EACxD,MACJ,KAAK,EACD,EAAS,EAAI,EAAI,EAAI,EAAI,EAAI,GAAK,EAClC,MACJ,KAAK,EACD,GAAU,EAAI,EAAI,EAAI,EAAI,EAAI,GAAK,GAAK,EACxC,MACJ,KAAK,EACD,IAAW,EAAI,GAAK,EAAI,EAAI,EAAI,GAAK,GAAK,EAC1C,MACJ,QAAS,MAAM,IAAI,MAAM,gBAExB,KAAK,WAAW,GAAG,IAAM,IAC1B,KAAK,QAAQ,GAAG,IAAM,KAAK,QAAQ,GAAG,GAC9C,CAER,CAGA,eAAA,GACI,IAAI,EAAS,EAEb,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAAK,CAChC,IAAI,GAAW,EACX,EAAO,EACP,EAAa,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACpC,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IACvB,KAAK,QAAQ,GAAG,IAAM,GACtB,IACY,GAAR,EACA,GAAU,EAAO,WACZ,EAAO,GACZ,MAGJ,KAAK,wBAAwB,EAAM,GAC9B,IACD,GAAU,KAAK,2BAA2B,GAAc,EAAO,YACnE,EAAW,KAAK,QAAQ,GAAG,GAC3B,EAAO,GAGf,GAAU,KAAK,+BAA+B,EAAU,EAAM,GAAc,EAAO,UACvF,CAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IAAK,CAChC,IAAI,GAAW,EACX,EAAO,EACP,EAAa,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACpC,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAM,IACvB,KAAK,QAAQ,GAAG,IAAM,GACtB,IACY,GAAR,EACA,GAAU,EAAO,WACZ,EAAO,GACZ,MAGJ,KAAK,wBAAwB,EAAM,GAC9B,IACD,GAAU,KAAK,2BAA2B,GAAc,EAAO,YACnE,EAAW,KAAK,QAAQ,GAAG,GAC3B,EAAO,GAGf,GAAU,KAAK,+BAA+B,EAAU,EAAM,GAAc,EAAO,UACvF,CAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAO,EAAG,IAC/B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAO,EAAG,IAAK,CACpC,MAAM,EAAQ,KAAK,QAAQ,GAAG,GAC1B,GAAS,KAAK,QAAQ,GAAG,EAAI,IAC7B,GAAS,KAAK,QAAQ,EAAI,GAAG,IAC7B,GAAS,KAAK,QAAQ,EAAI,GAAG,EAAI,KACjC,GAAU,EAAO,WACzB,CAGJ,IAAI,EAAO,EACX,IAAK,MAAM,KAAO,KAAK,QACnB,EAAO,EAAI,QAAO,CAAC,EAAK,IAAU,GAAO,EAAQ,EAAI,IAAI,GAC7D,MAAM,EAAQ,KAAK,KAAO,KAAK,KAEzB,EAAI,KAAK,KAAK,KAAK,IAAW,GAAP,EAAoB,GAAR,GAAc,GAAS,EAIhE,OAHA,EAAO,GAAK,GAAK,GAAK,GACtB,GAAU,EAAI,EAAO,WACrB,EAAO,GAAK,GAAU,GAAU,SACzB,CACX,CAKA,4BAAA,GACI,GAAoB,GAAhB,KAAK,QACL,MAAO,GACN,CACD,MAAM,EAAW,KAAK,MAAM,KAAK,QAAU,GAAK,EAC1C,EAAwB,IAAhB,KAAK,QAAiB,GACyB,EAAzD,KAAK,MAAqB,EAAf,KAAK,QAAc,IAAiB,EAAX,EAAe,IACvD,IAAI,EAAS,CAAC,GACd,IAAK,IAAI,EAAM,KAAK,KAAO,EAAG,EAAO,OAAS,EAAU,GAAO,EAC3D,EAAO,OAAO,EAAG,EAAG,GACxB,OAAO,CACX,CACJ,CAIA,2BAAO,CAAqB,GACxB,GAAI,EAAM,EAAO,aAAe,EAAM,EAAO,YACzC,MAAM,IAAI,WAAW,+BACzB,IAAI,GAAU,GAAK,EAAM,KAAO,EAAM,GACtC,GAAI,GAAO,EAAG,CACV,MAAM,EAAW,KAAK,MAAM,EAAM,GAAK,EACvC,IAAW,GAAK,EAAW,IAAM,EAAW,GACxC,GAAO,IACP,GAAU,GAClB,CAEA,OADA,EAAO,KAAO,GAAU,GAAU,OAC3B,CACX,CAIA,0BAAO,CAAoB,EAAK,GAC5B,OAAO,KAAK,MAAM,EAAO,qBAAqB,GAAO,GACjD,EAAO,wBAAwB,EAAI,SAAS,GACxC,EAAO,4BAA4B,EAAI,SAAS,EAC5D,CAGA,gCAAO,CAA0B,GAC7B,GAAI,EAAS,GAAK,EAAS,IACvB,MAAM,IAAI,WAAW,uBAGzB,IAAI,EAAS,GACb,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,EAAG,IAC5B,EAAO,KAAK,GAChB,EAAO,KAAK,GAIZ,IAAI,EAAO,EACX,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAAK,CAE7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,EAAO,GAAK,EAAO,oBAAoB,EAAO,GAAI,GAC9C,EAAI,EAAI,EAAO,SACf,EAAO,IAAM,EAAO,EAAI,IAEhC,EAAO,EAAO,oBAAoB,EAAM,EAC5C,CACA,OAAO,CACX,CAEA,kCAAO,CAA4B,EAAM,GACrC,IAAI,EAAS,EAAQ,KAAI,GAAK,IAC9B,IAAK,MAAM,KAAK,EAAM,CAClB,MAAM,EAAS,EAAI,EAAO,QAC1B,EAAO,KAAK,GACZ,EAAQ,SAAQ,CAAC,EAAM,IAAM,EAAO,IAAM,EAAO,oBAAoB,EAAM,IAC/E,CACA,OAAO,CACX,CAGA,0BAAO,CAAoB,EAAG,GAC1B,GAAI,IAAM,GAAK,GAAK,IAAM,GAAK,EAC3B,MAAM,IAAI,WAAW,qBAEzB,IAAI,EAAI,EACR,IAAK,IAAI,EAAI,EAAG,GAAK,EAAG,IACpB,EAAK,GAAK,EAAkB,KAAX,IAAM,GACvB,IAAO,IAAM,EAAK,GAAK,EAG3B,OADA,EAAO,IAAM,GAAK,GACX,CACX,CAGA,0BAAA,CAA2B,GACvB,MAAM,EAAI,EAAW,GACrB,EAAO,GAAiB,EAAZ,KAAK,MACjB,MAAM,EAAO,EAAI,GAAK,EAAW,IAAM,GAAK,EAAW,IAAU,EAAJ,GAAS,EAAW,IAAM,GAAK,EAAW,IAAM,EAC7G,OAAQ,GAAQ,EAAW,IAAU,EAAJ,GAAS,EAAW,IAAM,EAAI,EAAI,IAC5D,GAAQ,EAAW,IAAU,EAAJ,GAAS,EAAW,IAAM,EAAI,EAAI,EACtE,CAEA,8BAAA,CAA+B,EAAiB,EAAkB,GAO9D,OANI,IACA,KAAK,wBAAwB,EAAkB,GAC/C,EAAmB,GAEvB,GAAoB,KAAK,KACzB,KAAK,wBAAwB,EAAkB,GACxC,KAAK,2BAA2B,EAC3C,CAEA,uBAAA,CAAwB,EAAkB,GACjB,GAAjB,EAAW,KACX,GAAoB,KAAK,MAC7B,EAAW,MACX,EAAW,QAAQ,EACvB,EA+BJ,SAAS,EAAW,EAAK,EAAK,GAC1B,GAAI,EAAM,GAAK,EAAM,IAAM,IAAQ,GAAO,EACtC,MAAM,IAAI,WAAW,sBACzB,IAAK,IAAI,EAAI,EAAM,EAAG,GAAK,EAAG,IAC1B,EAAG,KAAM,IAAQ,EAAK,EAC9B,CAEA,SAAS,EAAO,EAAG,GACf,SAAS,IAAM,EAAK,EACxB,CAEA,SAAS,EAAO,GACZ,IAAK,EACD,MAAM,IAAI,MAAM,kBACxB,CAzCA,EAAO,YAAc,EAErB,EAAO,YAAc,GAErB,EAAO,WAAa,EACpB,EAAO,WAAa,EACpB,EAAO,WAAa,GACpB,EAAO,WAAa,GACpB,EAAO,wBAA0B,CAG7B,EAAE,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAChK,EAAE,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IACjK,EAAE,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IACjK,EAAE,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAErK,EAAO,4BAA8B,CAGjC,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAC1I,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IACnJ,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IACtJ,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAE3J,EAAU,OAAS,EA8BnB,MAAM,EAKF,WAAA,CAEA,EAIA,EAEA,GAII,GAHA,KAAK,KAAO,EACZ,KAAK,SAAW,EAChB,KAAK,QAAU,EACX,EAAW,EACX,MAAM,IAAI,WAAW,oBACzB,KAAK,QAAU,EAAQ,OAC3B,CAKA,gBAAO,CAAU,GACb,IAAI,EAAK,GACT,IAAK,MAAM,KAAK,EACZ,EAAW,EAAG,EAAG,GACrB,OAAO,IAAI,EAAU,EAAU,KAAK,KAAM,EAAK,OAAQ,EAC3D,CAEA,kBAAO,CAAY,GACf,IAAK,EAAU,UAAU,GACrB,MAAM,IAAI,WAAW,0CACzB,IAAI,EAAK,GACT,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,QAAS,CAChC,MAAM,EAAI,KAAK,IAAI,EAAO,OAAS,EAAG,GACtC,EAAW,SAAS,EAAO,OAAO,EAAG,GAAI,IAAS,EAAJ,EAAQ,EAAG,GACzD,GAAK,CACT,CACA,OAAO,IAAI,EAAU,EAAU,KAAK,QAAS,EAAO,OAAQ,EAChE,CAIA,uBAAO,CAAiB,GACpB,IAAK,EAAU,eAAe,GAC1B,MAAM,IAAI,WAAW,+DACzB,IACI,EADA,EAAK,GAET,IAAK,EAAI,EAAG,EAAI,GAAK,EAAK,OAAQ,GAAK,EAAG,CACtC,IAAI,EAAgE,GAAzD,EAAU,qBAAqB,QAAQ,EAAK,OAAO,IAC9D,GAAQ,EAAU,qBAAqB,QAAQ,EAAK,OAAO,EAAI,IAC/D,EAAW,EAAM,GAAI,EACzB,CAGA,OAFI,EAAI,EAAK,QACT,EAAW,EAAU,qBAAqB,QAAQ,EAAK,OAAO,IAAK,EAAG,GACnE,IAAI,EAAU,EAAU,KAAK,aAAc,EAAK,OAAQ,EACnE,CAGA,mBAAO,CAAa,GAEhB,MAAY,IAAR,EACO,GACF,EAAU,UAAU,GAClB,CAAC,EAAU,YAAY,IACzB,EAAU,eAAe,GACvB,CAAC,EAAU,iBAAiB,IAE5B,CAAC,EAAU,UAAU,EAAU,gBAAgB,IAC9D,CAGA,cAAO,CAAQ,GACX,IAAI,EAAK,GACT,GAAI,EAAY,EACZ,MAAM,IAAI,WAAW,qCACpB,GAAI,EAAY,IACjB,EAAW,EAAW,EAAG,QACxB,GAAI,EAAY,MACjB,EAAW,EAAM,EAAG,GACpB,EAAW,EAAW,GAAI,OAEzB,MAAI,EAAY,KAKjB,MAAM,IAAI,WAAW,qCAJrB,EAAW,EAAO,EAAG,GACrB,EAAW,EAAW,GAAI,EAG+B,CAC7D,OAAO,IAAI,EAAU,EAAU,KAAK,IAAK,EAAG,EAChD,CAGA,gBAAO,CAAU,GACb,OAAO,EAAU,cAAc,KAAK,EACxC,CAIA,qBAAO,CAAe,GAClB,OAAO,EAAU,mBAAmB,KAAK,EAC7C,CAGA,OAAA,GACI,OAAO,KAAK,QAAQ,OACxB,CAGA,mBAAO,CAAa,EAAM,GACtB,IAAI,EAAS,EACb,IAAK,MAAM,KAAO,EAAM,CACpB,MAAM,EAAS,EAAI,KAAK,iBAAiB,GACzC,GAAI,EAAI,UAAa,GAAK,EACtB,OAAO,IACX,GAAU,EAAI,EAAS,EAAI,QAAQ,MACvC,CACA,OAAO,CACX,CAEA,sBAAO,CAAgB,GACnB,EAAM,UAAU,GAChB,IAAI,EAAS,GACb,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IACP,KAAjB,EAAI,OAAO,GACX,EAAO,KAAK,EAAI,WAAW,KAE3B,EAAO,KAAK,SAAS,EAAI,OAAO,EAAI,EAAG,GAAI,KAC3C,GAAK,GAGb,OAAO,CACX,EAIJ,EAAU,cAAgB,WAE1B,EAAU,mBAAqB,wBAG/B,EAAU,qBAAuB,gDACjC,EAAU,UAAY,CACzB,CAjvBD,CAivBG,YAAc,UAAY,CAAC,IAE9B,SAAW,IAEP,SAAW,GAIP,MAAM,EAEF,WAAA,CAEA,EAEA,GACI,KAAK,QAAU,EACf,KAAK,WAAa,CACtB,EAGJ,EAAI,IAAM,IAAI,EAAI,EAAG,GACrB,EAAI,OAAS,IAAI,EAAI,EAAG,GACxB,EAAI,SAAW,IAAI,EAAI,EAAG,GAC1B,EAAI,KAAO,IAAI,EAAI,EAAG,GACtB,EAAO,IAAM,CAChB,CArBD,CAqBY,EAAU,SAAW,EAAU,OAAS,CAAC,GACxD,CAxBD,CAwBG,YAAc,UAAY,CAAC,IAE9B,SAAW,IAEP,SAAW,GAIP,MAAM,EAEF,WAAA,CAEA,EAEA,GACI,KAAK,SAAW,EAChB,KAAK,iBAAmB,CAC5B,CAIA,gBAAA,CAAiB,GACb,OAAO,KAAK,iBAAiB,KAAK,OAAO,EAAM,GAAK,IACxD,EAGJ,EAAK,QAAU,IAAI,EAAK,EAAK,CAAC,GAAI,GAAI,KACtC,EAAK,aAAe,IAAI,EAAK,EAAK,CAAC,EAAG,GAAI,KAC1C,EAAK,KAAO,IAAI,EAAK,EAAK,CAAC,EAAG,GAAI,KAClC,EAAK,MAAQ,IAAI,EAAK,EAAK,CAAC,EAAG,GAAI,KACnC,EAAK,IAAM,IAAI,EAAK,EAAK,CAAC,EAAG,EAAG,IAChC,EAAU,KAAO,CACpB,CA5BD,CA4Be,EAAU,YAAc,EAAU,UAAY,CAAC,GACjE,CA/BD,CA+BG,YAAc,UAAY,CAAC,mBACf","file":"/npm/nayuki-qr-code-generator@1.8.0/index.js","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/nayuki-qr-code-generator@1.8.0/index.js\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","/*\n * QR Code generator library (TypeScript)\n *\n * Copyright (c) Project Nayuki. (MIT License)\n * https://www.nayuki.io/page/qr-code-generator-library\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n * - The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * - The Software is provided \"as is\", without warranty of any kind, express or\n * implied, including but not limited to the warranties of merchantability,\n * fitness for a particular purpose and noninfringement. In no event shall the\n * authors or copyright holders be liable for any claim, damages or other\n * liability, whether in an action of contract, tort or otherwise, arising from,\n * out of or in connection with the Software or the use or other dealings in the\n * Software.\n */\n\"use strict\";\nvar qrcodegen;\n(function (qrcodegen) {\n /*---- QR Code symbol class ----*/\n /*\n * A QR Code symbol, which is a type of two-dimension barcode.\n * Invented by Denso Wave and described in the ISO/IEC 18004 standard.\n * Instances of this class represent an immutable square grid of dark and light cells.\n * The class provides static factory functions to create a QR Code from text or binary data.\n * The class covers the QR Code Model 2 specification, supporting all versions (sizes)\n * from 1 to 40, all 4 error correction levels, and 4 character encoding modes.\n *\n * Ways to create a QR Code object:\n * - High level: Take the payload data and call QrCode.encodeText() or QrCode.encodeBinary().\n * - Mid level: Custom-make the list of segments and call QrCode.encodeSegments().\n * - Low level: Custom-make the array of data codeword bytes (including\n * segment headers and final padding, excluding error correction codewords),\n * supply the appropriate version number, and call the QrCode() constructor.\n * (Note that all ways require supplying the desired error correction level.)\n */\n class QrCode {\n /*-- Constructor (low level) and fields --*/\n // Creates a new QR Code with the given version number,\n // error correction level, data codeword bytes, and mask number.\n // This is a low-level API that most users should not use directly.\n // A mid-level API is the encodeSegments() function.\n constructor(\n // The version number of this QR Code, which is between 1 and 40 (inclusive).\n // This determines the size of this barcode.\n version, \n // The error correction level used in this QR Code.\n errorCorrectionLevel, dataCodewords, msk) {\n this.version = version;\n this.errorCorrectionLevel = errorCorrectionLevel;\n // The modules of this QR Code (false = light, true = dark).\n // Immutable after constructor finishes. Accessed through getModule().\n this.modules = [];\n // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.\n this.isFunction = [];\n // Check scalar arguments\n if (version < QrCode.MIN_VERSION || version > QrCode.MAX_VERSION)\n throw new RangeError(\"Version value out of range\");\n if (msk < -1 || msk > 7)\n throw new RangeError(\"Mask value out of range\");\n this.size = version * 4 + 17;\n // Initialize both grids to be size*size arrays of Boolean false\n let row = [];\n for (let i = 0; i < this.size; i++)\n row.push(false);\n for (let i = 0; i < this.size; i++) {\n this.modules.push(row.slice()); // Initially all light\n this.isFunction.push(row.slice());\n }\n // Compute ECC, draw modules\n this.drawFunctionPatterns();\n const allCodewords = this.addEccAndInterleave(dataCodewords);\n this.drawCodewords(allCodewords);\n // Do masking\n if (msk == -1) { // Automatically choose best mask\n let minPenalty = 1000000000;\n for (let i = 0; i < 8; i++) {\n this.applyMask(i);\n this.drawFormatBits(i);\n const penalty = this.getPenaltyScore();\n if (penalty < minPenalty) {\n msk = i;\n minPenalty = penalty;\n }\n this.applyMask(i); // Undoes the mask due to XOR\n }\n }\n assert(0 <= msk && msk <= 7);\n this.mask = msk;\n this.applyMask(msk); // Apply the final choice of mask\n this.drawFormatBits(msk); // Overwrite old format bits\n this.isFunction = [];\n }\n /*-- Static factory functions (high level) --*/\n // Returns a QR Code representing the given Unicode text string at the given error correction level.\n // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer\n // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible\n // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the\n // ecl argument if it can be done without increasing the version.\n static encodeText(text, ecl) {\n const segs = qrcodegen.QrSegment.makeSegments(text);\n return QrCode.encodeSegments(segs, ecl);\n }\n // Returns a QR Code representing the given binary data at the given error correction level.\n // This function always encodes using the binary segment mode, not any text mode. The maximum number of\n // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.\n // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.\n static encodeBinary(data, ecl) {\n const seg = qrcodegen.QrSegment.makeBytes(data);\n return QrCode.encodeSegments([seg], ecl);\n }\n /*-- Static factory functions (mid level) --*/\n // Returns a QR Code representing the given segments with the given encoding parameters.\n // The smallest possible QR Code version within the given range is automatically\n // chosen for the output. Iff boostEcl is true, then the ECC level of the result\n // may be higher than the ecl argument if it can be done without increasing the\n // version. The mask number is either between 0 to 7 (inclusive) to force that\n // mask, or -1 to automatically choose an appropriate mask (which may be slow).\n // This function allows the user to create a custom sequence of segments that switches\n // between modes (such as alphanumeric and byte) to encode text in less space.\n // This is a mid-level API; the high-level API is encodeText() and encodeBinary().\n static encodeSegments(segs, ecl, minVersion = 1, maxVersion = 40, mask = -1, boostEcl = true) {\n if (!(QrCode.MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= QrCode.MAX_VERSION)\n || mask < -1 || mask > 7)\n throw new RangeError(\"Invalid value\");\n // Find the minimal version number to use\n let version;\n let dataUsedBits;\n for (version = minVersion;; version++) {\n const dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8; // Number of data bits available\n const usedBits = QrSegment.getTotalBits(segs, version);\n if (usedBits <= dataCapacityBits) {\n dataUsedBits = usedBits;\n break; // This version number is found to be suitable\n }\n if (version >= maxVersion) // All versions in the range could not fit the given data\n throw new RangeError(\"Data too long\");\n }\n // Increase the error correction level while the data still fits in the current version number\n for (const newEcl of [QrCode.Ecc.MEDIUM, QrCode.Ecc.QUARTILE, QrCode.Ecc.HIGH]) { // From low to high\n if (boostEcl && dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8)\n ecl = newEcl;\n }\n // Concatenate all segments to create the data bit string\n let bb = [];\n for (const seg of segs) {\n appendBits(seg.mode.modeBits, 4, bb);\n appendBits(seg.numChars, seg.mode.numCharCountBits(version), bb);\n for (const b of seg.getData())\n bb.push(b);\n }\n assert(bb.length == dataUsedBits);\n // Add terminator and pad up to a byte if applicable\n const dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8;\n assert(bb.length <= dataCapacityBits);\n appendBits(0, Math.min(4, dataCapacityBits - bb.length), bb);\n appendBits(0, (8 - bb.length % 8) % 8, bb);\n assert(bb.length % 8 == 0);\n // Pad with alternating bytes until data capacity is reached\n for (let padByte = 0xEC; bb.length < dataCapacityBits; padByte ^= 0xEC ^ 0x11)\n appendBits(padByte, 8, bb);\n // Pack bits into bytes in big endian\n let dataCodewords = [];\n while (dataCodewords.length * 8 < bb.length)\n dataCodewords.push(0);\n bb.forEach((b, i) => dataCodewords[i >>> 3] |= b << (7 - (i & 7)));\n // Create the QR Code object\n return new QrCode(version, ecl, dataCodewords, mask);\n }\n /*-- Accessor methods --*/\n // Returns the color of the module (pixel) at the given coordinates, which is false\n // for light or true for dark. The top left corner has the coordinates (x=0, y=0).\n // If the given coordinates are out of bounds, then false (light) is returned.\n getModule(x, y) {\n return 0 <= x && x < this.size && 0 <= y && y < this.size && this.modules[y][x];\n }\n /*-- Private helper methods for constructor: Drawing function modules --*/\n // Reads this object's version field, and draws and marks all function modules.\n drawFunctionPatterns() {\n // Draw horizontal and vertical timing patterns\n for (let i = 0; i < this.size; i++) {\n this.setFunctionModule(6, i, i % 2 == 0);\n this.setFunctionModule(i, 6, i % 2 == 0);\n }\n // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules)\n this.drawFinderPattern(3, 3);\n this.drawFinderPattern(this.size - 4, 3);\n this.drawFinderPattern(3, this.size - 4);\n // Draw numerous alignment patterns\n const alignPatPos = this.getAlignmentPatternPositions();\n const numAlign = alignPatPos.length;\n for (let i = 0; i < numAlign; i++) {\n for (let j = 0; j < numAlign; j++) {\n // Don't draw on the three finder corners\n if (!(i == 0 && j == 0 || i == 0 && j == numAlign - 1 || i == numAlign - 1 && j == 0))\n this.drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);\n }\n }\n // Draw configuration data\n this.drawFormatBits(0); // Dummy mask value; overwritten later in the constructor\n this.drawVersion();\n }\n // Draws two copies of the format bits (with its own error correction code)\n // based on the given mask and this object's error correction level field.\n drawFormatBits(mask) {\n // Calculate error correction code and pack bits\n const data = this.errorCorrectionLevel.formatBits << 3 | mask; // errCorrLvl is uint2, mask is uint3\n let rem = data;\n for (let i = 0; i < 10; i++)\n rem = (rem << 1) ^ ((rem >>> 9) * 0x537);\n const bits = (data << 10 | rem) ^ 0x5412; // uint15\n assert(bits >>> 15 == 0);\n // Draw first copy\n for (let i = 0; i <= 5; i++)\n this.setFunctionModule(8, i, getBit(bits, i));\n this.setFunctionModule(8, 7, getBit(bits, 6));\n this.setFunctionModule(8, 8, getBit(bits, 7));\n this.setFunctionModule(7, 8, getBit(bits, 8));\n for (let i = 9; i < 15; i++)\n this.setFunctionModule(14 - i, 8, getBit(bits, i));\n // Draw second copy\n for (let i = 0; i < 8; i++)\n this.setFunctionModule(this.size - 1 - i, 8, getBit(bits, i));\n for (let i = 8; i < 15; i++)\n this.setFunctionModule(8, this.size - 15 + i, getBit(bits, i));\n this.setFunctionModule(8, this.size - 8, true); // Always dark\n }\n // Draws two copies of the version bits (with its own error correction code),\n // based on this object's version field, iff 7 <= version <= 40.\n drawVersion() {\n if (this.version < 7)\n return;\n // Calculate error correction code and pack bits\n let rem = this.version; // version is uint6, in the range [7, 40]\n for (let i = 0; i < 12; i++)\n rem = (rem << 1) ^ ((rem >>> 11) * 0x1F25);\n const bits = this.version << 12 | rem; // uint18\n assert(bits >>> 18 == 0);\n // Draw two copies\n for (let i = 0; i < 18; i++) {\n const color = getBit(bits, i);\n const a = this.size - 11 + i % 3;\n const b = Math.floor(i / 3);\n this.setFunctionModule(a, b, color);\n this.setFunctionModule(b, a, color);\n }\n }\n // Draws a 9*9 finder pattern including the border separator,\n // with the center module at (x, y). Modules can be out of bounds.\n drawFinderPattern(x, y) {\n for (let dy = -4; dy <= 4; dy++) {\n for (let dx = -4; dx <= 4; dx++) {\n const dist = Math.max(Math.abs(dx), Math.abs(dy)); // Chebyshev/infinity norm\n const xx = x + dx;\n const yy = y + dy;\n if (0 <= xx && xx < this.size && 0 <= yy && yy < this.size)\n this.setFunctionModule(xx, yy, dist != 2 && dist != 4);\n }\n }\n }\n // Draws a 5*5 alignment pattern, with the center module\n // at (x, y). All modules must be in bounds.\n drawAlignmentPattern(x, y) {\n for (let dy = -2; dy <= 2; dy++) {\n for (let dx = -2; dx <= 2; dx++)\n this.setFunctionModule(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) != 1);\n }\n }\n // Sets the color of a module and marks it as a function module.\n // Only used by the constructor. Coordinates must be in bounds.\n setFunctionModule(x, y, isDark) {\n this.modules[y][x] = isDark;\n this.isFunction[y][x] = true;\n }\n /*-- Private helper methods for constructor: Codewords and masking --*/\n // Returns a new byte string representing the given data with the appropriate error correction\n // codewords appended to it, based on this object's version and error correction level.\n addEccAndInterleave(data) {\n const ver = this.version;\n const ecl = this.errorCorrectionLevel;\n if (data.length != QrCode.getNumDataCodewords(ver, ecl))\n throw new RangeError(\"Invalid argument\");\n // Calculate parameter numbers\n const numBlocks = QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];\n const blockEccLen = QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver];\n const rawCodewords = Math.floor(QrCode.getNumRawDataModules(ver) / 8);\n const numShortBlocks = numBlocks - rawCodewords % numBlocks;\n const shortBlockLen = Math.floor(rawCodewords / numBlocks);\n // Split data into blocks and append ECC to each block\n let blocks = [];\n const rsDiv = QrCode.reedSolomonComputeDivisor(blockEccLen);\n for (let i = 0, k = 0; i < numBlocks; i++) {\n let dat = data.slice(k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1));\n k += dat.length;\n const ecc = QrCode.reedSolomonComputeRemainder(dat, rsDiv);\n if (i < numShortBlocks)\n dat.push(0);\n blocks.push(dat.concat(ecc));\n }\n // Interleave (not concatenate) the bytes from every block into a single sequence\n let result = [];\n for (let i = 0; i < blocks[0].length; i++) {\n blocks.forEach((block, j) => {\n // Skip the padding byte in short blocks\n if (i != shortBlockLen - blockEccLen || j >= numShortBlocks)\n result.push(block[i]);\n });\n }\n assert(result.length == rawCodewords);\n return result;\n }\n // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire\n // data area of this QR Code. Function modules need to be marked off before this is called.\n drawCodewords(data) {\n if (data.length != Math.floor(QrCode.getNumRawDataModules(this.version) / 8))\n throw new RangeError(\"Invalid argument\");\n let i = 0; // Bit index into the data\n // Do the funny zigzag scan\n for (let right = this.size - 1; right >= 1; right -= 2) { // Index of right column in each column pair\n if (right == 6)\n right = 5;\n for (let vert = 0; vert < this.size; vert++) { // Vertical counter\n for (let j = 0; j < 2; j++) {\n const x = right - j; // Actual x coordinate\n const upward = ((right + 1) & 2) == 0;\n const y = upward ? this.size - 1 - vert : vert; // Actual y coordinate\n if (!this.isFunction[y][x] && i < data.length * 8) {\n this.modules[y][x] = getBit(data[i >>> 3], 7 - (i & 7));\n i++;\n }\n // If this QR Code has any remainder bits (0 to 7), they were assigned as\n // 0/false/light by the constructor and are left unchanged by this method\n }\n }\n }\n assert(i == data.length * 8);\n }\n // XORs the codeword modules in this QR Code with the given mask pattern.\n // The function modules must be marked and the codeword bits must be drawn\n // before masking. Due to the arithmetic of XOR, calling applyMask() with\n // the same mask value a second time will undo the mask. A final well-formed\n // QR Code needs exactly one (not zero, two, etc.) mask applied.\n applyMask(mask) {\n if (mask < 0 || mask > 7)\n throw new RangeError(\"Mask value out of range\");\n for (let y = 0; y < this.size; y++) {\n for (let x = 0; x < this.size; x++) {\n let invert;\n switch (mask) {\n case 0:\n invert = (x + y) % 2 == 0;\n break;\n case 1:\n invert = y % 2 == 0;\n break;\n case 2:\n invert = x % 3 == 0;\n break;\n case 3:\n invert = (x + y) % 3 == 0;\n break;\n case 4:\n invert = (Math.floor(x / 3) + Math.floor(y / 2)) % 2 == 0;\n break;\n case 5:\n invert = x * y % 2 + x * y % 3 == 0;\n break;\n case 6:\n invert = (x * y % 2 + x * y % 3) % 2 == 0;\n break;\n case 7:\n invert = ((x + y) % 2 + x * y % 3) % 2 == 0;\n break;\n default: throw new Error(\"Unreachable\");\n }\n if (!this.isFunction[y][x] && invert)\n this.modules[y][x] = !this.modules[y][x];\n }\n }\n }\n // Calculates and returns the penalty score based on state of this QR Code's current modules.\n // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.\n getPenaltyScore() {\n let result = 0;\n // Adjacent modules in row having same color, and finder-like patterns\n for (let y = 0; y < this.size; y++) {\n let runColor = false;\n let runX = 0;\n let runHistory = [0, 0, 0, 0, 0, 0, 0];\n for (let x = 0; x < this.size; x++) {\n if (this.modules[y][x] == runColor) {\n runX++;\n if (runX == 5)\n result += QrCode.PENALTY_N1;\n else if (runX > 5)\n result++;\n }\n else {\n this.finderPenaltyAddHistory(runX, runHistory);\n if (!runColor)\n result += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;\n runColor = this.modules[y][x];\n runX = 1;\n }\n }\n result += this.finderPenaltyTerminateAndCount(runColor, runX, runHistory) * QrCode.PENALTY_N3;\n }\n // Adjacent modules in column having same color, and finder-like patterns\n for (let x = 0; x < this.size; x++) {\n let runColor = false;\n let runY = 0;\n let runHistory = [0, 0, 0, 0, 0, 0, 0];\n for (let y = 0; y < this.size; y++) {\n if (this.modules[y][x] == runColor) {\n runY++;\n if (runY == 5)\n result += QrCode.PENALTY_N1;\n else if (runY > 5)\n result++;\n }\n else {\n this.finderPenaltyAddHistory(runY, runHistory);\n if (!runColor)\n result += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;\n runColor = this.modules[y][x];\n runY = 1;\n }\n }\n result += this.finderPenaltyTerminateAndCount(runColor, runY, runHistory) * QrCode.PENALTY_N3;\n }\n // 2*2 blocks of modules having same color\n for (let y = 0; y < this.size - 1; y++) {\n for (let x = 0; x < this.size - 1; x++) {\n const color = this.modules[y][x];\n if (color == this.modules[y][x + 1] &&\n color == this.modules[y + 1][x] &&\n color == this.modules[y + 1][x + 1])\n result += QrCode.PENALTY_N2;\n }\n }\n // Balance of dark and light modules\n let dark = 0;\n for (const row of this.modules)\n dark = row.reduce((sum, color) => sum + (color ? 1 : 0), dark);\n const total = this.size * this.size; // Note that size is odd, so dark/total != 1/2\n // Compute the smallest integer k >= 0 such that (45-5k)% <= dark/total <= (55+5k)%\n const k = Math.ceil(Math.abs(dark * 20 - total * 10) / total) - 1;\n assert(0 <= k && k <= 9);\n result += k * QrCode.PENALTY_N4;\n assert(0 <= result && result <= 2568888); // Non-tight upper bound based on default values of PENALTY_N1, ..., N4\n return result;\n }\n /*-- Private helper functions --*/\n // Returns an ascending list of positions of alignment patterns for this version number.\n // Each position is in the range [0,177), and are used on both the x and y axes.\n // This could be implemented as lookup table of 40 variable-length lists of integers.\n getAlignmentPatternPositions() {\n if (this.version == 1)\n return [];\n else {\n const numAlign = Math.floor(this.version / 7) + 2;\n const step = (this.version == 32) ? 26 :\n Math.ceil((this.version * 4 + 4) / (numAlign * 2 - 2)) * 2;\n let result = [6];\n for (let pos = this.size - 7; result.length < numAlign; pos -= step)\n result.splice(1, 0, pos);\n return result;\n }\n }\n // Returns the number of data bits that can be stored in a QR Code of the given version number, after\n // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.\n // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.\n static getNumRawDataModules(ver) {\n if (ver < QrCode.MIN_VERSION || ver > QrCode.MAX_VERSION)\n throw new RangeError(\"Version number out of range\");\n let result = (16 * ver + 128) * ver + 64;\n if (ver >= 2) {\n const numAlign = Math.floor(ver / 7) + 2;\n result -= (25 * numAlign - 10) * numAlign - 55;\n if (ver >= 7)\n result -= 36;\n }\n assert(208 <= result && result <= 29648);\n return result;\n }\n // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any\n // QR Code of the given version number and error correction level, with remainder bits discarded.\n // This stateless pure function could be implemented as a (40*4)-cell lookup table.\n static getNumDataCodewords(ver, ecl) {\n return Math.floor(QrCode.getNumRawDataModules(ver) / 8) -\n QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] *\n QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];\n }\n // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be\n // implemented as a lookup table over all possible parameter values, instead of as an algorithm.\n static reedSolomonComputeDivisor(degree) {\n if (degree < 1 || degree > 255)\n throw new RangeError(\"Degree out of range\");\n // Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1.\n // For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array [255, 8, 93].\n let result = [];\n for (let i = 0; i < degree - 1; i++)\n result.push(0);\n result.push(1); // Start off with the monomial x^0\n // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),\n // and drop the highest monomial term which is always 1x^degree.\n // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D).\n let root = 1;\n for (let i = 0; i < degree; i++) {\n // Multiply the current product by (x - r^i)\n for (let j = 0; j < result.length; j++) {\n result[j] = QrCode.reedSolomonMultiply(result[j], root);\n if (j + 1 < result.length)\n result[j] ^= result[j + 1];\n }\n root = QrCode.reedSolomonMultiply(root, 0x02);\n }\n return result;\n }\n // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.\n static reedSolomonComputeRemainder(data, divisor) {\n let result = divisor.map(_ => 0);\n for (const b of data) { // Polynomial division\n const factor = b ^ result.shift();\n result.push(0);\n divisor.forEach((coef, i) => result[i] ^= QrCode.reedSolomonMultiply(coef, factor));\n }\n return result;\n }\n // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result\n // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.\n static reedSolomonMultiply(x, y) {\n if (x >>> 8 != 0 || y >>> 8 != 0)\n throw new RangeError(\"Byte out of range\");\n // Russian peasant multiplication\n let z = 0;\n for (let i = 7; i >= 0; i--) {\n z = (z << 1) ^ ((z >>> 7) * 0x11D);\n z ^= ((y >>> i) & 1) * x;\n }\n assert(z >>> 8 == 0);\n return z;\n }\n // Can only be called immediately after a light run is added, and\n // returns either 0, 1, or 2. A helper function for getPenaltyScore().\n finderPenaltyCountPatterns(runHistory) {\n const n = runHistory[1];\n assert(n <= this.size * 3);\n const core = n > 0 && runHistory[2] == n && runHistory[3] == n * 3 && runHistory[4] == n && runHistory[5] == n;\n return (core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0)\n + (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0);\n }\n // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().\n finderPenaltyTerminateAndCount(currentRunColor, currentRunLength, runHistory) {\n if (currentRunColor) { // Terminate dark run\n this.finderPenaltyAddHistory(currentRunLength, runHistory);\n currentRunLength = 0;\n }\n currentRunLength += this.size; // Add light border to final run\n this.finderPenaltyAddHistory(currentRunLength, runHistory);\n return this.finderPenaltyCountPatterns(runHistory);\n }\n // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().\n finderPenaltyAddHistory(currentRunLength, runHistory) {\n if (runHistory[0] == 0)\n currentRunLength += this.size; // Add light border to initial run\n runHistory.pop();\n runHistory.unshift(currentRunLength);\n }\n }\n /*-- Constants and tables --*/\n // The minimum version number supported in the QR Code Model 2 standard.\n QrCode.MIN_VERSION = 1;\n // The maximum version number supported in the QR Code Model 2 standard.\n QrCode.MAX_VERSION = 40;\n // For use in getPenaltyScore(), when evaluating which mask is best.\n QrCode.PENALTY_N1 = 3;\n QrCode.PENALTY_N2 = 3;\n QrCode.PENALTY_N3 = 40;\n QrCode.PENALTY_N4 = 10;\n QrCode.ECC_CODEWORDS_PER_BLOCK = [\n // Version: (note that index 0 is for padding, and is set to an illegal value)\n //0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level\n [-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],\n [-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],\n [-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],\n [-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], // High\n ];\n QrCode.NUM_ERROR_CORRECTION_BLOCKS = [\n // Version: (note that index 0 is for padding, and is set to an illegal value)\n //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level\n [-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],\n [-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],\n [-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],\n [-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], // High\n ];\n qrcodegen.QrCode = QrCode;\n // Appends the given number of low-order bits of the given value\n // to the given buffer. Requires 0 <= len <= 31 and 0 <= val < 2^len.\n function appendBits(val, len, bb) {\n if (len < 0 || len > 31 || val >>> len != 0)\n throw new RangeError(\"Value out of range\");\n for (let i = len - 1; i >= 0; i--) // Append bit by bit\n bb.push((val >>> i) & 1);\n }\n // Returns true iff the i'th bit of x is set to 1.\n function getBit(x, i) {\n return ((x >>> i) & 1) != 0;\n }\n // Throws an exception if the given condition is false.\n function assert(cond) {\n if (!cond)\n throw new Error(\"Assertion error\");\n }\n /*---- Data segment class ----*/\n /*\n * A segment of character/binary/control data in a QR Code symbol.\n * Instances of this class are immutable.\n * The mid-level way to create a segment is to take the payload data\n * and call a static factory function such as QrSegment.makeNumeric().\n * The low-level way to create a segment is to custom-make the bit buffer\n * and call the QrSegment() constructor with appropriate values.\n * This segment class imposes no length restrictions, but QR Codes have restrictions.\n * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data.\n * Any segment longer than this is meaningless for the purpose of generating QR Codes.\n */\n class QrSegment {\n /*-- Constructor (low level) and fields --*/\n // Creates a new QR Code segment with the given attributes and data.\n // The character count (numChars) must agree with the mode and the bit buffer length,\n // but the constraint isn't checked. The given bit buffer is cloned and stored.\n constructor(\n // The mode indicator of this segment.\n mode, \n // The length of this segment's unencoded data. Measured in characters for\n // numeric/alphanumeric/kanji mode, bytes for byte mode, and 0 for ECI mode.\n // Always zero or positive. Not the same as the data's bit length.\n numChars, \n // The data bits of this segment. Accessed through getData().\n bitData) {\n this.mode = mode;\n this.numChars = numChars;\n this.bitData = bitData;\n if (numChars < 0)\n throw new RangeError(\"Invalid argument\");\n this.bitData = bitData.slice(); // Make defensive copy\n }\n /*-- Static factory functions (mid level) --*/\n // Returns a segment representing the given binary data encoded in\n // byte mode. All input byte arrays are acceptable. Any text string\n // can be converted to UTF-8 bytes and encoded as a byte mode segment.\n static makeBytes(data) {\n let bb = [];\n for (const b of data)\n appendBits(b, 8, bb);\n return new QrSegment(QrSegment.Mode.BYTE, data.length, bb);\n }\n // Returns a segment representing the given string of decimal digits encoded in numeric mode.\n static makeNumeric(digits) {\n if (!QrSegment.isNumeric(digits))\n throw new RangeError(\"String contains non-numeric characters\");\n let bb = [];\n for (let i = 0; i < digits.length;) { // Consume up to 3 digits per iteration\n const n = Math.min(digits.length - i, 3);\n appendBits(parseInt(digits.substr(i, n), 10), n * 3 + 1, bb);\n i += n;\n }\n return new QrSegment(QrSegment.Mode.NUMERIC, digits.length, bb);\n }\n // Returns a segment representing the given text string encoded in alphanumeric mode.\n // The characters allowed are: 0 to 9, A to Z (uppercase only), space,\n // dollar, percent, asterisk, plus, hyphen, period, slash, colon.\n static makeAlphanumeric(text) {\n if (!QrSegment.isAlphanumeric(text))\n throw new RangeError(\"String contains unencodable characters in alphanumeric mode\");\n let bb = [];\n let i;\n for (i = 0; i + 2 <= text.length; i += 2) { // Process groups of 2\n let temp = QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45;\n temp += QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1));\n appendBits(temp, 11, bb);\n }\n if (i < text.length) // 1 character remaining\n appendBits(QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6, bb);\n return new QrSegment(QrSegment.Mode.ALPHANUMERIC, text.length, bb);\n }\n // Returns a new mutable list of zero or more segments to represent the given Unicode text string.\n // The result may use various segment modes and switch modes to optimize the length of the bit stream.\n static makeSegments(text) {\n // Select the most efficient segment encoding automatically\n if (text == \"\")\n return [];\n else if (QrSegment.isNumeric(text))\n return [QrSegment.makeNumeric(text)];\n else if (QrSegment.isAlphanumeric(text))\n return [QrSegment.makeAlphanumeric(text)];\n else\n return [QrSegment.makeBytes(QrSegment.toUtf8ByteArray(text))];\n }\n // Returns a segment representing an Extended Channel Interpretation\n // (ECI) designator with the given assignment value.\n static makeEci(assignVal) {\n let bb = [];\n if (assignVal < 0)\n throw new RangeError(\"ECI assignment value out of range\");\n else if (assignVal < (1 << 7))\n appendBits(assignVal, 8, bb);\n else if (assignVal < (1 << 14)) {\n appendBits(0b10, 2, bb);\n appendBits(assignVal, 14, bb);\n }\n else if (assignVal < 1000000) {\n appendBits(0b110, 3, bb);\n appendBits(assignVal, 21, bb);\n }\n else\n throw new RangeError(\"ECI assignment value out of range\");\n return new QrSegment(QrSegment.Mode.ECI, 0, bb);\n }\n // Tests whether the given string can be encoded as a segment in numeric mode.\n // A string is encodable iff each character is in the range 0 to 9.\n static isNumeric(text) {\n return QrSegment.NUMERIC_REGEX.test(text);\n }\n // Tests whether the given string can be encoded as a segment in alphanumeric mode.\n // A string is encodable iff each character is in the following set: 0 to 9, A to Z\n // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.\n static isAlphanumeric(text) {\n return QrSegment.ALPHANUMERIC_REGEX.test(text);\n }\n /*-- Methods --*/\n // Returns a new copy of the data bits of this segment.\n getData() {\n return this.bitData.slice(); // Make defensive copy\n }\n // (Package-private) Calculates and returns the number of bits needed to encode the given segments at\n // the given version. The result is infinity if a segment has too many characters to fit its length field.\n static getTotalBits(segs, version) {\n let result = 0;\n for (const seg of segs) {\n const ccbits = seg.mode.numCharCountBits(version);\n if (seg.numChars >= (1 << ccbits))\n return Infinity; // The segment's length doesn't fit the field's bit width\n result += 4 + ccbits + seg.bitData.length;\n }\n return result;\n }\n // Returns a new array of bytes representing the given string encoded in UTF-8.\n static toUtf8ByteArray(str) {\n str = encodeURI(str);\n let result = [];\n for (let i = 0; i < str.length; i++) {\n if (str.charAt(i) != \"%\")\n result.push(str.charCodeAt(i));\n else {\n result.push(parseInt(str.substr(i + 1, 2), 16));\n i += 2;\n }\n }\n return result;\n }\n }\n /*-- Constants --*/\n // Describes precisely all strings that are encodable in numeric mode.\n QrSegment.NUMERIC_REGEX = /^[0-9]*$/;\n // Describes precisely all strings that are encodable in alphanumeric mode.\n QrSegment.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\\/:-]*$/;\n // The set of all legal characters in alphanumeric mode,\n // where each character value maps to the index in the string.\n QrSegment.ALPHANUMERIC_CHARSET = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\";\n qrcodegen.QrSegment = QrSegment;\n})(qrcodegen || (qrcodegen = {}));\n/*---- Public helper enumeration ----*/\n(function (qrcodegen) {\n var QrCode;\n (function (QrCode) {\n /*\n * The error correction level in a QR Code symbol. Immutable.\n */\n class Ecc {\n /*-- Constructor and fields --*/\n constructor(\n // In the range 0 to 3 (unsigned 2-bit integer).\n ordinal, \n // (Package-private) In the range 0 to 3 (unsigned 2-bit integer).\n formatBits) {\n this.ordinal = ordinal;\n this.formatBits = formatBits;\n }\n }\n /*-- Constants --*/\n Ecc.LOW = new Ecc(0, 1); // The QR Code can tolerate about 7% erroneous codewords\n Ecc.MEDIUM = new Ecc(1, 0); // The QR Code can tolerate about 15% erroneous codewords\n Ecc.QUARTILE = new Ecc(2, 3); // The QR Code can tolerate about 25% erroneous codewords\n Ecc.HIGH = new Ecc(3, 2); // The QR Code can tolerate about 30% erroneous codewords\n QrCode.Ecc = Ecc;\n })(QrCode = qrcodegen.QrCode || (qrcodegen.QrCode = {}));\n})(qrcodegen || (qrcodegen = {}));\n/*---- Public helper enumeration ----*/\n(function (qrcodegen) {\n var QrSegment;\n (function (QrSegment) {\n /*\n * Describes how a segment's data bits are interpreted. Immutable.\n */\n class Mode {\n /*-- Constructor and fields --*/\n constructor(\n // The mode indicator bits, which is a uint4 value (range 0 to 15).\n modeBits, \n // Number of character count bits for three different version ranges.\n numBitsCharCount) {\n this.modeBits = modeBits;\n this.numBitsCharCount = numBitsCharCount;\n }\n /*-- Method --*/\n // (Package-private) Returns the bit width of the character count field for a segment in\n // this mode in a QR Code at the given version number. The result is in the range [0, 16].\n numCharCountBits(ver) {\n return this.numBitsCharCount[Math.floor((ver + 7) / 17)];\n }\n }\n /*-- Constants --*/\n Mode.NUMERIC = new Mode(0x1, [10, 12, 14]);\n Mode.ALPHANUMERIC = new Mode(0x2, [9, 11, 13]);\n Mode.BYTE = new Mode(0x4, [8, 16, 16]);\n Mode.KANJI = new Mode(0x8, [8, 10, 12]);\n Mode.ECI = new Mode(0x7, [0, 0, 0]);\n QrSegment.Mode = Mode;\n })(QrSegment = qrcodegen.QrSegment || (qrcodegen.QrSegment = {}));\n})(qrcodegen || (qrcodegen = {}));\nexport default qrcodegen;\n"]}