{"version":3,"sources":["webpack:///./node_modules/aurelia-webpack-plugin/runtime/pal-loader-entry.js","webpack:///./node_modules/base64-js/index.js","webpack:///./node_modules/aurelia-task-queue/dist/native-modules/aurelia-task-queue.js","webpack:///./node_modules/base-x/src/index.js","webpack:///./node_modules/aurelia-path/dist/native-modules/aurelia-path.js"],"names":["Loader","Object","defineProperty","get","WebpackLoader","set","value","exports","byteLength","b64","lens","getLens","validLen","placeHoldersLen","toByteArray","tmp","i","arr","Arr","_byteLength","curByte","len","revLookup","charCodeAt","fromByteArray","uint8","length","extraBytes","parts","len2","push","encodeChunk","lookup","join","Uint8Array","Array","code","Error","indexOf","start","end","num","output","_typeof","Symbol","iterator","obj","constructor","prototype","makeRequestFlushFromTimer","flush","timeoutHandle","setTimeout","handleFlushTimer","intervalHandle","setInterval","clearTimeout","clearInterval","TaskQueue","observer","val","node","values","_this","this","flushing","longStacks","microTaskQueue","microTaskQueueCapacity","taskQueue","mutationObserver","requestFlushMicroTaskQueue","flushMicroTaskQueue","createMutationObserver","createTextNode","create","a","b","observe","characterData","data","requestFlushTaskQueue","flushTaskQueue","_flushQueue","queue","capacity","index","task","stack","undefined","call","scan","newLength","error","filterFlushStack","onError","queueMicroTask","prepareQueueStack","queueTask","Number","MAX_VALUE","separator","replace","filterQueueStack","e","captureStack","lastIndexOf","substr","_Buffer","Buffer","module","ALPHABET","TypeError","BASE_MAP","j","x","charAt","xc","BASE","LEADER","FACTOR","Math","log","iFACTOR","decodeUnsafe","source","alloc","psz","zeroes","size","b256","carry","it3","it4","vch","allocUnsafe","fill","encode","isArray","from","isBuffer","pbegin","pend","b58","it1","it2","str","repeat","decode","string","buffer","relativeToFile","name","file","fileParts","split","nameParts","trim","normalizedBaseParts","slice","unshift","apply","ary","part","splice","trimDots","path1","path2","schemeMatch","match","scheme","urlPrefix","trailingSlash","url1","url2","url3","ii","pop","_i","_ii","encodeURIComponent","encodeKey","k","buildParam","key","traditional","result","l","arrayKey","concat","propertyName","buildQueryString","params","pairs","keys","sort","processScalarParam","existedParam","parseComplexParam","queryParams","currentParams","keysLastIndex","prevValue","isNaN","parseQueryString","queryString","query","pair","decodeURIComponent","test","shift"],"mappings":"oHAAA,WAsBIA,EAtBJ,YAwBAC,OAAOC,eAAe,IAAU,SAAU,CACxCC,IAAK,WACH,OAAOH,IAAWA,EAAS,EAAQ,QAA0BI,gBAE/DC,IAAK,SAASC,GACZN,EAASM,M,kCC3BbC,EAAQC,WAuCR,SAAqBC,GACnB,IAAIC,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,GA1ClDN,EAAQO,YAiDR,SAAsBL,GACpB,IAAIM,EAcAC,EAbAN,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBO,EAAM,IAAIC,EAVhB,SAAsBT,EAAKG,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,EAS9BM,CAAYV,EAAKG,EAAUC,IAEzCO,EAAU,EAGVC,EAAMR,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKI,EAAI,EAAGA,EAAIK,EAAKL,GAAK,EACxBD,EACGO,EAAUb,EAAIc,WAAWP,KAAO,GAChCM,EAAUb,EAAIc,WAAWP,EAAI,KAAO,GACpCM,EAAUb,EAAIc,WAAWP,EAAI,KAAO,EACrCM,EAAUb,EAAIc,WAAWP,EAAI,IAC/BC,EAAIG,KAAcL,GAAO,GAAM,IAC/BE,EAAIG,KAAcL,GAAO,EAAK,IAC9BE,EAAIG,KAAmB,IAANL,EAGK,IAApBF,IACFE,EACGO,EAAUb,EAAIc,WAAWP,KAAO,EAChCM,EAAUb,EAAIc,WAAWP,EAAI,KAAO,EACvCC,EAAIG,KAAmB,IAANL,GAGK,IAApBF,IACFE,EACGO,EAAUb,EAAIc,WAAWP,KAAO,GAChCM,EAAUb,EAAIc,WAAWP,EAAI,KAAO,EACpCM,EAAUb,EAAIc,WAAWP,EAAI,KAAO,EACvCC,EAAIG,KAAcL,GAAO,EAAK,IAC9BE,EAAIG,KAAmB,IAANL,GAGnB,OAAOE,GA3FTV,EAAQiB,cAkHR,SAAwBC,GAQtB,IAPA,IAAIV,EACAM,EAAMI,EAAMC,OACZC,EAAaN,EAAM,EACnBO,EAAQ,GAIHZ,EAAI,EAAGa,EAAOR,EAAMM,EAAYX,EAAIa,EAAMb,GAH9B,MAInBY,EAAME,KAAKC,EACTN,EAAOT,EAAIA,EALM,MAKgBa,EAAOA,EAAQb,EAL/B,QAUF,IAAfW,GACFZ,EAAMU,EAAMJ,EAAM,GAClBO,EAAME,KACJE,EAAOjB,GAAO,GACdiB,EAAQjB,GAAO,EAAK,IACpB,OAEsB,IAAfY,IACTZ,GAAOU,EAAMJ,EAAM,IAAM,GAAKI,EAAMJ,EAAM,GAC1CO,EAAME,KACJE,EAAOjB,GAAO,IACdiB,EAAQjB,GAAO,EAAK,IACpBiB,EAAQjB,GAAO,EAAK,IACpB,MAIJ,OAAOa,EAAMK,KAAK,KA3IpB,IALA,IAAID,EAAS,GACTV,EAAY,GACZJ,EAA4B,oBAAfgB,WAA6BA,WAAaC,MAEvDC,EAAO,mEACFpB,EAAI,EAAGK,EAAMe,EAAKV,OAAQV,EAAIK,IAAOL,EAC5CgB,EAAOhB,GAAKoB,EAAKpB,GACjBM,EAAUc,EAAKb,WAAWP,IAAMA,EAQlC,SAASL,EAASF,GAChB,IAAIY,EAAMZ,EAAIiB,OAEd,GAAIL,EAAM,EAAI,EACZ,MAAM,IAAIgB,MAAM,kDAKlB,IAAIzB,EAAWH,EAAI6B,QAAQ,KAO3B,OANkB,IAAd1B,IAAiBA,EAAWS,GAMzB,CAACT,EAJcA,IAAaS,EAC/B,EACA,EAAKT,EAAW,GAsEtB,SAASmB,EAAaN,EAAOc,EAAOC,GAGlC,IAFA,IAAIzB,EARoB0B,EASpBC,EAAS,GACJ1B,EAAIuB,EAAOvB,EAAIwB,EAAKxB,GAAK,EAChCD,GACIU,EAAMT,IAAM,GAAM,WAClBS,EAAMT,EAAI,IAAM,EAAK,QACP,IAAfS,EAAMT,EAAI,IACb0B,EAAOZ,KAdFE,GADiBS,EAeM1B,IAdT,GAAK,IACxBiB,EAAOS,GAAO,GAAK,IACnBT,EAAOS,GAAO,EAAI,IAClBT,EAAa,GAANS,IAaT,OAAOC,EAAOT,KAAK,IAjGrBX,EAAU,IAAIC,WAAW,IAAM,GAC/BD,EAAU,IAAIC,WAAW,IAAM,I,oCCnB/B,kDAAIoB,EAA4B,mBAAXC,QAAoD,iBAApBA,OAAOC,SAAwB,SAAUC,GAAO,cAAcA,GAAS,SAAUA,GAAO,OAAOA,GAAyB,mBAAXF,QAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAOI,UAAY,gBAAkBF,GAsBtQ,SAASG,EAA0BC,GACjC,OAAO,WACL,IAAIC,EAAgBC,WAAWC,EAAkB,GAE7CC,EAAiBC,YAAYF,EAAkB,IACnD,SAASA,IACPG,aAAaL,GACbM,cAAcH,GACdJ,MAmBC,IAAIQ,EAAY,WACrB,SAASA,IACP,IA1C0CR,EACxCS,EACAC,EACAC,EACAC,EAsCEC,EAAQC,KAIZA,KAAKC,UAAW,EAChBD,KAAKE,YAAa,EAElBF,KAAKG,eAAiB,GACtBH,KAAKI,uBAAyB,KAC9BJ,KAAKK,UAAY,GAEb,IAAQC,iBACVN,KAAKO,4BAtDmCrB,EAsD+B,WACrE,OAAOa,EAAMS,uBAtDfb,EAAW,IAAIc,uBAAuBvB,GACtCU,EAAM,IACNC,EAAO,IAAIa,eAAe,MAC1BZ,EAAS7D,OAAO0E,OAAO,OACpBC,EAAI,IACXd,EAAOe,EAAI,IACXlB,EAASmB,QAAQjB,EAAM,CAAEkB,eAAe,IACjC,WACLlB,EAAKmB,KAAOpB,EAAME,EAAOF,KAiDvBI,KAAKO,2BAA6BtB,GAA0B,WAC1D,OAAOc,EAAMS,yBAIjBR,KAAKiB,sBAAwBhC,GAA0B,WACrD,OAAOc,EAAMmB,oBAgFjB,OA5EAxB,EAAUV,UAAUmC,YAAc,SAAqBC,EAAOC,GAC5D,IAAIC,EAAQ,EACRC,OAAO,EAEX,IAEE,IADAvB,KAAKC,UAAW,EACTqB,EAAQF,EAAM1D,QAQnB,GAPA6D,EAAOH,EAAME,GACTtB,KAAKE,aACPF,KAAKwB,MAA8B,iBAAfD,EAAKC,MAAqBD,EAAKC,WAAQC,GAE7DF,EAAKG,SACLJ,EAEYD,EAAU,CACpB,IAAK,IAAIM,EAAO,EAAGC,EAAYR,EAAM1D,OAAS4D,EAAOK,EAAOC,EAAWD,IACrEP,EAAMO,GAAQP,EAAMO,EAAOL,GAG7BF,EAAM1D,QAAU4D,EAChBA,EAAQ,GAGZ,MAAOO,IAjEb,SAAiBA,EAAON,EAAMrB,GACxBA,GAAcqB,EAAKC,OAA2E,iBAAhD,IAAVK,EAAwB,YAAclD,EAAQkD,KAAkC,OAAVA,IAC5GA,EAAML,MAAQM,EAAiBD,EAAML,OAASD,EAAKC,OAGjD,YAAaD,EACfA,EAAKQ,QAAQF,GAEbzC,YAAW,WACT,MAAMyC,IACL,GAwDDE,CAAQF,EAAON,EAAMvB,KAAKE,YAC1B,QACAF,KAAKC,UAAW,IAIpBP,EAAUV,UAAUgD,eAAiB,SAAwBT,GACvDvB,KAAKG,eAAezC,OAAS,GAC/BsC,KAAKO,6BAGHP,KAAKE,aACPqB,EAAKC,MAAQxB,KAAKiC,kBA1GE,uCA6GtBjC,KAAKG,eAAerC,KAAKyD,IAG3B7B,EAAUV,UAAUkD,UAAY,SAAmBX,GAC7CvB,KAAKK,UAAU3C,OAAS,GAC1BsC,KAAKiB,wBAGHjB,KAAKE,aACPqB,EAAKC,MAAQxB,KAAKiC,kBAvHH,kCA0HjBjC,KAAKK,UAAUvC,KAAKyD,IAGtB7B,EAAUV,UAAUkC,eAAiB,WACnC,IAAIE,EAAQpB,KAAKK,UACjBL,KAAKK,UAAY,GACjBL,KAAKmB,YAAYC,EAAOe,OAAOC,YAGjC1C,EAAUV,UAAUwB,oBAAsB,WACxC,IAAIY,EAAQpB,KAAKG,eACjBH,KAAKmB,YAAYC,EAAOpB,KAAKI,wBAC7BgB,EAAM1D,OAAS,GAGjBgC,EAAUV,UAAUiD,kBAAoB,SAA2BI,GACjE,IAAIb,EAAQa,EA0BhB,SAA0Bb,GACxB,OAAOA,EAAMc,QAAQ,yCAA0C,IA3BrCC,CAY5B,WACE,IAAIV,EAAQ,IAAIxD,MAEhB,GAAIwD,EAAML,MACR,OAAOK,EAAML,MAGf,IACE,MAAMK,EACN,MAAOW,GACP,OAAOA,EAAEhB,OAtBgCiB,IAMzC,MAJ0B,iBAAfzC,KAAKwB,QACdA,EAAQM,EAAiBN,GAASxB,KAAKwB,OAGlCA,GAGF9B,EAxGc,GA6HvB,SAASoC,EAAiBN,GACxB,IAAIF,EAAQE,EAAMkB,YAAY,uBAE9B,OAAIpB,EAAQ,IACVA,EAAQE,EAAMkB,YAAY,mBACd,IAKdpB,EAAQE,EAAMkB,YAAY,KAAMpB,IAEjB,EANJE,EAMgBA,EAAMmB,OAAO,EAAGrB,K,kCCnL7C,IAAIsB,EAAU,EAAQ,QAAeC,OAmHrCC,EAAOvG,QAlHP,SAAewG,GACb,GAAIA,EAASrF,QAAU,IAAO,MAAM,IAAIsF,UAAU,qBAElD,IADA,IAAIC,EAAW,IAAI/E,WAAW,KACrBgF,EAAI,EAAGA,EAAID,EAASvF,OAAQwF,IACnCD,EAASC,GAAK,IAEhB,IAAK,IAAIlG,EAAI,EAAGA,EAAI+F,EAASrF,OAAQV,IAAK,CACxC,IAAImG,EAAIJ,EAASK,OAAOpG,GACpBqG,EAAKF,EAAE5F,WAAW,GACtB,GAAqB,MAAjB0F,EAASI,GAAe,MAAM,IAAIL,UAAUG,EAAI,iBACpDF,EAASI,GAAMrG,EAEjB,IAAIsG,EAAOP,EAASrF,OAChB6F,EAASR,EAASK,OAAO,GACzBI,EAASC,KAAKC,IAAIJ,GAAQG,KAAKC,IAAI,KACnCC,EAAUF,KAAKC,IAAI,KAAOD,KAAKC,IAAIJ,GAyCvC,SAASM,EAAcC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAIb,UAAU,mBACtD,GAAsB,IAAlBa,EAAOnG,OAAgB,OAAOkF,EAAQkB,MAAM,GAChD,IAAIC,EAAM,EAEV,GAAoB,MAAhBF,EAAOE,GAAX,CAIA,IAFA,IAAIC,EAAS,EACTtG,EAAS,EACNmG,EAAOE,KAASR,GACrBS,IACAD,IAMF,IAHA,IAAIE,GAAUJ,EAAOnG,OAASqG,GAAOP,EAAU,IAAO,EAClDU,EAAO,IAAIhG,WAAW+F,GAEnBJ,EAAOE,IAAM,CAElB,IAAII,EAAQlB,EAASY,EAAOtG,WAAWwG,IAEvC,GAAc,MAAVI,EAAiB,OAErB,IADA,IAAInH,EAAI,EACCoH,EAAMH,EAAO,GAAc,IAAVE,GAAenH,EAAIU,KAAqB,IAAT0G,EAAaA,IAAOpH,IAC3EmH,GAAUb,EAAOY,EAAKE,KAAU,EAChCF,EAAKE,GAAQD,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAI9F,MAAM,kBACnCX,EAASV,EACT+G,IAGF,GAAoB,MAAhBF,EAAOE,GAAX,CAGA,IADA,IAAIM,EAAMJ,EAAOvG,EACV2G,IAAQJ,GAAsB,IAAdC,EAAKG,IAC1BA,IAEF,IAAIC,EAAM1B,EAAQ2B,YAAYP,GAAUC,EAAOI,IAC/CC,EAAIE,KAAK,EAAM,EAAGR,GAElB,IADA,IAAId,EAAIc,EACDK,IAAQJ,GACbK,EAAIpB,KAAOgB,EAAKG,KAElB,OAAOC,IAOT,MAAO,CACLG,OA7FF,SAAiBZ,GAEf,IADI1F,MAAMuG,QAAQb,IAAWA,aAAkB3F,cAAc2F,EAASjB,EAAQ+B,KAAKd,KAC9EjB,EAAQgC,SAASf,GAAW,MAAM,IAAIb,UAAU,mBACrD,GAAsB,IAAlBa,EAAOnG,OAAgB,MAAO,GAMlC,IAJA,IAAIsG,EAAS,EACTtG,EAAS,EACTmH,EAAS,EACTC,EAAOjB,EAAOnG,OACXmH,IAAWC,GAA2B,IAAnBjB,EAAOgB,IAC/BA,IACAb,IAMF,IAHA,IAAIC,GAASa,EAAOD,GAAUlB,EAAU,IAAO,EAC3CoB,EAAM,IAAI7G,WAAW+F,GAElBY,IAAWC,GAAM,CAItB,IAHA,IAAIX,EAAQN,EAAOgB,GAEf7H,EAAI,EACCgI,EAAMf,EAAO,GAAc,IAAVE,GAAenH,EAAIU,KAAqB,IAATsH,EAAaA,IAAOhI,IAC3EmH,GAAU,IAAMY,EAAIC,KAAU,EAC9BD,EAAIC,GAAQb,EAAQb,IAAU,EAC9Ba,EAASA,EAAQb,IAAU,EAE7B,GAAc,IAAVa,EAAe,MAAM,IAAI9F,MAAM,kBACnCX,EAASV,EACT6H,IAIF,IADA,IAAII,EAAMhB,EAAOvG,EACVuH,IAAQhB,GAAqB,IAAbc,EAAIE,IACzBA,IAIF,IADA,IAAIC,EAAM3B,EAAO4B,OAAOnB,GACjBiB,EAAMhB,IAAQgB,EAAOC,GAAOnC,EAASK,OAAO2B,EAAIE,IACvD,OAAOC,GAwDPtB,aAAcA,EACdwB,OARF,SAAiBC,GACf,IAAIC,EAAS1B,EAAayB,GAC1B,GAAIC,EAAU,OAAOA,EACrB,MAAM,IAAIjH,MAAM,WAAaiF,EAAO,kB,kCClHxC,4IAAI3E,EAA4B,mBAAXC,QAAoD,iBAApBA,OAAOC,SAAwB,SAAUC,GAAO,cAAcA,GAAS,SAAUA,GAAO,OAAOA,GAAyB,mBAAXF,QAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAOI,UAAY,gBAAkBF,GAmB/P,SAASyG,EAAeC,EAAMC,GACnC,IAAIC,EAAYD,GAAQA,EAAKE,MAAM,KAC/BC,EAAYJ,EAAKK,OAAOF,MAAM,KAElC,GAA+B,MAA3BC,EAAU,GAAGxC,OAAO,IAAcsC,EAAW,CAC/C,IAAII,EAAsBJ,EAAUK,MAAM,EAAGL,EAAUhI,OAAS,GAChEkI,EAAUI,QAAQC,MAAML,EAAWE,GAKrC,OA5BF,SAAkBI,GAChB,IAAK,IAAIlJ,EAAI,EAAGA,EAAIkJ,EAAIxI,SAAUV,EAAG,CACnC,IAAImJ,EAAOD,EAAIlJ,GACf,GAAa,MAATmJ,EACFD,EAAIE,OAAOpJ,EAAG,GACdA,GAAK,OACA,GAAa,OAATmJ,EAAe,CACxB,GAAU,IAANnJ,GAAiB,IAANA,GAAsB,OAAXkJ,EAAI,IAA8B,OAAfA,EAAIlJ,EAAI,GACnD,SACSA,EAAI,IACbkJ,EAAIE,OAAOpJ,EAAI,EAAG,GAClBA,GAAK,KAeXqJ,CAAST,GAEFA,EAAU3H,KAAK,KAGjB,SAASA,EAAKqI,EAAOC,GAC1B,IAAKD,EACH,OAAOC,EAGT,IAAKA,EACH,OAAOD,EAGT,IAAIE,EAAcF,EAAMG,MAAM,gBAC1BC,EAASF,GAAeA,EAAY9I,OAAS,EAAI8I,EAAY,GAAK,GAGlEG,OAAY,EAEdA,EAD2B,KAH7BL,EAAQA,EAAM3D,OAAO+D,EAAOhJ,SAGlBY,QAAQ,QAA2B,UAAXoI,EACpB,MACqB,IAAxBJ,EAAMhI,QAAQ,MACX,KACoB,IAAvBgI,EAAMhI,QAAQ,KACX,IAEA,GASd,IANA,IAAIsI,EAAoC,MAApBL,EAAMR,OAAO,GAAa,IAAM,GAEhDc,EAAOP,EAAMX,MAAM,KACnBmB,EAAOP,EAAMZ,MAAM,KACnBoB,EAAO,GAEF/J,EAAI,EAAGgK,EAAKH,EAAKnJ,OAAQV,EAAIgK,IAAMhK,EAC1C,GAAgB,OAAZ6J,EAAK7J,GACH+J,EAAKrJ,QAAoC,OAA1BqJ,EAAKA,EAAKrJ,OAAS,GACpCqJ,EAAKE,MAELF,EAAKjJ,KAAK+I,EAAK7J,QAEZ,IAAgB,MAAZ6J,EAAK7J,IAA0B,KAAZ6J,EAAK7J,GACjC,SAEA+J,EAAKjJ,KAAK+I,EAAK7J,IAInB,IAAK,IAAIkK,EAAK,EAAGC,EAAML,EAAKpJ,OAAQwJ,EAAKC,IAAOD,EAC9C,GAAiB,OAAbJ,EAAKI,GACHH,EAAKrJ,QAAoC,OAA1BqJ,EAAKA,EAAKrJ,OAAS,GACpCqJ,EAAKE,MAELF,EAAKjJ,KAAKgJ,EAAKI,QAEZ,IAAiB,MAAbJ,EAAKI,IAA4B,KAAbJ,EAAKI,GAClC,SAEAH,EAAKjJ,KAAKgJ,EAAKI,IAInB,OAAOR,EAASC,EAAYI,EAAK9I,KAAK,KAAO2I,EAG/C,IAAInC,EAAS2C,mBACTC,EAAY,SAAmBC,GACjC,OAAO7C,EAAO6C,GAAGhF,QAAQ,MAAO,MAGlC,SAASiF,EAAWC,EAAKlL,EAAOmL,GAC9B,IAAIC,EAAS,GACb,GAAIpL,QACF,OAAOoL,EAET,GAAIvJ,MAAMuG,QAAQpI,GAChB,IAAK,IAAIU,EAAI,EAAG2K,EAAIrL,EAAMoB,OAAQV,EAAI2K,EAAG3K,IACvC,GAAIyK,EACFC,EAAO5J,KAAKuJ,EAAUG,GAAO,IAAM/C,EAAOnI,EAAMU,SAC3C,CACL,IAAI4K,EAAWJ,EAAM,KAA6B,WAAtB7I,EAAQrC,EAAMU,KAAiC,OAAbV,EAAMU,GAAcA,EAAI,IAAM,IAC5F0K,EAASA,EAAOG,OAAON,EAAWK,EAAUtL,EAAMU,UAGjD,GAAsE,iBAAhD,IAAVV,EAAwB,YAAcqC,EAAQrC,KAAyBmL,EAKxFC,EAAO5J,KAAKuJ,EAAUG,GAAO,IAAM/C,EAAOnI,SAJ1C,IAAK,IAAIwL,KAAgBxL,EACvBoL,EAASA,EAAOG,OAAON,EAAWC,EAAM,IAAMM,EAAe,IAAKxL,EAAMwL,KAK5E,OAAOJ,EAGF,SAASK,EAAiBC,EAAQP,GAGvC,IAFA,IAAIQ,EAAQ,GACRC,EAAOjM,OAAOiM,KAAKF,GAAU,IAAIG,OAC5BnL,EAAI,EAAGK,EAAM6K,EAAKxK,OAAQV,EAAIK,EAAKL,IAAK,CAC/C,IAAIwK,EAAMU,EAAKlL,GACfiL,EAAQA,EAAMJ,OAAON,EAAWC,EAAKQ,EAAOR,GAAMC,IAGpD,OAAqB,IAAjBQ,EAAMvK,OACD,GAGFuK,EAAMhK,KAAK,KAGpB,SAASmK,EAAmBC,EAAc/L,GACxC,OAAI6B,MAAMuG,QAAQ2D,IAChBA,EAAavK,KAAKxB,GACX+L,QAEY5G,IAAjB4G,EACK,CAACA,EAAc/L,GAGjBA,EAGT,SAASgM,EAAkBC,EAAaL,EAAM5L,GAG5C,IAFA,IAAIkM,EAAgBD,EAChBE,EAAgBP,EAAKxK,OAAS,EACzBwF,EAAI,EAAGA,GAAKuF,EAAevF,IAAK,CACvC,IAAIsE,EAAkB,KAAZU,EAAKhF,GAAYsF,EAAc9K,OAASwK,EAAKhF,GACvD,GAAIA,EAAIuF,EAAe,CACrB,IAAIC,EAAaF,EAAchB,IAAwC,WAAhC7I,EAAQ6J,EAAchB,IAA0C,CAACgB,EAAchB,IAApCgB,EAAchB,GAChGgB,EAAgBA,EAAchB,GAAOkB,IAAcC,MAAMT,EAAKhF,EAAI,IAAM,GAAK,SAE7EsF,EAAgBA,EAAchB,GAAOlL,GAKpC,SAASsM,EAAiBC,GAC/B,IAAIN,EAAc,GAClB,IAAKM,GAAsC,iBAAhBA,EACzB,OAAON,EAGT,IAAIO,EAAQD,EACY,MAApBC,EAAM1F,OAAO,KACf0F,EAAQA,EAAMnG,OAAO,IAIvB,IADA,IAAIsF,EAAQa,EAAMxG,QAAQ,MAAO,KAAKqD,MAAM,KACnC3I,EAAI,EAAGA,EAAIiL,EAAMvK,OAAQV,IAAK,CACrC,IAAI+L,EAAOd,EAAMjL,GAAG2I,MAAM,KACtB6B,EAAMwB,mBAAmBD,EAAK,IAClC,GAAKvB,EAAL,CAIA,IAAIU,EAAOV,EAAI7B,MAAM,MACjB8C,EAAgBP,EAAKxK,OAAS,EAUlC,GARI,KAAKuL,KAAKf,EAAK,KAAO,MAAMe,KAAKf,EAAKO,KACxCP,EAAKO,GAAiBP,EAAKO,GAAenG,QAAQ,MAAO,IAEzDmG,GADAP,EAAOA,EAAKgB,QAAQvD,MAAM,KAAKkC,OAAOK,IACjBxK,OAAS,GAE9B+K,EAAgB,EAGdM,EAAKrL,QAAU,EAAG,CACpB,IAAIpB,EAAQyM,EAAK,GAAKC,mBAAmBD,EAAK,IAAM,GAChDN,EACFH,EAAkBC,EAAaL,EAAM5L,GAErCiM,EAAYf,GAAOY,EAAmBG,EAAYf,GAAMlL,QAG1DiM,EAAYf,IAAO,GAGvB,OAAOe","file":"vendors~2a42e354.0a28d95071ab8a34e281.chunk.js","sourcesContent":["// With default aurelia-loader-webpack config, this module is added as an extra entry\n// before any other code executes so that PAL.Loader is properly configured.\n// There are several tricky points worth noticing.\n// \n// We don't add aurelia-loader-webpack itself as an entry point (used to until 2.0 RC2)\n// because it (transitively) brings too much bagage with itself, most notably polyfills.\n// This made it super-hard to add other polyfills before Aurelia's and led to various bugs.\n//\n// We don't add custom code in aurelia-pal or aurelia-loader or aurelia-bootstrapper to detect\n// the Webpack environment and configure the loader because they might live in a DLL.\n// If they do, they would bring aurelia-loader-webpack along in the DLL and this is a special \n// library that *has to be in the main chunk.*\n//\n// The over-complicated design I've settled upon in the end is to use this special module\n// as an entry point that configures aurelia-loader-webpack. It has minimal static imports:\n// just aurelia-pal, which itself has no other dependencies and doesn't run much code.\n// It hacks the loader field into a getter so that it can synchronously load aurelia-loader-webpack\n// just in time when it is demanded by aurelia-bootstrapper.\n// This enables users to load polyfills before aurelia-loader-webpack is actually loaded.\n\nimport { PLATFORM } from \"aurelia-pal\";\n\nvar Loader;\n\nObject.defineProperty(PLATFORM, \"Loader\", {\n  get: function() {\n    return Loader || (Loader = require(\"aurelia-loader-webpack\").WebpackLoader);\n  },\n  set: function(value) {\n    Loader = value;\n  }\n});\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(\n      uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)\n    ))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","var _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n\n\nimport { DOM, FEATURE } from 'aurelia-pal';\n\nvar stackSeparator = '\\nEnqueued in TaskQueue by:\\n';\nvar microStackSeparator = '\\nEnqueued in MicroTaskQueue by:\\n';\n\nfunction makeRequestFlushFromMutationObserver(flush) {\n  var observer = DOM.createMutationObserver(flush);\n  var val = 'a';\n  var node = DOM.createTextNode('a');\n  var values = Object.create(null);\n  values.a = 'b';\n  values.b = 'a';\n  observer.observe(node, { characterData: true });\n  return function requestFlush() {\n    node.data = val = values[val];\n  };\n}\n\nfunction makeRequestFlushFromTimer(flush) {\n  return function requestFlush() {\n    var timeoutHandle = setTimeout(handleFlushTimer, 0);\n\n    var intervalHandle = setInterval(handleFlushTimer, 50);\n    function handleFlushTimer() {\n      clearTimeout(timeoutHandle);\n      clearInterval(intervalHandle);\n      flush();\n    }\n  };\n}\n\nfunction onError(error, task, longStacks) {\n  if (longStacks && task.stack && (typeof error === 'undefined' ? 'undefined' : _typeof(error)) === 'object' && error !== null) {\n    error.stack = filterFlushStack(error.stack) + task.stack;\n  }\n\n  if ('onError' in task) {\n    task.onError(error);\n  } else {\n    setTimeout(function () {\n      throw error;\n    }, 0);\n  }\n}\n\nexport var TaskQueue = function () {\n  function TaskQueue() {\n    var _this = this;\n\n    \n\n    this.flushing = false;\n    this.longStacks = false;\n\n    this.microTaskQueue = [];\n    this.microTaskQueueCapacity = 1024;\n    this.taskQueue = [];\n\n    if (FEATURE.mutationObserver) {\n      this.requestFlushMicroTaskQueue = makeRequestFlushFromMutationObserver(function () {\n        return _this.flushMicroTaskQueue();\n      });\n    } else {\n      this.requestFlushMicroTaskQueue = makeRequestFlushFromTimer(function () {\n        return _this.flushMicroTaskQueue();\n      });\n    }\n\n    this.requestFlushTaskQueue = makeRequestFlushFromTimer(function () {\n      return _this.flushTaskQueue();\n    });\n  }\n\n  TaskQueue.prototype._flushQueue = function _flushQueue(queue, capacity) {\n    var index = 0;\n    var task = void 0;\n\n    try {\n      this.flushing = true;\n      while (index < queue.length) {\n        task = queue[index];\n        if (this.longStacks) {\n          this.stack = typeof task.stack === 'string' ? task.stack : undefined;\n        }\n        task.call();\n        index++;\n\n        if (index > capacity) {\n          for (var scan = 0, newLength = queue.length - index; scan < newLength; scan++) {\n            queue[scan] = queue[scan + index];\n          }\n\n          queue.length -= index;\n          index = 0;\n        }\n      }\n    } catch (error) {\n      onError(error, task, this.longStacks);\n    } finally {\n      this.flushing = false;\n    }\n  };\n\n  TaskQueue.prototype.queueMicroTask = function queueMicroTask(task) {\n    if (this.microTaskQueue.length < 1) {\n      this.requestFlushMicroTaskQueue();\n    }\n\n    if (this.longStacks) {\n      task.stack = this.prepareQueueStack(microStackSeparator);\n    }\n\n    this.microTaskQueue.push(task);\n  };\n\n  TaskQueue.prototype.queueTask = function queueTask(task) {\n    if (this.taskQueue.length < 1) {\n      this.requestFlushTaskQueue();\n    }\n\n    if (this.longStacks) {\n      task.stack = this.prepareQueueStack(stackSeparator);\n    }\n\n    this.taskQueue.push(task);\n  };\n\n  TaskQueue.prototype.flushTaskQueue = function flushTaskQueue() {\n    var queue = this.taskQueue;\n    this.taskQueue = [];\n    this._flushQueue(queue, Number.MAX_VALUE);\n  };\n\n  TaskQueue.prototype.flushMicroTaskQueue = function flushMicroTaskQueue() {\n    var queue = this.microTaskQueue;\n    this._flushQueue(queue, this.microTaskQueueCapacity);\n    queue.length = 0;\n  };\n\n  TaskQueue.prototype.prepareQueueStack = function prepareQueueStack(separator) {\n    var stack = separator + filterQueueStack(captureStack());\n\n    if (typeof this.stack === 'string') {\n      stack = filterFlushStack(stack) + this.stack;\n    }\n\n    return stack;\n  };\n\n  return TaskQueue;\n}();\n\nfunction captureStack() {\n  var error = new Error();\n\n  if (error.stack) {\n    return error.stack;\n  }\n\n  try {\n    throw error;\n  } catch (e) {\n    return e.stack;\n  }\n}\n\nfunction filterQueueStack(stack) {\n  return stack.replace(/^[\\s\\S]*?\\bqueue(Micro)?Task\\b[^\\n]*\\n/, '');\n}\n\nfunction filterFlushStack(stack) {\n  var index = stack.lastIndexOf('flushMicroTaskQueue');\n\n  if (index < 0) {\n    index = stack.lastIndexOf('flushTaskQueue');\n    if (index < 0) {\n      return stack;\n    }\n  }\n\n  index = stack.lastIndexOf('\\n', index);\n\n  return index < 0 ? stack : stack.substr(0, index);\n}","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = require('safe-buffer').Buffer\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  var BASE_MAP = new Uint8Array(256)\n  for (var j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (var i = 0; i < ALPHABET.length; i++) {\n    var x = ALPHABET.charAt(i)\n    var xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  var BASE = ALPHABET.length\n  var LEADER = ALPHABET.charAt(0)\n  var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n    if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n    if (source.length === 0) { return '' }\n        // Skip & count leading zeroes.\n    var zeroes = 0\n    var length = 0\n    var pbegin = 0\n    var pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n        // Allocate enough space in big-endian base58 representation.\n    var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    var b58 = new Uint8Array(size)\n        // Process the bytes.\n    while (pbegin !== pend) {\n      var carry = source[pbegin]\n            // Apply \"b58 = b58 * 256 + ch\".\n      var i = 0\n      for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n        // Skip leading zeroes in base58 result.\n    var it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n        // Translate the result into a string.\n    var str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return _Buffer.alloc(0) }\n    var psz = 0\n        // Skip leading spaces.\n    if (source[psz] === ' ') { return }\n        // Skip and count leading '1's.\n    var zeroes = 0\n    var length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n        // Allocate enough space in big-endian base256 representation.\n    var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    var b256 = new Uint8Array(size)\n        // Process the characters.\n    while (source[psz]) {\n            // Decode character\n      var carry = BASE_MAP[source.charCodeAt(psz)]\n            // Invalid character\n      if (carry === 255) { return }\n      var i = 0\n      for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n        // Skip trailing spaces.\n    if (source[psz] === ' ') { return }\n        // Skip leading zeroes in b256.\n    var it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n    vch.fill(0x00, 0, zeroes)\n    var j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    var buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode: encode,\n    decodeUnsafe: decodeUnsafe,\n    decode: decode\n  }\n}\nmodule.exports = base\n","var _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nfunction trimDots(ary) {\n  for (var i = 0; i < ary.length; ++i) {\n    var part = ary[i];\n    if (part === '.') {\n      ary.splice(i, 1);\n      i -= 1;\n    } else if (part === '..') {\n      if (i === 0 || i === 1 && ary[2] === '..' || ary[i - 1] === '..') {\n        continue;\n      } else if (i > 0) {\n        ary.splice(i - 1, 2);\n        i -= 2;\n      }\n    }\n  }\n}\n\nexport function relativeToFile(name, file) {\n  var fileParts = file && file.split('/');\n  var nameParts = name.trim().split('/');\n\n  if (nameParts[0].charAt(0) === '.' && fileParts) {\n    var normalizedBaseParts = fileParts.slice(0, fileParts.length - 1);\n    nameParts.unshift.apply(nameParts, normalizedBaseParts);\n  }\n\n  trimDots(nameParts);\n\n  return nameParts.join('/');\n}\n\nexport function join(path1, path2) {\n  if (!path1) {\n    return path2;\n  }\n\n  if (!path2) {\n    return path1;\n  }\n\n  var schemeMatch = path1.match(/^([^/]*?:)\\//);\n  var scheme = schemeMatch && schemeMatch.length > 0 ? schemeMatch[1] : '';\n  path1 = path1.substr(scheme.length);\n\n  var urlPrefix = void 0;\n  if (path1.indexOf('///') === 0 && scheme === 'file:') {\n    urlPrefix = '///';\n  } else if (path1.indexOf('//') === 0) {\n    urlPrefix = '//';\n  } else if (path1.indexOf('/') === 0) {\n    urlPrefix = '/';\n  } else {\n    urlPrefix = '';\n  }\n\n  var trailingSlash = path2.slice(-1) === '/' ? '/' : '';\n\n  var url1 = path1.split('/');\n  var url2 = path2.split('/');\n  var url3 = [];\n\n  for (var i = 0, ii = url1.length; i < ii; ++i) {\n    if (url1[i] === '..') {\n      if (url3.length && url3[url3.length - 1] !== '..') {\n        url3.pop();\n      } else {\n        url3.push(url1[i]);\n      }\n    } else if (url1[i] === '.' || url1[i] === '') {\n      continue;\n    } else {\n      url3.push(url1[i]);\n    }\n  }\n\n  for (var _i = 0, _ii = url2.length; _i < _ii; ++_i) {\n    if (url2[_i] === '..') {\n      if (url3.length && url3[url3.length - 1] !== '..') {\n        url3.pop();\n      } else {\n        url3.push(url2[_i]);\n      }\n    } else if (url2[_i] === '.' || url2[_i] === '') {\n      continue;\n    } else {\n      url3.push(url2[_i]);\n    }\n  }\n\n  return scheme + urlPrefix + url3.join('/') + trailingSlash;\n}\n\nvar encode = encodeURIComponent;\nvar encodeKey = function encodeKey(k) {\n  return encode(k).replace('%24', '$');\n};\n\nfunction buildParam(key, value, traditional) {\n  var result = [];\n  if (value === null || value === undefined) {\n    return result;\n  }\n  if (Array.isArray(value)) {\n    for (var i = 0, l = value.length; i < l; i++) {\n      if (traditional) {\n        result.push(encodeKey(key) + '=' + encode(value[i]));\n      } else {\n        var arrayKey = key + '[' + (_typeof(value[i]) === 'object' && value[i] !== null ? i : '') + ']';\n        result = result.concat(buildParam(arrayKey, value[i]));\n      }\n    }\n  } else if ((typeof value === 'undefined' ? 'undefined' : _typeof(value)) === 'object' && !traditional) {\n    for (var propertyName in value) {\n      result = result.concat(buildParam(key + '[' + propertyName + ']', value[propertyName]));\n    }\n  } else {\n    result.push(encodeKey(key) + '=' + encode(value));\n  }\n  return result;\n}\n\nexport function buildQueryString(params, traditional) {\n  var pairs = [];\n  var keys = Object.keys(params || {}).sort();\n  for (var i = 0, len = keys.length; i < len; i++) {\n    var key = keys[i];\n    pairs = pairs.concat(buildParam(key, params[key], traditional));\n  }\n\n  if (pairs.length === 0) {\n    return '';\n  }\n\n  return pairs.join('&');\n}\n\nfunction processScalarParam(existedParam, value) {\n  if (Array.isArray(existedParam)) {\n    existedParam.push(value);\n    return existedParam;\n  }\n  if (existedParam !== undefined) {\n    return [existedParam, value];\n  }\n\n  return value;\n}\n\nfunction parseComplexParam(queryParams, keys, value) {\n  var currentParams = queryParams;\n  var keysLastIndex = keys.length - 1;\n  for (var j = 0; j <= keysLastIndex; j++) {\n    var key = keys[j] === '' ? currentParams.length : keys[j];\n    if (j < keysLastIndex) {\n      var prevValue = !currentParams[key] || _typeof(currentParams[key]) === 'object' ? currentParams[key] : [currentParams[key]];\n      currentParams = currentParams[key] = prevValue || (isNaN(keys[j + 1]) ? {} : []);\n    } else {\n      currentParams = currentParams[key] = value;\n    }\n  }\n}\n\nexport function parseQueryString(queryString) {\n  var queryParams = {};\n  if (!queryString || typeof queryString !== 'string') {\n    return queryParams;\n  }\n\n  var query = queryString;\n  if (query.charAt(0) === '?') {\n    query = query.substr(1);\n  }\n\n  var pairs = query.replace(/\\+/g, ' ').split('&');\n  for (var i = 0; i < pairs.length; i++) {\n    var pair = pairs[i].split('=');\n    var key = decodeURIComponent(pair[0]);\n    if (!key) {\n      continue;\n    }\n\n    var keys = key.split('][');\n    var keysLastIndex = keys.length - 1;\n\n    if (/\\[/.test(keys[0]) && /\\]$/.test(keys[keysLastIndex])) {\n      keys[keysLastIndex] = keys[keysLastIndex].replace(/\\]$/, '');\n      keys = keys.shift().split('[').concat(keys);\n      keysLastIndex = keys.length - 1;\n    } else {\n      keysLastIndex = 0;\n    }\n\n    if (pair.length >= 2) {\n      var value = pair[1] ? decodeURIComponent(pair[1]) : '';\n      if (keysLastIndex) {\n        parseComplexParam(queryParams, keys, value);\n      } else {\n        queryParams[key] = processScalarParam(queryParams[key], value);\n      }\n    } else {\n      queryParams[key] = true;\n    }\n  }\n  return queryParams;\n}"],"sourceRoot":""}