Вы не можете выбрать более 25 тем Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
 
 
 
 
 
 

1 строка
287 KiB

  1. {"version":3,"sources":["webpack:///static/js/0.024758f495f2ab9d932f.js","webpack:///./~/qrcode/lib/core/version.js","webpack:///./~/qrcode/lib/browser.js","webpack:///./~/qrcode/lib/renderer/svg-tag.js","webpack:///src/views/marketing/shop/table/index.vue","webpack:///./~/qrcode/lib/renderer/canvas.js","webpack:///./~/qrcode/lib/core/alignment-pattern.js","webpack:///./~/qrcode/lib/core/bit-buffer.js","webpack:///./~/qrcode/~/isarray/index.js","webpack:///./src/api/marketing/shop/tableGroup.js","webpack:///./~/qrcode/lib/core/galois-field.js","webpack:///./~/qrcode/lib/core/regex.js","webpack:///./src/views/marketing/shop/table/index.vue?71b5","webpack:///./~/qrcode/lib/core/alphanumeric-data.js","webpack:///./~/qrcode/lib/core/bit-matrix.js","webpack:///./~/qrcode/lib/core/error-correction-code.js","webpack:///./src/api/marketing/shop/table.js","webpack:///./~/qrcode/lib/core/qrcode.js","webpack:///./~/qrcode/lib/core/polynomial.js","webpack:///./~/qrcode/lib/core/finder-pattern.js","webpack:///./~/dijkstrajs/dijkstra.js","webpack:///./src/api/marketing/shop/store.js?838e","webpack:///./src/views/marketing/shop/table/index.vue","webpack:///./~/qrcode/lib/utils/typedarray-buffer.js","webpack:///./~/qrcode/lib/core/mask-pattern.js","webpack:///./~/window-or-global/lib/index.js","webpack:///./~/can-promise/index.js","webpack:///./~/qrcode/lib/renderer/utils.js","webpack:///./~/qrcode/lib/core/segments.js","webpack:///./~/qrcode/lib/core/utils.js","webpack:///./~/qrcode/lib/core/numeric-data.js","webpack:///./~/qrcode/lib/core/mode.js","webpack:///./~/qrcode/lib/core/error-correction-level.js","webpack:///./~/qrcode/lib/core/byte-data.js","webpack:///./~/qrcode/lib/core/reed-solomon-encoder.js","webpack:///./~/qrcode/lib/core/format-info.js","webpack:///./~/qrcode/lib/core/kanji-data.js"],"names":["webpackJsonp","1Y2G","module","exports","__webpack_require__","getBestVersionForDataLength","mode","length","errorCorrectionLevel","currentVersion","getCapacity","getReservedBitsCount","version","Mode","getCharCountIndicator","getTotalBitsFromDataArray","segments","totalBits","forEach","data","reservedBits","getBitsLength","getBestVersionForMixedData","MIXED","Utils","ECCode","ECLevel","isArray","G18_BCH","getBCHDigit","isValid","isNaN","from","value","defaultValue","parseInt","Error","BYTE","totalCodewords","getSymbolTotalCodewords","ecTotalCodewords","getTotalCodewordsCount","dataTotalCodewordsBits","usableBits","NUMERIC","Math","floor","ALPHANUMERIC","KANJI","getBestVersionForData","seg","ecl","M","getLength","getEncodedBits","d","71e1","renderCanvas","renderFunc","canvas","text","opts","cb","args","slice","call","arguments","argsNum","isLastArgCb","canPromise","undefined","getContext","Promise","resolve","reject","QRCode","create","e","CanvasRenderer","SvgRenderer","toCanvas","bind","render","toDataURL","renderToDataURL","toString","_","729m","getColorAttrib","color","attrib","alpha","a","str","hex","toFixed","svgCmd","cmd","x","y","qrToPath","size","margin","path","moveBy","newRow","lineLength","i","col","row","qrData","options","getOptions","modules","qrcodesize","bg","light","dark","viewBox","width","svgTag","7P5H","__webpack_exports__","__WEBPACK_IMPORTED_MODULE_0_qrcode__","__WEBPACK_IMPORTED_MODULE_0_qrcode___default","n","__WEBPACK_IMPORTED_MODULE_1__api_marketing_shop_store__","__WEBPACK_IMPORTED_MODULE_2__api_marketing_shop_table__","__WEBPACK_IMPORTED_MODULE_3__api_marketing_shop_tableGroup__","created","_this","this","org","ruleForm","then","response","shopList","result","rows","store","id","selectlist","computed","downname","watch","ruleForm.store","_this2","grouplist","filters","tranGroupName","shoplist","name","index","groupName","dialogVisible","img","title","usertype","$store","getters","orgId","form","tableName","seats","groupId","comment","manageList","list","dialogFormVisible","rule","required","message","trigger","pattern","methods","downQrcode","_this3","url","catch","err","shopChange","_this4","addTable","updateTable","item","delTable","_this5","$confirm","type","center","subTable","_this6","$refs","validate","valid","shopId","9ff9","clearCanvas","ctx","clearRect","height","style","getCanvasElement","document","createElement","canvasEl","getImageWidth","image","createImageData","qrToImageData","putImageData","rendererOpts","quality","9jEu","getSymbolSize","getRowColCoords","posCount","intervals","ceil","positions","push","reverse","getPositions","coords","pos","posLength","j","DEuz","BitBuffer","buffer","prototype","get","bufIndex","put","num","putBit","getLengthInBits","bit","Dsid","Array","arr","Ljbq","tableGroupList","shopid","__WEBPACK_IMPORTED_MODULE_0__utils_fetch__","method","tableSub","params","tableDel","NV47","Buffer","EXP_TABLE","LOG_TABLE","log","exp","mul","NY/E","kanji","replace","byte","RegExp","BYTE_KANJI","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","testKanji","test","testNumeric","testAlphanumeric","Oa9l","_vm","_h","$createElement","_c","_self","staticClass","ref","attrs","model","label-width","label","prop","placeholder","filterable","on","change","callback","$$v","$set","expression","_l","shopvo","key","_v","click","$event","to","visible","update:visible","rules","groupvo","staticStyle","trim","slot","element-loading-text","border","fit","align","scopedSlots","_u","fn","scope","_s","_f","src","href","download","staticRenderFns","esExports","RO0P","AlphanumericData","ALPHA_NUM_CHARS","write","bitBuffer","indexOf","RY9c","BitMatrix","fill","reservedBit","set","reserved","xor","isReserved","Sd0T","EC_BLOCKS_TABLE","EC_CODEWORDS_TABLE","getBlocksCount","L","Q","H","UHv4","tableList","WEzc","setupFinderPattern","matrix","FinderPattern","r","c","setupTimingPattern","setupAlignmentPattern","AlignmentPattern","setupVersionInfo","mod","bits","Version","setupFormatInfo","maskPattern","FormatInfo","setupData","inc","bitIndex","byteIndex","createData","remainingByte","createCodewords","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","ReedSolomonEncoder","offset","dcData","ecData","maxDataSize","b","dataSize","encode","max","createSymbol","Segments","fromArray","estimatedVersion","rawSegments","rawSplit","fromString","bestVersion","dataBits","moduleCount","MaskPattern","getBestMask","applyMask","mask","toSJISFunc","setToSJISFunction","X0RI","GF","p1","p2","coeff","divident","divisor","generateECPolynomial","degree","poly","YamF","b2+w","dijkstra","single_source_shortest_paths","graph","s","predecessors","costs","open","PriorityQueue","make","closest","u","v","cost_of_s_to_u","adjacent_nodes","cost_of_e","cost_of_s_to_u_plus_cost_of_e","cost_of_s_to_v","empty","pop","cost","hasOwnProperty","msg","join","extract_shortest_path_from_predecessor_list","nodes","find_path","T","t","queue","sorter","default_sorter","sort","shift","g45I","storeList","storeAdd","storeFind","storeEdit","par","storeOta","storeDel","hqPG","Object","defineProperty","__WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_index_vue__","__WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_e79062fa_hasScoped_false_node_modules_vue_loader_lib_selector_type_template_index_0_index_vue__","normalizeComponent","Component","jF+B","arg","TYPED_ARRAY_SUPPORT","allocUnsafe","checked","K_MAX_LENGTH","RangeError","isnan","val","createBuffer","that","buf","Uint8Array","__proto__","string","byteLength","actual","fromArrayLike","array","fromArrayBuffer","byteOffset","fromObject","obj","isBuffer","len","copy","ArrayBuffer","TypeError","utf8ToBytes","units","Infinity","codePoint","leadSurrogate","bytes","charCodeAt","isView","blitBuffer","dst","utf8Write","foo","Symbol","species","configurable","enumerable","writable","isFinite","remaining","start","end","newBuf","subarray","sliceLen","target","targetStart","code","concat","_isBuffer","ljsv","getMaskAt","Patterns","PATTERN000","PATTERN001","PATTERN010","PATTERN011","PATTERN100","PATTERN101","PATTERN110","PATTERN111","PenaltyScores","N1","N2","N3","N4","getPenaltyN1","points","sameCountCol","sameCountRow","lastCol","lastRow","getPenaltyN2","last","getPenaltyN3","bitsCol","bitsRow","getPenaltyN4","darkCount","modulesCount","abs","setupFormatFunc","numPatterns","keys","bestPattern","lowerPenalty","p","penalty","mulC","global","self","mwnW","G","nwDn","hex2rgba","hexCode","split","apply","map","hexValue","g","scale","getScale","qrSize","imgData","qr","symbolSize","scaledMargin","palette","posDst","pxColor","iSrc","jSrc","nyx9","getStringByteLength","unescape","encodeURIComponent","getSegments","regex","exec","getSegmentsFromString","dataStr","byteSegs","kanjiSegs","numSegs","Regex","alphaNumSegs","isKanjiModeEnabled","s1","s2","getSegmentBitsLength","NumericData","KanjiData","ByteData","mergeSegments","segs","reduce","acc","curr","prevSeg","buildNodes","buildGraph","table","prevNodeIds","nodeGroup","currentNodeIds","node","lastCount","prevNodeId","buildSingleSegment","modesHint","bestMode","getBestModeForData","optimizedSegs","oLzS","toSJISFunction","CODEWORDS_COUNT","digit","f","toSJIS","sYKs","group","substr","remainingNum","uF9H","toLowerCase","ccBits","utyv","level","vPzN","l","wBZN","genPoly","initialize","Polynomial","pad","paddedData","remainder","buff","xR/K","G15_BCH","zYqW"],"mappings":"AAAAA,cAAc,IAERC,OACA,SAAUC,EAAQC,EAASC,GCOjC,QAAAC,GAAAC,EAAAC,EAAAC,GACA,OAAAC,GAAA,EAA8BA,GAAA,GAAsBA,IACpD,GAAAF,GAAAJ,EAAAO,YAAAD,EAAAD,EAAAF,GACA,MAAAG,GAOA,QAAAE,GAAAL,EAAAM,GAEA,MAAAC,GAAAC,sBAAAR,EAAAM,GAAA,EAGA,QAAAG,GAAAC,EAAAJ,GACA,GAAAK,GAAA,CAOA,OALAD,GAAAE,QAAA,SAAAC,GACA,GAAAC,GAAAT,EAAAQ,EAAAb,KAAAM,EACAK,IAAAG,EAAAD,EAAAE,kBAGAJ,EAGA,QAAAK,GAAAN,EAAAR,GACA,OAAAC,GAAA,EAA8BA,GAAA,GAAsBA,IAAA,CAEpD,GADAM,EAAAC,EAAAP,IACAN,EAAAO,YAAAD,EAAAD,EAAAK,EAAAU,OACA,MAAAd,IAxCA,GAAAe,GAAApB,EAAA,QACAqB,EAAArB,EAAA,QACAsB,EAAAtB,EAAA,QACAS,EAAAT,EAAA,QACAuB,EAAAvB,EAAA,QAIAwB,EAAAJ,EAAAK,YADA,KA8CA1B,GAAA2B,QAAA,SAAAlB,GACA,OAAAmB,MAAAnB,OAAA,GAAAA,GAAA,IAWAT,EAAA6B,KAAA,SAAAC,EAAAC,GACA,MAAA/B,GAAA2B,QAAAG,GACAE,SAAAF,EAAA,IAGAC,GAYA/B,EAAAO,YAAA,SAAAE,EAAAJ,EAAAF,GACA,IAAAH,EAAA2B,QAAAlB,GACA,SAAAwB,OAAA,+BAIA,KAAA9B,MAAAO,EAAAwB,KAGA,IAAAC,GAAAd,EAAAe,wBAAA3B,GAGA4B,EAAAf,EAAAgB,uBAAA7B,EAAAJ,GAGAkC,EAAA,GAAAJ,EAAAE,EAEA,IAAAlC,IAAAO,EAAAU,MAAA,MAAAmB,EAEA,IAAAC,GAAAD,EAAA/B,EAAAL,EAAAM,EAGA,QAAAN,GACA,IAAAO,GAAA+B,QACA,MAAAC,MAAAC,MAAAH,EAAA,KAEA,KAAA9B,GAAAkC,aACA,MAAAF,MAAAC,MAAAH,EAAA,KAEA,KAAA9B,GAAAmC,MACA,MAAAH,MAAAC,MAAAH,EAAA,GAEA,KAAA9B,GAAAwB,KACA,QACA,MAAAQ,MAAAC,MAAAH,EAAA,KAYAxC,EAAA8C,sBAAA,SAAA9B,EAAAX,GACA,GAAA0C,GAEAC,EAAAzB,EAAAM,KAAAxB,EAAAkB,EAAA0B,EAEA,IAAAzB,EAAAR,GAAA,CACA,GAAAA,EAAAZ,OAAA,EACA,MAAAe,GAAAH,EAAAgC,EAGA,QAAAhC,EAAAZ,OACA,QAGA2C,GAAA/B,EAAA,OAEA+B,GAAA/B,CAGA,OAAAd,GAAA6C,EAAA5C,KAAA4C,EAAAG,YAAAF,IAaAhD,EAAAmD,eAAA,SAAA1C,GACA,IAAAT,EAAA2B,QAAAlB,MAAA,EACA,SAAAwB,OAAA,0BAKA,KAFA,GAAAmB,GAAA3C,GAAA,GAEAY,EAAAK,YAAA0B,GAAA3B,GAAA,GACA2B,GAjKA,MAiKA/B,EAAAK,YAAA0B,GAAA3B,CAGA,OAAAhB,IAAA,GAAA2C,IDWMC,OACA,SAAUtD,EAAQC,EAASC,GElLjC,QAAAqD,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,GAAAC,MAAAC,MAAAC,KAAAC,UAAA,GACAC,EAAAJ,EAAAxD,OACA6D,EAAA,kBAAAL,GAAAI,EAAA,EAEA,KAAAC,IAAAC,IACA,SAAAjC,OAAA,qCAGA,KAAAgC,EAoBG,CACH,GAAAD,EAAA,EACA,SAAA/B,OAAA,6BAYA,OATA,KAAA+B,GACAP,EAAAD,EACAA,EAAAE,MAAAS,IACK,IAAAH,GAAAR,EAAAY,aACLV,EAAAD,EACAA,EAAAD,EACAA,MAAAW,IAGA,GAAAE,SAAA,SAAAC,EAAAC,GACA,IACA,GAAAvD,GAAAwD,EAAAC,OAAAhB,EAAAC,EACAY,GAAAf,EAAAvC,EAAAwC,EAAAE,IACO,MAAAgB,GACPH,EAAAG,MAtCA,GAAAV,EAAA,EACA,SAAA/B,OAAA,6BAGA,KAAA+B,GACAL,EAAAF,EACAA,EAAAD,EACAA,EAAAE,MAAAS,IACK,IAAAH,IACLR,EAAAY,gBAAA,KAAAT,GACAA,EAAAD,EACAA,MAAAS,KAEAR,EAAAD,EACAA,EAAAD,EACAA,EAAAD,EACAA,MAAAW,IA2BA,KACA,GAAAnD,GAAAwD,EAAAC,OAAAhB,EAAAC,EACAC,GAAA,KAAAJ,EAAAvC,EAAAwC,EAAAE,IACG,MAAAgB,GACHf,EAAAe,IA9DA,GAAAR,GAAAjE,EAAA,QACAuE,EAAAvE,EAAA,QACA0E,EAAA1E,EAAA,QACA2E,EAAA3E,EAAA,OA+DAD,GAAAyE,OAAAD,EAAAC,OACAzE,EAAA6E,SAAAvB,EAAAwB,KAAA,KAAAH,EAAAI,QACA/E,EAAAgF,UAAA1B,EAAAwB,KAAA,KAAAH,EAAAM,iBAGAjF,EAAAkF,SAAA5B,EAAAwB,KAAA,cAAA9D,EAAAmE,EAAAzB,GACA,MAAAkB,GAAAG,OAAA/D,EAAA0C,MF+LM0B,OACA,SAAUrF,EAAQC,EAASC,GGtQjC,QAAAoF,GAAAC,EAAAC,GACA,GAAAC,GAAAF,EAAAG,EAAA,IACAC,EAAAH,EAAA,KAAAD,EAAAK,IAAA,GAEA,OAAAH,GAAA,EACAE,EAAA,IAAAH,EAAA,aAAAC,EAAAI,QAAA,GAAA/B,MAAA,OACA6B,EAGA,QAAAG,GAAAC,EAAAC,EAAAC,GACA,GAAAN,GAAAI,EAAAC,CAGA,YAFA,KAAAC,IAAAN,GAAA,IAAAM,GAEAN,EAGA,QAAAO,GAAAjF,EAAAkF,EAAAC,GAMA,OALAC,GAAA,GACAC,EAAA,EACAC,GAAA,EACAC,EAAA,EAEAC,EAAA,EAAiBA,EAAAxF,EAAAZ,OAAiBoG,IAAA,CAClC,GAAAC,GAAA/D,KAAAC,MAAA6D,EAAAN,GACAQ,EAAAhE,KAAAC,MAAA6D,EAAAN,EAEAO,IAAAH,OAAA,GAEAtF,EAAAwF,IACAD,IAEAC,EAAA,GAAAC,EAAA,GAAAzF,EAAAwF,EAAA,KACAJ,GAAAE,EACAT,EAAA,IAAAY,EAAAN,EAAA,GAAAO,EAAAP,GACAN,EAAA,IAAAQ,EAAA,GAEAA,EAAA,EACAC,GAAA,GAGAG,EAAA,EAAAP,GAAAlF,EAAAwF,EAAA,KACAJ,GAAAP,EAAA,IAAAU,GACAA,EAAA,IAGAF,IAIA,MAAAD,GAnDA,GAAA/E,GAAApB,EAAA,OAsDAD,GAAA+E,OAAA,SAAA4B,EAAAC,EAAAjD,GACA,GAAAD,GAAArC,EAAAwF,WAAAD,GACAV,EAAAS,EAAAG,QAAAZ,KACAlF,EAAA2F,EAAAG,QAAA9F,KACA+F,EAAAb,EAAA,EAAAxC,EAAAyC,OAEAa,EAAAtD,EAAA4B,MAAA2B,MAAAxB,EAEA,SAAAJ,EAAA3B,EAAA4B,MAAA2B,MAAA,QACA,YAAAF,EAAA,IAAAA,EAAA,SAFA,GAIAX,EACA,SAAAf,EAAA3B,EAAA4B,MAAA4B,KAAA,UACA,OAAAjB,EAAAjF,EAAAkF,EAAAxC,EAAAyC,QAAA,MAEAgB,EAAA,gBAAAJ,EAAA,IAAAA,EAAA,IAEAK,EAAA1D,EAAA0D,MAAA,UAAA1D,EAAA0D,MAAA,aAAA1D,EAAA0D,MAAA,QAEAC,EAAA,2CAAAD,EAAAD,EAAA,IAAAH,EAAAZ,EAAA,QAMA,OAJA,kBAAAzC,IACAA,EAAA,KAAA0D,GAGAA,IHgRMC,OACA,SAAUvH,EAAQwH,EAAqBtH,GAE7C,YACqB,IAAIuH,GAAuCvH,EAAoB,QAC3DwH,EAA+CxH,EAAoByH,EAAEF,GACrEG,EAA0D1H,EAAoB,QAC9E2H,EAA0D3H,EAAoB,QAC9E4H,EAA+D5H,EAAoB,OAwF/EsH,GAAuB,GAChDO,QAAS,WIvWb,GAAAC,GAAAC,IJ0WQ/H,GAAoBuG,EAAEmB,EAA2E,IAAKM,IAAKD,KAAKE,SAASD,MAAOE,KAAK,SAAUC,GAC3IL,EAAMM,SAAWD,EAASE,OIzWtCC,KJ0WYR,EAAMG,SAASM,MAAQT,EAAMM,SAAS,GIzWlDI,GJ0WYV,EIzWZW,gBJ6WIC,UACIC,SAAY,WACR,MAAOZ,MAAKZ,MAAQ,IAAMY,KAAKZ,MI1W3C,SJ6WIyB,OACIC,iBAAkB,SAAuBL,GI1WjD,GAAAM,GAAAf,IJ6WY/H,GAAoBuG,EAAEqB,EAAqF,GAAGY,GAAIN,KAAK,SAAUC,GAC7HW,EAAOC,UAAYZ,EI5WnCE,WJgXIW,SACIC,cAAe,SAAuBT,EAAIU,GACtC,GAAIC,GI5WhB,EJkXY,OALAD,GAASpI,QAAQ,SAAUgF,EAAGsD,GACtBtD,EAAE0C,IAAMA,IACRW,EAAOrD,EI5W3BuD,aAGAF,IJ+WIpI,KAAM,WACF,OACIuI,eI5WZ,EJ6WYC,II5WZ,GJ6WYpC,MI5WZ,GJ6WYqC,MI5WZ,GJ6WYT,aACAU,SAAU1B,KAAK2B,OAAOC,QI5WlCF,SJ6WYxB,UACID,IAAKD,KAAK2B,OAAOC,QI5WjCC,MJ6WgBrB,MI3WhB,IJ6WYsB,MACIC,UI5WhB,GJ6WgBC,MI5WhB,GJ6WgBC,QI5WhB,KJ6WgBC,QI3WhB,IJ6WYC,cACA9B,YACA+B,QACAC,mBI5WZ,EJ6WYC,MACIP,YI5WhBQ,UAAA,EAAAC,QAAA,OAAAC,QAGA,SJ0WgBT,QIzWhBU,QAAA,uBAAAF,QAAA,kBAAAC,QAIA,YJ0WIE,SACIC,WAAY,SAAoBnC,EAAIrB,GIxW5C,GAAAyD,GAAA7C,KJ4WgBvE,EAAO,uEAA8EuE,KAAKE,SAASM,MAAQ,UI1W3HC,CJ4WYhB,GAA6ChC,EAAET,UAAUvB,GAAQpD,qBAAsB,IAAK+G,MI1WxGA,IAAAe,KAAA,SAAA2C,GJ2WgBD,EAAOtB,eIzWvB,EJ0WgBsB,EAAOrB,IIzWvBsB,EJ0WgBD,EAAOzD,MIzWvBA,IACA2D,MAAA,SAAAC,OJ2WQC,WAAY,WACRjD,KIvWZU,cJyWQA,WAAY,WIvWpB,GAAAwC,GAAAlD,IJ0WY/H,GAAoBuG,EAAEoB,EAA2E,GAAGI,KAAKE,SAASM,OAAOL,KAAK,SAAUC,GACpI8C,EAAOd,KAAOhC,EIzW9BE,UJ4WQ6C,SAAU,WACNnD,KAAK8B,MACDC,UIxWhB,GJyWgBE,SIxWhB,EJyWgBC,QIvWhB,IAJAlC,KAAAqC,mBAKA,GJyWQe,YAAa,SAAqBC,GAC9BrD,KAAK8B,MACDrB,GAAI4C,EIvWpB5C,GJwWgBsB,UAAWsB,EIvW3BtB,UJwWgBG,QAASmB,EIvWzBnB,QJwWgBF,MAAOqB,EIvWvBrB,MJwWgBC,QAASoB,EItWzBpB,SJwWYjC,KAAKqC,mBIvWjB,GJyWQiB,SAAU,SAAkB7C,GItWpC,GAAA8C,GAAAvD,IJyWYA,MAAKwD,SAAS,sBAAuB,IACjCC,KIxWhB,UJyWgBC,QIxWhB,IAFAvD,KAAA,WJ4WgBlI,EAAoBuG,EAAEoB,EAA0E,GAAGa,GAAIN,KAAK,SAAUC,GAClHmD,EIxWpB7C,iBJ0WeqC,MAAM,eAEbY,SAAU,WIvWlB,GAAAC,GAAA5D,IJ0WYA,MAAK6D,MAAY,KAAEC,SAAS,SAAUC,GAClC,IAAIA,EAOA,OIzWpB,CJmWoBH,GAAO9B,KAAKkC,OAASJ,EAAO1D,SIzWhDM,MJ0WoBvI,EAAoBuG,EAAEoB,EAA0E,GAAGgE,EAAO9B,MAAM3B,KAAK,SAAUC,GAC3HwD,EAAOvB,mBIzW/B,EJ0WwBuB,EIzWxBlD,qBJsXMuD,OACA,SAAUlM,EAAQC,EAASC,GKxkBjC,QAAAiM,GAAAC,EAAA3I,EAAA0C,GACAiG,EAAAC,UAAA,IAAA5I,EAAA4D,MAAA5D,EAAA6I,QAEA7I,EAAA8I,QAAA9I,EAAA8I,UACA9I,EAAA6I,OAAAnG,EACA1C,EAAA4D,MAAAlB,EACA1C,EAAA8I,MAAAD,OAAAnG,EAAA,KACA1C,EAAA8I,MAAAlF,MAAAlB,EAAA,KAGA,QAAAqG,KACA,IACA,MAAAC,UAAAC,cAAA,UACG,MAAA/H,GACH,SAAAzC,OAAA,yCAhBA,GAAAZ,GAAApB,EAAA,OAoBAD,GAAA+E,OAAA,SAAA4B,EAAAnD,EAAAoD,GACA,GAAAlD,GAAAkD,EACA8F,EAAAlJ,MAEA,KAAAE,GAAAF,KAAAY,aACAV,EAAAF,EACAA,MAAAW,IAGAX,IACAkJ,EAAAH,KAGA7I,EAAArC,EAAAwF,WAAAnD,EACA,IAAAwC,GAAA7E,EAAAsL,cAAAhG,EAAAG,QAAAZ,KAAAxC,GAEAyI,EAAAO,EAAAtI,WAAA,MACAwI,EAAAT,EAAAU,gBAAA3G,IAMA,OALA7E,GAAAyL,cAAAF,EAAA5L,KAAA2F,EAAAjD,GAEAwI,EAAAC,EAAAO,EAAAxG,GACAiG,EAAAY,aAAAH,EAAA,KAEAF,GAGA1M,EAAAiF,gBAAA,SAAA0B,EAAAnD,EAAAoD,GACA,GAAAlD,GAAAkD,MAEA,KAAAlD,GAAAF,KAAAY,aACAV,EAAAF,EACAA,MAAAW,IAGAT,SAEA,IAAAgJ,GAAA1M,EAAA+E,OAAA4B,EAAAnD,EAAAE,GAEA+H,EAAA/H,EAAA+H,MAAA,YACAuB,EAAAtJ,EAAAsJ,gBAEA,OAAAN,GAAA1H,UAAAyG,EAAAuB,EAAAC,WLklBMC,OACA,SAAUnN,EAAQC,EAASC,GMtoBjC,GAAAkN,GAAAlN,EAAA,QAAAkN,aAgBAnN,GAAAoN,gBAAA,SAAA3M,GACA,OAAAA,EAAA,QAOA,QALA4M,GAAA3K,KAAAC,MAAAlC,EAAA,KACAyF,EAAAiH,EAAA1M,GACA6M,EAAA,MAAApH,EAAA,KAAAxD,KAAA6K,MAAArH,EAAA,OAAAmH,EAAA,IACAG,GAAAtH,EAAA,GAEAM,EAAA,EAAiBA,EAAA6G,EAAA,EAAkB7G,IACnCgH,EAAAhH,GAAAgH,EAAAhH,EAAA,GAAA8G,CAKA,OAFAE,GAAAC,KAAA,GAEAD,EAAAE,WAuBA1N,EAAA2N,aAAA,SAAAlN,GAKA,OAJAmN,MACAC,EAAA7N,EAAAoN,gBAAA3M,GACAqN,EAAAD,EAAAzN,OAEAoG,EAAA,EAAiBA,EAAAsH,EAAetH,IAChC,OAAAuH,GAAA,EAAmBA,EAAAD,EAAeC,IAElC,IAAAvH,GAAA,IAAAuH,GACA,IAAAvH,GAAAuH,IAAAD,EAAA,GACAtH,IAAAsH,EAAA,OAAAC,GAIAH,EAAAH,MAAAI,EAAArH,GAAAqH,EAAAE,IAIA,OAAAH,KNwpBMI,KACA,SAAUjO,EAAQC,GO1uBxB,QAAAiO,KACAjG,KAAAkG,UACAlG,KAAA5H,OAAA,EAGA6N,EAAAE,WAEAC,IAAA,SAAA/E,GACA,GAAAgF,GAAA3L,KAAAC,MAAA0G,EAAA,EACA,YAAArB,KAAAkG,OAAAG,KAAA,EAAAhF,EAAA,MAGAiF,IAAA,SAAAC,EAAAnO,GACA,OAAAoG,GAAA,EAAmBA,EAAApG,EAAYoG,IAC/BwB,KAAAwG,OAAA,IAAAD,IAAAnO,EAAAoG,EAAA,OAIAiI,gBAAA,WACA,MAAAzG,MAAA5H,QAGAoO,OAAA,SAAAE,GACA,GAAAL,GAAA3L,KAAAC,MAAAqF,KAAA5H,OAAA,EACA4H,MAAAkG,OAAA9N,QAAAiO,GACArG,KAAAkG,OAAAT,KAAA,GAGAiB,IACA1G,KAAAkG,OAAAG,IAAA,MAAArG,KAAA5H,OAAA,GAGA4H,KAAA5H,WAIAL,EAAAC,QAAAiO,GPivBMU,KACA,SAAU5O,EAAQC,GQtxBxB,GAAAkF,MAAiBA,QAEjBnF,GAAAC,QAAA4O,MAAApN,SAAA,SAAAqN,GACA,wBAAA3J,EAAApB,KAAA+K,KR8xBMC,KACA,SAAU/O,EAAQwH,EAAqBtH,GAE7C,YSjyBO,SAAS8O,GAAeC,GAC3B,MAAO/O,GAAAuG,EAAAyI,EAAA,IACHnE,IAAK,iCAAmCkE,EAExCE,OAAQ,QAKT,QAASC,GAASC,GACrB,GAAIF,GAAS,MACb,OAAIE,GAAO3G,IACPyG,EAAS,MACJjP,EAAAuG,EAAAyI,EAAA,IACLnE,IAAK,2BACLoE,OAAQA,EACRE,YAGKnP,EAAAuG,EAAAyI,EAAA,IACLnE,IAAK,2BACLoE,OAAQA,EACRlO,KAAKoO,IAON,QAASC,GAAS5G,GACrB,MAAOxI,GAAAuG,EAAAyI,EAAA,IACHnE,IAAK,4BAA8BrC,EACnCyG,OAAQ,WTkwBiB3H,EAAuB,EAAIwH,EAC3BxH,EAAuB,EAAI4H,EAC3B5H,EAAuB,EAAI8H,CACvC,IAAIJ,GAA6ChP,EAAoB,SA0CpFqP,KACA,SAAUvP,EAAQC,EAASC,GUn1BjC,GAAAsP,GAAAtP,EAAA,QAEAuP,EAAA,GAAAD,GAAA,KACAE,EAAA,GAAAF,GAAA,MAUC,WAED,OADAxJ,GAAA,EACAS,EAAA,EAAiBA,EAAA,IAASA,IAC1BgJ,EAAAhJ,GAAAT,EACA0J,EAAA1J,GAAAS,EAMA,KAJAT,IAAA,KAKAA,GAAA,IAQA,KAAAS,EAAA,IAAeA,EAAA,IAASA,IACxBgJ,EAAAhJ,GAAAgJ,EAAAhJ,EAAA,QAUAxG,EAAA0P,IAAA,SAAAhI,GACA,GAAAA,EAAA,WAAAzF,OAAA,OAAAyF,EAAA,IACA,OAAA+H,GAAA/H,IASA1H,EAAA2P,IAAA,SAAAjI,GACA,MAAA8H,GAAA9H,IAUA1H,EAAA4P,IAAA,SAAA7J,EAAAC,GACA,WAAAD,GAAA,IAAAC,EAAA,EAIAwJ,EAAAC,EAAA1J,GAAA0J,EAAAzJ,MV21BM6J,OACA,SAAU9P,EAAQC,GWl6BxB,GAEA8P,GAAA,kNAIAA,KAAAC,QAAA,WAEA,IAAAC,GAAA,6BAAAF,EAAA,MAEA9P,GAAA6C,MAAA,GAAAoN,QAAAH,EAAA,KACA9P,EAAAkQ,WAAA,GAAAD,QAAA,6BACAjQ,EAAAkC,KAAA,GAAA+N,QAAAD,EAAA,KACAhQ,EAAAyC,QAAA,GAAAwN,QAbA,SAaA,KACAjQ,EAAA4C,aAAA,GAAAqN,QAbA,oBAaA,IAEA,IAAAE,GAAA,GAAAF,QAAA,IAAAH,EAAA,KACAM,EAAA,GAAAH,QAAA,YACAI,EAAA,GAAAJ,QAAA,yBAEAjQ,GAAAsQ,UAAA,SAAA5K,GACA,MAAAyK,GAAAI,KAAA7K,IAGA1F,EAAAwQ,YAAA,SAAA9K,GACA,MAAA0K,GAAAG,KAAA7K,IAGA1F,EAAAyQ,iBAAA,SAAA/K,GACA,MAAA2K,GAAAE,KAAA7K,KX06BMgL,KACA,SAAU3Q,EAAQwH,EAAqBtH,GAE7C,YY18BA,IAAA8E,GAAA,WAA0B,GAAA4L,GAAA3I,KAAa4I,EAAAD,EAAAE,eAA0BC,EAAAH,EAAAI,MAAAD,IAAAF,CACjE,OAAAE,GAAA,OACAE,YAAA,kBACGF,EAAA,WACHG,IAAA,WACAC,OACAC,MAAAR,EAAAzI,SACAkJ,cAAA,UAEGN,EAAA,gBACHI,OACAG,MAAA,GACAC,KAAA,SAEGR,EAAA,aACHI,OACAK,YAAA,KACAC,WAAA,IAEAC,IACAC,OAAAf,EAAA1F,YAEAkG,OACArP,MAAA6O,EAAAzI,SAAA,MACAyJ,SAAA,SAAAC,GACAjB,EAAAkB,KAAAlB,EAAAzI,SAAA,QAAA0J,IAEAE,WAAA,mBAEGnB,EAAAoB,GAAApB,EAAA,kBAAAqB,GACH,MAAAlB,GAAA,aACAmB,IAAAD,EAAAvJ,GACAyI,OACAG,MAAAW,EAAA5I,KACAtH,MAAAkQ,EAAAvJ,UAGG,OAAAkI,EAAAuB,GAAA,KAAApB,EAAA,OACHE,YAAA,eACGF,EAAA,aACHI,OACAzF,KAAA,WAEAgG,IACAU,MAAA,SAAAC,GACAzB,EAAAxF,eAGGwF,EAAAuB,GAAA,UAAAvB,EAAAuB,GAAA,KAAApB,EAAA,eACHI,OACAmB,GAAA,gBAEGvB,EAAA,aACHI,OACAzF,KAAA,aAEGkF,EAAAuB,GAAA,mBAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACHI,OACAzH,MAAA,GACA6I,QAAA3B,EAAAtG,mBAEAoH,IACAc,iBAAA,SAAAH,GACAzB,EAAAtG,kBAAA+H,MAGGtB,EAAA,WACHG,IAAA,OACAC,OACAC,MAAAR,EAAA7G,KACA0I,MAAA7B,EAAArG,QAEGwG,EAAA,gBACHI,OACAG,MAAA,KACAD,cAAA,MACAE,KAAA,eAEGR,EAAA,YACHK,OACArP,MAAA6O,EAAA7G,KAAA,UACA6H,SAAA,SAAAC,GACAjB,EAAAkB,KAAAlB,EAAA7G,KAAA,YAAA8H,IAEAE,WAAA,qBAEG,GAAAnB,EAAAuB,GAAA,KAAApB,EAAA,gBACHI,OACAG,MAAA,KACAD,cAAA,MACAE,KAAA,aAEGR,EAAA,aACHI,OACAK,YAAA,MAEAJ,OACArP,MAAA6O,EAAA7G,KAAA,QACA6H,SAAA,SAAAC,GACAjB,EAAAkB,KAAAlB,EAAA7G,KAAA,UAAA8H,IAEAE,WAAA,iBAEGnB,EAAAoB,GAAApB,EAAA,mBAAA8B,GACH,MAAA3B,GAAA,aACAmB,IAAAQ,EAAAhK,GACAyI,OACAG,MAAAoB,EAAAnJ,UACAxH,MAAA2Q,EAAAhK,UAGG,GAAAkI,EAAAuB,GAAA,KAAApB,EAAA,gBACHI,OACAG,MAAA,OACAD,cAAA,MACAE,KAAA,WAEGR,EAAA,YACH4B,aACAtL,MAAA,SAEA8J,OACAK,YAAA,QAEAJ,OACArP,MAAA6O,EAAA7G,KAAA,MACA6H,SAAA,SAAAC,GACAjB,EAAAkB,KAAAlB,EAAA7G,KAAA,wBAAA8H,KAAAe,OAAAf,IAEAE,WAAA,gBAEGhB,EAAA,YACH8B,KAAA,WACGjC,EAAAuB,GAAA,eAAAvB,EAAAuB,GAAA,KAAApB,EAAA,gBACHI,OACAG,MAAA,KACAD,cAAA,MACAE,KAAA,aAEGR,EAAA,YACHK,OACArP,MAAA6O,EAAA7G,KAAA,QACA6H,SAAA,SAAAC,GACAjB,EAAAkB,KAAAlB,EAAA7G,KAAA,UAAA8H,IAEAE,WAAA,mBAEG,OAAAnB,EAAAuB,GAAA,KAAApB,EAAA,OACHE,YAAA,gBACAE,OACA0B,KAAA,UAEAA,KAAA,WACG9B,EAAA,aACHW,IACAU,MAAA,SAAAC,GACAzB,EAAAtG,mBAAA,MAGGsG,EAAAuB,GAAA,SAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACHI,OACAzF,KAAA,WAEAgG,IACAU,MAAAxB,EAAAhF,YAEGgF,EAAAuB,GAAA,iBAAAvB,EAAAuB,GAAA,KAAApB,EAAA,YACHI,OACAlQ,KAAA2P,EAAAvG,KACAyI,uBAAA,QACAC,OAAA,GACAC,IAAA,GACA7M,KAAA,WAEG4K,EAAA,mBACHI,OACA8B,MAAA,SACA3B,MAAA,KACAC,KAAA,YACAlK,MAAA,WAEGuJ,EAAAuB,GAAA,KAAApB,EAAA,mBACHI,OACA8B,MAAA,SACA3B,MAAA,KACAC,KAAA,UACAlK,MAAA,SAEA6L,YAAAtC,EAAAuC,KACAjB,IAAA,UACAkB,GAAA,SAAAC,GACA,OAAAzC,EAAAuB,GAAA,eAAAvB,EAAA0C,GAAA1C,EAAA2C,GAAA,iBAAAF,EAAA1M,IAAAuD,QAAA0G,EAAA3H,YAAA,qBAGG2H,EAAAuB,GAAA,KAAApB,EAAA,mBACHI,OACA8B,MAAA,SACA3B,MAAA,OACAC,KAAA,QACAlK,MAAA,WAEGuJ,EAAAuB,GAAA,KAAApB,EAAA,mBACHI,OACA8B,MAAA,SACA3B,MAAA,MACAjK,MAAA,SAEA6L,YAAAtC,EAAAuC,KACAjB,IAAA,UACAkB,GAAA,SAAAC,GACA,OAAAtC,EAAA,aACAI,OACAzF,KAAA,QAEAgG,IACAU,MAAA,SAAAC,GACAzB,EAAA/F,WAAAwI,EAAA1M,IAAA+B,GAAA,SAGSkI,EAAAuB,GAAA,WAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACTI,OACAzF,KAAA,QAEAgG,IACAU,MAAA,SAAAC,GACAzB,EAAA/F,WAAAwI,EAAA1M,IAAA+B,GAAA,SAGSkI,EAAAuB,GAAA,WAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACTI,OACAzF,KAAA,QAEAgG,IACAU,MAAA,SAAAC,GACAzB,EAAA/F,WAAAwI,EAAA1M,IAAA+B,GAAA,SAGSkI,EAAAuB,GAAA,WAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACTI,OACAzF,KAAA,QAEAgG,IACAU,MAAA,SAAAC,GACAzB,EAAA/F,WAAAwI,EAAA1M,IAAA+B,GAAA,UAGSkI,EAAAuB,GAAA,mBAGNvB,EAAAuB,GAAA,KAAApB,EAAA,mBACHI,OACA8B,MAAA,SACA3B,MAAA,KACAC,KAAA,aAEGX,EAAAuB,GAAA,KAAApB,EAAA,mBACHI,OACA8B,MAAA,SACA3B,MAAA,KACAjK,MAAA,SAEA6L,YAAAtC,EAAAuC,KACAjB,IAAA,UACAkB,GAAA,SAAAC,GACA,OAAAtC,EAAA,aACAI,OACAzF,KAAA,UACAvF,KAAA,SAEAuL,IACAU,MAAA,SAAAC,GACAzB,EAAAvF,YAAAgI,EAAA1M,SAGSiK,EAAAuB,GAAA,QAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACTI,OACAzF,KAAA,SACAvF,KAAA,SAEAuL,IACAU,MAAA,SAAAC,GACAzB,EAAArF,SAAA8H,EAAA1M,IAAA+B,QAGSkI,EAAAuB,GAAA,gBAGN,GAAAvB,EAAAuB,GAAA,KAAApB,EAAA,aACHI,OACAzH,MAAAkH,EAAAlH,MACA6I,QAAA3B,EAAApH,cACAnC,MAAA,OAEAqK,IACAc,iBAAA,SAAAH,GACAzB,EAAApH,cAAA6I,MAGGtB,EAAA,QAAAA,EAAA,OACHI,OACAqC,IAAA5C,EAAAnH,IACApC,MAAA,YAEGuJ,EAAAuB,GAAA,KAAApB,EAAA,QACHE,YAAA,gBACAE,OACA0B,KAAA,UAEAA,KAAA,WACG9B,EAAA,KACHI,OACAsC,KAAA7C,EAAAnH,IACAiK,SAAA9C,EAAA/H,YAEGkI,EAAA,aACHI,OACAzF,KAAA,aAEGkF,EAAAuB,GAAAvB,EAAA0C,GAAA1C,EAAAvJ,OAAA,IAAAuJ,EAAA0C,GAAA1C,EAAAvJ,OAAA,qBAEHsM,KACAC,GAAiB5O,SAAA2O,kBACjBnM,GAAA,KZ+8BMqM,KACA,SAAU7T,EAAQC,EAASC,GahwCjC,QAAA4T,GAAA7S,GACAgH,KAAA7H,KAAAO,EAAAkC,aACAoF,KAAAhH,OApBA,GAAAN,GAAAT,EAAA,QAWA6T,GACA,wCACA,oDACA,oDACA,oCAQAD,GAAA3S,cAAA,SAAAd,GACA,UAAAsC,KAAAC,MAAAvC,EAAA,GAAAA,EAAA,KAGAyT,EAAA1F,UAAAjL,UAAA,WACA,MAAA8E,MAAAhH,KAAAZ,QAGAyT,EAAA1F,UAAAjN,cAAA,WACA,MAAA2S,GAAA3S,cAAA8G,KAAAhH,KAAAZ,SAGAyT,EAAA1F,UAAA4F,MAAA,SAAAC,GACA,GAAAxN,EAIA,KAAAA,EAAA,EAAaA,EAAA,GAAAwB,KAAAhH,KAAAZ,OAA2BoG,GAAA,GAExC,GAAA1E,GAAA,GAAAgS,EAAAG,QAAAjM,KAAAhH,KAAAwF,GAGA1E,IAAAgS,EAAAG,QAAAjM,KAAAhH,KAAAwF,EAAA,IAGAwN,EAAA1F,IAAAxM,EAAA,IAKAkG,KAAAhH,KAAAZ,OAAA,GACA4T,EAAA1F,IAAAwF,EAAAG,QAAAjM,KAAAhH,KAAAwF,IAAA,IAIAzG,EAAAC,QAAA6T,GbyxCMK,KACA,SAAUnU,EAAQC,EAASC,Gc70CjC,QAAAkU,GAAAjO,GACA,IAAAA,KAAA,EACA,SAAAjE,OAAA,oDAGA+F,MAAA9B,OACA8B,KAAAhH,KAAA,GAAAuO,GAAArJ,KACA8B,KAAAhH,KAAAoT,KAAA,GACApM,KAAAqM,YAAA,GAAA9E,GAAArJ,KACA8B,KAAAqM,YAAAD,KAAA,GAhBA,GAAA7E,GAAAtP,EAAA,OA4BAkU,GAAAhG,UAAAmG,IAAA,SAAA5N,EAAAD,EAAA3E,EAAAyS,GACA,GAAAlL,GAAA3C,EAAAsB,KAAA9B,KAAAO,CACAuB,MAAAhH,KAAAqI,GAAAvH,EACAyS,IAAAvM,KAAAqM,YAAAhL,IAAA,IAUA8K,EAAAhG,UAAAC,IAAA,SAAA1H,EAAAD,GACA,MAAAuB,MAAAhH,KAAA0F,EAAAsB,KAAA9B,KAAAO,IAWA0N,EAAAhG,UAAAqG,IAAA,SAAA9N,EAAAD,EAAA3E,GACAkG,KAAAhH,KAAA0F,EAAAsB,KAAA9B,KAAAO,IAAA3E,GAUAqS,EAAAhG,UAAAsG,WAAA,SAAA/N,EAAAD,GACA,MAAAuB,MAAAqM,YAAA3N,EAAAsB,KAAA9B,KAAAO,IAGA1G,EAAAC,QAAAmU,Gd21CMO,KACA,SAAU3U,EAAQC,EAASC,Geh6CjC,GAAAsB,GAAAtB,EAAA,QAEA0U,GAEA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,SACA,UACA,UACA,UACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,WACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,aAGAC,GAEA,WACA,YACA,YACA,YACA,YACA,aACA,cACA,cACA,eACA,eACA,eACA,eACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,gBACA,iBACA,iBACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,mBACA,mBACA,mBACA,mBACA,mBACA,mBACA,mBAWA5U,GAAA6U,eAAA,SAAApU,EAAAJ,GACA,OAAAA,GACA,IAAAkB,GAAAuT,EACA,MAAAH,GAAA,GAAAlU,EAAA,KACA,KAAAc,GAAA0B,EACA,MAAA0R,GAAA,GAAAlU,EAAA,KACA,KAAAc,GAAAwT,EACA,MAAAJ,GAAA,GAAAlU,EAAA,KACA,KAAAc,GAAAyT,EACA,MAAAL,GAAA,GAAAlU,EAAA,KACA,SACA,SAYAT,EAAAsC,uBAAA,SAAA7B,EAAAJ,GACA,OAAAA,GACA,IAAAkB,GAAAuT,EACA,MAAAF,GAAA,GAAAnU,EAAA,KACA,KAAAc,GAAA0B,EACA,MAAA2R,GAAA,GAAAnU,EAAA,KACA,KAAAc,GAAAwT,EACA,MAAAH,GAAA,GAAAnU,EAAA,KACA,KAAAc,GAAAyT,EACA,MAAAJ,GAAA,GAAAnU,EAAA,KACA,SACA,Ufy6CMwU,KACA,SAAUlV,EAAQwH,EAAqBtH,GAE7C,YgB7iDO,SAASiV,GAAUlG,GACtB,MAAO/O,GAAAuG,EAAAyI,EAAA,IACHnE,IAAK,4BAA8BkE,EAEnCE,OAAQ,QAKT,QAASC,GAASC,GACrB,GAAIF,GAAS,MAIb,OAHIE,GAAO3G,KACPyG,EAAS,OAENjP,EAAAuG,EAAAyI,EAAA,IACHnE,IAAK,sBACLoE,OAAQA,EACRE,WAKD,QAASC,GAAS5G,GACrB,MAAOxI,GAAAuG,EAAAyI,EAAA,IACHnE,IAAK,uBAAyBrC,EAC9ByG,OAAQ,WhBqhDiB3H,EAAuB,EAAI2N,EAC3B3N,EAAuB,EAAI4H,EAC3B5H,EAAuB,EAAI8H,CACvC,IAAIJ,GAA6ChP,EAAoB,SAoCpFkV,KACA,SAAUpV,EAAQC,EAASC,GiBziDjC,QAAAmV,GAAAC,EAAA5U,GAIA,OAHAyF,GAAAmP,EAAAnP,KACA2H,EAAAyH,EAAA3H,aAAAlN,GAEA+F,EAAA,EAAiBA,EAAAqH,EAAAzN,OAAgBoG,IAIjC,OAHAE,GAAAmH,EAAArH,GAAA,GACAC,EAAAoH,EAAArH,GAAA,GAEA+O,GAAA,EAAoBA,GAAA,EAAQA,IAC5B,KAAA7O,EAAA6O,IAAA,GAAArP,GAAAQ,EAAA6O,GAEA,OAAAC,IAAA,EAAsBA,GAAA,EAAQA,IAC9B/O,EAAA+O,IAAA,GAAAtP,GAAAO,EAAA+O,IAEAD,GAAA,GAAAA,GAAA,QAAAC,GAAA,IAAAA,IACAA,GAAA,GAAAA,GAAA,QAAAD,GAAA,IAAAA,IACAA,GAAA,GAAAA,GAAA,GAAAC,GAAA,GAAAA,GAAA,EACAH,EAAAf,IAAA5N,EAAA6O,EAAA9O,EAAA+O,GAAA,MAEAH,EAAAf,IAAA5N,EAAA6O,EAAA9O,EAAA+O,GAAA,OAcA,QAAAC,GAAAJ,GAGA,OAFAnP,GAAAmP,EAAAnP,KAEAqP,EAAA,EAAiBA,EAAArP,EAAA,EAAcqP,IAAA,CAC/B,GAAAzT,GAAAyT,EAAA,IACAF,GAAAf,IAAAiB,EAAA,EAAAzT,GAAA,GACAuT,EAAAf,IAAA,EAAAiB,EAAAzT,GAAA,IAYA,QAAA4T,GAAAL,EAAA5U,GAGA,OAFAoN,GAAA8H,EAAAhI,aAAAlN,GAEA+F,EAAA,EAAiBA,EAAAqH,EAAAzN,OAAgBoG,IAIjC,OAHAE,GAAAmH,EAAArH,GAAA,GACAC,EAAAoH,EAAArH,GAAA,GAEA+O,GAAA,EAAoBA,GAAA,EAAQA,IAC5B,OAAAC,IAAA,EAAsBA,GAAA,EAAQA,KAC9B,IAAAD,GAAA,IAAAA,IAAA,IAAAC,GAAA,IAAAA,GACA,IAAAD,GAAA,IAAAC,EACAH,EAAAf,IAAA5N,EAAA6O,EAAA9O,EAAA+O,GAAA,MAEAH,EAAAf,IAAA5N,EAAA6O,EAAA9O,EAAA+O,GAAA,MAaA,QAAAI,GAAAP,EAAA5U,GAKA,OAFAiG,GAAAD,EAAAoP,EAFA3P,EAAAmP,EAAAnP,KACA4P,EAAAC,EAAA5S,eAAA1C,GAGA+F,EAAA,EAAiBA,EAAA,GAAQA,IACzBE,EAAAhE,KAAAC,MAAA6D,EAAA,GACAC,EAAAD,EAAA,EAAAN,EAAA,IACA2P,EAAA,IAAAC,GAAAtP,EAAA,GAEA6O,EAAAf,IAAA5N,EAAAD,EAAAoP,GAAA,GACAR,EAAAf,IAAA7N,EAAAC,EAAAmP,GAAA,GAWA,QAAAG,GAAAX,EAAAhV,EAAA4V,GACA,GAEAzP,GAAAqP,EAFA3P,EAAAmP,EAAAnP,KACA4P,EAAAI,EAAA/S,eAAA9C,EAAA4V,EAGA,KAAAzP,EAAA,EAAaA,EAAA,GAAQA,IACrBqP,EAAA,IAAAC,GAAAtP,EAAA,GAGAA,EAAA,EACA6O,EAAAf,IAAA9N,EAAA,EAAAqP,GAAA,GACKrP,EAAA,EACL6O,EAAAf,IAAA9N,EAAA,IAAAqP,GAAA,GAEAR,EAAAf,IAAApO,EAAA,GAAAM,EAAA,EAAAqP,GAAA,GAIArP,EAAA,EACA6O,EAAAf,IAAA,EAAApO,EAAAM,EAAA,EAAAqP,GAAA,GACKrP,EAAA,EACL6O,EAAAf,IAAA,KAAA9N,EAAA,IAAAqP,GAAA,GAEAR,EAAAf,IAAA,KAAA9N,EAAA,EAAAqP,GAAA,EAKAR,GAAAf,IAAApO,EAAA,UASA,QAAAiQ,GAAAd,EAAArU,GAOA,OANAkF,GAAAmP,EAAAnP,KACAkQ,GAAA,EACA1P,EAAAR,EAAA,EACAmQ,EAAA,EACAC,EAAA,EAEA7P,EAAAP,EAAA,EAA0BO,EAAA,EAASA,GAAA,EAGnC,IAFA,IAAAA,SAEA,CACA,OAAA+O,GAAA,EAAqBA,EAAA,EAAOA,IAC5B,IAAAH,EAAAZ,WAAA/N,EAAAD,EAAA+O,GAAA,CACA,GAAAtO,IAAA,CAEAoP,GAAAtV,EAAAZ,SACA8G,EAAA,IAAAlG,EAAAsV,KAAAD,EAAA,IAGAhB,EAAAf,IAAA5N,EAAAD,EAAA+O,EAAAtO,GACAmP,KAEA,IAAAA,IACAC,IACAD,EAAA,GAOA,IAFA3P,GAAA0P,GAEA,GAAAlQ,GAAAQ,EAAA,CACAA,GAAA0P,EACAA,IACA,SAcA,QAAAG,GAAA9V,EAAAJ,EAAAQ,GAEA,GAAAqN,GAAA,GAAAD,EAEApN,GAAAE,QAAA,SAAAC,GAEAkN,EAAAI,IAAAtN,EAAAb,KAAAuO,IAAA,GASAR,EAAAI,IAAAtN,EAAAkC,YAAAxC,EAAAC,sBAAAK,EAAAb,KAAAM,IAGAO,EAAA+S,MAAA7F,IAIA,IAAA/L,GAAAd,EAAAe,wBAAA3B,GACA4B,EAAAf,EAAAgB,uBAAA7B,EAAAJ,GACAkC,EAAA,GAAAJ,EAAAE,EAgBA,KATA6L,EAAAO,kBAAA,GAAAlM,GACA2L,EAAAI,IAAA,KAQAJ,EAAAO,kBAAA,MACAP,EAAAM,OAAA,EAQA,QADAgI,IAAAjU,EAAA2L,EAAAO,mBAAA,EACAjI,EAAA,EAAiBA,EAAAgQ,EAAmBhQ,IACpC0H,EAAAI,IAAA9H,EAAA,WAGA,OAAAiQ,GAAAvI,EAAAzN,EAAAJ,GAYA,QAAAoW,GAAAzC,EAAAvT,EAAAJ,GAmCA,OAjCA8B,GAAAd,EAAAe,wBAAA3B,GAGA4B,EAAAf,EAAAgB,uBAAA7B,EAAAJ,GAGAqW,EAAAvU,EAAAE,EAGAsU,EAAArV,EAAAuT,eAAApU,EAAAJ,GAGAuW,EAAAzU,EAAAwU,EACAE,EAAAF,EAAAC,EAEAE,EAAApU,KAAAC,MAAAR,EAAAwU,GAEAI,EAAArU,KAAAC,MAAA+T,EAAAC,GACAK,EAAAD,EAAA,EAGAE,EAAAH,EAAAC,EAGAG,EAAA,GAAAC,GAAAF,GAEAG,EAAA,EACAC,EAAA,GAAAzI,OAAA+H,GACAW,EAAA,GAAA1I,OAAA+H,GACAY,EAAA,EACArJ,EAAA,GAAAqB,GAAAyE,EAAA9F,QAGAsJ,EAAA,EAAiBA,EAAAb,EAAmBa,IAAA,CACpC,GAAAC,GAAAD,EAAAX,EAAAE,EAAAC,CAGAK,GAAAG,GAAAtJ,EAAArK,MAAAuT,IAAAK,GAGAH,EAAAE,GAAAN,EAAAQ,OAAAL,EAAAG,IAEAJ,GAAAK,EACAF,EAAA7U,KAAAiV,IAAAJ,EAAAE,GAKA,GAEAjR,GAAA+O,EAFAvU,EAAA,GAAAuO,GAAApN,GACAkH,EAAA,CAIA,KAAA7C,EAAA,EAAaA,EAAA+Q,EAAiB/Q,IAC9B,IAAA+O,EAAA,EAAeA,EAAAoB,EAAmBpB,IAClC/O,EAAA6Q,EAAA9B,GAAAnV,SACAY,EAAAqI,KAAAgO,EAAA9B,GAAA/O,GAMA,KAAAA,EAAA,EAAaA,EAAAyQ,EAAazQ,IAC1B,IAAA+O,EAAA,EAAeA,EAAAoB,EAAmBpB,IAClCvU,EAAAqI,KAAAiO,EAAA/B,GAAA/O,EAIA,OAAAxF,GAYA,QAAA4W,GAAA5W,EAAAP,EAAAJ,EAAA4V,GACA,GAAApV,EAEA,IAAAW,EAAAR,GACAH,EAAAgX,EAAAC,UAAA9W,OACG,oBAAAA,GAeH,SAAAiB,OAAA,eAdA,IAAA8V,GAAAtX,CAEA,KAAAsX,EAAA,CACA,GAAAC,GAAAH,EAAAI,SAAAjX,EAGA+W,GAAAhC,EAAAjT,sBAAAkV,EACA3X,GAKAQ,EAAAgX,EAAAK,WAAAlX,EAAA+W,GAAA,IAMA,GAAAI,GAAApC,EAAAjT,sBAAAjC,EACAR,EAGA,KAAA8X,EACA,SAAAlW,OAAA,0DAIA,IAAAxB,GAIG,GAAAA,EAAA0X,EACH,SAAAlW,OAAA,wHAEAkW,EAAA,WANA1X,GAAA0X,CAUA,IAAAC,GAAA7B,EAAA9V,EAAAJ,EAAAQ,GAGAwX,EAAAhX,EAAA8L,cAAA1M,GACAqG,EAAA,GAAAqN,GAAAkE,EAgCA,OA7BAjD,GAAAtO,EAAArG,GACAgV,EAAA3O,GACA4O,EAAA5O,EAAArG,GAMAuV,EAAAlP,EAAAzG,EAAA,GAEAI,GAAA,GACAmV,EAAA9O,EAAArG,GAIA0V,EAAArP,EAAAsR,GAEAnC,IAEAA,EAAAqC,EAAAC,YAAAzR,EACAkP,EAAAlR,KAAA,KAAAgC,EAAAzG,KAIAiY,EAAAE,UAAAvC,EAAAnP,GAGAkP,EAAAlP,EAAAzG,EAAA4V,IAGAnP,UACArG,UACAJ,uBACA4V,cACApV,YAhdA,GAAA0O,GAAAtP,EAAA,QACAoB,EAAApB,EAAA,QACAsB,EAAAtB,EAAA,QACAgO,EAAAhO,EAAA,QACAkU,EAAAlU,EAAA,QACA0V,EAAA1V,EAAA,QACAqV,EAAArV,EAAA,QACAqY,EAAArY,EAAA,QACAqB,EAAArB,EAAA,QACAkX,EAAAlX,EAAA,QACA8V,EAAA9V,EAAA,QACAiW,EAAAjW,EAAA,QACAS,EAAAT,EAAA,QACA4X,EAAA5X,EAAA,QACAuB,EAAAvB,EAAA,OA+cAD,GAAAyE,OAAA,SAAAzD,EAAA4F,GACA,YAAA5F,GAAA,KAAAA,EACA,SAAAiB,OAAA,gBAGA,IACAxB,GACAgY,EAFApY,EAAAkB,EAAA0B,CAeA,YAXA,KAAA2D,IAEAvG,EAAAkB,EAAAM,KAAA+E,EAAAvG,qBAAAkB,EAAA0B,GACAxC,EAAAsV,EAAAlU,KAAA+E,EAAAnG,SACAgY,EAAAH,EAAAzW,KAAA+E,EAAAqP,aAEArP,EAAA8R,YACArX,EAAAsX,kBAAA/R,EAAA8R,aAIAd,EAAA5W,EAAAP,EAAAJ,EAAAoY,KjBimDMG,KACA,SAAU7Y,EAAQC,EAASC,GkBnlEjC,GAAAsP,GAAAtP,EAAA,QACA4Y,EAAA5Y,EAAA,OASAD,GAAA4P,IAAA,SAAAkJ,EAAAC,GACA,GAAAC,GAAA,GAAAzJ,GAAAuJ,EAAA1Y,OAAA2Y,EAAA3Y,OAAA,EACA4Y,GAAA5E,KAAA,EAEA,QAAA5N,GAAA,EAAiBA,EAAAsS,EAAA1Y,OAAeoG,IAChC,OAAAuH,GAAA,EAAmBA,EAAAgL,EAAA3Y,OAAe2N,IAClCiL,EAAAxS,EAAAuH,IAAA8K,EAAAjJ,IAAAkJ,EAAAtS,GAAAuS,EAAAhL,GAIA,OAAAiL,IAUAhZ,EAAA6V,IAAA,SAAAoD,EAAAC,GAGA,IAFA,GAAA5Q,GAAA,GAAAiH,GAAA0J,GAEA3Q,EAAAlI,OAAA8Y,EAAA9Y,QAAA,IAGA,OAFA4Y,GAAA1Q,EAAA,GAEA9B,EAAA,EAAmBA,EAAA0S,EAAA9Y,OAAoBoG,IACvC8B,EAAA9B,IAAAqS,EAAAjJ,IAAAsJ,EAAA1S,GAAAwS,EAKA,KADA,GAAA5B,GAAA,EACAA,EAAA9O,EAAAlI,QAAA,IAAAkI,EAAA8O,OACA9O,KAAAzE,MAAAuT,GAGA,MAAA9O,IAUAtI,EAAAmZ,qBAAA,SAAAC,GAEA,OADAC,GAAA,GAAA9J,IAAA,IACA/I,EAAA,EAAiBA,EAAA4S,EAAY5S,IAC7B6S,EAAArZ,EAAA4P,IAAAyJ,GAAA,EAAAR,EAAAlJ,IAAAnJ,IAGA,OAAA6S,KlB2lEMC,KACA,SAAUvZ,EAAQC,EAASC,GmB1pEjC,GAAAkN,GAAAlN,EAAA,QAAAkN,aAUAnN,GAAA2N,aAAA,SAAAlN,GACA,GAAAyF,GAAAiH,EAAA1M,EAEA,SAEA,MAEAyF,EAhBA,EAgBA,IAEA,EAAAA,EAlBA,MnBqrEMqT,OACA,SAAUxZ,EAAQC,EAASC,GAEjC,YoBlqEA,IAAAuZ,IACAC,6BAAA,SAAAC,EAAAC,EAAAvW,GAGA,GAAAwW,MAIAC,IACAA,GAAAF,GAAA,CAMA,IAAAG,GAAAN,EAAAO,cAAAC,MACAF,GAAArM,KAAAkM,EAAA,EAUA,KARA,GAAAM,GACAC,EAAAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEAV,EAAAW,SAAA,CAGAR,EAAAH,EAAAY,MACAR,EAAAD,EAAAnY,MACAsY,EAAAH,EAAAU,KAGAN,EAAAX,EAAAQ,MAKA,KAAAC,IAAAE,GACAA,EAAAO,eAAAT,KAEAG,EAAAD,EAAAF,GAKAI,EAAAH,EAAAE,EAMAE,EAAAX,EAAAM,QACA,KAAAN,EAAAM,IACAK,EAAAD,KACAV,EAAAM,GAAAI,EACAT,EAAArM,KAAA0M,EAAAI,GACAX,EAAAO,GAAAD,IAMA,YAAA9W,OAAA,KAAAyW,EAAAzW,GAAA,CACA,GAAAyX,IAAA,8BAAAlB,EAAA,OAAAvW,EAAA,KAAA0X,KAAA,GACA,UAAA7Y,OAAA4Y,GAGA,MAAAjB,IAGAmB,4CAAA,SAAAnB,EAAAxW,GAIA,IAHA,GAAA4X,MACAd,EAAA9W,EAEA8W,GACAc,EAAAvN,KAAAyM,GACAN,EAAAM,GACAA,EAAAN,EAAAM,EAGA,OADAc,GAAAtN,UACAsN,GAGAC,UAAA,SAAAvB,EAAAC,EAAAvW,GACA,GAAAwW,GAAAJ,EAAAC,6BAAAC,EAAAC,EAAAvW,EACA,OAAAoW,GAAAuB,4CACAnB,EAAAxW,IAMA2W,eACAC,KAAA,SAAAtW,GACA,GAEAuO,GAFAiJ,EAAA1B,EAAAO,cACAoB,IAEAzX,QACA,KAAAuO,IAAAiJ,GACAA,EAAAN,eAAA3I,KACAkJ,EAAAlJ,GAAAiJ,EAAAjJ,GAKA,OAFAkJ,GAAAC,SACAD,EAAAE,OAAA3X,EAAA2X,QAAAH,EAAAI,eACAH,GAGAG,eAAA,SAAA7V,EAAA+R,GACA,MAAA/R,GAAAkV,KAAAnD,EAAAmD,MAOAlN,KAAA,SAAA3L,EAAA6Y,GACA,GAAAtP,IAAkBvJ,QAAA6Y,OAClB3S,MAAAoT,MAAA3N,KAAApC,GACArD,KAAAoT,MAAAG,KAAAvT,KAAAqT,SAMAX,IAAA,WACA,MAAA1S,MAAAoT,MAAAI,SAGAf,MAAA,WACA,WAAAzS,KAAAoT,MAAAhb,SAQAL,GAAAC,QAAAwZ,GpBgsEMiC,KACA,SAAU1b,EAAQwH,EAAqBtH,GAE7C,YqBp2EO,SAASyb,GAAUtM,GACxB,MAAOnP,GAAAuG,EAAAyI,EAAA,IACLnE,IAAK,yBACLoE,OAAQ,MACRE,WAKG,QAASuM,GAASvM,GACvB,MAAOnP,GAAAuG,EAAAyI,EAAA,IACLnE,IAAK,0BACLoE,OAAQ,OACRlO,KAAMoO,IAIH,QAASwM,GAAUnT,GACxB,MAAOxI,GAAAuG,EAAAyI,EAAA,IACLnE,IAAK,mCAAqCrC,EAC1CyG,OAAQ,QAIL,QAAS2M,GAAUC,GACxB,MAAO7b,GAAAuG,EAAAyI,EAAA,IACLnE,IAAK,0BACLoE,OAAQ,MACRlO,KAAM8a,IAIH,QAASC,GAASD,GACvB,MAAO7b,GAAAuG,EAAAyI,EAAA,IACLnE,IAAK,6BACLoE,OAAQ,MACRlO,KAAM8a,IAKH,QAASE,GAASvT,GACvB,MAAOxI,GAAAuG,EAAAyI,EAAA,IACLnE,IAAK,mCAAqCrC,EAC1CyG,OAAQ,WrByzEqB3H,EAAuB,EAAImU,EAC3BnU,EAAuB,EAAIoU,EAC3BpU,EAAuB,EAAIqU,EAC3BrU,EAAuB,EAAIsU,EAC3BtU,EAAuB,EAAIwU,EAC3BxU,EAAuB,EAAIyU,CACvC,IAAI/M,GAA6ChP,EAAoB,SAqDpFgc,KACA,SAAUlc,EAAQwH,EAAqBtH,GAE7C,YACAic,QAAOC,eAAe5U,EAAqB,cAAgBzF,OAAO,GAC7C,IAAIsa,GAAiHnc,EAAoB,QsBv6E9Joc,EAAApc,EAAA,QAAAqc,EAAArc,EAAA,QAWAsc,EAAAD,EACAF,EAAA,EACAC,EAAA,EAPA,KAEA,KAEA,KASA9U,GAAA,QAAAgV,EAAA,StB86EMC,OACA,SAAUzc,EAAQC,EAASC,GAEjC,YuBx6EA,SAAAsP,GAAAkN,EAAArF,EAAAhX,GACA,MAAAmP,GAAAmN,qBAAA1U,eAAAuH,GAIA,gBAAAkN,GACAE,EAAA3U,KAAAyU,GAGA5a,EAAAmG,KAAAyU,EAAArF,EAAAhX,GAPA,GAAAmP,GAAAkN,EAAArF,EAAAhX,GA0BA,QAAAwc,GAAAxc,GAGA,GAAAA,GAAAyc,EACA,SAAAC,YAAA,0DACAD,EAAA3X,SAAA,aAEA,UAAA9E,EAGA,QAAA2c,GAAAC,GACA,MAAAA,OAGA,QAAAC,GAAAC,EAAA9c,GACA,GAAA+c,EAaA,OAZA5N,GAAAmN,qBACAS,EAAA,GAAAC,YAAAhd,GACA+c,EAAAE,UAAA9N,EAAApB,YAGAgP,EAAAD,EACA,OAAAC,IACAA,EAAA,GAAA5N,GAAAnP,IAEA+c,EAAA/c,UAGA+c,EAGA,QAAAR,GAAAO,EAAAhX,GACA,GAAAiX,GAAAF,EAAAC,EAAAhX,EAAA,MAAA0W,EAAA1W,GAEA,KAAAqJ,EAAAmN,oBACA,OAAAlW,GAAA,EAAmBA,EAAAN,IAAUM,EAC7B2W,EAAA3W,GAAA,CAIA,OAAA2W,GAGA,QAAAjF,GAAAgF,EAAAI,GACA,GAAAld,GAAA,EAAAmd,EAAAD,GACAH,EAAAF,EAAAC,EAAA9c,GAEAod,EAAAL,EAAApJ,MAAAuJ,EASA,OAPAE,KAAApd,IAIA+c,IAAAtZ,MAAA,EAAA2Z,IAGAL,EAGA,QAAAM,GAAAP,EAAAQ,GAGA,OAFAtd,GAAAsd,EAAAtd,OAAA,MAAAwc,EAAAc,EAAAtd,QACA+c,EAAAF,EAAAC,EAAA9c,GACAoG,EAAA,EAAiBA,EAAApG,EAAYoG,GAAA,EAC7B2W,EAAA3W,GAAA,IAAAkX,EAAAlX,EAEA,OAAA2W,GAGA,QAAAQ,GAAAT,EAAAQ,EAAAE,EAAAxd,GACA,GAAAwd,EAAA,GAAAF,EAAAH,WAAAK,EACA,SAAAd,YAAA,4BAGA,IAAAY,EAAAH,WAAAK,GAAAxd,GAAA,GACA,SAAA0c,YAAA,4BAGA,IAAAK,EAiBA,OAfAA,OADAhZ,KAAAyZ,OAAAzZ,KAAA/D,EACA,GAAAgd,YAAAM,OACGvZ,KAAA/D,EACH,GAAAgd,YAAAM,EAAAE,GAEA,GAAAR,YAAAM,EAAAE,EAAAxd,GAGAmP,EAAAmN,oBAEAS,EAAAE,UAAA9N,EAAApB,UAGAgP,EAAAM,EAAAP,EAAAC,GAGAA,EAGA,QAAAU,GAAAX,EAAAY,GACA,GAAAvO,EAAAwO,SAAAD,GAAA,CACA,GAAAE,GAAA,EAAApB,EAAAkB,EAAA1d,QACA+c,EAAAF,EAAAC,EAAAc,EAEA,YAAAb,EAAA/c,OACA+c,GAGAW,EAAAG,KAAAd,EAAA,IAAAa,GACAb,GAGA,GAAAW,EAAA,CACA,sBAAAI,cACAJ,EAAA5P,iBAAAgQ,cAAA,UAAAJ,GACA,sBAAAA,GAAA1d,QAAA2c,EAAAe,EAAA1d,QACA6c,EAAAC,EAAA,GAEAO,EAAAP,EAAAY,EAGA,eAAAA,EAAArS,MAAAmD,MAAApN,QAAAsc,EAAA9c,MACA,MAAAyc,GAAAP,EAAAY,EAAA9c,MAIA,SAAAmd,WAAA,sFAGA,QAAAC,GAAAd,EAAAe,GACAA,KAAAC,GAMA,QALAC,GACAne,EAAAkd,EAAAld,OACAoe,EAAA,KACAC,KAEAjY,EAAA,EAAiBA,EAAApG,IAAYoG,EAAA,CAI7B,IAHA+X,EAAAjB,EAAAoB,WAAAlY,IAGA,OAAA+X,EAAA,OAEA,IAAAC,EAAA,CAEA,GAAAD,EAAA,QAEAF,GAAA,OAAAI,EAAAhR,KAAA,YACA,UACS,GAAAjH,EAAA,IAAApG,EAAA,EAETie,GAAA,OAAAI,EAAAhR,KAAA,YACA,UAIA+Q,EAAAD,CAEA,UAIA,GAAAA,EAAA,QACAF,GAAA,OAAAI,EAAAhR,KAAA,aACA+Q,EAAAD,CACA,UAIAA,EAAA,OAAAC,EAAA,UAAAD,EAAA,WACKC,KAELH,GAAA,OAAAI,EAAAhR,KAAA,YAMA,IAHA+Q,EAAA,KAGAD,EAAA,KACA,IAAAF,GAAA,UACAI,GAAAhR,KAAA8Q,OACK,IAAAA,EAAA,MACL,IAAAF,GAAA,UACAI,GAAAhR,KACA8Q,GAAA,MACA,GAAAA,EAAA,SAEK,IAAAA,EAAA,OACL,IAAAF,GAAA,UACAI,GAAAhR,KACA8Q,GAAA,OACAA,GAAA,SACA,GAAAA,EAAA,SAEK,MAAAA,EAAA,SASL,SAAAtc,OAAA,qBARA,KAAAoc,GAAA,UACAI,GAAAhR,KACA8Q,GAAA,OACAA,GAAA,UACAA,GAAA,SACA,GAAAA,EAAA,MAOA,MAAAE,GAGA,QAAAlB,GAAAD,GACA,MAAA/N,GAAAwO,SAAAT,GACAA,EAAAld,OAEA,mBAAA8d,cAAA,kBAAAA,aAAAS,SACAT,YAAAS,OAAArB,gBAAAY,cACAZ,EAAAC,YAEA,gBAAAD,KACAA,EAAA,GAAAA,GAIA,IADAA,EAAAld,OACA,EAEAge,EAAAd,GAAAld,QAGA,QAAAwe,GAAArL,EAAAsL,EAAAzH,EAAAhX,GACA,OAAAoG,GAAA,EAAiBA,EAAApG,KACjBoG,EAAA4Q,GAAAyH,EAAAze,QAAAoG,GAAA+M,EAAAnT,UAD6BoG,EAE7BqY,EAAArY,EAAA4Q,GAAA7D,EAAA/M,EAEA,OAAAA,GAGA,QAAAsY,GAAA3B,EAAAG,EAAAlG,EAAAhX,GACA,MAAAwe,GAAAR,EAAAd,EAAAH,EAAA/c,OAAAgX,GAAA+F,EAAA/F,EAAAhX,GAGA,QAAAyB,GAAAqb,EAAApb,EAAAsV,EAAAhX,GACA,mBAAA0B,GACA,SAAAqc,WAAA,wCAGA,0BAAAD,cAAApc,YAAAoc,aACAP,EAAAT,EAAApb,EAAAsV,EAAAhX,GAGA,gBAAA0B,GACAoW,EAAAgF,EAAApb,EAAAsV,GAGAyG,EAAAX,EAAApb,GAzSA,GAAAN,GAAAvB,EAAA,OAaAsP,GAAAmN,oBAXA,WAEA,IACA,GAAA7N,GAAA,GAAAuO,YAAA,EAEA,OADAvO,GAAAwO,WAAqBA,UAAAD,WAAAjP,UAAA4Q,IAAA,WAAmD,YACxE,KAAAlQ,EAAAkQ,MACG,MAAAra,GACH,YAMA,IAAAmY,GAAAtN,EAAAmN,oBACA,WACA,UAcAnN,GAAAmN,sBACAnN,EAAApB,UAAAkP,UAAAD,WAAAjP,UACAoB,EAAA8N,UAAAD,WAGA,mBAAA4B,gBAAAC,SACA1P,EAAAyP,OAAAC,WAAA1P,GACA2M,OAAAC,eAAA5M,EAAAyP,OAAAC,SACAnd,MAAA,KACAod,cAAA,EACAC,YAAA,EACAC,UAAA,KAkQA7P,EAAApB,UAAA4F,MAAA,SAAAuJ,EAAAlG,EAAAhX,OAEA+D,KAAAiT,GACAhX,EAAA4H,KAAA5H,OACAgX,EAAA,OAEGjT,KAAA/D,GAAA,gBAAAgX,IACHhX,EAAA4H,KAAA5H,OACAgX,EAAA,GAEGiI,SAAAjI,KACHA,GAAA,EACAiI,SAAAjf,GACAA,GAAA,EAEAA,MAAA+D,GAIA,IAAAmb,GAAAtX,KAAA5H,OAAAgX,CAGA,SAFAjT,KAAA/D,KAAAkf,KAAAlf,EAAAkf,GAEAhC,EAAAld,OAAA,IAAAA,EAAA,GAAAgX,EAAA,IAAAA,EAAApP,KAAA5H,OACA,SAAA0c,YAAA,yCAGA,OAAAgC,GAAA9W,KAAAsV,EAAAlG,EAAAhX,IAGAmP,EAAApB,UAAAtK,MAAA,SAAA0b,EAAAC,GACA,GAAAxB,GAAAhW,KAAA5H,MACAmf,OACAC,MAAArb,KAAAqb,EAAAxB,IAAAwB,EAEAD,EAAA,GACAA,GAAAvB,GACA,IAAAuB,EAAA,GACGA,EAAAvB,IACHuB,EAAAvB,GAGAwB,EAAA,GACAA,GAAAxB,GACA,IAAAwB,EAAA,GACGA,EAAAxB,IACHwB,EAAAxB,GAGAwB,EAAAD,IAAAC,EAAAD,EAEA,IAAAE,EACA,IAAAlQ,EAAAmN,oBACA+C,EAAAzX,KAAA0X,SAAAH,EAAAC,GAEAC,EAAApC,UAAA9N,EAAApB,cACG,CACH,GAAAwR,GAAAH,EAAAD,CACAE,GAAA,GAAAlQ,GAAAoQ,MAAAxb,GACA,QAAAqC,GAAA,EAAmBA,EAAAmZ,IAAcnZ,EACjCiZ,EAAAjZ,GAAAwB,KAAAxB,EAAA+Y,GAIA,MAAAE,IAGAlQ,EAAApB,UAAA8P,KAAA,SAAA2B,EAAAC,EAAAN,EAAAC,GAQA,GAPAD,MAAA,GACAC,GAAA,IAAAA,MAAAxX,KAAA5H,QACAyf,GAAAD,EAAAxf,SAAAyf,EAAAD,EAAAxf,QACAyf,MAAA,GACAL,EAAA,GAAAA,EAAAD,IAAAC,EAAAD,GAGAC,IAAAD,EAAA,QACA,QAAAK,EAAAxf,QAAA,IAAA4H,KAAA5H,OAAA,QAGA,IAAAyf,EAAA,EACA,SAAA/C,YAAA,4BAEA,IAAAyC,EAAA,GAAAA,GAAAvX,KAAA5H,OAAA,SAAA0c,YAAA,4BACA,IAAA0C,EAAA,WAAA1C,YAAA,0BAGA0C,GAAAxX,KAAA5H,SAAAof,EAAAxX,KAAA5H,QACAwf,EAAAxf,OAAAyf,EAAAL,EAAAD,IACAC,EAAAI,EAAAxf,OAAAyf,EAAAN,EAGA,IACA/Y,GADAwX,EAAAwB,EAAAD,CAGA,IAAAvX,OAAA4X,GAAAL,EAAAM,KAAAL,EAEA,IAAAhZ,EAAAwX,EAAA,EAAqBxX,GAAA,IAAQA,EAC7BoZ,EAAApZ,EAAAqZ,GAAA7X,KAAAxB,EAAA+Y,OAEG,IAAAvB,EAAA,MAAAzO,EAAAmN,oBAEH,IAAAlW,EAAA,EAAeA,EAAAwX,IAASxX,EACxBoZ,EAAApZ,EAAAqZ,GAAA7X,KAAAxB,EAAA+Y,OAGAnC,YAAAjP,UAAAmG,IAAAxQ,KACA8b,EACA5X,KAAA0X,SAAAH,IAAAvB,GACA6B,EAIA,OAAA7B,IAGAzO,EAAApB,UAAAiG,KAAA,SAAA4I,EAAAuC,EAAAC,GAEA,mBAAAxC,IAOA,GANA,gBAAAuC,IACAA,EAAA,EACAC,EAAAxX,KAAA5H,QACK,gBAAAof,KACLA,EAAAxX,KAAA5H,QAEA,IAAA4c,EAAA5c,OAAA,CACA,GAAA0f,GAAA9C,EAAA0B,WAAA,EACAoB,GAAA,MACA9C,EAAA8C,QAGG,gBAAA9C,KACHA,GAAA,IAIA,IAAAuC,EAAA,GAAAvX,KAAA5H,OAAAmf,GAAAvX,KAAA5H,OAAAof,EACA,SAAA1C,YAAA,qBAGA,IAAA0C,GAAAD,EACA,MAAAvX,KAGAuX,MAAA,EACAC,MAAArb,KAAAqb,EAAAxX,KAAA5H,OAAAof,IAAA,EAEAxC,MAAA,EAEA,IAAAxW,EACA,oBAAAwW,GACA,IAAAxW,EAAA+Y,EAAmB/Y,EAAAgZ,IAAShZ,EAC5BwB,KAAAxB,GAAAwW,MAEG,CACH,GAAAyB,GAAAlP,EAAAwO,SAAAf,GACAA,EACA,GAAAzN,GAAAyN,GACAgB,EAAAS,EAAAre,MACA,KAAAoG,EAAA,EAAeA,EAAAgZ,EAAAD,IAAiB/Y,EAChCwB,KAAAxB,EAAA+Y,GAAAd,EAAAjY,EAAAwX,GAIA,MAAAhW,OAGAuH,EAAAwQ,OAAA,SAAA3V,EAAAhK,GACA,IAAAoB,EAAA4I,GACA,SAAA+T,WAAA,8CAGA,QAAA/T,EAAAhK,OACA,MAAA6c,GAAA,OAGA,IAAAzW,EACA,QAAArC,KAAA/D,EAEA,IADAA,EAAA,EACAoG,EAAA,EAAeA,EAAA4D,EAAAhK,SAAiBoG,EAChCpG,GAAAgK,EAAA5D,GAAApG,MAIA,IAAA8N,GAAAyO,EAAA,KAAAvc,GACAyN,EAAA,CACA,KAAArH,EAAA,EAAaA,EAAA4D,EAAAhK,SAAiBoG,EAAA,CAC9B,GAAA2W,GAAA/S,EAAA5D,EACA,KAAA+I,EAAAwO,SAAAZ,GACA,SAAAgB,WAAA,8CAEAhB,GAAAc,KAAA/P,EAAAL,GACAA,GAAAsP,EAAA/c,OAEA,MAAA8N,IAGAqB,EAAAgO,aAEAhO,EAAApB,UAAA6R,WAAA,EACAzQ,EAAAwO,SAAA,SAAAvG,GACA,cAAAA,MAAAwI,YAGAjgB,EAAAC,QAAAuP,GvB08EM0Q,KACA,SAAUlgB,EAAQC,GwBjyFxB,QAAAkgB,GAAAjK,EAAAzP,EAAAuH,GACA,OAAAkI,GACA,IAAAjW,GAAAmgB,SAAAC,WAAA,OAAA5Z,EAAAuH,GAAA,IACA,KAAA/N,GAAAmgB,SAAAE,WAAA,MAAA7Z,GAAA,IACA,KAAAxG,GAAAmgB,SAAAG,WAAA,MAAAvS,GAAA,IACA,KAAA/N,GAAAmgB,SAAAI,WAAA,OAAA/Z,EAAAuH,GAAA,IACA,KAAA/N,GAAAmgB,SAAAK,WAAA,OAAA9d,KAAAC,MAAA6D,EAAA,GAAA9D,KAAAC,MAAAoL,EAAA,QACA,KAAA/N,GAAAmgB,SAAAM,WAAA,MAAAja,GAAAuH,EAAA,EAAAvH,EAAAuH,EAAA,IACA,KAAA/N,GAAAmgB,SAAAO,WAAA,OAAAla,EAAAuH,EAAA,EAAAvH,EAAAuH,EAAA,OACA,KAAA/N,GAAAmgB,SAAAQ,WAAA,OAAAna,EAAAuH,EAAA,GAAAvH,EAAAuH,GAAA,OAEA,kBAAA9L,OAAA,mBAAAgU,IAhLAjW,EAAAmgB,UACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EAOA,IAAAC,IACAC,GAAA,EACAC,GAAA,EACAC,GAAA,GACAC,GAAA,GASAhhB,GAAA2B,QAAA,SAAA8W,GACA,MAAAA,IAAA,KAAAA,IAAA7W,MAAA6W,OAAA,GAAAA,GAAA,GAUAzY,EAAA6B,KAAA,SAAAC,GACA,MAAA9B,GAAA2B,QAAAG,GAAAE,SAAAF,EAAA,QAAAqC,IAUAnE,EAAAihB,aAAA,SAAAjgB,GAQA,OAPAkF,GAAAlF,EAAAkF,KACAgb,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,KACAC,EAAA,KAEA5a,EAAA,EAAmBA,EAAAR,EAAYQ,IAAA,CAC/Bya,EAAAC,EAAA,EACAC,EAAAC,EAAA,IAEA,QAAA7a,GAAA,EAAqBA,EAAAP,EAAYO,IAAA,CACjC,GAAA1G,GAAAiB,EAAAoN,IAAA1H,EAAAD,EACA1G,KAAAshB,EACAF,KAEAA,GAAA,IAAAD,GAAAN,EAAAC,IAAAM,EAAA,IACAE,EAAAthB,EACAohB,EAAA,GAGAphB,EAAAiB,EAAAoN,IAAA3H,EAAAC,GACA3G,IAAAuhB,EACAF,KAEAA,GAAA,IAAAF,GAAAN,EAAAC,IAAAO,EAAA,IACAE,EAAAvhB,EACAqhB,EAAA,GAIAD,GAAA,IAAAD,GAAAN,EAAAC,IAAAM,EAAA,IACAC,GAAA,IAAAF,GAAAN,EAAAC,IAAAO,EAAA,IAGA,MAAAF,IAQAlhB,EAAAuhB,aAAA,SAAAvgB,GAIA,OAHAkF,GAAAlF,EAAAkF,KACAgb,EAAA,EAEAxa,EAAA,EAAmBA,EAAAR,EAAA,EAAgBQ,IACnC,OAAAD,GAAA,EAAqBA,EAAAP,EAAA,EAAgBO,IAAA,CACrC,GAAA+a,GAAAxgB,EAAAoN,IAAA1H,EAAAD,GACAzF,EAAAoN,IAAA1H,EAAAD,EAAA,GACAzF,EAAAoN,IAAA1H,EAAA,EAAAD,GACAzF,EAAAoN,IAAA1H,EAAA,EAAAD,EAAA,EAEA,KAAA+a,GAAA,IAAAA,GAAAN,IAIA,MAAAA,GAAAN,EAAAE,IASA9gB,EAAAyhB,aAAA,SAAAzgB,GAMA,OALAkF,GAAAlF,EAAAkF,KACAgb,EAAA,EACAQ,EAAA,EACAC,EAAA,EAEAjb,EAAA,EAAmBA,EAAAR,EAAYQ,IAAA,CAC/Bgb,EAAAC,EAAA,CACA,QAAAlb,GAAA,EAAqBA,EAAAP,EAAYO,IACjCib,KAAA,OAAA1gB,EAAAoN,IAAA1H,EAAAD,GACAA,GAAA,YAAAib,GAAA,KAAAA,IAAAR,IAEAS,KAAA,OAAA3gB,EAAAoN,IAAA3H,EAAAC,GACAD,GAAA,YAAAkb,GAAA,KAAAA,IAAAT,IAIA,MAAAA,GAAAN,EAAAG,IAWA/gB,EAAA4hB,aAAA,SAAA5gB,GAIA,OAHA6gB,GAAA,EACAC,EAAA9gB,OAAAZ,OAEAoG,EAAA,EAAiBA,EAAAsb,EAAkBtb,IAAAqb,GAAA7gB,OAAAwF,EAInC,OAFA9D,MAAAqf,IAAArf,KAAA6K,KAAA,IAAAsU,EAAAC,EAAA,OAEAlB,EAAAI,IAgCAhhB,EAAAwY,UAAA,SAAA9N,EAAA1J,GAGA,OAFAkF,GAAAlF,EAAAkF,KAEAO,EAAA,EAAmBA,EAAAP,EAAYO,IAC/B,OAAAC,GAAA,EAAqBA,EAAAR,EAAYQ,IACjC1F,EAAAyT,WAAA/N,EAAAD,IACAzF,EAAAwT,IAAA9N,EAAAD,EAAAyZ,EAAAxV,EAAAhE,EAAAD,KAWAzG,EAAAuY,YAAA,SAAAvX,EAAAghB,GAKA,OAJAC,GAAA/F,OAAAgG,KAAAliB,EAAAmgB,UAAA/f,OACA+hB,EAAA,EACAC,EAAA9D,IAEA+D,EAAA,EAAiBA,EAAAJ,EAAiBI,IAAA,CAClCL,EAAAK,GACAriB,EAAAwY,UAAA6J,EAAArhB,EAGA,IAAAshB,GACAtiB,EAAAihB,aAAAjgB,GACAhB,EAAAuhB,aAAAvgB,GACAhB,EAAAyhB,aAAAzgB,GACAhB,EAAA4hB,aAAA5gB,EAGAhB,GAAAwY,UAAA6J,EAAArhB,GAEAshB,EAAAF,IACAA,EAAAE,EACAH,EAAAE,GAIA,MAAAF,KxBk9FMI,KACA,SAAUxiB,EAAQC,EAASC,GAEjC,cAC4B,SAASuiB,GyB7rGrCziB,EAAAC,QAAA,gBAAAyiB,+BACA,gBAAAD,qBACAxa,OzBgsG6BlE,KAAK9D,EAASC,EAAoB,UAIzDyiB,KACA,SAAU3iB,EAAQC,EAASC,GAEjC,Y0BxsGA,IAAA0iB,GAAA1iB,EAAA,OAEAF,GAAAC,QAAA,WACA,MACA,kBAAA2iB,GAAAte,SACA,kBAAAse,GAAAte,QAAA8J,UAAAhG,O1BktGMya,KACA,SAAU7iB,EAAQC,G2B1tGxB,QAAA6iB,GAAAld,GACA,mBAAAA,GACA,SAAA1D,OAAA,wCAGA,IAAA6gB,GAAAnd,EAAA9B,QAAAkM,QAAA,QAAAgT,MAAA,GACA,IAAAD,EAAA1iB,OAAA,OAAA0iB,EAAA1iB,QAAA0iB,EAAA1iB,OAAA,EACA,SAAA6B,OAAA,sBAAA0D,EAIA,KAAAmd,EAAA1iB,QAAA,IAAA0iB,EAAA1iB,SACA0iB,EAAAlU,MAAAT,UAAA4R,OAAAiD,SAAAF,EAAAG,IAAA,SAAAzN,GACA,OAAAA,SAKA,IAAAsN,EAAA1iB,QAAA0iB,EAAArV,KAAA,QAEA,IAAAyV,GAAAlhB,SAAA8gB,EAAAhI,KAAA,OAEA,QACAvF,EAAA2N,GAAA,OACAC,EAAAD,GAAA,OACA1L,EAAA0L,GAAA,MACAzd,EAAA,IAAAyd,EACAvd,IAAA,IAAAmd,EAAAjf,MAAA,KAAAiX,KAAA,KAIA9a,EAAA6G,WAAA,SAAAD,GACAA,UACAA,EAAAtB,QAAAsB,EAAAtB,SAEA,IAAAa,OAAA,KAAAS,EAAAT,QACA,OAAAS,EAAAT,QACAS,EAAAT,OAAA,IAAAS,EAAAT,OAEAiB,EAAAR,EAAAQ,OAAAR,EAAAQ,OAAA,GAAAR,EAAAQ,UAAAjD,GACAif,EAAAxc,EAAAwc,OAAA,CAEA,QACAhc,QACAgc,MAAAhc,EAAA,EAAAgc,EACAjd,SACAb,OACA4B,KAAA2b,EAAAjc,EAAAtB,MAAA4B,MAAA,aACAD,MAAA4b,EAAAjc,EAAAtB,MAAA2B,OAAA,cAEAwE,KAAA7E,EAAA6E,KACAuB,aAAApG,EAAAoG,mBAIAhN,EAAAqjB,SAAA,SAAAC,EAAA5f,GACA,MAAAA,GAAA0D,OAAA1D,EAAA0D,OAAAkc,EAAA,EAAA5f,EAAAyC,OACAzC,EAAA0D,OAAAkc,EAAA,EAAA5f,EAAAyC,QACAzC,EAAA0f,OAGApjB,EAAA2M,cAAA,SAAA2W,EAAA5f,GACA,GAAA0f,GAAApjB,EAAAqjB,SAAAC,EAAA5f,EACA,OAAAhB,MAAAC,OAAA2gB,EAAA,EAAA5f,EAAAyC,QAAAid,IAGApjB,EAAA8M,cAAA,SAAAyW,EAAAC,EAAA9f,GAQA,OAPAwC,GAAAsd,EAAA1c,QAAAZ,KACAlF,EAAAwiB,EAAA1c,QAAA9F,KACAoiB,EAAApjB,EAAAqjB,SAAAnd,EAAAxC,GACA+f,EAAA/gB,KAAAC,OAAAuD,EAAA,EAAAxC,EAAAyC,QAAAid,GACAM,EAAAhgB,EAAAyC,OAAAid,EACAO,GAAAjgB,EAAA4B,MAAA2B,MAAAvD,EAAA4B,MAAA4B,MAEAV,EAAA,EAAiBA,EAAAid,EAAgBjd,IACjC,OAAAuH,GAAA,EAAmBA,EAAA0V,EAAgB1V,IAAA,CACnC,GAAA6V,GAAA,GAAApd,EAAAid,EAAA1V,GACA8V,EAAAngB,EAAA4B,MAAA2B,KAEA,IAAAT,GAAAkd,GAAA3V,GAAA2V,GACAld,EAAAid,EAAAC,GAAA3V,EAAA0V,EAAAC,EAAA,CACA,GAAAI,GAAAphB,KAAAC,OAAA6D,EAAAkd,GAAAN,GACAW,EAAArhB,KAAAC,OAAAoL,EAAA2V,GAAAN,EACAS,GAAAF,EAAA3iB,EAAA8iB,EAAA5d,EAAA6d,GAAA,KAGAR,EAAAK,KAAAC,EAAAtO,EACAgO,EAAAK,KAAAC,EAAAV,EACAI,EAAAK,KAAAC,EAAArM,EACA+L,EAAAK,GAAAC,EAAApe,K3BouGMue,KACA,SAAUjkB,EAAQC,EAASC,G4B/yGjC,QAAAgkB,GAAAve,GACA,MAAAwe,UAAAC,mBAAAze,IAAAtF,OAWA,QAAAgkB,GAAAC,EAAAlkB,EAAAuF,GAIA,IAHA,GACA4C,GADAzH,KAGA,QAAAyH,EAAA+b,EAAAC,KAAA5e,KACA7E,EAAA4M,MACAzM,KAAAsH,EAAA,GACAe,MAAAf,EAAAe,MACAlJ,OACAC,OAAAkI,EAAA,GAAAlI,QAIA,OAAAS,GAUA,QAAA0jB,GAAAC,GACA,GAEAC,GACAC,EAHAC,EAAAP,EAAAQ,EAAAniB,QAAA/B,EAAA+B,QAAA+hB,GACAK,EAAAT,EAAAQ,EAAAhiB,aAAAlC,EAAAkC,aAAA4hB,EAcA,OAVAnjB,GAAAyjB,sBACAL,EAAAL,EAAAQ,EAAA1iB,KAAAxB,EAAAwB,KAAAsiB,GACAE,EAAAN,EAAAQ,EAAA/hB,MAAAnC,EAAAmC,MAAA2hB,KAEAC,EAAAL,EAAAQ,EAAA1U,WAAAxP,EAAAwB,KAAAsiB,GACAE,MAGAC,EAAA5E,OAAA8E,EAAAJ,EAAAC,GAGAnJ,KAAA,SAAAwJ,EAAAC,GACA,MAAAD,GAAA1b,MAAA2b,EAAA3b,QAEA4Z,IAAA,SAAAnF,GACA,OACA9c,KAAA8c,EAAA9c,KACAb,KAAA2d,EAAA3d,KACAC,OAAA0d,EAAA1d,UAaA,QAAA6kB,GAAA7kB,EAAAD,GACA,OAAAA,GACA,IAAAO,GAAA+B,QACA,MAAAyiB,GAAAhkB,cAAAd,EACA,KAAAM,GAAAkC,aACA,MAAAiR,GAAA3S,cAAAd,EACA,KAAAM,GAAAmC,MACA,MAAAsiB,GAAAjkB,cAAAd,EACA,KAAAM,GAAAwB,KACA,MAAAkjB,GAAAlkB,cAAAd,IAUA,QAAAilB,GAAAC,GACA,MAAAA,GAAAC,OAAA,SAAAC,EAAAC,GACA,GAAAC,GAAAF,EAAAplB,OAAA,KAAAolB,IAAAplB,OAAA,OACA,OAAAslB,MAAAvlB,OAAAslB,EAAAtlB,MACAqlB,IAAAplB,OAAA,GAAAY,MAAAykB,EAAAzkB,KACAwkB,IAGAA,EAAA/X,KAAAgY,GACAD,QAoBA,QAAAG,GAAAL,GAEA,OADAtK,MACAxU,EAAA,EAAiBA,EAAA8e,EAAAllB,OAAiBoG,IAAA,CAClC,GAAAzD,GAAAuiB,EAAA9e,EAEA,QAAAzD,EAAA5C,MACA,IAAAO,GAAA+B,QACAuY,EAAAvN,MAAA1K,GACW/B,KAAA+B,EAAA/B,KAAAb,KAAAO,EAAAkC,aAAAxC,OAAA2C,EAAA3C,SACAY,KAAA+B,EAAA/B,KAAAb,KAAAO,EAAAwB,KAAA9B,OAAA2C,EAAA3C,SAEX,MACA,KAAAM,GAAAkC,aACAoY,EAAAvN,MAAA1K,GACW/B,KAAA+B,EAAA/B,KAAAb,KAAAO,EAAAwB,KAAA9B,OAAA2C,EAAA3C,SAEX,MACA,KAAAM,GAAAmC,MACAmY,EAAAvN,MAAA1K,GACW/B,KAAA+B,EAAA/B,KAAAb,KAAAO,EAAAwB,KAAA9B,OAAA6jB,EAAAlhB,EAAA/B,QAEX,MACA,KAAAN,GAAAwB,KACA8Y,EAAAvN,OACWzM,KAAA+B,EAAA/B,KAAAb,KAAAO,EAAAwB,KAAA9B,OAAA6jB,EAAAlhB,EAAA/B,UAKX,MAAAga,GAeA,QAAA4K,GAAA5K,EAAAva,GAKA,OAJAolB,MACAnM,GAAe6F,UACfuG,GAAA,SAEAtf,EAAA,EAAiBA,EAAAwU,EAAA5a,OAAkBoG,IAAA,CAInC,OAHAuf,GAAA/K,EAAAxU,GACAwf,KAEAjY,EAAA,EAAmBA,EAAAgY,EAAA3lB,OAAsB2N,IAAA,CACzC,GAAAkY,GAAAF,EAAAhY,GACAkE,EAAA,GAAAzL,EAAAuH,CAEAiY,GAAAvY,KAAAwE,GACA4T,EAAA5T,IAAoBgU,OAAAC,UAAA,GACpBxM,EAAAzH,KAEA,QAAAvK,GAAA,EAAqBA,EAAAoe,EAAA1lB,OAAwBsH,IAAA,CAC7C,GAAAye,GAAAL,EAAApe,EAEAme,GAAAM,IAAAN,EAAAM,GAAAF,KAAA9lB,OAAA8lB,EAAA9lB,MACAuZ,EAAAyM,GAAAlU,GACAgT,EAAAY,EAAAM,GAAAD,UAAAD,EAAA7lB,OAAA6lB,EAAA9lB,MACA8kB,EAAAY,EAAAM,GAAAD,UAAAD,EAAA9lB,MAEA0lB,EAAAM,GAAAD,WAAAD,EAAA7lB,SAEAylB,EAAAM,KAAAN,EAAAM,GAAAD,UAAAD,EAAA7lB,QAEAsZ,EAAAyM,GAAAlU,GAAAgT,EAAAgB,EAAA7lB,OAAA6lB,EAAA9lB,MACA,EAAAO,EAAAC,sBAAAslB,EAAA9lB,KAAAM,KAKAqlB,EAAAE,EAGA,IAAAte,EAAA,EAAaA,EAAAoe,EAAA1lB,OAAwBsH,IACrCgS,EAAAoM,EAAApe,IAAA,KAGA,QAAUub,IAAAvJ,EAAAmM,SAWV,QAAAO,GAAAplB,EAAAqlB,GACA,GAAAlmB,GACAmmB,EAAA5lB,EAAA6lB,mBAAAvlB,EAKA,KAHAb,EAAAO,EAAAmB,KAAAwkB,EAAAC,MAGA5lB,EAAAwB,MAAA/B,EAAAuO,IAAA4X,EAAA5X,IACA,SAAAzM,OAAA,IAAAjB,EAAA,iCACAN,EAAAwE,SAAA/E,GACA,0BAAAO,EAAAwE,SAAAohB,GAQA,QAJAnmB,IAAAO,EAAAmC,OAAAxB,EAAAyjB,uBACA3kB,EAAAO,EAAAwB,MAGA/B,GACA,IAAAO,GAAA+B,QACA,UAAAyiB,GAAAlkB,EAEA,KAAAN,GAAAkC,aACA,UAAAiR,GAAA7S,EAEA,KAAAN,GAAAmC,MACA,UAAAsiB,GAAAnkB,EAEA,KAAAN,GAAAwB,KACA,UAAAkjB,GAAApkB,IArQA,GAAAN,GAAAT,EAAA,QACAilB,EAAAjlB,EAAA,QACA4T,EAAA5T,EAAA,QACAmlB,EAAAnlB,EAAA,QACAklB,EAAAllB,EAAA,QACA2kB,EAAA3kB,EAAA,QACAoB,EAAApB,EAAA,QACAuZ,EAAAvZ,EAAA,OAiRAD,GAAA8X,UAAA,SAAA4F,GACA,MAAAA,GAAA6H,OAAA,SAAAC,EAAAziB,GAOA,MANA,gBAAAA,GACAyiB,EAAA/X,KAAA2Y,EAAArjB,EAAA,OACKA,EAAA/B,MACLwkB,EAAA/X,KAAA2Y,EAAArjB,EAAA/B,KAAA+B,EAAA5C,OAGAqlB,QAYAxlB,EAAAkY,WAAA,SAAAlX,EAAAP,GAQA,OAPA6kB,GAAAf,EAAAvjB,EAAAK,EAAAyjB,sBAEA9J,EAAA2K,EAAAL,GACA5L,EAAAkM,EAAA5K,EAAAva,GACA2F,EAAAoT,EAAAyB,UAAAvB,EAAAuJ,IAAA,eAEAuD,KACAhgB,EAAA,EAAiBA,EAAAJ,EAAAhG,OAAA,EAAqBoG,IACtCggB,EAAA/Y,KAAAiM,EAAAmM,MAAAzf,EAAAI,IAAAyf,KAGA,OAAAjmB,GAAA8X,UAAAuN,EAAAmB,KAaAxmB,EAAAiY,SAAA,SAAAjX,GACA,MAAAhB,GAAA8X,UACAyM,EAAAvjB,EAAAK,EAAAyjB,yB5Bu0GM2B,KACA,SAAU1mB,EAAQC,G6B/oHxB,GAAA0mB,GACAC,GACA,EACA,qCACA,yCACA,kDACA,kDASA3mB,GAAAmN,cAAA,SAAA1M,GACA,IAAAA,EAAA,SAAAwB,OAAA,wCACA,IAAAxB,EAAA,GAAAA,EAAA,YAAAwB,OAAA,4CACA,UAAAxB,EAAA,IASAT,EAAAoC,wBAAA,SAAA3B,GACA,MAAAkmB,GAAAlmB,IASAT,EAAA0B,YAAA,SAAAV,GAGA,IAFA,GAAA4lB,GAAA,EAEA,IAAA5lB,GACA4lB,IACA5lB,KAAA,CAGA,OAAA4lB,IAGA5mB,EAAA2Y,kBAAA,SAAAkO,GACA,qBAAAA,GACA,SAAA5kB,OAAA,wCAGAykB,GAAAG,GAGA7mB,EAAA8kB,mBAAA,WACA,gBAAA4B,GAGA1mB,EAAA8mB,OAAA,SAAAhX,GACA,MAAA4W,GAAA5W,K7BupHMiX,KACA,SAAUhnB,EAAQC,EAASC,G8BntHjC,QAAAilB,GAAAlkB,GACAgH,KAAA7H,KAAAO,EAAA+B,QACAuF,KAAAhH,OAAAkE,WAJA,GAAAxE,GAAAT,EAAA,OAOAilB,GAAAhkB,cAAA,SAAAd,GACA,UAAAsC,KAAAC,MAAAvC,EAAA,IAAAA,EAAA,EAAAA,EAAA,UAGA8kB,EAAA/W,UAAAjL,UAAA,WACA,MAAA8E,MAAAhH,KAAAZ,QAGA8kB,EAAA/W,UAAAjN,cAAA,WACA,MAAAgkB,GAAAhkB,cAAA8G,KAAAhH,KAAAZ,SAGA8kB,EAAA/W,UAAA4F,MAAA,SAAAC,GACA,GAAAxN,GAAAwgB,EAAAllB,CAIA,KAAA0E,EAAA,EAAaA,EAAA,GAAAwB,KAAAhH,KAAAZ,OAA2BoG,GAAA,EACxCwgB,EAAAhf,KAAAhH,KAAAimB,OAAAzgB,EAAA,GACA1E,EAAAE,SAAAglB,EAAA,IAEAhT,EAAA1F,IAAAxM,EAAA,GAKA,IAAAolB,GAAAlf,KAAAhH,KAAAZ,OAAAoG,CACA0gB,GAAA,IACAF,EAAAhf,KAAAhH,KAAAimB,OAAAzgB,GACA1E,EAAAE,SAAAglB,EAAA,IAEAhT,EAAA1F,IAAAxM,EAAA,EAAAolB,EAAA,KAIAnnB,EAAAC,QAAAklB,G9B4tHMiC,KACA,SAAUpnB,EAAQC,EAASC,G+BxoHjC,QAAAiY,GAAAoF,GACA,mBAAAA,GACA,SAAArb,OAAA,wBAKA,QAFAqb,EAAA8J,eAGA,cACA,MAAApnB,GAAAyC,OACA,oBACA,MAAAzC,GAAA4C,YACA,aACA,MAAA5C,GAAA6C,KACA,YACA,MAAA7C,GAAAkC,IACA,SACA,SAAAD,OAAA,iBAAAqb,IAhJA,GAAAvH,GAAA9V,EAAA,QACA2kB,EAAA3kB,EAAA,OASAD,GAAAyC,SACAgG,GAAA,UACAiG,IAAA,EACA2Y,QAAA,WAYArnB,EAAA4C,cACA6F,GAAA,eACAiG,IAAA,EACA2Y,QAAA,UAQArnB,EAAAkC,MACAuG,GAAA,OACAiG,IAAA,EACA2Y,QAAA,UAYArnB,EAAA6C,OACA4F,GAAA,QACAiG,IAAA,EACA2Y,QAAA,UASArnB,EAAAoB,OACAsN,KAAA,GAWA1O,EAAAW,sBAAA,SAAAR,EAAAM,GACA,IAAAN,EAAAknB,OAAA,SAAAplB,OAAA,iBAAA9B,EAEA,KAAA4V,EAAApU,QAAAlB,GACA,SAAAwB,OAAA,oBAAAxB,EAGA,OAAAA,IAAA,GAAAA,EAAA,GAAAN,EAAAknB,OAAA,GACA5mB,EAAA,GAAAN,EAAAknB,OAAA,GACAlnB,EAAAknB,OAAA,IASArnB,EAAAumB,mBAAA,SAAA/B,GACA,MAAAI,GAAApU,YAAAgU,GAAAxkB,EAAAyC,QACAmiB,EAAAnU,iBAAA+T,GAAAxkB,EAAA4C,aACAgiB,EAAAtU,UAAAkU,GAAAxkB,EAAA6C,MACA7C,EAAAkC,MASAlC,EAAAkF,SAAA,SAAA/E,GACA,GAAAA,KAAAsI,GAAA,MAAAtI,GAAAsI,EACA,UAAAxG,OAAA,iBASAjC,EAAA2B,QAAA,SAAAxB,GACA,MAAAA,MAAAuO,KAAAvO,EAAAknB,QAsCArnB,EAAA6B,KAAA,SAAAC,EAAAC,GACA,GAAA/B,EAAA2B,QAAAG,GACA,MAAAA,EAGA,KACA,MAAAoW,GAAApW,GACG,MAAA4C,GACH,MAAA3C,M/BgxHMulB,KACA,SAAUvnB,EAAQC,GgCh7HxB,QAAAkY,GAAAoF,GACA,mBAAAA,GACA,SAAArb,OAAA,wBAKA,QAFAqb,EAAA8J,eAGA,QACA,UACA,MAAApnB,GAAA8U,CAEA,SACA,aACA,MAAA9U,GAAAiD,CAEA,SACA,eACA,MAAAjD,GAAA+U,CAEA,SACA,WACA,MAAA/U,GAAAgV,CAEA,SACA,SAAA/S,OAAA,qBAAAqb,IA9BAtd,EAAA8U,GAAapG,IAAA,GACb1O,EAAAiD,GAAayL,IAAA,GACb1O,EAAA+U,GAAarG,IAAA,GACb1O,EAAAgV,GAAatG,IAAA,GA+Bb1O,EAAA2B,QAAA,SAAA4lB,GACA,MAAAA,QAAA,KAAAA,EAAA7Y,KACA6Y,EAAA7Y,KAAA,GAAA6Y,EAAA7Y,IAAA,GAGA1O,EAAA6B,KAAA,SAAAC,EAAAC,GACA,GAAA/B,EAAA2B,QAAAG,GACA,MAAAA,EAGA,KACA,MAAAoW,GAAApW,GACG,MAAA4C,GACH,MAAA3C,MhC87HMylB,KACA,SAAUznB,EAAQC,EAASC,GiC3+HjC,QAAAmlB,GAAApkB,GACAgH,KAAA7H,KAAAO,EAAAwB,KACA8F,KAAAhH,KAAA,GAAAuO,GAAAvO,GALA,GAAAuO,GAAAtP,EAAA,QACAS,EAAAT,EAAA,OAOAmlB,GAAAlkB,cAAA,SAAAd,GACA,SAAAA,GAGAglB,EAAAjX,UAAAjL,UAAA,WACA,MAAA8E,MAAAhH,KAAAZ,QAGAglB,EAAAjX,UAAAjN,cAAA,WACA,MAAAkkB,GAAAlkB,cAAA8G,KAAAhH,KAAAZ,SAGAglB,EAAAjX,UAAA4F,MAAA,SAAAC,GACA,OAAAxN,GAAA,EAAAihB,EAAAzf,KAAAhH,KAAAZ,OAAuCoG,EAAAihB,EAAOjhB,IAC9CwN,EAAA1F,IAAAtG,KAAAhH,KAAAwF,GAAA,IAIAzG,EAAAC,QAAAolB,GjCq/HMsC,KACA,SAAU3nB,EAAQC,EAASC,GkC7gIjC,QAAAkX,GAAAiC,GACApR,KAAA2f,YAAAxjB,GACA6D,KAAAoR,SAEApR,KAAAoR,QAAApR,KAAA4f,WAAA5f,KAAAoR,QAPA,GAAA7J,GAAAtP,EAAA,QACA4nB,EAAA5nB,EAAA,OAeAkX,GAAAhJ,UAAAyZ,WAAA,SAAAxO,GAEApR,KAAAoR,SACApR,KAAA2f,QAAAE,EAAA1O,qBAAAnR,KAAAoR,SASAjC,EAAAhJ,UAAAuJ,OAAA,SAAA1W,GACA,IAAAgH,KAAA2f,QACA,SAAA1lB,OAAA,0BAKA,IAAA6lB,GAAA,GAAAvY,GAAAvH,KAAAoR,OACA0O,GAAA1T,KAAA,EACA,IAAA2T,GAAAxY,EAAAwQ,QAAA/e,EAAA8mB,GAAA9mB,EAAAZ,OAAA4H,KAAAoR,QAIA4O,EAAAH,EAAAhS,IAAAkS,EAAA/f,KAAA2f,SAKApI,EAAAvX,KAAAoR,OAAA4O,EAAA5nB,MACA,IAAAmf,EAAA,GACA,GAAA0I,GAAA,GAAA1Y,GAAAvH,KAAAoR,OAIA,OAHA6O,GAAA7T,KAAA,GACA4T,EAAA/J,KAAAgK,EAAA1I,GAEA0I,EAGA,MAAAD,IAGAjoB,EAAAC,QAAAmX,GlCuhIM+Q,OACA,SAAUnoB,EAAQC,EAASC,GmCllIjC,GAAAoB,GAAApB,EAAA,QAIAkoB,EAAA9mB,EAAAK,YAFA,KAcA1B,GAAAmD,eAAA,SAAA9C,EAAAoY,GAIA,IAHA,GAAAzX,GAAAX,EAAAqO,KAAA,EAAA+J,EACArV,EAAApC,GAAA,GAEAK,EAAAK,YAAA0B,GAAA+kB,GAAA,GACA/kB,GAnBA,MAmBA/B,EAAAK,YAAA0B,GAAA+kB,CAMA,OAxBA,QAwBAnnB,GAAA,GAAAoC,KnC0lIMglB,KACA,SAAUroB,EAAQC,EAASC,GoCnnIjC,QAAAklB,GAAAnkB,GACAgH,KAAA7H,KAAAO,EAAAmC,MACAmF,KAAAhH,OALA,GAAAN,GAAAT,EAAA,QACAoB,EAAApB,EAAA,OAOAklB,GAAAjkB,cAAA,SAAAd,GACA,UAAAA,GAGA+kB,EAAAhX,UAAAjL,UAAA,WACA,MAAA8E,MAAAhH,KAAAZ,QAGA+kB,EAAAhX,UAAAjN,cAAA,WACA,MAAAikB,GAAAjkB,cAAA8G,KAAAhH,KAAAZ,SAGA+kB,EAAAhX,UAAA4F,MAAA,SAAAC,GACA,GAAAxN,EAKA,KAAAA,EAAA,EAAaA,EAAAwB,KAAAhH,KAAAZ,OAAsBoG,IAAA,CACnC,GAAA1E,GAAAT,EAAAylB,OAAA9e,KAAAhH,KAAAwF,GAGA,IAAA1E,GAAA,OAAAA,GAAA,MAEAA,GAAA,UAGK,MAAAA,GAAA,OAAAA,GAAA,OAIL,SAAAG,OACA,2BAAA+F,KAAAhH,KAAAwF,GAAA,oCAHA1E,IAAA,MASAA,EAAA,KAAAA,IAAA,YAAAA,GAGAkS,EAAA1F,IAAAxM,EAAA,MAIA/B,EAAAC,QAAAmlB","file":"static/js/0.024758f495f2ab9d932f.js","sourcesContent":["webpackJsonp([0],{\n\n/***/ \"1Y2G\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Utils = __webpack_require__(\"oLzS\")\nvar ECCode = __webpack_require__(\"Sd0T\")\nvar ECLevel = __webpack_require__(\"utyv\")\nvar Mode = __webpack_require__(\"uF9H\")\nvar isArray = __webpack_require__(\"Dsid\")\n\n// Generator polynomial used to encode version information\nvar G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)\nvar G18_BCH = Utils.getBCHDigit(G18)\n\nfunction getBestVersionForDataLength (mode, length, errorCorrectionLevel) {\n for (var currentVersion = 1; currentVersion <= 40; currentVersion++) {\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\nfunction getReservedBitsCount (mode, version) {\n // Character count indicator + mode indicator bits\n return Mode.getCharCountIndicator(mode, version) + 4\n}\n\nfunction getTotalBitsFromDataArray (segments, version) {\n var totalBits = 0\n\n segments.forEach(function (data) {\n var reservedBits = getReservedBitsCount(data.mode, version)\n totalBits += reservedBits + data.getBitsLength()\n })\n\n return totalBits\n}\n\nfunction getBestVersionForMixedData (segments, errorCorrectionLevel) {\n for (var currentVersion = 1; currentVersion <= 40; currentVersion++) {\n var length = getTotalBitsFromDataArray(segments, currentVersion)\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\n/**\n * Check if QR Code version is valid\n *\n * @param {Number} version QR Code version\n * @return {Boolean} true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n return !isNaN(version) && version >= 1 && version <= 40\n}\n\n/**\n * Returns version number from a value.\n * If value is not a valid version, returns defaultValue\n *\n * @param {Number|String} value QR Code version\n * @param {Number} defaultValue Fallback value\n * @return {Number} QR Code version number\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return parseInt(value, 10)\n }\n\n return defaultValue\n}\n\n/**\n * Returns how much data can be stored with the specified QR code version\n * and error correction level\n *\n * @param {Number} version QR Code version (1-40)\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} Quantity of storable data\n */\nexports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {\n if (!exports.isValid(version)) {\n throw new Error('Invalid QR Code version')\n }\n\n // Use Byte mode as default\n if (typeof mode === 'undefined') mode = Mode.BYTE\n\n // Total codewords for this QR code version (Data + Error correction)\n var totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n var ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n var dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n if (mode === Mode.MIXED) return dataTotalCodewordsBits\n\n var usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)\n\n // Return max number of storable codewords\n switch (mode) {\n case Mode.NUMERIC:\n return Math.floor((usableBits / 10) * 3)\n\n case Mode.ALPHANUMERIC:\n return Math.floor((usableBits / 11) * 2)\n\n case Mode.KANJI:\n return Math.floor(usableBits / 13)\n\n case Mode.BYTE:\n default:\n return Math.floor(usableBits / 8)\n }\n}\n\n/**\n * Returns the minimum version needed to contain the amount of data\n *\n * @param {Segment} data Segment of data\n * @param {Number} [errorCorrectionLevel=H] Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} QR Code version\n */\nexports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {\n var seg\n\n var ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)\n\n if (isArray(data)) {\n if (data.length > 1) {\n return getBestVersionForMixedData(data, ecl)\n }\n\n if (data.length === 0) {\n return 1\n }\n\n seg = data[0]\n } else {\n seg = data\n }\n\n return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)\n}\n\n/**\n * Returns version information with relative error correction bits\n *\n * The version information is included in QR Code symbols of version 7 or larger.\n * It consists of an 18-bit sequence containing 6 data bits,\n * with 12 error correction bits calculated using the (18, 6) Golay code.\n *\n * @param {Number} version QR Code version\n * @return {Number} Encoded version info bits\n */\nexports.getEncodedBits = function getEncodedBits (version) {\n if (!exports.isValid(version) || version < 7) {\n throw new Error('Invalid QR Code version')\n }\n\n var d = version << 12\n\n while (Utils.getBCHDigit(d) - G18_BCH >= 0) {\n d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))\n }\n\n return (version << 12) | d\n}\n\n\n/***/ }),\n\n/***/ \"71e1\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar canPromise = __webpack_require__(\"mwnW\")\nvar QRCode = __webpack_require__(\"WEzc\")\nvar CanvasRenderer = __webpack_require__(\"9ff9\")\nvar SvgRenderer = __webpack_require__(\"729m\")\n\nfunction renderCanvas (renderFunc, canvas, text, opts, cb) {\n var args = [].slice.call(arguments, 1)\n var argsNum = args.length\n var isLastArgCb = typeof args[argsNum - 1] === 'function'\n\n if (!isLastArgCb && !canPromise()) {\n throw new Error('Callback required as last argument')\n }\n\n if (isLastArgCb) {\n if (argsNum < 2) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 2) {\n cb = text\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 3) {\n if (canvas.getContext && typeof cb === 'undefined') {\n cb = opts\n opts = undefined\n } else {\n cb = opts\n opts = text\n text = canvas\n canvas = undefined\n }\n }\n } else {\n if (argsNum < 1) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 1) {\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 2 && !canvas.getContext) {\n opts = text\n text = canvas\n canvas = undefined\n }\n\n return new Promise(function (resolve, reject) {\n try {\n var data = QRCode.create(text, opts)\n resolve(renderFunc(data, canvas, opts))\n } catch (e) {\n reject(e)\n }\n })\n }\n\n try {\n var data = QRCode.create(text, opts)\n cb(null, renderFunc(data, canvas, opts))\n } catch (e) {\n cb(e)\n }\n}\n\nexports.create = QRCode.create\nexports.toCanvas = renderCanvas.bind(null, CanvasRenderer.render)\nexports.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL)\n\n// only svg for now.\nexports.toString = renderCanvas.bind(null, function (data, _, opts) {\n return SvgRenderer.render(data, opts)\n})\n\n\n/***/ }),\n\n/***/ \"729m\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Utils = __webpack_require__(\"nwDn\")\n\nfunction getColorAttrib (color, attrib) {\n var alpha = color.a / 255\n var str = attrib + '=\"' + color.hex + '\"'\n\n return alpha < 1\n ? str + ' ' + attrib + '-opacity=\"' + alpha.toFixed(2).slice(1) + '\"'\n : str\n}\n\nfunction svgCmd (cmd, x, y) {\n var str = cmd + x\n if (typeof y !== 'undefined') str += ' ' + y\n\n return str\n}\n\nfunction qrToPath (data, size, margin) {\n var path = ''\n var moveBy = 0\n var newRow = false\n var lineLength = 0\n\n for (var i = 0; i < data.length; i++) {\n var col = Math.floor(i % size)\n var row = Math.floor(i / size)\n\n if (!col && !newRow) newRow = true\n\n if (data[i]) {\n lineLength++\n\n if (!(i > 0 && col > 0 && data[i - 1])) {\n path += newRow\n ? svgCmd('M', col + margin, 0.5 + row + margin)\n : svgCmd('m', moveBy, 0)\n\n moveBy = 0\n newRow = false\n }\n\n if (!(col + 1 < size && data[i + 1])) {\n path += svgCmd('h', lineLength)\n lineLength = 0\n }\n } else {\n moveBy++\n }\n }\n\n return path\n}\n\nexports.render = function render (qrData, options, cb) {\n var opts = Utils.getOptions(options)\n var size = qrData.modules.size\n var data = qrData.modules.data\n var qrcodesize = size + opts.margin * 2\n\n var bg = !opts.color.light.a\n ? ''\n : '<path ' + getColorAttrib(opts.color.light, 'fill') +\n ' d=\"M0 0h' + qrcodesize + 'v' + qrcodesize + 'H0z\"/>'\n\n var path =\n '<path ' + getColorAttrib(opts.color.dark, 'stroke') +\n ' d=\"' + qrToPath(data, size, opts.margin) + '\"/>'\n\n var viewBox = 'viewBox=\"' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '\"'\n\n var width = !opts.width ? '' : 'width=\"' + opts.width + '\" height=\"' + opts.width + '\" '\n\n var svgTag = '<svg xmlns=\"http://www.w3.org/2000/svg\" ' + width + viewBox + '>' + bg + path + '</svg>'\n\n if (typeof cb === 'function') {\n cb(null, svgTag)\n }\n\n return svgTag\n}\n\n\n/***/ }),\n\n/***/ \"7P5H\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_qrcode__ = __webpack_require__(\"71e1\");\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_qrcode___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_0_qrcode__);\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1__api_marketing_shop_store__ = __webpack_require__(\"g45I\");\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_2__api_marketing_shop_table__ = __webpack_require__(\"UHv4\");\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_3__api_marketing_shop_tableGroup__ = __webpack_require__(\"Ljbq\");\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n//\n\n\n\n\n\n\n/* harmony default export */ __webpack_exports__[\"a\"] = ({\n created: function created() {\n var _this = this;\n\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1__api_marketing_shop_store__[\"a\" /* storeList */])({ org: this.ruleForm.org }).then(function (response) {\n _this.shopList = response.result.rows;\n _this.ruleForm.store = _this.shopList[0].id;\n _this.selectlist();\n });\n },\n\n computed: {\n \"downname\": function downname() {\n return this.width + \"X\" + this.width + \".png\";\n }\n },\n watch: {\n \"ruleForm.store\": function ruleFormStore(id) {\n var _this2 = this;\n\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_3__api_marketing_shop_tableGroup__[\"a\" /* tableGroupList */])(id).then(function (response) {\n _this2.grouplist = response.result;\n });\n }\n },\n filters: {\n tranGroupName: function tranGroupName(id, shoplist) {\n var name = '';\n shoplist.forEach(function (x, index) {\n if (x.id == id) {\n name = x.groupName;\n }\n });\n return name;\n }\n },\n data: function data() {\n return {\n dialogVisible: false,\n img: \"\",\n width: '',\n title: \"\",\n grouplist: [],\n usertype: this.$store.getters.usertype,\n ruleForm: {\n org: this.$store.getters.orgId,\n store: ''\n },\n form: {\n tableName: '',\n seats: '',\n groupId: '-1',\n comment: ''\n },\n manageList: [],\n shopList: [],\n list: [],\n dialogFormVisible: false,\n rule: {\n tableName: [{ required: true, message: '请输桌号', trigger: 'blur' }],\n seats: [{ pattern: /^([1-9][0-9]{0,1})?$/, message: '就餐人数必须为整数且最多99人', trigger: 'blur' }]\n }\n };\n },\n\n methods: {\n downQrcode: function downQrcode(id, width) {\n var _this3 = this;\n\n // var text = process.env.BASE_API + \"/service-org/tables/jump/\" + id\n var text = \"http://ota.neusoft.com:28080/\" + \"service-trade/order/wxOrderPage?shopId=\" + this.ruleForm.store + \"&table=\" + id;\n // console.log(text)\n __WEBPACK_IMPORTED_MODULE_0_qrcode___default.a.toDataURL(text, { errorCorrectionLevel: 'H', width: width }).then(function (url) {\n _this3.dialogVisible = true;\n _this3.img = url;\n _this3.width = width;\n }).catch(function (err) {});\n },\n shopChange: function shopChange() {\n this.selectlist();\n },\n selectlist: function selectlist() {\n var _this4 = this;\n\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2__api_marketing_shop_table__[\"a\" /* tableList */])(this.ruleForm.store).then(function (response) {\n _this4.list = response.result;\n });\n },\n addTable: function addTable() {\n this.form = {\n tableName: '',\n groupId: -1,\n comment: ''\n }, this.dialogFormVisible = true;\n },\n updateTable: function updateTable(item) {\n this.form = {\n id: item.id,\n tableName: item.tableName,\n comment: item.comment,\n seats: item.seats,\n groupId: item.groupId\n };\n this.dialogFormVisible = true;\n },\n delTable: function delTable(id) {\n var _this5 = this;\n\n this.$confirm('此操作将删除您所选的数据, 是否继续?', '', {\n type: 'warning',\n center: true\n }).then(function () {\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2__api_marketing_shop_table__[\"b\" /* tableDel */])(id).then(function (response) {\n _this5.selectlist();\n });\n }).catch(function () {});\n },\n subTable: function subTable() {\n var _this6 = this;\n\n this.$refs['form'].validate(function (valid) {\n if (valid) {\n _this6.form.shopId = _this6.ruleForm.store;\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2__api_marketing_shop_table__[\"c\" /* tableSub */])(_this6.form).then(function (response) {\n _this6.dialogFormVisible = false;\n _this6.selectlist();\n });\n } else {\n return false;\n }\n });\n }\n }\n\n});\n\n/***/ }),\n\n/***/ \"9ff9\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Utils = __webpack_require__(\"nwDn\")\n\nfunction clearCanvas (ctx, canvas, size) {\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n if (!canvas.style) canvas.style = {}\n canvas.height = size\n canvas.width = size\n canvas.style.height = size + 'px'\n canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n try {\n return document.createElement('canvas')\n } catch (e) {\n throw new Error('You need to specify a canvas element')\n }\n}\n\nexports.render = function render (qrData, canvas, options) {\n var opts = options\n var canvasEl = canvas\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!canvas) {\n canvasEl = getCanvasElement()\n }\n\n opts = Utils.getOptions(opts)\n var size = Utils.getImageWidth(qrData.modules.size, opts)\n\n var ctx = canvasEl.getContext('2d')\n var image = ctx.createImageData(size, size)\n Utils.qrToImageData(image.data, qrData, opts)\n\n clearCanvas(ctx, canvasEl, size)\n ctx.putImageData(image, 0, 0)\n\n return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n var opts = options\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!opts) opts = {}\n\n var canvasEl = exports.render(qrData, canvas, opts)\n\n var type = opts.type || 'image/png'\n var rendererOpts = opts.rendererOpts || {}\n\n return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n\n\n/***/ }),\n\n/***/ \"9jEu\":\n/***/ (function(module, exports, __webpack_require__) {\n\n/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nvar getSymbolSize = __webpack_require__(\"oLzS\").getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n if (version === 1) return []\n\n var posCount = Math.floor(version / 7) + 2\n var size = getSymbolSize(version)\n var intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n var positions = [size - 7] // Last coord is always (size - 7)\n\n for (var i = 1; i < posCount - 1; i++) {\n positions[i] = positions[i - 1] - intervals\n }\n\n positions.push(6) // First coord is always 6\n\n return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * var pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n var coords = []\n var pos = exports.getRowColCoords(version)\n var posLength = pos.length\n\n for (var i = 0; i < posLength; i++) {\n for (var j = 0; j < posLength; j++) {\n // Skip if position is occupied by finder patterns\n if ((i === 0 && j === 0) || // top-left\n (i === 0 && j === posLength - 1) || // bottom-left\n (i === posLength - 1 && j === 0)) { // top-right\n continue\n }\n\n coords.push([pos[i], pos[j]])\n }\n }\n\n return coords\n}\n\n\n/***/ }),\n\n/***/ \"DEuz\":\n/***/ (function(module, exports) {\n\nfunction BitBuffer () {\n this.buffer = []\n this.length = 0\n}\n\nBitBuffer.prototype = {\n\n get: function (index) {\n var bufIndex = Math.floor(index / 8)\n return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n },\n\n put: function (num, length) {\n for (var i = 0; i < length; i++) {\n this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n }\n },\n\n getLengthInBits: function () {\n return this.length\n },\n\n putBit: function (bit) {\n var bufIndex = Math.floor(this.length / 8)\n if (this.buffer.length <= bufIndex) {\n this.buffer.push(0)\n }\n\n if (bit) {\n this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n }\n\n this.length++\n }\n}\n\nmodule.exports = BitBuffer\n\n\n/***/ }),\n\n/***/ \"Dsid\":\n/***/ (function(module, exports) {\n\nvar toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n\n\n/***/ }),\n\n/***/ \"Ljbq\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export (immutable) */ __webpack_exports__[\"a\"] = tableGroupList;\n/* harmony export (immutable) */ __webpack_exports__[\"c\"] = tableSub;\n/* harmony export (immutable) */ __webpack_exports__[\"b\"] = tableDel;\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__utils_fetch__ = __webpack_require__(\"Vo7i\");\n\n\n// 餐桌列表\nfunction tableGroupList(shopid) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tableGroups/shop/' + shopid,\n // url: 'https://easy-mock.com/mock/5a5ee345dec01f1bea369aee/service-org/tables/shop/',\n method: 'get'\n });\n}\n\n// 餐桌添加修改\nfunction tableSub(params) {\n var method = 'post';\n if (params.id) {\n method = 'put';\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tableGroups',\n method: method,\n params: params\n });\n } else {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tableGroups',\n method: method,\n data: params\n });\n }\n}\n\n// 餐桌删除\nfunction tableDel(id) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tableGroups/' + id,\n method: 'delete'\n\n });\n}\n\n/***/ }),\n\n/***/ \"NV47\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Buffer = __webpack_require__(\"jF+B\")\n\nvar EXP_TABLE = new Buffer(512)\nvar LOG_TABLE = new Buffer(256)\n\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n var x = 1\n for (var i = 0; i < 255; i++) {\n EXP_TABLE[i] = x\n LOG_TABLE[x] = i\n\n x <<= 1 // multiply by 2\n\n // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n x ^= 0x11D\n }\n }\n\n // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n // stay inside the bounds (because we will mainly use this table for the multiplication of\n // two GF numbers, no more).\n // @see {@link mul}\n for (i = 255; i < 512; i++) {\n EXP_TABLE[i] = EXP_TABLE[i - 255]\n }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n if (n < 1) throw new Error('log(' + n + ')')\n return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param {Number} x\n * @param {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n if (x === 0 || y === 0) return 0\n\n // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n // @see {@link initTables}\n return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n\n\n/***/ }),\n\n/***/ \"NY/E\":\n/***/ (function(module, exports) {\n\nvar numeric = '[0-9]+'\nvar alphanumeric = '[A-Z $%*+\\\\-./:]+'\nvar kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nvar byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ').)+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nvar TEST_KANJI = new RegExp('^' + kanji + '$')\nvar TEST_NUMERIC = new RegExp('^' + numeric + '$')\nvar TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n return TEST_ALPHANUMERIC.test(str)\n}\n\n\n/***/ }),\n\n/***/ \"Oa9l\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\nvar render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;\n return _c('div', {\n staticClass: \"app-container\"\n }, [_c('el-form', {\n ref: \"ruleForm\",\n attrs: {\n \"model\": _vm.ruleForm,\n \"label-width\": \"20px\"\n }\n }, [_c('el-form-item', {\n attrs: {\n \"label\": \"\",\n \"prop\": \"org\"\n }\n }, [_c('el-select', {\n attrs: {\n \"placeholder\": \"门店\",\n \"filterable\": \"\"\n },\n on: {\n \"change\": _vm.shopChange\n },\n model: {\n value: (_vm.ruleForm.store),\n callback: function($$v) {\n _vm.$set(_vm.ruleForm, \"store\", $$v)\n },\n expression: \"ruleForm.store\"\n }\n }, _vm._l((_vm.shopList), function(shopvo) {\n return _c('el-option', {\n key: shopvo.id,\n attrs: {\n \"label\": shopvo.name,\n \"value\": shopvo.id\n }\n })\n }))], 1)], 1), _vm._v(\" \"), _c('div', {\n staticClass: \"listbutton\"\n }, [_c('el-button', {\n attrs: {\n \"type\": \"primary\"\n },\n on: {\n \"click\": function($event) {\n _vm.addTable()\n }\n }\n }, [_vm._v(\"添加餐桌\")]), _vm._v(\" \"), _c('router-link', {\n attrs: {\n \"to\": \"tableGroup\"\n }\n }, [_c('el-button', {\n attrs: {\n \"type\": \"primary\"\n }\n }, [_vm._v(\"桌分组管理\")])], 1)], 1), _vm._v(\" \"), _c('el-dialog', {\n attrs: {\n \"title\": \"\",\n \"visible\": _vm.dialogFormVisible\n },\n on: {\n \"update:visible\": function($event) {\n _vm.dialogFormVisible = $event\n }\n }\n }, [_c('el-form', {\n ref: \"form\",\n attrs: {\n \"model\": _vm.form,\n \"rules\": _vm.rule\n }\n }, [_c('el-form-item', {\n attrs: {\n \"label\": \"桌号\",\n \"label-width\": \"13%\",\n \"prop\": \"tableName\"\n }\n }, [_c('el-input', {\n model: {\n value: (_vm.form.tableName),\n callback: function($$v) {\n _vm.$set(_vm.form, \"tableName\", $$v)\n },\n expression: \"form.tableName\"\n }\n })], 1), _vm._v(\" \"), _c('el-form-item', {\n attrs: {\n \"label\": \"分组\",\n \"label-width\": \"13%\",\n \"prop\": \"groupId\"\n }\n }, [_c('el-select', {\n attrs: {\n \"placeholder\": \"分组\"\n },\n model: {\n value: (_vm.form.groupId),\n callback: function($$v) {\n _vm.$set(_vm.form, \"groupId\", $$v)\n },\n expression: \"form.groupId\"\n }\n }, _vm._l((_vm.grouplist), function(groupvo) {\n return _c('el-option', {\n key: groupvo.id,\n attrs: {\n \"label\": groupvo.groupName,\n \"value\": groupvo.id\n }\n })\n }))], 1), _vm._v(\" \"), _c('el-form-item', {\n attrs: {\n \"label\": \"就餐人数\",\n \"label-width\": \"13%\",\n \"prop\": \"seats\"\n }\n }, [_c('el-input', {\n staticStyle: {\n \"width\": \"200px\"\n },\n attrs: {\n \"placeholder\": \"就餐人数\"\n },\n model: {\n value: (_vm.form.seats),\n callback: function($$v) {\n _vm.$set(_vm.form, \"seats\", (typeof $$v === 'string' ? $$v.trim() : $$v))\n },\n expression: \"form.seats\"\n }\n }, [_c('template', {\n slot: \"append\"\n }, [_vm._v(\"人\")])], 2)], 1), _vm._v(\" \"), _c('el-form-item', {\n attrs: {\n \"label\": \"备注\",\n \"label-width\": \"13%\",\n \"prop\": \"comment\"\n }\n }, [_c('el-input', {\n model: {\n value: (_vm.form.comment),\n callback: function($$v) {\n _vm.$set(_vm.form, \"comment\", $$v)\n },\n expression: \"form.comment\"\n }\n })], 1)], 1), _vm._v(\" \"), _c('div', {\n staticClass: \"dialog-footer\",\n attrs: {\n \"slot\": \"footer\"\n },\n slot: \"footer\"\n }, [_c('el-button', {\n on: {\n \"click\": function($event) {\n _vm.dialogFormVisible = false\n }\n }\n }, [_vm._v(\"取 消\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"primary\"\n },\n on: {\n \"click\": _vm.subTable\n }\n }, [_vm._v(\"确 定\")])], 1)], 1), _vm._v(\" \"), _c('el-table', {\n attrs: {\n \"data\": _vm.list,\n \"element-loading-text\": \"拼命加载中\",\n \"border\": \"\",\n \"fit\": \"\",\n \"size\": \"small\"\n }\n }, [_c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"桌号\",\n \"prop\": \"tableName\",\n \"width\": \"200px\"\n }\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"分组\",\n \"prop\": \"groupId\",\n \"width\": \"200px\"\n },\n scopedSlots: _vm._u([{\n key: \"default\",\n fn: function(scope) {\n return [_vm._v(\"\\n \" + _vm._s(_vm._f(\"tranGroupName\")(scope.row.groupId, _vm.grouplist)) + \"\\n \")]\n }\n }])\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"就餐人数\",\n \"prop\": \"seats\",\n \"width\": \"100px\"\n }\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"二维码\",\n \"width\": \"350px\"\n },\n scopedSlots: _vm._u([{\n key: \"default\",\n fn: function(scope) {\n return [_c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 100)\n }\n }\n }, [_vm._v(\"100像素\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 200)\n }\n }\n }, [_vm._v(\"200像素\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 500)\n }\n }\n }, [_vm._v(\"500像素\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 1024)\n }\n }\n }, [_vm._v(\"1024像素\")])]\n }\n }])\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"备注\",\n \"prop\": \"comment\"\n }\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"操作\",\n \"width\": \"200px\"\n },\n scopedSlots: _vm._u([{\n key: \"default\",\n fn: function(scope) {\n return [_c('el-button', {\n attrs: {\n \"type\": \"primary\",\n \"size\": \"small\"\n },\n on: {\n \"click\": function($event) {\n _vm.updateTable(scope.row)\n }\n }\n }, [_vm._v(\"编辑\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"danger\",\n \"size\": \"small\"\n },\n on: {\n \"click\": function($event) {\n _vm.delTable(scope.row.id)\n }\n }\n }, [_vm._v(\"删除\")])]\n }\n }])\n })], 1), _vm._v(\" \"), _c('el-dialog', {\n attrs: {\n \"title\": _vm.title,\n \"visible\": _vm.dialogVisible,\n \"width\": \"25%\"\n },\n on: {\n \"update:visible\": function($event) {\n _vm.dialogVisible = $event\n }\n }\n }, [_c('span', [_c('img', {\n attrs: {\n \"src\": _vm.img,\n \"width\": \"100%\"\n }\n })]), _vm._v(\" \"), _c('span', {\n staticClass: \"dialog-footer\",\n attrs: {\n \"slot\": \"footer\"\n },\n slot: \"footer\"\n }, [_c('a', {\n attrs: {\n \"href\": _vm.img,\n \"download\": _vm.downname\n }\n }, [_c('el-button', {\n attrs: {\n \"type\": \"primary\"\n }\n }, [_vm._v(_vm._s(_vm.width) + \"X\" + _vm._s(_vm.width) + \"下载\")])], 1)])])], 1)\n}\nvar staticRenderFns = []\nvar esExports = { render: render, staticRenderFns: staticRenderFns }\n/* harmony default export */ __webpack_exports__[\"a\"] = (esExports);\n\n/***/ }),\n\n/***/ \"RO0P\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Mode = __webpack_require__(\"uF9H\")\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nvar ALPHA_NUM_CHARS = [\n '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n this.mode = Mode.ALPHANUMERIC\n this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n var i\n\n // Input data characters are divided into groups of two characters\n // and encoded as 11-bit binary codes.\n for (i = 0; i + 2 <= this.data.length; i += 2) {\n // The character value of the first character is multiplied by 45\n var value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n // The character value of the second digit is added to the product\n value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n // The sum is then stored as 11-bit binary number\n bitBuffer.put(value, 11)\n }\n\n // If the number of input data characters is not a multiple of two,\n // the character value of the final character is encoded as a 6-bit binary number.\n if (this.data.length % 2) {\n bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n }\n}\n\nmodule.exports = AlphanumericData\n\n\n/***/ }),\n\n/***/ \"RY9c\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Buffer = __webpack_require__(\"jF+B\")\n\n/**\n * Helper class to handle QR Code symbol modules\n *\n * @param {Number} size Symbol size\n */\nfunction BitMatrix (size) {\n if (!size || size < 1) {\n throw new Error('BitMatrix size must be defined and greater than 0')\n }\n\n this.size = size\n this.data = new Buffer(size * size)\n this.data.fill(0)\n this.reservedBit = new Buffer(size * size)\n this.reservedBit.fill(0)\n}\n\n/**\n * Set bit value at specified location\n * If reserved flag is set, this bit will be ignored during masking process\n *\n * @param {Number} row\n * @param {Number} col\n * @param {Boolean} value\n * @param {Boolean} reserved\n */\nBitMatrix.prototype.set = function (row, col, value, reserved) {\n var index = row * this.size + col\n this.data[index] = value\n if (reserved) this.reservedBit[index] = true\n}\n\n/**\n * Returns bit value at specified location\n *\n * @param {Number} row\n * @param {Number} col\n * @return {Boolean}\n */\nBitMatrix.prototype.get = function (row, col) {\n return this.data[row * this.size + col]\n}\n\n/**\n * Applies xor operator at specified location\n * (used during masking process)\n *\n * @param {Number} row\n * @param {Number} col\n * @param {Boolean} value\n */\nBitMatrix.prototype.xor = function (row, col, value) {\n this.data[row * this.size + col] ^= value\n}\n\n/**\n * Check if bit at specified location is reserved\n *\n * @param {Number} row\n * @param {Number} col\n * @return {Boolean}\n */\nBitMatrix.prototype.isReserved = function (row, col) {\n return this.reservedBit[row * this.size + col]\n}\n\nmodule.exports = BitMatrix\n\n\n/***/ }),\n\n/***/ \"Sd0T\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar ECLevel = __webpack_require__(\"utyv\")\r\n\r\nvar EC_BLOCKS_TABLE = [\r\n// L M Q H\r\n 1, 1, 1, 1,\r\n 1, 1, 1, 1,\r\n 1, 1, 2, 2,\r\n 1, 2, 2, 4,\r\n 1, 2, 4, 4,\r\n 2, 4, 4, 4,\r\n 2, 4, 6, 5,\r\n 2, 4, 6, 6,\r\n 2, 5, 8, 8,\r\n 4, 5, 8, 8,\r\n 4, 5, 8, 11,\r\n 4, 8, 10, 11,\r\n 4, 9, 12, 16,\r\n 4, 9, 16, 16,\r\n 6, 10, 12, 18,\r\n 6, 10, 17, 16,\r\n 6, 11, 16, 19,\r\n 6, 13, 18, 21,\r\n 7, 14, 21, 25,\r\n 8, 16, 20, 25,\r\n 8, 17, 23, 25,\r\n 9, 17, 23, 34,\r\n 9, 18, 25, 30,\r\n 10, 20, 27, 32,\r\n 12, 21, 29, 35,\r\n 12, 23, 34, 37,\r\n 12, 25, 34, 40,\r\n 13, 26, 35, 42,\r\n 14, 28, 38, 45,\r\n 15, 29, 40, 48,\r\n 16, 31, 43, 51,\r\n 17, 33, 45, 54,\r\n 18, 35, 48, 57,\r\n 19, 37, 51, 60,\r\n 19, 38, 53, 63,\r\n 20, 40, 56, 66,\r\n 21, 43, 59, 70,\r\n 22, 45, 62, 74,\r\n 24, 47, 65, 77,\r\n 25, 49, 68, 81\r\n]\r\n\r\nvar EC_CODEWORDS_TABLE = [\r\n// L M Q H\r\n 7, 10, 13, 17,\r\n 10, 16, 22, 28,\r\n 15, 26, 36, 44,\r\n 20, 36, 52, 64,\r\n 26, 48, 72, 88,\r\n 36, 64, 96, 112,\r\n 40, 72, 108, 130,\r\n 48, 88, 132, 156,\r\n 60, 110, 160, 192,\r\n 72, 130, 192, 224,\r\n 80, 150, 224, 264,\r\n 96, 176, 260, 308,\r\n 104, 198, 288, 352,\r\n 120, 216, 320, 384,\r\n 132, 240, 360, 432,\r\n 144, 280, 408, 480,\r\n 168, 308, 448, 532,\r\n 180, 338, 504, 588,\r\n 196, 364, 546, 650,\r\n 224, 416, 600, 700,\r\n 224, 442, 644, 750,\r\n 252, 476, 690, 816,\r\n 270, 504, 750, 900,\r\n 300, 560, 810, 960,\r\n 312, 588, 870, 1050,\r\n 336, 644, 952, 1110,\r\n 360, 700, 1020, 1200,\r\n 390, 728, 1050, 1260,\r\n 420, 784, 1140, 1350,\r\n 450, 812, 1200, 1440,\r\n 480, 868, 1290, 1530,\r\n 510, 924, 1350, 1620,\r\n 540, 980, 1440, 1710,\r\n 570, 1036, 1530, 1800,\r\n 570, 1064, 1590, 1890,\r\n 600, 1120, 1680, 1980,\r\n 630, 1204, 1770, 2100,\r\n 660, 1260, 1860, 2220,\r\n 720, 1316, 1950, 2310,\r\n 750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\n\n/***/ }),\n\n/***/ \"UHv4\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export (immutable) */ __webpack_exports__[\"a\"] = tableList;\n/* harmony export (immutable) */ __webpack_exports__[\"c\"] = tableSub;\n/* harmony export (immutable) */ __webpack_exports__[\"b\"] = tableDel;\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__utils_fetch__ = __webpack_require__(\"Vo7i\");\n\n\n// 餐桌列表\nfunction tableList(shopid) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tables/shop/' + shopid,\n // url: 'https://easy-mock.com/mock/5a5ee345dec01f1bea369aee/service-org/tables/shop/',\n method: 'get'\n });\n}\n\n// 餐桌添加修改\nfunction tableSub(params) {\n var method = 'post';\n if (params.id) {\n method = 'put';\n }\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tables',\n method: method,\n params: params\n });\n}\n\n// 餐桌删除\nfunction tableDel(id) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/tables/' + id,\n method: 'delete'\n\n });\n}\n\n/***/ }),\n\n/***/ \"WEzc\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Buffer = __webpack_require__(\"jF+B\")\nvar Utils = __webpack_require__(\"oLzS\")\nvar ECLevel = __webpack_require__(\"utyv\")\nvar BitBuffer = __webpack_require__(\"DEuz\")\nvar BitMatrix = __webpack_require__(\"RY9c\")\nvar AlignmentPattern = __webpack_require__(\"9jEu\")\nvar FinderPattern = __webpack_require__(\"YamF\")\nvar MaskPattern = __webpack_require__(\"ljsv\")\nvar ECCode = __webpack_require__(\"Sd0T\")\nvar ReedSolomonEncoder = __webpack_require__(\"wBZN\")\nvar Version = __webpack_require__(\"1Y2G\")\nvar FormatInfo = __webpack_require__(\"xR/K\")\nvar Mode = __webpack_require__(\"uF9H\")\nvar Segments = __webpack_require__(\"nyx9\")\nvar isArray = __webpack_require__(\"Dsid\")\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n var size = matrix.size\n var pos = FinderPattern.getPositions(version)\n\n for (var i = 0; i < pos.length; i++) {\n var row = pos[i][0]\n var col = pos[i][1]\n\n for (var r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (var c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n var size = matrix.size\n\n for (var r = 8; r < size - 8; r++) {\n var value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n var pos = AlignmentPattern.getPositions(version)\n\n for (var i = 0; i < pos.length; i++) {\n var row = pos[i][0]\n var col = pos[i][1]\n\n for (var r = -2; r <= 2; r++) {\n for (var c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n var size = matrix.size\n var bits = Version.getEncodedBits(version)\n var row, col, mod\n\n for (var i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n var size = matrix.size\n var bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n var i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Buffer} data Data codewords\n */\nfunction setupData (matrix, data) {\n var size = matrix.size\n var inc = -1\n var row = size - 1\n var bitIndex = 7\n var byteIndex = 0\n\n for (var col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (var c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n var dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Buffer} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n var buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n var totalCodewords = Utils.getSymbolTotalCodewords(version)\n var ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n var dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n var remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (var i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Buffer} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n var totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n var ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n var dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n var ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n var blocksInGroup2 = totalCodewords % ecTotalBlocks\n var blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n var totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n var dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n var dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n var ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n var rs = new ReedSolomonEncoder(ecCount)\n\n var offset = 0\n var dcData = new Array(ecTotalBlocks)\n var ecData = new Array(ecTotalBlocks)\n var maxDataSize = 0\n var buffer = new Buffer(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (var b = 0; b < ecTotalBlocks; b++) {\n var dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n var data = new Buffer(totalCodewords)\n var index = 0\n var i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n var segments\n\n if (isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n var estimatedVersion = version\n\n if (!estimatedVersion) {\n var rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments,\n errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n var bestVersion = Version.getBestVersionForData(segments,\n errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n var dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n var moduleCount = Utils.getSymbolSize(version)\n var modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (!maskPattern) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n var errorCorrectionLevel = ECLevel.M\n var version\n var mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n\n\n/***/ }),\n\n/***/ \"X0RI\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Buffer = __webpack_require__(\"jF+B\")\nvar GF = __webpack_require__(\"NV47\")\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param {Buffer} p1 Polynomial\n * @param {Buffer} p2 Polynomial\n * @return {Buffer} Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n var coeff = new Buffer(p1.length + p2.length - 1)\n coeff.fill(0)\n\n for (var i = 0; i < p1.length; i++) {\n for (var j = 0; j < p2.length; j++) {\n coeff[i + j] ^= GF.mul(p1[i], p2[j])\n }\n }\n\n return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param {Buffer} divident Polynomial\n * @param {Buffer} divisor Polynomial\n * @return {Buffer} Remainder\n */\nexports.mod = function mod (divident, divisor) {\n var result = new Buffer(divident)\n\n while ((result.length - divisor.length) >= 0) {\n var coeff = result[0]\n\n for (var i = 0; i < divisor.length; i++) {\n result[i] ^= GF.mul(divisor[i], coeff)\n }\n\n // remove all zeros from buffer head\n var offset = 0\n while (offset < result.length && result[offset] === 0) offset++\n result = result.slice(offset)\n }\n\n return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param {Number} degree Degree of the generator polynomial\n * @return {Buffer} Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n var poly = new Buffer([1])\n for (var i = 0; i < degree; i++) {\n poly = exports.mul(poly, [1, GF.exp(i)])\n }\n\n return poly\n}\n\n\n/***/ }),\n\n/***/ \"YamF\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar getSymbolSize = __webpack_require__(\"oLzS\").getSymbolSize\nvar FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n var size = getSymbolSize(version)\n\n return [\n // top-left\n [0, 0],\n // top-right\n [size - FINDER_PATTERN_SIZE, 0],\n // bottom-left\n [0, size - FINDER_PATTERN_SIZE]\n ]\n}\n\n\n/***/ }),\n\n/***/ \"b2+w\":\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/******************************************************************************\n * Created 2008-08-19.\n *\n * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.\n *\n * Copyright (C) 2008\n * Wyatt Baldwin <self@wyattbaldwin.com>\n * All rights reserved\n *\n * Licensed under the MIT license.\n *\n * http://www.opensource.org/licenses/mit-license.php\n *\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\n * THE SOFTWARE.\n *****************************************************************************/\nvar dijkstra = {\n single_source_shortest_paths: function(graph, s, d) {\n // Predecessor map for each node that has been encountered.\n // node ID => predecessor node ID\n var predecessors = {};\n\n // Costs of shortest paths from s to all nodes encountered.\n // node ID => cost\n var costs = {};\n costs[s] = 0;\n\n // Costs of shortest paths from s to all nodes encountered; differs from\n // `costs` in that it provides easy access to the node that currently has\n // the known shortest path from s.\n // XXX: Do we actually need both `costs` and `open`?\n var open = dijkstra.PriorityQueue.make();\n open.push(s, 0);\n\n var closest,\n u, v,\n cost_of_s_to_u,\n adjacent_nodes,\n cost_of_e,\n cost_of_s_to_u_plus_cost_of_e,\n cost_of_s_to_v,\n first_visit;\n while (!open.empty()) {\n // In the nodes remaining in graph that have a known cost from s,\n // find the node, u, that currently has the shortest path from s.\n closest = open.pop();\n u = closest.value;\n cost_of_s_to_u = closest.cost;\n\n // Get nodes adjacent to u...\n adjacent_nodes = graph[u] || {};\n\n // ...and explore the edges that connect u to those nodes, updating\n // the cost of the shortest paths to any or all of those nodes as\n // necessary. v is the node across the current edge from u.\n for (v in adjacent_nodes) {\n if (adjacent_nodes.hasOwnProperty(v)) {\n // Get the cost of the edge running from u to v.\n cost_of_e = adjacent_nodes[v];\n\n // Cost of s to u plus the cost of u to v across e--this is *a*\n // cost from s to v that may or may not be less than the current\n // known cost to v.\n cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;\n\n // If we haven't visited v yet OR if the current known cost from s to\n // v is greater than the new cost we just found (cost of s to u plus\n // cost of u to v across e), update v's cost in the cost list and\n // update v's predecessor in the predecessor list (it's now u).\n cost_of_s_to_v = costs[v];\n first_visit = (typeof costs[v] === 'undefined');\n if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {\n costs[v] = cost_of_s_to_u_plus_cost_of_e;\n open.push(v, cost_of_s_to_u_plus_cost_of_e);\n predecessors[v] = u;\n }\n }\n }\n }\n\n if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {\n var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');\n throw new Error(msg);\n }\n\n return predecessors;\n },\n\n extract_shortest_path_from_predecessor_list: function(predecessors, d) {\n var nodes = [];\n var u = d;\n var predecessor;\n while (u) {\n nodes.push(u);\n predecessor = predecessors[u];\n u = predecessors[u];\n }\n nodes.reverse();\n return nodes;\n },\n\n find_path: function(graph, s, d) {\n var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);\n return dijkstra.extract_shortest_path_from_predecessor_list(\n predecessors, d);\n },\n\n /**\n * A very naive priority queue implementation.\n */\n PriorityQueue: {\n make: function (opts) {\n var T = dijkstra.PriorityQueue,\n t = {},\n key;\n opts = opts || {};\n for (key in T) {\n if (T.hasOwnProperty(key)) {\n t[key] = T[key];\n }\n }\n t.queue = [];\n t.sorter = opts.sorter || T.default_sorter;\n return t;\n },\n\n default_sorter: function (a, b) {\n return a.cost - b.cost;\n },\n\n /**\n * Add a new item to the queue and ensure the highest priority element\n * is at the front of the queue.\n */\n push: function (value, cost) {\n var item = {value: value, cost: cost};\n this.queue.push(item);\n this.queue.sort(this.sorter);\n },\n\n /**\n * Return the highest priority element in the queue.\n */\n pop: function () {\n return this.queue.shift();\n },\n\n empty: function () {\n return this.queue.length === 0;\n }\n }\n};\n\n\n// node.js module exports\nif (true) {\n module.exports = dijkstra;\n}\n\n\n/***/ }),\n\n/***/ \"g45I\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n/* harmony export (immutable) */ __webpack_exports__[\"a\"] = storeList;\n/* harmony export (immutable) */ __webpack_exports__[\"f\"] = storeAdd;\n/* harmony export (immutable) */ __webpack_exports__[\"b\"] = storeFind;\n/* harmony export (immutable) */ __webpack_exports__[\"c\"] = storeEdit;\n/* harmony export (immutable) */ __webpack_exports__[\"d\"] = storeOta;\n/* harmony export (immutable) */ __webpack_exports__[\"e\"] = storeDel;\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__utils_fetch__ = __webpack_require__(\"Vo7i\");\n\n// 门店列表\nfunction storeList(params) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/shop/list',\n method: 'get',\n params: params\n });\n}\n\n// 门店添加\nfunction storeAdd(params) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/unionService/shop/shop',\n method: 'post',\n data: params\n });\n}\n// 门店查询\nfunction storeFind(id) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/shop/detail?shopId=' + id,\n method: 'get'\n });\n}\n// 门店修改\nfunction storeEdit(par) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/unionService/shop/shop',\n method: 'put',\n data: par\n });\n}\n// 门店关联ota\nfunction storeOta(par) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/unionService/device/store',\n method: 'put',\n data: par\n });\n}\n\n// 门店删除\nfunction storeDel(id) {\n return __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__utils_fetch__[\"a\" /* default */])({\n url: '/service-org/shop/delete?shopId=' + id,\n method: 'DELETE'\n });\n}\n\n/***/ }),\n\n/***/ \"hqPG\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\nObject.defineProperty(__webpack_exports__, \"__esModule\", { value: true });\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_index_vue__ = __webpack_require__(\"7P5H\");\n/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_e79062fa_hasScoped_false_node_modules_vue_loader_lib_selector_type_template_index_0_index_vue__ = __webpack_require__(\"Oa9l\");\nvar normalizeComponent = __webpack_require__(\"VU/8\")\n/* script */\n\n/* template */\n\n/* styles */\nvar __vue_styles__ = null\n/* scopeId */\nvar __vue_scopeId__ = null\n/* moduleIdentifier (server only) */\nvar __vue_module_identifier__ = null\nvar Component = normalizeComponent(\n __WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_index_vue__[\"a\" /* default */],\n __WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_e79062fa_hasScoped_false_node_modules_vue_loader_lib_selector_type_template_index_0_index_vue__[\"a\" /* default */],\n __vue_styles__,\n __vue_scopeId__,\n __vue_module_identifier__\n)\n\n/* harmony default export */ __webpack_exports__[\"default\"] = (Component.exports);\n\n\n/***/ }),\n\n/***/ \"jF+B\":\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/**\n * Implementation of a subset of node.js Buffer methods for the browser.\n * Based on https://github.com/feross/buffer\n */\n\n/* eslint-disable no-proto */\n\n\n\nvar isArray = __webpack_require__(\"Dsid\")\n\nfunction typedArraySupport () {\n // Can typed array instances be augmented?\n try {\n var arr = new Uint8Array(1)\n arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nvar K_MAX_LENGTH = Buffer.TYPED_ARRAY_SUPPORT\n ? 0x7fffffff\n : 0x3fffffff\n\nfunction Buffer (arg, offset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, offset, length)\n }\n\n if (typeof arg === 'number') {\n return allocUnsafe(this, arg)\n }\n\n return from(this, arg, offset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n Buffer.prototype.__proto__ = Uint8Array.prototype\n Buffer.__proto__ = Uint8Array\n\n // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n if (typeof Symbol !== 'undefined' && Symbol.species &&\n Buffer[Symbol.species] === Buffer) {\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true,\n enumerable: false,\n writable: false\n })\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction isnan (val) {\n return val !== val // eslint-disable-line no-self-compare\n}\n\nfunction createBuffer (that, length) {\n var buf\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n buf = new Uint8Array(length)\n buf.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n buf = that\n if (buf === null) {\n buf = new Buffer(length)\n }\n buf.length = length\n }\n\n return buf\n}\n\nfunction allocUnsafe (that, size) {\n var buf = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n buf[i] = 0\n }\n }\n\n return buf\n}\n\nfunction fromString (that, string) {\n var length = byteLength(string) | 0\n var buf = createBuffer(that, length)\n\n var actual = buf.write(string)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (that, array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0\n var buf = createBuffer(that, length)\n for (var i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\\'offset\\' is out of bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\\'length\\' is out of bounds')\n }\n\n var buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n buf.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n buf = fromArrayLike(that, buf)\n }\n\n return buf\n}\n\nfunction fromObject (that, obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0\n var buf = createBuffer(that, len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj) {\n if ((typeof ArrayBuffer !== 'undefined' &&\n obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n if (typeof obj.length !== 'number' || isnan(obj.length)) {\n return createBuffer(that, 0)\n }\n return fromArrayLike(that, obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(that, obj.data)\n }\n }\n\n throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n var codePoint\n var length = string.length\n var leadSurrogate = null\n var bytes = []\n\n for (var i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction byteLength (string) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n string = '' + string\n }\n\n var len = string.length\n if (len === 0) return 0\n\n return utf8ToBytes(string).length\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n for (var i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction from (that, value, offset, length) {\n if (typeof value === 'number') {\n throw new TypeError('\"value\" argument must not be a number')\n }\n\n if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n return fromArrayBuffer(that, value, offset, length)\n }\n\n if (typeof value === 'string') {\n return fromString(that, value, offset)\n }\n\n return fromObject(that, value)\n}\n\nBuffer.prototype.write = function write (string, offset, length) {\n // Buffer#write(string)\n if (offset === undefined) {\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length])\n } else if (isFinite(offset)) {\n offset = offset | 0\n if (isFinite(length)) {\n length = length | 0\n } else {\n length = undefined\n }\n }\n\n var remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n return utf8Write(this, string, offset, length)\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n var len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n var newBuf\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n newBuf.__proto__ = Buffer.prototype\n } else {\n var sliceLen = end - start\n newBuf = new Buffer(sliceLen, undefined)\n for (var i = 0; i < sliceLen; ++i) {\n newBuf[i] = this[i + start]\n }\n }\n\n return newBuf\n}\n\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n var len = end - start\n var i\n\n if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start]\n }\n } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n // ascending copy from start\n for (i = 0; i < len; ++i) {\n target[i + targetStart] = this[i + start]\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, start + len),\n targetStart\n )\n }\n\n return len\n}\n\nBuffer.prototype.fill = function fill (val, start, end) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n end = this.length\n }\n if (val.length === 1) {\n var code = val.charCodeAt(0)\n if (code < 256) {\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n var i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n var bytes = Buffer.isBuffer(val)\n ? val\n : new Buffer(val)\n var len = bytes.length\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\nBuffer.concat = function concat (list, length) {\n if (!isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return createBuffer(null, 0)\n }\n\n var i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n var buffer = allocUnsafe(null, length)\n var pos = 0\n for (i = 0; i < list.length; ++i) {\n var buf = list[i]\n if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n buf.copy(buffer, pos)\n pos += buf.length\n }\n return buffer\n}\n\nBuffer.byteLength = byteLength\n\nBuffer.prototype._isBuffer = true\nBuffer.isBuffer = function isBuffer (b) {\n return !!(b != null && b._isBuffer)\n}\n\nmodule.exports = Buffer\n\n\n/***/ }),\n\n/***/ \"ljsv\":\n/***/ (function(module, exports) {\n\n/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nvar PenaltyScores = {\n N1: 3,\n N2: 3,\n N3: 40,\n N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param {Number} mask Mask pattern\n * @return {Boolean} true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n return mask && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param {Number|String} value Mask pattern value\n * @return {Number} Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n var size = data.size\n var points = 0\n var sameCountCol = 0\n var sameCountRow = 0\n var lastCol = null\n var lastRow = null\n\n for (var row = 0; row < size; row++) {\n sameCountCol = sameCountRow = 0\n lastCol = lastRow = null\n\n for (var col = 0; col < size; col++) {\n var module = data.get(row, col)\n if (module === lastCol) {\n sameCountCol++\n } else {\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n lastCol = module\n sameCountCol = 1\n }\n\n module = data.get(col, row)\n if (module === lastRow) {\n sameCountRow++\n } else {\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n lastRow = module\n sameCountRow = 1\n }\n }\n\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n }\n\n return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n var size = data.size\n var points = 0\n\n for (var row = 0; row < size - 1; row++) {\n for (var col = 0; col < size - 1; col++) {\n var last = data.get(row, col) +\n data.get(row, col + 1) +\n data.get(row + 1, col) +\n data.get(row + 1, col + 1)\n\n if (last === 4 || last === 0) points++\n }\n }\n\n return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n var size = data.size\n var points = 0\n var bitsCol = 0\n var bitsRow = 0\n\n for (var row = 0; row < size; row++) {\n bitsCol = bitsRow = 0\n for (var col = 0; col < size; col++) {\n bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n }\n }\n\n return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n var darkCount = 0\n var modulesCount = data.data.length\n\n for (var i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n var k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param {Number} maskPattern Pattern reference value\n * @param {Number} i Row\n * @param {Number} j Column\n * @return {Boolean} Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n switch (maskPattern) {\n case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n case exports.Patterns.PATTERN001: return i % 2 === 0\n case exports.Patterns.PATTERN010: return j % 3 === 0\n case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n default: throw new Error('bad maskPattern:' + maskPattern)\n }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param {Number} pattern Pattern reference number\n * @param {BitMatrix} data BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n var size = data.size\n\n for (var col = 0; col < size; col++) {\n for (var row = 0; row < size; row++) {\n if (data.isReserved(row, col)) continue\n data.xor(row, col, getMaskAt(pattern, row, col))\n }\n }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n var numPatterns = Object.keys(exports.Patterns).length\n var bestPattern = 0\n var lowerPenalty = Infinity\n\n for (var p = 0; p < numPatterns; p++) {\n setupFormatFunc(p)\n exports.applyMask(p, data)\n\n // Calculate penalty\n var penalty =\n exports.getPenaltyN1(data) +\n exports.getPenaltyN2(data) +\n exports.getPenaltyN3(data) +\n exports.getPenaltyN4(data)\n\n // Undo previously applied mask\n exports.applyMask(p, data)\n\n if (penalty < lowerPenalty) {\n lowerPenalty = penalty\n bestPattern = p\n }\n }\n\n return bestPattern\n}\n\n\n/***/ }),\n\n/***/ \"mulC\":\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(global) {\nmodule.exports = (typeof self === 'object' && self.self === self && self) ||\n (typeof global === 'object' && global.global === global && global) ||\n this\n\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(\"DuR2\")))\n\n/***/ }),\n\n/***/ \"mwnW\":\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar G = __webpack_require__(\"mulC\")\n\nmodule.exports = function() {\n return (\n typeof G.Promise === 'function' &&\n typeof G.Promise.prototype.then === 'function'\n )\n}\n\n\n/***/ }),\n\n/***/ \"nwDn\":\n/***/ (function(module, exports) {\n\nfunction hex2rgba (hex) {\n if (typeof hex !== 'string') {\n throw new Error('Color should be defined as hex string')\n }\n\n var hexCode = hex.slice().replace('#', '').split('')\n if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n throw new Error('Invalid hex color: ' + hex)\n }\n\n // Convert from short to long form (fff -> ffffff)\n if (hexCode.length === 3 || hexCode.length === 4) {\n hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n return [c, c]\n }))\n }\n\n // Add default alpha value\n if (hexCode.length === 6) hexCode.push('F', 'F')\n\n var hexValue = parseInt(hexCode.join(''), 16)\n\n return {\n r: (hexValue >> 24) & 255,\n g: (hexValue >> 16) & 255,\n b: (hexValue >> 8) & 255,\n a: hexValue & 255,\n hex: '#' + hexCode.slice(0, 6).join('')\n }\n}\n\nexports.getOptions = function getOptions (options) {\n if (!options) options = {}\n if (!options.color) options.color = {}\n\n var margin = typeof options.margin === 'undefined' ||\n options.margin === null ||\n options.margin < 0 ? 4 : options.margin\n\n var width = options.width && options.width >= 21 ? options.width : undefined\n var scale = options.scale || 4\n\n return {\n width: width,\n scale: width ? 4 : scale,\n margin: margin,\n color: {\n dark: hex2rgba(options.color.dark || '#000000ff'),\n light: hex2rgba(options.color.light || '#ffffffff')\n },\n type: options.type,\n rendererOpts: options.rendererOpts || {}\n }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n return opts.width && opts.width >= qrSize + opts.margin * 2\n ? opts.width / (qrSize + opts.margin * 2)\n : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n var scale = exports.getScale(qrSize, opts)\n return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n var size = qr.modules.size\n var data = qr.modules.data\n var scale = exports.getScale(size, opts)\n var symbolSize = Math.floor((size + opts.margin * 2) * scale)\n var scaledMargin = opts.margin * scale\n var palette = [opts.color.light, opts.color.dark]\n\n for (var i = 0; i < symbolSize; i++) {\n for (var j = 0; j < symbolSize; j++) {\n var posDst = (i * symbolSize + j) * 4\n var pxColor = opts.color.light\n\n if (i >= scaledMargin && j >= scaledMargin &&\n i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n var iSrc = Math.floor((i - scaledMargin) / scale)\n var jSrc = Math.floor((j - scaledMargin) / scale)\n pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n }\n\n imgData[posDst++] = pxColor.r\n imgData[posDst++] = pxColor.g\n imgData[posDst++] = pxColor.b\n imgData[posDst] = pxColor.a\n }\n }\n}\n\n\n/***/ }),\n\n/***/ \"nyx9\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Mode = __webpack_require__(\"uF9H\")\nvar NumericData = __webpack_require__(\"sYKs\")\nvar AlphanumericData = __webpack_require__(\"RO0P\")\nvar ByteData = __webpack_require__(\"vPzN\")\nvar KanjiData = __webpack_require__(\"zYqW\")\nvar Regex = __webpack_require__(\"NY/E\")\nvar Utils = __webpack_require__(\"oLzS\")\nvar dijkstra = __webpack_require__(\"b2+w\")\n\n/**\n * Returns UTF8 byte length\n *\n * @param {String} str Input string\n * @return {Number} Number of byte\n */\nfunction getStringByteLength (str) {\n return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param {Mode} mode Segment mode\n * @param {String} str String to process\n * @return {Array} Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n var segments = []\n var result\n\n while ((result = regex.exec(str)) !== null) {\n segments.push({\n data: result[0],\n index: result.index,\n mode: mode,\n length: result[0].length\n })\n }\n\n return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param {String} dataStr Input string\n * @return {Array} Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n var numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n var alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n var byteSegs\n var kanjiSegs\n\n if (Utils.isKanjiModeEnabled()) {\n byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n } else {\n byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n kanjiSegs = []\n }\n\n var segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n return segs\n .sort(function (s1, s2) {\n return s1.index - s2.index\n })\n .map(function (obj) {\n return {\n data: obj.data,\n mode: obj.mode,\n length: obj.length\n }\n })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param {Number} length String length\n * @param {Mode} mode Segment mode\n * @return {Number} Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n switch (mode) {\n case Mode.NUMERIC:\n return NumericData.getBitsLength(length)\n case Mode.ALPHANUMERIC:\n return AlphanumericData.getBitsLength(length)\n case Mode.KANJI:\n return KanjiData.getBitsLength(length)\n case Mode.BYTE:\n return ByteData.getBitsLength(length)\n }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction mergeSegments (segs) {\n return segs.reduce(function (acc, curr) {\n var prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n if (prevSeg && prevSeg.mode === curr.mode) {\n acc[acc.length - 1].data += curr.data\n return acc\n }\n\n acc.push(curr)\n return acc\n }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction buildNodes (segs) {\n var nodes = []\n for (var i = 0; i < segs.length; i++) {\n var seg = segs[i]\n\n switch (seg.mode) {\n case Mode.NUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.ALPHANUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.KANJI:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n break\n case Mode.BYTE:\n nodes.push([\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n }\n }\n\n return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param {Array} nodes Array of object with segments data\n * @param {Number} version QR Code version\n * @return {Object} Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n var table = {}\n var graph = {'start': {}}\n var prevNodeIds = ['start']\n\n for (var i = 0; i < nodes.length; i++) {\n var nodeGroup = nodes[i]\n var currentNodeIds = []\n\n for (var j = 0; j < nodeGroup.length; j++) {\n var node = nodeGroup[j]\n var key = '' + i + j\n\n currentNodeIds.push(key)\n table[key] = { node: node, lastCount: 0 }\n graph[key] = {}\n\n for (var n = 0; n < prevNodeIds.length; n++) {\n var prevNodeId = prevNodeIds[n]\n\n if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n graph[prevNodeId][key] =\n getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n table[prevNodeId].lastCount += node.length\n } else {\n if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n 4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n }\n }\n }\n\n prevNodeIds = currentNodeIds\n }\n\n for (n = 0; n < prevNodeIds.length; n++) {\n graph[prevNodeIds[n]]['end'] = 0\n }\n\n return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param {String} data Input data\n * @param {Mode | String} modesHint Data mode\n * @return {Segment} Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n var mode\n var bestMode = Mode.getBestModeForData(data)\n\n mode = Mode.from(modesHint, bestMode)\n\n // Make sure data can be encoded\n if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n throw new Error('\"' + data + '\"' +\n ' cannot be encoded with mode ' + Mode.toString(mode) +\n '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n }\n\n // Use Mode.BYTE if Kanji support is disabled\n if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n mode = Mode.BYTE\n }\n\n switch (mode) {\n case Mode.NUMERIC:\n return new NumericData(data)\n\n case Mode.ALPHANUMERIC:\n return new AlphanumericData(data)\n\n case Mode.KANJI:\n return new KanjiData(data)\n\n case Mode.BYTE:\n return new ByteData(data)\n }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param {Array} array Array of objects with segments data\n * @return {Array} Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n return array.reduce(function (acc, seg) {\n if (typeof seg === 'string') {\n acc.push(buildSingleSegment(seg, null))\n } else if (seg.data) {\n acc.push(buildSingleSegment(seg.data, seg.mode))\n }\n\n return acc\n }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @return {Array} Array of segments\n */\nexports.fromString = function fromString (data, version) {\n var segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n var nodes = buildNodes(segs)\n var graph = buildGraph(nodes, version)\n var path = dijkstra.find_path(graph.map, 'start', 'end')\n\n var optimizedSegs = []\n for (var i = 1; i < path.length - 1; i++) {\n optimizedSegs.push(graph.table[path[i]].node)\n }\n\n return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param {string} data Input string\n * @return {Array} Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n return exports.fromArray(\n getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n )\n}\n\n\n/***/ }),\n\n/***/ \"oLzS\":\n/***/ (function(module, exports) {\n\nvar toSJISFunction\nvar CODEWORDS_COUNT = [\n 0, // Not used\n 26, 44, 70, 100, 134, 172, 196, 242, 292, 346,\n 404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,\n 1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,\n 2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706\n]\n\n/**\n * Returns the QR Code size for the specified version\n *\n * @param {Number} version QR Code version\n * @return {Number} size of QR code\n */\nexports.getSymbolSize = function getSymbolSize (version) {\n if (!version) throw new Error('\"version\" cannot be null or undefined')\n if (version < 1 || version > 40) throw new Error('\"version\" should be in range from 1 to 40')\n return version * 4 + 17\n}\n\n/**\n * Returns the total number of codewords used to store data and EC information.\n *\n * @param {Number} version QR Code version\n * @return {Number} Data length in bits\n */\nexports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {\n return CODEWORDS_COUNT[version]\n}\n\n/**\n * Encode data with Bose-Chaudhuri-Hocquenghem\n *\n * @param {Number} data Value to encode\n * @return {Number} Encoded value\n */\nexports.getBCHDigit = function (data) {\n var digit = 0\n\n while (data !== 0) {\n digit++\n data >>>= 1\n }\n\n return digit\n}\n\nexports.setToSJISFunction = function setToSJISFunction (f) {\n if (typeof f !== 'function') {\n throw new Error('\"toSJISFunc\" is not a valid function.')\n }\n\n toSJISFunction = f\n}\n\nexports.isKanjiModeEnabled = function () {\n return typeof toSJISFunction !== 'undefined'\n}\n\nexports.toSJIS = function toSJIS (kanji) {\n return toSJISFunction(kanji)\n}\n\n\n/***/ }),\n\n/***/ \"sYKs\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Mode = __webpack_require__(\"uF9H\")\n\nfunction NumericData (data) {\n this.mode = Mode.NUMERIC\n this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n var i, group, value\n\n // The input data string is divided into groups of three digits,\n // and each group is converted to its 10-bit binary equivalent.\n for (i = 0; i + 3 <= this.data.length; i += 3) {\n group = this.data.substr(i, 3)\n value = parseInt(group, 10)\n\n bitBuffer.put(value, 10)\n }\n\n // If the number of input digits is not an exact multiple of three,\n // the final one or two digits are converted to 4 or 7 bits respectively.\n var remainingNum = this.data.length - i\n if (remainingNum > 0) {\n group = this.data.substr(i)\n value = parseInt(group, 10)\n\n bitBuffer.put(value, remainingNum * 3 + 1)\n }\n}\n\nmodule.exports = NumericData\n\n\n/***/ }),\n\n/***/ \"uF9H\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Version = __webpack_require__(\"1Y2G\")\nvar Regex = __webpack_require__(\"NY/E\")\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n id: 'Numeric',\n bit: 1 << 0,\n ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n * 26 alphabetic characters (A - Z),\n * and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n id: 'Alphanumeric',\n bit: 1 << 1,\n ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n id: 'Byte',\n bit: 1 << 2,\n ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n id: 'Kanji',\n bit: 1 << 3,\n ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param {Mode} mode Data mode\n * @param {Number} version QR Code version\n * @return {Number} Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n if (!Version.isValid(version)) {\n throw new Error('Invalid version: ' + version)\n }\n\n if (version >= 1 && version < 10) return mode.ccBits[0]\n else if (version < 27) return mode.ccBits[1]\n return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param {String} dataStr Input data string\n * @return {Mode} Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n else if (Regex.testKanji(dataStr)) return exports.KANJI\n else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String} Mode name\n */\nexports.toString = function toString (mode) {\n if (mode && mode.id) return mode.id\n throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param {Mode} mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param {String} string Mode name\n * @returns {Mode} Mode object\n */\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n var lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'numeric':\n return exports.NUMERIC\n case 'alphanumeric':\n return exports.ALPHANUMERIC\n case 'kanji':\n return exports.KANJI\n case 'byte':\n return exports.BYTE\n default:\n throw new Error('Unknown mode: ' + string)\n }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param {Mode|String} value Encoding mode\n * @param {Mode} defaultValue Fallback value\n * @return {Mode} Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n\n\n/***/ }),\n\n/***/ \"utyv\":\n/***/ (function(module, exports) {\n\nexports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n var lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'l':\n case 'low':\n return exports.L\n\n case 'm':\n case 'medium':\n return exports.M\n\n case 'q':\n case 'quartile':\n return exports.Q\n\n case 'h':\n case 'high':\n return exports.H\n\n default:\n throw new Error('Unknown EC Level: ' + string)\n }\n}\n\nexports.isValid = function isValid (level) {\n return level && typeof level.bit !== 'undefined' &&\n level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n\n\n/***/ }),\n\n/***/ \"vPzN\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Buffer = __webpack_require__(\"jF+B\")\nvar Mode = __webpack_require__(\"uF9H\")\n\nfunction ByteData (data) {\n this.mode = Mode.BYTE\n this.data = new Buffer(data)\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n for (var i = 0, l = this.data.length; i < l; i++) {\n bitBuffer.put(this.data[i], 8)\n }\n}\n\nmodule.exports = ByteData\n\n\n/***/ }),\n\n/***/ \"wBZN\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Buffer = __webpack_require__(\"jF+B\")\nvar Polynomial = __webpack_require__(\"X0RI\")\n\nfunction ReedSolomonEncoder (degree) {\n this.genPoly = undefined\n this.degree = degree\n\n if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n // create an irreducible generator polynomial\n this.degree = degree\n this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param {Buffer} data Buffer containing input data\n * @return {Buffer} Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n if (!this.genPoly) {\n throw new Error('Encoder not initialized')\n }\n\n // Calculate EC for this data block\n // extends data size to data+genPoly size\n var pad = new Buffer(this.degree)\n pad.fill(0)\n var paddedData = Buffer.concat([data, pad], data.length + this.degree)\n\n // The error correction codewords are the remainder after dividing the data codewords\n // by a generator polynomial\n var remainder = Polynomial.mod(paddedData, this.genPoly)\n\n // return EC data blocks (last n byte, where n is the degree of genPoly)\n // If coefficients number in remainder are less than genPoly degree,\n // pad with 0s to the left to reach the needed number of coefficients\n var start = this.degree - remainder.length\n if (start > 0) {\n var buff = new Buffer(this.degree)\n buff.fill(0)\n remainder.copy(buff, start)\n\n return buff\n }\n\n return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n\n\n/***/ }),\n\n/***/ \"xR/K\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Utils = __webpack_require__(\"oLzS\")\n\nvar G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nvar G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nvar G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Number} mask Mask pattern\n * @return {Number} Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n var data = ((errorCorrectionLevel.bit << 3) | mask)\n var d = data << 10\n\n while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n }\n\n // xor final data with mask pattern in order to ensure that\n // no combination of Error Correction Level and data mask pattern\n // will result in an all-zero data string\n return ((data << 10) | d) ^ G15_MASK\n}\n\n\n/***/ }),\n\n/***/ \"zYqW\":\n/***/ (function(module, exports, __webpack_require__) {\n\nvar Mode = __webpack_require__(\"uF9H\")\nvar Utils = __webpack_require__(\"oLzS\")\n\nfunction KanjiData (data) {\n this.mode = Mode.KANJI\n this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n var i\n\n // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n // These byte values are shifted from the JIS X 0208 values.\n // JIS X 0208 gives details of the shift coded representation.\n for (i = 0; i < this.data.length; i++) {\n var value = Utils.toSJIS(this.data[i])\n\n // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n if (value >= 0x8140 && value <= 0x9FFC) {\n // Subtract 0x8140 from Shift JIS value\n value -= 0x8140\n\n // For characters with Shift JIS values from 0xE040 to 0xEBBF\n } else if (value >= 0xE040 && value <= 0xEBBF) {\n // Subtract 0xC140 from Shift JIS value\n value -= 0xC140\n } else {\n throw new Error(\n 'Invalid SJIS character: ' + this.data[i] + '\\n' +\n 'Make sure your charset is UTF-8')\n }\n\n // Multiply most significant byte of result by 0xC0\n // and add least significant byte to product\n value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n // Convert result to a 13-bit binary string\n bitBuffer.put(value, 13)\n }\n}\n\nmodule.exports = KanjiData\n\n\n/***/ })\n\n});\n\n\n// WEBPACK FOOTER //\n// static/js/0.024758f495f2ab9d932f.js","var Utils = require('./utils')\nvar ECCode = require('./error-correction-code')\nvar ECLevel = require('./error-correction-level')\nvar Mode = require('./mode')\nvar isArray = require('isarray')\n\n// Generator polynomial used to encode version information\nvar G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)\nvar G18_BCH = Utils.getBCHDigit(G18)\n\nfunction getBestVersionForDataLength (mode, length, errorCorrectionLevel) {\n for (var currentVersion = 1; currentVersion <= 40; currentVersion++) {\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\nfunction getReservedBitsCount (mode, version) {\n // Character count indicator + mode indicator bits\n return Mode.getCharCountIndicator(mode, version) + 4\n}\n\nfunction getTotalBitsFromDataArray (segments, version) {\n var totalBits = 0\n\n segments.forEach(function (data) {\n var reservedBits = getReservedBitsCount(data.mode, version)\n totalBits += reservedBits + data.getBitsLength()\n })\n\n return totalBits\n}\n\nfunction getBestVersionForMixedData (segments, errorCorrectionLevel) {\n for (var currentVersion = 1; currentVersion <= 40; currentVersion++) {\n var length = getTotalBitsFromDataArray(segments, currentVersion)\n if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {\n return currentVersion\n }\n }\n\n return undefined\n}\n\n/**\n * Check if QR Code version is valid\n *\n * @param {Number} version QR Code version\n * @return {Boolean} true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n return !isNaN(version) && version >= 1 && version <= 40\n}\n\n/**\n * Returns version number from a value.\n * If value is not a valid version, returns defaultValue\n *\n * @param {Number|String} value QR Code version\n * @param {Number} defaultValue Fallback value\n * @return {Number} QR Code version number\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return parseInt(value, 10)\n }\n\n return defaultValue\n}\n\n/**\n * Returns how much data can be stored with the specified QR code version\n * and error correction level\n *\n * @param {Number} version QR Code version (1-40)\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} Quantity of storable data\n */\nexports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {\n if (!exports.isValid(version)) {\n throw new Error('Invalid QR Code version')\n }\n\n // Use Byte mode as default\n if (typeof mode === 'undefined') mode = Mode.BYTE\n\n // Total codewords for this QR code version (Data + Error correction)\n var totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n var ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n var dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n if (mode === Mode.MIXED) return dataTotalCodewordsBits\n\n var usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)\n\n // Return max number of storable codewords\n switch (mode) {\n case Mode.NUMERIC:\n return Math.floor((usableBits / 10) * 3)\n\n case Mode.ALPHANUMERIC:\n return Math.floor((usableBits / 11) * 2)\n\n case Mode.KANJI:\n return Math.floor(usableBits / 13)\n\n case Mode.BYTE:\n default:\n return Math.floor(usableBits / 8)\n }\n}\n\n/**\n * Returns the minimum version needed to contain the amount of data\n *\n * @param {Segment} data Segment of data\n * @param {Number} [errorCorrectionLevel=H] Error correction level\n * @param {Mode} mode Data mode\n * @return {Number} QR Code version\n */\nexports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {\n var seg\n\n var ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)\n\n if (isArray(data)) {\n if (data.length > 1) {\n return getBestVersionForMixedData(data, ecl)\n }\n\n if (data.length === 0) {\n return 1\n }\n\n seg = data[0]\n } else {\n seg = data\n }\n\n return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)\n}\n\n/**\n * Returns version information with relative error correction bits\n *\n * The version information is included in QR Code symbols of version 7 or larger.\n * It consists of an 18-bit sequence containing 6 data bits,\n * with 12 error correction bits calculated using the (18, 6) Golay code.\n *\n * @param {Number} version QR Code version\n * @return {Number} Encoded version info bits\n */\nexports.getEncodedBits = function getEncodedBits (version) {\n if (!exports.isValid(version) || version < 7) {\n throw new Error('Invalid QR Code version')\n }\n\n var d = version << 12\n\n while (Utils.getBCHDigit(d) - G18_BCH >= 0) {\n d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))\n }\n\n return (version << 12) | d\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/version.js\n// module id = 1Y2G\n// module chunks = 0 1","var canPromise = require('can-promise')\nvar QRCode = require('./core/qrcode')\nvar CanvasRenderer = require('./renderer/canvas')\nvar SvgRenderer = require('./renderer/svg-tag.js')\n\nfunction renderCanvas (renderFunc, canvas, text, opts, cb) {\n var args = [].slice.call(arguments, 1)\n var argsNum = args.length\n var isLastArgCb = typeof args[argsNum - 1] === 'function'\n\n if (!isLastArgCb && !canPromise()) {\n throw new Error('Callback required as last argument')\n }\n\n if (isLastArgCb) {\n if (argsNum < 2) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 2) {\n cb = text\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 3) {\n if (canvas.getContext && typeof cb === 'undefined') {\n cb = opts\n opts = undefined\n } else {\n cb = opts\n opts = text\n text = canvas\n canvas = undefined\n }\n }\n } else {\n if (argsNum < 1) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 1) {\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 2 && !canvas.getContext) {\n opts = text\n text = canvas\n canvas = undefined\n }\n\n return new Promise(function (resolve, reject) {\n try {\n var data = QRCode.create(text, opts)\n resolve(renderFunc(data, canvas, opts))\n } catch (e) {\n reject(e)\n }\n })\n }\n\n try {\n var data = QRCode.create(text, opts)\n cb(null, renderFunc(data, canvas, opts))\n } catch (e) {\n cb(e)\n }\n}\n\nexports.create = QRCode.create\nexports.toCanvas = renderCanvas.bind(null, CanvasRenderer.render)\nexports.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL)\n\n// only svg for now.\nexports.toString = renderCanvas.bind(null, function (data, _, opts) {\n return SvgRenderer.render(data, opts)\n})\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/browser.js\n// module id = 71e1\n// module chunks = 0 1","var Utils = require('./utils')\n\nfunction getColorAttrib (color, attrib) {\n var alpha = color.a / 255\n var str = attrib + '=\"' + color.hex + '\"'\n\n return alpha < 1\n ? str + ' ' + attrib + '-opacity=\"' + alpha.toFixed(2).slice(1) + '\"'\n : str\n}\n\nfunction svgCmd (cmd, x, y) {\n var str = cmd + x\n if (typeof y !== 'undefined') str += ' ' + y\n\n return str\n}\n\nfunction qrToPath (data, size, margin) {\n var path = ''\n var moveBy = 0\n var newRow = false\n var lineLength = 0\n\n for (var i = 0; i < data.length; i++) {\n var col = Math.floor(i % size)\n var row = Math.floor(i / size)\n\n if (!col && !newRow) newRow = true\n\n if (data[i]) {\n lineLength++\n\n if (!(i > 0 && col > 0 && data[i - 1])) {\n path += newRow\n ? svgCmd('M', col + margin, 0.5 + row + margin)\n : svgCmd('m', moveBy, 0)\n\n moveBy = 0\n newRow = false\n }\n\n if (!(col + 1 < size && data[i + 1])) {\n path += svgCmd('h', lineLength)\n lineLength = 0\n }\n } else {\n moveBy++\n }\n }\n\n return path\n}\n\nexports.render = function render (qrData, options, cb) {\n var opts = Utils.getOptions(options)\n var size = qrData.modules.size\n var data = qrData.modules.data\n var qrcodesize = size + opts.margin * 2\n\n var bg = !opts.color.light.a\n ? ''\n : '<path ' + getColorAttrib(opts.color.light, 'fill') +\n ' d=\"M0 0h' + qrcodesize + 'v' + qrcodesize + 'H0z\"/>'\n\n var path =\n '<path ' + getColorAttrib(opts.color.dark, 'stroke') +\n ' d=\"' + qrToPath(data, size, opts.margin) + '\"/>'\n\n var viewBox = 'viewBox=\"' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '\"'\n\n var width = !opts.width ? '' : 'width=\"' + opts.width + '\" height=\"' + opts.width + '\" '\n\n var svgTag = '<svg xmlns=\"http://www.w3.org/2000/svg\" ' + width + viewBox + '>' + bg + path + '</svg>'\n\n if (typeof cb === 'function') {\n cb(null, svgTag)\n }\n\n return svgTag\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/renderer/svg-tag.js\n// module id = 729m\n// module chunks = 0 1","<template>\r\n <div class=\"app-container\">\r\n <el-form :model=\"ruleForm\" ref=\"ruleForm\" label-width=\"20px\">\r\n <el-form-item label=\"\" prop=\"org\">\r\n <el-select v-model=\"ruleForm.store\" placeholder=\"门店\" filterable @change=\"shopChange\">\r\n <el-option v-for=\"shopvo in shopList\" :label=\"shopvo.name\" :value=\"shopvo.id\"\r\n :key=\"shopvo.id\"></el-option>\r\n </el-select>\r\n </el-form-item>\r\n </el-form>\r\n <div class=\"listbutton\">\r\n <el-button type=\"primary\" @click=\"addTable()\">添加餐桌</el-button> <router-link to=\"tableGroup\"><el-button type=\"primary\" >桌分组管理</el-button></router-link>\r\n </div>\r\n\r\n <el-dialog title=\"\" :visible.sync=\"dialogFormVisible\">\r\n <el-form :model=\"form\" :rules=\"rule\" ref=\"form\">\r\n <el-form-item label=\"桌号\" label-width=\"13%\" prop=\"tableName\">\r\n <el-input v-model=\"form.tableName\"></el-input>\r\n </el-form-item>\r\n <el-form-item label=\"分组\" label-width=\"13%\" prop=\"groupId\">\r\n <el-select v-model=\"form.groupId\" placeholder=\"分组\" >\r\n <el-option v-for=\"groupvo in grouplist\" :label=\"groupvo.groupName\" :value=\"groupvo.id\"\r\n :key=\"groupvo.id\"></el-option>\r\n </el-select>\r\n\r\n </el-form-item>\r\n <el-form-item label=\"就餐人数\" label-width=\"13%\" prop=\"seats\">\r\n <el-input placeholder=\"就餐人数\" v-model.trim=\"form.seats\" style=\"width: 200px\" >\r\n <template slot=\"append\">人</template>\r\n </el-input>\r\n </el-form-item>\r\n <el-form-item label=\"备注\" label-width=\"13%\" prop=\"comment\">\r\n <el-input v-model=\"form.comment\"></el-input>\r\n </el-form-item>\r\n </el-form>\r\n <div slot=\"footer\" class=\"dialog-footer\">\r\n <el-button @click=\"dialogFormVisible = false\">取 消</el-button>\r\n <el-button type=\"primary\" @click=\"subTable\">确 定</el-button>\r\n </div>\r\n </el-dialog>\r\n <el-table :data=\"list\" element-loading-text=\"拼命加载中\" border fit size=\"small\">\r\n <el-table-column align=\"center\" label='桌号' prop=\"tableName\" width=\"200px\">\r\n </el-table-column>\r\n <el-table-column align=\"center\" label='分组' prop=\"groupId\" width=\"200px\">\r\n <template slot-scope=\"scope\">\r\n {{scope.row.groupId | tranGroupName(grouplist)}}\r\n </template>\r\n </el-table-column>\r\n <el-table-column align=\"center\" label='就餐人数' prop=\"seats\" width=\"100px\">\r\n </el-table-column>\r\n <el-table-column align=\"center\" label='二维码' width=\"350px\">\r\n <template slot-scope=\"scope\">\r\n <el-button type=\"text\" @click=\"downQrcode(scope.row.id,100)\">100像素</el-button>\r\n <el-button type=\"text\" @click=\"downQrcode(scope.row.id,200)\">200像素</el-button>\r\n <el-button type=\"text\" @click=\"downQrcode(scope.row.id,500)\">500像素</el-button>\r\n <el-button type=\"text\" @click=\"downQrcode(scope.row.id,1024)\">1024像素</el-button>\r\n </template>\r\n </el-table-column>\r\n <el-table-column align=\"center\" label='备注' prop=\"comment\">\r\n </el-table-column>\r\n\r\n <el-table-column align=\"center\" label='操作' width=\"200px\">\r\n <template slot-scope=\"scope\">\r\n <el-button type=\"primary\" size=\"small\" @click=\"updateTable(scope.row)\">编辑</el-button>\r\n <el-button type=\"danger\" size=\"small\" @click=\"delTable(scope.row.id)\">删除</el-button>\r\n </template>\r\n </el-table-column>\r\n </el-table>\r\n\r\n <el-dialog\r\n :title=\"title\"\r\n :visible.sync=\"dialogVisible\"\r\n width=\"25%\">\r\n <span><img :src=\"img\" width=\"100%\">\r\n </span>\r\n <span slot=\"footer\" class=\"dialog-footer\">\r\n <a :href=\"img\" :download=\"downname\"> <el-button type=\"primary\">{{width}}X{{width}}下载</el-button></a>\r\n </span>\r\n </el-dialog>\r\n </div>\r\n</template>\r\n<script>\r\n import QRCode from 'qrcode'\r\n import {storeList} from \"@/api/marketing/shop/store\";\r\n import {tableList, tableSub, tableDel} from \"@/api/marketing/shop/table\";\r\n import {tableGroupList} from \"@/api/marketing/shop/tableGroup\";\r\n\r\n export default {\r\n created() {\r\n storeList({org: this.ruleForm.org}).then(response => {\r\n this.shopList = response.result.rows;\r\n this.ruleForm.store = this.shopList[0].id;\r\n this.selectlist()\r\n });\r\n },\r\n computed: {\r\n \"downname\": function () {\r\n return this.width + \"X\" + this.width + \".png\"\r\n }\r\n },\r\n watch:{\r\n \"ruleForm.store\":function (id) {\r\n tableGroupList(id).then(response => {\r\n this.grouplist = response.result\r\n });\r\n }\r\n },\r\n filters: {\r\n tranGroupName(id, shoplist) {\r\n var name = ''\r\n shoplist.forEach(function (x, index) {\r\n if (x.id == id) {\r\n name = x.groupName\r\n }\r\n });\r\n return name\r\n }\r\n },\r\n data() {\r\n return {\r\n dialogVisible: false,\r\n img: \"\",\r\n width: '',\r\n title: \"\",\r\n grouplist:[],\r\n usertype: this.$store.getters.usertype,\r\n ruleForm: {\r\n org: this.$store.getters.orgId,\r\n store: '',\r\n },\r\n form: {\r\n tableName: '',\r\n seats: '',\r\n groupId: '-1',\r\n comment: ''\r\n },\r\n manageList: [],\r\n shopList: [],\r\n list: [],\r\n dialogFormVisible: false,\r\n rule: {\r\n tableName: [\r\n {required: true, message: '请输桌号', trigger: 'blur'},\r\n// {min: 6, max: 30, message: '密码长度错误', trigger: 'blur'},\r\n ],\r\n seats: [\r\n {pattern: /^([1-9][0-9]{0,1})?$/, message: '就餐人数必须为整数且最多99人', trigger: 'blur'},\r\n ],\r\n },\r\n }\r\n },\r\n methods: {\r\n downQrcode(id, width) {\r\n // var text = process.env.BASE_API + \"/service-org/tables/jump/\" + id\r\n var text = process.env.BASE_API + \"service-trade/order/wxOrderPage?shopId=\"+this.ruleForm.store+\"&table=\"+id\r\n // console.log(text)\r\n QRCode.toDataURL(text, {errorCorrectionLevel: 'H', width: width})\r\n .then(url => {\r\n this.dialogVisible = true\r\n this.img = url\r\n this.width = width\r\n })\r\n .catch(err => {\r\n })\r\n },\r\n shopChange() {\r\n this.selectlist()\r\n },\r\n selectlist() {\r\n tableList(this.ruleForm.store).then(response => {\r\n this.list = response.result\r\n });\r\n\r\n },\r\n addTable() {\r\n this.form = {\r\n tableName: '',\r\n groupId: -1,\r\n comment: ''\r\n },\r\n this.dialogFormVisible = true\r\n },\r\n updateTable(item) {\r\n this.form = {\r\n id: item.id,\r\n tableName: item.tableName,\r\n comment: item.comment,\r\n seats: item.seats,\r\n groupId: item.groupId,\r\n }\r\n this.dialogFormVisible = true\r\n },\r\n\r\n delTable(id) {\r\n this.$confirm('此操作将删除您所选的数据, 是否继续?', '', {\r\n type: 'warning',\r\n center: true\r\n }).then(() => {\r\n tableDel(id).then(response => {\r\n this.selectlist()\r\n });\r\n }).catch(() => {\r\n });\r\n },\r\n subTable() {\r\n this.$refs['form'].validate((valid) => {\r\n if (valid) {\r\n this.form.shopId = this.ruleForm.store\r\n tableSub(this.form).then(response => {\r\n this.dialogFormVisible = false\r\n this.selectlist()\r\n });\r\n } else {\r\n return false;\r\n }\r\n })\r\n }\r\n },\r\n\r\n }\r\n</script>\r\n\n\n\n// WEBPACK FOOTER //\n// src/views/marketing/shop/table/index.vue?32fb81b1","var Utils = require('./utils')\n\nfunction clearCanvas (ctx, canvas, size) {\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n if (!canvas.style) canvas.style = {}\n canvas.height = size\n canvas.width = size\n canvas.style.height = size + 'px'\n canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n try {\n return document.createElement('canvas')\n } catch (e) {\n throw new Error('You need to specify a canvas element')\n }\n}\n\nexports.render = function render (qrData, canvas, options) {\n var opts = options\n var canvasEl = canvas\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!canvas) {\n canvasEl = getCanvasElement()\n }\n\n opts = Utils.getOptions(opts)\n var size = Utils.getImageWidth(qrData.modules.size, opts)\n\n var ctx = canvasEl.getContext('2d')\n var image = ctx.createImageData(size, size)\n Utils.qrToImageData(image.data, qrData, opts)\n\n clearCanvas(ctx, canvasEl, size)\n ctx.putImageData(image, 0, 0)\n\n return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n var opts = options\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!opts) opts = {}\n\n var canvasEl = exports.render(qrData, canvas, opts)\n\n var type = opts.type || 'image/png'\n var rendererOpts = opts.rendererOpts || {}\n\n return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/renderer/canvas.js\n// module id = 9ff9\n// module chunks = 0 1","/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nvar getSymbolSize = require('./utils').getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n if (version === 1) return []\n\n var posCount = Math.floor(version / 7) + 2\n var size = getSymbolSize(version)\n var intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n var positions = [size - 7] // Last coord is always (size - 7)\n\n for (var i = 1; i < posCount - 1; i++) {\n positions[i] = positions[i - 1] - intervals\n }\n\n positions.push(6) // First coord is always 6\n\n return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * var pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n var coords = []\n var pos = exports.getRowColCoords(version)\n var posLength = pos.length\n\n for (var i = 0; i < posLength; i++) {\n for (var j = 0; j < posLength; j++) {\n // Skip if position is occupied by finder patterns\n if ((i === 0 && j === 0) || // top-left\n (i === 0 && j === posLength - 1) || // bottom-left\n (i === posLength - 1 && j === 0)) { // top-right\n continue\n }\n\n coords.push([pos[i], pos[j]])\n }\n }\n\n return coords\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/alignment-pattern.js\n// module id = 9jEu\n// module chunks = 0 1","function BitBuffer () {\n this.buffer = []\n this.length = 0\n}\n\nBitBuffer.prototype = {\n\n get: function (index) {\n var bufIndex = Math.floor(index / 8)\n return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n },\n\n put: function (num, length) {\n for (var i = 0; i < length; i++) {\n this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n }\n },\n\n getLengthInBits: function () {\n return this.length\n },\n\n putBit: function (bit) {\n var bufIndex = Math.floor(this.length / 8)\n if (this.buffer.length <= bufIndex) {\n this.buffer.push(0)\n }\n\n if (bit) {\n this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n }\n\n this.length++\n }\n}\n\nmodule.exports = BitBuffer\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/bit-buffer.js\n// module id = DEuz\n// module chunks = 0 1","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/~/isarray/index.js\n// module id = Dsid\n// module chunks = 0 1","import fetch from '@/utils/fetch'\r\n\r\n// 餐桌列表\r\nexport function tableGroupList(shopid) {\r\n return fetch({\r\n url: '/service-org/tableGroups/shop/' + shopid,\r\n // url: 'https://easy-mock.com/mock/5a5ee345dec01f1bea369aee/service-org/tables/shop/',\r\n method: 'get',\r\n })\r\n}\r\n\r\n// 餐桌添加修改\r\nexport function tableSub(params) {\r\n var method = 'post'\r\n if (params.id) {\r\n method = 'put'\r\n return fetch({\r\n url: '/service-org/tableGroups',\r\n method: method,\r\n params\r\n })\r\n }else{\r\n return fetch({\r\n url: '/service-org/tableGroups',\r\n method: method,\r\n data:params\r\n })\r\n }\r\n\r\n}\r\n\r\n// 餐桌删除\r\nexport function tableDel(id) {\r\n return fetch({\r\n url: '/service-org/tableGroups/' + id,\r\n method: 'delete',\r\n\r\n })\r\n}\r\n\r\n\n\n\n// WEBPACK FOOTER //\n// ./src/api/marketing/shop/tableGroup.js","var Buffer = require('../utils/buffer')\n\nvar EXP_TABLE = new Buffer(512)\nvar LOG_TABLE = new Buffer(256)\n\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n var x = 1\n for (var i = 0; i < 255; i++) {\n EXP_TABLE[i] = x\n LOG_TABLE[x] = i\n\n x <<= 1 // multiply by 2\n\n // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n x ^= 0x11D\n }\n }\n\n // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n // stay inside the bounds (because we will mainly use this table for the multiplication of\n // two GF numbers, no more).\n // @see {@link mul}\n for (i = 255; i < 512; i++) {\n EXP_TABLE[i] = EXP_TABLE[i - 255]\n }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n if (n < 1) throw new Error('log(' + n + ')')\n return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param {Number} x\n * @param {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n if (x === 0 || y === 0) return 0\n\n // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n // @see {@link initTables}\n return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/galois-field.js\n// module id = NV47\n// module chunks = 0 1","var numeric = '[0-9]+'\nvar alphanumeric = '[A-Z $%*+\\\\-./:]+'\nvar kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nvar byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ').)+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nvar TEST_KANJI = new RegExp('^' + kanji + '$')\nvar TEST_NUMERIC = new RegExp('^' + numeric + '$')\nvar TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n return TEST_ALPHANUMERIC.test(str)\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/regex.js\n// module id = NY/E\n// module chunks = 0 1","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;\n return _c('div', {\n staticClass: \"app-container\"\n }, [_c('el-form', {\n ref: \"ruleForm\",\n attrs: {\n \"model\": _vm.ruleForm,\n \"label-width\": \"20px\"\n }\n }, [_c('el-form-item', {\n attrs: {\n \"label\": \"\",\n \"prop\": \"org\"\n }\n }, [_c('el-select', {\n attrs: {\n \"placeholder\": \"门店\",\n \"filterable\": \"\"\n },\n on: {\n \"change\": _vm.shopChange\n },\n model: {\n value: (_vm.ruleForm.store),\n callback: function($$v) {\n _vm.$set(_vm.ruleForm, \"store\", $$v)\n },\n expression: \"ruleForm.store\"\n }\n }, _vm._l((_vm.shopList), function(shopvo) {\n return _c('el-option', {\n key: shopvo.id,\n attrs: {\n \"label\": shopvo.name,\n \"value\": shopvo.id\n }\n })\n }))], 1)], 1), _vm._v(\" \"), _c('div', {\n staticClass: \"listbutton\"\n }, [_c('el-button', {\n attrs: {\n \"type\": \"primary\"\n },\n on: {\n \"click\": function($event) {\n _vm.addTable()\n }\n }\n }, [_vm._v(\"添加餐桌\")]), _vm._v(\" \"), _c('router-link', {\n attrs: {\n \"to\": \"tableGroup\"\n }\n }, [_c('el-button', {\n attrs: {\n \"type\": \"primary\"\n }\n }, [_vm._v(\"桌分组管理\")])], 1)], 1), _vm._v(\" \"), _c('el-dialog', {\n attrs: {\n \"title\": \"\",\n \"visible\": _vm.dialogFormVisible\n },\n on: {\n \"update:visible\": function($event) {\n _vm.dialogFormVisible = $event\n }\n }\n }, [_c('el-form', {\n ref: \"form\",\n attrs: {\n \"model\": _vm.form,\n \"rules\": _vm.rule\n }\n }, [_c('el-form-item', {\n attrs: {\n \"label\": \"桌号\",\n \"label-width\": \"13%\",\n \"prop\": \"tableName\"\n }\n }, [_c('el-input', {\n model: {\n value: (_vm.form.tableName),\n callback: function($$v) {\n _vm.$set(_vm.form, \"tableName\", $$v)\n },\n expression: \"form.tableName\"\n }\n })], 1), _vm._v(\" \"), _c('el-form-item', {\n attrs: {\n \"label\": \"分组\",\n \"label-width\": \"13%\",\n \"prop\": \"groupId\"\n }\n }, [_c('el-select', {\n attrs: {\n \"placeholder\": \"分组\"\n },\n model: {\n value: (_vm.form.groupId),\n callback: function($$v) {\n _vm.$set(_vm.form, \"groupId\", $$v)\n },\n expression: \"form.groupId\"\n }\n }, _vm._l((_vm.grouplist), function(groupvo) {\n return _c('el-option', {\n key: groupvo.id,\n attrs: {\n \"label\": groupvo.groupName,\n \"value\": groupvo.id\n }\n })\n }))], 1), _vm._v(\" \"), _c('el-form-item', {\n attrs: {\n \"label\": \"就餐人数\",\n \"label-width\": \"13%\",\n \"prop\": \"seats\"\n }\n }, [_c('el-input', {\n staticStyle: {\n \"width\": \"200px\"\n },\n attrs: {\n \"placeholder\": \"就餐人数\"\n },\n model: {\n value: (_vm.form.seats),\n callback: function($$v) {\n _vm.$set(_vm.form, \"seats\", (typeof $$v === 'string' ? $$v.trim() : $$v))\n },\n expression: \"form.seats\"\n }\n }, [_c('template', {\n slot: \"append\"\n }, [_vm._v(\"人\")])], 2)], 1), _vm._v(\" \"), _c('el-form-item', {\n attrs: {\n \"label\": \"备注\",\n \"label-width\": \"13%\",\n \"prop\": \"comment\"\n }\n }, [_c('el-input', {\n model: {\n value: (_vm.form.comment),\n callback: function($$v) {\n _vm.$set(_vm.form, \"comment\", $$v)\n },\n expression: \"form.comment\"\n }\n })], 1)], 1), _vm._v(\" \"), _c('div', {\n staticClass: \"dialog-footer\",\n attrs: {\n \"slot\": \"footer\"\n },\n slot: \"footer\"\n }, [_c('el-button', {\n on: {\n \"click\": function($event) {\n _vm.dialogFormVisible = false\n }\n }\n }, [_vm._v(\"取 消\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"primary\"\n },\n on: {\n \"click\": _vm.subTable\n }\n }, [_vm._v(\"确 定\")])], 1)], 1), _vm._v(\" \"), _c('el-table', {\n attrs: {\n \"data\": _vm.list,\n \"element-loading-text\": \"拼命加载中\",\n \"border\": \"\",\n \"fit\": \"\",\n \"size\": \"small\"\n }\n }, [_c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"桌号\",\n \"prop\": \"tableName\",\n \"width\": \"200px\"\n }\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"分组\",\n \"prop\": \"groupId\",\n \"width\": \"200px\"\n },\n scopedSlots: _vm._u([{\n key: \"default\",\n fn: function(scope) {\n return [_vm._v(\"\\n \" + _vm._s(_vm._f(\"tranGroupName\")(scope.row.groupId, _vm.grouplist)) + \"\\n \")]\n }\n }])\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"就餐人数\",\n \"prop\": \"seats\",\n \"width\": \"100px\"\n }\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"二维码\",\n \"width\": \"350px\"\n },\n scopedSlots: _vm._u([{\n key: \"default\",\n fn: function(scope) {\n return [_c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 100)\n }\n }\n }, [_vm._v(\"100像素\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 200)\n }\n }\n }, [_vm._v(\"200像素\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 500)\n }\n }\n }, [_vm._v(\"500像素\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"text\"\n },\n on: {\n \"click\": function($event) {\n _vm.downQrcode(scope.row.id, 1024)\n }\n }\n }, [_vm._v(\"1024像素\")])]\n }\n }])\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"备注\",\n \"prop\": \"comment\"\n }\n }), _vm._v(\" \"), _c('el-table-column', {\n attrs: {\n \"align\": \"center\",\n \"label\": \"操作\",\n \"width\": \"200px\"\n },\n scopedSlots: _vm._u([{\n key: \"default\",\n fn: function(scope) {\n return [_c('el-button', {\n attrs: {\n \"type\": \"primary\",\n \"size\": \"small\"\n },\n on: {\n \"click\": function($event) {\n _vm.updateTable(scope.row)\n }\n }\n }, [_vm._v(\"编辑\")]), _vm._v(\" \"), _c('el-button', {\n attrs: {\n \"type\": \"danger\",\n \"size\": \"small\"\n },\n on: {\n \"click\": function($event) {\n _vm.delTable(scope.row.id)\n }\n }\n }, [_vm._v(\"删除\")])]\n }\n }])\n })], 1), _vm._v(\" \"), _c('el-dialog', {\n attrs: {\n \"title\": _vm.title,\n \"visible\": _vm.dialogVisible,\n \"width\": \"25%\"\n },\n on: {\n \"update:visible\": function($event) {\n _vm.dialogVisible = $event\n }\n }\n }, [_c('span', [_c('img', {\n attrs: {\n \"src\": _vm.img,\n \"width\": \"100%\"\n }\n })]), _vm._v(\" \"), _c('span', {\n staticClass: \"dialog-footer\",\n attrs: {\n \"slot\": \"footer\"\n },\n slot: \"footer\"\n }, [_c('a', {\n attrs: {\n \"href\": _vm.img,\n \"download\": _vm.downname\n }\n }, [_c('el-button', {\n attrs: {\n \"type\": \"primary\"\n }\n }, [_vm._v(_vm._s(_vm.width) + \"X\" + _vm._s(_vm.width) + \"下载\")])], 1)])])], 1)\n}\nvar staticRenderFns = []\nvar esExports = { render: render, staticRenderFns: staticRenderFns }\nexport default esExports\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/vue-loader/lib/template-compiler?{\"id\":\"data-v-e79062fa\",\"hasScoped\":false}!./~/vue-loader/lib/selector.js?type=template&index=0!./src/views/marketing/shop/table/index.vue\n// module id = Oa9l\n// module chunks = 0","var Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nvar ALPHA_NUM_CHARS = [\n '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n this.mode = Mode.ALPHANUMERIC\n this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n var i\n\n // Input data characters are divided into groups of two characters\n // and encoded as 11-bit binary codes.\n for (i = 0; i + 2 <= this.data.length; i += 2) {\n // The character value of the first character is multiplied by 45\n var value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n // The character value of the second digit is added to the product\n value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n // The sum is then stored as 11-bit binary number\n bitBuffer.put(value, 11)\n }\n\n // If the number of input data characters is not a multiple of two,\n // the character value of the final character is encoded as a 6-bit binary number.\n if (this.data.length % 2) {\n bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n }\n}\n\nmodule.exports = AlphanumericData\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/alphanumeric-data.js\n// module id = RO0P\n// module chunks = 0 1","var Buffer = require('../utils/buffer')\n\n/**\n * Helper class to handle QR Code symbol modules\n *\n * @param {Number} size Symbol size\n */\nfunction BitMatrix (size) {\n if (!size || size < 1) {\n throw new Error('BitMatrix size must be defined and greater than 0')\n }\n\n this.size = size\n this.data = new Buffer(size * size)\n this.data.fill(0)\n this.reservedBit = new Buffer(size * size)\n this.reservedBit.fill(0)\n}\n\n/**\n * Set bit value at specified location\n * If reserved flag is set, this bit will be ignored during masking process\n *\n * @param {Number} row\n * @param {Number} col\n * @param {Boolean} value\n * @param {Boolean} reserved\n */\nBitMatrix.prototype.set = function (row, col, value, reserved) {\n var index = row * this.size + col\n this.data[index] = value\n if (reserved) this.reservedBit[index] = true\n}\n\n/**\n * Returns bit value at specified location\n *\n * @param {Number} row\n * @param {Number} col\n * @return {Boolean}\n */\nBitMatrix.prototype.get = function (row, col) {\n return this.data[row * this.size + col]\n}\n\n/**\n * Applies xor operator at specified location\n * (used during masking process)\n *\n * @param {Number} row\n * @param {Number} col\n * @param {Boolean} value\n */\nBitMatrix.prototype.xor = function (row, col, value) {\n this.data[row * this.size + col] ^= value\n}\n\n/**\n * Check if bit at specified location is reserved\n *\n * @param {Number} row\n * @param {Number} col\n * @return {Boolean}\n */\nBitMatrix.prototype.isReserved = function (row, col) {\n return this.reservedBit[row * this.size + col]\n}\n\nmodule.exports = BitMatrix\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/bit-matrix.js\n// module id = RY9c\n// module chunks = 0 1","var ECLevel = require('./error-correction-level')\r\n\r\nvar EC_BLOCKS_TABLE = [\r\n// L M Q H\r\n 1, 1, 1, 1,\r\n 1, 1, 1, 1,\r\n 1, 1, 2, 2,\r\n 1, 2, 2, 4,\r\n 1, 2, 4, 4,\r\n 2, 4, 4, 4,\r\n 2, 4, 6, 5,\r\n 2, 4, 6, 6,\r\n 2, 5, 8, 8,\r\n 4, 5, 8, 8,\r\n 4, 5, 8, 11,\r\n 4, 8, 10, 11,\r\n 4, 9, 12, 16,\r\n 4, 9, 16, 16,\r\n 6, 10, 12, 18,\r\n 6, 10, 17, 16,\r\n 6, 11, 16, 19,\r\n 6, 13, 18, 21,\r\n 7, 14, 21, 25,\r\n 8, 16, 20, 25,\r\n 8, 17, 23, 25,\r\n 9, 17, 23, 34,\r\n 9, 18, 25, 30,\r\n 10, 20, 27, 32,\r\n 12, 21, 29, 35,\r\n 12, 23, 34, 37,\r\n 12, 25, 34, 40,\r\n 13, 26, 35, 42,\r\n 14, 28, 38, 45,\r\n 15, 29, 40, 48,\r\n 16, 31, 43, 51,\r\n 17, 33, 45, 54,\r\n 18, 35, 48, 57,\r\n 19, 37, 51, 60,\r\n 19, 38, 53, 63,\r\n 20, 40, 56, 66,\r\n 21, 43, 59, 70,\r\n 22, 45, 62, 74,\r\n 24, 47, 65, 77,\r\n 25, 49, 68, 81\r\n]\r\n\r\nvar EC_CODEWORDS_TABLE = [\r\n// L M Q H\r\n 7, 10, 13, 17,\r\n 10, 16, 22, 28,\r\n 15, 26, 36, 44,\r\n 20, 36, 52, 64,\r\n 26, 48, 72, 88,\r\n 36, 64, 96, 112,\r\n 40, 72, 108, 130,\r\n 48, 88, 132, 156,\r\n 60, 110, 160, 192,\r\n 72, 130, 192, 224,\r\n 80, 150, 224, 264,\r\n 96, 176, 260, 308,\r\n 104, 198, 288, 352,\r\n 120, 216, 320, 384,\r\n 132, 240, 360, 432,\r\n 144, 280, 408, 480,\r\n 168, 308, 448, 532,\r\n 180, 338, 504, 588,\r\n 196, 364, 546, 650,\r\n 224, 416, 600, 700,\r\n 224, 442, 644, 750,\r\n 252, 476, 690, 816,\r\n 270, 504, 750, 900,\r\n 300, 560, 810, 960,\r\n 312, 588, 870, 1050,\r\n 336, 644, 952, 1110,\r\n 360, 700, 1020, 1200,\r\n 390, 728, 1050, 1260,\r\n 420, 784, 1140, 1350,\r\n 450, 812, 1200, 1440,\r\n 480, 868, 1290, 1530,\r\n 510, 924, 1350, 1620,\r\n 540, 980, 1440, 1710,\r\n 570, 1036, 1530, 1800,\r\n 570, 1064, 1590, 1890,\r\n 600, 1120, 1680, 1980,\r\n 630, 1204, 1770, 2100,\r\n 660, 1260, 1860, 2220,\r\n 720, 1316, 1950, 2310,\r\n 750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param {Number} version QR Code version\r\n * @param {Number} errorCorrectionLevel Error correction level\r\n * @return {Number} Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n switch (errorCorrectionLevel) {\r\n case ECLevel.L:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n case ECLevel.M:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n case ECLevel.Q:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n case ECLevel.H:\r\n return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n default:\r\n return undefined\r\n }\r\n}\r\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/error-correction-code.js\n// module id = Sd0T\n// module chunks = 0 1","import fetch from '@/utils/fetch'\r\n\r\n// 餐桌列表\r\nexport function tableList(shopid) {\r\n return fetch({\r\n url: '/service-org/tables/shop/' + shopid,\r\n // url: 'https://easy-mock.com/mock/5a5ee345dec01f1bea369aee/service-org/tables/shop/',\r\n method: 'get',\r\n })\r\n}\r\n\r\n// 餐桌添加修改\r\nexport function tableSub(params) {\r\n var method = 'post'\r\n if (params.id) {\r\n method = 'put'\r\n }\r\n return fetch({\r\n url: '/service-org/tables',\r\n method: method,\r\n params\r\n })\r\n}\r\n\r\n// 餐桌删除\r\nexport function tableDel(id) {\r\n return fetch({\r\n url: '/service-org/tables/' + id,\r\n method: 'delete',\r\n\r\n })\r\n}\r\n\r\n\n\n\n// WEBPACK FOOTER //\n// ./src/api/marketing/shop/table.js","var Buffer = require('../utils/buffer')\nvar Utils = require('./utils')\nvar ECLevel = require('./error-correction-level')\nvar BitBuffer = require('./bit-buffer')\nvar BitMatrix = require('./bit-matrix')\nvar AlignmentPattern = require('./alignment-pattern')\nvar FinderPattern = require('./finder-pattern')\nvar MaskPattern = require('./mask-pattern')\nvar ECCode = require('./error-correction-code')\nvar ReedSolomonEncoder = require('./reed-solomon-encoder')\nvar Version = require('./version')\nvar FormatInfo = require('./format-info')\nvar Mode = require('./mode')\nvar Segments = require('./segments')\nvar isArray = require('isarray')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n var size = matrix.size\n var pos = FinderPattern.getPositions(version)\n\n for (var i = 0; i < pos.length; i++) {\n var row = pos[i][0]\n var col = pos[i][1]\n\n for (var r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (var c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n var size = matrix.size\n\n for (var r = 8; r < size - 8; r++) {\n var value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n var pos = AlignmentPattern.getPositions(version)\n\n for (var i = 0; i < pos.length; i++) {\n var row = pos[i][0]\n var col = pos[i][1]\n\n for (var r = -2; r <= 2; r++) {\n for (var c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n var size = matrix.size\n var bits = Version.getEncodedBits(version)\n var row, col, mod\n\n for (var i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n var size = matrix.size\n var bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n var i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Buffer} data Data codewords\n */\nfunction setupData (matrix, data) {\n var size = matrix.size\n var inc = -1\n var row = size - 1\n var bitIndex = 7\n var byteIndex = 0\n\n for (var col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (var c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n var dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Buffer} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n var buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n var totalCodewords = Utils.getSymbolTotalCodewords(version)\n var ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n var dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n var remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (var i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Buffer} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n var totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n var ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n var dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n var ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n var blocksInGroup2 = totalCodewords % ecTotalBlocks\n var blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n var totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n var dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n var dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n var ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n var rs = new ReedSolomonEncoder(ecCount)\n\n var offset = 0\n var dcData = new Array(ecTotalBlocks)\n var ecData = new Array(ecTotalBlocks)\n var maxDataSize = 0\n var buffer = new Buffer(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (var b = 0; b < ecTotalBlocks; b++) {\n var dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n var data = new Buffer(totalCodewords)\n var index = 0\n var i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n var segments\n\n if (isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n var estimatedVersion = version\n\n if (!estimatedVersion) {\n var rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments,\n errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n var bestVersion = Version.getBestVersionForData(segments,\n errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n var dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n var moduleCount = Utils.getSymbolSize(version)\n var modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (!maskPattern) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n var errorCorrectionLevel = ECLevel.M\n var version\n var mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/qrcode.js\n// module id = WEzc\n// module chunks = 0 1","var Buffer = require('../utils/buffer')\nvar GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param {Buffer} p1 Polynomial\n * @param {Buffer} p2 Polynomial\n * @return {Buffer} Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n var coeff = new Buffer(p1.length + p2.length - 1)\n coeff.fill(0)\n\n for (var i = 0; i < p1.length; i++) {\n for (var j = 0; j < p2.length; j++) {\n coeff[i + j] ^= GF.mul(p1[i], p2[j])\n }\n }\n\n return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param {Buffer} divident Polynomial\n * @param {Buffer} divisor Polynomial\n * @return {Buffer} Remainder\n */\nexports.mod = function mod (divident, divisor) {\n var result = new Buffer(divident)\n\n while ((result.length - divisor.length) >= 0) {\n var coeff = result[0]\n\n for (var i = 0; i < divisor.length; i++) {\n result[i] ^= GF.mul(divisor[i], coeff)\n }\n\n // remove all zeros from buffer head\n var offset = 0\n while (offset < result.length && result[offset] === 0) offset++\n result = result.slice(offset)\n }\n\n return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param {Number} degree Degree of the generator polynomial\n * @return {Buffer} Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n var poly = new Buffer([1])\n for (var i = 0; i < degree; i++) {\n poly = exports.mul(poly, [1, GF.exp(i)])\n }\n\n return poly\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/polynomial.js\n// module id = X0RI\n// module chunks = 0 1","var getSymbolSize = require('./utils').getSymbolSize\nvar FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n var size = getSymbolSize(version)\n\n return [\n // top-left\n [0, 0],\n // top-right\n [size - FINDER_PATTERN_SIZE, 0],\n // bottom-left\n [0, size - FINDER_PATTERN_SIZE]\n ]\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/finder-pattern.js\n// module id = YamF\n// module chunks = 0 1","'use strict';\n\n/******************************************************************************\n * Created 2008-08-19.\n *\n * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.\n *\n * Copyright (C) 2008\n * Wyatt Baldwin <self@wyattbaldwin.com>\n * All rights reserved\n *\n * Licensed under the MIT license.\n *\n * http://www.opensource.org/licenses/mit-license.php\n *\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\n * THE SOFTWARE.\n *****************************************************************************/\nvar dijkstra = {\n single_source_shortest_paths: function(graph, s, d) {\n // Predecessor map for each node that has been encountered.\n // node ID => predecessor node ID\n var predecessors = {};\n\n // Costs of shortest paths from s to all nodes encountered.\n // node ID => cost\n var costs = {};\n costs[s] = 0;\n\n // Costs of shortest paths from s to all nodes encountered; differs from\n // `costs` in that it provides easy access to the node that currently has\n // the known shortest path from s.\n // XXX: Do we actually need both `costs` and `open`?\n var open = dijkstra.PriorityQueue.make();\n open.push(s, 0);\n\n var closest,\n u, v,\n cost_of_s_to_u,\n adjacent_nodes,\n cost_of_e,\n cost_of_s_to_u_plus_cost_of_e,\n cost_of_s_to_v,\n first_visit;\n while (!open.empty()) {\n // In the nodes remaining in graph that have a known cost from s,\n // find the node, u, that currently has the shortest path from s.\n closest = open.pop();\n u = closest.value;\n cost_of_s_to_u = closest.cost;\n\n // Get nodes adjacent to u...\n adjacent_nodes = graph[u] || {};\n\n // ...and explore the edges that connect u to those nodes, updating\n // the cost of the shortest paths to any or all of those nodes as\n // necessary. v is the node across the current edge from u.\n for (v in adjacent_nodes) {\n if (adjacent_nodes.hasOwnProperty(v)) {\n // Get the cost of the edge running from u to v.\n cost_of_e = adjacent_nodes[v];\n\n // Cost of s to u plus the cost of u to v across e--this is *a*\n // cost from s to v that may or may not be less than the current\n // known cost to v.\n cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;\n\n // If we haven't visited v yet OR if the current known cost from s to\n // v is greater than the new cost we just found (cost of s to u plus\n // cost of u to v across e), update v's cost in the cost list and\n // update v's predecessor in the predecessor list (it's now u).\n cost_of_s_to_v = costs[v];\n first_visit = (typeof costs[v] === 'undefined');\n if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {\n costs[v] = cost_of_s_to_u_plus_cost_of_e;\n open.push(v, cost_of_s_to_u_plus_cost_of_e);\n predecessors[v] = u;\n }\n }\n }\n }\n\n if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {\n var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');\n throw new Error(msg);\n }\n\n return predecessors;\n },\n\n extract_shortest_path_from_predecessor_list: function(predecessors, d) {\n var nodes = [];\n var u = d;\n var predecessor;\n while (u) {\n nodes.push(u);\n predecessor = predecessors[u];\n u = predecessors[u];\n }\n nodes.reverse();\n return nodes;\n },\n\n find_path: function(graph, s, d) {\n var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);\n return dijkstra.extract_shortest_path_from_predecessor_list(\n predecessors, d);\n },\n\n /**\n * A very naive priority queue implementation.\n */\n PriorityQueue: {\n make: function (opts) {\n var T = dijkstra.PriorityQueue,\n t = {},\n key;\n opts = opts || {};\n for (key in T) {\n if (T.hasOwnProperty(key)) {\n t[key] = T[key];\n }\n }\n t.queue = [];\n t.sorter = opts.sorter || T.default_sorter;\n return t;\n },\n\n default_sorter: function (a, b) {\n return a.cost - b.cost;\n },\n\n /**\n * Add a new item to the queue and ensure the highest priority element\n * is at the front of the queue.\n */\n push: function (value, cost) {\n var item = {value: value, cost: cost};\n this.queue.push(item);\n this.queue.sort(this.sorter);\n },\n\n /**\n * Return the highest priority element in the queue.\n */\n pop: function () {\n return this.queue.shift();\n },\n\n empty: function () {\n return this.queue.length === 0;\n }\n }\n};\n\n\n// node.js module exports\nif (typeof module !== 'undefined') {\n module.exports = dijkstra;\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/dijkstrajs/dijkstra.js\n// module id = b2+w\n// module chunks = 0 1","import fetch from '@/utils/fetch'\r\n// 门店列表\r\nexport function storeList(params) {\r\n return fetch({\r\n url: '/service-org/shop/list',\r\n method: 'get',\r\n params\r\n })\r\n}\r\n\r\n// 门店添加\r\nexport function storeAdd(params) {\r\n return fetch({\r\n url: '/unionService/shop/shop',\r\n method: 'post',\r\n data: params\r\n })\r\n}\r\n// 门店查询\r\nexport function storeFind(id) {\r\n return fetch({\r\n url: '/service-org/shop/detail?shopId=' + id,\r\n method: 'get'\r\n })\r\n}\r\n// 门店修改\r\nexport function storeEdit(par) {\r\n return fetch({\r\n url: '/unionService/shop/shop',\r\n method: 'put',\r\n data: par\r\n })\r\n}\r\n// 门店关联ota\r\nexport function storeOta(par) {\r\n return fetch({\r\n url: '/unionService/device/store',\r\n method: 'put',\r\n data: par\r\n })\r\n}\r\n\r\n// 门店删除\r\nexport function storeDel(id) {\r\n return fetch({\r\n url: '/service-org/shop/delete?shopId=' + id,\r\n method: 'DELETE'\r\n })\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./src/api/marketing/shop/store.js","var normalizeComponent = require(\"!../../../../../node_modules/vue-loader/lib/component-normalizer\")\n/* script */\nimport __vue_script__ from \"!!babel-loader!../../../../../node_modules/vue-loader/lib/selector?type=script&index=0!./index.vue\"\n/* template */\nimport __vue_template__ from \"!!../../../../../node_modules/vue-loader/lib/template-compiler/index?{\\\"id\\\":\\\"data-v-e79062fa\\\",\\\"hasScoped\\\":false}!../../../../../node_modules/vue-loader/lib/selector?type=template&index=0!./index.vue\"\n/* styles */\nvar __vue_styles__ = null\n/* scopeId */\nvar __vue_scopeId__ = null\n/* moduleIdentifier (server only) */\nvar __vue_module_identifier__ = null\nvar Component = normalizeComponent(\n __vue_script__,\n __vue_template__,\n __vue_styles__,\n __vue_scopeId__,\n __vue_module_identifier__\n)\n\nexport default Component.exports\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/views/marketing/shop/table/index.vue\n// module id = hqPG\n// module chunks = 0","/**\n * Implementation of a subset of node.js Buffer methods for the browser.\n * Based on https://github.com/feross/buffer\n */\n\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar isArray = require('isarray')\n\nfunction typedArraySupport () {\n // Can typed array instances be augmented?\n try {\n var arr = new Uint8Array(1)\n arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nvar K_MAX_LENGTH = Buffer.TYPED_ARRAY_SUPPORT\n ? 0x7fffffff\n : 0x3fffffff\n\nfunction Buffer (arg, offset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, offset, length)\n }\n\n if (typeof arg === 'number') {\n return allocUnsafe(this, arg)\n }\n\n return from(this, arg, offset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n Buffer.prototype.__proto__ = Uint8Array.prototype\n Buffer.__proto__ = Uint8Array\n\n // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n if (typeof Symbol !== 'undefined' && Symbol.species &&\n Buffer[Symbol.species] === Buffer) {\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true,\n enumerable: false,\n writable: false\n })\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction isnan (val) {\n return val !== val // eslint-disable-line no-self-compare\n}\n\nfunction createBuffer (that, length) {\n var buf\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n buf = new Uint8Array(length)\n buf.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n buf = that\n if (buf === null) {\n buf = new Buffer(length)\n }\n buf.length = length\n }\n\n return buf\n}\n\nfunction allocUnsafe (that, size) {\n var buf = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n buf[i] = 0\n }\n }\n\n return buf\n}\n\nfunction fromString (that, string) {\n var length = byteLength(string) | 0\n var buf = createBuffer(that, length)\n\n var actual = buf.write(string)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (that, array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0\n var buf = createBuffer(that, length)\n for (var i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\\'offset\\' is out of bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\\'length\\' is out of bounds')\n }\n\n var buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n buf.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n buf = fromArrayLike(that, buf)\n }\n\n return buf\n}\n\nfunction fromObject (that, obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0\n var buf = createBuffer(that, len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj) {\n if ((typeof ArrayBuffer !== 'undefined' &&\n obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n if (typeof obj.length !== 'number' || isnan(obj.length)) {\n return createBuffer(that, 0)\n }\n return fromArrayLike(that, obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(that, obj.data)\n }\n }\n\n throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n var codePoint\n var length = string.length\n var leadSurrogate = null\n var bytes = []\n\n for (var i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction byteLength (string) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n string = '' + string\n }\n\n var len = string.length\n if (len === 0) return 0\n\n return utf8ToBytes(string).length\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n for (var i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction from (that, value, offset, length) {\n if (typeof value === 'number') {\n throw new TypeError('\"value\" argument must not be a number')\n }\n\n if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n return fromArrayBuffer(that, value, offset, length)\n }\n\n if (typeof value === 'string') {\n return fromString(that, value, offset)\n }\n\n return fromObject(that, value)\n}\n\nBuffer.prototype.write = function write (string, offset, length) {\n // Buffer#write(string)\n if (offset === undefined) {\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length])\n } else if (isFinite(offset)) {\n offset = offset | 0\n if (isFinite(length)) {\n length = length | 0\n } else {\n length = undefined\n }\n }\n\n var remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n return utf8Write(this, string, offset, length)\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n var len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n var newBuf\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n newBuf.__proto__ = Buffer.prototype\n } else {\n var sliceLen = end - start\n newBuf = new Buffer(sliceLen, undefined)\n for (var i = 0; i < sliceLen; ++i) {\n newBuf[i] = this[i + start]\n }\n }\n\n return newBuf\n}\n\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n var len = end - start\n var i\n\n if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start]\n }\n } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n // ascending copy from start\n for (i = 0; i < len; ++i) {\n target[i + targetStart] = this[i + start]\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, start + len),\n targetStart\n )\n }\n\n return len\n}\n\nBuffer.prototype.fill = function fill (val, start, end) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n end = this.length\n }\n if (val.length === 1) {\n var code = val.charCodeAt(0)\n if (code < 256) {\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n var i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n var bytes = Buffer.isBuffer(val)\n ? val\n : new Buffer(val)\n var len = bytes.length\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\nBuffer.concat = function concat (list, length) {\n if (!isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return createBuffer(null, 0)\n }\n\n var i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n var buffer = allocUnsafe(null, length)\n var pos = 0\n for (i = 0; i < list.length; ++i) {\n var buf = list[i]\n if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n buf.copy(buffer, pos)\n pos += buf.length\n }\n return buffer\n}\n\nBuffer.byteLength = byteLength\n\nBuffer.prototype._isBuffer = true\nBuffer.isBuffer = function isBuffer (b) {\n return !!(b != null && b._isBuffer)\n}\n\nmodule.exports = Buffer\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/utils/typedarray-buffer.js\n// module id = jF+B\n// module chunks = 0 1","/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nvar PenaltyScores = {\n N1: 3,\n N2: 3,\n N3: 40,\n N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param {Number} mask Mask pattern\n * @return {Boolean} true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n return mask && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param {Number|String} value Mask pattern value\n * @return {Number} Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n var size = data.size\n var points = 0\n var sameCountCol = 0\n var sameCountRow = 0\n var lastCol = null\n var lastRow = null\n\n for (var row = 0; row < size; row++) {\n sameCountCol = sameCountRow = 0\n lastCol = lastRow = null\n\n for (var col = 0; col < size; col++) {\n var module = data.get(row, col)\n if (module === lastCol) {\n sameCountCol++\n } else {\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n lastCol = module\n sameCountCol = 1\n }\n\n module = data.get(col, row)\n if (module === lastRow) {\n sameCountRow++\n } else {\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n lastRow = module\n sameCountRow = 1\n }\n }\n\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n }\n\n return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n var size = data.size\n var points = 0\n\n for (var row = 0; row < size - 1; row++) {\n for (var col = 0; col < size - 1; col++) {\n var last = data.get(row, col) +\n data.get(row, col + 1) +\n data.get(row + 1, col) +\n data.get(row + 1, col + 1)\n\n if (last === 4 || last === 0) points++\n }\n }\n\n return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n var size = data.size\n var points = 0\n var bitsCol = 0\n var bitsRow = 0\n\n for (var row = 0; row < size; row++) {\n bitsCol = bitsRow = 0\n for (var col = 0; col < size; col++) {\n bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n }\n }\n\n return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n var darkCount = 0\n var modulesCount = data.data.length\n\n for (var i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n var k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param {Number} maskPattern Pattern reference value\n * @param {Number} i Row\n * @param {Number} j Column\n * @return {Boolean} Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n switch (maskPattern) {\n case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n case exports.Patterns.PATTERN001: return i % 2 === 0\n case exports.Patterns.PATTERN010: return j % 3 === 0\n case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n default: throw new Error('bad maskPattern:' + maskPattern)\n }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param {Number} pattern Pattern reference number\n * @param {BitMatrix} data BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n var size = data.size\n\n for (var col = 0; col < size; col++) {\n for (var row = 0; row < size; row++) {\n if (data.isReserved(row, col)) continue\n data.xor(row, col, getMaskAt(pattern, row, col))\n }\n }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n var numPatterns = Object.keys(exports.Patterns).length\n var bestPattern = 0\n var lowerPenalty = Infinity\n\n for (var p = 0; p < numPatterns; p++) {\n setupFormatFunc(p)\n exports.applyMask(p, data)\n\n // Calculate penalty\n var penalty =\n exports.getPenaltyN1(data) +\n exports.getPenaltyN2(data) +\n exports.getPenaltyN3(data) +\n exports.getPenaltyN4(data)\n\n // Undo previously applied mask\n exports.applyMask(p, data)\n\n if (penalty < lowerPenalty) {\n lowerPenalty = penalty\n bestPattern = p\n }\n }\n\n return bestPattern\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/mask-pattern.js\n// module id = ljsv\n// module chunks = 0 1","'use strict'\nmodule.exports = (typeof self === 'object' && self.self === self && self) ||\n (typeof global === 'object' && global.global === global && global) ||\n this\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/window-or-global/lib/index.js\n// module id = mulC\n// module chunks = 0 1","'use strict'\n\nvar G = require('window-or-global')\n\nmodule.exports = function() {\n return (\n typeof G.Promise === 'function' &&\n typeof G.Promise.prototype.then === 'function'\n )\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/can-promise/index.js\n// module id = mwnW\n// module chunks = 0 1","function hex2rgba (hex) {\n if (typeof hex !== 'string') {\n throw new Error('Color should be defined as hex string')\n }\n\n var hexCode = hex.slice().replace('#', '').split('')\n if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n throw new Error('Invalid hex color: ' + hex)\n }\n\n // Convert from short to long form (fff -> ffffff)\n if (hexCode.length === 3 || hexCode.length === 4) {\n hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n return [c, c]\n }))\n }\n\n // Add default alpha value\n if (hexCode.length === 6) hexCode.push('F', 'F')\n\n var hexValue = parseInt(hexCode.join(''), 16)\n\n return {\n r: (hexValue >> 24) & 255,\n g: (hexValue >> 16) & 255,\n b: (hexValue >> 8) & 255,\n a: hexValue & 255,\n hex: '#' + hexCode.slice(0, 6).join('')\n }\n}\n\nexports.getOptions = function getOptions (options) {\n if (!options) options = {}\n if (!options.color) options.color = {}\n\n var margin = typeof options.margin === 'undefined' ||\n options.margin === null ||\n options.margin < 0 ? 4 : options.margin\n\n var width = options.width && options.width >= 21 ? options.width : undefined\n var scale = options.scale || 4\n\n return {\n width: width,\n scale: width ? 4 : scale,\n margin: margin,\n color: {\n dark: hex2rgba(options.color.dark || '#000000ff'),\n light: hex2rgba(options.color.light || '#ffffffff')\n },\n type: options.type,\n rendererOpts: options.rendererOpts || {}\n }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n return opts.width && opts.width >= qrSize + opts.margin * 2\n ? opts.width / (qrSize + opts.margin * 2)\n : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n var scale = exports.getScale(qrSize, opts)\n return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n var size = qr.modules.size\n var data = qr.modules.data\n var scale = exports.getScale(size, opts)\n var symbolSize = Math.floor((size + opts.margin * 2) * scale)\n var scaledMargin = opts.margin * scale\n var palette = [opts.color.light, opts.color.dark]\n\n for (var i = 0; i < symbolSize; i++) {\n for (var j = 0; j < symbolSize; j++) {\n var posDst = (i * symbolSize + j) * 4\n var pxColor = opts.color.light\n\n if (i >= scaledMargin && j >= scaledMargin &&\n i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n var iSrc = Math.floor((i - scaledMargin) / scale)\n var jSrc = Math.floor((j - scaledMargin) / scale)\n pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n }\n\n imgData[posDst++] = pxColor.r\n imgData[posDst++] = pxColor.g\n imgData[posDst++] = pxColor.b\n imgData[posDst] = pxColor.a\n }\n }\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/renderer/utils.js\n// module id = nwDn\n// module chunks = 0 1","var Mode = require('./mode')\nvar NumericData = require('./numeric-data')\nvar AlphanumericData = require('./alphanumeric-data')\nvar ByteData = require('./byte-data')\nvar KanjiData = require('./kanji-data')\nvar Regex = require('./regex')\nvar Utils = require('./utils')\nvar dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param {String} str Input string\n * @return {Number} Number of byte\n */\nfunction getStringByteLength (str) {\n return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param {Mode} mode Segment mode\n * @param {String} str String to process\n * @return {Array} Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n var segments = []\n var result\n\n while ((result = regex.exec(str)) !== null) {\n segments.push({\n data: result[0],\n index: result.index,\n mode: mode,\n length: result[0].length\n })\n }\n\n return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param {String} dataStr Input string\n * @return {Array} Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n var numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n var alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n var byteSegs\n var kanjiSegs\n\n if (Utils.isKanjiModeEnabled()) {\n byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n } else {\n byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n kanjiSegs = []\n }\n\n var segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n return segs\n .sort(function (s1, s2) {\n return s1.index - s2.index\n })\n .map(function (obj) {\n return {\n data: obj.data,\n mode: obj.mode,\n length: obj.length\n }\n })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param {Number} length String length\n * @param {Mode} mode Segment mode\n * @return {Number} Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n switch (mode) {\n case Mode.NUMERIC:\n return NumericData.getBitsLength(length)\n case Mode.ALPHANUMERIC:\n return AlphanumericData.getBitsLength(length)\n case Mode.KANJI:\n return KanjiData.getBitsLength(length)\n case Mode.BYTE:\n return ByteData.getBitsLength(length)\n }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction mergeSegments (segs) {\n return segs.reduce(function (acc, curr) {\n var prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n if (prevSeg && prevSeg.mode === curr.mode) {\n acc[acc.length - 1].data += curr.data\n return acc\n }\n\n acc.push(curr)\n return acc\n }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param {Array} segs Array of object with segments data\n * @return {Array} Array of object with segments data\n */\nfunction buildNodes (segs) {\n var nodes = []\n for (var i = 0; i < segs.length; i++) {\n var seg = segs[i]\n\n switch (seg.mode) {\n case Mode.NUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.ALPHANUMERIC:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: seg.length }\n ])\n break\n case Mode.KANJI:\n nodes.push([seg,\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n break\n case Mode.BYTE:\n nodes.push([\n { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n ])\n }\n }\n\n return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param {Array} nodes Array of object with segments data\n * @param {Number} version QR Code version\n * @return {Object} Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n var table = {}\n var graph = {'start': {}}\n var prevNodeIds = ['start']\n\n for (var i = 0; i < nodes.length; i++) {\n var nodeGroup = nodes[i]\n var currentNodeIds = []\n\n for (var j = 0; j < nodeGroup.length; j++) {\n var node = nodeGroup[j]\n var key = '' + i + j\n\n currentNodeIds.push(key)\n table[key] = { node: node, lastCount: 0 }\n graph[key] = {}\n\n for (var n = 0; n < prevNodeIds.length; n++) {\n var prevNodeId = prevNodeIds[n]\n\n if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n graph[prevNodeId][key] =\n getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n table[prevNodeId].lastCount += node.length\n } else {\n if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n 4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n }\n }\n }\n\n prevNodeIds = currentNodeIds\n }\n\n for (n = 0; n < prevNodeIds.length; n++) {\n graph[prevNodeIds[n]]['end'] = 0\n }\n\n return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param {String} data Input data\n * @param {Mode | String} modesHint Data mode\n * @return {Segment} Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n var mode\n var bestMode = Mode.getBestModeForData(data)\n\n mode = Mode.from(modesHint, bestMode)\n\n // Make sure data can be encoded\n if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n throw new Error('\"' + data + '\"' +\n ' cannot be encoded with mode ' + Mode.toString(mode) +\n '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n }\n\n // Use Mode.BYTE if Kanji support is disabled\n if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n mode = Mode.BYTE\n }\n\n switch (mode) {\n case Mode.NUMERIC:\n return new NumericData(data)\n\n case Mode.ALPHANUMERIC:\n return new AlphanumericData(data)\n\n case Mode.KANJI:\n return new KanjiData(data)\n\n case Mode.BYTE:\n return new ByteData(data)\n }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param {Array} array Array of objects with segments data\n * @return {Array} Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n return array.reduce(function (acc, seg) {\n if (typeof seg === 'string') {\n acc.push(buildSingleSegment(seg, null))\n } else if (seg.data) {\n acc.push(buildSingleSegment(seg.data, seg.mode))\n }\n\n return acc\n }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @return {Array} Array of segments\n */\nexports.fromString = function fromString (data, version) {\n var segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n var nodes = buildNodes(segs)\n var graph = buildGraph(nodes, version)\n var path = dijkstra.find_path(graph.map, 'start', 'end')\n\n var optimizedSegs = []\n for (var i = 1; i < path.length - 1; i++) {\n optimizedSegs.push(graph.table[path[i]].node)\n }\n\n return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param {string} data Input string\n * @return {Array} Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n return exports.fromArray(\n getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n )\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/segments.js\n// module id = nyx9\n// module chunks = 0 1","var toSJISFunction\nvar CODEWORDS_COUNT = [\n 0, // Not used\n 26, 44, 70, 100, 134, 172, 196, 242, 292, 346,\n 404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,\n 1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,\n 2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706\n]\n\n/**\n * Returns the QR Code size for the specified version\n *\n * @param {Number} version QR Code version\n * @return {Number} size of QR code\n */\nexports.getSymbolSize = function getSymbolSize (version) {\n if (!version) throw new Error('\"version\" cannot be null or undefined')\n if (version < 1 || version > 40) throw new Error('\"version\" should be in range from 1 to 40')\n return version * 4 + 17\n}\n\n/**\n * Returns the total number of codewords used to store data and EC information.\n *\n * @param {Number} version QR Code version\n * @return {Number} Data length in bits\n */\nexports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {\n return CODEWORDS_COUNT[version]\n}\n\n/**\n * Encode data with Bose-Chaudhuri-Hocquenghem\n *\n * @param {Number} data Value to encode\n * @return {Number} Encoded value\n */\nexports.getBCHDigit = function (data) {\n var digit = 0\n\n while (data !== 0) {\n digit++\n data >>>= 1\n }\n\n return digit\n}\n\nexports.setToSJISFunction = function setToSJISFunction (f) {\n if (typeof f !== 'function') {\n throw new Error('\"toSJISFunc\" is not a valid function.')\n }\n\n toSJISFunction = f\n}\n\nexports.isKanjiModeEnabled = function () {\n return typeof toSJISFunction !== 'undefined'\n}\n\nexports.toSJIS = function toSJIS (kanji) {\n return toSJISFunction(kanji)\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/utils.js\n// module id = oLzS\n// module chunks = 0 1","var Mode = require('./mode')\n\nfunction NumericData (data) {\n this.mode = Mode.NUMERIC\n this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n var i, group, value\n\n // The input data string is divided into groups of three digits,\n // and each group is converted to its 10-bit binary equivalent.\n for (i = 0; i + 3 <= this.data.length; i += 3) {\n group = this.data.substr(i, 3)\n value = parseInt(group, 10)\n\n bitBuffer.put(value, 10)\n }\n\n // If the number of input digits is not an exact multiple of three,\n // the final one or two digits are converted to 4 or 7 bits respectively.\n var remainingNum = this.data.length - i\n if (remainingNum > 0) {\n group = this.data.substr(i)\n value = parseInt(group, 10)\n\n bitBuffer.put(value, remainingNum * 3 + 1)\n }\n}\n\nmodule.exports = NumericData\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/numeric-data.js\n// module id = sYKs\n// module chunks = 0 1","var Version = require('./version')\nvar Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n id: 'Numeric',\n bit: 1 << 0,\n ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n * 26 alphabetic characters (A - Z),\n * and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n id: 'Alphanumeric',\n bit: 1 << 1,\n ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n id: 'Byte',\n bit: 1 << 2,\n ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n id: 'Kanji',\n bit: 1 << 3,\n ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param {Mode} mode Data mode\n * @param {Number} version QR Code version\n * @return {Number} Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n if (!Version.isValid(version)) {\n throw new Error('Invalid version: ' + version)\n }\n\n if (version >= 1 && version < 10) return mode.ccBits[0]\n else if (version < 27) return mode.ccBits[1]\n return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param {String} dataStr Input data string\n * @return {Mode} Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n else if (Regex.testKanji(dataStr)) return exports.KANJI\n else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String} Mode name\n */\nexports.toString = function toString (mode) {\n if (mode && mode.id) return mode.id\n throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param {Mode} mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param {String} string Mode name\n * @returns {Mode} Mode object\n */\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n var lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'numeric':\n return exports.NUMERIC\n case 'alphanumeric':\n return exports.ALPHANUMERIC\n case 'kanji':\n return exports.KANJI\n case 'byte':\n return exports.BYTE\n default:\n throw new Error('Unknown mode: ' + string)\n }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param {Mode|String} value Encoding mode\n * @param {Mode} defaultValue Fallback value\n * @return {Mode} Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/mode.js\n// module id = uF9H\n// module chunks = 0 1","exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n if (typeof string !== 'string') {\n throw new Error('Param is not a string')\n }\n\n var lcStr = string.toLowerCase()\n\n switch (lcStr) {\n case 'l':\n case 'low':\n return exports.L\n\n case 'm':\n case 'medium':\n return exports.M\n\n case 'q':\n case 'quartile':\n return exports.Q\n\n case 'h':\n case 'high':\n return exports.H\n\n default:\n throw new Error('Unknown EC Level: ' + string)\n }\n}\n\nexports.isValid = function isValid (level) {\n return level && typeof level.bit !== 'undefined' &&\n level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n if (exports.isValid(value)) {\n return value\n }\n\n try {\n return fromString(value)\n } catch (e) {\n return defaultValue\n }\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/error-correction-level.js\n// module id = utyv\n// module chunks = 0 1","var Buffer = require('../utils/buffer')\nvar Mode = require('./mode')\n\nfunction ByteData (data) {\n this.mode = Mode.BYTE\n this.data = new Buffer(data)\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n for (var i = 0, l = this.data.length; i < l; i++) {\n bitBuffer.put(this.data[i], 8)\n }\n}\n\nmodule.exports = ByteData\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/byte-data.js\n// module id = vPzN\n// module chunks = 0 1","var Buffer = require('../utils/buffer')\nvar Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n this.genPoly = undefined\n this.degree = degree\n\n if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n // create an irreducible generator polynomial\n this.degree = degree\n this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param {Buffer} data Buffer containing input data\n * @return {Buffer} Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n if (!this.genPoly) {\n throw new Error('Encoder not initialized')\n }\n\n // Calculate EC for this data block\n // extends data size to data+genPoly size\n var pad = new Buffer(this.degree)\n pad.fill(0)\n var paddedData = Buffer.concat([data, pad], data.length + this.degree)\n\n // The error correction codewords are the remainder after dividing the data codewords\n // by a generator polynomial\n var remainder = Polynomial.mod(paddedData, this.genPoly)\n\n // return EC data blocks (last n byte, where n is the degree of genPoly)\n // If coefficients number in remainder are less than genPoly degree,\n // pad with 0s to the left to reach the needed number of coefficients\n var start = this.degree - remainder.length\n if (start > 0) {\n var buff = new Buffer(this.degree)\n buff.fill(0)\n remainder.copy(buff, start)\n\n return buff\n }\n\n return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/reed-solomon-encoder.js\n// module id = wBZN\n// module chunks = 0 1","var Utils = require('./utils')\n\nvar G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nvar G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nvar G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param {Number} errorCorrectionLevel Error correction level\n * @param {Number} mask Mask pattern\n * @return {Number} Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n var data = ((errorCorrectionLevel.bit << 3) | mask)\n var d = data << 10\n\n while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n }\n\n // xor final data with mask pattern in order to ensure that\n // no combination of Error Correction Level and data mask pattern\n // will result in an all-zero data string\n return ((data << 10) | d) ^ G15_MASK\n}\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/format-info.js\n// module id = xR/K\n// module chunks = 0 1","var Mode = require('./mode')\nvar Utils = require('./utils')\n\nfunction KanjiData (data) {\n this.mode = Mode.KANJI\n this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n var i\n\n // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n // These byte values are shifted from the JIS X 0208 values.\n // JIS X 0208 gives details of the shift coded representation.\n for (i = 0; i < this.data.length; i++) {\n var value = Utils.toSJIS(this.data[i])\n\n // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n if (value >= 0x8140 && value <= 0x9FFC) {\n // Subtract 0x8140 from Shift JIS value\n value -= 0x8140\n\n // For characters with Shift JIS values from 0xE040 to 0xEBBF\n } else if (value >= 0xE040 && value <= 0xEBBF) {\n // Subtract 0xC140 from Shift JIS value\n value -= 0xC140\n } else {\n throw new Error(\n 'Invalid SJIS character: ' + this.data[i] + '\\n' +\n 'Make sure your charset is UTF-8')\n }\n\n // Multiply most significant byte of result by 0xC0\n // and add least significant byte to product\n value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n // Convert result to a 13-bit binary string\n bitBuffer.put(value, 13)\n }\n}\n\nmodule.exports = KanjiData\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./~/qrcode/lib/core/kanji-data.js\n// module id = zYqW\n// module chunks = 0 1"],"sourceRoot":""}