1 line
No EOL
830 KiB
Text
1 line
No EOL
830 KiB
Text
{"version":3,"sources":["../src/import/v8cpuFormatter.ts","../src/import/chrome.ts","../src/import/stackprof.ts","../node_modules/pako/lib/utils/common.js","../node_modules/pako/lib/zlib/trees.js","../node_modules/pako/lib/zlib/adler32.js","../node_modules/pako/lib/zlib/crc32.js","../node_modules/pako/lib/zlib/messages.js","../node_modules/pako/lib/zlib/deflate.js","../node_modules/pako/lib/utils/strings.js","../node_modules/pako/lib/zlib/zstream.js","../node_modules/pako/lib/deflate.js","../node_modules/pako/lib/zlib/inffast.js","../node_modules/pako/lib/zlib/inftrees.js","../node_modules/pako/lib/zlib/inflate.js","../node_modules/pako/lib/zlib/constants.js","../node_modules/pako/lib/zlib/gzheader.js","../node_modules/pako/lib/inflate.js","../node_modules/pako/index.js","../src/import/utils.ts","../src/import/instruments.ts","../src/import/bg-flamegraph.ts","../src/import/firefox.ts","../src/import/v8proflog.ts","../src/import/linux-tools-perf.ts","../src/import/haskell.ts","../src/import/safari.ts","../node_modules/@protobufjs/aspromise/index.js","../node_modules/@protobufjs/base64/index.js","../node_modules/@protobufjs/eventemitter/index.js","../node_modules/@protobufjs/float/index.js","../node_modules/@protobufjs/inquire/index.js","../node_modules/@protobufjs/utf8/index.js","../node_modules/@protobufjs/pool/index.js","../node_modules/protobufjs/src/util/longbits.js","../node_modules/base64-js/index.js","../node_modules/ieee754/index.js","../node_modules/isarray/index.js","../node_modules/buffer/index.js","../node_modules/protobufjs/src/util/minimal.js","../node_modules/protobufjs/src/writer.js","../node_modules/protobufjs/src/writer_buffer.js","../node_modules/protobufjs/src/reader.js","../node_modules/protobufjs/src/reader_buffer.js","../node_modules/protobufjs/src/rpc/service.js","../node_modules/protobufjs/src/rpc.js","../node_modules/protobufjs/src/roots.js","../node_modules/protobufjs/src/index-minimal.js","../node_modules/protobufjs/minimal.js","../src/import/profile.proto.js","../src/import/pprof.ts","../src/import/v8heapalloc.ts","../src/import/trace-event.ts","../src/import/callgrind.ts","../src/import/index.ts"],"names":["$protobuf","require","$Reader","Reader","$Writer","Writer","$util","util","$root","roots","perftools","profiles","Profile","properties","sampleType","sample","mapping","location","stringTable","comment","keys","Object","i","length","prototype","emptyArray","dropFrames","Long","fromBits","keepFrames","timeNanos","durationNanos","periodType","period","defaultSampleType","create","encode","message","writer","ValueType","uint32","fork","ldelim","Sample","Mapping","Location","Function","string","hasOwnProperty","int64","encodeDelimited","decode","reader","end","undefined","len","pos","tag","push","end2","skipType","decodeDelimited","verify","Array","isArray","error","isString","isInteger","low","high","fromObject","object","TypeError","String","fromValue","unsigned","parseInt","LongBits","toNumber","toObject","options","arrays","defaults","long","longs","toString","Number","j","call","toJSON","constructor","toJSONOptions","type","unit","locationId","value","label","uint64","Label","key","str","num","numUnit","id","memoryStart","memoryLimit","fileOffset","filename","buildId","hasFunctions","hasFilenames","hasLineNumbers","hasInlineFrames","bool","Boolean","line","mappingId","address","isFolded","Line","functionId","name","systemName","startLine","module","exports"],"mappings":";AAsEC,aAxCD,SAAS,EAAY,GACb,MAAA,EAA0B,GAiBzB,OAhBE,SAAA,EAAM,GACb,EAAM,KAAK,CACT,GAAI,EAAK,GACT,UAAW,CACT,aAAc,EACd,aAAc,EAAK,aACnB,WAAY,EAAK,WACjB,SAAU,EAAK,SACf,IAAK,EAAK,KAEZ,SAAU,EAAK,SACf,SAAU,EAAK,SAAS,IAAI,GAAS,EAAM,MAE7C,EAAK,SAAS,QAAQ,GAExB,CAAM,GACC,EAGT,SAAS,EAAmB,EAAsB,GACzC,OAAA,EAAW,IAAI,CAAC,EAAW,KAEzB,OAAA,GADyB,IAAV,EAA0B,IAAZ,EAAsB,EAAW,EAAQ,MAQ3E,SAAU,EAAkB,GAEzB,MAAA,CACL,QAAS,EAAQ,QACjB,UAA+B,IAApB,EAAQ,UACnB,QAA2B,IAAlB,EAAQ,QACjB,MAAO,EAAY,EAAQ,MAC3B,WAAY,EAAmB,EAAQ,WAAY,EAAQ,YAE9D,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,kBAAA;;ACsQA,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,iBAAA,EAAA,QAAA,yBAAA,EAAA,QAAA,2BAAA,EAAA,QAAA,0BAAA,EA5UD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BACA,EAAA,QAAA,oBAgDM,SAAU,EAAiB,GAC3B,IAAC,MAAM,QAAQ,GAAa,OAAO,EACnC,GAAA,EAAW,OAAS,EAAG,OAAO,EAC5B,MAAA,EAAQ,EAAW,GACrB,MAAE,QAAS,GAAS,QAAS,GAAS,OAAQ,GAAS,QAAS,KAEjE,EAAW,KACV,GAAgB,eAAX,EAAE,MAAoC,YAAX,EAAE,MAAiC,iBAAX,EAAE,MAO1D,SAAU,EAAyB,EAAyB,GAI1D,MAAA,EAAiB,IAAI,IAGrB,EAAa,IAAI,IAGjB,EAAqB,IAAI,KAIxB,EAAA,EAAA,QAAA,EAAQ,GAAK,EAAE,IAEjB,IAAA,IAAI,KAAS,EAAQ,CACpB,GAAe,eAAf,EAAM,KAAuB,CACzB,MAAA,KAAY,EAAM,OAAO,EAAM,MAC/B,EAAK,EAAM,IAAM,EACvB,EAAe,IAAI,EAAI,EAAM,KAAK,KAAK,YACvC,EAAW,IAAI,EAAI,GAGjB,GAAe,YAAf,EAAM,KAAoB,CACtB,MAAA,KAAY,EAAM,OAAO,EAAM,MACrC,EAAe,IAAI,EAAM,IAAM,EAAM,OAAA,OAAA,CACnC,UAAW,EACX,QAAS,EACT,MAAO,GACP,QAAS,GACT,WAAY,IACT,EAAM,KAAK,OAGZ,EAAM,IACR,EAAW,IAAI,EAAM,MAAO,EAAM,OAAO,EAAM,OAQ/C,GAJe,gBAAf,EAAM,MACR,EAAmB,OAAO,EAAM,OAAO,EAAM,MAAO,EAAM,KAAK,MAG9C,iBAAf,EAAM,KAAyB,CAC3B,MAAA,KAAY,EAAM,OAAO,EAAM,MAC/B,EAAa,EAAe,IAAI,EAAM,IAAM,GAC9C,GAAA,EAAY,CACR,MAAA,EAAQ,EAAM,KAAK,KACrB,EAAM,aACJ,EAAM,WAAW,QACnB,EAAW,MAAQ,EAAW,MAAM,OAAO,EAAM,WAAW,QAE1D,EAAM,WAAW,UACnB,EAAW,QAAU,EAAW,QAAQ,OAAO,EAAM,WAAW,WAGhE,EAAM,aACR,EAAW,WAAa,EAAW,WAAW,OAAO,EAAM,aAEtC,MAAnB,EAAM,YACR,EAAW,UAAY,EAAM,WAEV,MAAjB,EAAM,UACR,EAAW,QAAU,EAAM,cAG7B,QAAQ,6DAA6D,EAAM,IAAM,MAKnF,GAAA,EAAe,KAAO,EAAG,CACrB,MAAA,EAAsB,GACxB,IAAA,EAAc,EAsBX,OApBG,EAAA,EAAA,WAAA,EAAe,OAAQ,IAC3B,IAAA,EAA4B,KAC5B,EAAS,EAAW,IAAI,GACxB,IACF,EAAa,EAAmB,IAAI,IAAW,MAI3C,MAAA,EAAU,EAA2B,EAAe,IAAI,IAC1D,GAAc,EAAe,KAAO,GACtC,EAAQ,WAAW,OAAc,KACd,mBAAf,IACF,EAAc,EAAS,SAGzB,EAAQ,WAAW,KAErB,EAAS,KAAK,KAGT,CAAC,KAAM,EAAU,YAAA,EAAa,SAAA,GAE/B,MAAA,IAAI,MAAM,0CAIpB,MAAM,EAAuB,IAAI,IACjC,SAAS,EAAsB,GACtB,OAAA,EAAY,EAAA,aAAA,EAAsB,EAAW,IAC5C,MAAA,EAAO,EAAU,cAAgB,cACjC,EAAO,EAAU,IAMnB,IAAA,EAAO,EAAU,WACT,MAAR,GAAc,IAEd,IAAA,EAAM,EAAU,aAGb,OAFI,MAAP,GAAa,IAEV,CACL,OAAQ,KAAQ,KAAQ,KAAQ,IAChC,KAAA,EACA,KAAA,EACA,KAAA,EACA,IAAA,KAKN,SAAS,EAAqB,GACtB,MAAA,aAAC,EAAD,IAAe,GAAO,EACxB,MAAQ,oBAAR,IAMoB,WAAjB,GAA8C,WAAjB,GAGtC,SAAS,EAAgC,GAChC,MAAiB,wBAAjB,GAA2D,cAAjB,EAG7C,SAAU,EAA2B,GACnC,MAAA,EAAU,IAAI,EAAJ,uBAA2B,EAAc,QAAU,EAAc,WAE3E,EAAW,IAAI,IAChB,IAAA,IAAI,KAAQ,EAAc,MAC7B,EAAS,IAAI,EAAK,GAAI,GAEnB,IAAA,IAAI,KAAQ,EAAc,MAKzB,GAJuB,iBAAhB,EAAK,SACd,EAAK,OAAS,EAAS,IAAI,EAAK,SAG7B,EAAK,SACL,IAAA,IAAI,KAAW,EAAK,SAAU,CAC3B,MAAA,EAAQ,EAAS,IAAI,GACtB,IACL,EAAM,OAAS,GAIb,MAAA,EAAoB,GACpB,EAAwB,GAI1B,IAAA,EAAU,EAAc,WAAW,GAInC,EAAmB,EAEnB,EAAa,IAIZ,IAAA,IAAI,EAAI,EAAG,EAAI,EAAc,QAAQ,OAAQ,IAAK,CAC/C,MAAA,EAAS,EAAc,QAAQ,GAWjC,GAVA,GAAU,IACZ,EAAQ,KAAK,GACT,EAAU,EACZ,EAAY,KAAK,IAEjB,EAAY,KAAK,GACjB,EAAmB,IAInB,IAAM,EAAc,QAAQ,OAAS,EAClC,MAAM,KACT,EAAQ,KAAK,GACT,EAAU,EACZ,EAAY,KAAK,IAEjB,EAAY,KAAK,GACjB,EAAmB,QAGlB,CAEL,GADkB,EAAc,WAAW,EAAI,GAE/C,EAAa,GAIb,IAAA,EAA8B,GAE7B,IAAA,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACjC,MAAA,EAAQ,EAAY,GACpB,EAAS,EAAQ,GACnB,IAAA,EAAW,EAAS,IAAI,GACxB,IAAC,EAAU,SAGX,IAAA,EAA6B,KAK/B,IAAA,EAAM,EACN,IAAmC,IAA5B,EAAU,QAAQ,GACzB,EAAM,EAAgC,EAAI,UAAU,eAChD,EAAO,EAAA,QAAA,GACP,EAAI,QAAU,MAIb,KAAA,EAAU,OAAS,IAAK,EAAO,EAAA,QAAA,IAAc,GAAK,CACjD,MACA,EAAQ,EADM,EAAU,MACkB,WAChD,EAAQ,WAAW,EAAO,GAItB,MAAA,EAA2B,GAE/B,IAAA,IAAI,EAA8B,EAClC,GAAQ,GAAQ,IAAQ,EAAqB,EAAK,WAElD,EAAO,EAAgC,EAAK,UAAU,eAClD,EAAO,EAAA,QAAA,GACP,EAAK,QAAU,KAEnB,EAAO,KAAK,GAEd,EAAO,UAEF,IAAA,IAAI,KAAQ,EACf,EAAQ,WAAW,EAAsB,EAAK,WAAY,GAG5D,EAAY,EAAU,OAAO,GAI1B,IAAA,IAAI,EAAI,EAAU,OAAS,EAAG,GAAK,EAAG,IACzC,EAAQ,WAAW,EAAsB,EAAU,GAAG,YAAY,EAAO,EAAA,QAAA,IAIpE,OADP,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBACrC,EAAQ,QAGX,SAAU,EAA0B,GACjC,OAAA,GAA2B,EAAkB,EAAA,mBAAA;;ACtRrD,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,oBAAA,EAnDD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,2BAcM,SAAU,EAAoB,GAC5B,MAAA,EAAW,EAAiB,qBAAqB,OAAO,CAAC,EAAG,IAAM,EAAI,EAAG,GACzE,EAAU,IAAI,EAAJ,wBAA4B,IAEtC,OAAC,EAAD,IAAS,EAAT,qBAAc,GAAwB,EACxC,IAAA,EAAc,EAEd,EAAyB,GAExB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAI,QAAU,CAC1B,MAAA,EAAc,EAAI,KAEpB,IAAA,EAAqB,GACpB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAa,IAAK,CAC9B,MAAA,EAAK,EAAI,KACf,EAAM,KAAI,OAAA,OAAA,CACR,IAAK,GACF,EAAO,KAGO,IAAjB,EAAM,QAAkC,yBAAlB,EAAM,GAAG,OACjC,EAAQ,EAAU,OAAO,IAErB,MAAA,EAAW,EAAI,KAEjB,IAAA,EAAiB,EAChB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAU,IAC5B,GAAkB,EAAqB,KAGzC,EAAQ,uBAAuB,EAAO,GACtC,EAAY,EAIP,OADP,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBACrC,EAAQ;;ACpDjB,aAGA,IAAA,EAAA,oBAAA,YACA,oBAAA,aACA,oBAAA,WAEA,SAAA,EAAA,EAAA,GACA,OAAA,OAAA,UAAA,eAAA,KAAA,EAAA,GAGA,QAAA,OAAA,SAAA,GAEA,IADA,IAAA,EAAA,MAAA,UAAA,MAAA,KAAA,UAAA,GACA,EAAA,QAAA,CACA,IAAA,EAAA,EAAA,QACA,GAAA,EAAA,CAEA,GAAA,iBAAA,EACA,MAAA,IAAA,UAAA,EAAA,sBAGA,IAAA,IAAA,KAAA,EACA,EAAA,EAAA,KACA,EAAA,GAAA,EAAA,KAKA,OAAA,GAKA,QAAA,UAAA,SAAA,EAAA,GACA,OAAA,EAAA,SAAA,EAAA,EACA,EAAA,SAAA,EAAA,SAAA,EAAA,IACA,EAAA,OAAA,EACA,IAIA,IAAA,EAAA,CACA,SAAA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,EAAA,UAAA,EAAA,SACA,EAAA,IAAA,EAAA,SAAA,EAAA,EAAA,GAAA,QAIA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAIA,cAAA,SAAA,GACA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAIA,IADA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,OAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,OAMA,IAFA,EAAA,IAAA,WAAA,GACA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,OAAA,EAAA,EAAA,IACA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,GACA,GAAA,EAAA,OAGA,OAAA,IAIA,EAAA,CACA,SAAA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAIA,cAAA,SAAA,GACA,MAAA,GAAA,OAAA,MAAA,GAAA,KAOA,QAAA,SAAA,SAAA,GACA,GACA,QAAA,KAAA,WACA,QAAA,MAAA,YACA,QAAA,MAAA,WACA,QAAA,OAAA,QAAA,KAEA,QAAA,KAAA,MACA,QAAA,MAAA,MACA,QAAA,MAAA,MACA,QAAA,OAAA,QAAA,KAIA,QAAA,SAAA;;ACxGA,aAqBA,IAAA,EAAA,QAAA,mBASA,EAAA,EAIA,EAAA,EACA,EAAA,EAEA,EAAA,EAKA,SAAA,EAAA,GAAA,IAAA,IAAA,EAAA,EAAA,SAAA,GAAA,GAAA,EAAA,GAAA,EAIA,IAAA,EAAA,EACA,EAAA,EACA,EAAA,EAGA,EAAA,EACA,EAAA,IAQA,EAAA,GAGA,EAAA,IAGA,EAAA,EAAA,EAAA,EAGA,EAAA,GAGA,EAAA,GAGA,EAAA,EAAA,EAAA,EAGA,EAAA,GAGA,EAAA,GAQA,EAAA,EAGA,EAAA,IAGA,EAAA,GAGA,EAAA,GAGA,EAAA,GAIA,EACA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,EACA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAEA,EACA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,EACA,CAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAaA,EAAA,IAGA,EAAA,IAAA,MAAA,GAAA,EAAA,IACA,EAAA,GAOA,IAAA,EAAA,IAAA,MAAA,EAAA,GACA,EAAA,GAKA,IAAA,EAAA,IAAA,MAAA,GACA,EAAA,GAMA,IAAA,EAAA,IAAA,MAAA,EAAA,EAAA,GACA,EAAA,GAGA,IAAA,EAAA,IAAA,MAAA,GACA,EAAA,GAGA,IAkBA,EACA,EACA,EApBA,EAAA,IAAA,MAAA,GAKA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,KAAA,YAAA,EACA,KAAA,WAAA,EACA,KAAA,WAAA,EACA,KAAA,MAAA,EACA,KAAA,WAAA,EAGA,KAAA,UAAA,GAAA,EAAA,OASA,SAAA,EAAA,EAAA,GACA,KAAA,SAAA,EACA,KAAA,SAAA,EACA,KAAA,UAAA,EAKA,SAAA,EAAA,GACA,OAAA,EAAA,IAAA,EAAA,GAAA,EAAA,KAAA,IAAA,IAQA,SAAA,EAAA,EAAA,GAGA,EAAA,YAAA,EAAA,WAAA,IAAA,EACA,EAAA,YAAA,EAAA,WAAA,IAAA,EAAA,IAQA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,SAAA,EAAA,GACA,EAAA,QAAA,GAAA,EAAA,SAAA,MACA,EAAA,EAAA,EAAA,QACA,EAAA,OAAA,GAAA,EAAA,EAAA,SACA,EAAA,UAAA,EAAA,IAEA,EAAA,QAAA,GAAA,EAAA,SAAA,MACA,EAAA,UAAA,GAKA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,IASA,SAAA,EAAA,EAAA,GACA,IAAA,EAAA,EACA,GACA,GAAA,EAAA,EACA,KAAA,EACA,IAAA,UACA,EAAA,GACA,OAAA,IAAA,EAOA,SAAA,EAAA,GACA,KAAA,EAAA,UACA,EAAA,EAAA,EAAA,QACA,EAAA,OAAA,EACA,EAAA,SAAA,GAEA,EAAA,UAAA,IACA,EAAA,YAAA,EAAA,WAAA,IAAA,EAAA,OACA,EAAA,SAAA,EACA,EAAA,UAAA,GAeA,SAAA,EAAA,EAAA,GAIA,IAOA,EACA,EAAA,EACA,EACA,EACA,EAXA,EAAA,EAAA,SACA,EAAA,EAAA,SACA,EAAA,EAAA,UAAA,YACA,EAAA,EAAA,UAAA,UACA,EAAA,EAAA,UAAA,WACA,EAAA,EAAA,UAAA,WACA,EAAA,EAAA,UAAA,WAMA,EAAA,EAEA,IAAA,EAAA,EAAA,GAAA,EAAA,IACA,EAAA,SAAA,GAAA,EAQA,IAFA,EAAA,EAAA,EAAA,KAAA,EAAA,UAAA,GAAA,EAEA,EAAA,EAAA,SAAA,EAAA,EAAA,EAAA,KAEA,EAAA,EAAA,EAAA,EAAA,GADA,EAAA,EAAA,KAAA,IACA,GAAA,GAAA,GACA,IACA,EAAA,EACA,KAEA,EAAA,EAAA,EAAA,GAAA,EAGA,EAAA,IAEA,EAAA,SAAA,KACA,EAAA,EACA,GAAA,IACA,EAAA,EAAA,EAAA,IAEA,EAAA,EAAA,EAAA,GACA,EAAA,SAAA,GAAA,EAAA,GACA,IACA,EAAA,YAAA,GAAA,EAAA,EAAA,EAAA,GAAA,KAGA,GAAA,IAAA,EAAA,CAMA,EAAA,CAEA,IADA,EAAA,EAAA,EACA,IAAA,EAAA,SAAA,IAAA,IACA,EAAA,SAAA,KACA,EAAA,SAAA,EAAA,IAAA,EACA,EAAA,SAAA,KAIA,GAAA,QACA,EAAA,GAOA,IAAA,EAAA,EAAA,IAAA,EAAA,IAEA,IADA,EAAA,EAAA,SAAA,GACA,IAAA,IACA,EAAA,EAAA,OAAA,IACA,IACA,EAAA,EAAA,EAAA,KAAA,IAEA,EAAA,UAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,GAAA,GAEA,MAcA,SAAA,EAAA,EAAA,EAAA,GAKA,IAEA,EACA,EAHA,EAAA,IAAA,MAAA,EAAA,GACA,EAAA,EAOA,IAAA,EAAA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EASA,IAAA,EAAA,EAAA,GAAA,EAAA,IAAA,CACA,IAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,IAEA,EAAA,EAAA,GAAA,EAAA,EAAA,KAAA,KAWA,SAAA,IACA,IAAA,EACA,EACA,EACA,EACA,EACA,EAAA,IAAA,MAAA,EAAA,GAiBA,IADA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA,IADA,EAAA,GAAA,EACA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IACA,EAAA,KAAA,EAYA,IAJA,EAAA,EAAA,GAAA,EAGA,EAAA,EACA,EAAA,EAAA,EAAA,GAAA,IAEA,IADA,EAAA,GAAA,EACA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IACA,EAAA,KAAA,EAKA,IADA,IAAA,EACA,EAAA,EAAA,IAEA,IADA,EAAA,GAAA,GAAA,EACA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IACA,EAAA,IAAA,KAAA,EAMA,IAAA,EAAA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAIA,IADA,EAAA,EACA,GAAA,KACA,EAAA,EAAA,EAAA,GAAA,EACA,IACA,EAAA,KAEA,KAAA,GAAA,KACA,EAAA,EAAA,EAAA,GAAA,EACA,IACA,EAAA,KAEA,KAAA,GAAA,KACA,EAAA,EAAA,EAAA,GAAA,EACA,IACA,EAAA,KAEA,KAAA,GAAA,KACA,EAAA,EAAA,EAAA,GAAA,EACA,IACA,EAAA,KASA,IAHA,EAAA,EAAA,EAAA,EAAA,GAGA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,GAAA,EACA,EAAA,EAAA,GAAA,EAAA,EAAA,GAIA,EAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,IAAA,MAAA,GAAA,EAAA,EAAA,EAAA,GASA,SAAA,EAAA,GACA,IAAA,EAGA,IAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,UAAA,EAAA,GAAA,EACA,IAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,UAAA,EAAA,GAAA,EACA,IAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,QAAA,EAAA,GAAA,EAEA,EAAA,UAAA,EAAA,GAAA,EACA,EAAA,QAAA,EAAA,WAAA,EACA,EAAA,SAAA,EAAA,QAAA,EAOA,SAAA,EAAA,GAEA,EAAA,SAAA,EACA,EAAA,EAAA,EAAA,QACA,EAAA,SAAA,IAEA,EAAA,YAAA,EAAA,WAAA,EAAA,QAEA,EAAA,OAAA,EACA,EAAA,SAAA,EAOA,SAAA,EAAA,EAAA,EAAA,EAAA,GAMA,EAAA,GAEA,IACA,EAAA,EAAA,GACA,EAAA,GAAA,IAKA,EAAA,SAAA,EAAA,YAAA,EAAA,OAAA,EAAA,EAAA,EAAA,SACA,EAAA,SAAA,EAOA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,EACA,EAAA,EAAA,EACA,OAAA,EAAA,GAAA,EAAA,IACA,EAAA,KAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GASA,SAAA,EAAA,EAAA,EAAA,GAOA,IAFA,IAAA,EAAA,EAAA,KAAA,GACA,EAAA,GAAA,EACA,GAAA,EAAA,WAEA,EAAA,EAAA,UACA,EAAA,EAAA,EAAA,KAAA,EAAA,GAAA,EAAA,KAAA,GAAA,EAAA,QACA,KAGA,EAAA,EAAA,EAAA,EAAA,KAAA,GAAA,EAAA,SAGA,EAAA,KAAA,GAAA,EAAA,KAAA,GACA,EAAA,EAGA,IAAA,EAEA,EAAA,KAAA,GAAA,EAUA,SAAA,GAAA,EAAA,EAAA,GAKA,IAAA,EACA,EAEA,EACA,EAFA,EAAA,EAIA,GAAA,IAAA,EAAA,SACA,GACA,EAAA,EAAA,YAAA,EAAA,MAAA,EAAA,IAAA,EAAA,EAAA,YAAA,EAAA,MAAA,EAAA,EAAA,GACA,EAAA,EAAA,YAAA,EAAA,MAAA,GACA,IAEA,IAAA,EACA,EAAA,EAAA,EAAA,IAKA,EAAA,GADA,EAAA,EAAA,IACA,EAAA,EAAA,GAEA,KADA,EAAA,EAAA,KAGA,EAAA,EADA,GAAA,EAAA,GACA,GAMA,EAAA,EAHA,EAAA,IADA,GAIA,GAEA,KADA,EAAA,EAAA,KAGA,EAAA,EADA,GAAA,EAAA,GACA,UAQA,EAAA,EAAA,UAGA,EAAA,EAAA,EAAA,GAYA,SAAA,GAAA,EAAA,GAIA,IAIA,EAAA,EAEA,EANA,EAAA,EAAA,SACA,EAAA,EAAA,UAAA,YACA,EAAA,EAAA,UAAA,UACA,EAAA,EAAA,UAAA,MAEA,GAAA,EAUA,IAHA,EAAA,SAAA,EACA,EAAA,SAAA,EAEA,EAAA,EAAA,EAAA,EAAA,IACA,IAAA,EAAA,EAAA,IACA,EAAA,OAAA,EAAA,UAAA,EAAA,EACA,EAAA,MAAA,GAAA,GAGA,EAAA,EAAA,EAAA,GAAA,EASA,KAAA,EAAA,SAAA,GAEA,EAAA,GADA,EAAA,EAAA,OAAA,EAAA,UAAA,EAAA,IAAA,EAAA,IACA,EACA,EAAA,MAAA,GAAA,EACA,EAAA,UAEA,IACA,EAAA,YAAA,EAAA,EAAA,EAAA,IASA,IALA,EAAA,SAAA,EAKA,EAAA,EAAA,UAAA,EAAA,GAAA,EAAA,IAAA,EAAA,EAAA,EAAA,GAKA,EAAA,EACA,GAGA,EAAA,EAAA,KAAA,GACA,EAAA,KAAA,GAAA,EAAA,KAAA,EAAA,YACA,EAAA,EAAA,EAAA,GAGA,EAAA,EAAA,KAAA,GAEA,EAAA,OAAA,EAAA,UAAA,EACA,EAAA,OAAA,EAAA,UAAA,EAGA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,MAAA,IAAA,EAAA,MAAA,IAAA,EAAA,MAAA,GAAA,EAAA,MAAA,GAAA,EAAA,MAAA,IAAA,EACA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAGA,EAAA,KAAA,GAAA,IACA,EAAA,EAAA,EAAA,SAEA,EAAA,UAAA,GAEA,EAAA,OAAA,EAAA,UAAA,EAAA,KAAA,GAKA,EAAA,EAAA,GAGA,EAAA,EAAA,EAAA,EAAA,UAQA,SAAA,GAAA,EAAA,EAAA,GAKA,IAAA,EAEA,EADA,GAAA,EAGA,EAAA,EAAA,GAEA,EAAA,EACA,EAAA,EACA,EAAA,EAQA,IANA,IAAA,IACA,EAAA,IACA,EAAA,GAEA,EAAA,GAAA,EAAA,GAAA,GAAA,MAEA,EAAA,EAAA,GAAA,EAAA,IACA,EAAA,EACA,EAAA,EAAA,GAAA,EAAA,GAAA,KAEA,EAAA,GAAA,IAAA,IAGA,EAAA,EACA,EAAA,QAAA,EAAA,IAAA,EAEA,IAAA,GAEA,IAAA,GAAA,EAAA,QAAA,EAAA,KACA,EAAA,QAAA,EAAA,MAEA,GAAA,GACA,EAAA,QAAA,EAAA,KAGA,EAAA,QAAA,EAAA,KAGA,EAAA,EACA,EAAA,EAEA,IAAA,GACA,EAAA,IACA,EAAA,GAEA,IAAA,GACA,EAAA,EACA,EAAA,IAGA,EAAA,EACA,EAAA,IAUA,SAAA,GAAA,EAAA,EAAA,GAKA,IAAA,EAEA,EADA,GAAA,EAGA,EAAA,EAAA,GAEA,EAAA,EACA,EAAA,EACA,EAAA,EAQA,IALA,IAAA,IACA,EAAA,IACA,EAAA,GAGA,EAAA,EAAA,GAAA,EAAA,IAIA,GAHA,EAAA,EACA,EAAA,EAAA,GAAA,EAAA,GAAA,OAEA,EAAA,GAAA,IAAA,GAAA,CAGA,GAAA,EAAA,EACA,GAAA,EAAA,EAAA,EAAA,EAAA,eAAA,KAAA,QAEA,IAAA,GACA,IAAA,IACA,EAAA,EAAA,EAAA,EAAA,SACA,KAGA,EAAA,EAAA,EAAA,EAAA,SACA,EAAA,EAAA,EAAA,EAAA,IAEA,GAAA,IACA,EAAA,EAAA,EAAA,EAAA,SACA,EAAA,EAAA,EAAA,EAAA,KAGA,EAAA,EAAA,EAAA,EAAA,SACA,EAAA,EAAA,EAAA,GAAA,IAGA,EAAA,EACA,EAAA,EACA,IAAA,GACA,EAAA,IACA,EAAA,GAEA,IAAA,GACA,EAAA,EACA,EAAA,IAGA,EAAA,EACA,EAAA,IAUA,SAAA,GAAA,GACA,IAAA,EAgBA,IAbA,GAAA,EAAA,EAAA,UAAA,EAAA,OAAA,UACA,GAAA,EAAA,EAAA,UAAA,EAAA,OAAA,UAGA,GAAA,EAAA,EAAA,SASA,EAAA,EAAA,EAAA,GAAA,GACA,IAAA,EAAA,QAAA,EAAA,EAAA,GAAA,GADA,KAUA,OAJA,EAAA,SAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAIA,EASA,SAAA,GAAA,EAAA,EAAA,EAAA,GAIA,IAAA,EASA,IAHA,EAAA,EAAA,EAAA,IAAA,GACA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,IAEA,EAAA,EAAA,EAAA,QAAA,EAAA,EAAA,GAAA,GAAA,GAIA,GAAA,EAAA,EAAA,UAAA,EAAA,GAGA,GAAA,EAAA,EAAA,UAAA,EAAA,GAkBA,SAAA,GAAA,GAKA,IACA,EADA,EAAA,WAIA,IAAA,EAAA,EAAA,GAAA,GAAA,IAAA,KAAA,EACA,GAAA,EAAA,GAAA,IAAA,EAAA,UAAA,EAAA,GACA,OAAA,EAKA,GAAA,IAAA,EAAA,UAAA,KAAA,IAAA,EAAA,UAAA,KACA,IAAA,EAAA,UAAA,IACA,OAAA,EAEA,IAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,IAAA,EAAA,UAAA,EAAA,GACA,OAAA,EAOA,OAAA,EAn1BA,EAAA,GAu1BA,IAAA,IAAA,EAKA,SAAA,GAAA,GAGA,KACA,IACA,IAAA,GAGA,EAAA,OAAA,IAAA,EAAA,EAAA,UAAA,GACA,EAAA,OAAA,IAAA,EAAA,EAAA,UAAA,GACA,EAAA,QAAA,IAAA,EAAA,EAAA,QAAA,GAEA,EAAA,OAAA,EACA,EAAA,SAAA,EAGA,EAAA,GAOA,SAAA,GAAA,EAAA,EAAA,EAAA,GAMA,EAAA,GAAA,GAAA,IAAA,EAAA,EAAA,GAAA,GACA,EAAA,EAAA,EAAA,GAAA,GAQA,SAAA,GAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,EAAA,GACA,EAAA,GAQA,SAAA,GAAA,EAAA,EAAA,EAAA,GAMA,IAAA,EAAA,EACA,EAAA,EAGA,EAAA,MAAA,GAGA,EAAA,KAAA,YAAA,IACA,EAAA,KAAA,UAAA,GAAA,IAIA,GAAA,EAAA,EAAA,QAIA,GAAA,EAAA,EAAA,QAUA,EAAA,GAAA,GAGA,EAAA,EAAA,QAAA,EAAA,IAAA,GACA,EAAA,EAAA,WAAA,EAAA,IAAA,IAMA,IAAA,EAAA,IAIA,EAAA,EAAA,EAAA,EAGA,EAAA,GAAA,IAAA,IAAA,EASA,GAAA,EAAA,EAAA,EAAA,GAEA,EAAA,WAAA,GAAA,IAAA,GAEA,EAAA,GAAA,GAAA,IAAA,EAAA,EAAA,GAAA,GACA,GAAA,EAAA,EAAA,KAGA,EAAA,GAAA,GAAA,IAAA,EAAA,EAAA,GAAA,GACA,GAAA,EAAA,EAAA,OAAA,SAAA,EAAA,EAAA,OAAA,SAAA,EAAA,EAAA,GACA,GAAA,EAAA,EAAA,UAAA,EAAA,YAMA,EAAA,GAEA,GACA,EAAA,GAUA,SAAA,GAAA,EAAA,EAAA,GAmDA,OA5CA,EAAA,YAAA,EAAA,MAAA,EAAA,EAAA,UAAA,IAAA,EAAA,IACA,EAAA,YAAA,EAAA,MAAA,EAAA,EAAA,SAAA,GAAA,IAAA,EAEA,EAAA,YAAA,EAAA,MAAA,EAAA,UAAA,IAAA,EACA,EAAA,WAEA,IAAA,EAEA,EAAA,UAAA,EAAA,MAEA,EAAA,UAEA,IAKA,EAAA,UAAA,GAAA,EAAA,GAAA,EAAA,MACA,EAAA,UAAA,EAAA,EAAA,OA0BA,EAAA,WAAA,EAAA,YAAA,EAOA,QAAA,SAAA,GACA,QAAA,iBAAA,GACA,QAAA,gBAAA,GACA,QAAA,UAAA,GACA,QAAA,UAAA;;ACnsCA,aAyBA,SAAA,EAAA,EAAA,EAAA,EAAA,GAKA,IAJA,IAAA,EAAA,MAAA,EAAA,EACA,EAAA,IAAA,GAAA,MAAA,EACA,EAAA,EAEA,IAAA,GAAA,CAKA,GADA,EAAA,EAAA,IAAA,IAAA,EAGA,GAEA,EAAA,GADA,EAAA,EAAA,EAAA,KAAA,GACA,UACA,GAEA,GAAA,MACA,GAAA,MAGA,OAAA,EAAA,GAAA,GAAA,EAIA,OAAA,QAAA;;AClDA,aA0BA,SAAA,IAGA,IAFA,IAAA,EAAA,EAAA,GAEA,EAAA,EAAA,EAAA,IAAA,IAAA,CACA,EAAA,EACA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,WAAA,IAAA,EAAA,IAAA,EAEA,EAAA,GAAA,EAGA,OAAA,EAIA,IAAA,EAAA,IAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EACA,EAAA,EAAA,EAEA,IAAA,EAEA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,IAAA,EAAA,EAAA,KAAA,EAAA,EAAA,KAGA,OAAA,EAAA,EAIA,OAAA,QAAA;;AC1DA,aAqBA,OAAA,QAAA,CACA,EAAA,kBACA,EAAA,aACA,EAAA,GACA,KAAA,aACA,KAAA,eACA,KAAA,aACA,KAAA,sBACA,KAAA,eACA,KAAA;;AC9BA,aAqBA,IAkgCA,EAlgCA,EAAA,QAAA,mBACA,EAAA,QAAA,WACA,EAAA,QAAA,aACA,EAAA,QAAA,WACA,EAAA,QAAA,cAOA,EAAA,EACA,EAAA,EAEA,EAAA,EACA,EAAA,EACA,EAAA,EAOA,EAAA,EACA,EAAA,EAGA,GAAA,EACA,GAAA,EAEA,GAAA,EAQA,GAAA,EAGA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EAMA,EAAA,EAIA,EAAA,EAKA,EAAA,EAEA,EAAA,GAEA,EAAA,EAGA,EAAA,GAEA,EAAA,IAEA,EAAA,EAAA,EAAA,EAEA,EAAA,GAEA,EAAA,GAEA,EAAA,EAAA,EAAA,EAEA,EAAA,GAGA,EAAA,EACA,EAAA,IACA,EAAA,EAAA,EAAA,EAEA,EAAA,GAEA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,IACA,EAAA,IACA,EAAA,IAEA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EAEA,EAAA,EAEA,SAAA,EAAA,EAAA,GAEA,OADA,EAAA,IAAA,EAAA,GACA,EAGA,SAAA,EAAA,GACA,OAAA,GAAA,IAAA,EAAA,EAAA,EAAA,GAGA,SAAA,EAAA,GAAA,IAAA,IAAA,EAAA,EAAA,SAAA,GAAA,GAAA,EAAA,GAAA,EASA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,MAGA,EAAA,EAAA,QACA,EAAA,EAAA,YACA,EAAA,EAAA,WAEA,IAAA,IAEA,EAAA,SAAA,EAAA,OAAA,EAAA,YAAA,EAAA,YAAA,EAAA,EAAA,UACA,EAAA,UAAA,EACA,EAAA,aAAA,EACA,EAAA,WAAA,EACA,EAAA,WAAA,EACA,EAAA,SAAA,EACA,IAAA,EAAA,UACA,EAAA,YAAA,IAKA,SAAA,GAAA,EAAA,GACA,EAAA,gBAAA,EAAA,EAAA,aAAA,EAAA,EAAA,aAAA,EAAA,EAAA,SAAA,EAAA,YAAA,GACA,EAAA,YAAA,EAAA,SACA,EAAA,EAAA,MAIA,SAAA,GAAA,EAAA,GACA,EAAA,YAAA,EAAA,WAAA,EASA,SAAA,GAAA,EAAA,GAGA,EAAA,YAAA,EAAA,WAAA,IAAA,EAAA,IACA,EAAA,YAAA,EAAA,WAAA,IAAA,EAWA,SAAA,GAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,SAGA,OADA,EAAA,IAAA,EAAA,GACA,IAAA,EAAA,GAEA,EAAA,UAAA,EAGA,EAAA,SAAA,EAAA,EAAA,MAAA,EAAA,QAAA,EAAA,GACA,IAAA,EAAA,MAAA,KACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,EAAA,GAGA,IAAA,EAAA,MAAA,OACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,EAAA,IAGA,EAAA,SAAA,EACA,EAAA,UAAA,EAEA,GAaA,SAAA,GAAA,EAAA,GACA,IAEA,EACA,EAHA,EAAA,EAAA,iBACA,EAAA,EAAA,SAGA,EAAA,EAAA,YACA,EAAA,EAAA,WACA,EAAA,EAAA,SAAA,EAAA,OAAA,EACA,EAAA,UAAA,EAAA,OAAA,GAAA,EAEA,EAAA,EAAA,OAEA,EAAA,EAAA,OACA,EAAA,EAAA,KAMA,EAAA,EAAA,SAAA,EACA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,GAQA,EAAA,aAAA,EAAA,aACA,IAAA,GAKA,EAAA,EAAA,YAAA,EAAA,EAAA,WAIA,GAaA,GAAA,GAXA,EAAA,GAWA,KAAA,GACA,EAAA,EAAA,EAAA,KAAA,GACA,EAAA,KAAA,EAAA,IACA,IAAA,KAAA,EAAA,EAAA,GAHA,CAaA,GAAA,EACA,IAMA,UAEA,IAAA,KAAA,IAAA,IAAA,IAAA,KAAA,IAAA,IACA,IAAA,KAAA,IAAA,IAAA,IAAA,KAAA,IAAA,IACA,IAAA,KAAA,IAAA,IAAA,IAAA,KAAA,IAAA,IACA,IAAA,KAAA,IAAA,IAAA,IAAA,KAAA,IAAA,IACA,EAAA,GAOA,GAHA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,EAEA,EAAA,EAAA,CAGA,GAFA,EAAA,YAAA,EACA,EAAA,EACA,GAAA,EACA,MAEA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,YAEA,EAAA,EAAA,EAAA,IAAA,GAAA,KAAA,GAEA,OAAA,GAAA,EAAA,UACA,EAEA,EAAA,UAcA,SAAA,GAAA,GACA,IACA,EAAA,EAAA,EAAA,EAAA,EADA,EAAA,EAAA,OAKA,EAAA,CAqBA,GApBA,EAAA,EAAA,YAAA,EAAA,UAAA,EAAA,SAoBA,EAAA,UAAA,GAAA,EAAA,GAAA,CAEA,EAAA,SAAA,EAAA,OAAA,EAAA,OAAA,EAAA,EAAA,GACA,EAAA,aAAA,EACA,EAAA,UAAA,EAEA,EAAA,aAAA,EAUA,EADA,EAAA,EAAA,UAEA,GACA,EAAA,EAAA,OAAA,GACA,EAAA,KAAA,GAAA,GAAA,EAAA,EAAA,EAAA,UACA,GAGA,EADA,EAAA,EAEA,GACA,EAAA,EAAA,OAAA,GACA,EAAA,KAAA,GAAA,GAAA,EAAA,EAAA,EAAA,UAIA,GAEA,GAAA,EAEA,GAAA,IAAA,EAAA,KAAA,SACA,MAmBA,GAJA,EAAA,GAAA,EAAA,KAAA,EAAA,OAAA,EAAA,SAAA,EAAA,UAAA,GACA,EAAA,WAAA,EAGA,EAAA,UAAA,EAAA,QAAA,EASA,IARA,EAAA,EAAA,SAAA,EAAA,OACA,EAAA,MAAA,EAAA,OAAA,GAGA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,IAAA,EAAA,UAIA,EAAA,SAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,EAAA,IAAA,EAAA,UAEA,EAAA,KAAA,EAAA,EAAA,QAAA,EAAA,KAAA,EAAA,OACA,EAAA,KAAA,EAAA,OAAA,EACA,IACA,EAAA,WACA,EAAA,UAAA,EAAA,OAAA,aASA,EAAA,UAAA,GAAA,IAAA,EAAA,KAAA,UAiDA,SAAA,GAAA,EAAA,GAIA,IAAA,EAAA,MAOA,IALA,EAAA,EAAA,iBAAA,IACA,EAAA,EAAA,iBAAA,KAIA,CAEA,GAAA,EAAA,WAAA,EAAA,CAUA,GADA,GAAA,GACA,IAAA,EAAA,WAAA,IAAA,EACA,OAAA,EAGA,GAAA,IAAA,EAAA,UACA,MAOA,EAAA,UAAA,EAAA,UACA,EAAA,UAAA,EAGA,IAAA,EAAA,EAAA,YAAA,EAEA,IAAA,IAAA,EAAA,UAAA,EAAA,UAAA,KAEA,EAAA,UAAA,EAAA,SAAA,EACA,EAAA,SAAA,EAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,OAAA,EASA,GAAA,EAAA,SAAA,EAAA,aAAA,EAAA,OAAA,IAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,OAAA,EAQA,OAFA,EAAA,OAAA,EAEA,IAAA,GAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,UACA,EAGA,IAGA,EAAA,SAAA,EAAA,cAEA,GAAA,GAAA,GACA,EAAA,KAAA,WACA,GAeA,SAAA,GAAA,EAAA,GAIA,IAHA,IAAA,EACA,IAEA,CAMA,GAAA,EAAA,UAAA,EAAA,CAEA,GADA,GAAA,GACA,EAAA,UAAA,GAAA,IAAA,EACA,OAAA,EAEA,GAAA,IAAA,EAAA,UACA,MA2BA,GApBA,EAAA,EACA,EAAA,WAAA,IAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,SAAA,EAAA,IAAA,EAAA,UACA,EAAA,EAAA,KAAA,EAAA,SAAA,EAAA,QAAA,EAAA,KAAA,EAAA,OACA,EAAA,KAAA,EAAA,OAAA,EAAA,UAOA,IAAA,GAAA,EAAA,SAAA,GAAA,EAAA,OAAA,IAKA,EAAA,aAAA,GAAA,EAAA,IAGA,EAAA,cAAA,EAYA,GAPA,EAAA,EAAA,UAAA,EAAA,EAAA,SAAA,EAAA,YAAA,EAAA,aAAA,GAEA,EAAA,WAAA,EAAA,aAKA,EAAA,cAAA,EAAA,gBAAA,EAAA,WAAA,EAAA,CACA,EAAA,eACA,GACA,EAAA,WAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,SAAA,EAAA,IAAA,EAAA,UACA,EAAA,EAAA,KAAA,EAAA,SAAA,EAAA,QAAA,EAAA,KAAA,EAAA,OACA,EAAA,KAAA,EAAA,OAAA,EAAA,eAKA,KAAA,EAAA,cACA,EAAA,gBAGA,EAAA,UAAA,EAAA,aACA,EAAA,aAAA,EACA,EAAA,MAAA,EAAA,OAAA,EAAA,UAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,SAAA,IAAA,EAAA,eAaA,EAAA,EAAA,UAAA,EAAA,EAAA,EAAA,OAAA,EAAA,WAEA,EAAA,YACA,EAAA,WAEA,GAAA,IAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,OAAA,EAMA,OADA,EAAA,OAAA,EAAA,SAAA,EAAA,EAAA,EAAA,SAAA,EAAA,EACA,IAAA,GAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,UACA,EAGA,GAEA,EAAA,WAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,EAIA,EAQA,SAAA,GAAA,EAAA,GAOA,IANA,IAAA,EACA,EAEA,IAGA,CAMA,GAAA,EAAA,UAAA,EAAA,CAEA,GADA,GAAA,GACA,EAAA,UAAA,GAAA,IAAA,EACA,OAAA,EAEA,GAAA,IAAA,EAAA,UAAA,MA0CA,GApCA,EAAA,EACA,EAAA,WAAA,IAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,SAAA,EAAA,IAAA,EAAA,UACA,EAAA,EAAA,KAAA,EAAA,SAAA,EAAA,QAAA,EAAA,KAAA,EAAA,OACA,EAAA,KAAA,EAAA,OAAA,EAAA,UAMA,EAAA,YAAA,EAAA,aACA,EAAA,WAAA,EAAA,YACA,EAAA,aAAA,EAAA,EAEA,IAAA,GAAA,EAAA,YAAA,EAAA,gBACA,EAAA,SAAA,GAAA,EAAA,OAAA,IAKA,EAAA,aAAA,GAAA,EAAA,GAGA,EAAA,cAAA,IACA,EAAA,WAAA,GAAA,EAAA,eAAA,GAAA,EAAA,SAAA,EAAA,YAAA,QAKA,EAAA,aAAA,EAAA,IAMA,EAAA,aAAA,GAAA,EAAA,cAAA,EAAA,YAAA,CACA,EAAA,EAAA,SAAA,EAAA,UAAA,EAOA,EAAA,EAAA,UAAA,EAAA,EAAA,SAAA,EAAA,EAAA,WAAA,EAAA,YAAA,GAMA,EAAA,WAAA,EAAA,YAAA,EACA,EAAA,aAAA,EACA,KACA,EAAA,UAAA,IAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,SAAA,EAAA,IAAA,EAAA,UACA,EAAA,EAAA,KAAA,EAAA,SAAA,EAAA,QAAA,EAAA,KAAA,EAAA,OACA,EAAA,KAAA,EAAA,OAAA,EAAA,gBAGA,KAAA,EAAA,aAKA,GAJA,EAAA,gBAAA,EACA,EAAA,aAAA,EAAA,EACA,EAAA,WAEA,IAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,OAAA,OAKA,GAAA,EAAA,iBAgBA,IATA,EAAA,EAAA,UAAA,EAAA,EAAA,EAAA,OAAA,EAAA,SAAA,MAIA,GAAA,GAAA,GAGA,EAAA,WACA,EAAA,YACA,IAAA,EAAA,KAAA,UACA,OAAA,OAMA,EAAA,gBAAA,EACA,EAAA,WACA,EAAA,YAYA,OARA,EAAA,kBAGA,EAAA,EAAA,UAAA,EAAA,EAAA,EAAA,OAAA,EAAA,SAAA,IAEA,EAAA,gBAAA,GAEA,EAAA,OAAA,EAAA,SAAA,EAAA,EAAA,EAAA,SAAA,EAAA,EACA,IAAA,GAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,UACA,EAGA,GAEA,EAAA,WAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,EAKA,EASA,SAAA,GAAA,EAAA,GAOA,IANA,IAAA,EACA,EACA,EAAA,EAEA,EAAA,EAAA,SAEA,CAKA,GAAA,EAAA,WAAA,EAAA,CAEA,GADA,GAAA,GACA,EAAA,WAAA,GAAA,IAAA,EACA,OAAA,EAEA,GAAA,IAAA,EAAA,UAAA,MAKA,GADA,EAAA,aAAA,EACA,EAAA,WAAA,GAAA,EAAA,SAAA,IAEA,EAAA,EADA,EAAA,EAAA,SAAA,MAEA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,CACA,EAAA,EAAA,SAAA,EACA,UAEA,IAAA,IAAA,IAAA,IAAA,IAAA,IACA,IAAA,IAAA,IAAA,IAAA,IAAA,IACA,IAAA,IAAA,IAAA,IAAA,IAAA,IACA,IAAA,IAAA,IAAA,IAAA,IAAA,IACA,EAAA,GACA,EAAA,aAAA,GAAA,EAAA,GACA,EAAA,aAAA,EAAA,YACA,EAAA,aAAA,EAAA,WAyBA,GAlBA,EAAA,cAAA,GAIA,EAAA,EAAA,UAAA,EAAA,EAAA,EAAA,aAAA,GAEA,EAAA,WAAA,EAAA,aACA,EAAA,UAAA,EAAA,aACA,EAAA,aAAA,IAKA,EAAA,EAAA,UAAA,EAAA,EAAA,EAAA,OAAA,EAAA,WAEA,EAAA,YACA,EAAA,YAEA,IAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,OAAA,EAMA,OADA,EAAA,OAAA,EACA,IAAA,GAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,UACA,EAGA,GAEA,EAAA,WAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,EAIA,EAOA,SAAA,GAAA,EAAA,GAGA,IAFA,IAAA,IAEA,CAEA,GAAA,IAAA,EAAA,YACA,GAAA,GACA,IAAA,EAAA,WAAA,CACA,GAAA,IAAA,EACA,OAAA,EAEA,MAWA,GANA,EAAA,aAAA,EAGA,EAAA,EAAA,UAAA,EAAA,EAAA,EAAA,OAAA,EAAA,WACA,EAAA,YACA,EAAA,WACA,IAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,OAAA,EAMA,OADA,EAAA,OAAA,EACA,IAAA,GAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,UACA,EAGA,GAEA,EAAA,WAEA,GAAA,GAAA,GACA,IAAA,EAAA,KAAA,WACA,EAIA,EAQA,SAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GACA,KAAA,YAAA,EACA,KAAA,SAAA,EACA,KAAA,YAAA,EACA,KAAA,UAAA,EACA,KAAA,KAAA,EAwBA,SAAA,GAAA,GACA,EAAA,YAAA,EAAA,EAAA,OAGA,EAAA,EAAA,MAIA,EAAA,eAAA,EAAA,EAAA,OAAA,SACA,EAAA,WAAA,EAAA,EAAA,OAAA,YACA,EAAA,WAAA,EAAA,EAAA,OAAA,YACA,EAAA,iBAAA,EAAA,EAAA,OAAA,UAEA,EAAA,SAAA,EACA,EAAA,YAAA,EACA,EAAA,UAAA,EACA,EAAA,OAAA,EACA,EAAA,aAAA,EAAA,YAAA,EAAA,EACA,EAAA,gBAAA,EACA,EAAA,MAAA,EAIA,SAAA,KACA,KAAA,KAAA,KACA,KAAA,OAAA,EACA,KAAA,YAAA,KACA,KAAA,iBAAA,EACA,KAAA,YAAA,EACA,KAAA,QAAA,EACA,KAAA,KAAA,EACA,KAAA,OAAA,KACA,KAAA,QAAA,EACA,KAAA,OAAA,EACA,KAAA,YAAA,EAEA,KAAA,OAAA,EACA,KAAA,OAAA,EACA,KAAA,OAAA,EAEA,KAAA,OAAA,KAQA,KAAA,YAAA,EAKA,KAAA,KAAA,KAMA,KAAA,KAAA,KAEA,KAAA,MAAA,EACA,KAAA,UAAA,EACA,KAAA,UAAA,EACA,KAAA,UAAA,EAEA,KAAA,WAAA,EAOA,KAAA,YAAA,EAKA,KAAA,aAAA,EACA,KAAA,WAAA,EACA,KAAA,gBAAA,EACA,KAAA,SAAA,EACA,KAAA,YAAA,EACA,KAAA,UAAA,EAEA,KAAA,YAAA,EAKA,KAAA,iBAAA,EAMA,KAAA,eAAA,EAYA,KAAA,MAAA,EACA,KAAA,SAAA,EAEA,KAAA,WAAA,EAGA,KAAA,WAAA,EAYA,KAAA,UAAA,IAAA,EAAA,MAAA,EAAA,GACA,KAAA,UAAA,IAAA,EAAA,MAAA,GAAA,EAAA,EAAA,IACA,KAAA,QAAA,IAAA,EAAA,MAAA,GAAA,EAAA,EAAA,IACA,EAAA,KAAA,WACA,EAAA,KAAA,WACA,EAAA,KAAA,SAEA,KAAA,OAAA,KACA,KAAA,OAAA,KACA,KAAA,QAAA,KAGA,KAAA,SAAA,IAAA,EAAA,MAAA,EAAA,GAIA,KAAA,KAAA,IAAA,EAAA,MAAA,EAAA,EAAA,GACA,EAAA,KAAA,MAEA,KAAA,SAAA,EACA,KAAA,SAAA,EAKA,KAAA,MAAA,IAAA,EAAA,MAAA,EAAA,EAAA,GACA,EAAA,KAAA,OAIA,KAAA,MAAA,EAEA,KAAA,YAAA,EAoBA,KAAA,SAAA,EAEA,KAAA,MAAA,EAMA,KAAA,QAAA,EACA,KAAA,WAAA,EACA,KAAA,QAAA,EACA,KAAA,OAAA,EAGA,KAAA,OAAA,EAIA,KAAA,SAAA,EAgBA,SAAA,GAAA,GACA,IAAA,EAEA,OAAA,GAAA,EAAA,OAIA,EAAA,SAAA,EAAA,UAAA,EACA,EAAA,UAAA,GAEA,EAAA,EAAA,OACA,QAAA,EACA,EAAA,YAAA,EAEA,EAAA,KAAA,IACA,EAAA,MAAA,EAAA,MAGA,EAAA,OAAA,EAAA,KAAA,EAAA,EACA,EAAA,MAAA,IAAA,EAAA,KACA,EAEA,EACA,EAAA,WAAA,EACA,EAAA,SAAA,GACA,GArBA,EAAA,EAAA,GAyBA,SAAA,GAAA,GACA,IAAA,EAAA,GAAA,GAIA,OAHA,IAAA,GACA,GAAA,EAAA,OAEA,EAIA,SAAA,GAAA,EAAA,GACA,OAAA,GAAA,EAAA,MACA,IAAA,EAAA,MAAA,KAAA,GACA,EAAA,MAAA,OAAA,EACA,GAHA,EAOA,SAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EACA,OAAA,EAEA,IAAA,EAAA,EAiBA,GAfA,IAAA,IACA,EAAA,GAGA,EAAA,GACA,EAAA,EACA,GAAA,GAGA,EAAA,KACA,EAAA,EACA,GAAA,IAIA,EAAA,GAAA,EAAA,GAAA,IAAA,GACA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,EACA,OAAA,EAAA,EAAA,GAIA,IAAA,IACA,EAAA,GAIA,IAAA,EAAA,IAAA,GA0CA,OAxCA,EAAA,MAAA,EACA,EAAA,KAAA,EAEA,EAAA,KAAA,EACA,EAAA,OAAA,KACA,EAAA,OAAA,EACA,EAAA,OAAA,GAAA,EAAA,OACA,EAAA,OAAA,EAAA,OAAA,EAEA,EAAA,UAAA,EAAA,EACA,EAAA,UAAA,GAAA,EAAA,UACA,EAAA,UAAA,EAAA,UAAA,EACA,EAAA,eAAA,EAAA,UAAA,EAAA,GAAA,GAEA,EAAA,OAAA,IAAA,EAAA,KAAA,EAAA,EAAA,QACA,EAAA,KAAA,IAAA,EAAA,MAAA,EAAA,WACA,EAAA,KAAA,IAAA,EAAA,MAAA,EAAA,QAKA,EAAA,YAAA,GAAA,EAAA,EAEA,EAAA,iBAAA,EAAA,EAAA,YAIA,EAAA,YAAA,IAAA,EAAA,KAAA,EAAA,kBAIA,EAAA,MAAA,EAAA,EAAA,YAGA,EAAA,MAAA,EAAA,EAAA,YAEA,EAAA,MAAA,EACA,EAAA,SAAA,EACA,EAAA,OAAA,EAEA,GAAA,GAGA,SAAA,GAAA,EAAA,GACA,OAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAIA,SAAA,GAAA,EAAA,GACA,IAAA,EAAA,EACA,EAAA,EAEA,IAAA,IAAA,EAAA,OACA,EAAA,GAAA,EAAA,EACA,OAAA,EAAA,EAAA,EAAA,GAAA,EAKA,GAFA,EAAA,EAAA,OAEA,EAAA,SACA,EAAA,OAAA,IAAA,EAAA,UACA,EAAA,SAAA,GAAA,IAAA,EACA,OAAA,EAAA,EAAA,IAAA,EAAA,UAAA,EAAA,GAQA,GALA,EAAA,KAAA,EACA,EAAA,EAAA,WACA,EAAA,WAAA,EAGA,EAAA,SAAA,EAEA,GAAA,IAAA,EAAA,KACA,EAAA,MAAA,EACA,GAAA,EAAA,IACA,GAAA,EAAA,KACA,GAAA,EAAA,GACA,EAAA,QAaA,GAAA,GAAA,EAAA,OAAA,KAAA,EAAA,IACA,EAAA,OAAA,KAAA,EAAA,IACA,EAAA,OAAA,MAAA,EAAA,IACA,EAAA,OAAA,KAAA,EAAA,IACA,EAAA,OAAA,QAAA,GAAA,IAEA,GAAA,EAAA,IAAA,EAAA,OAAA,MACA,GAAA,EAAA,EAAA,OAAA,MAAA,EAAA,KACA,GAAA,EAAA,EAAA,OAAA,MAAA,GAAA,KACA,GAAA,EAAA,EAAA,OAAA,MAAA,GAAA,KACA,GAAA,EAAA,IAAA,EAAA,MAAA,EACA,EAAA,UAAA,GAAA,EAAA,MAAA,EACA,EAAA,GACA,GAAA,EAAA,IAAA,EAAA,OAAA,IACA,EAAA,OAAA,OAAA,EAAA,OAAA,MAAA,SACA,GAAA,EAAA,IAAA,EAAA,OAAA,MAAA,QACA,GAAA,EAAA,EAAA,OAAA,MAAA,QAAA,EAAA,MAEA,EAAA,OAAA,OACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,IAEA,EAAA,QAAA,EACA,EAAA,OAAA,IAlCA,GAAA,EAAA,GACA,GAAA,EAAA,GACA,GAAA,EAAA,GACA,GAAA,EAAA,GACA,GAAA,EAAA,GACA,GAAA,EAAA,IAAA,EAAA,MAAA,EACA,EAAA,UAAA,GAAA,EAAA,MAAA,EACA,EAAA,GACA,GAAA,EAAA,GACA,EAAA,OAAA,OA6BA,CACA,IAAA,EAAA,GAAA,EAAA,OAAA,GAAA,IAAA,EAYA,IATA,EAAA,UAAA,GAAA,EAAA,MAAA,EACA,EACA,EAAA,MAAA,EACA,EACA,IAAA,EAAA,MACA,EAEA,IAEA,EACA,IAAA,EAAA,WAAA,GAAA,GACA,GAAA,GAAA,EAAA,GAEA,EAAA,OAAA,EACA,GAAA,EAAA,GAGA,IAAA,EAAA,WACA,GAAA,EAAA,EAAA,QAAA,IACA,GAAA,EAAA,MAAA,EAAA,QAEA,EAAA,MAAA,EAKA,GAAA,EAAA,SAAA,EACA,GAAA,EAAA,OAAA,MAAA,CAGA,IAFA,EAAA,EAAA,QAEA,EAAA,SAAA,MAAA,EAAA,OAAA,MAAA,UACA,EAAA,UAAA,EAAA,mBACA,EAAA,OAAA,MAAA,EAAA,QAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,EAAA,IAEA,EAAA,GACA,EAAA,EAAA,QACA,EAAA,UAAA,EAAA,oBAIA,GAAA,EAAA,IAAA,EAAA,OAAA,MAAA,EAAA,UACA,EAAA,UAEA,EAAA,OAAA,MAAA,EAAA,QAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,EAAA,IAEA,EAAA,UAAA,EAAA,OAAA,MAAA,SACA,EAAA,QAAA,EACA,EAAA,OAAA,QAIA,EAAA,OAAA,EAGA,GAAA,EAAA,SAAA,EACA,GAAA,EAAA,OAAA,KAAA,CACA,EAAA,EAAA,QAGA,EAAA,CACA,GAAA,EAAA,UAAA,EAAA,mBACA,EAAA,OAAA,MAAA,EAAA,QAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,EAAA,IAEA,EAAA,GACA,EAAA,EAAA,QACA,EAAA,UAAA,EAAA,kBAAA,CACA,EAAA,EACA,MAKA,EADA,EAAA,QAAA,EAAA,OAAA,KAAA,OACA,IAAA,EAAA,OAAA,KAAA,WAAA,EAAA,WAEA,EAEA,GAAA,EAAA,SACA,IAAA,GAEA,EAAA,OAAA,MAAA,EAAA,QAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,EAAA,IAEA,IAAA,IACA,EAAA,QAAA,EACA,EAAA,OAAA,QAIA,EAAA,OAAA,EAGA,GAAA,EAAA,SAAA,EACA,GAAA,EAAA,OAAA,QAAA,CACA,EAAA,EAAA,QAGA,EAAA,CACA,GAAA,EAAA,UAAA,EAAA,mBACA,EAAA,OAAA,MAAA,EAAA,QAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,EAAA,IAEA,EAAA,GACA,EAAA,EAAA,QACA,EAAA,UAAA,EAAA,kBAAA,CACA,EAAA,EACA,MAKA,EADA,EAAA,QAAA,EAAA,OAAA,QAAA,OACA,IAAA,EAAA,OAAA,QAAA,WAAA,EAAA,WAEA,EAEA,GAAA,EAAA,SACA,IAAA,GAEA,EAAA,OAAA,MAAA,EAAA,QAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,YAAA,EAAA,QAAA,EAAA,IAEA,IAAA,IACA,EAAA,OAAA,QAIA,EAAA,OAAA,EAsBA,GAnBA,EAAA,SAAA,IACA,EAAA,OAAA,MACA,EAAA,QAAA,EAAA,EAAA,kBACA,EAAA,GAEA,EAAA,QAAA,GAAA,EAAA,mBACA,GAAA,EAAA,IAAA,EAAA,OACA,GAAA,EAAA,EAAA,OAAA,EAAA,KACA,EAAA,MAAA,EACA,EAAA,OAAA,IAIA,EAAA,OAAA,GAMA,IAAA,EAAA,SAEA,GADA,EAAA,GACA,IAAA,EAAA,UAQA,OADA,EAAA,YAAA,EACA,OAOA,GAAA,IAAA,EAAA,UAAA,EAAA,IAAA,EAAA,IACA,IAAA,EACA,OAAA,EAAA,EAAA,GAIA,GAAA,EAAA,SAAA,GAAA,IAAA,EAAA,SACA,OAAA,EAAA,EAAA,GAKA,GAAA,IAAA,EAAA,UAAA,IAAA,EAAA,WACA,IAAA,GAAA,EAAA,SAAA,EAAA,CACA,IAAA,EAAA,EAAA,WAAA,EAAA,GAAA,EAAA,GACA,EAAA,WAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,OAAA,KAAA,EAAA,GAKA,GAHA,IAAA,GAAA,IAAA,IACA,EAAA,OAAA,GAEA,IAAA,GAAA,IAAA,EAKA,OAJA,IAAA,EAAA,YACA,EAAA,YAAA,GAGA,EASA,GAAA,IAAA,IACA,IAAA,EACA,EAAA,UAAA,GAEA,IAAA,IAEA,EAAA,iBAAA,EAAA,EAAA,GAAA,GAIA,IAAA,IAEA,EAAA,EAAA,MAEA,IAAA,EAAA,YACA,EAAA,SAAA,EACA,EAAA,YAAA,EACA,EAAA,OAAA,KAIA,EAAA,GACA,IAAA,EAAA,WAEA,OADA,EAAA,YAAA,EACA,EAOA,OAAA,IAAA,EAAA,EACA,EAAA,MAAA,EAAA,GAGA,IAAA,EAAA,MACA,GAAA,EAAA,IAAA,EAAA,OACA,GAAA,EAAA,EAAA,OAAA,EAAA,KACA,GAAA,EAAA,EAAA,OAAA,GAAA,KACA,GAAA,EAAA,EAAA,OAAA,GAAA,KACA,GAAA,EAAA,IAAA,EAAA,UACA,GAAA,EAAA,EAAA,UAAA,EAAA,KACA,GAAA,EAAA,EAAA,UAAA,GAAA,KACA,GAAA,EAAA,EAAA,UAAA,GAAA,OAIA,GAAA,EAAA,EAAA,QAAA,IACA,GAAA,EAAA,MAAA,EAAA,QAGA,EAAA,GAIA,EAAA,KAAA,IAAA,EAAA,MAAA,EAAA,MAEA,IAAA,EAAA,QAAA,EAAA,GAGA,SAAA,GAAA,GACA,IAAA,EAEA,OAAA,GAAA,EAAA,OAIA,EAAA,EAAA,MAAA,UACA,GACA,IAAA,GACA,IAAA,GACA,IAAA,GACA,IAAA,GACA,IAAA,GACA,IAAA,EAEA,EAAA,EAAA,IAGA,EAAA,MAAA,KAEA,IAAA,EAAA,EAAA,EAAA,GAAA,GAjBA,EAyBA,SAAA,GAAA,EAAA,GACA,IAEA,EACA,EAAA,EACA,EACA,EACA,EACA,EACA,EARA,EAAA,EAAA,OAUA,IAAA,IAAA,EAAA,MACA,OAAA,EAMA,GAAA,KAFA,GADA,EAAA,EAAA,OACA,OAEA,IAAA,GAAA,EAAA,SAAA,GAAA,EAAA,UACA,OAAA,EAmCA,IA/BA,IAAA,IAEA,EAAA,MAAA,EAAA,EAAA,MAAA,EAAA,EAAA,IAGA,EAAA,KAAA,EAGA,GAAA,EAAA,SACA,IAAA,IAEA,EAAA,EAAA,MACA,EAAA,SAAA,EACA,EAAA,YAAA,EACA,EAAA,OAAA,GAIA,EAAA,IAAA,EAAA,KAAA,EAAA,QACA,EAAA,SAAA,EAAA,EAAA,EAAA,EAAA,OAAA,EAAA,OAAA,GACA,EAAA,EACA,EAAA,EAAA,QAGA,EAAA,EAAA,SACA,EAAA,EAAA,QACA,EAAA,EAAA,MACA,EAAA,SAAA,EACA,EAAA,QAAA,EACA,EAAA,MAAA,EACA,GAAA,GACA,EAAA,WAAA,GAAA,CACA,EAAA,EAAA,SACA,EAAA,EAAA,WAAA,EAAA,GACA,GAEA,EAAA,OAAA,EAAA,OAAA,EAAA,WAAA,EAAA,OAAA,EAAA,EAAA,IAAA,EAAA,UAEA,EAAA,KAAA,EAAA,EAAA,QAAA,EAAA,KAAA,EAAA,OAEA,EAAA,KAAA,EAAA,OAAA,EACA,YACA,GACA,EAAA,SAAA,EACA,EAAA,UAAA,EAAA,EACA,GAAA,GAYA,OAVA,EAAA,UAAA,EAAA,UACA,EAAA,YAAA,EAAA,SACA,EAAA,OAAA,EAAA,UACA,EAAA,UAAA,EACA,EAAA,aAAA,EAAA,YAAA,EAAA,EACA,EAAA,gBAAA,EACA,EAAA,QAAA,EACA,EAAA,MAAA,EACA,EAAA,SAAA,EACA,EAAA,KAAA,EACA,EAnyBA,EAAA,CAEA,IAAA,GAAA,EAAA,EAAA,EAAA,EAAA,IACA,IAAA,GAAA,EAAA,EAAA,EAAA,EAAA,IACA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IACA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,IAEA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,IACA,IAAA,GAAA,EAAA,GAAA,GAAA,GAAA,IACA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IACA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IACA,IAAA,GAAA,GAAA,IAAA,IAAA,KAAA,IACA,IAAA,GAAA,GAAA,IAAA,IAAA,KAAA,KA2xBA,QAAA,YAAA,GACA,QAAA,aAAA,GACA,QAAA,aAAA,GACA,QAAA,iBAAA,GACA,QAAA,iBAAA,GACA,QAAA,QAAA,GACA,QAAA,WAAA,GACA,QAAA,qBAAA,GACA,QAAA,YAAA;;ACv0DA,aAGA,IAAA,EAAA,QAAA,YAQA,GAAA,EACA,GAAA,EAEA,IAAA,OAAA,aAAA,MAAA,KAAA,CAAA,IAAA,MAAA,GAAA,GAAA,EACA,IAAA,OAAA,aAAA,MAAA,KAAA,IAAA,WAAA,IAAA,MAAA,GAAA,GAAA,EAOA,IADA,IAAA,EAAA,IAAA,EAAA,KAAA,KACA,EAAA,EAAA,EAAA,IAAA,IACA,EAAA,GAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,EA4DA,SAAA,EAAA,EAAA,GAEA,GAAA,EAAA,QACA,EAAA,UAAA,IAAA,EAAA,UAAA,GACA,OAAA,OAAA,aAAA,MAAA,KAAA,EAAA,UAAA,EAAA,IAKA,IADA,IAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,IACA,GAAA,OAAA,aAAA,EAAA,IAEA,OAAA,EAtEA,EAAA,KAAA,EAAA,KAAA,EAIA,QAAA,WAAA,SAAA,GACA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,OAAA,EAAA,EAGA,IAAA,EAAA,EAAA,EAAA,EAAA,IAEA,QAAA,OADA,EAAA,EAAA,WAAA,MACA,EAAA,EAAA,GAEA,QAAA,OADA,EAAA,EAAA,WAAA,EAAA,OAEA,EAAA,OAAA,EAAA,OAAA,KAAA,EAAA,OACA,KAGA,GAAA,EAAA,IAAA,EAAA,EAAA,KAAA,EAAA,EAAA,MAAA,EAAA,EAOA,IAHA,EAAA,IAAA,EAAA,KAAA,GAGA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA,QAAA,OADA,EAAA,EAAA,WAAA,MACA,EAAA,EAAA,GAEA,QAAA,OADA,EAAA,EAAA,WAAA,EAAA,OAEA,EAAA,OAAA,EAAA,OAAA,KAAA,EAAA,OACA,KAGA,EAAA,IAEA,EAAA,KAAA,EACA,EAAA,MAEA,EAAA,KAAA,IAAA,IAAA,EACA,EAAA,KAAA,IAAA,GAAA,GACA,EAAA,OAEA,EAAA,KAAA,IAAA,IAAA,GACA,EAAA,KAAA,IAAA,IAAA,EAAA,GACA,EAAA,KAAA,IAAA,GAAA,IAGA,EAAA,KAAA,IAAA,IAAA,GACA,EAAA,KAAA,IAAA,IAAA,GAAA,GACA,EAAA,KAAA,IAAA,IAAA,EAAA,GACA,EAAA,KAAA,IAAA,GAAA,GAIA,OAAA,GAqBA,QAAA,cAAA,SAAA,GACA,OAAA,EAAA,EAAA,EAAA,SAKA,QAAA,cAAA,SAAA,GAEA,IADA,IAAA,EAAA,IAAA,EAAA,KAAA,EAAA,QACA,EAAA,EAAA,EAAA,EAAA,OAAA,EAAA,EAAA,IACA,EAAA,GAAA,EAAA,WAAA,GAEA,OAAA,GAKA,QAAA,WAAA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,EAAA,EACA,EAAA,GAAA,EAAA,OAKA,EAAA,IAAA,MAAA,EAAA,GAEA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAGA,IAFA,EAAA,EAAA,MAEA,IAAA,EAAA,KAAA,OAIA,IAFA,EAAA,EAAA,IAEA,EAAA,EAAA,KAAA,MAAA,GAAA,EAAA,MAAA,CAKA,IAFA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAEA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,GAAA,EAAA,KACA,IAIA,EAAA,EAAA,EAAA,KAAA,MAEA,EAAA,MACA,EAAA,KAAA,GAEA,GAAA,MACA,EAAA,KAAA,MAAA,GAAA,GAAA,KACA,EAAA,KAAA,MAAA,KAAA,GAIA,OAAA,EAAA,EAAA,IAUA,QAAA,WAAA,SAAA,EAAA,GACA,IAAA,EAOA,KALA,EAAA,GAAA,EAAA,QACA,EAAA,SAAA,EAAA,EAAA,QAGA,EAAA,EAAA,EACA,GAAA,GAAA,MAAA,IAAA,EAAA,KAAA,IAIA,OAAA,EAAA,EAAA,EAIA,IAAA,EAAA,EAEA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA;;ACvLA,aAqBA,SAAA,IAEA,KAAA,MAAA,KACA,KAAA,QAAA,EAEA,KAAA,SAAA,EAEA,KAAA,SAAA,EAEA,KAAA,OAAA,KACA,KAAA,SAAA,EAEA,KAAA,UAAA,EAEA,KAAA,UAAA,EAEA,KAAA,IAAA,GAEA,KAAA,MAAA,KAEA,KAAA,UAAA,EAEA,KAAA,MAAA,EAGA,OAAA,QAAA;;AC9CA,aAGA,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,kBACA,EAAA,QAAA,mBACA,EAAA,QAAA,mBACA,EAAA,QAAA,kBAEA,EAAA,OAAA,UAAA,SAKA,EAAA,EACA,EAAA,EAEA,EAAA,EACA,EAAA,EACA,EAAA,EAEA,GAAA,EAEA,EAAA,EAEA,EAAA,EA8FA,SAAA,EAAA,GACA,KAAA,gBAAA,GAAA,OAAA,IAAA,EAAA,GAEA,KAAA,QAAA,EAAA,OAAA,CACA,MAAA,EACA,OAAA,EACA,UAAA,MACA,WAAA,GACA,SAAA,EACA,SAAA,EACA,GAAA,IACA,GAAA,IAEA,IAAA,EAAA,KAAA,QAEA,EAAA,KAAA,EAAA,WAAA,EACA,EAAA,YAAA,EAAA,WAGA,EAAA,MAAA,EAAA,WAAA,GAAA,EAAA,WAAA,KACA,EAAA,YAAA,IAGA,KAAA,IAAA,EACA,KAAA,IAAA,GACA,KAAA,OAAA,EACA,KAAA,OAAA,GAEA,KAAA,KAAA,IAAA,EACA,KAAA,KAAA,UAAA,EAEA,IAAA,EAAA,EAAA,aACA,KAAA,KACA,EAAA,MACA,EAAA,OACA,EAAA,WACA,EAAA,SACA,EAAA,UAGA,GAAA,IAAA,EACA,MAAA,IAAA,MAAA,EAAA,IAOA,GAJA,EAAA,QACA,EAAA,iBAAA,KAAA,KAAA,EAAA,QAGA,EAAA,WAAA,CACA,IAAA,EAaA,GATA,EAFA,iBAAA,EAAA,WAEA,EAAA,WAAA,EAAA,YACA,yBAAA,EAAA,KAAA,EAAA,YACA,IAAA,WAAA,EAAA,YAEA,EAAA,YAGA,EAAA,EAAA,qBAAA,KAAA,KAAA,MAEA,EACA,MAAA,IAAA,MAAA,EAAA,IAGA,KAAA,WAAA,GAyKA,SAAA,EAAA,EAAA,GACA,IAAA,EAAA,IAAA,EAAA,GAKA,GAHA,EAAA,KAAA,GAAA,GAGA,EAAA,IAAA,MAAA,EAAA,KAAA,EAAA,EAAA,KAEA,OAAA,EAAA,OAYA,SAAA,EAAA,EAAA,GAGA,OAFA,EAAA,GAAA,IACA,KAAA,EACA,EAAA,EAAA,GAYA,SAAA,EAAA,EAAA,GAGA,OAFA,EAAA,GAAA,IACA,MAAA,EACA,EAAA,EAAA,GA9KA,EAAA,UAAA,KAAA,SAAA,EAAA,GACA,IAEA,EAAA,EAFA,EAAA,KAAA,KACA,EAAA,KAAA,QAAA,UAGA,GAAA,KAAA,MAAA,OAAA,EAEA,EAAA,MAAA,EAAA,GAAA,IAAA,EAAA,EAAA,EAGA,iBAAA,EAEA,EAAA,MAAA,EAAA,WAAA,GACA,yBAAA,EAAA,KAAA,GACA,EAAA,MAAA,IAAA,WAAA,GAEA,EAAA,MAAA,EAGA,EAAA,QAAA,EACA,EAAA,SAAA,EAAA,MAAA,OAEA,EAAA,CAQA,GAPA,IAAA,EAAA,YACA,EAAA,OAAA,IAAA,EAAA,KAAA,GACA,EAAA,SAAA,EACA,EAAA,UAAA,IAEA,EAAA,EAAA,QAAA,EAAA,MAEA,GAAA,IAAA,EAGA,OAFA,KAAA,MAAA,GACA,KAAA,OAAA,GACA,EAEA,IAAA,EAAA,YAAA,IAAA,EAAA,UAAA,IAAA,GAAA,IAAA,KACA,WAAA,KAAA,QAAA,GACA,KAAA,OAAA,EAAA,cAAA,EAAA,UAAA,EAAA,OAAA,EAAA,YAEA,KAAA,OAAA,EAAA,UAAA,EAAA,OAAA,EAAA,mBAGA,EAAA,SAAA,GAAA,IAAA,EAAA,YAAA,IAAA,GAGA,OAAA,IAAA,GACA,EAAA,EAAA,WAAA,KAAA,MACA,KAAA,MAAA,GACA,KAAA,OAAA,EACA,IAAA,GAIA,IAAA,IACA,KAAA,MAAA,GACA,EAAA,UAAA,GACA,IAgBA,EAAA,UAAA,OAAA,SAAA,GACA,KAAA,OAAA,KAAA,IAcA,EAAA,UAAA,MAAA,SAAA,GAEA,IAAA,IACA,WAAA,KAAA,QAAA,GACA,KAAA,OAAA,KAAA,OAAA,KAAA,IAEA,KAAA,OAAA,EAAA,cAAA,KAAA,SAGA,KAAA,OAAA,GACA,KAAA,IAAA,EACA,KAAA,IAAA,KAAA,KAAA,KAgFA,QAAA,QAAA,EACA,QAAA,QAAA,EACA,QAAA,WAAA,EACA,QAAA,KAAA;;AC/YA,aAsBA,IAAA,EAAA,GACA,EAAA,GAqCA,OAAA,QAAA,SAAA,EAAA,GACA,IAAA,EACA,EACA,EACA,EACA,EACA,EAEA,EAEA,EACA,EACA,EAEA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,EAGA,EAAA,EAGA,EAAA,EAAA,MAEA,EAAA,EAAA,QACA,EAAA,EAAA,MACA,EAAA,GAAA,EAAA,SAAA,GACA,EAAA,EAAA,SACA,EAAA,EAAA,OACA,EAAA,GAAA,EAAA,EAAA,WACA,EAAA,GAAA,EAAA,UAAA,KAEA,EAAA,EAAA,KAEA,EAAA,EAAA,MACA,EAAA,EAAA,MACA,EAAA,EAAA,MACA,EAAA,EAAA,OACA,EAAA,EAAA,KACA,EAAA,EAAA,KACA,EAAA,EAAA,QACA,EAAA,EAAA,SACA,GAAA,GAAA,EAAA,SAAA,EACA,GAAA,GAAA,EAAA,UAAA,EAMA,EACA,EAAA,CACA,EAAA,KACA,GAAA,EAAA,MAAA,EACA,GAAA,EACA,GAAA,EAAA,MAAA,EACA,GAAA,GAGA,EAAA,EAAA,EAAA,GAEA,EACA,OAAA,CAKA,GAHA,KADA,EAAA,IAAA,GAEA,GAAA,EAEA,KADA,EAAA,IAAA,GAAA,KAKA,EAAA,KAAA,MAAA,MAEA,CAAA,KAAA,GAAA,GAwKA,CAAA,GAAA,IAAA,GAAA,GAAA,CACA,EAAA,GAAA,MAAA,IAAA,GAAA,GAAA,GAAA,IACA,SAAA,EAEA,GAAA,GAAA,EAAA,CAEA,EAAA,KAAA,EACA,MAAA,EAGA,EAAA,IAAA,8BACA,EAAA,KAAA,EACA,MAAA,EAnLA,EAAA,MAAA,GACA,GAAA,MAEA,EAAA,IACA,GAAA,EAAA,MAAA,EACA,GAAA,GAEA,GAAA,GAAA,GAAA,GAAA,EACA,KAAA,EACA,GAAA,GAGA,EAAA,KACA,GAAA,EAAA,MAAA,EACA,GAAA,EACA,GAAA,EAAA,MAAA,EACA,GAAA,GAEA,EAAA,EAAA,EAAA,GAEA,EACA,OAAA,CAMA,GAJA,KADA,EAAA,IAAA,GAEA,GAAA,IAGA,IAFA,EAAA,IAAA,GAAA,MAiIA,CAAA,GAAA,IAAA,GAAA,GAAA,CACA,EAAA,GAAA,MAAA,IAAA,GAAA,GAAA,GAAA,IACA,SAAA,EAGA,EAAA,IAAA,wBACA,EAAA,KAAA,EACA,MAAA,EAzHA,GAZA,EAAA,MAAA,EAEA,GADA,GAAA,MAEA,GAAA,EAAA,MAAA,GACA,GAAA,GACA,IACA,GAAA,EAAA,MAAA,EACA,GAAA,KAGA,GAAA,GAAA,GAAA,GAAA,GAEA,EAAA,CACA,EAAA,IAAA,gCACA,EAAA,KAAA,EACA,MAAA,EAOA,GAJA,KAAA,EACA,GAAA,EAGA,GADA,EAAA,EAAA,GACA,CAEA,IADA,EAAA,EAAA,GACA,GACA,EAAA,KAAA,CACA,EAAA,IAAA,gCACA,EAAA,KAAA,EACA,MAAA,EA2BA,GAFA,EAAA,EACA,EAAA,EACA,IAAA,GAEA,GADA,GAAA,EAAA,EACA,EAAA,EAAA,CACA,GAAA,EACA,GACA,EAAA,KAAA,EAAA,aACA,GACA,EAAA,EAAA,EACA,EAAA,QAGA,GAAA,EAAA,GAGA,GAFA,GAAA,EAAA,EAAA,GACA,GAAA,GACA,EAAA,CACA,GAAA,EACA,GACA,EAAA,KAAA,EAAA,aACA,GAEA,GADA,EAAA,EACA,EAAA,EAAA,CAEA,GADA,EAAA,EAEA,GACA,EAAA,KAAA,EAAA,aACA,GACA,EAAA,EAAA,EACA,EAAA,SAMA,GADA,GAAA,EAAA,EACA,EAAA,EAAA,CACA,GAAA,EACA,GACA,EAAA,KAAA,EAAA,aACA,GACA,EAAA,EAAA,EACA,EAAA,EAGA,KAAA,EAAA,GACA,EAAA,KAAA,EAAA,KACA,EAAA,KAAA,EAAA,KACA,EAAA,KAAA,EAAA,KACA,GAAA,EAEA,IACA,EAAA,KAAA,EAAA,KACA,EAAA,IACA,EAAA,KAAA,EAAA,WAIA,CACA,EAAA,EAAA,EACA,GACA,EAAA,KAAA,EAAA,KACA,EAAA,KAAA,EAAA,KACA,EAAA,KAAA,EAAA,KACA,GAAA,QACA,EAAA,GACA,IACA,EAAA,KAAA,EAAA,KACA,EAAA,IACA,EAAA,KAAA,EAAA,OAeA,OAkBA,aAEA,EAAA,GAAA,EAAA,GAIA,GADA,EAAA,GAAA,EAGA,IAAA,IADA,GAAA,GAAA,IACA,EAGA,EAAA,QAAA,EACA,EAAA,SAAA,EACA,EAAA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,UAAA,EAAA,EAAA,EAAA,EAAA,IAAA,KAAA,EAAA,GACA,EAAA,KAAA,EACA,EAAA,KAAA;;ACtVA,aAqBA,IAAA,EAAA,QAAA,mBAEA,EAAA,GACA,EAAA,IACA,EAAA,IAGA,EAAA,EACA,EAAA,EACA,EAAA,EAEA,EAAA,CACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAGA,EAAA,CACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAGA,EAAA,CACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IACA,IAAA,IAAA,IAAA,IAAA,KAAA,KAAA,KAAA,KAAA,KAAA,KACA,KAAA,MAAA,MAAA,MAAA,EAAA,GAGA,EAAA,CACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,GAAA,GAAA,GAAA,IAGA,OAAA,QAAA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,IAYA,EACA,EACA,EACA,EACA,EAIA,EAMA,EAAA,EAAA,EA1BA,EAAA,EAAA,KAGA,EAAA,EACA,EAAA,EACA,EAAA,EAAA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EAMA,EAAA,KACA,EAAA,EAGA,EAAA,IAAA,EAAA,MAAA,EAAA,GACA,EAAA,IAAA,EAAA,MAAA,EAAA,GACA,EAAA,KACA,EAAA,EAoCA,IAAA,EAAA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAEA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,MAKA,IADA,EAAA,EACA,EAAA,EAAA,GAAA,GACA,IAAA,EAAA,GADA,KAMA,GAHA,EAAA,IACA,EAAA,GAEA,IAAA,EAaA,OATA,EAAA,KAAA,SAMA,EAAA,KAAA,SAEA,EAAA,KAAA,EACA,EAEA,IAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,GADA,KASA,IANA,EAAA,IACA,EAAA,GAIA,EAAA,EACA,EAAA,EAAA,GAAA,EAAA,IAGA,GAFA,IAAA,GACA,GAAA,EAAA,IACA,EACA,OAAA,EAGA,GAAA,EAAA,IAAA,IAAA,GAAA,IAAA,GACA,OAAA,EAKA,IADA,EAAA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAIA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,IAAA,EAAA,EAAA,KACA,EAAA,EAAA,EAAA,EAAA,OAAA,GAmEA,GA7BA,IAAA,GACA,EAAA,EAAA,EACA,EAAA,IAEA,IAAA,GACA,EAAA,EACA,GAAA,IACA,EAAA,EACA,GAAA,IACA,EAAA,MAGA,EAAA,EACA,EAAA,EACA,GAAA,GAIA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,GAAA,EAEA,GADA,EAAA,GAAA,GACA,EAGA,IAAA,GAAA,EAAA,GACA,IAAA,GAAA,EAAA,EACA,OAAA,EAIA,OAAA,CAEA,EAAA,EAAA,EACA,EAAA,GAAA,GACA,EAAA,EACA,EAAA,EAAA,IAEA,EAAA,GAAA,GACA,EAAA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,MAGA,EAAA,GACA,EAAA,GAIA,EAAA,GAAA,EAAA,EAEA,EADA,EAAA,GAAA,EAEA,GAEA,EAAA,GAAA,GAAA,IADA,GAAA,IACA,GAAA,GAAA,GAAA,GAAA,EAAA,QACA,IAAA,GAIA,IADA,EAAA,GAAA,EAAA,EACA,EAAA,GACA,IAAA,EAWA,GATA,IAAA,GACA,GAAA,EAAA,EACA,GAAA,GAEA,EAAA,EAIA,IACA,KAAA,EAAA,GAAA,CACA,GAAA,IAAA,EAAA,MACA,EAAA,EAAA,EAAA,EAAA,IAIA,GAAA,EAAA,IAAA,EAAA,KAAA,EAAA,CAYA,IAVA,IAAA,IACA,EAAA,GAIA,GAAA,EAIA,EAAA,IADA,EAAA,EAAA,GAEA,EAAA,EAAA,MACA,GAAA,EAAA,EAAA,KACA,IACA,IACA,IAAA,EAKA,GADA,GAAA,GAAA,EACA,IAAA,GAAA,EAAA,GACA,IAAA,GAAA,EAAA,EACA,OAAA,EAQA,EAJA,EAAA,EAAA,GAIA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAiBA,OAVA,IAAA,IAIA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAKA,EAAA,KAAA,EACA;;ACrVA,aAqBA,IAAA,EAAA,QAAA,mBACA,EAAA,QAAA,aACA,EAAA,QAAA,WACA,EAAA,QAAA,aACA,EAAA,QAAA,cAEA,EAAA,EACA,EAAA,EACA,EAAA,EAWA,EAAA,EACA,EAAA,EACA,EAAA,EAMA,EAAA,EACA,EAAA,EACA,EAAA,EAEA,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EAIA,EAAA,EAOA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,EACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GACA,EAAA,GAMA,EAAA,IACA,EAAA,IAGA,EAAA,GAEA,GAAA,EAGA,SAAA,GAAA,GACA,OAAA,IAAA,GAAA,MACA,IAAA,EAAA,SACA,MAAA,IAAA,KACA,IAAA,IAAA,IAIA,SAAA,KACA,KAAA,KAAA,EACA,KAAA,MAAA,EACA,KAAA,KAAA,EACA,KAAA,UAAA,EACA,KAAA,MAAA,EACA,KAAA,KAAA,EACA,KAAA,MAAA,EACA,KAAA,MAAA,EAEA,KAAA,KAAA,KAGA,KAAA,MAAA,EACA,KAAA,MAAA,EACA,KAAA,MAAA,EACA,KAAA,MAAA,EACA,KAAA,OAAA,KAGA,KAAA,KAAA,EACA,KAAA,KAAA,EAGA,KAAA,OAAA,EACA,KAAA,OAAA,EAGA,KAAA,MAAA,EAGA,KAAA,QAAA,KACA,KAAA,SAAA,KACA,KAAA,QAAA,EACA,KAAA,SAAA,EAGA,KAAA,MAAA,EACA,KAAA,KAAA,EACA,KAAA,MAAA,EACA,KAAA,KAAA,EACA,KAAA,KAAA,KAEA,KAAA,KAAA,IAAA,EAAA,MAAA,KACA,KAAA,KAAA,IAAA,EAAA,MAAA,KAOA,KAAA,OAAA,KACA,KAAA,QAAA,KACA,KAAA,KAAA,EACA,KAAA,KAAA,EACA,KAAA,IAAA,EAGA,SAAA,GAAA,GACA,IAAA,EAEA,OAAA,GAAA,EAAA,OACA,EAAA,EAAA,MACA,EAAA,SAAA,EAAA,UAAA,EAAA,MAAA,EACA,EAAA,IAAA,GACA,EAAA,OACA,EAAA,MAAA,EAAA,EAAA,MAEA,EAAA,KAAA,EACA,EAAA,KAAA,EACA,EAAA,SAAA,EACA,EAAA,KAAA,MACA,EAAA,KAAA,KACA,EAAA,KAAA,EACA,EAAA,KAAA,EAEA,EAAA,QAAA,EAAA,OAAA,IAAA,EAAA,MAAA,GACA,EAAA,SAAA,EAAA,QAAA,IAAA,EAAA,MAAA,GAEA,EAAA,KAAA,EACA,EAAA,MAAA,EAEA,GArBA,EAwBA,SAAA,GAAA,GACA,IAAA,EAEA,OAAA,GAAA,EAAA,QACA,EAAA,EAAA,OACA,MAAA,EACA,EAAA,MAAA,EACA,EAAA,MAAA,EACA,GAAA,IALA,EASA,SAAA,GAAA,EAAA,GACA,IAAA,EACA,EAGA,OAAA,GAAA,EAAA,OACA,EAAA,EAAA,MAGA,EAAA,GACA,EAAA,EACA,GAAA,IAGA,EAAA,GAAA,GAAA,GACA,EAAA,KACA,GAAA,KAKA,IAAA,EAAA,GAAA,EAAA,IACA,GAEA,OAAA,EAAA,QAAA,EAAA,QAAA,IACA,EAAA,OAAA,MAIA,EAAA,KAAA,EACA,EAAA,MAAA,EACA,GAAA,KA1BA,EA6BA,SAAA,GAAA,EAAA,GACA,IAAA,EACA,EAEA,OAAA,GAGA,EAAA,IAAA,GAIA,EAAA,MAAA,EACA,EAAA,OAAA,MACA,EAAA,GAAA,EAAA,MACA,IACA,EAAA,MAAA,MAEA,GAbA,EAgBA,SAAA,GAAA,GACA,OAAA,GAAA,EAAA,IAcA,IAEA,GAAA,GAFA,IAAA,EAIA,SAAA,GAAA,GAEA,GAAA,GAAA,CACA,IAAA,EAOA,IALA,GAAA,IAAA,EAAA,MAAA,KACA,GAAA,IAAA,EAAA,MAAA,IAGA,EAAA,EACA,EAAA,KAAA,EAAA,KAAA,KAAA,EACA,KAAA,EAAA,KAAA,EAAA,KAAA,KAAA,EACA,KAAA,EAAA,KAAA,EAAA,KAAA,KAAA,EACA,KAAA,EAAA,KAAA,EAAA,KAAA,KAAA,EAMA,IAJA,EAAA,EAAA,EAAA,KAAA,EAAA,IAAA,GAAA,EAAA,EAAA,KAAA,CAAA,KAAA,IAGA,EAAA,EACA,EAAA,IAAA,EAAA,KAAA,KAAA,EAEA,EAAA,EAAA,EAAA,KAAA,EAAA,GAAA,GAAA,EAAA,EAAA,KAAA,CAAA,KAAA,IAGA,IAAA,EAGA,EAAA,QAAA,GACA,EAAA,QAAA,EACA,EAAA,SAAA,GACA,EAAA,SAAA,EAkBA,SAAA,GAAA,EAAA,EAAA,EAAA,GACA,IAAA,EACA,EAAA,EAAA,MAqCA,OAlCA,OAAA,EAAA,SACA,EAAA,MAAA,GAAA,EAAA,MACA,EAAA,MAAA,EACA,EAAA,MAAA,EAEA,EAAA,OAAA,IAAA,EAAA,KAAA,EAAA,QAIA,GAAA,EAAA,OACA,EAAA,SAAA,EAAA,OAAA,EAAA,EAAA,EAAA,MAAA,EAAA,MAAA,GACA,EAAA,MAAA,EACA,EAAA,MAAA,EAAA,SAGA,EAAA,EAAA,MAAA,EAAA,OACA,IACA,EAAA,GAGA,EAAA,SAAA,EAAA,OAAA,EAAA,EAAA,EAAA,EAAA,EAAA,QACA,GAAA,IAGA,EAAA,SAAA,EAAA,OAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,MAAA,EACA,EAAA,MAAA,EAAA,QAGA,EAAA,OAAA,EACA,EAAA,QAAA,EAAA,QAAA,EAAA,MAAA,GACA,EAAA,MAAA,EAAA,QAAA,EAAA,OAAA,KAGA,EAGA,SAAA,GAAA,EAAA,GACA,IAAA,EACA,GAAA,GACA,GACA,GACA,GAAA,GACA,GACA,GACA,GAAA,GACA,GACA,GACA,GAEA,GAAA,GAAA,GAEA,GAAA,GAAA,GACA,GACA,GAEA,GAEA,GATA,GAAA,EAMA,GAAA,IAAA,EAAA,KAAA,GAKA,GACA,CAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAGA,IAAA,IAAA,EAAA,QAAA,EAAA,SACA,EAAA,OAAA,IAAA,EAAA,SACA,OAAA,GAGA,EAAA,EAAA,OACA,OAAA,IAAA,EAAA,KAAA,GAIA,GAAA,EAAA,SACA,GAAA,EAAA,OACA,GAAA,EAAA,UACA,GAAA,EAAA,QACA,GAAA,EAAA,MACA,GAAA,EAAA,SACA,GAAA,EAAA,KACA,GAAA,EAAA,KAGA,GAAA,GACA,GAAA,GACA,GAAA,EAEA,EACA,OACA,OAAA,EAAA,MACA,KAAA,EACA,GAAA,IAAA,EAAA,KAAA,CACA,EAAA,KAAA,EACA,MAGA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,GAAA,EAAA,EAAA,MAAA,QAAA,GAAA,CACA,EAAA,MAAA,EAEA,GAAA,GAAA,IAAA,GACA,GAAA,GAAA,KAAA,EAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,EAAA,GAIA,GAAA,EACA,GAAA,EAEA,EAAA,KAAA,EACA,MAMA,GAJA,EAAA,MAAA,EACA,EAAA,OACA,EAAA,KAAA,MAAA,KAEA,EAAA,EAAA,UACA,IAAA,KAAA,IAAA,IAAA,IAAA,GAAA,CACA,EAAA,IAAA,yBACA,EAAA,KAAA,EACA,MAEA,IAAA,GAAA,MAAA,EAAA,CACA,EAAA,IAAA,6BACA,EAAA,KAAA,EACA,MAOA,GAHA,IAAA,EAEA,GAAA,GAAA,IAHA,MAAA,IAIA,IAAA,EAAA,MACA,EAAA,MAAA,QAEA,GAAA,GAAA,EAAA,MAAA,CACA,EAAA,IAAA,sBACA,EAAA,KAAA,EACA,MAEA,EAAA,KAAA,GAAA,GAEA,EAAA,MAAA,EAAA,MAAA,EACA,EAAA,KAAA,IAAA,GAAA,EAAA,EAEA,GAAA,EACA,GAAA,EAEA,MACA,KAAA,EAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAIA,GADA,EAAA,MAAA,IACA,IAAA,EAAA,SAAA,EAAA,CACA,EAAA,IAAA,6BACA,EAAA,KAAA,EACA,MAEA,GAAA,MAAA,EAAA,MAAA,CACA,EAAA,IAAA,2BACA,EAAA,KAAA,EACA,MAEA,EAAA,OACA,EAAA,KAAA,KAAA,IAAA,EAAA,GAEA,IAAA,EAAA,QAEA,GAAA,GAAA,IAAA,GACA,GAAA,GAAA,KAAA,EAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,EAAA,IAIA,GAAA,EACA,GAAA,EAEA,EAAA,KAAA,EAEA,KAAA,EAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,OACA,EAAA,KAAA,KAAA,IAEA,IAAA,EAAA,QAEA,GAAA,GAAA,IAAA,GACA,GAAA,GAAA,KAAA,EAAA,IACA,GAAA,GAAA,KAAA,GAAA,IACA,GAAA,GAAA,KAAA,GAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,EAAA,IAIA,GAAA,EACA,GAAA,EAEA,EAAA,KAAA,EAEA,KAAA,EAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,OACA,EAAA,KAAA,OAAA,IAAA,GACA,EAAA,KAAA,GAAA,IAAA,GAEA,IAAA,EAAA,QAEA,GAAA,GAAA,IAAA,GACA,GAAA,GAAA,KAAA,EAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,EAAA,IAIA,GAAA,EACA,GAAA,EAEA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,KAAA,EAAA,MAAA,CAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,OAAA,GACA,EAAA,OACA,EAAA,KAAA,UAAA,IAEA,IAAA,EAAA,QAEA,GAAA,GAAA,IAAA,GACA,GAAA,GAAA,KAAA,EAAA,IACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,EAAA,IAIA,GAAA,EACA,GAAA,OAGA,EAAA,OACA,EAAA,KAAA,MAAA,MAEA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,KAAA,EAAA,SACA,GAAA,EAAA,QACA,KAAA,GAAA,IACA,KACA,EAAA,OACA,GAAA,EAAA,KAAA,UAAA,EAAA,OACA,EAAA,KAAA,QAEA,EAAA,KAAA,MAAA,IAAA,MAAA,EAAA,KAAA,YAEA,EAAA,SACA,EAAA,KAAA,MACA,GACA,GAGA,GAEA,KAMA,IAAA,EAAA,QACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,GAAA,KAEA,IAAA,GACA,IAAA,GACA,EAAA,QAAA,IAEA,EAAA,QAAA,MAAA,EAEA,EAAA,OAAA,EACA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,KAAA,EAAA,MAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,GAAA,EACA,GAEA,GAAA,GAAA,GAAA,MAEA,EAAA,MAAA,IACA,EAAA,OAAA,QACA,EAAA,KAAA,MAAA,OAAA,aAAA,WAEA,IAAA,GAAA,IAOA,GALA,IAAA,EAAA,QACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,GAAA,KAEA,IAAA,GACA,IAAA,GACA,GAAA,MAAA,OAEA,EAAA,OACA,EAAA,KAAA,KAAA,MAEA,EAAA,OAAA,EACA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,KAAA,EAAA,MAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,GAAA,EACA,GACA,GAAA,GAAA,GAAA,MAEA,EAAA,MAAA,IACA,EAAA,OAAA,QACA,EAAA,KAAA,SAAA,OAAA,aAAA,WAEA,IAAA,GAAA,IAMA,GALA,IAAA,EAAA,QACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,GAAA,KAEA,IAAA,GACA,IAAA,GACA,GAAA,MAAA,OAEA,EAAA,OACA,EAAA,KAAA,QAAA,MAEA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,IAAA,EAAA,MAAA,CAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,GAAA,MAAA,MAAA,EAAA,OAAA,CACA,EAAA,IAAA,sBACA,EAAA,KAAA,EACA,MAGA,GAAA,EACA,GAAA,EAGA,EAAA,OACA,EAAA,KAAA,KAAA,EAAA,OAAA,EAAA,EACA,EAAA,KAAA,MAAA,GAEA,EAAA,MAAA,EAAA,MAAA,EACA,EAAA,KAAA,EACA,MACA,KAAA,EAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,MAAA,EAAA,MAAA,GAAA,IAEA,GAAA,EACA,GAAA,EAEA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,IAAA,EAAA,SASA,OAPA,EAAA,SAAA,GACA,EAAA,UAAA,GACA,EAAA,QAAA,GACA,EAAA,SAAA,GACA,EAAA,KAAA,GACA,EAAA,KAAA,GAEA,EAEA,EAAA,MAAA,EAAA,MAAA,EACA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,IAAA,GAAA,IAAA,EAAA,MAAA,EAEA,KAAA,EACA,GAAA,EAAA,KAAA,CAEA,MAAA,EAAA,GACA,IAAA,EAAA,GAEA,EAAA,KAAA,EACA,MAGA,KAAA,GAAA,GAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EASA,OANA,EAAA,KAAA,EAAA,GAGA,IAAA,EAGA,GAJA,MAAA,IAKA,KAAA,EAGA,EAAA,KAAA,EACA,MACA,KAAA,EAKA,GAJA,GAAA,GAGA,EAAA,KAAA,EACA,IAAA,EAAA,CAEA,MAAA,EACA,IAAA,EAEA,MAAA,EAEA,MACA,KAAA,EAGA,EAAA,KAAA,EACA,MACA,KAAA,EACA,EAAA,IAAA,qBACA,EAAA,KAAA,EAGA,MAAA,EACA,IAAA,EAEA,MACA,KAAA,EAMA,IAJA,MAAA,EAAA,GACA,IAAA,EAAA,GAGA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,IAAA,MAAA,MAAA,KAAA,GAAA,OAAA,CACA,EAAA,IAAA,+BACA,EAAA,KAAA,EACA,MAUA,GARA,EAAA,OAAA,MAAA,GAIA,GAAA,EACA,GAAA,EAEA,EAAA,KAAA,EACA,IAAA,EAAA,MAAA,EAEA,KAAA,EACA,EAAA,KAAA,EAEA,KAAA,EAEA,GADA,GAAA,EAAA,OACA,CAGA,GAFA,GAAA,KAAA,GAAA,IACA,GAAA,KAAA,GAAA,IACA,IAAA,GAAA,MAAA,EAEA,EAAA,SAAA,GAAA,GAAA,GAAA,GAAA,IAEA,IAAA,GACA,IAAA,GACA,IAAA,GACA,IAAA,GACA,EAAA,QAAA,GACA,MAGA,EAAA,KAAA,EACA,MACA,KAAA,EAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAmBA,GAhBA,EAAA,KAAA,KAAA,GAAA,IAEA,MAAA,EACA,IAAA,EAEA,EAAA,MAAA,GAAA,GAAA,IAEA,MAAA,EACA,IAAA,EAEA,EAAA,MAAA,GAAA,GAAA,IAEA,MAAA,EACA,IAAA,EAGA,EAAA,KAAA,KAAA,EAAA,MAAA,GAAA,CACA,EAAA,IAAA,sCACA,EAAA,KAAA,EACA,MAIA,EAAA,KAAA,EACA,EAAA,KAAA,EAEA,KAAA,EACA,KAAA,EAAA,KAAA,EAAA,OAAA,CAEA,KAAA,GAAA,GAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,KAAA,GAAA,EAAA,SAAA,EAAA,GAEA,MAAA,EACA,IAAA,EAGA,KAAA,EAAA,KAAA,IACA,EAAA,KAAA,GAAA,EAAA,SAAA,EAaA,GAPA,EAAA,QAAA,EAAA,OACA,EAAA,QAAA,EAEA,GAAA,CAAA,KAAA,EAAA,SACA,GAAA,EAAA,EAAA,EAAA,KAAA,EAAA,GAAA,EAAA,QAAA,EAAA,EAAA,KAAA,IACA,EAAA,QAAA,GAAA,KAEA,GAAA,CACA,EAAA,IAAA,2BACA,EAAA,KAAA,EACA,MAGA,EAAA,KAAA,EACA,EAAA,KAAA,EAEA,KAAA,EACA,KAAA,EAAA,KAAA,EAAA,KAAA,EAAA,OAAA,CACA,KAGA,IAFA,GAAA,EAAA,QAAA,IAAA,GAAA,EAAA,SAAA,MAEA,GAAA,IACA,GAAA,MAAA,MAFA,GAAA,KAAA,KAIA,KANA,CAQA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,GAAA,GAAA,GAEA,MAAA,GACA,IAAA,GAEA,EAAA,KAAA,EAAA,QAAA,OAEA,CACA,GAAA,KAAA,GAAA,CAGA,IADA,GAAA,GAAA,EACA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAOA,GAHA,MAAA,GACA,IAAA,GAEA,IAAA,EAAA,KAAA,CACA,EAAA,IAAA,4BACA,EAAA,KAAA,EACA,MAEA,GAAA,EAAA,KAAA,EAAA,KAAA,GACA,GAAA,GAAA,EAAA,IAEA,MAAA,EACA,IAAA,OAGA,GAAA,KAAA,GAAA,CAGA,IADA,GAAA,GAAA,EACA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAKA,IAAA,GAEA,GAAA,EACA,GAAA,GAAA,GAJA,MAAA,KAMA,MAAA,EACA,IAAA,MAGA,CAGA,IADA,GAAA,GAAA,EACA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAKA,IAAA,GAEA,GAAA,EACA,GAAA,IAAA,KAJA,MAAA,KAMA,MAAA,EACA,IAAA,EAGA,GAAA,EAAA,KAAA,GAAA,EAAA,KAAA,EAAA,MAAA,CACA,EAAA,IAAA,4BACA,EAAA,KAAA,EACA,MAEA,KAAA,MACA,EAAA,KAAA,EAAA,QAAA,IAMA,GAAA,EAAA,OAAA,EAAA,MAGA,GAAA,IAAA,EAAA,KAAA,KAAA,CACA,EAAA,IAAA,uCACA,EAAA,KAAA,EACA,MAeA,GATA,EAAA,QAAA,EAEA,GAAA,CAAA,KAAA,EAAA,SACA,GAAA,EAAA,EAAA,EAAA,KAAA,EAAA,EAAA,KAAA,EAAA,QAAA,EAAA,EAAA,KAAA,IAGA,EAAA,QAAA,GAAA,KAGA,GAAA,CACA,EAAA,IAAA,8BACA,EAAA,KAAA,EACA,MAcA,GAXA,EAAA,SAAA,EAGA,EAAA,SAAA,EAAA,QACA,GAAA,CAAA,KAAA,EAAA,UACA,GAAA,EAAA,EAAA,EAAA,KAAA,EAAA,KAAA,EAAA,MAAA,EAAA,SAAA,EAAA,EAAA,KAAA,IAGA,EAAA,SAAA,GAAA,KAGA,GAAA,CACA,EAAA,IAAA,wBACA,EAAA,KAAA,EACA,MAIA,GADA,EAAA,KAAA,EACA,IAAA,EAAA,MAAA,EAEA,KAAA,EACA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,IAAA,GAAA,IAAA,IAAA,CAEA,EAAA,SAAA,GACA,EAAA,UAAA,GACA,EAAA,QAAA,GACA,EAAA,SAAA,GACA,EAAA,KAAA,GACA,EAAA,KAAA,GAEA,EAAA,EAAA,IAEA,GAAA,EAAA,SACA,GAAA,EAAA,OACA,GAAA,EAAA,UACA,GAAA,EAAA,QACA,GAAA,EAAA,MACA,GAAA,EAAA,SACA,GAAA,EAAA,KACA,GAAA,EAAA,KAGA,EAAA,OAAA,IACA,EAAA,MAAA,GAEA,MAGA,IADA,EAAA,KAAA,EAIA,IAFA,GAAA,EAAA,QAAA,IAAA,GAAA,EAAA,SAAA,MAEA,GAAA,IACA,GAAA,MAAA,MAFA,GAAA,KAAA,KAIA,KANA,CAQA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,GAAA,IAAA,IAAA,IAAA,IAAA,CAIA,IAHA,GAAA,GACA,GAAA,GACA,GAAA,GAKA,IAHA,GAAA,EAAA,QAAA,KACA,IAAA,GAAA,GAAA,IAAA,IAAA,QAEA,GAAA,IACA,GAAA,MAAA,KAEA,IAJA,GAAA,KAAA,KAIA,KAPA,CASA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAIA,MAAA,GACA,IAAA,GAEA,EAAA,MAAA,GAQA,GALA,MAAA,GACA,IAAA,GAEA,EAAA,MAAA,GACA,EAAA,OAAA,GACA,IAAA,GAAA,CAIA,EAAA,KAAA,EACA,MAEA,GAAA,GAAA,GAAA,CAEA,EAAA,MAAA,EACA,EAAA,KAAA,EACA,MAEA,GAAA,GAAA,GAAA,CACA,EAAA,IAAA,8BACA,EAAA,KAAA,EACA,MAEA,EAAA,MAAA,GAAA,GACA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,EAAA,MAAA,CAGA,IADA,GAAA,EAAA,MACA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,QAAA,IAAA,GAAA,EAAA,OAAA,EAEA,MAAA,EAAA,MACA,IAAA,EAAA,MAEA,EAAA,MAAA,EAAA,MAGA,EAAA,IAAA,EAAA,OACA,EAAA,KAAA,EAEA,KAAA,EACA,KAGA,IAFA,GAAA,EAAA,SAAA,IAAA,GAAA,EAAA,UAAA,MAEA,GAAA,IACA,GAAA,MAAA,MAFA,GAAA,KAAA,KAIA,KANA,CAQA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,GAAA,IAAA,IAAA,IAAA,CAIA,IAHA,GAAA,GACA,GAAA,GACA,GAAA,GAKA,IAHA,GAAA,EAAA,SAAA,KACA,IAAA,GAAA,GAAA,IAAA,IAAA,QAEA,GAAA,IACA,GAAA,MAAA,KAEA,IAJA,GAAA,KAAA,KAIA,KAPA,CASA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAIA,MAAA,GACA,IAAA,GAEA,EAAA,MAAA,GAOA,GAJA,MAAA,GACA,IAAA,GAEA,EAAA,MAAA,GACA,GAAA,GAAA,CACA,EAAA,IAAA,wBACA,EAAA,KAAA,EACA,MAEA,EAAA,OAAA,GACA,EAAA,MAAA,GAAA,GACA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,EAAA,MAAA,CAGA,IADA,GAAA,EAAA,MACA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,EAAA,QAAA,IAAA,GAAA,EAAA,OAAA,EAEA,MAAA,EAAA,MACA,IAAA,EAAA,MAEA,EAAA,MAAA,EAAA,MAGA,GAAA,EAAA,OAAA,EAAA,KAAA,CACA,EAAA,IAAA,gCACA,EAAA,KAAA,EACA,MAIA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,IAAA,GAAA,MAAA,EAEA,GADA,GAAA,GAAA,GACA,EAAA,OAAA,GAAA,CAEA,IADA,GAAA,EAAA,OAAA,IACA,EAAA,OACA,EAAA,KAAA,CACA,EAAA,IAAA,gCACA,EAAA,KAAA,EACA,MAkBA,GAAA,EAAA,OACA,IAAA,EAAA,MACA,GAAA,EAAA,MAAA,IAGA,GAAA,EAAA,MAAA,GAEA,GAAA,EAAA,SAAA,GAAA,EAAA,QACA,GAAA,EAAA,YAGA,GAAA,GACA,GAAA,GAAA,EAAA,OACA,GAAA,EAAA,OAEA,GAAA,KAAA,GAAA,IACA,IAAA,GACA,EAAA,QAAA,GACA,GACA,GAAA,MAAA,GAAA,cACA,IACA,IAAA,EAAA,SAAA,EAAA,KAAA,GACA,MACA,KAAA,EACA,GAAA,IAAA,GAAA,MAAA,EACA,GAAA,MAAA,EAAA,OACA,KACA,EAAA,KAAA,EACA,MACA,KAAA,EACA,GAAA,EAAA,KAAA,CAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KAEA,IAAA,GAAA,OAAA,GACA,IAAA,EAcA,GAXA,IAAA,GACA,EAAA,WAAA,GACA,EAAA,OAAA,GACA,KACA,EAAA,MAAA,EAAA,MAEA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,GAAA,GAAA,IAAA,EAAA,EAAA,MAAA,GAAA,GAAA,GAAA,KAGA,GAAA,IAEA,EAAA,MAAA,GAAA,GAAA,OAAA,EAAA,MAAA,CACA,EAAA,IAAA,uBACA,EAAA,KAAA,EACA,MAGA,GAAA,EACA,GAAA,EAIA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,EAAA,MAAA,EAAA,MAAA,CAEA,KAAA,GAAA,IAAA,CACA,GAAA,IAAA,GAAA,MAAA,EACA,KACA,IAAA,GAAA,OAAA,GACA,IAAA,EAGA,GAAA,MAAA,WAAA,EAAA,OAAA,CACA,EAAA,IAAA,yBACA,EAAA,KAAA,EACA,MAGA,GAAA,EACA,GAAA,EAIA,EAAA,KAAA,EAEA,KAAA,EACA,GAAA,EACA,MAAA,EACA,KAAA,EACA,GAAA,EACA,MAAA,EACA,KAAA,EACA,OAAA,EACA,KAAA,EAEA,QACA,OAAA,EAsBA,OARA,EAAA,SAAA,GACA,EAAA,UAAA,GACA,EAAA,QAAA,GACA,EAAA,SAAA,GACA,EAAA,KAAA,GACA,EAAA,KAAA,IAGA,EAAA,OAAA,KAAA,EAAA,WAAA,EAAA,KAAA,IACA,EAAA,KAAA,GAAA,IAAA,KACA,GAAA,EAAA,EAAA,OAAA,EAAA,SAAA,GAAA,EAAA,YACA,EAAA,KAAA,EACA,IAGA,IAAA,EAAA,SACA,IAAA,EAAA,UACA,EAAA,UAAA,GACA,EAAA,WAAA,GACA,EAAA,OAAA,GACA,EAAA,MAAA,KACA,EAAA,MAAA,EAAA,MACA,EAAA,MAAA,EAAA,EAAA,MAAA,GAAA,GAAA,EAAA,SAAA,IAAA,EAAA,EAAA,MAAA,GAAA,GAAA,EAAA,SAAA,KAEA,EAAA,UAAA,EAAA,MAAA,EAAA,KAAA,GAAA,IACA,EAAA,OAAA,EAAA,IAAA,IACA,EAAA,OAAA,GAAA,EAAA,OAAA,EAAA,IAAA,IACA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,KAAA,IACA,GAAA,GAEA,IAGA,SAAA,GAAA,GAEA,IAAA,IAAA,EAAA,MACA,OAAA,EAGA,IAAA,EAAA,EAAA,MAKA,OAJA,EAAA,SACA,EAAA,OAAA,MAEA,EAAA,MAAA,KACA,EAGA,SAAA,GAAA,EAAA,GACA,IAAA,EAGA,OAAA,GAAA,EAAA,MAEA,IAAA,GADA,EAAA,EAAA,OACA,MAAA,GAGA,EAAA,KAAA,EACA,EAAA,MAAA,EACA,GAPA,EAUA,SAAA,GAAA,EAAA,GACA,IAEA,EAFA,EAAA,EAAA,OAOA,OAAA,GAAA,EAAA,MAGA,KAFA,EAAA,EAAA,OAEA,MAAA,EAAA,OAAA,EACA,EAIA,EAAA,OAAA,GAGA,EAFA,EAEA,EAAA,EAAA,KACA,EAAA,MACA,EAKA,GAAA,EAAA,EAAA,EAAA,IAEA,EAAA,KAAA,EACA,IAEA,EAAA,SAAA,EAEA,GAzBA,EA4BA,QAAA,aAAA,GACA,QAAA,cAAA,GACA,QAAA,iBAAA,GACA,QAAA,YAAA,GACA,QAAA,aAAA,GACA,QAAA,QAAA,GACA,QAAA,WAAA,GACA,QAAA,iBAAA,GACA,QAAA,qBAAA,GACA,QAAA,YAAA;;ACzgDA,aAqBA,OAAA,QAAA,CAGA,WAAA,EACA,gBAAA,EACA,aAAA,EACA,aAAA,EACA,SAAA,EACA,QAAA,EACA,QAAA,EAKA,KAAA,EACA,aAAA,EACA,YAAA,EACA,SAAA,EACA,gBAAA,EACA,cAAA,EAEA,aAAA,EAIA,iBAAA,EACA,aAAA,EACA,mBAAA,EACA,uBAAA,EAGA,WAAA,EACA,eAAA,EACA,MAAA,EACA,QAAA,EACA,mBAAA,EAGA,SAAA,EACA,OAAA,EAEA,UAAA,EAGA,WAAA;;ACjEA,aAqBA,SAAA,IAEA,KAAA,KAAA,EAEA,KAAA,KAAA,EAEA,KAAA,OAAA,EAEA,KAAA,GAAA,EAEA,KAAA,MAAA,KAEA,KAAA,UAAA,EAWA,KAAA,KAAA,GAIA,KAAA,QAAA,GAIA,KAAA,KAAA,EAEA,KAAA,MAAA,EAGA,OAAA,QAAA;;ACzDA,aAGA,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,kBACA,EAAA,QAAA,mBACA,EAAA,QAAA,oBACA,EAAA,QAAA,mBACA,EAAA,QAAA,kBACA,EAAA,QAAA,mBAEA,EAAA,OAAA,UAAA,SAiFA,SAAA,EAAA,GACA,KAAA,gBAAA,GAAA,OAAA,IAAA,EAAA,GAEA,KAAA,QAAA,EAAA,OAAA,CACA,UAAA,MACA,WAAA,EACA,GAAA,IACA,GAAA,IAEA,IAAA,EAAA,KAAA,QAIA,EAAA,KAAA,EAAA,YAAA,GAAA,EAAA,WAAA,KACA,EAAA,YAAA,EAAA,WACA,IAAA,EAAA,aAAA,EAAA,YAAA,OAIA,EAAA,YAAA,GAAA,EAAA,WAAA,KACA,GAAA,EAAA,aACA,EAAA,YAAA,IAKA,EAAA,WAAA,IAAA,EAAA,WAAA,IAGA,IAAA,GAAA,EAAA,cACA,EAAA,YAAA,IAIA,KAAA,IAAA,EACA,KAAA,IAAA,GACA,KAAA,OAAA,EACA,KAAA,OAAA,GAEA,KAAA,KAAA,IAAA,EACA,KAAA,KAAA,UAAA,EAEA,IAAA,EAAA,EAAA,aACA,KAAA,KACA,EAAA,YAGA,GAAA,IAAA,EAAA,KACA,MAAA,IAAA,MAAA,EAAA,IAGA,KAAA,OAAA,IAAA,EAEA,EAAA,iBAAA,KAAA,KAAA,KAAA,QAwOA,SAAA,EAAA,EAAA,GACA,IAAA,EAAA,IAAA,EAAA,GAKA,GAHA,EAAA,KAAA,GAAA,GAGA,EAAA,IAAA,MAAA,EAAA,KAAA,EAAA,EAAA,KAEA,OAAA,EAAA,OAYA,SAAA,EAAA,EAAA,GAGA,OAFA,EAAA,GAAA,IACA,KAAA,EACA,EAAA,EAAA,GAhOA,EAAA,UAAA,KAAA,SAAA,EAAA,GACA,IAGA,EAAA,EACA,EAAA,EAAA,EACA,EALA,EAAA,KAAA,KACA,EAAA,KAAA,QAAA,UACA,EAAA,KAAA,QAAA,WAOA,GAAA,EAEA,GAAA,KAAA,MAAA,OAAA,EACA,EAAA,MAAA,EAAA,GAAA,IAAA,EAAA,EAAA,SAAA,EAAA,WAGA,iBAAA,EAEA,EAAA,MAAA,EAAA,cAAA,GACA,yBAAA,EAAA,KAAA,GACA,EAAA,MAAA,IAAA,WAAA,GAEA,EAAA,MAAA,EAGA,EAAA,QAAA,EACA,EAAA,SAAA,EAAA,MAAA,OAEA,EAAA,CA4BA,GA3BA,IAAA,EAAA,YACA,EAAA,OAAA,IAAA,EAAA,KAAA,GACA,EAAA,SAAA,EACA,EAAA,UAAA,IAGA,EAAA,EAAA,QAAA,EAAA,EAAA,eAEA,EAAA,aAAA,IAGA,EADA,iBAAA,EACA,EAAA,WAAA,GACA,yBAAA,EAAA,KAAA,GACA,IAAA,WAAA,GAEA,EAGA,EAAA,EAAA,qBAAA,KAAA,KAAA,IAIA,IAAA,EAAA,cAAA,IAAA,IACA,EAAA,EAAA,KACA,GAAA,GAGA,IAAA,EAAA,cAAA,IAAA,EAAA,KAGA,OAFA,KAAA,MAAA,GACA,KAAA,OAAA,GACA,EAGA,EAAA,WACA,IAAA,EAAA,WAAA,IAAA,EAAA,eAAA,IAAA,EAAA,UAAA,IAAA,EAAA,UAAA,IAAA,EAAA,gBAEA,WAAA,KAAA,QAAA,IAEA,EAAA,EAAA,WAAA,EAAA,OAAA,EAAA,UAEA,EAAA,EAAA,SAAA,EACA,EAAA,EAAA,WAAA,EAAA,OAAA,GAGA,EAAA,SAAA,EACA,EAAA,UAAA,EAAA,EACA,GAAA,EAAA,SAAA,EAAA,OAAA,EAAA,OAAA,EAAA,EAAA,GAEA,KAAA,OAAA,IAGA,KAAA,OAAA,EAAA,UAAA,EAAA,OAAA,EAAA,aAYA,IAAA,EAAA,UAAA,IAAA,EAAA,YACA,GAAA,UAGA,EAAA,SAAA,GAAA,IAAA,EAAA,YAAA,IAAA,EAAA,cAOA,OALA,IAAA,EAAA,eACA,EAAA,EAAA,UAIA,IAAA,EAAA,UACA,EAAA,EAAA,WAAA,KAAA,MACA,KAAA,MAAA,GACA,KAAA,OAAA,EACA,IAAA,EAAA,MAIA,IAAA,EAAA,eACA,KAAA,MAAA,EAAA,MACA,EAAA,UAAA,GACA,IAgBA,EAAA,UAAA,OAAA,SAAA,GACA,KAAA,OAAA,KAAA,IAcA,EAAA,UAAA,MAAA,SAAA,GAEA,IAAA,EAAA,OACA,WAAA,KAAA,QAAA,GAGA,KAAA,OAAA,KAAA,OAAA,KAAA,IAEA,KAAA,OAAA,EAAA,cAAA,KAAA,SAGA,KAAA,OAAA,GACA,KAAA,IAAA,EACA,KAAA,IAAA,KAAA,KAAA,KAgFA,QAAA,QAAA,EACA,QAAA,QAAA,EACA,QAAA,WAAA,EACA,QAAA,OAAA;;AChaA,aAEA,IAAA,EAAA,QAAA,sBAAA,OAEA,EAAA,QAAA,iBACA,EAAA,QAAA,iBACA,EAAA,QAAA,wBAEA,EAAA,GAEA,EAAA,EAAA,EAAA,EAAA,GAEA,OAAA,QAAA;;ACasC,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,0BAAA,QAAA,2BAAA,EA1BtC,IAAA,EAAA,EAAA,QAAA,SA0BsC,SAAA,IAAA,GAAA,mBAAA,QAAA,OAAA,KAAA,IAAA,EAAA,IAAA,QAAA,OAAA,EAAA,WAAA,OAAA,GAAA,EAAA,SAAA,EAAA,GAAA,GAAA,GAAA,EAAA,WAAA,OAAA,EAAA,GAAA,OAAA,GAAA,iBAAA,GAAA,mBAAA,EAAA,MAAA,CAAA,QAAA,GAAA,IAAA,EAAA,IAAA,GAAA,GAAA,EAAA,IAAA,GAAA,OAAA,EAAA,IAAA,GAAA,IAAA,EAAA,GAAA,EAAA,OAAA,gBAAA,OAAA,yBAAA,IAAA,IAAA,KAAA,EAAA,GAAA,OAAA,UAAA,eAAA,KAAA,EAAA,GAAA,CAAA,IAAA,EAAA,EAAA,OAAA,yBAAA,EAAA,GAAA,KAAA,IAAA,EAAA,KAAA,EAAA,KAAA,OAAA,eAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,OAAA,EAAA,QAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,SAAA,EAAA,EAAA,EAAA,GAAA,OAAA,IAAA,IAAA,EAAA,UAAA,SAAA,EAAA,GAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,KAAA,IAAA,MAAA,GAAA,EAAA,IAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,MAAA,IAAA,MAAA,GAAA,EAAA,IAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,KAAA,EAAA,EAAA,QAAA,EAAA,EAAA,MAAA,aAAA,EAAA,EAAA,IAAA,EAAA,SAAA,GAAA,EAAA,MAAA,KAAA,EAAA,GAAA,GAAA,EAAA,EAAA,MAAA,EAAA,GAAA,KAAA,WAlBhC,MAAO,EACX,YAAoB,EAA0B,GAA1B,KAAA,SAAA,EAA0B,KAAA,SAAA,EACxC,OAgB8B,OAAA,EAAA,UAAA,OAAA,EAAA,YAf3B,OAAA,KAAK,WAER,oBAa8B,OAAA,EAAA,UAAA,OAAA,EAAA,YAP3B,OAAA,IAAI,YAAY,KAEnB,aAK8B,OAAA,EAAA,UAAA,OAAA,EAAA,YAJ3B,OAAA,KAAK,YAIsB,QAAA,sBAAA,EAAhC,MAAO,EAGX,YACU,EACR,GADQ,KAAA,YAAA,EAGH,KAAA,iBAAmB,EAA2B,KAAY,GAAyB,EAAA,UAAA,OAAA,EAAA,YAClF,IAEK,OADQ,EAAK,QAAQ,IAAI,WAAW,IAAW,OAEtD,MAAO,GACA,OAAA,MAKP,OAjB8B,OAAA,EAAA,UAAA,OAAA,EAAA,YAkB3B,aAAM,KAAK,cAGd,oBArB8B,OAAA,EAAA,UAAA,OAAA,EAAA,YAsB3B,aAAM,KAAK,mBAGd,aAzB8B,OAAA,EAAA,UAAA,OAAA,EAAA,YA0B5B,MAAA,QAAe,KAAK,oBAGtB,IAAA,EAAW,QAET,MAAA,EAAQ,IAAI,WAAW,GAWzB,GAVA,EAAM,OAAS,IACA,MAAb,EAAM,IAA4B,MAAb,EAAM,GAE7B,EAAW,WACW,MAAb,EAAM,IAA4B,MAAb,EAAM,KAEpC,EAAW,aAIY,oBAAhB,YAA6B,CAE/B,OADS,IAAI,YAAY,GACjB,OAAO,GACjB,CAIL,QAAQ,KAAK,sEACT,IAAA,EAAc,GACb,IAAA,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAO,OAAO,aAAa,EAAM,IAE5B,OAAA,KAIJ,gBAAS,GACR,MAAA,EAAmD,IAAI,QAAQ,IAC7D,MAAA,EAAS,IAAI,WACnB,EAAO,iBAAiB,UAAW,KAC7B,KAAE,EAAO,kBAAkB,aACvB,MAAA,IAAI,MAAM,2DAElB,EAAQ,EAAO,UAEjB,EAAO,kBAAkB,KAGpB,OAAA,IAAI,EAA0B,QAAQ,QAAQ,EAAK,MAAO,GAG5D,uBAAgB,EAAc,GAC5B,OAAA,IAAI,EAA0B,QAAQ,QAAQ,GAAO,QAAQ,QAAQ,KA1E1C,QAAA,0BAAA;;ACoyBf,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,8BAAA,EAAA,QAAA,2BAAA,EAAA,QAAA,8BAAA,EAAA,QAAA,iCAAA,EAAA,QAAA,4BAAA,EAAA,QAAA,WAAA,EAAA,QAAA,SAAA,EA3zBvB,IAAA,EAAA,QAAA,kBAOA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAEA,EAAA,QAAA,WAizBuB,EAAA,SAAA,EAAA,EAAA,EAAA,GAAA,OAAA,IAAA,IAAA,EAAA,UAAA,SAAA,EAAA,GAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,KAAA,IAAA,MAAA,GAAA,EAAA,IAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,MAAA,IAAA,MAAA,GAAA,EAAA,IAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,KAAA,EAAA,EAAA,QAAA,EAAA,EAAA,MAAA,aAAA,EAAA,EAAA,IAAA,EAAA,SAAA,GAAA,EAAA,MAAA,KAAA,EAAA,GAAA,GAAA,EAAA,EAAA,MAAA,EAAA,GAAA,KAAA,WA/yBvB,SAAS,EAAY,GACb,MAAA,EAAQ,EAAS,MAAM,MAAM,IAAI,GAAK,EAAE,MAAM,OAE9C,EAAa,EAAM,QACrB,IAAC,EAAY,MAAO,GAElB,MAAA,EAAe,IAAI,IACpB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,IACrC,EAAa,IAAI,EAAG,EAAW,IAG3B,MAAA,EAAW,GACZ,IAAA,IAAI,KAAQ,EAAO,CAChB,MAAA,EAAM,GACP,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC7B,EAAY,EAAa,IAAI,IAAO,EAAK,GAE7C,EAAI,KAAK,GAEJ,OAAA,EAmBT,SAAS,EAAU,GACb,GAAA,eAAgB,EAAa,CACzB,MAAA,EAAkB,EAAY,cAC9B,EAAQ,iDAAiD,KAAK,GAChE,IAAC,EAAO,OAAO,EACb,MAAA,EAAQ,SAAS,EAAM,GAAI,IAC3B,EAAQ,EAAM,GAEZ,OAAA,GACD,IAAA,QACI,OAAA,EACJ,IAAA,KACI,OAAA,KAAO,EACX,IAAA,KACI,OAAA,QAAc,EAClB,IAAA,KACI,OAAA,WAAqB,EAE1B,MAAA,IAAI,4BAA4B,KAGpC,GAAA,WAAY,GAAe,iBAAkB,EAAa,CACtD,MAAA,EAAe,EAAW,QAAc,EAAY,gBACpD,EAAQ,kDAAkD,KAAK,GACjE,IAAC,EAAO,OAAO,EACb,MAAA,EAAQ,SAAS,EAAM,GAAI,IAC3B,EAAQ,EAAM,GAEZ,OAAA,GACD,IAAA,KACI,OAAA,EACJ,IAAA,IAEA,IAAA,MACI,OAAA,IAAO,EAEZ,MAAA,IAAI,4BAA4B,KAGjC,OAAC,EAIJ,SAAU,EAA8B,GACtC,MAAA,EAAU,IAAI,EAAJ,uBACV,EAAO,EAA6D,GAEpE,EAA+B,GACjC,IAAA,EAA0B,EAEzB,IAAA,IAAI,KAAO,EAAM,CACd,MAAA,EAAa,EAAI,eACnB,IAAC,EAAY,SACX,MAAA,EAAoB,EAAW,OACjC,IAAA,EAAa,EAAW,OAAS,EAAkB,OAEnD,GAAA,EAAM,OAAS,EAAa,EACxB,MAAA,IAAI,MAAM,kBAGd,IAAA,EAAuC,GAEpC,KAAA,EAAa,EAAM,QAAQ,CAC1B,MAAA,EAAW,EAAM,MACvB,EAAc,KAAK,GAGhB,IAAA,IAAI,KAAgB,EACvB,EAAkB,KAAK,IAAI,EAAiB,EAAa,UACzD,EAAQ,WAAW,EAAc,GAG7B,MAAA,EAAoC,CACxC,OAAQ,EAAI,gBAAkB,MAAM,IACpC,KAAM,EACN,KAAM,EAAI,eACV,SAAU,EAAkB,EAAU,IAGxC,EAAQ,WAAW,EAAc,GACjC,EAAM,KAAK,GAGN,KAAA,EAAM,OAAS,GAAG,CACjB,MAAA,EAAe,EAAM,MAC3B,EAAkB,KAAK,IAAI,EAAiB,EAAa,UACzD,EAAQ,WAAW,EAAc,GAS5B,MANH,eAAgB,EAAK,GACvB,EAAQ,kBAAkB,IAAI,EAAJ,gBACjB,WAAY,EAAK,IAAM,iBAAkB,EAAK,KACvD,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBAGvC,EAAQ,QASjB,SAAe,EAAqB,GAiqBb,OAAA,EAAA,UAAA,OAAA,EAAA,YAhqBf,MAAA,EAA2B,CAC/B,KAAM,EAAM,KACZ,MAAO,IAAI,IACX,eAAgB,IAAI,KAGhB,QAAiB,IAAI,QAA2B,CAAC,EAAS,KAC9D,EAAM,eAAe,YAAa,IAChC,EAAQ,IACP,KAGA,IAAA,IAAI,KAAS,EACZ,GAAA,EAAM,YAAa,CACf,MAAA,QAAgB,EAAqB,GAC3C,EAAK,eAAe,IAAI,EAAQ,KAAM,OACjC,CACC,MAAA,QAAa,IAAI,QAAc,CAAC,EAAS,KAC3C,EAA8B,KAAK,EAAS,KAEhD,EAAK,MAAM,IAAI,EAAK,KAAM,GAIvB,OAAA,IAGT,SAAS,EAAkB,GAClB,OAAA,EAA0B,0BAAA,SAAS,GAAM,oBAGlD,SAAS,EAAW,GACX,OAAA,EAA0B,0BAAA,SAAS,GAAM,aAGlD,SAAS,EAAiB,EAA0B,GAC5C,MAAA,GAAY,EAAW,EAAA,YAAA,EAAK,eAAgB,aAC5C,GAAkB,EAAW,EAAA,YAAA,EAAU,qBAAsB,KAC5D,OAAA,EAAW,EAAA,YAAA,EAAgB,eAAgB,QAGpD,MAAM,EAGJ,YAAY,GAFJ,KAAA,QAAkB,EAGnB,KAAA,KAAO,IAAI,SAAS,GAE3B,KAAK,GACE,KAAA,QAAU,EAEjB,KAAK,GACE,KAAA,SAAW,EAElB,UACS,OAAA,KAAK,QAAU,KAAK,KAAK,WAElC,YACS,OAAA,KAAK,KAAK,WAAa,KAAK,QAErC,YAEM,OADC,KAAA,UACD,KAAK,QAAU,KAAK,KAAK,WAAmB,EACzC,KAAK,KAAK,SAAS,KAAK,QAAU,GAK3C,aAEM,OADC,KAAA,SAAW,EACZ,KAAK,QAAU,KAAK,KAAK,WAAmB,EACzC,KAAK,KAAK,UAAU,KAAK,QAAU,GAAG,GAE/C,aAEM,OADC,KAAA,SAAW,EACZ,KAAK,QAAU,KAAK,KAAK,WAAmB,EAG9C,KAAK,KAAK,UAAU,KAAK,QAAU,GAAG,GACtC,KAAK,KAAK,UAAU,KAAK,QAAU,GAAG,GAAQ,KAAK,IAAI,EAAG,IAG9D,aAEM,OADC,KAAA,SAAW,EACZ,KAAK,QAAU,KAAK,KAAK,WAAmB,EAE9C,KAAK,KAAK,UAAU,KAAK,QAAU,GAAG,GACtC,KAAK,KAAK,UAAU,KAAK,QAAU,GAAG,GAAQ,KAAK,IAAI,EAAG,KAWhE,SAAe,EAAiB,GA+jBT,OAAA,EAAA,UAAA,OAAA,EAAA,YA9jBf,MAAA,GAAS,EAAW,EAAA,YAAA,EAAK,eAAgB,UAC1C,IAAA,IAAI,KAAY,EAAO,eAAe,SAAU,CAC7C,MAAA,EAAa,EAAS,MAAM,IAAI,cAClC,IAAC,EAAY,SACX,MAAA,QAAe,EAAW,GAC5B,IAAC,sBAAsB,KAAK,GAC9B,SAEI,MAAA,EAAY,IAAI,QACd,GAAkB,EAAW,EAAA,YAAA,EAAS,MAAO,eAGrD,EAAU,aACV,EAAU,aACV,EAAU,aACJ,MAAA,EAAa,EAAU,aACvB,EAAgB,EAAU,aAEhC,EAAU,KAAK,GAET,MAAA,EAAoB,GACnB,OAAM,CAGL,MAAA,EAAY,EAAU,aACxB,GAAc,IAAd,EAAiB,MAEf,MAAA,EAAW,EAAU,aAE3B,EAAU,KAAK,EAAgB,EAAI,EAAI,GACjC,MAAA,EAAc,EAAU,aAC9B,EAAQ,KAAK,CAAC,UAAA,EAAW,SAAA,EAAU,YAAA,IAE9B,OAAA,EAEH,MAAA,IAAI,MAAM,gCAGlB,SAAe,EAAiB,EAAmB,GAwhB5B,OAAA,EAAA,UAAA,OAAA,EAAA,YAvhBf,MAAA,GAAW,EAAW,EAAA,YAAA,EAAK,eAAgB,YAC3C,GAAe,EAAW,EAAA,YAAA,EAAS,eAAgB,gBACnD,GAAsB,EAAW,EAAA,YAAA,EAAa,MAAO,wBACrD,GAAqB,EAAW,EAAA,YAAA,EAAa,MAAO,uBAWpD,EAAc,IAAI,QAAgB,EAAkB,IACpD,EAAa,IAAI,QAAgB,EAAkB,IAGzD,EAAY,KAAK,IAEb,IAAA,EAAqB,GAElB,KAAA,EAAY,WAAW,CACtB,MAAA,EAAa,EAAY,aAA2C,QAA5B,EAAY,aAEtD,GAAe,IAAf,EAGF,SAGF,EAAW,KAAK,GAEZ,IAAA,EAAS,EAAW,aACpB,EAAkB,GAEf,KAAA,KACL,EAAM,KAAK,EAAW,cAExB,EAAO,KAAK,GAGP,OAAA,IAqBT,SAAe,EAAiB,GAwdT,OAAA,EAAA,UAAA,OAAA,EAAA,YAvdf,MAAA,GAAe,EAAW,EAAA,YAAA,EAAK,MAAO,iBACtC,EAAU,QAAkC,EAAkB,IAE9D,EAAU,EAAQ,yCACpB,IAAA,EAAoB,EACpB,kCAAmC,IACrC,EAAoB,EAAQ,iCAAiC,IAAI,uBAE/D,IAAA,EAAa,EAAO,GACpB,mBAAoB,IACtB,EAAa,MAAM,KAAK,EAAO,eAAmB,QAAQ,IAEtD,MAAA,EAAa,EAAQ,2BAErB,EAA8B,GAC/B,IAAA,IAAI,KAAa,EAAW,WAAY,CACrC,MAAA,GAAU,EAAkC,EAAA,YAAA,EAAW,QAAS,GAEhE,GAAe,EACnB,EAAA,YAAA,EACA,gBAGI,EAAoB,IAAI,IAGzB,IAAA,IAAI,KAAW,EAAa,SAAU,CACpC,IAAA,IAAI,KAAU,EAAQ,QAAS,CAC9B,IAAC,EAAQ,SACP,MAAA,WAAC,EAAD,WAAa,EAAb,cAAyB,GAAiB,EAC3C,IAAA,IAAI,KAAW,EAAc,QACpB,EAAA,EAAA,aAAA,EAAmB,EAAS,KAChC,MAAA,EAAO,SAAmB,EAAQ,EAAA,SAAA,EAAQ,SAAS,IAAK,MACxD,EAAmB,CACvB,OAAQ,KAAc,IACtB,KAAM,GAKD,OAHH,IACF,EAAM,KAAO,GAER,IAKb,EAAK,KAAK,CACR,OAAQ,EACR,kBAAA,KAKC,MAAA,CACL,QAAA,EACA,WAAA,EACA,kBAAA,EACA,KAAA,KAKE,SAAgB,EACpB,GAyZqB,OAAA,EAAA,UAAA,OAAA,EAAA,YAvZf,MAAA,QAAa,EAAqB,IAElC,QAAC,EAAD,KAAU,EAAV,WAAgB,EAAhB,kBAA4B,SAA2B,EAAiB,GAC1E,GAAe,gDAAf,EACI,MAAA,IAAI,gHACkG,KAG9G,QAAQ,IAAI,YAAa,GACzB,QAAQ,IAAI,0BAEN,MAAA,EAAsB,GACxB,IAAA,EAAc,EAEb,IAAA,IAAI,KAAO,EAAM,CACd,MAAA,kBAAC,EAAD,OAAoB,GAAU,EAC9B,QAAc,EAA8B,CAChD,SAAU,EAAM,KAChB,KAAA,EACA,kBAAA,EACA,UAAW,IAGT,EAAI,SAAW,IACjB,EAAc,EAAS,OAAS,EAAM,aAGxC,EAAS,QAAQ,EAAM,UAGlB,MAAA,CAAC,KAAM,EAAM,KAAM,YAAA,EAAa,SAAA,KAGnC,SAAgB,EAA8B,GAsX7B,OAAA,EAAA,UAAA,OAAA,EAAA,YAhXf,MAAA,SAAC,EAAD,KAAW,EAAX,kBAAiB,EAAjB,UAAoC,GAAa,EACjD,EAAO,EAAiB,EAAM,GAChC,IAAA,QAAgB,EAAiB,GAC/B,MAAA,QAAe,EAAiB,EAAS,GAIzC,EAAwB,IAAI,IAC7B,IAAA,IAAI,KAAU,EACjB,EAAsB,IACpB,EAAO,UACP,EAAU,EAAA,WAAA,EAAuB,EAAO,SAAU,IAAM,GAAK,GAG3D,MAAA,EAAS,MAAM,KAAK,EAAsB,YACzC,EAAA,EAAA,QAAA,EAAQ,IAAM,EAAE,IACjB,MAAA,EAAY,EAAO,IAAI,GAAK,EAAE,IAE7B,MAAA,CACL,KAAM,EACN,YAAa,EACb,SAAU,EAAU,IAAI,GACtB,EAAiC,CAC/B,SAAA,EACA,SAAA,EACA,OAAA,EACA,kBAAA,EACA,QAAA,QAMF,SAAU,EAAiC,GAO3C,IAAA,SAAC,EAAD,kBAAW,EAAX,OAA8B,EAA9B,SAAsC,EAAtC,QAAgD,GAAW,EAEzD,MAAA,EAAqB,IAAI,IAC/B,EAAU,EAAQ,OAAO,GAAK,EAAE,WAAa,GAEvC,MAAA,EAAU,IAAI,EAAJ,yBAA4B,EAAO,EAAA,QAAA,GAAU,WAGpD,SAAA,EAAgB,EAAW,GAC5B,MAAA,EAAQ,EAAkB,IAAI,GAChC,GAAA,EACF,EAAM,KAAK,QACN,GAAI,KAAK,EACT,IAAA,IAAI,KAAQ,EAAO,GACtB,EAAgB,EAAM,OAEnB,CACC,MAAA,EAA6B,CACjC,IAAK,EACL,WAAW,EAAQ,EAAA,SAAA,EAAE,SAAS,IAAK,OAErC,EAAkB,IAAI,EAAG,GACzB,EAAM,KAAK,IAhBf,EAAQ,WAAW,cAAqB,KAoBpC,IAAA,EAA+B,KAC9B,IAAA,IAAI,KAAU,EAAS,CACpB,MAAA,GAAiB,EAAY,EAAA,aAAA,EAAoB,EAAO,YAAa,IACnE,MAAA,EAAqB,GAGpB,OAFP,EAAgB,EAAI,GACpB,EAAM,UACC,IAUL,GAPkB,OAAlB,IAGF,EAAQ,uBAAuB,GAAI,EAAO,WAC1C,EAAgB,EAAO,WAGrB,EAAO,UAAY,EACf,MAAA,IAAI,MAAM,4BAGlB,EAAQ,uBAAuB,EAAgB,EAAO,UAAY,GAClE,EAAgB,EAAO,UAIlB,OADP,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,gBACrC,EAAQ,QAGX,SAAU,EAA4B,GAyEnC,OAtEM,EADO,EADF,IAAI,WAAW,IAEY,CAAC,EAAY,KAChD,OAAA,GACD,IAAA,gBACA,IAAA,mBACA,IAAA,SAEI,OAAA,KAEJ,IAAA,gBAAiB,CACd,MAAA,EAAM,OAAO,OAAO,MAC1B,EAAI,WAAa,EAAO,GACxB,EAAI,WAAa,EAAO,GACxB,EAAI,cAAgB,IAAI,IACnB,IAAA,IAAI,EAAI,GAAK,GAAK,EAAG,CAClB,MAAA,EAAU,EAAO,IAAM,GACvB,EAAO,EAAO,KAAO,EAAI,IAC3B,GAAW,MAAX,GAA2B,MAAR,EACrB,MAEF,EAAI,cAAc,IAAI,EAAS,GAE1B,OAAA,EAGJ,IAAA,eAAgB,CACb,MAAA,EAAM,OAAO,OAAO,MAGnB,OAFP,EAAI,UAAY,EAAO,GACvB,EAAI,UAAY,EAAO,GAChB,EAGJ,IAAA,uBAAwB,CACrB,MAAA,EAAM,OAAO,OAAO,MACpB,EAAc,EAAO,GAE3B,EAAI,YAAc,EAAO,GACzB,EAAI,QAAU,GACT,IAAA,IAAI,EAAI,EAAG,EAAI,EAAa,IAC/B,EAAI,QAAQ,KAAK,EAAO,KAAO,EAAI,KAE9B,OAAA,EAGJ,IAAA,gBAAiB,CACd,MAAA,EAAM,OAAO,OAAO,MAGnB,OAFP,EAAI,WAAa,EAAO,GACxB,EAAI,QAAU,EAAO,GACd,EAGJ,IAAA,uBAAwB,CACrB,MAAA,EAAM,IAAI,IACV,EAAO,EAAO,GACf,IAAA,IAAI,EAAI,EAAG,EAAI,EAAM,IAAK,CACvB,MAAA,EAAM,EAAO,KAAO,EAAI,EAAI,IAC5B,EAAQ,EAAO,KAAY,EAAI,EAAI,EAAb,IAC5B,EAAI,IAAI,EAAK,GAER,OAAA,EAGJ,IAAA,SAAU,CACP,MAAA,EAAM,OAAO,OAAO,MAGnB,OAFP,EAAI,OAAS,EAAO,GACpB,EAAI,KAAO,EAAO,GACX,GAGJ,OAAA,IAOL,SAAU,EAAW,GACrB,IAAA,EAAO,OAAO,aAAa,MAAM,OAAQ,MAAM,KAAK,IAEjD,MADgB,OAAnB,EAAK,OAAO,KAAa,EAAO,EAAK,MAAM,GAAI,IAC5C,mBAAmB,OAAO,IAGnC,SAAS,EAAQ,GACR,OAAA,aAAiB,MAG1B,SAAS,EAAa,GACb,OAAU,OAAV,GAAmC,iBAAV,GAAuD,OAAjC,OAAO,eAAe,GAG9E,SAAS,EAAU,EAAgB,GAC1B,OAAA,aAAiB,EAAM,EAAQ,EAAM,OAAS,EAGvD,SAAS,EACP,EACA,EAAwD,CAAA,GAAK,IAI3D,GAAkB,MAAlB,EAAK,UACc,oBAAnB,EAAK,YACJ,EAAa,EAAK,QAClB,EAAQ,EAAK,UAER,MAAA,IAAI,MAAM,yBAIO,UAArB,EAAK,SAAS,KAChB,EAAK,SAAS,GAAK,MAIhB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,SAAS,OAAQ,IACxC,EAAK,SAAS,GAAK,EAAsB,EAAK,SAAU,EAAK,SAAS,GAAI,GAIxE,IAAA,EAAS,IACP,GAAA,aAAkB,EACb,OAAA,EAAK,SAAS,EAAO,OACvB,GAAI,EAAQ,GACZ,IAAA,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAO,GAAK,EAAM,EAAO,SAEtB,GAAI,EAAa,GACjB,IAAA,IAAI,KAAO,EACd,EAAO,GAAO,EAAM,EAAO,SAExB,GAAI,aAAkB,IAAK,CAC1B,MAAA,EAAQ,IAAI,IAAI,GACtB,EAAO,QACF,IAAA,IAAK,EAAG,KAAM,EAAM,UACvB,EAAO,IAAI,EAAM,GAAI,EAAM,IAGxB,OAAA,GAEJ,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,SAAS,OAAQ,IACxC,EAAM,EAAK,SAAS,IAEf,OAAA,EAAM,EAAK,MAGpB,SAAS,EACP,EACA,EACA,EAAwD,CAAA,GAAK,IAEzD,GAAA,EAAa,IAAU,EAAM,OAAQ,CACnC,IAAA,EAAO,EAAU,EAAS,EAAM,QAAQ,WACpC,OAAA,GACD,IAAA,6BAA8B,CAC7B,IAAA,EAAiB,EAAM,aACvB,EAAmB,EAAM,eACzB,EAAoB,EAAM,kBAC1B,EAAoB,EAAM,eAC1B,EAAW,IAAI,YAAY,IAAI,WAAW,EAAM,gBAAgB,QAChE,EAAU,EAET,IAAA,IAAI,EAAI,EAAG,EAAI,EAAQ,IAAK,CAC3B,IAAA,EAAQ,EAAS,GAEH,IAAd,IAEF,GAAkB,MAAR,IAAmB,GAAe,IAAR,IAAmB,GAGzD,GAAW,EAAQ,KAAK,IAAI,MAAO,GAI9B,OADP,GAAW,KAAK,IAAI,GAAI,GACjB,GAAY,EAAU,EAI1B,IAAA,SACA,IAAA,gBACI,OAAA,EAAM,aAAe,EAAM,WAG/B,IAAA,WACA,IAAA,kBACC,OAAA,EAAM,aAAqB,EAAM,aACjC,EAAM,YAAoB,EAAW,EAAM,cAC/C,QAAQ,mBAAmB,aAAiB,GACrC,MAGJ,IAAA,UACA,IAAA,iBACC,GAAA,eAAgB,EACX,OAAA,EAAM,cAEX,IAAA,EAAe,GACZ,OAAM,CACP,IAAA,EAAS,aAAe,EAAM,OAC9B,KAAE,KAAU,GACd,MAEF,EAAM,KAAK,EAAM,IAEZ,OAAA,EAEJ,IAAA,6BAA8B,CAC3B,MAAA,EAAQ,EAAM,YAOhB,IAAA,EAAe,GACd,IAAA,IAAI,EAAI,EAAG,EAAI,EAAO,IAAK,CACxB,MAAA,EAAU,EAAM,IAAM,GAC5B,EAAM,KAAK,GAEN,OAAA,EAGJ,IAAA,eACA,IAAA,sBACC,IAAA,EAAM,IAAI,IACV,GAAA,YAAa,GAAS,eAAgB,EACnC,IAAA,IAAI,EAAI,EAAG,EAAI,EAAM,WAAW,OAAQ,IAC3C,EAAI,IAAI,EAAM,WAAW,GAAI,EAAM,cAAc,SAG5C,OAAM,CACP,IAAA,EAAM,UAAY,EAAI,KACtB,EAAS,aAAe,EAAI,KAC5B,KAAE,KAAO,GAAY,KAAU,GACjC,MAEF,EAAI,IAAI,EAAM,GAAM,EAAM,IAGvB,OAAA,EAET,QACQ,MAAA,EAAY,EAAe,EAAM,GACnC,GAAA,IAAc,EAAO,OAAO,GAG/B,OAAA,EAKH,MAAO,EACX,YAAmB,GAAA,KAAA,MAAA,GAGrB,SAAS,EAAiB,GAEnB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAG,IACjB,GAAA,EAAM,KAFD,WAEa,WAAW,GACzB,MAAA,IAAI,MAAM,8BAGb,OAAA,IAAI,EACT,IAAI,SAAS,EAAM,OAAQ,EAAM,WAAY,EAAM,aACnD,YASmB,QAAA,IAAA,EAAvB,MAAM,EAKJ,YAAmB,GAAA,KAAA,KAAA,EAJnB,KAAA,cAAgB,EAChB,KAAA,QAAoB,GACpB,KAAA,YAAwB,GAIxB,YACM,IAAA,EAAU,KAAK,KAAK,WAAa,GACjC,EAAa,KAAK,KAAK,SAAS,EAAU,GACzC,KAAA,cAAgB,KAAK,KAAK,SAAS,EAAU,GAG9C,IAAA,EAAc,KAAK,KAAK,UAAU,EAAU,IAAI,GAChD,EAAY,KAAK,KAAK,UAAU,EAAU,IAAI,GAC9C,EAAc,KAAK,KAAK,UAAU,EAAU,IAAI,GAG/C,IAAA,IAAI,EAAI,EAAG,EAAI,EAAa,IAC1B,KAAA,YAAY,KAAK,KAAK,aAAa,EAAa,IACrD,GAAe,EAIV,OAAA,KAAK,YAAY,KAAK,YAAY,IAG3C,qBAAqB,EAAgB,GAC/B,GAAU,KAAV,EAAgB,MAAO,CAAC,OAAQ,EAAO,OAAQ,GAC/C,IAAA,EAAS,KAAK,KAAK,SAAS,KAC5B,GAAoB,KAAV,IAAT,GACH,MAAM,IAAI,MAAM,2CAA6C,GAC3D,IAAA,EAAO,IAAe,GAAT,GACV,MAAA,CAAC,OAAQ,KAAK,aAAa,EAAQ,GAAO,OAAQ,EAAO,GAGlE,eAAe,EAAgB,GACzB,GAAU,IAAV,EAAa,OAAO,KACpB,GAAU,IAAV,EAAa,OAAO,EACpB,GAAU,IAAV,EAAa,OAAO,EAClB,MAAA,IAAI,MAAM,0BAA4B,EAAQ,cAAgB,GAGtE,aAAa,EAAgB,GACvB,GAAS,IAAT,EAAY,OAAO,KAAK,KAAK,SAAS,GACtC,GAAS,IAAT,EAAY,OAAO,KAAK,KAAK,UAAU,GAAQ,GAC/C,GAAS,IAAT,EAAY,OAAO,KAAK,KAAK,UAAU,GAAQ,GAE/C,GAAS,IAAT,EAEA,OAAA,KAAK,IAAI,EAAG,IAAU,KAAK,KAAK,UAAU,EAAS,GAAG,GACtD,KAAK,IAAI,EAAG,GAAU,KAAK,KAAK,UAAU,EAAS,GAAG,GAItD,GAAS,KAAT,EAEA,OAAA,KAAK,IAAI,EAAG,IAAU,KAAK,KAAK,UAAU,EAAS,GAAG,GACtD,KAAK,IAAI,EAAG,IAAU,KAAK,KAAK,UAAU,EAAS,GAAG,GACtD,KAAK,IAAI,EAAG,IAAU,KAAK,KAAK,UAAU,EAAS,GAAG,GACtD,KAAK,IAAI,EAAG,GAAU,KAAK,KAAK,UAAU,EAAS,IAAI,GAIrD,MAAA,IAAI,MAAM,8BAAgC,EAAO,cAAgB,GAGzE,WAAW,EAAgB,GACrB,GAAS,IAAT,EAAY,OAAO,KAAK,KAAK,WAAW,GAAQ,GAChD,GAAS,IAAT,EAAY,OAAO,KAAK,KAAK,WAAW,GAAQ,GAC9C,MAAA,IAAI,MAAM,4BAA8B,EAAO,cAAgB,GAGvE,UAAU,EAAgB,GACpB,GAAS,IAAT,EAAY,MAAM,IAAI,MAAM,2BAA6B,EAAO,cAAgB,GAChF,IAAA,EAAU,KAAK,KAAK,WAAW,GAAQ,GACpC,OAAA,IAAI,KAAK,UAAyB,IAAV,GAGjC,UAAU,EAAgB,GACpB,IAAA,EAAO,KAAK,qBAAqB,EAAQ,GACtC,OAAA,IAAI,WAAW,KAAK,KAAK,OAAQ,EAAS,EAAK,OAAQ,EAAK,QAGrE,iBAAiB,EAAgB,GAC3B,IAAA,EAAO,KAAK,qBAAqB,EAAQ,GACzC,EAAO,GACX,GAAU,EAAK,OACV,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,GAAQ,OAAO,aAAa,KAAK,KAAK,SAAS,MAE1C,OAAA,EAGT,iBAAiB,EAAgB,GAC3B,IAAA,EAAO,KAAK,qBAAqB,EAAQ,GACzC,EAAO,GACX,GAAU,EAAK,OACV,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,GAAQ,OAAO,aAAa,KAAK,KAAK,UAAU,GAAQ,IACxD,GAAU,EAEL,OAAA,EAGT,SAAS,EAAgB,GAChB,OAAA,IAAI,EAAI,KAAK,aAAa,EAAQ,IAG3C,WAAW,EAAgB,GACrB,IAAA,EAAO,KAAK,qBAAqB,EAAQ,GACzC,EAAe,GACf,EAAO,KAAK,cAChB,GAAU,EAAK,OACV,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,EAAM,KAAK,KAAK,YAAY,KAAK,YAAY,KAAK,aAAa,EAAQ,MACvE,GAAU,EAEL,OAAA,EAGT,gBAAgB,EAAgB,GAC1B,IAAA,EAAO,KAAK,qBAAqB,EAAQ,GACzC,EAAa,OAAO,OAAO,MAC3B,EAAO,KAAK,cACZ,EAAU,EAAS,EAAK,OACxB,EAAY,EAAU,EAAK,OAAS,EACnC,IAAA,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CAChC,IAAA,EAAM,KAAK,YAAY,KAAK,YAAY,KAAK,aAAa,EAAS,KACnE,EAAQ,KAAK,YAAY,KAAK,YAAY,KAAK,aAAa,EAAW,KACvE,GAAe,iBAAR,EAAkB,MAAM,IAAI,MAAM,uCAAyC,GACtF,EAAW,GAAO,EAClB,GAAW,EACX,GAAa,EAER,OAAA,EAGT,YAAY,GACN,IAAA,EAAS,KAAK,KAAK,SAAS,KAC5B,EAAiB,GAAT,EACJ,OAAA,GAAU,GACX,KAAA,EACI,OAAA,KAAK,eAAe,EAAQ,GAChC,KAAA,EACI,OAAA,KAAK,aAAa,EAAQ,GAAK,GACnC,KAAA,EACI,OAAA,KAAK,WAAW,EAAQ,GAAK,GACjC,KAAA,EACI,OAAA,KAAK,UAAU,EAAQ,GAAK,GAChC,KAAA,EACI,OAAA,KAAK,UAAU,EAAQ,GAC3B,KAAA,EACI,OAAA,KAAK,iBAAiB,EAAQ,GAClC,KAAA,EACI,OAAA,KAAK,iBAAiB,EAAQ,GAClC,KAAA,EACI,OAAA,KAAK,SAAS,EAAQ,EAAQ,GAClC,KAAA,GACI,OAAA,KAAK,WAAW,EAAQ,GAC5B,KAAA,GACI,OAAA,KAAK,gBAAgB,EAAQ,GAElC,MAAA,IAAI,MAAM,qBAAuB,EAAS,gBAAkB;;ACj8BrE,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,uBAAA,EA9BD,IAAA,EAAA,QAAA,kBAOA,SAAS,EAAoB,GACrB,MAAA,EAAsB,GAQrB,OAPP,EAAS,QAAQ,iBAAkB,CAAC,EAAe,EAAe,KAChE,EAAQ,KAAK,CACX,MAAO,EAAM,MAAM,KAAK,IAAI,IAAS,CAAC,IAAK,EAAM,KAAM,KACvD,SAAU,SAAS,EAAG,MAEjB,IAEF,EAGH,SAAU,EAAuB,GAC/B,MAAA,EAAS,EAAoB,GAC7B,EAAW,EAAO,OAAO,CAAC,EAAc,IAAkB,EAAO,EAAI,SAAU,GAC/E,EAAU,IAAI,EAAJ,wBAA4B,GACxC,GAAkB,IAAlB,EAAO,OACF,OAAA,KAEJ,IAAA,IAAI,KAAU,EACjB,EAAQ,uBAAuB,EAAO,MAAO,EAAO,UAE/C,OAAA,EAAQ;;AC6MhB,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,kBAAA,EA5OD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAsJM,SAAU,EAAkB,GAC1B,MAAA,EAAa,EAAe,QAE5B,EAC0B,IAA9B,EAAW,QAAQ,OACf,EAAW,QAAQ,GACnB,EAAW,QAAQ,OAAO,GAAgB,cAAX,EAAE,MAAsB,GAEvD,EAAsB,IAAI,IAEvB,SAAA,EAAa,GAChB,IAAA,EAA8B,EAAO,GACnC,MAAA,EAAgB,GAEf,KAAgB,MAAhB,GAAsB,CACrB,MAAA,EAA0C,EAAO,WAAW,KAAK,IAChE,EAAa,GAAW,EAC/B,EAAI,KAAK,GACT,EAAe,EAGV,OADP,EAAI,UACG,EACJ,IAAI,IACG,MAAA,EAAY,EAAO,WAAW,KAAK,GACnC,EAAW,EAAO,YAAY,EAAU,IAExC,EAAQ,0CAA0C,KAAK,GAEzD,OAAC,EAGH,EAAM,GAAG,WAAW,cACP,gBAAb,EAAM,IACN,EAAM,GAAG,WAAW,gBAGb,MAGF,EAAY,EAAA,aAAA,EAAqB,EAAU,KAAO,CACvD,IAAK,EACL,KAAM,EAAM,GACZ,KAAM,EAAM,GAIZ,KAAM,EAAM,GAAK,SAAS,EAAM,SAAM,EACtC,IAAK,EAAM,GAAK,SAAS,EAAM,IAAM,OAAI,KAnBxB,OAsBpB,OAAO,GAAU,MAAL,GAGX,MAAA,EAAU,IAAI,EAAJ,uBAA2B,EAAe,UAEtD,IAAA,EAAyB,GACxB,IAAA,IAAI,KAAU,EAAO,QAAQ,KAAM,CAChC,MAAA,EAAQ,EAAa,GACrB,EAAQ,EAAO,GAGjB,IAAA,GAAY,EAEX,IAAA,IAAI,EAAI,EAAG,EAAI,KAAK,IAAI,EAAM,OAAQ,EAAU,SAC/C,EAAU,KAAO,EAAM,GADiC,IAI5D,EAAW,EAIR,IAAA,IAAI,EAAI,EAAU,OAAS,EAAG,EAAI,EAAU,IAC/C,EAAQ,WAAW,EAAU,GAAI,GAG9B,IAAA,IAAI,EAAI,EAAW,EAAG,EAAI,EAAM,OAAQ,IAC3C,EAAQ,WAAW,EAAM,GAAI,GAG/B,EAAY,EAIP,OADP,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBACrC,EAAQ;;AChDhB,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,oBAAA,EA3LD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAyDA,SAAS,EAAgB,EAAY,GAC/B,IAAC,IAAS,EAAK,KACV,MAAA,CACL,IAAK,iBACL,KAAM,kBAIN,IAAA,EAAO,EAAK,KACR,OAAA,EAAK,MACN,IAAA,MAAO,CACJ,MAAA,EAAU,EAAK,MAAM,iBACvB,IAAS,WAAgB,EAAQ,MACrC,MAGG,IAAA,aACH,EAAO,SAAW,EAClB,MAEG,IAAA,KAAM,CACH,MAAA,EAAU,EAAK,MAAM,2DACvB,GAAA,EACK,MAAA,CACL,IAAK,EACL,KAAM,EAAQ,GAAG,OAAS,EAAI,EAAQ,GAAK,cAC3C,KAAM,EAAQ,GAAG,OAAS,EAAI,EAAQ,GAAK,iBAC3C,KAAM,SAAS,EAAQ,GAAI,IAC3B,IAAK,SAAS,EAAQ,GAAI,KAG9B,MAGG,IAAA,OACK,OAAA,EAAK,MACN,IAAA,SACA,IAAA,UACA,IAAA,eACA,IAAA,cACA,IAAA,eACA,IAAA,UACH,EAAO,QAAU,EACjB,MAEG,IAAA,kBACH,EAAO,eAAiB,EACxB,MACG,IAAA,OACH,EAAO,UAAY,EACnB,MACG,IAAA,UACH,EAAO,aAAe,EACtB,MACG,IAAA,SACH,EAAO,YAAc,EAGzB,MAGF,QACE,MAAW,EAAK,SAAS,IAKtB,MAAA,CAAC,IAAK,EAAM,KAAA,GAGf,SAAU,EAAoB,GAC5B,MAAA,EAAU,IAAI,EAAJ,wBAEV,EAAe,IAAI,IAQrB,IAAA,EAAS,GAEN,EAAA,EAAA,QAAA,EAAM,MAAO,GAAQ,EAAK,IAE5B,IAAA,IAAI,KAAQ,EAAM,MAAO,CACtB,MAAA,EAAqB,GAgBtB,IAAA,IAAI,EAAI,EAAK,EAAE,OAAS,EAAG,GAAK,EAAG,GAAK,EAAG,CACxC,MAAA,EAAK,EAAK,EAAE,IAEN,IAAR,IACA,EAAK,EAAM,KAAK,OAElB,EAAM,KAAK,CACT,IAAK,EACL,UAAW,EAAG,SAAS,QAI3B,EAAM,MAxCY,EAwCM,GAvCnB,EAAY,EAAA,aAAA,EAAc,EAAG,GAE3B,EADM,EAAM,KAAK,GACK,OAuC/B,EAAQ,uBAAuB,EAAO,EAAK,GAAK,GAChD,EAAS,EAAK,GA3CP,IAAa,EAqDf,OAFP,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBAErC,EAAQ;;ACzDhB,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,oBAAA,EAjID,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAsBA,SAAS,EAAW,GACZ,MAAA,EAAQ,EAAS,MAAM,MAAM,OAAO,IAAM,QAAQ,KAAK,IAEvD,EAAmB,CACvB,QAAS,KACT,UAAW,KACX,SAAU,KACV,KAAM,KACN,UAAW,GACX,MAAO,IAGH,EAAY,EAAM,QACpB,IAAC,EAAW,OAAO,KAKjB,MAAA,EAAkB,mCAAmC,KAAK,GAC5D,IAAC,EAAiB,OAAO,KAE7B,EAAM,QAAU,EAAgB,GAG5B,EAAgB,IAClB,EAAM,UAAY,SAAS,EAAgB,GAAI,IAC/C,EAAM,SAAW,SAAS,EAAgB,GAAI,KAE9C,EAAM,SAAW,SAAS,EAAgB,GAAI,IAG1C,MAAA,EAAY,oBAAoB,KAAK,GACvC,IACF,EAAM,KAAO,WAAW,EAAU,KAG9B,MAAA,EAAS,aAAa,KAAK,GAC7B,IACF,EAAM,UAAY,EAAO,IAGtB,IAAA,IAAI,KAAQ,EAAO,CAChB,MAAA,EAAY,6BAA6B,KAAK,GAChD,IAAC,EAAW,SACZ,IAAG,CAAA,EAAS,EAAY,GAAQ,EAKpC,EAAa,EAAW,QAAQ,gBAAiB,IAEjD,EAAM,MAAM,KAAK,CAAC,aAAc,IAAW,WAAA,EAAY,KAAA,IAIlD,OAFP,EAAM,MAAM,UAEL,EAGH,SAAU,EAAoB,GAC5B,MAAA,EAAW,IAAI,IAEjB,IAAA,EAA2B,KACzB,MAAA,EAAS,EAAS,MAAM,QAAQ,IAAI,GAErC,IAAA,IAAI,KAAS,EAAQ,CACpB,GAAS,MAAT,EAAe,SACf,GAAa,MAAb,GAAqB,GAAa,EAAM,UAAW,SACnD,GAAc,MAAd,EAAM,KAAc,SACxB,EAAY,EAAM,UAEd,IAAA,EAAmB,GACnB,EAAM,SAAS,EAAiB,KAAK,EAAM,SAC3C,EAAM,WAAW,EAAiB,aAAa,EAAM,aACrD,EAAM,UAAU,EAAiB,aAAa,EAAM,YAClD,MAAA,EAAc,EAAiB,KAAK,MACrB,EAAY,EAAA,aAAA,EAAU,EAAa,KAChD,MAAA,EAAU,IAAI,EAAJ,wBAGT,OAFP,EAAQ,QAAQ,GAChB,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,YACrC,IAKD,0BACN,EAAM,MAAM,IAAI,EAAE,WAAA,EAAY,KAAA,MACrB,CACL,OAAQ,MAAe,KACvB,KAAqB,cAAf,UAAqC,KAAU,EACrD,KAAM,KAGV,EAAM,MAIN,OAAkB,IAAlB,EAAS,KACJ,KAGF,CACL,KAAwB,IAAlB,EAAS,KAAa,MAAM,KAAK,EAAS,QAAQ,GAAK,GAC7D,YAAa,EACb,SAAU,MAAM,MAAK,EAAM,EAAA,OAAA,EAAS,SAAU,GAAW,EAAQ;;AC9BpE,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,kBAAA,EAjGD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,2BAoCA,SAAS,EACP,EACA,EACA,EACA,EACA,GAGI,GAAe,IAAf,EAAK,OAAgC,IAAjB,EAAK,SAAgC,IAAf,EAAK,OAAwC,IAAzB,EAAK,SAAS,OAC9E,OAAO,EAEL,IAAA,EAAS,EACT,EAAY,EAAM,IAAI,EAAK,IAE/B,EAAQ,WAAW,EAAW,GAEzB,IAAA,IAAI,KAAS,EAAK,SACrB,EAAS,EAAa,EAAO,EAAQ,EAAS,EAAO,GAOhD,OAJP,GAAU,EAAU,GAEpB,EAAQ,WAAW,EAAW,GAEvB,EAGH,SAAU,EAAkB,GAC1B,MAAA,EAAgB,IAAI,IACrB,IAAA,IAAI,KAAU,EAAe,aAAc,CACxC,MAAA,EAAuB,CAC3B,IAAK,EAAO,GACZ,QAAS,EAAO,UAAU,EAAO,SAI9B,EAAO,QAAQ,WAAW,OAG7B,EAAU,KAAO,EAAO,SAG1B,EAAc,IAAI,EAAO,GAAI,GAGzB,MAAA,EAAc,IAAI,EAAJ,uBAA2B,EAAe,aAC9D,EAAa,EAAe,QAAS,EAAG,EAAa,EAAe,GAAQ,EAAK,OACjF,EAAY,kBAAkB,IAAI,EAAJ,cAAkB,iBAChD,EAAY,WAAW,EAAe,gBAEhC,MAAA,EAAe,IAAI,EAAJ,uBAA2B,EAAe,aAKxD,OAJP,EAAa,EAAe,QAAS,EAAG,EAAc,EAAe,GAAQ,EAAK,OAClF,EAAa,kBAAkB,IAAI,EAAJ,eAC/B,EAAa,WAAW,EAAe,sBAEhC,CACL,KAAM,EAAe,QACrB,YAAa,EACb,SAAU,CAAC,EAAY,QAAS,EAAa;;ACwBhD,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,iBAAA,EAvHD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,2BAkEA,SAAS,EAAU,GACV,OAAA,EACJ,IAAI,EAAE,KAAA,EAAM,IAAA,EAAK,KAAA,EAAM,OAAA,MAAa,CACnC,OAAQ,KAAQ,KAAO,KAAQ,IAC/B,KAAM,EACN,KAAA,EACA,IAAK,EACL,KAAM,GAAQ,iBAEf,UAGC,SAAU,EAAiB,GACN,IAArB,EAAS,SACX,QAAQ,uCAAuC,EAAS,qCAGpD,MAAA,UAAC,GAAa,GACd,kBAAC,EAAD,gBAAoB,GAAmB,EAEvC,EAAQ,EAAkB,OAC5B,GAAA,EAAQ,EAEH,OADP,QAAQ,KAAK,iBACN,KAGH,MAAA,EACJ,EAAkB,EAAQ,GAAG,UAAY,EAAkB,GAAG,UAAY,EAAgB,GACtF,EAAU,IAAI,EAAJ,wBAA4B,GAExC,IAAA,EAAkB,OAAO,UAqBtB,OAnBP,EAAkB,QAAQ,CAAC,EAAQ,KAC3B,MAAA,EAAU,EAAO,UACjB,EAAW,EAAgB,GAE3B,EADY,EAAU,EACW,EAInC,EAAqB,MACvB,EAAQ,uBAAuB,GAAI,GAGrC,EAAQ,uBAAuB,EAAU,EAAO,aAAc,GAE9D,EAAkB,IAGpB,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,YAC5C,EAAQ,QAAQ,EAAU,aACnB,EAAQ;;ACtHjB,aAoBA,SAAA,EAAA,EAAA,GAKA,IAJA,IAAA,EAAA,IAAA,MAAA,UAAA,OAAA,GACA,EAAA,EACA,EAAA,EACA,GAAA,EACA,EAAA,UAAA,QACA,EAAA,KAAA,UAAA,KACA,OAAA,IAAA,QAAA,SAAA,EAAA,GACA,EAAA,GAAA,SAAA,GACA,GAAA,EAEA,GADA,GAAA,EACA,EACA,EAAA,OACA,CAGA,IAFA,IAAA,EAAA,IAAA,MAAA,UAAA,OAAA,GACA,EAAA,EACA,EAAA,EAAA,QACA,EAAA,KAAA,UAAA,GACA,EAAA,MAAA,KAAA,KAIA,IACA,EAAA,MAAA,GAAA,KAAA,GACA,MAAA,GACA,IACA,GAAA,EACA,EAAA,OA9CA,OAAA,QAAA;;ACDA,aAOA,IAAA,EAAA,QAOA,EAAA,OAAA,SAAA,GACA,IAAA,EAAA,EAAA,OACA,IAAA,EACA,OAAA,EAEA,IADA,IAAA,EAAA,IACA,EAAA,EAAA,GAAA,MAAA,EAAA,OAAA,MACA,EACA,OAAA,KAAA,KAAA,EAAA,EAAA,QAAA,EAAA,GAUA,IANA,IAAA,EAAA,IAAA,MAAA,IAGA,EAAA,IAAA,MAAA,KAGA,EAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,IAAA,IASA,EAAA,OAAA,SAAA,EAAA,EAAA,GAMA,IALA,IAIA,EAJA,EAAA,KACA,EAAA,GACA,EAAA,EACA,EAAA,EAEA,EAAA,GAAA,CACA,IAAA,EAAA,EAAA,KACA,OAAA,GACA,KAAA,EACA,EAAA,KAAA,EAAA,GAAA,GACA,GAAA,EAAA,IAAA,EACA,EAAA,EACA,MACA,KAAA,EACA,EAAA,KAAA,EAAA,EAAA,GAAA,GACA,GAAA,GAAA,IAAA,EACA,EAAA,EACA,MACA,KAAA,EACA,EAAA,KAAA,EAAA,EAAA,GAAA,GACA,EAAA,KAAA,EAAA,GAAA,GACA,EAAA,EAGA,EAAA,QACA,IAAA,EAAA,KAAA,KAAA,OAAA,aAAA,MAAA,OAAA,IACA,EAAA,GASA,OANA,IACA,EAAA,KAAA,EAAA,GACA,EAAA,KAAA,GACA,IAAA,IACA,EAAA,KAAA,KAEA,GACA,GACA,EAAA,KAAA,OAAA,aAAA,MAAA,OAAA,EAAA,MAAA,EAAA,KACA,EAAA,KAAA,KAEA,OAAA,aAAA,MAAA,OAAA,EAAA,MAAA,EAAA,KAGA,IAAA,EAAA,mBAUA,EAAA,OAAA,SAAA,EAAA,EAAA,GAIA,IAHA,IAEA,EAFA,EAAA,EACA,EAAA,EAEA,EAAA,EAAA,EAAA,EAAA,QAAA,CACA,IAAA,EAAA,EAAA,WAAA,KACA,GAAA,KAAA,GAAA,EAAA,EACA,MACA,QAAA,KAAA,EAAA,EAAA,IACA,MAAA,MAAA,GACA,OAAA,GACA,KAAA,EACA,EAAA,EACA,EAAA,EACA,MACA,KAAA,EACA,EAAA,KAAA,GAAA,GAAA,GAAA,IAAA,EACA,EAAA,EACA,EAAA,EACA,MACA,KAAA,EACA,EAAA,MAAA,GAAA,IAAA,GAAA,GAAA,IAAA,EACA,EAAA,EACA,EAAA,EACA,MACA,KAAA,EACA,EAAA,MAAA,EAAA,IAAA,EAAA,EACA,EAAA,GAIA,GAAA,IAAA,EACA,MAAA,MAAA,GACA,OAAA,EAAA,GAQA,EAAA,KAAA,SAAA,GACA,MAAA,mEAAA,KAAA;;ACzIA,aASA,SAAA,IAOA,KAAA,WAAA,GAfA,OAAA,QAAA,EAyBA,EAAA,UAAA,GAAA,SAAA,EAAA,EAAA,GAKA,OAJA,KAAA,WAAA,KAAA,KAAA,WAAA,GAAA,KAAA,KAAA,CACA,GAAA,EACA,IAAA,GAAA,OAEA,MASA,EAAA,UAAA,IAAA,SAAA,EAAA,GACA,QAAA,IAAA,EACA,KAAA,WAAA,QAEA,QAAA,IAAA,EACA,KAAA,WAAA,GAAA,QAGA,IADA,IAAA,EAAA,KAAA,WAAA,GACA,EAAA,EAAA,EAAA,EAAA,QACA,EAAA,GAAA,KAAA,EACA,EAAA,OAAA,EAAA,KAEA,EAGA,OAAA,MASA,EAAA,UAAA,KAAA,SAAA,GACA,IAAA,EAAA,KAAA,WAAA,GACA,GAAA,EAAA,CAGA,IAFA,IAAA,EAAA,GACA,EAAA,EACA,EAAA,UAAA,QACA,EAAA,KAAA,UAAA,MACA,IAAA,EAAA,EAAA,EAAA,EAAA,QACA,EAAA,GAAA,GAAA,MAAA,EAAA,KAAA,IAAA,GAEA,OAAA;;AC1EA,aAuFA,SAAA,EAAA,GAwNA,MArNA,oBAAA,aAAA,WAEA,IAAA,EAAA,IAAA,aAAA,EAAA,IACA,EAAA,IAAA,WAAA,EAAA,QACA,EAAA,MAAA,EAAA,GAEA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EACA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GAGA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EACA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GAQA,SAAA,EAAA,EAAA,GAKA,OAJA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAGA,SAAA,EAAA,EAAA,GAKA,OAJA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAjBA,EAAA,aAAA,EAAA,EAAA,EAEA,EAAA,aAAA,EAAA,EAAA,EAmBA,EAAA,YAAA,EAAA,EAAA,EAEA,EAAA,YAAA,EAAA,EAAA,EA9CA,GAiDA,WAEA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,EAAA,EAAA,EAGA,GAFA,IACA,GAAA,GACA,IAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,WAAA,EAAA,QACA,GAAA,MAAA,GACA,EAAA,WAAA,EAAA,QACA,GAAA,EAAA,sBACA,GAAA,GAAA,GAAA,cAAA,EAAA,EAAA,QACA,GAAA,EAAA,uBACA,GAAA,GAAA,GAAA,KAAA,MAAA,EAAA,0BAAA,EAAA,EAAA,OACA,CACA,IAAA,EAAA,KAAA,MAAA,KAAA,IAAA,GAAA,KAAA,KAEA,GAAA,GAAA,GAAA,EAAA,KAAA,GADA,QAAA,KAAA,MAAA,EAAA,KAAA,IAAA,GAAA,GAAA,YACA,EAAA,EAAA,IAOA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,GAAA,IAAA,EACA,EAAA,IAAA,GAAA,IACA,EAAA,QAAA,EACA,OAAA,MAAA,EACA,EACA,IACA,GAAA,EAAA,GACA,IAAA,EACA,sBAAA,EAAA,EACA,EAAA,KAAA,IAAA,EAAA,EAAA,MAAA,EAAA,SAdA,EAAA,aAAA,EAAA,KAAA,KAAA,GACA,EAAA,aAAA,EAAA,KAAA,KAAA,GAgBA,EAAA,YAAA,EAAA,KAAA,KAAA,GACA,EAAA,YAAA,EAAA,KAAA,KAAA,GAvCA,GA4CA,oBAAA,aAAA,WAEA,IAAA,EAAA,IAAA,aAAA,EAAA,IACA,EAAA,IAAA,WAAA,EAAA,QACA,EAAA,MAAA,EAAA,GAEA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EACA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GAGA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EACA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GAQA,SAAA,EAAA,EAAA,GASA,OARA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAGA,SAAA,EAAA,EAAA,GASA,OARA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAzBA,EAAA,cAAA,EAAA,EAAA,EAEA,EAAA,cAAA,EAAA,EAAA,EA2BA,EAAA,aAAA,EAAA,EAAA,EAEA,EAAA,aAAA,EAAA,EAAA,EA9DA,GAiEA,WAEA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,EAAA,EAAA,EAGA,GAFA,IACA,GAAA,GACA,IAAA,EACA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,EAAA,WAAA,EAAA,EAAA,QACA,GAAA,MAAA,GACA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,WAAA,EAAA,EAAA,QACA,GAAA,EAAA,uBACA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,GAAA,GAAA,cAAA,EAAA,EAAA,EAAA,OACA,CACA,IAAA,EACA,GAAA,EAAA,wBAEA,GADA,EAAA,EAAA,UACA,EAAA,EAAA,EAAA,GACA,GAAA,GAAA,GAAA,EAAA,cAAA,EAAA,EAAA,EAAA,OACA,CACA,IAAA,EAAA,KAAA,MAAA,KAAA,IAAA,GAAA,KAAA,KACA,OAAA,IACA,EAAA,MAEA,EAAA,kBADA,EAAA,EAAA,KAAA,IAAA,GAAA,MACA,EAAA,EAAA,EAAA,GACA,GAAA,GAAA,GAAA,EAAA,MAAA,GAAA,QAAA,EAAA,WAAA,EAAA,EAAA,EAAA,KAQA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,GAAA,IAAA,EACA,EAAA,IAAA,GAAA,KACA,EAAA,YAAA,QAAA,GAAA,EACA,OAAA,OAAA,EACA,EACA,IACA,GAAA,EAAA,GACA,IAAA,EACA,OAAA,EAAA,EACA,EAAA,KAAA,IAAA,EAAA,EAAA,OAAA,EAAA,kBAfA,EAAA,cAAA,EAAA,KAAA,KAAA,EAAA,EAAA,GACA,EAAA,cAAA,EAAA,KAAA,KAAA,EAAA,EAAA,GAiBA,EAAA,aAAA,EAAA,KAAA,KAAA,EAAA,EAAA,GACA,EAAA,aAAA,EAAA,KAAA,KAAA,EAAA,EAAA,GAnDA,GAuDA,EAKA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,IAAA,EACA,EAAA,EAAA,GAAA,IAAA,EAAA,IACA,EAAA,EAAA,GAAA,IAAA,GAAA,IACA,EAAA,EAAA,GAAA,IAAA,GAGA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,IAAA,GACA,EAAA,EAAA,GAAA,IAAA,GAAA,IACA,EAAA,EAAA,GAAA,IAAA,EAAA,IACA,EAAA,EAAA,GAAA,IAAA,EAGA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,GACA,EAAA,EAAA,IAAA,EACA,EAAA,EAAA,IAAA,GACA,EAAA,EAAA,IAAA,MAAA,EAGA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,IAAA,GACA,EAAA,EAAA,IAAA,GACA,EAAA,EAAA,IAAA,EACA,EAAA,EAAA,MAAA,EA3UA,OAAA,QAAA,EAAA;;ACFA,aASA,SAAA,QAAA,YACA,IACA,IAAA,IAAA,KAAA,QAAA,QAAA,IAAA,MAAA,CAAA,YACA,GAAA,MAAA,IAAA,QAAA,OAAA,KAAA,KAAA,QACA,OAAA,IACA,MAAA,IACA,OAAA,KAdA,OAAA,QAAA;;ACDA,aAOA,IAAA,EAAA,QAOA,EAAA,OAAA,SAAA,GAGA,IAFA,IAAA,EAAA,EACA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,SAAA,GACA,EAAA,EAAA,WAAA,IACA,IACA,GAAA,EACA,EAAA,KACA,GAAA,EACA,QAAA,MAAA,IAAA,QAAA,MAAA,EAAA,WAAA,EAAA,OACA,EACA,GAAA,GAEA,GAAA,EAEA,OAAA,GAUA,EAAA,KAAA,SAAA,EAAA,EAAA,GAEA,GADA,EAAA,EACA,EACA,MAAA,GAKA,IAJA,IAGA,EAHA,EAAA,KACA,EAAA,GACA,EAAA,EAEA,EAAA,IACA,EAAA,EAAA,MACA,IACA,EAAA,KAAA,EACA,EAAA,KAAA,EAAA,IACA,EAAA,MAAA,GAAA,IAAA,EAAA,GAAA,EAAA,KACA,EAAA,KAAA,EAAA,KACA,IAAA,EAAA,IAAA,IAAA,GAAA,EAAA,OAAA,IAAA,GAAA,EAAA,OAAA,EAAA,GAAA,EAAA,MAAA,MACA,EAAA,KAAA,OAAA,GAAA,IACA,EAAA,KAAA,OAAA,KAAA,IAEA,EAAA,MAAA,GAAA,IAAA,IAAA,GAAA,EAAA,OAAA,EAAA,GAAA,EAAA,KACA,EAAA,QACA,IAAA,EAAA,KAAA,KAAA,OAAA,aAAA,MAAA,OAAA,IACA,EAAA,GAGA,OAAA,GACA,GACA,EAAA,KAAA,OAAA,aAAA,MAAA,OAAA,EAAA,MAAA,EAAA,KACA,EAAA,KAAA,KAEA,OAAA,aAAA,MAAA,OAAA,EAAA,MAAA,EAAA,KAUA,EAAA,MAAA,SAAA,EAAA,EAAA,GAIA,IAHA,IACA,EACA,EAFA,EAAA,EAGA,EAAA,EAAA,EAAA,EAAA,SAAA,GACA,EAAA,EAAA,WAAA,IACA,IACA,EAAA,KAAA,EACA,EAAA,MACA,EAAA,KAAA,GAAA,EAAA,IACA,EAAA,KAAA,GAAA,EAAA,KACA,QAAA,MAAA,IAAA,QAAA,OAAA,EAAA,EAAA,WAAA,EAAA,MACA,EAAA,QAAA,KAAA,IAAA,KAAA,KAAA,KACA,EACA,EAAA,KAAA,GAAA,GAAA,IACA,EAAA,KAAA,GAAA,GAAA,GAAA,IACA,EAAA,KAAA,GAAA,EAAA,GAAA,IACA,EAAA,KAAA,GAAA,EAAA,MAEA,EAAA,KAAA,GAAA,GAAA,IACA,EAAA,KAAA,GAAA,EAAA,GAAA,IACA,EAAA,KAAA,GAAA,EAAA,KAGA,OAAA,EAAA;;ACvGA,aA8BA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,GAAA,KACA,EAAA,IAAA,EACA,EAAA,KACA,EAAA,EACA,OAAA,SAAA,GACA,GAAA,EAAA,GAAA,EAAA,EACA,OAAA,EAAA,GACA,EAAA,EAAA,IACA,EAAA,EAAA,GACA,EAAA,GAEA,IAAA,EAAA,EAAA,KAAA,EAAA,EAAA,GAAA,GAGA,OAFA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,GA5CA,OAAA,QAAA;;ACDA,aACA,OAAA,QAAA,EAEA,IAAA,EAAA,QAAA,mBAUA,SAAA,EAAA,EAAA,GASA,KAAA,GAAA,IAAA,EAMA,KAAA,GAAA,IAAA,EAQA,IAAA,EAAA,EAAA,KAAA,IAAA,EAAA,EAAA,GAEA,EAAA,SAAA,WAAA,OAAA,GACA,EAAA,SAAA,EAAA,SAAA,WAAA,OAAA,MACA,EAAA,OAAA,WAAA,OAAA,GAOA,IAAA,EAAA,EAAA,SAAA,mBAOA,EAAA,WAAA,SAAA,GACA,GAAA,IAAA,EACA,OAAA,EACA,IAAA,EAAA,EAAA,EACA,IACA,GAAA,GACA,IAAA,EAAA,IAAA,EACA,GAAA,EAAA,GAAA,aAAA,EAUA,OATA,IACA,GAAA,IAAA,EACA,GAAA,IAAA,IACA,EAAA,aACA,EAAA,IACA,EAAA,aACA,EAAA,KAGA,IAAA,EAAA,EAAA,IAQA,EAAA,KAAA,SAAA,GACA,GAAA,iBAAA,EACA,OAAA,EAAA,WAAA,GACA,GAAA,EAAA,SAAA,GAAA,CAEA,IAAA,EAAA,KAGA,OAAA,EAAA,WAAA,SAAA,EAAA,KAFA,EAAA,EAAA,KAAA,WAAA,GAIA,OAAA,EAAA,KAAA,EAAA,KAAA,IAAA,EAAA,EAAA,MAAA,EAAA,EAAA,OAAA,GAAA,GAQA,EAAA,UAAA,SAAA,SAAA,GACA,IAAA,GAAA,KAAA,KAAA,GAAA,CACA,IAAA,EAAA,GAAA,KAAA,KAAA,EACA,GAAA,KAAA,KAAA,EAGA,OAFA,IACA,EAAA,EAAA,IAAA,KACA,EAAA,WAAA,GAEA,OAAA,KAAA,GAAA,WAAA,KAAA,IAQA,EAAA,UAAA,OAAA,SAAA,GACA,OAAA,EAAA,KACA,IAAA,EAAA,KAAA,EAAA,KAAA,GAAA,EAAA,KAAA,GAAA,QAAA,IAEA,CAAA,IAAA,EAAA,KAAA,GAAA,KAAA,EAAA,KAAA,GAAA,SAAA,QAAA,KAGA,IAAA,EAAA,OAAA,UAAA,WAOA,EAAA,SAAA,SAAA,GACA,OAAA,IAAA,EACA,EACA,IAAA,GACA,EAAA,KAAA,EAAA,GACA,EAAA,KAAA,EAAA,IAAA,EACA,EAAA,KAAA,EAAA,IAAA,GACA,EAAA,KAAA,EAAA,IAAA,MAAA,GAEA,EAAA,KAAA,EAAA,GACA,EAAA,KAAA,EAAA,IAAA,EACA,EAAA,KAAA,EAAA,IAAA,GACA,EAAA,KAAA,EAAA,IAAA,MAAA,IAQA,EAAA,UAAA,OAAA,WACA,OAAA,OAAA,aACA,IAAA,KAAA,GACA,KAAA,KAAA,EAAA,IACA,KAAA,KAAA,GAAA,IACA,KAAA,KAAA,GACA,IAAA,KAAA,GACA,KAAA,KAAA,EAAA,IACA,KAAA,KAAA,GAAA,IACA,KAAA,KAAA,KAQA,EAAA,UAAA,SAAA,WACA,IAAA,EAAA,KAAA,IAAA,GAGA,OAFA,KAAA,KAAA,KAAA,IAAA,EAAA,KAAA,KAAA,IAAA,KAAA,EACA,KAAA,IAAA,KAAA,IAAA,EAAA,KAAA,EACA,MAOA,EAAA,UAAA,SAAA,WACA,IAAA,IAAA,EAAA,KAAA,IAGA,OAFA,KAAA,KAAA,KAAA,KAAA,EAAA,KAAA,IAAA,IAAA,KAAA,EACA,KAAA,IAAA,KAAA,KAAA,EAAA,KAAA,EACA,MAOA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,GACA,GAAA,KAAA,KAAA,GAAA,KAAA,IAAA,KAAA,EACA,EAAA,KAAA,KAAA,GACA,OAAA,IAAA,EACA,IAAA,EACA,EAAA,MACA,EAAA,IAAA,EAAA,EACA,EAAA,QAAA,EAAA,EACA,EAAA,MACA,EAAA,IAAA,EAAA,EACA,EAAA,QAAA,EAAA,EACA,EAAA,IAAA,EAAA;;ACtMA,aAEA,QAAA,WAAA,EACA,QAAA,YAAA,EACA,QAAA,cAAA,EAOA,IALA,IAAA,EAAA,GACA,EAAA,GACA,EAAA,oBAAA,WAAA,WAAA,MAEA,EAAA,mEACA,EAAA,EAAA,EAAA,EAAA,OAAA,EAAA,IAAA,EACA,EAAA,GAAA,EAAA,GACA,EAAA,EAAA,WAAA,IAAA,EAQA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,OAEA,GAAA,EAAA,EAAA,EACA,MAAA,IAAA,MAAA,kDAKA,IAAA,EAAA,EAAA,QAAA,KAOA,OANA,IAAA,IAAA,EAAA,GAMA,CAAA,EAJA,IAAA,EACA,EACA,EAAA,EAAA,GAMA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,GACA,EAAA,EAAA,GACA,EAAA,EAAA,GACA,OAAA,GAAA,EAAA,GAAA,EAAA,EAGA,SAAA,EAAA,EAAA,EAAA,GACA,OAAA,GAAA,EAAA,GAAA,EAAA,EAGA,SAAA,EAAA,GACA,IAAA,EAcA,EAbA,EAAA,EAAA,GACA,EAAA,EAAA,GACA,EAAA,EAAA,GAEA,EAAA,IAAA,EAAA,EAAA,EAAA,EAAA,IAEA,EAAA,EAGA,EAAA,EAAA,EACA,EAAA,EACA,EAGA,IAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,EACA,EAAA,EAAA,WAAA,KAAA,GACA,EAAA,EAAA,WAAA,EAAA,KAAA,GACA,EAAA,EAAA,WAAA,EAAA,KAAA,EACA,EAAA,EAAA,WAAA,EAAA,IACA,EAAA,KAAA,GAAA,GAAA,IACA,EAAA,KAAA,GAAA,EAAA,IACA,EAAA,KAAA,IAAA,EAmBA,OAhBA,IAAA,IACA,EACA,EAAA,EAAA,WAAA,KAAA,EACA,EAAA,EAAA,WAAA,EAAA,KAAA,EACA,EAAA,KAAA,IAAA,GAGA,IAAA,IACA,EACA,EAAA,EAAA,WAAA,KAAA,GACA,EAAA,EAAA,WAAA,EAAA,KAAA,EACA,EAAA,EAAA,WAAA,EAAA,KAAA,EACA,EAAA,KAAA,GAAA,EAAA,IACA,EAAA,KAAA,IAAA,GAGA,EAGA,SAAA,EAAA,GACA,OAAA,EAAA,GAAA,GAAA,IACA,EAAA,GAAA,GAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,GAGA,SAAA,EAAA,EAAA,EAAA,GAGA,IAFA,IAAA,EACA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,GACA,EAAA,IAAA,GAAA,WACA,EAAA,EAAA,IAAA,EAAA,QACA,IAAA,EAAA,EAAA,IACA,EAAA,KAAA,EAAA,IAEA,OAAA,EAAA,KAAA,IAGA,SAAA,EAAA,GAQA,IAPA,IAAA,EACA,EAAA,EAAA,OACA,EAAA,EAAA,EACA,EAAA,GAIA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAHA,MAIA,EAAA,KAAA,EACA,EAAA,EAAA,EALA,MAKA,EAAA,EAAA,EALA,QA2BA,OAjBA,IAAA,GACA,EAAA,EAAA,EAAA,GACA,EAAA,KACA,EAAA,GAAA,GACA,EAAA,GAAA,EAAA,IACA,OAEA,IAAA,IACA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GACA,EAAA,KACA,EAAA,GAAA,IACA,EAAA,GAAA,EAAA,IACA,EAAA,GAAA,EAAA,IACA,MAIA,EAAA,KAAA,IApIA,EAAA,IAAA,WAAA,IAAA,GACA,EAAA,IAAA,WAAA,IAAA;;ACnBA,QAAA,KAAA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EACA,GAAA,GAAA,GAAA,EACA,EAAA,GAAA,EACA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,GAAA,EAAA,EACA,EAAA,EAAA,EAAA,GAOA,IALA,GAAA,EAEA,EAAA,GAAA,IAAA,GAAA,EACA,KAAA,EACA,GAAA,EACA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAKA,IAHA,EAAA,GAAA,IAAA,GAAA,EACA,KAAA,EACA,GAAA,EACA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAEA,GAAA,IAAA,EACA,EAAA,EAAA,MACA,CAAA,GAAA,IAAA,EACA,OAAA,EAAA,IAAA,EAAA,GAAA,GAAA,EAAA,GAEA,GAAA,KAAA,IAAA,EAAA,GACA,GAAA,EAEA,OAAA,GAAA,EAAA,GAAA,EAAA,KAAA,IAAA,EAAA,EAAA,IAGA,QAAA,MAAA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EACA,GAAA,GAAA,GAAA,EACA,EAAA,GAAA,EACA,EAAA,KAAA,EAAA,KAAA,IAAA,GAAA,IAAA,KAAA,IAAA,GAAA,IAAA,EACA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,GAAA,EACA,EAAA,EAAA,GAAA,IAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAmCA,IAjCA,EAAA,KAAA,IAAA,GAEA,MAAA,IAAA,IAAA,EAAA,GACA,EAAA,MAAA,GAAA,EAAA,EACA,EAAA,IAEA,EAAA,KAAA,MAAA,KAAA,IAAA,GAAA,KAAA,KACA,GAAA,EAAA,KAAA,IAAA,GAAA,IAAA,IACA,IACA,GAAA,IAGA,GADA,EAAA,GAAA,EACA,EAAA,EAEA,EAAA,KAAA,IAAA,EAAA,EAAA,IAEA,GAAA,IACA,IACA,GAAA,GAGA,EAAA,GAAA,GACA,EAAA,EACA,EAAA,GACA,EAAA,GAAA,GACA,GAAA,EAAA,EAAA,GAAA,KAAA,IAAA,EAAA,GACA,GAAA,IAEA,EAAA,EAAA,KAAA,IAAA,EAAA,EAAA,GAAA,KAAA,IAAA,EAAA,GACA,EAAA,IAIA,GAAA,EAAA,EAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,GAAA,GAIA,IAFA,EAAA,GAAA,EAAA,EACA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,GAAA,GAEA,EAAA,EAAA,EAAA,IAAA,IAAA;;AClFA,IAAA,EAAA,GAAA,SAEA,OAAA,QAAA,MAAA,SAAA,SAAA,GACA,MAAA,kBAAA,EAAA,KAAA;;;;AC0vDA,IAAA,EAAA,UAAA,GAnvDA,EAAA,QAAA,aACA,EAAA,QAAA,WACA,EAAA,QAAA,WAuCA,SAAA,IACA,IACA,IAAA,EAAA,IAAA,WAAA,GAEA,OADA,EAAA,UAAA,CAAA,UAAA,WAAA,UAAA,IAAA,WAAA,OAAA,KACA,KAAA,EAAA,OACA,mBAAA,EAAA,UACA,IAAA,EAAA,SAAA,EAAA,GAAA,WACA,MAAA,GACA,OAAA,GAIA,SAAA,IACA,OAAA,EAAA,oBACA,WACA,WAGA,SAAA,EAAA,EAAA,GACA,GAAA,IAAA,EACA,MAAA,IAAA,WAAA,8BAcA,OAZA,EAAA,qBAEA,EAAA,IAAA,WAAA,IACA,UAAA,EAAA,WAGA,OAAA,IACA,EAAA,IAAA,EAAA,IAEA,EAAA,OAAA,GAGA,EAaA,SAAA,EAAA,EAAA,EAAA,GACA,KAAA,EAAA,qBAAA,gBAAA,GACA,OAAA,IAAA,EAAA,EAAA,EAAA,GAIA,GAAA,iBAAA,EAAA,CACA,GAAA,iBAAA,EACA,MAAA,IAAA,MACA,qEAGA,OAAA,EAAA,KAAA,GAEA,OAAA,EAAA,KAAA,EAAA,EAAA,GAWA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,iBAAA,EACA,MAAA,IAAA,UAAA,yCAGA,MAAA,oBAAA,aAAA,aAAA,YACA,EAAA,EAAA,EAAA,EAAA,GAGA,iBAAA,EACA,EAAA,EAAA,EAAA,GAGA,EAAA,EAAA,GA4BA,SAAA,EAAA,GACA,GAAA,iBAAA,EACA,MAAA,IAAA,UAAA,oCACA,GAAA,EAAA,EACA,MAAA,IAAA,WAAA,wCAIA,SAAA,EAAA,EAAA,EAAA,EAAA,GAEA,OADA,EAAA,GACA,GAAA,EACA,EAAA,EAAA,QAEA,IAAA,EAIA,iBAAA,EACA,EAAA,EAAA,GAAA,KAAA,EAAA,GACA,EAAA,EAAA,GAAA,KAAA,GAEA,EAAA,EAAA,GAWA,SAAA,EAAA,EAAA,GAGA,GAFA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,KACA,EAAA,oBACA,IAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EACA,EAAA,GAAA,EAGA,OAAA,EAgBA,SAAA,EAAA,EAAA,EAAA,GAKA,GAJA,iBAAA,GAAA,KAAA,IACA,EAAA,SAGA,EAAA,WAAA,GACA,MAAA,IAAA,UAAA,8CAGA,IAAA,EAAA,EAAA,EAAA,EAAA,GAGA,GAFA,EAAA,EAAA,EAAA,IAEA,MAAA,EAAA,GASA,OAPA,IAAA,IAIA,EAAA,EAAA,MAAA,EAAA,IAGA,EAGA,SAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,OAAA,EAAA,EAAA,EAAA,EAAA,EAAA,QACA,EAAA,EAAA,EAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,EAAA,GAAA,IAAA,EAAA,GAEA,OAAA,EAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GAGA,GAFA,EAAA,WAEA,EAAA,GAAA,EAAA,WAAA,EACA,MAAA,IAAA,WAAA,6BAGA,GAAA,EAAA,WAAA,GAAA,GAAA,GACA,MAAA,IAAA,WAAA,6BAmBA,OAfA,OADA,IAAA,QAAA,IAAA,EACA,IAAA,WAAA,QACA,IAAA,EACA,IAAA,WAAA,EAAA,GAEA,IAAA,WAAA,EAAA,EAAA,GAGA,EAAA,qBAEA,EAAA,GACA,UAAA,EAAA,UAGA,EAAA,EAAA,EAAA,GAEA,EAGA,SAAA,EAAA,EAAA,GACA,GAAA,EAAA,SAAA,GAAA,CACA,IAAA,EAAA,EAAA,EAAA,EAAA,QAGA,OAAA,KAFA,EAAA,EAAA,EAAA,IAEA,OACA,GAGA,EAAA,KAAA,EAAA,EAAA,EAAA,GACA,GAGA,GAAA,EAAA,CACA,GAAA,oBAAA,aACA,EAAA,kBAAA,aAAA,WAAA,EACA,MAAA,iBAAA,EAAA,QAAA,EAAA,EAAA,QACA,EAAA,EAAA,GAEA,EAAA,EAAA,GAGA,GAAA,WAAA,EAAA,MAAA,EAAA,EAAA,MACA,OAAA,EAAA,EAAA,EAAA,MAIA,MAAA,IAAA,UAAA,sFAGA,SAAA,EAAA,GAGA,GAAA,GAAA,IACA,MAAA,IAAA,WAAA,0DACA,IAAA,SAAA,IAAA,UAEA,OAAA,EAAA,EAGA,SAAA,EAAA,GAIA,OAHA,GAAA,IACA,EAAA,GAEA,EAAA,OAAA,GA+EA,SAAA,EAAA,EAAA,GACA,GAAA,EAAA,SAAA,GACA,OAAA,EAAA,OAEA,GAAA,oBAAA,aAAA,mBAAA,YAAA,SACA,YAAA,OAAA,IAAA,aAAA,aACA,OAAA,EAAA,WAEA,iBAAA,IACA,EAAA,GAAA,GAGA,IAAA,EAAA,EAAA,OACA,GAAA,IAAA,EAAA,OAAA,EAIA,IADA,IAAA,GAAA,IAEA,OAAA,GACA,IAAA,QACA,IAAA,SACA,IAAA,SACA,OAAA,EACA,IAAA,OACA,IAAA,QACA,UAAA,EACA,OAAA,EAAA,GAAA,OACA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EAAA,EACA,IAAA,MACA,OAAA,IAAA,EACA,IAAA,SACA,OAAA,EAAA,GAAA,OACA,QACA,GAAA,EAAA,OAAA,EAAA,GAAA,OACA,GAAA,GAAA,GAAA,cACA,GAAA,GAMA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,GAAA,EAcA,SALA,IAAA,GAAA,EAAA,KACA,EAAA,GAIA,EAAA,KAAA,OACA,MAAA,GAOA,SAJA,IAAA,GAAA,EAAA,KAAA,UACA,EAAA,KAAA,QAGA,GAAA,EACA,MAAA,GAOA,IAHA,KAAA,KACA,KAAA,GAGA,MAAA,GAKA,IAFA,IAAA,EAAA,UAGA,OAAA,GACA,IAAA,MACA,OAAA,EAAA,KAAA,EAAA,GAEA,IAAA,OACA,IAAA,QACA,OAAA,EAAA,KAAA,EAAA,GAEA,IAAA,QACA,OAAA,EAAA,KAAA,EAAA,GAEA,IAAA,SACA,IAAA,SACA,OAAA,EAAA,KAAA,EAAA,GAEA,IAAA,SACA,OAAA,EAAA,KAAA,EAAA,GAEA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EAAA,KAAA,EAAA,GAEA,QACA,GAAA,EAAA,MAAA,IAAA,UAAA,qBAAA,GACA,GAAA,EAAA,IAAA,cACA,GAAA,GASA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAmIA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,GAAA,IAAA,EAAA,OAAA,OAAA,EAmBA,GAhBA,iBAAA,GACA,EAAA,EACA,EAAA,GACA,EAAA,WACA,EAAA,WACA,GAAA,aACA,GAAA,YAEA,GAAA,EACA,MAAA,KAEA,EAAA,EAAA,EAAA,EAAA,OAAA,GAIA,EAAA,IAAA,EAAA,EAAA,OAAA,GACA,GAAA,EAAA,OAAA,CACA,GAAA,EAAA,OAAA,EACA,EAAA,EAAA,OAAA,OACA,GAAA,EAAA,EAAA,CACA,IAAA,EACA,OAAA,EADA,EAAA,EAUA,GALA,iBAAA,IACA,EAAA,EAAA,KAAA,EAAA,IAIA,EAAA,SAAA,GAEA,OAAA,IAAA,EAAA,QACA,EAEA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,iBAAA,EAEA,OADA,GAAA,IACA,EAAA,qBACA,mBAAA,WAAA,UAAA,QACA,EACA,WAAA,UAAA,QAAA,KAAA,EAAA,EAAA,GAEA,WAAA,UAAA,YAAA,KAAA,EAAA,EAAA,GAGA,EAAA,EAAA,CAAA,GAAA,EAAA,EAAA,GAGA,MAAA,IAAA,UAAA,wCAGA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,IA0BA,EA1BA,EAAA,EACA,EAAA,EAAA,OACA,EAAA,EAAA,OAEA,QAAA,IAAA,IAEA,UADA,EAAA,OAAA,GAAA,gBACA,UAAA,GACA,YAAA,GAAA,aAAA,GAAA,CACA,GAAA,EAAA,OAAA,GAAA,EAAA,OAAA,EACA,OAAA,EAEA,EAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EAIA,SAAA,EAAA,EAAA,GACA,OAAA,IAAA,EACA,EAAA,GAEA,EAAA,aAAA,EAAA,GAKA,GAAA,EAAA,CACA,IAAA,GAAA,EACA,IAAA,EAAA,EAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,KAAA,EAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAEA,IADA,IAAA,IAAA,EAAA,GACA,EAAA,EAAA,IAAA,EAAA,OAAA,EAAA,OAEA,IAAA,IAAA,GAAA,EAAA,GACA,GAAA,OAKA,IADA,EAAA,EAAA,IAAA,EAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,IAAA,CAEA,IADA,IAAA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,KAAA,EAAA,EAAA,GAAA,CACA,GAAA,EACA,MAGA,GAAA,EAAA,OAAA,EAIA,OAAA,EAeA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,OAAA,IAAA,EACA,IAAA,EAAA,EAAA,OAAA,EACA,GAGA,EAAA,OAAA,IACA,IACA,EAAA,GAJA,EAAA,EASA,IAAA,EAAA,EAAA,OACA,GAAA,EAAA,GAAA,EAAA,MAAA,IAAA,UAAA,sBAEA,EAAA,EAAA,IACA,EAAA,EAAA,GAEA,IAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EAAA,CACA,IAAA,EAAA,SAAA,EAAA,OAAA,EAAA,EAAA,GAAA,IACA,GAAA,MAAA,GAAA,OAAA,EACA,EAAA,EAAA,GAAA,EAEA,OAAA,EAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,OAAA,EAAA,EAAA,EAAA,EAAA,OAAA,GAAA,EAAA,EAAA,GAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,OAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,OAAA,EAAA,EAAA,EAAA,EAAA,GAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,OAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,OAAA,EAAA,EAAA,EAAA,EAAA,OAAA,GAAA,EAAA,EAAA,GAkFA,SAAA,EAAA,EAAA,EAAA,GACA,OAAA,IAAA,GAAA,IAAA,EAAA,OACA,EAAA,cAAA,GAEA,EAAA,cAAA,EAAA,MAAA,EAAA,IAIA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,KAAA,IAAA,EAAA,OAAA,GAIA,IAHA,IAAA,EAAA,GAEA,EAAA,EACA,EAAA,GAAA,CACA,IAQA,EAAA,EAAA,EAAA,EARA,EAAA,EAAA,GACA,EAAA,KACA,EAAA,EAAA,IAAA,EACA,EAAA,IAAA,EACA,EAAA,IAAA,EACA,EAEA,GAAA,EAAA,GAAA,EAGA,OAAA,GACA,KAAA,EACA,EAAA,MACA,EAAA,GAEA,MACA,KAAA,EAEA,MAAA,KADA,EAAA,EAAA,EAAA,OAEA,GAAA,GAAA,IAAA,EAAA,GAAA,GACA,MACA,EAAA,GAGA,MACA,KAAA,EACA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,GACA,MAAA,IAAA,IAAA,MAAA,IAAA,KACA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,EAAA,GAAA,GACA,OAAA,EAAA,OAAA,EAAA,SACA,EAAA,GAGA,MACA,KAAA,EACA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,GACA,MAAA,IAAA,IAAA,MAAA,IAAA,IAAA,MAAA,IAAA,KACA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,EAAA,GAAA,GACA,OAAA,EAAA,UACA,EAAA,GAMA,OAAA,GAGA,EAAA,MACA,EAAA,GACA,EAAA,QAEA,GAAA,MACA,EAAA,KAAA,IAAA,GAAA,KAAA,OACA,EAAA,MAAA,KAAA,GAGA,EAAA,KAAA,GACA,GAAA,EAGA,OAAA,EAAA,GA98BA,QAAA,OAAA,EACA,QAAA,WAAA,EACA,QAAA,kBAAA,GA0BA,EAAA,yBAAA,IAAA,EAAA,oBACA,EAAA,oBACA,IAKA,QAAA,WAAA,IAkEA,EAAA,SAAA,KAGA,EAAA,SAAA,SAAA,GAEA,OADA,EAAA,UAAA,EAAA,UACA,GA2BA,EAAA,KAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,EAAA,IAGA,EAAA,sBACA,EAAA,UAAA,UAAA,WAAA,UACA,EAAA,UAAA,WACA,oBAAA,QAAA,OAAA,SACA,EAAA,OAAA,WAAA,GAEA,OAAA,eAAA,EAAA,OAAA,QAAA,CACA,MAAA,KACA,cAAA,KAiCA,EAAA,MAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,EAAA,IAiBA,EAAA,YAAA,SAAA,GACA,OAAA,EAAA,KAAA,IAKA,EAAA,gBAAA,SAAA,GACA,OAAA,EAAA,KAAA,IAiHA,EAAA,SAAA,SAAA,GACA,QAAA,MAAA,IAAA,EAAA,YAGA,EAAA,QAAA,SAAA,EAAA,GACA,IAAA,EAAA,SAAA,KAAA,EAAA,SAAA,GACA,MAAA,IAAA,UAAA,6BAGA,GAAA,IAAA,EAAA,OAAA,EAKA,IAHA,IAAA,EAAA,EAAA,OACA,EAAA,EAAA,OAEA,EAAA,EAAA,EAAA,KAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EACA,GAAA,EAAA,KAAA,EAAA,GAAA,CACA,EAAA,EAAA,GACA,EAAA,EAAA,GACA,MAIA,OAAA,EAAA,GAAA,EACA,EAAA,EAAA,EACA,GAGA,EAAA,WAAA,SAAA,GACA,OAAA,OAAA,GAAA,eACA,IAAA,MACA,IAAA,OACA,IAAA,QACA,IAAA,QACA,IAAA,SACA,IAAA,SACA,IAAA,SACA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EACA,QACA,OAAA,IAIA,EAAA,OAAA,SAAA,EAAA,GACA,IAAA,EAAA,GACA,MAAA,IAAA,UAAA,+CAGA,GAAA,IAAA,EAAA,OACA,OAAA,EAAA,MAAA,GAGA,IAAA,EACA,QAAA,IAAA,EAEA,IADA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,SAAA,EACA,GAAA,EAAA,GAAA,OAIA,IAAA,EAAA,EAAA,YAAA,GACA,EAAA,EACA,IAAA,EAAA,EAAA,EAAA,EAAA,SAAA,EAAA,CACA,IAAA,EAAA,EAAA,GACA,IAAA,EAAA,SAAA,GACA,MAAA,IAAA,UAAA,+CAEA,EAAA,KAAA,EAAA,GACA,GAAA,EAAA,OAEA,OAAA,GA8CA,EAAA,WAAA,EA0EA,EAAA,UAAA,WAAA,EAQA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,OACA,GAAA,EAAA,GAAA,EACA,MAAA,IAAA,WAAA,6CAEA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,EAAA,KAAA,EAAA,EAAA,GAEA,OAAA,MAGA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,OACA,GAAA,EAAA,GAAA,EACA,MAAA,IAAA,WAAA,6CAEA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,EAAA,KAAA,EAAA,EAAA,GACA,EAAA,KAAA,EAAA,EAAA,EAAA,GAEA,OAAA,MAGA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,OACA,GAAA,EAAA,GAAA,EACA,MAAA,IAAA,WAAA,6CAEA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,EAAA,KAAA,EAAA,EAAA,GACA,EAAA,KAAA,EAAA,EAAA,EAAA,GACA,EAAA,KAAA,EAAA,EAAA,EAAA,GACA,EAAA,KAAA,EAAA,EAAA,EAAA,GAEA,OAAA,MAGA,EAAA,UAAA,SAAA,WACA,IAAA,EAAA,EAAA,KAAA,OACA,OAAA,IAAA,EAAA,GACA,IAAA,UAAA,OAAA,EAAA,KAAA,EAAA,GACA,EAAA,MAAA,KAAA,YAGA,EAAA,UAAA,OAAA,SAAA,GACA,IAAA,EAAA,SAAA,GAAA,MAAA,IAAA,UAAA,6BACA,OAAA,OAAA,GACA,IAAA,EAAA,QAAA,KAAA,IAGA,EAAA,UAAA,QAAA,WACA,IAAA,EAAA,GACA,EAAA,QAAA,kBAKA,OAJA,KAAA,OAAA,IACA,EAAA,KAAA,SAAA,MAAA,EAAA,GAAA,MAAA,SAAA,KAAA,KACA,KAAA,OAAA,IAAA,GAAA,UAEA,WAAA,EAAA,KAGA,EAAA,UAAA,QAAA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,SAAA,GACA,MAAA,IAAA,UAAA,6BAgBA,QAbA,IAAA,IACA,EAAA,QAEA,IAAA,IACA,EAAA,EAAA,EAAA,OAAA,QAEA,IAAA,IACA,EAAA,QAEA,IAAA,IACA,EAAA,KAAA,QAGA,EAAA,GAAA,EAAA,EAAA,QAAA,EAAA,GAAA,EAAA,KAAA,OACA,MAAA,IAAA,WAAA,sBAGA,GAAA,GAAA,GAAA,GAAA,EACA,OAAA,EAEA,GAAA,GAAA,EACA,OAAA,EAEA,GAAA,GAAA,EACA,OAAA,EAQA,GAAA,OAAA,EAAA,OAAA,EASA,IAPA,IAAA,GAJA,KAAA,IADA,KAAA,GAMA,GAPA,KAAA,IADA,KAAA,GASA,EAAA,KAAA,IAAA,EAAA,GAEA,EAAA,KAAA,MAAA,EAAA,GACA,EAAA,EAAA,MAAA,EAAA,GAEA,EAAA,EAAA,EAAA,IAAA,EACA,GAAA,EAAA,KAAA,EAAA,GAAA,CACA,EAAA,EAAA,GACA,EAAA,EAAA,GACA,MAIA,OAAA,EAAA,GAAA,EACA,EAAA,EAAA,EACA,GA6HA,EAAA,UAAA,SAAA,SAAA,EAAA,EAAA,GACA,OAAA,IAAA,KAAA,QAAA,EAAA,EAAA,IAGA,EAAA,UAAA,QAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAAA,IAGA,EAAA,UAAA,YAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAAA,IAkDA,EAAA,UAAA,MAAA,SAAA,EAAA,EAAA,EAAA,GAEA,QAAA,IAAA,EACA,EAAA,OACA,EAAA,KAAA,OACA,EAAA,OAEA,QAAA,IAAA,GAAA,iBAAA,EACA,EAAA,EACA,EAAA,KAAA,OACA,EAAA,MAEA,CAAA,IAAA,SAAA,GAWA,MAAA,IAAA,MACA,2EAXA,GAAA,EACA,SAAA,IACA,GAAA,OACA,IAAA,IAAA,EAAA,UAEA,EAAA,EACA,OAAA,GASA,IAAA,EAAA,KAAA,OAAA,EAGA,SAFA,IAAA,GAAA,EAAA,KAAA,EAAA,GAEA,EAAA,OAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,KAAA,OACA,MAAA,IAAA,WAAA,0CAGA,IAAA,EAAA,QAGA,IADA,IAAA,GAAA,IAEA,OAAA,GACA,IAAA,MACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAEA,IAAA,OACA,IAAA,QACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAEA,IAAA,QACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAEA,IAAA,SACA,IAAA,SACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAEA,IAAA,SAEA,OAAA,EAAA,KAAA,EAAA,EAAA,GAEA,IAAA,OACA,IAAA,QACA,IAAA,UACA,IAAA,WACA,OAAA,EAAA,KAAA,EAAA,EAAA,GAEA,QACA,GAAA,EAAA,MAAA,IAAA,UAAA,qBAAA,GACA,GAAA,GAAA,GAAA,cACA,GAAA,IAKA,EAAA,UAAA,OAAA,WACA,MAAA,CACA,KAAA,SACA,KAAA,MAAA,UAAA,MAAA,KAAA,KAAA,MAAA,KAAA,KAwFA,IAAA,EAAA,KAEA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,OACA,GAAA,GAAA,EACA,OAAA,OAAA,aAAA,MAAA,OAAA,GAMA,IAFA,IAAA,EAAA,GACA,EAAA,EACA,EAAA,GACA,GAAA,OAAA,aAAA,MACA,OACA,EAAA,MAAA,EAAA,GAAA,IAGA,OAAA,EAGA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,GACA,EAAA,KAAA,IAAA,EAAA,OAAA,GAEA,IAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EACA,GAAA,OAAA,aAAA,IAAA,EAAA,IAEA,OAAA,EAGA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,GACA,EAAA,KAAA,IAAA,EAAA,OAAA,GAEA,IAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EACA,GAAA,OAAA,aAAA,EAAA,IAEA,OAAA,EAGA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,EAAA,SAEA,GAAA,EAAA,KAAA,EAAA,KACA,GAAA,EAAA,GAAA,EAAA,KAAA,EAAA,GAGA,IADA,IAAA,EAAA,GACA,EAAA,EAAA,EAAA,IAAA,EACA,GAAA,EAAA,EAAA,IAEA,OAAA,EAGA,SAAA,EAAA,EAAA,EAAA,GAGA,IAFA,IAAA,EAAA,EAAA,MAAA,EAAA,GACA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,OAAA,GAAA,EACA,GAAA,OAAA,aAAA,EAAA,GAAA,IAAA,EAAA,EAAA,IAEA,OAAA,EA0CA,SAAA,EAAA,EAAA,EAAA,GACA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,MAAA,IAAA,WAAA,sBACA,GAAA,EAAA,EAAA,EAAA,MAAA,IAAA,WAAA,yCA+JA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,EAAA,SAAA,GAAA,MAAA,IAAA,UAAA,+CACA,GAAA,EAAA,GAAA,EAAA,EAAA,MAAA,IAAA,WAAA,qCACA,GAAA,EAAA,EAAA,EAAA,OAAA,MAAA,IAAA,WAAA,sBAkDA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,MAAA,EAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,KAAA,IAAA,EAAA,OAAA,EAAA,GAAA,EAAA,IAAA,EACA,EAAA,EAAA,IAAA,EAAA,KAAA,GAAA,EAAA,EAAA,EAAA,MACA,GAAA,EAAA,EAAA,EAAA,GA8BA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,WAAA,EAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,KAAA,IAAA,EAAA,OAAA,EAAA,GAAA,EAAA,IAAA,EACA,EAAA,EAAA,GAAA,IAAA,GAAA,EAAA,EAAA,EAAA,GAAA,IAmJA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,EAAA,EAAA,EAAA,OAAA,MAAA,IAAA,WAAA,sBACA,GAAA,EAAA,EAAA,MAAA,IAAA,WAAA,sBAGA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAKA,OAJA,GACA,EAAA,EAAA,EAAA,EAAA,EAAA,uBAAA,uBAEA,EAAA,MAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GACA,EAAA,EAWA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAKA,OAJA,GACA,EAAA,EAAA,EAAA,EAAA,EAAA,wBAAA,wBAEA,EAAA,MAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GACA,EAAA,EA/cA,EAAA,UAAA,MAAA,SAAA,EAAA,GACA,IAoBA,EApBA,EAAA,KAAA,OAqBA,IApBA,IAAA,GAGA,GACA,GAAA,GACA,IAAA,EAAA,GACA,EAAA,IACA,EAAA,IANA,OAAA,IAAA,EAAA,IAAA,GASA,GACA,GAAA,GACA,IAAA,EAAA,GACA,EAAA,IACA,EAAA,GAGA,EAAA,IAAA,EAAA,GAGA,EAAA,qBACA,EAAA,KAAA,SAAA,EAAA,IACA,UAAA,EAAA,cACA,CACA,IAAA,EAAA,EAAA,EACA,EAAA,IAAA,EAAA,OAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EACA,EAAA,GAAA,KAAA,EAAA,GAIA,OAAA,GAWA,EAAA,UAAA,WAAA,SAAA,EAAA,EAAA,GACA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,EAAA,EAAA,KAAA,QAKA,IAHA,IAAA,EAAA,KAAA,GACA,EAAA,EACA,EAAA,IACA,EAAA,IAAA,GAAA,MACA,GAAA,KAAA,EAAA,GAAA,EAGA,OAAA,GAGA,EAAA,UAAA,WAAA,SAAA,EAAA,EAAA,GACA,GAAA,EACA,GAAA,EACA,GACA,EAAA,EAAA,EAAA,KAAA,QAKA,IAFA,IAAA,EAAA,KAAA,IAAA,GACA,EAAA,EACA,EAAA,IAAA,GAAA,MACA,GAAA,KAAA,IAAA,GAAA,EAGA,OAAA,GAGA,EAAA,UAAA,UAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,KAAA,IAGA,EAAA,UAAA,aAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,KAAA,GAAA,KAAA,EAAA,IAAA,GAGA,EAAA,UAAA,aAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,KAAA,IAAA,EAAA,KAAA,EAAA,IAGA,EAAA,UAAA,aAAA,SAAA,EAAA,GAGA,OAFA,GAAA,EAAA,EAAA,EAAA,KAAA,SAEA,KAAA,GACA,KAAA,EAAA,IAAA,EACA,KAAA,EAAA,IAAA,IACA,SAAA,KAAA,EAAA,IAGA,EAAA,UAAA,aAAA,SAAA,EAAA,GAGA,OAFA,GAAA,EAAA,EAAA,EAAA,KAAA,QAEA,SAAA,KAAA,IACA,KAAA,EAAA,IAAA,GACA,KAAA,EAAA,IAAA,EACA,KAAA,EAAA,KAGA,EAAA,UAAA,UAAA,SAAA,EAAA,EAAA,GACA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,EAAA,EAAA,KAAA,QAKA,IAHA,IAAA,EAAA,KAAA,GACA,EAAA,EACA,EAAA,IACA,EAAA,IAAA,GAAA,MACA,GAAA,KAAA,EAAA,GAAA,EAMA,OAFA,IAFA,GAAA,OAEA,GAAA,KAAA,IAAA,EAAA,EAAA,IAEA,GAGA,EAAA,UAAA,UAAA,SAAA,EAAA,EAAA,GACA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,EAAA,EAAA,KAAA,QAKA,IAHA,IAAA,EAAA,EACA,EAAA,EACA,EAAA,KAAA,IAAA,GACA,EAAA,IAAA,GAAA,MACA,GAAA,KAAA,IAAA,GAAA,EAMA,OAFA,IAFA,GAAA,OAEA,GAAA,KAAA,IAAA,EAAA,EAAA,IAEA,GAGA,EAAA,UAAA,SAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,IAAA,KAAA,IACA,GAAA,IAAA,KAAA,GAAA,GADA,KAAA,IAIA,EAAA,UAAA,YAAA,SAAA,EAAA,GACA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,IAAA,EAAA,KAAA,GAAA,KAAA,EAAA,IAAA,EACA,OAAA,MAAA,EAAA,WAAA,EAAA,GAGA,EAAA,UAAA,YAAA,SAAA,EAAA,GACA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,IAAA,EAAA,KAAA,EAAA,GAAA,KAAA,IAAA,EACA,OAAA,MAAA,EAAA,WAAA,EAAA,GAGA,EAAA,UAAA,YAAA,SAAA,EAAA,GAGA,OAFA,GAAA,EAAA,EAAA,EAAA,KAAA,QAEA,KAAA,GACA,KAAA,EAAA,IAAA,EACA,KAAA,EAAA,IAAA,GACA,KAAA,EAAA,IAAA,IAGA,EAAA,UAAA,YAAA,SAAA,EAAA,GAGA,OAFA,GAAA,EAAA,EAAA,EAAA,KAAA,QAEA,KAAA,IAAA,GACA,KAAA,EAAA,IAAA,GACA,KAAA,EAAA,IAAA,EACA,KAAA,EAAA,IAGA,EAAA,UAAA,YAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,EAAA,KAAA,KAAA,GAAA,EAAA,GAAA,IAGA,EAAA,UAAA,YAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,EAAA,KAAA,KAAA,GAAA,EAAA,GAAA,IAGA,EAAA,UAAA,aAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,EAAA,KAAA,KAAA,GAAA,EAAA,GAAA,IAGA,EAAA,UAAA,aAAA,SAAA,EAAA,GAEA,OADA,GAAA,EAAA,EAAA,EAAA,KAAA,QACA,EAAA,KAAA,KAAA,GAAA,EAAA,GAAA,IASA,EAAA,UAAA,YAAA,SAAA,EAAA,EAAA,EAAA,IACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,IAEA,EAAA,KAAA,EAAA,EAAA,EADA,KAAA,IAAA,EAAA,EAAA,GAAA,EACA,GAGA,IAAA,EAAA,EACA,EAAA,EAEA,IADA,KAAA,GAAA,IAAA,IACA,EAAA,IAAA,GAAA,MACA,KAAA,EAAA,GAAA,EAAA,EAAA,IAGA,OAAA,EAAA,GAGA,EAAA,UAAA,YAAA,SAAA,EAAA,EAAA,EAAA,IACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,IAEA,EAAA,KAAA,EAAA,EAAA,EADA,KAAA,IAAA,EAAA,EAAA,GAAA,EACA,GAGA,IAAA,EAAA,EAAA,EACA,EAAA,EAEA,IADA,KAAA,EAAA,GAAA,IAAA,IACA,GAAA,IAAA,GAAA,MACA,KAAA,EAAA,GAAA,EAAA,EAAA,IAGA,OAAA,EAAA,GAGA,EAAA,UAAA,WAAA,SAAA,EAAA,EAAA,GAMA,OALA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,IAAA,GACA,EAAA,sBAAA,EAAA,KAAA,MAAA,IACA,KAAA,GAAA,IAAA,EACA,EAAA,GAWA,EAAA,UAAA,cAAA,SAAA,EAAA,EAAA,GAUA,OATA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,MAAA,GACA,EAAA,qBACA,KAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAGA,EAAA,UAAA,cAAA,SAAA,EAAA,EAAA,GAUA,OATA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,MAAA,GACA,EAAA,qBACA,KAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAUA,EAAA,UAAA,cAAA,SAAA,EAAA,EAAA,GAYA,OAXA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,WAAA,GACA,EAAA,qBACA,KAAA,EAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,EACA,KAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAGA,EAAA,UAAA,cAAA,SAAA,EAAA,EAAA,GAYA,OAXA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,WAAA,GACA,EAAA,qBACA,KAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAGA,EAAA,UAAA,WAAA,SAAA,EAAA,EAAA,EAAA,GAGA,GAFA,GAAA,EACA,GAAA,GACA,EAAA,CACA,IAAA,EAAA,KAAA,IAAA,EAAA,EAAA,EAAA,GAEA,EAAA,KAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAGA,IAAA,EAAA,EACA,EAAA,EACA,EAAA,EAEA,IADA,KAAA,GAAA,IAAA,IACA,EAAA,IAAA,GAAA,MACA,EAAA,GAAA,IAAA,GAAA,IAAA,KAAA,EAAA,EAAA,KACA,EAAA,GAEA,KAAA,EAAA,IAAA,EAAA,GAAA,GAAA,EAAA,IAGA,OAAA,EAAA,GAGA,EAAA,UAAA,WAAA,SAAA,EAAA,EAAA,EAAA,GAGA,GAFA,GAAA,EACA,GAAA,GACA,EAAA,CACA,IAAA,EAAA,KAAA,IAAA,EAAA,EAAA,EAAA,GAEA,EAAA,KAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAGA,IAAA,EAAA,EAAA,EACA,EAAA,EACA,EAAA,EAEA,IADA,KAAA,EAAA,GAAA,IAAA,IACA,GAAA,IAAA,GAAA,MACA,EAAA,GAAA,IAAA,GAAA,IAAA,KAAA,EAAA,EAAA,KACA,EAAA,GAEA,KAAA,EAAA,IAAA,EAAA,GAAA,GAAA,EAAA,IAGA,OAAA,EAAA,GAGA,EAAA,UAAA,UAAA,SAAA,EAAA,EAAA,GAOA,OANA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,KAAA,KACA,EAAA,sBAAA,EAAA,KAAA,MAAA,IACA,EAAA,IAAA,EAAA,IAAA,EAAA,GACA,KAAA,GAAA,IAAA,EACA,EAAA,GAGA,EAAA,UAAA,aAAA,SAAA,EAAA,EAAA,GAUA,OATA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,OAAA,OACA,EAAA,qBACA,KAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAGA,EAAA,UAAA,aAAA,SAAA,EAAA,EAAA,GAUA,OATA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,OAAA,OACA,EAAA,qBACA,KAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAGA,EAAA,UAAA,aAAA,SAAA,EAAA,EAAA,GAYA,OAXA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,YAAA,YACA,EAAA,qBACA,KAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,IAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAGA,EAAA,UAAA,aAAA,SAAA,EAAA,EAAA,GAaA,OAZA,GAAA,EACA,GAAA,EACA,GAAA,EAAA,KAAA,EAAA,EAAA,EAAA,YAAA,YACA,EAAA,IAAA,EAAA,WAAA,EAAA,GACA,EAAA,qBACA,KAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,GACA,KAAA,EAAA,GAAA,IAAA,EACA,KAAA,EAAA,GAAA,IAAA,GAEA,EAAA,KAAA,EAAA,GAAA,GAEA,EAAA,GAgBA,EAAA,UAAA,aAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,GAAA,EAAA,IAGA,EAAA,UAAA,aAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,GAAA,EAAA,IAWA,EAAA,UAAA,cAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,GAAA,EAAA,IAGA,EAAA,UAAA,cAAA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,GAAA,EAAA,IAIA,EAAA,UAAA,KAAA,SAAA,EAAA,EAAA,EAAA,GAQA,GAPA,IAAA,EAAA,GACA,GAAA,IAAA,IAAA,EAAA,KAAA,QACA,GAAA,EAAA,SAAA,EAAA,EAAA,QACA,IAAA,EAAA,GACA,EAAA,GAAA,EAAA,IAAA,EAAA,GAGA,IAAA,EAAA,OAAA,EACA,GAAA,IAAA,EAAA,QAAA,IAAA,KAAA,OAAA,OAAA,EAGA,GAAA,EAAA,EACA,MAAA,IAAA,WAAA,6BAEA,GAAA,EAAA,GAAA,GAAA,KAAA,OAAA,MAAA,IAAA,WAAA,6BACA,GAAA,EAAA,EAAA,MAAA,IAAA,WAAA,2BAGA,EAAA,KAAA,SAAA,EAAA,KAAA,QACA,EAAA,OAAA,EAAA,EAAA,IACA,EAAA,EAAA,OAAA,EAAA,GAGA,IACA,EADA,EAAA,EAAA,EAGA,GAAA,OAAA,GAAA,EAAA,GAAA,EAAA,EAEA,IAAA,EAAA,EAAA,EAAA,GAAA,IAAA,EACA,EAAA,EAAA,GAAA,KAAA,EAAA,QAEA,GAAA,EAAA,MAAA,EAAA,oBAEA,IAAA,EAAA,EAAA,EAAA,IAAA,EACA,EAAA,EAAA,GAAA,KAAA,EAAA,QAGA,WAAA,UAAA,IAAA,KACA,EACA,KAAA,SAAA,EAAA,EAAA,GACA,GAIA,OAAA,GAOA,EAAA,UAAA,KAAA,SAAA,EAAA,EAAA,EAAA,GAEA,GAAA,iBAAA,EAAA,CASA,GARA,iBAAA,GACA,EAAA,EACA,EAAA,EACA,EAAA,KAAA,QACA,iBAAA,IACA,EAAA,EACA,EAAA,KAAA,QAEA,IAAA,EAAA,OAAA,CACA,IAAA,EAAA,EAAA,WAAA,GACA,EAAA,MACA,EAAA,GAGA,QAAA,IAAA,GAAA,iBAAA,EACA,MAAA,IAAA,UAAA,6BAEA,GAAA,iBAAA,IAAA,EAAA,WAAA,GACA,MAAA,IAAA,UAAA,qBAAA,OAEA,iBAAA,IACA,GAAA,KAIA,GAAA,EAAA,GAAA,KAAA,OAAA,GAAA,KAAA,OAAA,EACA,MAAA,IAAA,WAAA,sBAGA,GAAA,GAAA,EACA,OAAA,KAQA,IAAA,EACA,GANA,KAAA,EACA,OAAA,IAAA,EAAA,KAAA,OAAA,IAAA,EAEA,IAAA,EAAA,GAGA,iBAAA,EACA,IAAA,EAAA,EAAA,EAAA,IAAA,EACA,KAAA,GAAA,MAEA,CACA,IAAA,EAAA,EAAA,SAAA,GACA,EACA,EAAA,IAAA,EAAA,EAAA,GAAA,YACA,EAAA,EAAA,OACA,IAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EACA,KAAA,EAAA,GAAA,EAAA,EAAA,GAIA,OAAA,MAMA,IAAA,EAAA,qBAEA,SAAA,EAAA,GAIA,IAFA,EAAA,EAAA,GAAA,QAAA,EAAA,KAEA,OAAA,EAAA,MAAA,GAEA,KAAA,EAAA,OAAA,GAAA,GACA,GAAA,IAEA,OAAA,EAGA,SAAA,EAAA,GACA,OAAA,EAAA,KAAA,EAAA,OACA,EAAA,QAAA,aAAA,IAGA,SAAA,EAAA,GACA,OAAA,EAAA,GAAA,IAAA,EAAA,SAAA,IACA,EAAA,SAAA,IAGA,SAAA,EAAA,EAAA,GAEA,IAAA,EADA,EAAA,GAAA,EAAA,EAMA,IAJA,IAAA,EAAA,EAAA,OACA,EAAA,KACA,EAAA,GAEA,EAAA,EAAA,EAAA,IAAA,EAAA,CAIA,IAHA,EAAA,EAAA,WAAA,IAGA,OAAA,EAAA,MAAA,CAEA,IAAA,EAAA,CAEA,GAAA,EAAA,MAAA,EAEA,GAAA,IAAA,GAAA,EAAA,KAAA,IAAA,IAAA,KACA,SACA,GAAA,EAAA,IAAA,EAAA,EAEA,GAAA,IAAA,GAAA,EAAA,KAAA,IAAA,IAAA,KACA,SAIA,EAAA,EAEA,SAIA,GAAA,EAAA,MAAA,EACA,GAAA,IAAA,GAAA,EAAA,KAAA,IAAA,IAAA,KACA,EAAA,EACA,SAIA,EAAA,OAAA,EAAA,OAAA,GAAA,EAAA,YACA,IAEA,GAAA,IAAA,GAAA,EAAA,KAAA,IAAA,IAAA,KAMA,GAHA,EAAA,KAGA,EAAA,IAAA,CACA,IAAA,GAAA,GAAA,EAAA,MACA,EAAA,KAAA,QACA,GAAA,EAAA,KAAA,CACA,IAAA,GAAA,GAAA,EAAA,MACA,EAAA,KACA,GAAA,EAAA,IACA,GAAA,EAAA,UAEA,GAAA,EAAA,MAAA,CACA,IAAA,GAAA,GAAA,EAAA,MACA,EAAA,KACA,GAAA,GAAA,IACA,GAAA,EAAA,GAAA,IACA,GAAA,EAAA,SAEA,CAAA,KAAA,EAAA,SASA,MAAA,IAAA,MAAA,sBARA,IAAA,GAAA,GAAA,EAAA,MACA,EAAA,KACA,GAAA,GAAA,IACA,GAAA,GAAA,GAAA,IACA,GAAA,EAAA,GAAA,IACA,GAAA,EAAA,MAOA,OAAA,EAGA,SAAA,EAAA,GAEA,IADA,IAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,SAAA,EAEA,EAAA,KAAA,IAAA,EAAA,WAAA,IAEA,OAAA,EAGA,SAAA,EAAA,EAAA,GAGA,IAFA,IAAA,EAAA,EAAA,EACA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,WACA,GAAA,GAAA,KADA,EAIA,GADA,EAAA,EAAA,WAAA,KACA,EACA,EAAA,EAAA,IACA,EAAA,KAAA,GACA,EAAA,KAAA,GAGA,OAAA,EAGA,SAAA,EAAA,GACA,OAAA,EAAA,YAAA,EAAA,IAGA,SAAA,EAAA,EAAA,EAAA,EAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,KACA,EAAA,GAAA,EAAA,QAAA,GAAA,EAAA,UADA,EAEA,EAAA,EAAA,GAAA,EAAA,GAEA,OAAA,EAGA,SAAA,EAAA,GACA,OAAA,GAAA;;;;AC71CA,IAAA,EAAA,UAAA,GAAA,EAAA,QAAA,UAAA,OA7ZA,EAAA,QAoOA,SAAA,EAAA,EAAA,EAAA,GACA,IAAA,IAAA,EAAA,OAAA,KAAA,GAAA,EAAA,EAAA,EAAA,EAAA,SAAA,OACA,IAAA,EAAA,EAAA,KAAA,IACA,EAAA,EAAA,IAAA,EAAA,EAAA,KACA,OAAA,EAoBA,SAAA,EAAA,GAEA,SAAA,EAAA,EAAA,GAEA,KAAA,gBAAA,GACA,OAAA,IAAA,EAAA,EAAA,GAKA,OAAA,eAAA,KAAA,UAAA,CAAA,IAAA,WAAA,OAAA,KAGA,MAAA,kBACA,MAAA,kBAAA,KAAA,GAEA,OAAA,eAAA,KAAA,QAAA,CAAA,OAAA,IAAA,OAAA,OAAA,KAEA,GACA,EAAA,KAAA,GAWA,OARA,EAAA,UAAA,OAAA,OAAA,MAAA,YAAA,YAAA,EAEA,OAAA,eAAA,EAAA,UAAA,OAAA,CAAA,IAAA,WAAA,OAAA,KAEA,EAAA,UAAA,SAAA,WACA,OAAA,KAAA,KAAA,KAAA,KAAA,SAGA,EAvRA,EAAA,UAAA,QAAA,yBAGA,EAAA,OAAA,QAAA,sBAGA,EAAA,aAAA,QAAA,4BAGA,EAAA,MAAA,QAAA,qBAGA,EAAA,QAAA,QAAA,uBAGA,EAAA,KAAA,QAAA,oBAGA,EAAA,KAAA,QAAA,oBAGA,EAAA,SAAA,QAAA,cAGA,EAAA,OAAA,oBAAA,QAAA,aACA,IAAA,GAAA,GACA,oBAAA,MAAA,MACA,KAQA,EAAA,WAAA,OAAA,OAAA,OAAA,OAAA,IAAA,GAOA,EAAA,YAAA,OAAA,OAAA,OAAA,OAAA,IAAA,GAQA,EAAA,OAAA,QAAA,EAAA,OAAA,SAAA,EAAA,OAAA,QAAA,UAAA,EAAA,OAAA,QAAA,SAAA,MAQA,EAAA,UAAA,OAAA,WAAA,SAAA,GACA,MAAA,iBAAA,GAAA,SAAA,IAAA,KAAA,MAAA,KAAA,GAQA,EAAA,SAAA,SAAA,GACA,MAAA,iBAAA,GAAA,aAAA,QAQA,EAAA,SAAA,SAAA,GACA,OAAA,GAAA,iBAAA,GAWA,EAAA,MAQA,EAAA,MAAA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,GACA,QAAA,MAAA,IAAA,EAAA,eAAA,MACA,iBAAA,IAAA,MAAA,QAAA,GAAA,EAAA,OAAA,OAAA,KAAA,GAAA,QAAA,IAeA,EAAA,OAAA,WACA,IACA,IAAA,EAAA,EAAA,QAAA,UAAA,OAEA,OAAA,EAAA,UAAA,UAAA,EAAA,KACA,MAAA,GAEA,OAAA,MAPA,GAYA,EAAA,aAAA,KAGA,EAAA,oBAAA,KAOA,EAAA,UAAA,SAAA,GAEA,MAAA,iBAAA,EACA,EAAA,OACA,EAAA,oBAAA,GACA,IAAA,EAAA,MAAA,GACA,EAAA,OACA,EAAA,aAAA,GACA,oBAAA,WACA,EACA,IAAA,WAAA,IAOA,EAAA,MAAA,oBAAA,WAAA,WAAA,MAeA,EAAA,KAAA,EAAA,OAAA,SAAA,EAAA,OAAA,QAAA,MACA,EAAA,OAAA,MACA,EAAA,QAAA,QAOA,EAAA,OAAA,mBAOA,EAAA,QAAA,wBAOA,EAAA,QAAA,6CAOA,EAAA,WAAA,SAAA,GACA,OAAA,EACA,EAAA,SAAA,KAAA,GAAA,SACA,EAAA,SAAA,UASA,EAAA,aAAA,SAAA,EAAA,GACA,IAAA,EAAA,EAAA,SAAA,SAAA,GACA,OAAA,EAAA,KACA,EAAA,KAAA,SAAA,EAAA,GAAA,EAAA,GAAA,GACA,EAAA,SAAA,QAAA,KAkBA,EAAA,MAAA,EAOA,EAAA,QAAA,SAAA,GACA,OAAA,EAAA,OAAA,GAAA,cAAA,EAAA,UAAA,IA0CA,EAAA,SAAA,EAmBA,EAAA,cAAA,EAAA,iBAoBA,EAAA,YAAA,SAAA,GAEA,IADA,IAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,SAAA,EACA,EAAA,EAAA,IAAA,EAOA,OAAA,WACA,IAAA,IAAA,EAAA,OAAA,KAAA,MAAA,EAAA,EAAA,OAAA,EAAA,GAAA,IAAA,EACA,GAAA,IAAA,EAAA,EAAA,UAAA,IAAA,KAAA,EAAA,KAAA,OAAA,KAAA,EAAA,IACA,OAAA,EAAA,KAiBA,EAAA,YAAA,SAAA,GAQA,OAAA,SAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,SAAA,EACA,EAAA,KAAA,UACA,KAAA,EAAA,MAoBA,EAAA,cAAA,CACA,MAAA,OACA,MAAA,OACA,MAAA,OACA,MAAA,GAIA,EAAA,WAAA,WACA,IAAA,EAAA,EAAA,OAEA,GAMA,EAAA,aAAA,EAAA,OAAA,WAAA,MAAA,EAAA,MAEA,SAAA,EAAA,GACA,OAAA,IAAA,EAAA,EAAA,IAEA,EAAA,oBAAA,EAAA,aAEA,SAAA,GACA,OAAA,IAAA,EAAA,KAbA,EAAA,aAAA,EAAA,oBAAA;;AC9YA,aACA,OAAA,QAAA,EAEA,IAEA,EAFA,EAAA,QAAA,kBAIA,EAAA,EAAA,SACA,EAAA,EAAA,OACA,EAAA,EAAA,KAWA,SAAA,EAAA,EAAA,EAAA,GAMA,KAAA,GAAA,EAMA,KAAA,IAAA,EAMA,KAAA,UAAA,EAMA,KAAA,IAAA,EAIA,SAAA,KAUA,SAAA,EAAA,GAMA,KAAA,KAAA,EAAA,KAMA,KAAA,KAAA,EAAA,KAMA,KAAA,IAAA,EAAA,IAMA,KAAA,KAAA,EAAA,OAQA,SAAA,IAMA,KAAA,IAAA,EAMA,KAAA,KAAA,IAAA,EAAA,EAAA,EAAA,GAMA,KAAA,KAAA,KAAA,KAMA,KAAA,OAAA,KAqDA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,IAAA,EAGA,SAAA,EAAA,EAAA,EAAA,GACA,KAAA,EAAA,KACA,EAAA,KAAA,IAAA,EAAA,IACA,KAAA,EAEA,EAAA,GAAA,EAYA,SAAA,EAAA,EAAA,GACA,KAAA,IAAA,EACA,KAAA,UAAA,EACA,KAAA,IAAA,EA8CA,SAAA,EAAA,EAAA,EAAA,GACA,KAAA,EAAA,IACA,EAAA,KAAA,IAAA,EAAA,GAAA,IACA,EAAA,IAAA,EAAA,KAAA,EAAA,EAAA,IAAA,MAAA,EACA,EAAA,MAAA,EAEA,KAAA,EAAA,GAAA,KACA,EAAA,KAAA,IAAA,EAAA,GAAA,IACA,EAAA,GAAA,EAAA,KAAA,EAEA,EAAA,KAAA,EAAA,GA2CA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,IAAA,EACA,EAAA,EAAA,GAAA,IAAA,EAAA,IACA,EAAA,EAAA,GAAA,IAAA,GAAA,IACA,EAAA,EAAA,GAAA,IAAA,GAtKA,EAAA,OAAA,EAAA,OACA,WACA,OAAA,EAAA,OAAA,WACA,OAAA,IAAA,OAIA,WACA,OAAA,IAAA,GAQA,EAAA,MAAA,SAAA,GACA,OAAA,IAAA,EAAA,MAAA,IAKA,EAAA,QAAA,QACA,EAAA,MAAA,EAAA,KAAA,EAAA,MAAA,EAAA,MAAA,UAAA,WAUA,EAAA,UAAA,MAAA,SAAA,EAAA,EAAA,GAGA,OAFA,KAAA,KAAA,KAAA,KAAA,KAAA,IAAA,EAAA,EAAA,EAAA,GACA,KAAA,KAAA,EACA,MA8BA,EAAA,UAAA,OAAA,OAAA,EAAA,WACA,EAAA,UAAA,GAAA,EAOA,EAAA,UAAA,OAAA,SAAA,GAWA,OARA,KAAA,MAAA,KAAA,KAAA,KAAA,KAAA,KAAA,IAAA,GACA,KAAA,GACA,IAAA,EACA,EAAA,MAAA,EACA,EAAA,QAAA,EACA,EAAA,UAAA,EACA,EACA,IAAA,IACA,MASA,EAAA,UAAA,MAAA,SAAA,GACA,OAAA,EAAA,EACA,KAAA,MAAA,EAAA,GAAA,EAAA,WAAA,IACA,KAAA,OAAA,IAQA,EAAA,UAAA,OAAA,SAAA,GACA,OAAA,KAAA,QAAA,GAAA,EAAA,GAAA,MAAA,IAsBA,EAAA,UAAA,OAAA,SAAA,GACA,IAAA,EAAA,EAAA,KAAA,GACA,OAAA,KAAA,MAAA,EAAA,EAAA,SAAA,IAUA,EAAA,UAAA,MAAA,EAAA,UAAA,OAQA,EAAA,UAAA,OAAA,SAAA,GACA,IAAA,EAAA,EAAA,KAAA,GAAA,WACA,OAAA,KAAA,MAAA,EAAA,EAAA,SAAA,IAQA,EAAA,UAAA,KAAA,SAAA,GACA,OAAA,KAAA,MAAA,EAAA,EAAA,EAAA,EAAA,IAeA,EAAA,UAAA,QAAA,SAAA,GACA,OAAA,KAAA,MAAA,EAAA,EAAA,IAAA,IASA,EAAA,UAAA,SAAA,EAAA,UAAA,QAQA,EAAA,UAAA,QAAA,SAAA,GACA,IAAA,EAAA,EAAA,KAAA,GACA,OAAA,KAAA,MAAA,EAAA,EAAA,EAAA,IAAA,MAAA,EAAA,EAAA,EAAA,KAUA,EAAA,UAAA,SAAA,EAAA,UAAA,QAQA,EAAA,UAAA,MAAA,SAAA,GACA,OAAA,KAAA,MAAA,EAAA,MAAA,aAAA,EAAA,IASA,EAAA,UAAA,OAAA,SAAA,GACA,OAAA,KAAA,MAAA,EAAA,MAAA,cAAA,EAAA,IAGA,IAAA,EAAA,EAAA,MAAA,UAAA,IACA,SAAA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,IAGA,SAAA,EAAA,EAAA,GACA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,SAAA,EACA,EAAA,EAAA,GAAA,EAAA,IAQA,EAAA,UAAA,MAAA,SAAA,GACA,IAAA,EAAA,EAAA,SAAA,EACA,IAAA,EACA,OAAA,KAAA,MAAA,EAAA,EAAA,GACA,GAAA,EAAA,SAAA,GAAA,CACA,IAAA,EAAA,EAAA,MAAA,EAAA,EAAA,OAAA,IACA,EAAA,OAAA,EAAA,EAAA,GACA,EAAA,EAEA,OAAA,KAAA,OAAA,GAAA,MAAA,EAAA,EAAA,IAQA,EAAA,UAAA,OAAA,SAAA,GACA,IAAA,EAAA,EAAA,OAAA,GACA,OAAA,EACA,KAAA,OAAA,GAAA,MAAA,EAAA,MAAA,EAAA,GACA,KAAA,MAAA,EAAA,EAAA,IAQA,EAAA,UAAA,KAAA,WAIA,OAHA,KAAA,OAAA,IAAA,EAAA,MACA,KAAA,KAAA,KAAA,KAAA,IAAA,EAAA,EAAA,EAAA,GACA,KAAA,IAAA,EACA,MAOA,EAAA,UAAA,MAAA,WAUA,OATA,KAAA,QACA,KAAA,KAAA,KAAA,OAAA,KACA,KAAA,KAAA,KAAA,OAAA,KACA,KAAA,IAAA,KAAA,OAAA,IACA,KAAA,OAAA,KAAA,OAAA,OAEA,KAAA,KAAA,KAAA,KAAA,IAAA,EAAA,EAAA,EAAA,GACA,KAAA,IAAA,GAEA,MAOA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,KACA,EAAA,KAAA,KACA,EAAA,KAAA,IAOA,OANA,KAAA,QAAA,OAAA,GACA,IACA,KAAA,KAAA,KAAA,EAAA,KACA,KAAA,KAAA,EACA,KAAA,KAAA,GAEA,MAOA,EAAA,UAAA,OAAA,WAIA,IAHA,IAAA,EAAA,KAAA,KAAA,KACA,EAAA,KAAA,YAAA,MAAA,KAAA,KACA,EAAA,EACA,GACA,EAAA,GAAA,EAAA,IAAA,EAAA,GACA,GAAA,EAAA,IACA,EAAA,EAAA,KAGA,OAAA,GAGA,EAAA,WAAA,SAAA,GACA,EAAA;;;ACzcA,aACA,OAAA,QAAA,EAGA,IAAA,EAAA,QAAA,aACA,EAAA,UAAA,OAAA,OAAA,EAAA,YAAA,YAAA,EAEA,IAAA,EAAA,QAAA,kBAEA,EAAA,EAAA,OAQA,SAAA,IACA,EAAA,KAAA,MAQA,EAAA,MAAA,SAAA,GACA,OAAA,EAAA,MAAA,EAAA,qBAAA,IAGA,IAAA,EAAA,GAAA,EAAA,qBAAA,YAAA,QAAA,EAAA,UAAA,IAAA,KACA,SAAA,EAAA,EAAA,GACA,EAAA,IAAA,EAAA,IAIA,SAAA,EAAA,EAAA,GACA,GAAA,EAAA,KACA,EAAA,KAAA,EAAA,EAAA,EAAA,EAAA,aACA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,QACA,EAAA,KAAA,EAAA,MAgBA,SAAA,EAAA,EAAA,EAAA,GACA,EAAA,OAAA,GACA,EAAA,KAAA,MAAA,EAAA,EAAA,GAEA,EAAA,UAAA,EAAA,GAdA,EAAA,UAAA,MAAA,SAAA,GACA,EAAA,SAAA,KACA,EAAA,EAAA,aAAA,EAAA,WACA,IAAA,EAAA,EAAA,SAAA,EAIA,OAHA,KAAA,OAAA,GACA,GACA,KAAA,MAAA,EAAA,EAAA,GACA,MAaA,EAAA,UAAA,OAAA,SAAA,GACA,IAAA,EAAA,EAAA,WAAA,GAIA,OAHA,KAAA,OAAA,GACA,GACA,KAAA,MAAA,EAAA,EAAA,GACA;;ACvEA,aACA,OAAA,QAAA,EAEA,IAEA,EAFA,EAAA,QAAA,kBAIA,EAAA,EAAA,SACA,EAAA,EAAA,KAGA,SAAA,EAAA,EAAA,GACA,OAAA,WAAA,uBAAA,EAAA,IAAA,OAAA,GAAA,GAAA,MAAA,EAAA,KASA,SAAA,EAAA,GAMA,KAAA,IAAA,EAMA,KAAA,IAAA,EAMA,KAAA,IAAA,EAAA,OAGA,IAAA,EAAA,oBAAA,WACA,SAAA,GACA,GAAA,aAAA,YAAA,MAAA,QAAA,GACA,OAAA,IAAA,EAAA,GACA,MAAA,MAAA,mBAGA,SAAA,GACA,GAAA,MAAA,QAAA,GACA,OAAA,IAAA,EAAA,GACA,MAAA,MAAA,mBAkEA,SAAA,IAEA,IAAA,EAAA,IAAA,EAAA,EAAA,GACA,EAAA,EACA,KAAA,KAAA,IAAA,KAAA,IAAA,GAaA,CACA,KAAA,EAAA,IAAA,EAAA,CAEA,GAAA,KAAA,KAAA,KAAA,IACA,MAAA,EAAA,MAGA,GADA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,OAAA,EAAA,KAAA,EACA,KAAA,IAAA,KAAA,OAAA,IACA,OAAA,EAIA,OADA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,SAAA,EAAA,KAAA,EACA,EAxBA,KAAA,EAAA,IAAA,EAGA,GADA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,OAAA,EAAA,KAAA,EACA,KAAA,IAAA,KAAA,OAAA,IACA,OAAA,EAKA,GAFA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,OAAA,MAAA,EACA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,OAAA,KAAA,EACA,KAAA,IAAA,KAAA,OAAA,IACA,OAAA,EAgBA,GAfA,EAAA,EAeA,KAAA,IAAA,KAAA,IAAA,GACA,KAAA,EAAA,IAAA,EAGA,GADA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,OAAA,EAAA,EAAA,KAAA,EACA,KAAA,IAAA,KAAA,OAAA,IACA,OAAA,OAGA,KAAA,EAAA,IAAA,EAAA,CAEA,GAAA,KAAA,KAAA,KAAA,IACA,MAAA,EAAA,MAGA,GADA,EAAA,IAAA,EAAA,IAAA,IAAA,KAAA,IAAA,KAAA,OAAA,EAAA,EAAA,KAAA,EACA,KAAA,IAAA,KAAA,OAAA,IACA,OAAA,EAIA,MAAA,MAAA,2BAkCA,SAAA,EAAA,EAAA,GACA,OAAA,EAAA,EAAA,GACA,EAAA,EAAA,IAAA,EACA,EAAA,EAAA,IAAA,GACA,EAAA,EAAA,IAAA,MAAA,EA+BA,SAAA,IAGA,GAAA,KAAA,IAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GAEA,OAAA,IAAA,EAAA,EAAA,KAAA,IAAA,KAAA,KAAA,GAAA,EAAA,KAAA,IAAA,KAAA,KAAA,IArLA,EAAA,OAAA,EAAA,OACA,SAAA,GACA,OAAA,EAAA,OAAA,SAAA,GACA,OAAA,EAAA,OAAA,SAAA,GACA,IAAA,EAAA,GAEA,EAAA,KACA,IAGA,EAEA,EAAA,UAAA,OAAA,EAAA,MAAA,UAAA,UAAA,EAAA,MAAA,UAAA,MAOA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,WACA,OAAA,WACA,GAAA,GAAA,IAAA,KAAA,IAAA,KAAA,QAAA,EAAA,KAAA,IAAA,KAAA,OAAA,IAAA,OAAA,EACA,GAAA,GAAA,GAAA,IAAA,KAAA,IAAA,KAAA,OAAA,KAAA,EAAA,KAAA,IAAA,KAAA,OAAA,IAAA,OAAA,EACA,GAAA,GAAA,GAAA,IAAA,KAAA,IAAA,KAAA,OAAA,MAAA,EAAA,KAAA,IAAA,KAAA,OAAA,IAAA,OAAA,EACA,GAAA,GAAA,GAAA,IAAA,KAAA,IAAA,KAAA,OAAA,MAAA,EAAA,KAAA,IAAA,KAAA,OAAA,IAAA,OAAA,EACA,GAAA,GAAA,GAAA,GAAA,KAAA,IAAA,KAAA,OAAA,MAAA,EAAA,KAAA,IAAA,KAAA,OAAA,IAAA,OAAA,EAGA,IAAA,KAAA,KAAA,GAAA,KAAA,IAEA,MADA,KAAA,IAAA,KAAA,IACA,EAAA,KAAA,IAEA,OAAA,GAdA,GAsBA,EAAA,UAAA,MAAA,WACA,OAAA,EAAA,KAAA,UAOA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,SACA,OAAA,IAAA,IAAA,EAAA,GAAA,GAqFA,EAAA,UAAA,KAAA,WACA,OAAA,IAAA,KAAA,UAcA,EAAA,UAAA,QAAA,WAGA,GAAA,KAAA,IAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GAEA,OAAA,EAAA,KAAA,IAAA,KAAA,KAAA,IAOA,EAAA,UAAA,SAAA,WAGA,GAAA,KAAA,IAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GAEA,OAAA,EAAA,EAAA,KAAA,IAAA,KAAA,KAAA,IAmCA,EAAA,UAAA,MAAA,WAGA,GAAA,KAAA,IAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GAEA,IAAA,EAAA,EAAA,MAAA,YAAA,KAAA,IAAA,KAAA,KAEA,OADA,KAAA,KAAA,EACA,GAQA,EAAA,UAAA,OAAA,WAGA,GAAA,KAAA,IAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GAEA,IAAA,EAAA,EAAA,MAAA,aAAA,KAAA,IAAA,KAAA,KAEA,OADA,KAAA,KAAA,EACA,GAOA,EAAA,UAAA,MAAA,WACA,IAAA,EAAA,KAAA,SACA,EAAA,KAAA,IACA,EAAA,KAAA,IAAA,EAGA,GAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GAGA,OADA,KAAA,KAAA,EACA,MAAA,QAAA,KAAA,KACA,KAAA,IAAA,MAAA,EAAA,GACA,IAAA,EACA,IAAA,KAAA,IAAA,YAAA,GACA,KAAA,OAAA,KAAA,KAAA,IAAA,EAAA,IAOA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,QACA,OAAA,EAAA,KAAA,EAAA,EAAA,EAAA,SAQA,EAAA,UAAA,KAAA,SAAA,GACA,GAAA,iBAAA,EAAA,CAEA,GAAA,KAAA,IAAA,EAAA,KAAA,IACA,MAAA,EAAA,KAAA,GACA,KAAA,KAAA,OAEA,GAEA,GAAA,KAAA,KAAA,KAAA,IACA,MAAA,EAAA,YACA,IAAA,KAAA,IAAA,KAAA,QAEA,OAAA,MAQA,EAAA,UAAA,SAAA,SAAA,GACA,OAAA,GACA,KAAA,EACA,KAAA,OACA,MACA,KAAA,EACA,KAAA,KAAA,GACA,MACA,KAAA,EACA,KAAA,KAAA,KAAA,UACA,MACA,KAAA,EACA,KAAA,IAAA,EAAA,EAAA,KAAA,WACA,KAAA,SAAA,GAEA,MACA,KAAA,EACA,KAAA,KAAA,GACA,MAGA,QACA,MAAA,MAAA,qBAAA,EAAA,cAAA,KAAA,KAEA,OAAA,MAGA,EAAA,WAAA,SAAA,GACA,EAAA,EAEA,IAAA,EAAA,EAAA,KAAA,SAAA,WACA,EAAA,MAAA,EAAA,UAAA,CAEA,MAAA,WACA,OAAA,EAAA,KAAA,MAAA,IAAA,IAGA,OAAA,WACA,OAAA,EAAA,KAAA,MAAA,IAAA,IAGA,OAAA,WACA,OAAA,EAAA,KAAA,MAAA,WAAA,IAAA,IAGA,QAAA,WACA,OAAA,EAAA,KAAA,MAAA,IAAA,IAGA,SAAA,WACA,OAAA,EAAA,KAAA,MAAA,IAAA;;AChZA,aACA,OAAA,QAAA,EAGA,IAAA,EAAA,QAAA,aACA,EAAA,UAAA,OAAA,OAAA,EAAA,YAAA,YAAA,EAEA,IAAA,EAAA,QAAA,kBASA,SAAA,EAAA,GACA,EAAA,KAAA,KAAA,GAUA,EAAA,SACA,EAAA,UAAA,OAAA,EAAA,OAAA,UAAA,OAKA,EAAA,UAAA,OAAA,WACA,IAAA,EAAA,KAAA,SACA,OAAA,KAAA,IAAA,UAAA,KAAA,IAAA,KAAA,IAAA,KAAA,IAAA,KAAA,IAAA,EAAA,KAAA;;ACnCA,aACA,OAAA,QAAA,EAEA,IAAA,EAAA,QAAA,mBAsCA,SAAA,EAAA,EAAA,EAAA,GAEA,GAAA,mBAAA,EACA,MAAA,UAAA,8BAEA,EAAA,aAAA,KAAA,MAMA,KAAA,QAAA,EAMA,KAAA,iBAAA,QAAA,GAMA,KAAA,kBAAA,QAAA,IA1DA,EAAA,UAAA,OAAA,OAAA,EAAA,aAAA,YAAA,YAAA,EAwEA,EAAA,UAAA,QAAA,SAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,IAAA,EACA,MAAA,UAAA,6BAEA,IAAA,EAAA,KACA,IAAA,EACA,OAAA,EAAA,UAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,GAAA,EAAA,QAKA,IACA,OAAA,EAAA,QACA,EACA,EAAA,EAAA,iBAAA,kBAAA,UAAA,GAAA,SACA,SAAA,EAAA,GAEA,GAAA,EAEA,OADA,EAAA,KAAA,QAAA,EAAA,GACA,EAAA,GAGA,GAAA,OAAA,EAAA,CAKA,KAAA,aAAA,GACA,IACA,EAAA,EAAA,EAAA,kBAAA,kBAAA,UAAA,GACA,MAAA,GAEA,OADA,EAAA,KAAA,QAAA,EAAA,GACA,EAAA,GAKA,OADA,EAAA,KAAA,OAAA,EAAA,GACA,EAAA,KAAA,GAdA,EAAA,KAAA,KAiBA,MAAA,GAGA,OAFA,EAAA,KAAA,QAAA,EAAA,QACA,WAAA,WAAA,EAAA,IAAA,QAnCA,WAAA,WAAA,EAAA,MAAA,mBAAA,IA6CA,EAAA,UAAA,IAAA,SAAA,GAOA,OANA,KAAA,UACA,GACA,KAAA,QAAA,KAAA,KAAA,MACA,KAAA,QAAA,KACA,KAAA,KAAA,OAAA,OAEA;;AC5IA,aAMA,IAAA,EAAA,QA6BA,EAAA,QAAA,QAAA;;ACnCA,aACA,OAAA,QAAA;;ACDA,aACA,IAAA,EAAA,QA2BA,SAAA,IACA,EAAA,OAAA,WAAA,EAAA,cACA,EAAA,KAAA,aArBA,EAAA,MAAA,UAGA,EAAA,OAAA,QAAA,YACA,EAAA,aAAA,QAAA,mBACA,EAAA,OAAA,QAAA,YACA,EAAA,aAAA,QAAA,mBAGA,EAAA,KAAA,QAAA,kBACA,EAAA,IAAA,QAAA,SACA,EAAA,MAAA,QAAA,WACA,EAAA,UAAA,EAaA,EAAA,OAAA,WAAA,EAAA,cACA;;ACjCA,aACA,OAAA,QAAA,QAAA;;ACKA,aAEA,IAAIA,EAAYC,QAAQ,sBAGpBC,EAAUF,EAAUG,OACtBC,EAAUJ,EAAUK,OACpBC,EAAQN,EAAUO,KAGhBC,EAAQR,EAAUS,MAAV,UAA+BT,EAAUS,MAAV,QAA6B,IAExED,EAAME,UAAa,WAMbA,IAQEC,EARFD,EAAY,GAy7GTA,OAv7GPA,EAAUC,WAMJA,EAAW,IAENC,QAAW,WA6BTA,SAAAA,EAAQC,GAQXA,GAPCC,KAAAA,WAAa,GACbC,KAAAA,OAAS,GACTC,KAAAA,QAAU,GACVC,KAAAA,SAAW,GACX,KAAL,SAAmB,GACdC,KAAAA,YAAc,GACdC,KAAAA,QAAU,GACXN,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KA80BhEV,OAr0BPA,EAAQY,UAAUV,WAAaR,EAAMmB,WAQrCb,EAAQY,UAAUT,OAAST,EAAMmB,WAQjCb,EAAQY,UAAUR,QAAUV,EAAMmB,WAQlCb,EAAQY,UAAUP,SAAWX,EAAMmB,WAQnCb,EAAQY,UAAR,SAAgClB,EAAMmB,WAQtCb,EAAQY,UAAUN,YAAcZ,EAAMmB,WAQtCb,EAAQY,UAAUE,WAAapB,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ/EhB,EAAQY,UAAUK,WAAavB,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ/EhB,EAAQY,UAAUM,UAAYxB,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ9EhB,EAAQY,UAAUO,cAAgBzB,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQlFhB,EAAQY,UAAUQ,WAAa,KAQ/BpB,EAAQY,UAAUS,OAAS3B,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ3EhB,EAAQY,UAAUL,QAAUb,EAAMmB,WAQlCb,EAAQY,UAAUU,kBAAoB5B,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAUtFhB,EAAQuB,OAAS,SAAgBtB,GACxB,OAAA,IAAID,EAAQC,IAYrBD,EAAQwB,OAAS,SAAgBC,EAASC,GAEpCD,GADCC,IAAQA,EAASlC,EAAQ+B,UACJ,MAAtBE,EAAQvB,YAAsBuB,EAAQvB,WAAWS,OACnD,IAAK,IAAID,EAAI,EAAGA,EAAIe,EAAQvB,WAAWS,SAAUD,EAC/Cd,EAAME,UAAUC,SAAS4B,UAAUH,OACjCC,EAAQvB,WAAWQ,GACnBgB,EAAOE,OAAP,IAA0CC,QAC1CC,SACFL,GAAkB,MAAlBA,EAAQtB,QAAkBsB,EAAQtB,OAAOQ,OAC3C,IAASD,EAAI,EAAGA,EAAIe,EAAQtB,OAAOQ,SAAUD,EAC3Cd,EAAME,UAAUC,SAASgC,OAAOP,OAC9BC,EAAQtB,OAAOO,GACfgB,EAAOE,OAAP,IAA0CC,QAC1CC,SACFL,GAAmB,MAAnBA,EAAQrB,SAAmBqB,EAAQrB,QAAQO,OAC7C,IAASD,EAAI,EAAGA,EAAIe,EAAQrB,QAAQO,SAAUD,EAC5Cd,EAAME,UAAUC,SAASiC,QAAQR,OAC/BC,EAAQrB,QAAQM,GAChBgB,EAAOE,OAAP,IAA0CC,QAC1CC,SACFL,GAAoB,MAApBA,EAAQpB,UAAoBoB,EAAQpB,SAASM,OAC/C,IAASD,EAAI,EAAGA,EAAIe,EAAQpB,SAASM,SAAUD,EAC7Cd,EAAME,UAAUC,SAASkC,SAAST,OAChCC,EAAQpB,SAASK,GACjBgB,EAAOE,OAAP,IAA0CC,QAC1CC,SACFL,GAAuB,MAAvBA,EAAO,UAAwBA,EAAO,SAAad,OACrD,IAASD,EAAI,EAAGA,EAAIe,EAAO,SAAad,SAAUD,EAChDd,EAAME,UAAUC,SAASmC,SAASV,OAChCC,EAAO,SAAaf,GACpBgB,EAAOE,OAAP,IAA0CC,QAC1CC,SACFL,GAAuB,MAAvBA,EAAQnB,aAAuBmB,EAAQnB,YAAYK,OACrD,IAASD,EAAI,EAAGA,EAAIe,EAAQnB,YAAYK,SAAUD,EAChDgB,EAAOE,OAAP,IAA0CO,OAAOV,EAAQnB,YAAYI,IAgBrEe,GAfsB,MAAtBA,EAAQX,YAAsBW,EAAQW,eAAe,eACvDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQX,YAChC,MAAtBW,EAAQR,YAAsBQ,EAAQW,eAAe,eACvDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQR,YACjC,MAArBQ,EAAQP,WAAqBO,EAAQW,eAAe,cACtDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQP,WAC7B,MAAzBO,EAAQN,eAAyBM,EAAQW,eAAe,kBAC1DV,EAAOE,OAAP,IAA2CS,MAAMZ,EAAQN,eACjC,MAAtBM,EAAQL,YAAsBK,EAAQW,eAAe,eACvDxC,EAAME,UAAUC,SAAS4B,UAAUH,OACjCC,EAAQL,WACRM,EAAOE,OAAP,IAA2CC,QAC3CC,SACkB,MAAlBL,EAAQJ,QAAkBI,EAAQW,eAAe,WACnDV,EAAOE,OAAP,IAA2CS,MAAMZ,EAAQJ,QACpC,MAAnBI,EAAQlB,SAAmBkB,EAAQlB,QAAQI,OAAQ,CAEhD,IADLe,EAAOE,OAAP,KAA4CC,OACnCnB,EAAI,EAAGA,EAAIe,EAAQlB,QAAQI,SAAUD,EAAGgB,EAAOW,MAAMZ,EAAQlB,QAAQG,IAC9EgB,EAAOI,SAIFJ,OAF0B,MAA7BD,EAAQH,mBAA6BG,EAAQW,eAAe,sBAC9DV,EAAOE,OAAP,KAA4CS,MAAMZ,EAAQH,mBACrDI,GAYT1B,EAAQsC,gBAAkB,SAAyBb,EAASC,GACnD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActC9B,EAAQuC,OAAS,SAAgBC,EAAQ7B,GACjC6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAASC,QAClCwC,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACGpB,EAAQvB,YAAcuB,EAAQvB,WAAWS,SAASc,EAAQvB,WAAa,IAC7EuB,EAAQvB,WAAW4C,KACjBlD,EAAME,UAAUC,SAAS4B,UAAUY,OAAOC,EAAQA,EAAOZ,WAE3D,MACG,KAAA,EACGH,EAAQtB,QAAUsB,EAAQtB,OAAOQ,SAASc,EAAQtB,OAAS,IACjEsB,EAAQtB,OAAO2C,KAAKlD,EAAME,UAAUC,SAASgC,OAAOQ,OAAOC,EAAQA,EAAOZ,WAC1E,MACG,KAAA,EACGH,EAAQrB,SAAWqB,EAAQrB,QAAQO,SAASc,EAAQrB,QAAU,IACpEqB,EAAQrB,QAAQ0C,KAAKlD,EAAME,UAAUC,SAASiC,QAAQO,OAAOC,EAAQA,EAAOZ,WAC5E,MACG,KAAA,EACGH,EAAQpB,UAAYoB,EAAQpB,SAASM,SAASc,EAAQpB,SAAW,IACvEoB,EAAQpB,SAASyC,KACflD,EAAME,UAAUC,SAASkC,SAASM,OAAOC,EAAQA,EAAOZ,WAE1D,MACG,KAAA,EACGH,EAAO,UAAgBA,EAAO,SAAad,SAASc,EAAO,SAAe,IAChFA,EAAO,SAAaqB,KAClBlD,EAAME,UAAUC,SAASmC,SAASK,OAAOC,EAAQA,EAAOZ,WAE1D,MACG,KAAA,EACGH,EAAQnB,aAAemB,EAAQnB,YAAYK,SAASc,EAAQnB,YAAc,IAChFmB,EAAQnB,YAAYwC,KAAKN,EAAOL,UAChC,MACG,KAAA,EACHV,EAAQX,WAAa0B,EAAOH,QAC5B,MACG,KAAA,EACHZ,EAAQR,WAAauB,EAAOH,QAC5B,MACG,KAAA,EACHZ,EAAQP,UAAYsB,EAAOH,QAC3B,MACG,KAAA,GACHZ,EAAQN,cAAgBqB,EAAOH,QAC/B,MACG,KAAA,GACHZ,EAAQL,WAAaxB,EAAME,UAAUC,SAAS4B,UAAUY,OACtDC,EACAA,EAAOZ,UAET,MACG,KAAA,GACHH,EAAQJ,OAASmB,EAAOH,QACxB,MACG,KAAA,GAEC,GADEZ,EAAQlB,SAAWkB,EAAQlB,QAAQI,SAASc,EAAQlB,QAAU,IAClD,IAAP,EAANsC,GAEIL,IADHO,IAAAA,EAAOP,EAAOZ,SAAWY,EAAOI,IAC7BJ,EAAOI,IAAMG,GAAMtB,EAAQlB,QAAQuC,KAAKN,EAAOH,cACjDZ,EAAQlB,QAAQuC,KAAKN,EAAOH,SACnC,MACG,KAAA,GACHZ,EAAQH,kBAAoBkB,EAAOH,QACnC,MACF,QACEG,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTzB,EAAQiD,gBAAkB,SAAyBT,GAE1C,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpC5B,EAAQkD,OAAS,SAAgBzB,GAC3B,GAAmB,iBAAZA,GAAoC,OAAZA,EAAkB,MAAO,kBACxDA,GAAsB,MAAtBA,EAAQvB,YAAsBuB,EAAQW,eAAe,cAAe,CAClE,IAACe,MAAMC,QAAQ3B,EAAQvB,YAAa,MAAO,6BAC1C,IAAA,IAAIQ,EAAI,EAAGA,EAAIe,EAAQvB,WAAWS,SAAUD,EAE3C2C,GADAA,EAAQzD,EAAME,UAAUC,SAAS4B,UAAUuB,OAAOzB,EAAQvB,WAAWQ,IAC9D,MAAO,cAAgB2C,EAGlC5B,GAAkB,MAAlBA,EAAQtB,QAAkBsB,EAAQW,eAAe,UAAW,CAC1D,IAACe,MAAMC,QAAQ3B,EAAQtB,QAAS,MAAO,yBACtC,IAAIO,EAAI,EAAGA,EAAIe,EAAQtB,OAAOQ,SAAUD,EAEvC2C,GADAA,EAAQzD,EAAME,UAAUC,SAASgC,OAAOmB,OAAOzB,EAAQtB,OAAOO,IACvD,MAAO,UAAY2C,EAG9B5B,GAAmB,MAAnBA,EAAQrB,SAAmBqB,EAAQW,eAAe,WAAY,CAC5D,IAACe,MAAMC,QAAQ3B,EAAQrB,SAAU,MAAO,0BACvC,IAAIM,EAAI,EAAGA,EAAIe,EAAQrB,QAAQO,SAAUD,EAExC2C,GADAA,EAAQzD,EAAME,UAAUC,SAASiC,QAAQkB,OAAOzB,EAAQrB,QAAQM,IACzD,MAAO,WAAa2C,EAG/B5B,GAAoB,MAApBA,EAAQpB,UAAoBoB,EAAQW,eAAe,YAAa,CAC9D,IAACe,MAAMC,QAAQ3B,EAAQpB,UAAW,MAAO,2BACxC,IAAIK,EAAI,EAAGA,EAAIe,EAAQpB,SAASM,SAAUD,EAEzC2C,GADAA,EAAQzD,EAAME,UAAUC,SAASkC,SAASiB,OAAOzB,EAAQpB,SAASK,IAC3D,MAAO,YAAc2C,EAGhC5B,GAAuB,MAAvBA,EAAO,UAAwBA,EAAQW,eAAe,YAAa,CACjE,IAACe,MAAMC,QAAQ3B,EAAO,UAAe,MAAO,2BAC3C,IAAIf,EAAI,EAAGA,EAAIe,EAAO,SAAad,SAAUD,EAE5C2C,GADAA,EAAQzD,EAAME,UAAUC,SAASmC,SAASgB,OAAOzB,EAAO,SAAaf,IAC9D,MAAO,YAAc2C,EAGhC5B,GAAuB,MAAvBA,EAAQnB,aAAuBmB,EAAQW,eAAe,eAAgB,CACpE,IAACe,MAAMC,QAAQ3B,EAAQnB,aAAc,MAAO,8BAC3C,IAAII,EAAI,EAAGA,EAAIe,EAAQnB,YAAYK,SAAUD,EAChD,IAAKhB,EAAM4D,SAAS7B,EAAQnB,YAAYI,IAAK,MAAO,iCAEpDe,GAAsB,MAAtBA,EAAQX,YAAsBW,EAAQW,eAAe,iBAEpD1C,EAAM6D,UAAU9B,EAAQX,aAEvBW,EAAQX,YACRpB,EAAM6D,UAAU9B,EAAQX,WAAW0C,MACnC9D,EAAM6D,UAAU9B,EAAQX,WAAW2C,OAGrC,MAAO,oCACPhC,GAAsB,MAAtBA,EAAQR,YAAsBQ,EAAQW,eAAe,iBAEpD1C,EAAM6D,UAAU9B,EAAQR,aAEvBQ,EAAQR,YACRvB,EAAM6D,UAAU9B,EAAQR,WAAWuC,MACnC9D,EAAM6D,UAAU9B,EAAQR,WAAWwC,OAGrC,MAAO,oCACPhC,GAAqB,MAArBA,EAAQP,WAAqBO,EAAQW,eAAe,gBAEnD1C,EAAM6D,UAAU9B,EAAQP,YAEvBO,EAAQP,WACRxB,EAAM6D,UAAU9B,EAAQP,UAAUsC,MAClC9D,EAAM6D,UAAU9B,EAAQP,UAAUuC,OAGpC,MAAO,mCACPhC,GAAyB,MAAzBA,EAAQN,eAAyBM,EAAQW,eAAe,oBAEvD1C,EAAM6D,UAAU9B,EAAQN,gBAEvBM,EAAQN,eACRzB,EAAM6D,UAAU9B,EAAQN,cAAcqC,MACtC9D,EAAM6D,UAAU9B,EAAQN,cAAcsC,OAGxC,MAAO,uCAELJ,IAAAA,EADF5B,GAAsB,MAAtBA,EAAQL,YAAsBK,EAAQW,eAAe,gBACnDiB,EAAQzD,EAAME,UAAUC,SAAS4B,UAAUuB,OAAOzB,EAAQL,aACnD,MAAO,cAAgBiC,EAEhC5B,GAAkB,MAAlBA,EAAQJ,QAAkBI,EAAQW,eAAe,aAEhD1C,EAAM6D,UAAU9B,EAAQJ,SAEvBI,EAAQJ,QACR3B,EAAM6D,UAAU9B,EAAQJ,OAAOmC,MAC/B9D,EAAM6D,UAAU9B,EAAQJ,OAAOoC,OAGjC,MAAO,gCACPhC,GAAmB,MAAnBA,EAAQlB,SAAmBkB,EAAQW,eAAe,WAAY,CAC5D,IAACe,MAAMC,QAAQ3B,EAAQlB,SAAU,MAAO,0BACvC,IAAIG,EAAI,EAAGA,EAAIe,EAAQlB,QAAQI,SAAUD,EAC5C,KACGhB,EAAM6D,UAAU9B,EAAQlB,QAAQG,KAE/Be,EAAQlB,QAAQG,IAChBhB,EAAM6D,UAAU9B,EAAQlB,QAAQG,GAAG8C,MACnC9D,EAAM6D,UAAU9B,EAAQlB,QAAQG,GAAG+C,OAGrC,MAAO,mCAEThC,OAA6B,MAA7BA,EAAQH,mBAA6BG,EAAQW,eAAe,wBAE3D1C,EAAM6D,UAAU9B,EAAQH,oBAEvBG,EAAQH,mBACR5B,EAAM6D,UAAU9B,EAAQH,kBAAkBkC,MAC1C9D,EAAM6D,UAAU9B,EAAQH,kBAAkBmC,OAGrC,2CACJ,MAWTzD,EAAQ0D,WAAa,SAAoBC,GACnCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAASC,QAAS,OAAO2D,EAC3DlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAASC,QACvC2D,GAAAA,EAAOzD,WAAY,CACjB,IAACiD,MAAMC,QAAQO,EAAOzD,YACxB,MAAM0D,UAAU,0DAClBnC,EAAQvB,WAAa,GAChB,IAAA,IAAIQ,EAAI,EAAGA,EAAIiD,EAAOzD,WAAWS,SAAUD,EAAG,CAC7C,GAAgC,iBAAzBiD,EAAOzD,WAAWQ,GAC3B,MAAMkD,UAAU,2DAClBnC,EAAQvB,WAAWQ,GAAKd,EAAME,UAAUC,SAAS4B,UAAU+B,WACzDC,EAAOzD,WAAWQ,KAIpBiD,GAAAA,EAAOxD,OAAQ,CACb,IAACgD,MAAMC,QAAQO,EAAOxD,QACxB,MAAMyD,UAAU,sDAEb,IADLnC,EAAQtB,OAAS,GACRO,EAAI,EAAGA,EAAIiD,EAAOxD,OAAOQ,SAAUD,EAAG,CACzC,GAA4B,iBAArBiD,EAAOxD,OAAOO,GACvB,MAAMkD,UAAU,uDAClBnC,EAAQtB,OAAOO,GAAKd,EAAME,UAAUC,SAASgC,OAAO2B,WAAWC,EAAOxD,OAAOO,KAG7EiD,GAAAA,EAAOvD,QAAS,CACd,IAAC+C,MAAMC,QAAQO,EAAOvD,SACxB,MAAMwD,UAAU,uDAEb,IADLnC,EAAQrB,QAAU,GACTM,EAAI,EAAGA,EAAIiD,EAAOvD,QAAQO,SAAUD,EAAG,CAC1C,GAA6B,iBAAtBiD,EAAOvD,QAAQM,GACxB,MAAMkD,UAAU,wDAClBnC,EAAQrB,QAAQM,GAAKd,EAAME,UAAUC,SAASiC,QAAQ0B,WAAWC,EAAOvD,QAAQM,KAGhFiD,GAAAA,EAAOtD,SAAU,CACf,IAAC8C,MAAMC,QAAQO,EAAOtD,UACxB,MAAMuD,UAAU,wDAEb,IADLnC,EAAQpB,SAAW,GACVK,EAAI,EAAGA,EAAIiD,EAAOtD,SAASM,SAAUD,EAAG,CAC3C,GAA8B,iBAAvBiD,EAAOtD,SAASK,GACzB,MAAMkD,UAAU,yDAClBnC,EAAQpB,SAASK,GAAKd,EAAME,UAAUC,SAASkC,SAASyB,WAAWC,EAAOtD,SAASK,KAGnFiD,GAAAA,EAAM,SAAc,CAClB,IAACR,MAAMC,QAAQO,EAAM,UACvB,MAAMC,UAAU,wDAEb,IADLnC,EAAO,SAAe,GACbf,EAAI,EAAGA,EAAIiD,EAAM,SAAahD,SAAUD,EAAG,CAC9C,GAAiC,iBAA1BiD,EAAM,SAAajD,GAC5B,MAAMkD,UAAU,yDAClBnC,EAAO,SAAaf,GAAKd,EAAME,UAAUC,SAASmC,SAASwB,WACzDC,EAAM,SAAajD,KAIrBiD,GAAAA,EAAOrD,YAAa,CAClB,IAAC6C,MAAMC,QAAQO,EAAOrD,aACxB,MAAMsD,UAAU,2DAEb,IADLnC,EAAQnB,YAAc,GACbI,EAAI,EAAGA,EAAIiD,EAAOrD,YAAYK,SAAUD,EAC/Ce,EAAQnB,YAAYI,GAAKmD,OAAOF,EAAOrD,YAAYI,IA+CnDiD,GA7CqB,MAArBA,EAAO7C,aACLpB,EAAMqB,MACPU,EAAQX,WAAapB,EAAMqB,KAAK+C,UAAUH,EAAO7C,aAAaiD,UAAW,EACtC,iBAAtBJ,EAAO7C,WACrBW,EAAQX,WAAakD,SAASL,EAAO7C,WAAY,IACb,iBAAtB6C,EAAO7C,WAAyBW,EAAQX,WAAa6C,EAAO7C,WACtC,iBAAtB6C,EAAO7C,aACrBW,EAAQX,WAAa,IAAIpB,EAAMuE,SAC7BN,EAAO7C,WAAW0C,MAAQ,EAC1BG,EAAO7C,WAAW2C,OAAS,GAC3BS,aACmB,MAArBP,EAAO1C,aACLvB,EAAMqB,MACPU,EAAQR,WAAavB,EAAMqB,KAAK+C,UAAUH,EAAO1C,aAAa8C,UAAW,EACtC,iBAAtBJ,EAAO1C,WACrBQ,EAAQR,WAAa+C,SAASL,EAAO1C,WAAY,IACb,iBAAtB0C,EAAO1C,WAAyBQ,EAAQR,WAAa0C,EAAO1C,WACtC,iBAAtB0C,EAAO1C,aACrBQ,EAAQR,WAAa,IAAIvB,EAAMuE,SAC7BN,EAAO1C,WAAWuC,MAAQ,EAC1BG,EAAO1C,WAAWwC,OAAS,GAC3BS,aACkB,MAApBP,EAAOzC,YACLxB,EAAMqB,MACPU,EAAQP,UAAYxB,EAAMqB,KAAK+C,UAAUH,EAAOzC,YAAY6C,UAAW,EACrC,iBAArBJ,EAAOzC,UACrBO,EAAQP,UAAY8C,SAASL,EAAOzC,UAAW,IACZ,iBAArByC,EAAOzC,UAAwBO,EAAQP,UAAYyC,EAAOzC,UACrC,iBAArByC,EAAOzC,YACrBO,EAAQP,UAAY,IAAIxB,EAAMuE,SAC5BN,EAAOzC,UAAUsC,MAAQ,EACzBG,EAAOzC,UAAUuC,OAAS,GAC1BS,aACsB,MAAxBP,EAAOxC,gBACLzB,EAAMqB,MACPU,EAAQN,cAAgBzB,EAAMqB,KAAK+C,UAAUH,EAAOxC,gBAAgB4C,UAAW,EACzC,iBAAzBJ,EAAOxC,cACrBM,EAAQN,cAAgB6C,SAASL,EAAOxC,cAAe,IAChB,iBAAzBwC,EAAOxC,cACrBM,EAAQN,cAAgBwC,EAAOxC,cACQ,iBAAzBwC,EAAOxC,gBACrBM,EAAQN,cAAgB,IAAIzB,EAAMuE,SAChCN,EAAOxC,cAAcqC,MAAQ,EAC7BG,EAAOxC,cAAcsC,OAAS,GAC9BS,aACmB,MAArBP,EAAOvC,WAAoB,CACzB,GAA6B,iBAAtBuC,EAAOvC,WAChB,MAAMwC,UAAU,2DAClBnC,EAAQL,WAAaxB,EAAME,UAAUC,SAAS4B,UAAU+B,WAAWC,EAAOvC,YAWxEuC,GATiB,MAAjBA,EAAOtC,SACL3B,EAAMqB,MAAOU,EAAQJ,OAAS3B,EAAMqB,KAAK+C,UAAUH,EAAOtC,SAAS0C,UAAW,EAChD,iBAAlBJ,EAAOtC,OAAqBI,EAAQJ,OAAS2C,SAASL,EAAOtC,OAAQ,IACnD,iBAAlBsC,EAAOtC,OAAqBI,EAAQJ,OAASsC,EAAOtC,OAClC,iBAAlBsC,EAAOtC,SACrBI,EAAQJ,OAAS,IAAI3B,EAAMuE,SACzBN,EAAOtC,OAAOmC,MAAQ,EACtBG,EAAOtC,OAAOoC,OAAS,GACvBS,aACFP,EAAOpD,QAAS,CACd,IAAC4C,MAAMC,QAAQO,EAAOpD,SACxB,MAAMqD,UAAU,uDAEb,IADLnC,EAAQlB,QAAU,GACTG,EAAI,EAAGA,EAAIiD,EAAOpD,QAAQI,SAAUD,EACvChB,EAAMqB,MACPU,EAAQlB,QAAQG,GAAKhB,EAAMqB,KAAK+C,UAAUH,EAAOpD,QAAQG,KAAKqD,UAAW,EACtC,iBAAtBJ,EAAOpD,QAAQG,GAC7Be,EAAQlB,QAAQG,GAAKsD,SAASL,EAAOpD,QAAQG,GAAI,IACb,iBAAtBiD,EAAOpD,QAAQG,GAAiBe,EAAQlB,QAAQG,GAAKiD,EAAOpD,QAAQG,GAC9C,iBAAtBiD,EAAOpD,QAAQG,KAC7Be,EAAQlB,QAAQG,GAAK,IAAIhB,EAAMuE,SAC7BN,EAAOpD,QAAQG,GAAG8C,MAAQ,EAC1BG,EAAOpD,QAAQG,GAAG+C,OAAS,GAC3BS,YAgBDzC,OAdyB,MAA5BkC,EAAOrC,oBACL5B,EAAMqB,MACPU,EAAQH,kBAAoB5B,EAAMqB,KAAK+C,UACtCH,EAAOrC,oBACNyC,UAAW,EAC6B,iBAA7BJ,EAAOrC,kBACrBG,EAAQH,kBAAoB0C,SAASL,EAAOrC,kBAAmB,IACpB,iBAA7BqC,EAAOrC,kBACrBG,EAAQH,kBAAoBqC,EAAOrC,kBACQ,iBAA7BqC,EAAOrC,oBACrBG,EAAQH,kBAAoB,IAAI5B,EAAMuE,SACpCN,EAAOrC,kBAAkBkC,MAAQ,EACjCG,EAAOrC,kBAAkBmC,OAAS,GAClCS,aACCzC,GAYTzB,EAAQmE,SAAW,SAAkB1C,EAAS2C,GACvCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GAUTS,IATAA,EAAQC,QAAUD,EAAQE,YAC5BX,EAAOzD,WAAa,GACpByD,EAAOxD,OAAS,GAChBwD,EAAOvD,QAAU,GACjBuD,EAAOtD,SAAW,GAClBsD,EAAM,SAAe,GACrBA,EAAOrD,YAAc,GACrBqD,EAAOpD,QAAU,IAEf6D,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO7C,WACLsD,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAO7C,WAAasD,EAAQI,QAAUX,OAAS,IAAM,EACxDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO1C,WACLmD,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO1C,WAAamD,EAAQI,QAAUX,OAAS,IAAM,EACxDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOzC,UACLkD,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOzC,UAAYkD,EAAQI,QAAUX,OAAS,IAAM,EACvDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOxC,cACLiD,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOxC,cAAgBiD,EAAQI,QAAUX,OAAS,IAAM,EAC/DF,EAAOvC,WAAa,KAChB1B,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOtC,OACL+C,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOtC,OAAS+C,EAAQI,QAAUX,OAAS,IAAM,EACpDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOrC,kBACL8C,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOrC,kBAAoB8C,EAAQI,QAAUX,OAAS,IAAM,EAEjEpC,GAAAA,EAAQvB,YAAcuB,EAAQvB,WAAWS,OAAQ,CACnDgD,EAAOzD,WAAa,GACf,IAAA,IAAIyE,EAAI,EAAGA,EAAIlD,EAAQvB,WAAWS,SAAUgE,EAC/ChB,EAAOzD,WAAWyE,GAAK/E,EAAME,UAAUC,SAAS4B,UAAUwC,SACxD1C,EAAQvB,WAAWyE,GACnBP,GAGF3C,GAAAA,EAAQtB,QAAUsB,EAAQtB,OAAOQ,OAE9B,IADLgD,EAAOxD,OAAS,GACPwE,EAAI,EAAGA,EAAIlD,EAAQtB,OAAOQ,SAAUgE,EAC3ChB,EAAOxD,OAAOwE,GAAK/E,EAAME,UAAUC,SAASgC,OAAOoC,SAAS1C,EAAQtB,OAAOwE,GAAIP,GAE/E3C,GAAAA,EAAQrB,SAAWqB,EAAQrB,QAAQO,OAEhC,IADLgD,EAAOvD,QAAU,GACRuE,EAAI,EAAGA,EAAIlD,EAAQrB,QAAQO,SAAUgE,EAC5ChB,EAAOvD,QAAQuE,GAAK/E,EAAME,UAAUC,SAASiC,QAAQmC,SACnD1C,EAAQrB,QAAQuE,GAChBP,GAGF3C,GAAAA,EAAQpB,UAAYoB,EAAQpB,SAASM,OAElC,IADLgD,EAAOtD,SAAW,GACTsE,EAAI,EAAGA,EAAIlD,EAAQpB,SAASM,SAAUgE,EAC7ChB,EAAOtD,SAASsE,GAAK/E,EAAME,UAAUC,SAASkC,SAASkC,SACrD1C,EAAQpB,SAASsE,GACjBP,GAGF3C,GAAAA,EAAO,UAAgBA,EAAO,SAAad,OAExC,IADLgD,EAAM,SAAe,GACZgB,EAAI,EAAGA,EAAIlD,EAAO,SAAad,SAAUgE,EAChDhB,EAAM,SAAagB,GAAK/E,EAAME,UAAUC,SAASmC,SAASiC,SACxD1C,EAAO,SAAakD,GACpBP,GAGF3C,GAAAA,EAAQnB,aAAemB,EAAQnB,YAAYK,OAExC,IADLgD,EAAOrD,YAAc,GACZqE,EAAI,EAAGA,EAAIlD,EAAQnB,YAAYK,SAAUgE,EAChDhB,EAAOrD,YAAYqE,GAAKlD,EAAQnB,YAAYqE,GA4E5ClD,GA1EsB,MAAtBA,EAAQX,YAAsBW,EAAQW,eAAe,gBACrB,iBAAvBX,EAAQX,WACjB6C,EAAO7C,WACLsD,EAAQI,QAAUX,OAASA,OAAOpC,EAAQX,YAAcW,EAAQX,WAElE6C,EAAO7C,WACLsD,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQX,YAC3CsD,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQX,WAAW0C,MAAQ,EAC3B/B,EAAQX,WAAW2C,OAAS,GAC5BS,WACFzC,EAAQX,YACM,MAAtBW,EAAQR,YAAsBQ,EAAQW,eAAe,gBACrB,iBAAvBX,EAAQR,WACjB0C,EAAO1C,WACLmD,EAAQI,QAAUX,OAASA,OAAOpC,EAAQR,YAAcQ,EAAQR,WAElE0C,EAAO1C,WACLmD,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQR,YAC3CmD,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQR,WAAWuC,MAAQ,EAC3B/B,EAAQR,WAAWwC,OAAS,GAC5BS,WACFzC,EAAQR,YACK,MAArBQ,EAAQP,WAAqBO,EAAQW,eAAe,eACrB,iBAAtBX,EAAQP,UACjByC,EAAOzC,UACLkD,EAAQI,QAAUX,OAASA,OAAOpC,EAAQP,WAAaO,EAAQP,UAEjEyC,EAAOzC,UACLkD,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQP,WAC3CkD,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQP,UAAUsC,MAAQ,EAC1B/B,EAAQP,UAAUuC,OAAS,GAC3BS,WACFzC,EAAQP,WACS,MAAzBO,EAAQN,eAAyBM,EAAQW,eAAe,mBACrB,iBAA1BX,EAAQN,cACjBwC,EAAOxC,cACLiD,EAAQI,QAAUX,OAASA,OAAOpC,EAAQN,eAAiBM,EAAQN,cAErEwC,EAAOxC,cACLiD,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQN,eAC3CiD,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQN,cAAcqC,MAAQ,EAC9B/B,EAAQN,cAAcsC,OAAS,GAC/BS,WACFzC,EAAQN,eACM,MAAtBM,EAAQL,YAAsBK,EAAQW,eAAe,gBACvDuB,EAAOvC,WAAaxB,EAAME,UAAUC,SAAS4B,UAAUwC,SACrD1C,EAAQL,WACRgD,IAEkB,MAAlB3C,EAAQJ,QAAkBI,EAAQW,eAAe,YACrB,iBAAnBX,EAAQJ,OACjBsC,EAAOtC,OAAS+C,EAAQI,QAAUX,OAASA,OAAOpC,EAAQJ,QAAUI,EAAQJ,OAE5EsC,EAAOtC,OACL+C,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQJ,QAC3C+C,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQJ,OAAOmC,MAAQ,EACvB/B,EAAQJ,OAAOoC,OAAS,GACxBS,WACFzC,EAAQJ,QAChBI,EAAQlB,SAAWkB,EAAQlB,QAAQI,OAEhC,IADLgD,EAAOpD,QAAU,GACRoE,EAAI,EAAGA,EAAIlD,EAAQlB,QAAQI,SAAUgE,EACV,iBAAvBlD,EAAQlB,QAAQoE,GACzBhB,EAAOpD,QAAQoE,GACbP,EAAQI,QAAUX,OAASA,OAAOpC,EAAQlB,QAAQoE,IAAMlD,EAAQlB,QAAQoE,GAE1EhB,EAAOpD,QAAQoE,GACbP,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQlB,QAAQoE,IACnDP,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQlB,QAAQoE,GAAGnB,MAAQ,EAC3B/B,EAAQlB,QAAQoE,GAAGlB,OAAS,GAC5BS,WACFzC,EAAQlB,QAAQoE,GAkBvBhB,OAhB0B,MAA7BlC,EAAQH,mBAA6BG,EAAQW,eAAe,uBACrB,iBAA9BX,EAAQH,kBACjBqC,EAAOrC,kBACL8C,EAAQI,QAAUX,OACdA,OAAOpC,EAAQH,mBACfG,EAAQH,kBAEdqC,EAAOrC,kBACL8C,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQH,mBAC3C8C,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQH,kBAAkBkC,MAAQ,EAClC/B,EAAQH,kBAAkBmC,OAAS,GACnCS,WACFzC,EAAQH,mBACbqC,GAUT3D,EAAQY,UAAUiE,OAAS,WAClB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjD/E,EAr3BW,GAw3BpBD,EAAS4B,UAAa,WAiBXA,SAAAA,EAAU1B,GACbA,GAAAA,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KAgPhEiB,OAvOPA,EAAUf,UAAUoE,KAAOtF,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ3EW,EAAUf,UAAUqE,KAAOvF,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAU3EW,EAAUJ,OAAS,SAAgBtB,GAC1B,OAAA,IAAI0B,EAAU1B,IAYvB0B,EAAUH,OAAS,SAAgBC,EAASC,GAMnCA,OALFA,IAAQA,EAASlC,EAAQ+B,UACV,MAAhBE,EAAQuD,MAAgBvD,EAAQW,eAAe,SACjDV,EAAOE,OAAP,GAAyCS,MAAMZ,EAAQuD,MACrC,MAAhBvD,EAAQwD,MAAgBxD,EAAQW,eAAe,SACjDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQwD,MACnDvD,GAYTC,EAAUW,gBAAkB,SAAyBb,EAASC,GACrD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActCH,EAAUY,OAAS,SAAgBC,EAAQ7B,GACnC6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAAS4B,UAClCa,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACHpB,EAAQuD,KAAOxC,EAAOH,QACtB,MACG,KAAA,EACHZ,EAAQwD,KAAOzC,EAAOH,QACtB,MACF,QACEG,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTE,EAAUsB,gBAAkB,SAAyBT,GAE5C,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpCD,EAAUuB,OAAS,SAAgBzB,GAC7B,MAAmB,iBAAZA,GAAoC,OAAZA,EAAyB,kBACxC,MAAhBA,EAAQuD,MAAgBvD,EAAQW,eAAe,WAE9C1C,EAAM6D,UAAU9B,EAAQuD,OAEvBvD,EAAQuD,MACRtF,EAAM6D,UAAU9B,EAAQuD,KAAKxB,MAC7B9D,EAAM6D,UAAU9B,EAAQuD,KAAKvB,OAGxB,8BACS,MAAhBhC,EAAQwD,MAAgBxD,EAAQW,eAAe,WAE9C1C,EAAM6D,UAAU9B,EAAQwD,OAEvBxD,EAAQwD,MACRvF,EAAM6D,UAAU9B,EAAQwD,KAAKzB,MAC7B9D,EAAM6D,UAAU9B,EAAQwD,KAAKxB,OAGxB,8BACJ,MAWT9B,EAAU+B,WAAa,SAAoBC,GACrCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAAS4B,UAAW,OAAOgC,EAC7DlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAAS4B,UAmBpCF,OAlBY,MAAfkC,EAAOqB,OACLtF,EAAMqB,MAAOU,EAAQuD,KAAOtF,EAAMqB,KAAK+C,UAAUH,EAAOqB,OAAOjB,UAAW,EAC9C,iBAAhBJ,EAAOqB,KAAmBvD,EAAQuD,KAAOhB,SAASL,EAAOqB,KAAM,IAC/C,iBAAhBrB,EAAOqB,KAAmBvD,EAAQuD,KAAOrB,EAAOqB,KAChC,iBAAhBrB,EAAOqB,OACrBvD,EAAQuD,KAAO,IAAItF,EAAMuE,SACvBN,EAAOqB,KAAKxB,MAAQ,EACpBG,EAAOqB,KAAKvB,OAAS,GACrBS,aACa,MAAfP,EAAOsB,OACLvF,EAAMqB,MAAOU,EAAQwD,KAAOvF,EAAMqB,KAAK+C,UAAUH,EAAOsB,OAAOlB,UAAW,EAC9C,iBAAhBJ,EAAOsB,KAAmBxD,EAAQwD,KAAOjB,SAASL,EAAOsB,KAAM,IAC/C,iBAAhBtB,EAAOsB,KAAmBxD,EAAQwD,KAAOtB,EAAOsB,KAChC,iBAAhBtB,EAAOsB,OACrBxD,EAAQwD,KAAO,IAAIvF,EAAMuE,SACvBN,EAAOsB,KAAKzB,MAAQ,EACpBG,EAAOsB,KAAKxB,OAAS,GACrBS,aACCzC,GAYTE,EAAUwC,SAAW,SAAkB1C,EAAS2C,GACzCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GACTS,GAAAA,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOqB,KACLZ,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAOqB,KAAOZ,EAAQI,QAAUX,OAAS,IAAM,EAClDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOsB,KACLb,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOsB,KAAOb,EAAQI,QAAUX,OAAS,IAAM,EAsBjDF,OApBa,MAAhBlC,EAAQuD,MAAgBvD,EAAQW,eAAe,UACrB,iBAAjBX,EAAQuD,KACjBrB,EAAOqB,KAAOZ,EAAQI,QAAUX,OAASA,OAAOpC,EAAQuD,MAAQvD,EAAQuD,KAExErB,EAAOqB,KACLZ,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQuD,MAC3CZ,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQuD,KAAKxB,MAAQ,EAAG/B,EAAQuD,KAAKvB,OAAS,GAAGS,WACpEzC,EAAQuD,MACA,MAAhBvD,EAAQwD,MAAgBxD,EAAQW,eAAe,UACrB,iBAAjBX,EAAQwD,KACjBtB,EAAOsB,KAAOb,EAAQI,QAAUX,OAASA,OAAOpC,EAAQwD,MAAQxD,EAAQwD,KAExEtB,EAAOsB,KACLb,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQwD,MAC3Cb,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQwD,KAAKzB,MAAQ,EAAG/B,EAAQwD,KAAKxB,OAAS,GAAGS,WACpEzC,EAAQwD,MACbtB,GAUThC,EAAUf,UAAUiE,OAAS,WACpB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjDpD,EApQa,GAuQtB5B,EAASgC,OAAU,WAkBRA,SAAAA,EAAO9B,GAIVA,GAHCiF,KAAAA,WAAa,GACbC,KAAAA,MAAQ,GACRC,KAAAA,MAAQ,GACTnF,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KA0ThEqB,OAjTPA,EAAOnB,UAAUsE,WAAaxF,EAAMmB,WAQpCkB,EAAOnB,UAAUuE,MAAQzF,EAAMmB,WAQ/BkB,EAAOnB,UAAUwE,MAAQ1F,EAAMmB,WAU/BkB,EAAOR,OAAS,SAAgBtB,GACvB,OAAA,IAAI8B,EAAO9B,IAYpB8B,EAAOP,OAAS,SAAgBC,EAASC,GAEnCD,GADCC,IAAQA,EAASlC,EAAQ+B,UACJ,MAAtBE,EAAQyD,YAAsBzD,EAAQyD,WAAWvE,OAAQ,CAC3De,EAAOE,OAAP,IAA0CC,OACrC,IAAA,IAAInB,EAAI,EAAGA,EAAIe,EAAQyD,WAAWvE,SAAUD,EAAGgB,EAAO2D,OAAO5D,EAAQyD,WAAWxE,IACrFgB,EAAOI,SAELL,GAAiB,MAAjBA,EAAQ0D,OAAiB1D,EAAQ0D,MAAMxE,OAAQ,CAE5C,IADLe,EAAOE,OAAP,IAA0CC,OACjCnB,EAAI,EAAGA,EAAIe,EAAQ0D,MAAMxE,SAAUD,EAAGgB,EAAOW,MAAMZ,EAAQ0D,MAAMzE,IAC1EgB,EAAOI,SAELL,GAAiB,MAAjBA,EAAQ2D,OAAiB3D,EAAQ2D,MAAMzE,OACzC,IAASD,EAAI,EAAGA,EAAIe,EAAQ2D,MAAMzE,SAAUD,EAC1Cd,EAAME,UAAUC,SAASuF,MAAM9D,OAC7BC,EAAQ2D,MAAM1E,GACdgB,EAAOE,OAAP,IAA0CC,QAC1CC,SACCJ,OAAAA,GAYTK,EAAOO,gBAAkB,SAAyBb,EAASC,GAClD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActCC,EAAOQ,OAAS,SAAgBC,EAAQ7B,GAChC6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAASgC,OAClCS,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EAEC,GADEpB,EAAQyD,YAAczD,EAAQyD,WAAWvE,SAASc,EAAQyD,WAAa,IAC3D,IAAP,EAANrC,GAEIL,IADHO,IAAAA,EAAOP,EAAOZ,SAAWY,EAAOI,IAC7BJ,EAAOI,IAAMG,GAAMtB,EAAQyD,WAAWpC,KAAKN,EAAO6C,eACpD5D,EAAQyD,WAAWpC,KAAKN,EAAO6C,UACtC,MACG,KAAA,EAEC,GADE5D,EAAQ0D,OAAS1D,EAAQ0D,MAAMxE,SAASc,EAAQ0D,MAAQ,IAC5C,IAAP,EAANtC,GAEIL,IADHO,EAAOP,EAAOZ,SAAWY,EAAOI,IAC7BJ,EAAOI,IAAMG,GAAMtB,EAAQ0D,MAAMrC,KAAKN,EAAOH,cAC/CZ,EAAQ0D,MAAMrC,KAAKN,EAAOH,SACjC,MACG,KAAA,EACGZ,EAAQ2D,OAAS3D,EAAQ2D,MAAMzE,SAASc,EAAQ2D,MAAQ,IAC9D3D,EAAQ2D,MAAMtC,KAAKlD,EAAME,UAAUC,SAASuF,MAAM/C,OAAOC,EAAQA,EAAOZ,WACxE,MACF,QACEY,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTM,EAAOkB,gBAAkB,SAAyBT,GAEzC,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpCG,EAAOmB,OAAS,SAAgBzB,GAC1B,GAAmB,iBAAZA,GAAoC,OAAZA,EAAkB,MAAO,kBACxDA,GAAsB,MAAtBA,EAAQyD,YAAsBzD,EAAQW,eAAe,cAAe,CAClE,IAACe,MAAMC,QAAQ3B,EAAQyD,YAAa,MAAO,6BAC1C,IAAA,IAAIxE,EAAI,EAAGA,EAAIe,EAAQyD,WAAWvE,SAAUD,EAC/C,KACGhB,EAAM6D,UAAU9B,EAAQyD,WAAWxE,KAElCe,EAAQyD,WAAWxE,IACnBhB,EAAM6D,UAAU9B,EAAQyD,WAAWxE,GAAG8C,MACtC9D,EAAM6D,UAAU9B,EAAQyD,WAAWxE,GAAG+C,OAGxC,MAAO,sCAEThC,GAAiB,MAAjBA,EAAQ0D,OAAiB1D,EAAQW,eAAe,SAAU,CACxD,IAACe,MAAMC,QAAQ3B,EAAQ0D,OAAQ,MAAO,wBACrC,IAAIzE,EAAI,EAAGA,EAAIe,EAAQ0D,MAAMxE,SAAUD,EAC1C,KACGhB,EAAM6D,UAAU9B,EAAQ0D,MAAMzE,KAE7Be,EAAQ0D,MAAMzE,IACdhB,EAAM6D,UAAU9B,EAAQ0D,MAAMzE,GAAG8C,MACjC9D,EAAM6D,UAAU9B,EAAQ0D,MAAMzE,GAAG+C,OAGnC,MAAO,iCAEThC,GAAiB,MAAjBA,EAAQ2D,OAAiB3D,EAAQW,eAAe,SAAU,CACxD,IAACe,MAAMC,QAAQ3B,EAAQ2D,OAAQ,MAAO,wBACrC,IAAI1E,EAAI,EAAGA,EAAIe,EAAQ2D,MAAMzE,SAAUD,EAAG,CACzC2C,IAAAA,EAAQzD,EAAME,UAAUC,SAASuF,MAAMpC,OAAOzB,EAAQ2D,MAAM1E,IAC5D2C,GAAAA,EAAO,MAAO,SAAWA,GAG1B,OAAA,MAWTtB,EAAO2B,WAAa,SAAoBC,GAClCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAASgC,OAAQ,OAAO4B,EAC1DlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAASgC,OACvC4B,GAAAA,EAAOuB,WAAY,CACjB,IAAC/B,MAAMC,QAAQO,EAAOuB,YACxB,MAAMtB,UAAU,yDAClBnC,EAAQyD,WAAa,GAChB,IAAA,IAAIxE,EAAI,EAAGA,EAAIiD,EAAOuB,WAAWvE,SAAUD,EAC1ChB,EAAMqB,MACPU,EAAQyD,WAAWxE,GAAKhB,EAAMqB,KAAK+C,UAAUH,EAAOuB,WAAWxE,KAAKqD,UAAW,EACzC,iBAAzBJ,EAAOuB,WAAWxE,GAChCe,EAAQyD,WAAWxE,GAAKsD,SAASL,EAAOuB,WAAWxE,GAAI,IAChB,iBAAzBiD,EAAOuB,WAAWxE,GAChCe,EAAQyD,WAAWxE,GAAKiD,EAAOuB,WAAWxE,GACH,iBAAzBiD,EAAOuB,WAAWxE,KAChCe,EAAQyD,WAAWxE,GAAK,IAAIhB,EAAMuE,SAChCN,EAAOuB,WAAWxE,GAAG8C,MAAQ,EAC7BG,EAAOuB,WAAWxE,GAAG+C,OAAS,GAC9BS,UAAS,IAEbP,GAAAA,EAAOwB,MAAO,CACZ,IAAChC,MAAMC,QAAQO,EAAOwB,OACxB,MAAMvB,UAAU,oDAEb,IADLnC,EAAQ0D,MAAQ,GACPzE,EAAI,EAAGA,EAAIiD,EAAOwB,MAAMxE,SAAUD,EACrChB,EAAMqB,MACPU,EAAQ0D,MAAMzE,GAAKhB,EAAMqB,KAAK+C,UAAUH,EAAOwB,MAAMzE,KAAKqD,UAAW,EACpC,iBAApBJ,EAAOwB,MAAMzE,GAC3Be,EAAQ0D,MAAMzE,GAAKsD,SAASL,EAAOwB,MAAMzE,GAAI,IACX,iBAApBiD,EAAOwB,MAAMzE,GAAiBe,EAAQ0D,MAAMzE,GAAKiD,EAAOwB,MAAMzE,GAC1C,iBAApBiD,EAAOwB,MAAMzE,KAC3Be,EAAQ0D,MAAMzE,GAAK,IAAIhB,EAAMuE,SAC3BN,EAAOwB,MAAMzE,GAAG8C,MAAQ,EACxBG,EAAOwB,MAAMzE,GAAG+C,OAAS,GACzBS,YAEJP,GAAAA,EAAOyB,MAAO,CACZ,IAACjC,MAAMC,QAAQO,EAAOyB,OACxB,MAAMxB,UAAU,oDAEb,IADLnC,EAAQ2D,MAAQ,GACP1E,EAAI,EAAGA,EAAIiD,EAAOyB,MAAMzE,SAAUD,EAAG,CACxC,GAA2B,iBAApBiD,EAAOyB,MAAM1E,GACtB,MAAMkD,UAAU,qDAClBnC,EAAQ2D,MAAM1E,GAAKd,EAAME,UAAUC,SAASuF,MAAM5B,WAAWC,EAAOyB,MAAM1E,KAGvEe,OAAAA,GAYTM,EAAOoC,SAAW,SAAkB1C,EAAS2C,GACtCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GAMTlC,IALA2C,EAAQC,QAAUD,EAAQE,YAC5BX,EAAOuB,WAAa,GACpBvB,EAAOwB,MAAQ,GACfxB,EAAOyB,MAAQ,IAEb3D,EAAQyD,YAAczD,EAAQyD,WAAWvE,OAAQ,CACnDgD,EAAOuB,WAAa,GACf,IAAA,IAAIP,EAAI,EAAGA,EAAIlD,EAAQyD,WAAWvE,SAAUgE,EACV,iBAA1BlD,EAAQyD,WAAWP,GAC5BhB,EAAOuB,WAAWP,GAChBP,EAAQI,QAAUX,OAASA,OAAOpC,EAAQyD,WAAWP,IAAMlD,EAAQyD,WAAWP,GAEhFhB,EAAOuB,WAAWP,GAChBP,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQyD,WAAWP,IACtDP,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQyD,WAAWP,GAAGnB,MAAQ,EAC9B/B,EAAQyD,WAAWP,GAAGlB,OAAS,GAC/BS,UAAS,GACXzC,EAAQyD,WAAWP,GAE7BlD,GAAAA,EAAQ0D,OAAS1D,EAAQ0D,MAAMxE,OAE5B,IADLgD,EAAOwB,MAAQ,GACNR,EAAI,EAAGA,EAAIlD,EAAQ0D,MAAMxE,SAAUgE,EACV,iBAArBlD,EAAQ0D,MAAMR,GACvBhB,EAAOwB,MAAMR,GACXP,EAAQI,QAAUX,OAASA,OAAOpC,EAAQ0D,MAAMR,IAAMlD,EAAQ0D,MAAMR,GAEtEhB,EAAOwB,MAAMR,GACXP,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQ0D,MAAMR,IACjDP,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQ0D,MAAMR,GAAGnB,MAAQ,EACzB/B,EAAQ0D,MAAMR,GAAGlB,OAAS,GAC1BS,WACFzC,EAAQ0D,MAAMR,GAExBlD,GAAAA,EAAQ2D,OAAS3D,EAAQ2D,MAAMzE,OAE5B,IADLgD,EAAOyB,MAAQ,GACNT,EAAI,EAAGA,EAAIlD,EAAQ2D,MAAMzE,SAAUgE,EAC1ChB,EAAOyB,MAAMT,GAAK/E,EAAME,UAAUC,SAASuF,MAAMnB,SAAS1C,EAAQ2D,MAAMT,GAAIP,GAEzET,OAAAA,GAUT5B,EAAOnB,UAAUiE,OAAS,WACjB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjDhD,EAlVU,GAqVnBhC,EAASuF,MAAS,WAmBPA,SAAAA,EAAMrF,GACTA,GAAAA,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KAqUhE4E,OA5TPA,EAAM1E,UAAU2E,IAAM7F,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQtEsE,EAAM1E,UAAU4E,IAAM9F,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQtEsE,EAAM1E,UAAU6E,IAAM/F,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQtEsE,EAAM1E,UAAU8E,QAAUhG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAU1EsE,EAAM/D,OAAS,SAAgBtB,GACtB,OAAA,IAAIqF,EAAMrF,IAYnBqF,EAAM9D,OAAS,SAAgBC,EAASC,GAU/BA,OATFA,IAAQA,EAASlC,EAAQ+B,UACX,MAAfE,EAAQ8D,KAAe9D,EAAQW,eAAe,QAChDV,EAAOE,OAAP,GAAyCS,MAAMZ,EAAQ8D,KACtC,MAAf9D,EAAQ+D,KAAe/D,EAAQW,eAAe,QAChDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQ+D,KACvC,MAAf/D,EAAQgE,KAAehE,EAAQW,eAAe,QAChDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQgE,KACnC,MAAnBhE,EAAQiE,SAAmBjE,EAAQW,eAAe,YACpDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQiE,SACnDhE,GAYT4D,EAAMhD,gBAAkB,SAAyBb,EAASC,GACjD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActCwD,EAAM/C,OAAS,SAAgBC,EAAQ7B,GAC/B6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAASuF,MAClC9C,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACHpB,EAAQ8D,IAAM/C,EAAOH,QACrB,MACG,KAAA,EACHZ,EAAQ+D,IAAMhD,EAAOH,QACrB,MACG,KAAA,EACHZ,EAAQgE,IAAMjD,EAAOH,QACrB,MACG,KAAA,EACHZ,EAAQiE,QAAUlD,EAAOH,QACzB,MACF,QACEG,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaT6D,EAAMrC,gBAAkB,SAAyBT,GAExC,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpC0D,EAAMpC,OAAS,SAAgBzB,GACzB,MAAmB,iBAAZA,GAAoC,OAAZA,EAAyB,kBACzC,MAAfA,EAAQ8D,KAAe9D,EAAQW,eAAe,UAE7C1C,EAAM6D,UAAU9B,EAAQ8D,MACvB9D,EAAQ8D,KAAO7F,EAAM6D,UAAU9B,EAAQ8D,IAAI/B,MAAQ9D,EAAM6D,UAAU9B,EAAQ8D,IAAI9B,OAE1E,6BACQ,MAAfhC,EAAQ+D,KAAe/D,EAAQW,eAAe,UAE7C1C,EAAM6D,UAAU9B,EAAQ+D,MACvB/D,EAAQ+D,KAAO9F,EAAM6D,UAAU9B,EAAQ+D,IAAIhC,MAAQ9D,EAAM6D,UAAU9B,EAAQ+D,IAAI/B,OAE1E,6BACQ,MAAfhC,EAAQgE,KAAehE,EAAQW,eAAe,UAE7C1C,EAAM6D,UAAU9B,EAAQgE,MACvBhE,EAAQgE,KAAO/F,EAAM6D,UAAU9B,EAAQgE,IAAIjC,MAAQ9D,EAAM6D,UAAU9B,EAAQgE,IAAIhC,OAE1E,6BACY,MAAnBhC,EAAQiE,SAAmBjE,EAAQW,eAAe,cAEjD1C,EAAM6D,UAAU9B,EAAQiE,UAEvBjE,EAAQiE,SACRhG,EAAM6D,UAAU9B,EAAQiE,QAAQlC,MAChC9D,EAAM6D,UAAU9B,EAAQiE,QAAQjC,OAG3B,iCACJ,MAWT6B,EAAM5B,WAAa,SAAoBC,GACjCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAASuF,MAAO,OAAO3B,EACzDlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAASuF,MA6BpC7D,OA5BW,MAAdkC,EAAO4B,MACL7F,EAAMqB,MAAOU,EAAQ8D,IAAM7F,EAAMqB,KAAK+C,UAAUH,EAAO4B,MAAMxB,UAAW,EAC7C,iBAAfJ,EAAO4B,IAAkB9D,EAAQ8D,IAAMvB,SAASL,EAAO4B,IAAK,IAC7C,iBAAf5B,EAAO4B,IAAkB9D,EAAQ8D,IAAM5B,EAAO4B,IAC/B,iBAAf5B,EAAO4B,MACrB9D,EAAQ8D,IAAM,IAAI7F,EAAMuE,SAASN,EAAO4B,IAAI/B,MAAQ,EAAGG,EAAO4B,IAAI9B,OAAS,GAAGS,aAChE,MAAdP,EAAO6B,MACL9F,EAAMqB,MAAOU,EAAQ+D,IAAM9F,EAAMqB,KAAK+C,UAAUH,EAAO6B,MAAMzB,UAAW,EAC7C,iBAAfJ,EAAO6B,IAAkB/D,EAAQ+D,IAAMxB,SAASL,EAAO6B,IAAK,IAC7C,iBAAf7B,EAAO6B,IAAkB/D,EAAQ+D,IAAM7B,EAAO6B,IAC/B,iBAAf7B,EAAO6B,MACrB/D,EAAQ+D,IAAM,IAAI9F,EAAMuE,SAASN,EAAO6B,IAAIhC,MAAQ,EAAGG,EAAO6B,IAAI/B,OAAS,GAAGS,aAChE,MAAdP,EAAO8B,MACL/F,EAAMqB,MAAOU,EAAQgE,IAAM/F,EAAMqB,KAAK+C,UAAUH,EAAO8B,MAAM1B,UAAW,EAC7C,iBAAfJ,EAAO8B,IAAkBhE,EAAQgE,IAAMzB,SAASL,EAAO8B,IAAK,IAC7C,iBAAf9B,EAAO8B,IAAkBhE,EAAQgE,IAAM9B,EAAO8B,IAC/B,iBAAf9B,EAAO8B,MACrBhE,EAAQgE,IAAM,IAAI/F,EAAMuE,SAASN,EAAO8B,IAAIjC,MAAQ,EAAGG,EAAO8B,IAAIhC,OAAS,GAAGS,aAC5D,MAAlBP,EAAO+B,UACLhG,EAAMqB,MAAOU,EAAQiE,QAAUhG,EAAMqB,KAAK+C,UAAUH,EAAO+B,UAAU3B,UAAW,EACjD,iBAAnBJ,EAAO+B,QACrBjE,EAAQiE,QAAU1B,SAASL,EAAO+B,QAAS,IACV,iBAAnB/B,EAAO+B,QAAsBjE,EAAQiE,QAAU/B,EAAO+B,QACnC,iBAAnB/B,EAAO+B,UACrBjE,EAAQiE,QAAU,IAAIhG,EAAMuE,SAC1BN,EAAO+B,QAAQlC,MAAQ,EACvBG,EAAO+B,QAAQjC,OAAS,GACxBS,aACCzC,GAYT6D,EAAMnB,SAAW,SAAkB1C,EAAS2C,GACrCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GACTS,GAAAA,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO4B,IACLnB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAO4B,IAAMnB,EAAQI,QAAUX,OAAS,IAAM,EACjDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO6B,IACLpB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO6B,IAAMpB,EAAQI,QAAUX,OAAS,IAAM,EACjDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO8B,IACLrB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO8B,IAAMrB,EAAQI,QAAUX,OAAS,IAAM,EACjDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO+B,QACLtB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO+B,QAAUtB,EAAQI,QAAUX,OAAS,IAAM,EA6CpDF,OA3CY,MAAflC,EAAQ8D,KAAe9D,EAAQW,eAAe,SACrB,iBAAhBX,EAAQ8D,IACjB5B,EAAO4B,IAAMnB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQ8D,KAAO9D,EAAQ8D,IAEtE5B,EAAO4B,IACLnB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQ8D,KAC3CnB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQ8D,IAAI/B,MAAQ,EAAG/B,EAAQ8D,IAAI9B,OAAS,GAAGS,WAClEzC,EAAQ8D,KACD,MAAf9D,EAAQ+D,KAAe/D,EAAQW,eAAe,SACrB,iBAAhBX,EAAQ+D,IACjB7B,EAAO6B,IAAMpB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQ+D,KAAO/D,EAAQ+D,IAEtE7B,EAAO6B,IACLpB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQ+D,KAC3CpB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQ+D,IAAIhC,MAAQ,EAAG/B,EAAQ+D,IAAI/B,OAAS,GAAGS,WAClEzC,EAAQ+D,KACD,MAAf/D,EAAQgE,KAAehE,EAAQW,eAAe,SACrB,iBAAhBX,EAAQgE,IACjB9B,EAAO8B,IAAMrB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQgE,KAAOhE,EAAQgE,IAEtE9B,EAAO8B,IACLrB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQgE,KAC3CrB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQgE,IAAIjC,MAAQ,EAAG/B,EAAQgE,IAAIhC,OAAS,GAAGS,WAClEzC,EAAQgE,KACG,MAAnBhE,EAAQiE,SAAmBjE,EAAQW,eAAe,aACrB,iBAApBX,EAAQiE,QACjB/B,EAAO+B,QAAUtB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQiE,SAAWjE,EAAQiE,QAE9E/B,EAAO+B,QACLtB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQiE,SAC3CtB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQiE,QAAQlC,MAAQ,EACxB/B,EAAQiE,QAAQjC,OAAS,GACzBS,WACFzC,EAAQiE,SACb/B,GAUT2B,EAAM1E,UAAUiE,OAAS,WAChB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjDO,EA3VS,GA8VlBvF,EAASiC,QAAW,WAyBTA,SAAAA,EAAQ/B,GACXA,GAAAA,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KAgiBhEsB,OAvhBPA,EAAQpB,UAAU+E,GAAKjG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQtEgB,EAAQpB,UAAUgF,YAAclG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQ/EgB,EAAQpB,UAAUiF,YAAcnG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQ/EgB,EAAQpB,UAAUkF,WAAapG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQ9EgB,EAAQpB,UAAUmF,SAAWrG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ7EgB,EAAQpB,UAAUoF,QAAUtG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ5EgB,EAAQpB,UAAUqF,cAAe,EAQjCjE,EAAQpB,UAAUsF,cAAe,EAQjClE,EAAQpB,UAAUuF,gBAAiB,EAQnCnE,EAAQpB,UAAUwF,iBAAkB,EAUpCpE,EAAQT,OAAS,SAAgBtB,GACxB,OAAA,IAAI+B,EAAQ/B,IAYrB+B,EAAQR,OAAS,SAAgBC,EAASC,GAsBjCA,OArBFA,IAAQA,EAASlC,EAAQ+B,UACZ,MAAdE,EAAQkE,IAAclE,EAAQW,eAAe,OAC/CV,EAAOE,OAAP,GAAyCyD,OAAO5D,EAAQkE,IAC/B,MAAvBlE,EAAQmE,aAAuBnE,EAAQW,eAAe,gBACxDV,EAAOE,OAAP,IAA0CyD,OAAO5D,EAAQmE,aAChC,MAAvBnE,EAAQoE,aAAuBpE,EAAQW,eAAe,gBACxDV,EAAOE,OAAP,IAA0CyD,OAAO5D,EAAQoE,aACjC,MAAtBpE,EAAQqE,YAAsBrE,EAAQW,eAAe,eACvDV,EAAOE,OAAP,IAA0CyD,OAAO5D,EAAQqE,YACnC,MAApBrE,EAAQsE,UAAoBtE,EAAQW,eAAe,aACrDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQsE,UACnC,MAAnBtE,EAAQuE,SAAmBvE,EAAQW,eAAe,YACpDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQuE,SAC9B,MAAxBvE,EAAQwE,cAAwBxE,EAAQW,eAAe,iBACzDV,EAAOE,OAAP,IAA0CyE,KAAK5E,EAAQwE,cAC7B,MAAxBxE,EAAQyE,cAAwBzE,EAAQW,eAAe,iBACzDV,EAAOE,OAAP,IAA0CyE,KAAK5E,EAAQyE,cAC3B,MAA1BzE,EAAQ0E,gBAA0B1E,EAAQW,eAAe,mBAC3DV,EAAOE,OAAP,IAA0CyE,KAAK5E,EAAQ0E,gBAC1B,MAA3B1E,EAAQ2E,iBAA2B3E,EAAQW,eAAe,oBAC5DV,EAAOE,OAAP,IAA2CyE,KAAK5E,EAAQ2E,iBACnD1E,GAYTM,EAAQM,gBAAkB,SAAyBb,EAASC,GACnD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActCE,EAAQO,OAAS,SAAgBC,EAAQ7B,GACjC6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAASiC,QAClCQ,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACHpB,EAAQkE,GAAKnD,EAAO6C,SACpB,MACG,KAAA,EACH5D,EAAQmE,YAAcpD,EAAO6C,SAC7B,MACG,KAAA,EACH5D,EAAQoE,YAAcrD,EAAO6C,SAC7B,MACG,KAAA,EACH5D,EAAQqE,WAAatD,EAAO6C,SAC5B,MACG,KAAA,EACH5D,EAAQsE,SAAWvD,EAAOH,QAC1B,MACG,KAAA,EACHZ,EAAQuE,QAAUxD,EAAOH,QACzB,MACG,KAAA,EACHZ,EAAQwE,aAAezD,EAAO6D,OAC9B,MACG,KAAA,EACH5E,EAAQyE,aAAe1D,EAAO6D,OAC9B,MACG,KAAA,EACH5E,EAAQ0E,eAAiB3D,EAAO6D,OAChC,MACG,KAAA,GACH5E,EAAQ2E,gBAAkB5D,EAAO6D,OACjC,MACF,QACE7D,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTO,EAAQiB,gBAAkB,SAAyBT,GAE1C,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpCI,EAAQkB,OAAS,SAAgBzB,GAC3B,MAAmB,iBAAZA,GAAoC,OAAZA,EAAyB,kBAC1C,MAAdA,EAAQkE,IAAclE,EAAQW,eAAe,SAE5C1C,EAAM6D,UAAU9B,EAAQkE,KACvBlE,EAAQkE,IAAMjG,EAAM6D,UAAU9B,EAAQkE,GAAGnC,MAAQ9D,EAAM6D,UAAU9B,EAAQkE,GAAGlC,OAEvE,4BACgB,MAAvBhC,EAAQmE,aAAuBnE,EAAQW,eAAe,kBAErD1C,EAAM6D,UAAU9B,EAAQmE,cAEvBnE,EAAQmE,aACRlG,EAAM6D,UAAU9B,EAAQmE,YAAYpC,MACpC9D,EAAM6D,UAAU9B,EAAQmE,YAAYnC,OAG/B,qCACgB,MAAvBhC,EAAQoE,aAAuBpE,EAAQW,eAAe,kBAErD1C,EAAM6D,UAAU9B,EAAQoE,cAEvBpE,EAAQoE,aACRnG,EAAM6D,UAAU9B,EAAQoE,YAAYrC,MACpC9D,EAAM6D,UAAU9B,EAAQoE,YAAYpC,OAG/B,qCACe,MAAtBhC,EAAQqE,YAAsBrE,EAAQW,eAAe,iBAEpD1C,EAAM6D,UAAU9B,EAAQqE,aAEvBrE,EAAQqE,YACRpG,EAAM6D,UAAU9B,EAAQqE,WAAWtC,MACnC9D,EAAM6D,UAAU9B,EAAQqE,WAAWrC,OAG9B,oCACa,MAApBhC,EAAQsE,UAAoBtE,EAAQW,eAAe,eAElD1C,EAAM6D,UAAU9B,EAAQsE,WAEvBtE,EAAQsE,UACRrG,EAAM6D,UAAU9B,EAAQsE,SAASvC,MACjC9D,EAAM6D,UAAU9B,EAAQsE,SAAStC,OAG5B,kCACY,MAAnBhC,EAAQuE,SAAmBvE,EAAQW,eAAe,cAEjD1C,EAAM6D,UAAU9B,EAAQuE,UAEvBvE,EAAQuE,SACRtG,EAAM6D,UAAU9B,EAAQuE,QAAQxC,MAChC9D,EAAM6D,UAAU9B,EAAQuE,QAAQvC,OAG3B,iCACiB,MAAxBhC,EAAQwE,cAAwBxE,EAAQW,eAAe,iBACrB,kBAAzBX,EAAQwE,aAAmC,iCAC5B,MAAxBxE,EAAQyE,cAAwBzE,EAAQW,eAAe,iBACrB,kBAAzBX,EAAQyE,aAAmC,iCAC1B,MAA1BzE,EAAQ0E,gBAA0B1E,EAAQW,eAAe,mBACrB,kBAA3BX,EAAQ0E,eAAqC,mCAC3B,MAA3B1E,EAAQ2E,iBAA2B3E,EAAQW,eAAe,oBACrB,kBAA5BX,EAAQ2E,gBACV,oCACJ,MAWTpE,EAAQ0B,WAAa,SAAoBC,GACnCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAASiC,QAAS,OAAO2B,EAC3DlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAASiC,QAoEpCP,OAnEU,MAAbkC,EAAOgC,KACLjG,EAAMqB,MAAOU,EAAQkE,GAAKjG,EAAMqB,KAAK+C,UAAUH,EAAOgC,KAAK5B,UAAW,EAC5C,iBAAdJ,EAAOgC,GAAiBlE,EAAQkE,GAAK3B,SAASL,EAAOgC,GAAI,IAC3C,iBAAdhC,EAAOgC,GAAiBlE,EAAQkE,GAAKhC,EAAOgC,GAC9B,iBAAdhC,EAAOgC,KACrBlE,EAAQkE,GAAK,IAAIjG,EAAMuE,SAASN,EAAOgC,GAAGnC,MAAQ,EAAGG,EAAOgC,GAAGlC,OAAS,GAAGS,UACzE,KAEoB,MAAtBP,EAAOiC,cACLlG,EAAMqB,MACPU,EAAQmE,YAAclG,EAAMqB,KAAK+C,UAAUH,EAAOiC,cAAc7B,UAAW,EACvC,iBAAvBJ,EAAOiC,YACrBnE,EAAQmE,YAAc5B,SAASL,EAAOiC,YAAa,IACd,iBAAvBjC,EAAOiC,YAA0BnE,EAAQmE,YAAcjC,EAAOiC,YACvC,iBAAvBjC,EAAOiC,cACrBnE,EAAQmE,YAAc,IAAIlG,EAAMuE,SAC9BN,EAAOiC,YAAYpC,MAAQ,EAC3BG,EAAOiC,YAAYnC,OAAS,GAC5BS,UAAS,KACW,MAAtBP,EAAOkC,cACLnG,EAAMqB,MACPU,EAAQoE,YAAcnG,EAAMqB,KAAK+C,UAAUH,EAAOkC,cAAc9B,UAAW,EACvC,iBAAvBJ,EAAOkC,YACrBpE,EAAQoE,YAAc7B,SAASL,EAAOkC,YAAa,IACd,iBAAvBlC,EAAOkC,YAA0BpE,EAAQoE,YAAclC,EAAOkC,YACvC,iBAAvBlC,EAAOkC,cACrBpE,EAAQoE,YAAc,IAAInG,EAAMuE,SAC9BN,EAAOkC,YAAYrC,MAAQ,EAC3BG,EAAOkC,YAAYpC,OAAS,GAC5BS,UAAS,KACU,MAArBP,EAAOmC,aACLpG,EAAMqB,MACPU,EAAQqE,WAAapG,EAAMqB,KAAK+C,UAAUH,EAAOmC,aAAa/B,UAAW,EACtC,iBAAtBJ,EAAOmC,WACrBrE,EAAQqE,WAAa9B,SAASL,EAAOmC,WAAY,IACb,iBAAtBnC,EAAOmC,WAAyBrE,EAAQqE,WAAanC,EAAOmC,WACtC,iBAAtBnC,EAAOmC,aACrBrE,EAAQqE,WAAa,IAAIpG,EAAMuE,SAC7BN,EAAOmC,WAAWtC,MAAQ,EAC1BG,EAAOmC,WAAWrC,OAAS,GAC3BS,UAAS,KACQ,MAAnBP,EAAOoC,WACLrG,EAAMqB,MACPU,EAAQsE,SAAWrG,EAAMqB,KAAK+C,UAAUH,EAAOoC,WAAWhC,UAAW,EACpC,iBAApBJ,EAAOoC,SACrBtE,EAAQsE,SAAW/B,SAASL,EAAOoC,SAAU,IACX,iBAApBpC,EAAOoC,SAAuBtE,EAAQsE,SAAWpC,EAAOoC,SACpC,iBAApBpC,EAAOoC,WACrBtE,EAAQsE,SAAW,IAAIrG,EAAMuE,SAC3BN,EAAOoC,SAASvC,MAAQ,EACxBG,EAAOoC,SAAStC,OAAS,GACzBS,aACgB,MAAlBP,EAAOqC,UACLtG,EAAMqB,MAAOU,EAAQuE,QAAUtG,EAAMqB,KAAK+C,UAAUH,EAAOqC,UAAUjC,UAAW,EACjD,iBAAnBJ,EAAOqC,QACrBvE,EAAQuE,QAAUhC,SAASL,EAAOqC,QAAS,IACV,iBAAnBrC,EAAOqC,QAAsBvE,EAAQuE,QAAUrC,EAAOqC,QACnC,iBAAnBrC,EAAOqC,UACrBvE,EAAQuE,QAAU,IAAItG,EAAMuE,SAC1BN,EAAOqC,QAAQxC,MAAQ,EACvBG,EAAOqC,QAAQvC,OAAS,GACxBS,aACqB,MAAvBP,EAAOsC,eAAsBxE,EAAQwE,aAAeK,QAAQ3C,EAAOsC,eAC5C,MAAvBtC,EAAOuC,eAAsBzE,EAAQyE,aAAeI,QAAQ3C,EAAOuC,eAC1C,MAAzBvC,EAAOwC,iBAAwB1E,EAAQ0E,eAAiBG,QAAQ3C,EAAOwC,iBAC7C,MAA1BxC,EAAOyC,kBACT3E,EAAQ2E,gBAAkBE,QAAQ3C,EAAOyC,kBACpC3E,GAYTO,EAAQmC,SAAW,SAAkB1C,EAAS2C,GACvCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GACTS,GAAAA,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOgC,GACLvB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAOgC,GAAKvB,EAAQI,QAAUX,OAAS,IAAM,EAChDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOiC,YACLxB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOiC,YAAcxB,EAAQI,QAAUX,OAAS,IAAM,EACzDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOkC,YACLzB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOkC,YAAczB,EAAQI,QAAUX,OAAS,IAAM,EACzDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOmC,WACL1B,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOmC,WAAa1B,EAAQI,QAAUX,OAAS,IAAM,EACxDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOoC,SACL3B,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOoC,SAAW3B,EAAQI,QAAUX,OAAS,IAAM,EACtDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOqC,QACL5B,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOqC,QAAU5B,EAAQI,QAAUX,OAAS,IAAM,EACzDF,EAAOsC,cAAe,EACtBtC,EAAOuC,cAAe,EACtBvC,EAAOwC,gBAAiB,EACxBxC,EAAOyC,iBAAkB,EAwFpBzC,OAtFW,MAAdlC,EAAQkE,IAAclE,EAAQW,eAAe,QACrB,iBAAfX,EAAQkE,GACjBhC,EAAOgC,GAAKvB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQkE,IAAMlE,EAAQkE,GAEpEhC,EAAOgC,GACLvB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQkE,IAC3CvB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQkE,GAAGnC,MAAQ,EAAG/B,EAAQkE,GAAGlC,OAAS,GAAGS,UAAS,GACzEzC,EAAQkE,IACO,MAAvBlE,EAAQmE,aAAuBnE,EAAQW,eAAe,iBACrB,iBAAxBX,EAAQmE,YACjBjC,EAAOiC,YACLxB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQmE,aAAenE,EAAQmE,YAEnEjC,EAAOiC,YACLxB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQmE,aAC3CxB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQmE,YAAYpC,MAAQ,EAC5B/B,EAAQmE,YAAYnC,OAAS,GAC7BS,UAAS,GACXzC,EAAQmE,aACO,MAAvBnE,EAAQoE,aAAuBpE,EAAQW,eAAe,iBACrB,iBAAxBX,EAAQoE,YACjBlC,EAAOkC,YACLzB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQoE,aAAepE,EAAQoE,YAEnElC,EAAOkC,YACLzB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQoE,aAC3CzB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQoE,YAAYrC,MAAQ,EAC5B/B,EAAQoE,YAAYpC,OAAS,GAC7BS,UAAS,GACXzC,EAAQoE,aACM,MAAtBpE,EAAQqE,YAAsBrE,EAAQW,eAAe,gBACrB,iBAAvBX,EAAQqE,WACjBnC,EAAOmC,WACL1B,EAAQI,QAAUX,OAASA,OAAOpC,EAAQqE,YAAcrE,EAAQqE,WAElEnC,EAAOmC,WACL1B,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQqE,YAC3C1B,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQqE,WAAWtC,MAAQ,EAC3B/B,EAAQqE,WAAWrC,OAAS,GAC5BS,UAAS,GACXzC,EAAQqE,YACI,MAApBrE,EAAQsE,UAAoBtE,EAAQW,eAAe,cACrB,iBAArBX,EAAQsE,SACjBpC,EAAOoC,SAAW3B,EAAQI,QAAUX,OAASA,OAAOpC,EAAQsE,UAAYtE,EAAQsE,SAEhFpC,EAAOoC,SACL3B,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQsE,UAC3C3B,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQsE,SAASvC,MAAQ,EACzB/B,EAAQsE,SAAStC,OAAS,GAC1BS,WACFzC,EAAQsE,UACG,MAAnBtE,EAAQuE,SAAmBvE,EAAQW,eAAe,aACrB,iBAApBX,EAAQuE,QACjBrC,EAAOqC,QAAU5B,EAAQI,QAAUX,OAASA,OAAOpC,EAAQuE,SAAWvE,EAAQuE,QAE9ErC,EAAOqC,QACL5B,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQuE,SAC3C5B,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQuE,QAAQxC,MAAQ,EACxB/B,EAAQuE,QAAQvC,OAAS,GACzBS,WACFzC,EAAQuE,SACQ,MAAxBvE,EAAQwE,cAAwBxE,EAAQW,eAAe,kBACzDuB,EAAOsC,aAAexE,EAAQwE,cACJ,MAAxBxE,EAAQyE,cAAwBzE,EAAQW,eAAe,kBACzDuB,EAAOuC,aAAezE,EAAQyE,cACF,MAA1BzE,EAAQ0E,gBAA0B1E,EAAQW,eAAe,oBAC3DuB,EAAOwC,eAAiB1E,EAAQ0E,gBACH,MAA3B1E,EAAQ2E,iBAA2B3E,EAAQW,eAAe,qBAC5DuB,EAAOyC,gBAAkB3E,EAAQ2E,iBAC5BzC,GAUT3B,EAAQpB,UAAUiE,OAAS,WAClB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjD/C,EA5jBW,GA+jBpBjC,EAASkC,SAAY,WAoBVA,SAAAA,EAAShC,GAEZA,GADCsG,KAAAA,KAAO,GACRtG,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KAoWhEuB,OA3VPA,EAASrB,UAAU+E,GAAKjG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQvEiB,EAASrB,UAAU4F,UAAY9G,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQ9EiB,EAASrB,UAAU6F,QAAU/G,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQ5EiB,EAASrB,UAAU2F,KAAO7G,EAAMmB,WAQhCoB,EAASrB,UAAU8F,UAAW,EAU9BzE,EAASV,OAAS,SAAgBtB,GACzB,OAAA,IAAIgC,EAAShC,IAYtBgC,EAAST,OAAS,SAAgBC,EAASC,GAQrCD,GAPCC,IAAQA,EAASlC,EAAQ+B,UACZ,MAAdE,EAAQkE,IAAclE,EAAQW,eAAe,OAC/CV,EAAOE,OAAP,GAAyCyD,OAAO5D,EAAQkE,IACjC,MAArBlE,EAAQ+E,WAAqB/E,EAAQW,eAAe,cACtDV,EAAOE,OAAP,IAA0CyD,OAAO5D,EAAQ+E,WACpC,MAAnB/E,EAAQgF,SAAmBhF,EAAQW,eAAe,YACpDV,EAAOE,OAAP,IAA0CyD,OAAO5D,EAAQgF,SACvC,MAAhBhF,EAAQ8E,MAAgB9E,EAAQ8E,KAAK5F,OACvC,IAAK,IAAID,EAAI,EAAGA,EAAIe,EAAQ8E,KAAK5F,SAAUD,EACzCd,EAAME,UAAUC,SAAS4G,KAAKnF,OAC5BC,EAAQ8E,KAAK7F,GACbgB,EAAOE,OAAP,IAA0CC,QAC1CC,SAGCJ,OAFiB,MAApBD,EAAQiF,UAAoBjF,EAAQW,eAAe,aACrDV,EAAOE,OAAP,IAA0CyE,KAAK5E,EAAQiF,UAClDhF,GAYTO,EAASK,gBAAkB,SAAyBb,EAASC,GACpD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActCG,EAASM,OAAS,SAAgBC,EAAQ7B,GAClC6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAASkC,SAClCO,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACHpB,EAAQkE,GAAKnD,EAAO6C,SACpB,MACG,KAAA,EACH5D,EAAQ+E,UAAYhE,EAAO6C,SAC3B,MACG,KAAA,EACH5D,EAAQgF,QAAUjE,EAAO6C,SACzB,MACG,KAAA,EACG5D,EAAQ8E,MAAQ9E,EAAQ8E,KAAK5F,SAASc,EAAQ8E,KAAO,IAC3D9E,EAAQ8E,KAAKzD,KAAKlD,EAAME,UAAUC,SAAS4G,KAAKpE,OAAOC,EAAQA,EAAOZ,WACtE,MACG,KAAA,EACHH,EAAQiF,SAAWlE,EAAO6D,OAC1B,MACF,QACE7D,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTQ,EAASgB,gBAAkB,SAAyBT,GAE3C,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpCK,EAASiB,OAAS,SAAgBzB,GAC5B,GAAmB,iBAAZA,GAAoC,OAAZA,EAAkB,MAAO,kBACxDA,GAAc,MAAdA,EAAQkE,IAAclE,EAAQW,eAAe,SAE5C1C,EAAM6D,UAAU9B,EAAQkE,KACvBlE,EAAQkE,IAAMjG,EAAM6D,UAAU9B,EAAQkE,GAAGnC,MAAQ9D,EAAM6D,UAAU9B,EAAQkE,GAAGlC,OAE9E,MAAO,4BACPhC,GAAqB,MAArBA,EAAQ+E,WAAqB/E,EAAQW,eAAe,gBAEnD1C,EAAM6D,UAAU9B,EAAQ+E,YAEvB/E,EAAQ+E,WACR9G,EAAM6D,UAAU9B,EAAQ+E,UAAUhD,MAClC9D,EAAM6D,UAAU9B,EAAQ+E,UAAU/C,OAGpC,MAAO,mCACPhC,GAAmB,MAAnBA,EAAQgF,SAAmBhF,EAAQW,eAAe,cAEjD1C,EAAM6D,UAAU9B,EAAQgF,UAEvBhF,EAAQgF,SACR/G,EAAM6D,UAAU9B,EAAQgF,QAAQjD,MAChC9D,EAAM6D,UAAU9B,EAAQgF,QAAQhD,OAGlC,MAAO,iCACPhC,GAAgB,MAAhBA,EAAQ8E,MAAgB9E,EAAQW,eAAe,QAAS,CACtD,IAACe,MAAMC,QAAQ3B,EAAQ8E,MAAO,MAAO,uBACpC,IAAA,IAAI7F,EAAI,EAAGA,EAAIe,EAAQ8E,KAAK5F,SAAUD,EAAG,CACxC2C,IAAAA,EAAQzD,EAAME,UAAUC,SAAS4G,KAAKzD,OAAOzB,EAAQ8E,KAAK7F,IAC1D2C,GAAAA,EAAO,MAAO,QAAUA,GAG5B5B,OAAoB,MAApBA,EAAQiF,UAAoBjF,EAAQW,eAAe,aACrB,kBAArBX,EAAQiF,SAA+B,6BAC7C,MAWTzE,EAASyB,WAAa,SAAoBC,GACpCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAASkC,SAAU,OAAO0B,EAC5DlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAASkC,SA8BvC0B,GA7Ba,MAAbA,EAAOgC,KACLjG,EAAMqB,MAAOU,EAAQkE,GAAKjG,EAAMqB,KAAK+C,UAAUH,EAAOgC,KAAK5B,UAAW,EAC5C,iBAAdJ,EAAOgC,GAAiBlE,EAAQkE,GAAK3B,SAASL,EAAOgC,GAAI,IAC3C,iBAAdhC,EAAOgC,GAAiBlE,EAAQkE,GAAKhC,EAAOgC,GAC9B,iBAAdhC,EAAOgC,KACrBlE,EAAQkE,GAAK,IAAIjG,EAAMuE,SAASN,EAAOgC,GAAGnC,MAAQ,EAAGG,EAAOgC,GAAGlC,OAAS,GAAGS,UACzE,KAEkB,MAApBP,EAAO6C,YACL9G,EAAMqB,MACPU,EAAQ+E,UAAY9G,EAAMqB,KAAK+C,UAAUH,EAAO6C,YAAYzC,UAAW,EACrC,iBAArBJ,EAAO6C,UACrB/E,EAAQ+E,UAAYxC,SAASL,EAAO6C,UAAW,IACZ,iBAArB7C,EAAO6C,UAAwB/E,EAAQ+E,UAAY7C,EAAO6C,UACrC,iBAArB7C,EAAO6C,YACrB/E,EAAQ+E,UAAY,IAAI9G,EAAMuE,SAC5BN,EAAO6C,UAAUhD,MAAQ,EACzBG,EAAO6C,UAAU/C,OAAS,GAC1BS,UAAS,KACO,MAAlBP,EAAO8C,UACL/G,EAAMqB,MAAOU,EAAQgF,QAAU/G,EAAMqB,KAAK+C,UAAUH,EAAO8C,UAAU1C,UAAW,EACjD,iBAAnBJ,EAAO8C,QACrBhF,EAAQgF,QAAUzC,SAASL,EAAO8C,QAAS,IACV,iBAAnB9C,EAAO8C,QAAsBhF,EAAQgF,QAAU9C,EAAO8C,QACnC,iBAAnB9C,EAAO8C,UACrBhF,EAAQgF,QAAU,IAAI/G,EAAMuE,SAC1BN,EAAO8C,QAAQjD,MAAQ,EACvBG,EAAO8C,QAAQhD,OAAS,GACxBS,UAAS,KACXP,EAAO4C,KAAM,CACX,IAACpD,MAAMC,QAAQO,EAAO4C,MACxB,MAAM3C,UAAU,qDAClBnC,EAAQ8E,KAAO,GACV,IAAA,IAAI7F,EAAI,EAAGA,EAAIiD,EAAO4C,KAAK5F,SAAUD,EAAG,CACvC,GAA0B,iBAAnBiD,EAAO4C,KAAK7F,GACrB,MAAMkD,UAAU,sDAClBnC,EAAQ8E,KAAK7F,GAAKd,EAAME,UAAUC,SAAS4G,KAAKjD,WAAWC,EAAO4C,KAAK7F,KAIpEe,OADgB,MAAnBkC,EAAO+C,WAAkBjF,EAAQiF,SAAWJ,QAAQ3C,EAAO+C,WACxDjF,GAYTQ,EAASkC,SAAW,SAAkB1C,EAAS2C,GACxCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GAETS,IADAA,EAAQC,QAAUD,EAAQE,YAAUX,EAAO4C,KAAO,IAClDnC,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOgC,GACLvB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAOgC,GAAKvB,EAAQI,QAAUX,OAAS,IAAM,EAChDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO6C,UACLpC,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO6C,UAAYpC,EAAQI,QAAUX,OAAS,IAAM,EACvDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO8C,QACLrC,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO8C,QAAUrC,EAAQI,QAAUX,OAAS,IAAM,EACzDF,EAAO+C,UAAW,EAuChBjF,GArCc,MAAdA,EAAQkE,IAAclE,EAAQW,eAAe,QACrB,iBAAfX,EAAQkE,GACjBhC,EAAOgC,GAAKvB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQkE,IAAMlE,EAAQkE,GAEpEhC,EAAOgC,GACLvB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQkE,IAC3CvB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQkE,GAAGnC,MAAQ,EAAG/B,EAAQkE,GAAGlC,OAAS,GAAGS,UAAS,GACzEzC,EAAQkE,IACK,MAArBlE,EAAQ+E,WAAqB/E,EAAQW,eAAe,eACrB,iBAAtBX,EAAQ+E,UACjB7C,EAAO6C,UACLpC,EAAQI,QAAUX,OAASA,OAAOpC,EAAQ+E,WAAa/E,EAAQ+E,UAEjE7C,EAAO6C,UACLpC,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQ+E,WAC3CpC,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQ+E,UAAUhD,MAAQ,EAC1B/B,EAAQ+E,UAAU/C,OAAS,GAC3BS,UAAS,GACXzC,EAAQ+E,WACG,MAAnB/E,EAAQgF,SAAmBhF,EAAQW,eAAe,aACrB,iBAApBX,EAAQgF,QACjB9C,EAAO8C,QAAUrC,EAAQI,QAAUX,OAASA,OAAOpC,EAAQgF,SAAWhF,EAAQgF,QAE9E9C,EAAO8C,QACLrC,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQgF,SAC3CrC,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQgF,QAAQjD,MAAQ,EACxB/B,EAAQgF,QAAQhD,OAAS,GACzBS,UAAS,GACXzC,EAAQgF,SAChBhF,EAAQ8E,MAAQ9E,EAAQ8E,KAAK5F,OAAQ,CACvCgD,EAAO4C,KAAO,GACT,IAAA,IAAI5B,EAAI,EAAGA,EAAIlD,EAAQ8E,KAAK5F,SAAUgE,EACzChB,EAAO4C,KAAK5B,GAAK/E,EAAME,UAAUC,SAAS4G,KAAKxC,SAAS1C,EAAQ8E,KAAK5B,GAAIP,GAItET,OAFiB,MAApBlC,EAAQiF,UAAoBjF,EAAQW,eAAe,cACrDuB,EAAO+C,SAAWjF,EAAQiF,UACrB/C,GAUT1B,EAASrB,UAAUiE,OAAS,WACnB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjD9C,EA5XY,GA+XrBlC,EAAS4G,KAAQ,WAiBNA,SAAAA,EAAK1G,GACRA,GAAAA,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KAsPhEiG,OA7OPA,EAAK/F,UAAUgG,WAAalH,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQ3E2F,EAAK/F,UAAU2F,KAAO7G,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAUtE2F,EAAKpF,OAAS,SAAgBtB,GACrB,OAAA,IAAI0G,EAAK1G,IAYlB0G,EAAKnF,OAAS,SAAgBC,EAASC,GAM9BA,OALFA,IAAQA,EAASlC,EAAQ+B,UACJ,MAAtBE,EAAQmF,YAAsBnF,EAAQW,eAAe,eACvDV,EAAOE,OAAP,GAAyCyD,OAAO5D,EAAQmF,YACtC,MAAhBnF,EAAQ8E,MAAgB9E,EAAQW,eAAe,SACjDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQ8E,MACnD7E,GAYTiF,EAAKrE,gBAAkB,SAAyBb,EAASC,GAChD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActC6E,EAAKpE,OAAS,SAAgBC,EAAQ7B,GAC9B6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAAS4G,KAClCnE,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACHpB,EAAQmF,WAAapE,EAAO6C,SAC5B,MACG,KAAA,EACH5D,EAAQ8E,KAAO/D,EAAOH,QACtB,MACF,QACEG,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTkF,EAAK1D,gBAAkB,SAAyBT,GAEvC,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpC+E,EAAKzD,OAAS,SAAgBzB,GACxB,MAAmB,iBAAZA,GAAoC,OAAZA,EAAyB,kBAClC,MAAtBA,EAAQmF,YAAsBnF,EAAQW,eAAe,iBAEpD1C,EAAM6D,UAAU9B,EAAQmF,aAEvBnF,EAAQmF,YACRlH,EAAM6D,UAAU9B,EAAQmF,WAAWpD,MACnC9D,EAAM6D,UAAU9B,EAAQmF,WAAWnD,OAG9B,oCACS,MAAhBhC,EAAQ8E,MAAgB9E,EAAQW,eAAe,WAE9C1C,EAAM6D,UAAU9B,EAAQ8E,OAEvB9E,EAAQ8E,MACR7G,EAAM6D,UAAU9B,EAAQ8E,KAAK/C,MAC7B9D,EAAM6D,UAAU9B,EAAQ8E,KAAK9C,OAGxB,8BACJ,MAWTkD,EAAKjD,WAAa,SAAoBC,GAChCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAAS4G,KAAM,OAAOhD,EACxDlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAAS4G,KAqBpClF,OApBkB,MAArBkC,EAAOiD,aACLlH,EAAMqB,MACPU,EAAQmF,WAAalH,EAAMqB,KAAK+C,UAAUH,EAAOiD,aAAa7C,UAAW,EACtC,iBAAtBJ,EAAOiD,WACrBnF,EAAQmF,WAAa5C,SAASL,EAAOiD,WAAY,IACb,iBAAtBjD,EAAOiD,WAAyBnF,EAAQmF,WAAajD,EAAOiD,WACtC,iBAAtBjD,EAAOiD,aACrBnF,EAAQmF,WAAa,IAAIlH,EAAMuE,SAC7BN,EAAOiD,WAAWpD,MAAQ,EAC1BG,EAAOiD,WAAWnD,OAAS,GAC3BS,UAAS,KACI,MAAfP,EAAO4C,OACL7G,EAAMqB,MAAOU,EAAQ8E,KAAO7G,EAAMqB,KAAK+C,UAAUH,EAAO4C,OAAOxC,UAAW,EAC9C,iBAAhBJ,EAAO4C,KAAmB9E,EAAQ8E,KAAOvC,SAASL,EAAO4C,KAAM,IAC/C,iBAAhB5C,EAAO4C,KAAmB9E,EAAQ8E,KAAO5C,EAAO4C,KAChC,iBAAhB5C,EAAO4C,OACrB9E,EAAQ8E,KAAO,IAAI7G,EAAMuE,SACvBN,EAAO4C,KAAK/C,MAAQ,EACpBG,EAAO4C,KAAK9C,OAAS,GACrBS,aACCzC,GAYTkF,EAAKxC,SAAW,SAAkB1C,EAAS2C,GACpCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GACTS,GAAAA,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOiD,WACLxC,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAOiD,WAAaxC,EAAQI,QAAUX,OAAS,IAAM,EACxDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAO4C,KACLnC,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAO4C,KAAOnC,EAAQI,QAAUX,OAAS,IAAM,EA0BjDF,OAxBmB,MAAtBlC,EAAQmF,YAAsBnF,EAAQW,eAAe,gBACrB,iBAAvBX,EAAQmF,WACjBjD,EAAOiD,WACLxC,EAAQI,QAAUX,OAASA,OAAOpC,EAAQmF,YAAcnF,EAAQmF,WAElEjD,EAAOiD,WACLxC,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQmF,YAC3CxC,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQmF,WAAWpD,MAAQ,EAC3B/B,EAAQmF,WAAWnD,OAAS,GAC5BS,UAAS,GACXzC,EAAQmF,YACA,MAAhBnF,EAAQ8E,MAAgB9E,EAAQW,eAAe,UACrB,iBAAjBX,EAAQ8E,KACjB5C,EAAO4C,KAAOnC,EAAQI,QAAUX,OAASA,OAAOpC,EAAQ8E,MAAQ9E,EAAQ8E,KAExE5C,EAAO4C,KACLnC,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQ8E,MAC3CnC,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQ8E,KAAK/C,MAAQ,EAAG/B,EAAQ8E,KAAK9C,OAAS,GAAGS,WACpEzC,EAAQ8E,MACb5C,GAUTgD,EAAK/F,UAAUiE,OAAS,WACf,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjD4B,EA1QQ,GA6QjB5G,EAASmC,SAAY,WAoBVA,SAAAA,EAASjC,GACZA,GAAAA,EACF,IAAK,IAAIO,EAAOC,OAAOD,KAAKP,GAAaS,EAAI,EAAGA,EAAIF,EAAKG,SAAUD,EACtC,MAAvBT,EAAWO,EAAKE,MAAa,KAAKF,EAAKE,IAAMT,EAAWO,EAAKE,KAqZhEwB,OA5YPA,EAAStB,UAAU+E,GAAKjG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAQ,EAQvEkB,EAAStB,UAAUiG,KAAOnH,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ1EkB,EAAStB,UAAUkG,WAAapH,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQhFkB,EAAStB,UAAUmF,SAAWrG,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAQ9EkB,EAAStB,UAAUmG,UAAYrH,EAAMqB,KAAOrB,EAAMqB,KAAKC,SAAS,EAAG,GAAG,GAAS,EAU/EkB,EAASX,OAAS,SAAgBtB,GACzB,OAAA,IAAIiC,EAASjC,IAYtBiC,EAASV,OAAS,SAAgBC,EAASC,GAYlCA,OAXFA,IAAQA,EAASlC,EAAQ+B,UACZ,MAAdE,EAAQkE,IAAclE,EAAQW,eAAe,OAC/CV,EAAOE,OAAP,GAAyCyD,OAAO5D,EAAQkE,IACtC,MAAhBlE,EAAQoF,MAAgBpF,EAAQW,eAAe,SACjDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQoF,MAChC,MAAtBpF,EAAQqF,YAAsBrF,EAAQW,eAAe,eACvDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQqF,YAClC,MAApBrF,EAAQsE,UAAoBtE,EAAQW,eAAe,aACrDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQsE,UACjC,MAArBtE,EAAQsF,WAAqBtF,EAAQW,eAAe,cACtDV,EAAOE,OAAP,IAA0CS,MAAMZ,EAAQsF,WACnDrF,GAYTQ,EAASI,gBAAkB,SAAyBb,EAASC,GACpD,OAAA,KAAKF,OAAOC,EAASC,GAAQI,UActCI,EAASK,OAAS,SAAgBC,EAAQ7B,GAClC6B,aAAkBlD,IAAUkD,EAASlD,EAAQiC,OAAOiB,IAGnDA,IAFHC,IAAAA,OAAiBC,IAAX/B,EAAuB6B,EAAOG,IAAMH,EAAOI,IAAMjC,EACzDc,EAAU,IAAI7B,EAAME,UAAUC,SAASmC,SAClCM,EAAOI,IAAMH,GAAK,CACnBI,IAAAA,EAAML,EAAOZ,SACTiB,OAAAA,IAAQ,GACT,KAAA,EACHpB,EAAQkE,GAAKnD,EAAO6C,SACpB,MACG,KAAA,EACH5D,EAAQoF,KAAOrE,EAAOH,QACtB,MACG,KAAA,EACHZ,EAAQqF,WAAatE,EAAOH,QAC5B,MACG,KAAA,EACHZ,EAAQsE,SAAWvD,EAAOH,QAC1B,MACG,KAAA,EACHZ,EAAQsF,UAAYvE,EAAOH,QAC3B,MACF,QACEG,EAAOQ,SAAe,EAANH,IAIfpB,OAAAA,GAaTS,EAASe,gBAAkB,SAAyBT,GAE3C,OADDA,aAAkBlD,IAAUkD,EAAS,IAAIlD,EAAQkD,IAChD,KAAKD,OAAOC,EAAQA,EAAOZ,WAWpCM,EAASgB,OAAS,SAAgBzB,GAC5B,MAAmB,iBAAZA,GAAoC,OAAZA,EAAyB,kBAC1C,MAAdA,EAAQkE,IAAclE,EAAQW,eAAe,SAE5C1C,EAAM6D,UAAU9B,EAAQkE,KACvBlE,EAAQkE,IAAMjG,EAAM6D,UAAU9B,EAAQkE,GAAGnC,MAAQ9D,EAAM6D,UAAU9B,EAAQkE,GAAGlC,OAEvE,4BACS,MAAhBhC,EAAQoF,MAAgBpF,EAAQW,eAAe,WAE9C1C,EAAM6D,UAAU9B,EAAQoF,OAEvBpF,EAAQoF,MACRnH,EAAM6D,UAAU9B,EAAQoF,KAAKrD,MAC7B9D,EAAM6D,UAAU9B,EAAQoF,KAAKpD,OAGxB,8BACe,MAAtBhC,EAAQqF,YAAsBrF,EAAQW,eAAe,iBAEpD1C,EAAM6D,UAAU9B,EAAQqF,aAEvBrF,EAAQqF,YACRpH,EAAM6D,UAAU9B,EAAQqF,WAAWtD,MACnC9D,EAAM6D,UAAU9B,EAAQqF,WAAWrD,OAG9B,oCACa,MAApBhC,EAAQsE,UAAoBtE,EAAQW,eAAe,eAElD1C,EAAM6D,UAAU9B,EAAQsE,WAEvBtE,EAAQsE,UACRrG,EAAM6D,UAAU9B,EAAQsE,SAASvC,MACjC9D,EAAM6D,UAAU9B,EAAQsE,SAAStC,OAG5B,kCACc,MAArBhC,EAAQsF,WAAqBtF,EAAQW,eAAe,gBAEnD1C,EAAM6D,UAAU9B,EAAQsF,YAEvBtF,EAAQsF,WACRrH,EAAM6D,UAAU9B,EAAQsF,UAAUvD,MAClC9D,EAAM6D,UAAU9B,EAAQsF,UAAUtD,OAG7B,mCACJ,MAWTvB,EAASwB,WAAa,SAAoBC,GACpCA,GAAAA,aAAkB/D,EAAME,UAAUC,SAASmC,SAAU,OAAOyB,EAC5DlC,IAAAA,EAAU,IAAI7B,EAAME,UAAUC,SAASmC,SAmDpCT,OAlDU,MAAbkC,EAAOgC,KACLjG,EAAMqB,MAAOU,EAAQkE,GAAKjG,EAAMqB,KAAK+C,UAAUH,EAAOgC,KAAK5B,UAAW,EAC5C,iBAAdJ,EAAOgC,GAAiBlE,EAAQkE,GAAK3B,SAASL,EAAOgC,GAAI,IAC3C,iBAAdhC,EAAOgC,GAAiBlE,EAAQkE,GAAKhC,EAAOgC,GAC9B,iBAAdhC,EAAOgC,KACrBlE,EAAQkE,GAAK,IAAIjG,EAAMuE,SAASN,EAAOgC,GAAGnC,MAAQ,EAAGG,EAAOgC,GAAGlC,OAAS,GAAGS,UACzE,KAEa,MAAfP,EAAOkD,OACLnH,EAAMqB,MAAOU,EAAQoF,KAAOnH,EAAMqB,KAAK+C,UAAUH,EAAOkD,OAAO9C,UAAW,EAC9C,iBAAhBJ,EAAOkD,KAAmBpF,EAAQoF,KAAO7C,SAASL,EAAOkD,KAAM,IAC/C,iBAAhBlD,EAAOkD,KAAmBpF,EAAQoF,KAAOlD,EAAOkD,KAChC,iBAAhBlD,EAAOkD,OACrBpF,EAAQoF,KAAO,IAAInH,EAAMuE,SACvBN,EAAOkD,KAAKrD,MAAQ,EACpBG,EAAOkD,KAAKpD,OAAS,GACrBS,aACmB,MAArBP,EAAOmD,aACLpH,EAAMqB,MACPU,EAAQqF,WAAapH,EAAMqB,KAAK+C,UAAUH,EAAOmD,aAAa/C,UAAW,EACtC,iBAAtBJ,EAAOmD,WACrBrF,EAAQqF,WAAa9C,SAASL,EAAOmD,WAAY,IACb,iBAAtBnD,EAAOmD,WAAyBrF,EAAQqF,WAAanD,EAAOmD,WACtC,iBAAtBnD,EAAOmD,aACrBrF,EAAQqF,WAAa,IAAIpH,EAAMuE,SAC7BN,EAAOmD,WAAWtD,MAAQ,EAC1BG,EAAOmD,WAAWrD,OAAS,GAC3BS,aACiB,MAAnBP,EAAOoC,WACLrG,EAAMqB,MACPU,EAAQsE,SAAWrG,EAAMqB,KAAK+C,UAAUH,EAAOoC,WAAWhC,UAAW,EACpC,iBAApBJ,EAAOoC,SACrBtE,EAAQsE,SAAW/B,SAASL,EAAOoC,SAAU,IACX,iBAApBpC,EAAOoC,SAAuBtE,EAAQsE,SAAWpC,EAAOoC,SACpC,iBAApBpC,EAAOoC,WACrBtE,EAAQsE,SAAW,IAAIrG,EAAMuE,SAC3BN,EAAOoC,SAASvC,MAAQ,EACxBG,EAAOoC,SAAStC,OAAS,GACzBS,aACkB,MAApBP,EAAOoD,YACLrH,EAAMqB,MACPU,EAAQsF,UAAYrH,EAAMqB,KAAK+C,UAAUH,EAAOoD,YAAYhD,UAAW,EACrC,iBAArBJ,EAAOoD,UACrBtF,EAAQsF,UAAY/C,SAASL,EAAOoD,UAAW,IACZ,iBAArBpD,EAAOoD,UAAwBtF,EAAQsF,UAAYpD,EAAOoD,UACrC,iBAArBpD,EAAOoD,YACrBtF,EAAQsF,UAAY,IAAIrH,EAAMuE,SAC5BN,EAAOoD,UAAUvD,MAAQ,EACzBG,EAAOoD,UAAUtD,OAAS,GAC1BS,aACCzC,GAYTS,EAASiC,SAAW,SAAkB1C,EAAS2C,GACxCA,IAASA,EAAU,IACpBT,IAAAA,EAAS,GACTS,GAAAA,EAAQE,SAAU,CAChB5E,GAAAA,EAAMqB,KAAM,CACVwD,IAAAA,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOgC,GACLvB,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,OACHZ,EAAOgC,GAAKvB,EAAQI,QAAUX,OAAS,IAAM,EAChDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOkD,KACLzC,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOkD,KAAOzC,EAAQI,QAAUX,OAAS,IAAM,EAClDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOmD,WACL1C,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOmD,WAAa1C,EAAQI,QAAUX,OAAS,IAAM,EACxDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOoC,SACL3B,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOoC,SAAW3B,EAAQI,QAAUX,OAAS,IAAM,EACtDnE,EAAMqB,MACJwD,EAAO,IAAI7E,EAAMqB,KAAK,EAAG,GAAG,GAChC4C,EAAOoD,UACL3C,EAAQI,QAAUX,OACdU,EAAKE,WACLL,EAAQI,QAAUE,OAChBH,EAAKL,WACLK,GACHZ,EAAOoD,UAAY3C,EAAQI,QAAUX,OAAS,IAAM,EA+DtDF,OA7DW,MAAdlC,EAAQkE,IAAclE,EAAQW,eAAe,QACrB,iBAAfX,EAAQkE,GACjBhC,EAAOgC,GAAKvB,EAAQI,QAAUX,OAASA,OAAOpC,EAAQkE,IAAMlE,EAAQkE,GAEpEhC,EAAOgC,GACLvB,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQkE,IAC3CvB,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQkE,GAAGnC,MAAQ,EAAG/B,EAAQkE,GAAGlC,OAAS,GAAGS,UAAS,GACzEzC,EAAQkE,IACA,MAAhBlE,EAAQoF,MAAgBpF,EAAQW,eAAe,UACrB,iBAAjBX,EAAQoF,KACjBlD,EAAOkD,KAAOzC,EAAQI,QAAUX,OAASA,OAAOpC,EAAQoF,MAAQpF,EAAQoF,KAExElD,EAAOkD,KACLzC,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQoF,MAC3CzC,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SAASxC,EAAQoF,KAAKrD,MAAQ,EAAG/B,EAAQoF,KAAKpD,OAAS,GAAGS,WACpEzC,EAAQoF,MACM,MAAtBpF,EAAQqF,YAAsBrF,EAAQW,eAAe,gBACrB,iBAAvBX,EAAQqF,WACjBnD,EAAOmD,WACL1C,EAAQI,QAAUX,OAASA,OAAOpC,EAAQqF,YAAcrF,EAAQqF,WAElEnD,EAAOmD,WACL1C,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQqF,YAC3C1C,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQqF,WAAWtD,MAAQ,EAC3B/B,EAAQqF,WAAWrD,OAAS,GAC5BS,WACFzC,EAAQqF,YACI,MAApBrF,EAAQsE,UAAoBtE,EAAQW,eAAe,cACrB,iBAArBX,EAAQsE,SACjBpC,EAAOoC,SAAW3B,EAAQI,QAAUX,OAASA,OAAOpC,EAAQsE,UAAYtE,EAAQsE,SAEhFpC,EAAOoC,SACL3B,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQsE,UAC3C3B,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQsE,SAASvC,MAAQ,EACzB/B,EAAQsE,SAAStC,OAAS,GAC1BS,WACFzC,EAAQsE,UACK,MAArBtE,EAAQsF,WAAqBtF,EAAQW,eAAe,eACrB,iBAAtBX,EAAQsF,UACjBpD,EAAOoD,UACL3C,EAAQI,QAAUX,OAASA,OAAOpC,EAAQsF,WAAatF,EAAQsF,UAEjEpD,EAAOoD,UACL3C,EAAQI,QAAUX,OACdnE,EAAMqB,KAAKH,UAAU6D,SAASG,KAAKnD,EAAQsF,WAC3C3C,EAAQI,QAAUE,OAChB,IAAIhF,EAAMuE,SACRxC,EAAQsF,UAAUvD,MAAQ,EAC1B/B,EAAQsF,UAAUtD,OAAS,GAC3BS,WACFzC,EAAQsF,WACbpD,GAUTzB,EAAStB,UAAUiE,OAAS,WACnB,OAAA,KAAKC,YAAYX,SAAS,KAAM/E,EAAUO,KAAKoF,gBAGjD7C,EA5aY,GA+adnC,GAGFD,EA/7GU,GAk8GnBkH,OAAOC,QAAUrH;;ACj1GhB,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,qBAAA,EArID,IAAA,EAAA,QAAA,sBACA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAOM,SAAU,EAAqB,GAC/B,GAA0B,IAA1B,EAAW,WAAkB,OAAO,KAEpC,IAAA,EACA,IACF,EAAe,EAAU,UAAA,SAAS,QAAQ,OAAO,IAAI,WAAW,IAChE,MAAO,GACA,OAAA,KAGA,SAAA,EAAI,GACJ,MAAa,iBAAN,EAAiB,EAAK,EAAW,IAGxC,SAAA,EAAU,GACV,OAAA,EAAa,YAAY,EAAI,KAAS,KAGzC,MAAA,EAAwB,IAAI,IAEzB,SAAA,EAAqB,GACtB,MAAA,KAAC,EAAD,SAAO,EAAP,UAAiB,GAAa,EAE9B,EAAsB,MAAR,GAAgB,EAAU,IAAU,YAClD,EAA6B,MAAZ,EAAmB,EAAU,GAAY,KAC1D,EAAoB,MAAb,GAAqB,EAAY,KAIxC,EAAuB,CAC3B,OAHa,KAAc,KAAkB,IAI7C,KAAM,GAWD,OARe,MAAlB,IACF,EAAU,KAAO,GAGP,MAAR,IACF,EAAU,KAAO,GAGZ,EAGJ,IAAA,IAAI,KAAK,EAAa,SACrB,GAAA,EAAE,GAAI,CACF,MAAA,EAAY,EAAqB,GACtB,MAAb,GACF,EAAsB,IAAI,EAAI,EAAE,IAAK,GAKlC,SAAA,EAAqB,GACtB,MAAA,KAAC,GAAQ,EACX,GAAQ,MAAR,EAAc,OAAO,KAanB,MAAA,GAAW,EAAO,EAAA,QAAA,GACpB,OAAY,MAAZ,EAAyB,KAEzB,EAAS,YACJ,EAAsB,IAAI,EAAI,EAAS,cAEvC,KAIL,MAAA,EAAoB,IAAI,IAEzB,IAAA,IAAI,KAAK,EAAa,SACrB,GAAQ,MAAR,EAAE,GAAY,CACV,MAAA,EAAY,EAAqB,GACnC,GACF,EAAkB,IAAI,EAAI,EAAE,IAAK,GAKjC,MAAA,EAA4B,EAAa,WAAW,IAAI,IAAS,CACrE,KAAO,EAAK,MAAQ,EAAU,EAAK,OAAU,UAC7C,KAAO,EAAK,MAAQ,EAAU,EAAK,OAAU,WAGzC,EAAkB,EAAa,mBAChC,EAAa,kBACd,EAAY,OAAS,EACnB,EAAa,EAAY,GAEzB,EAAiB,IAAI,EAAJ,wBAEf,OAAA,EAAW,MACZ,IAAA,cACA,IAAA,eACA,IAAA,eACA,IAAA,UACH,EAAe,kBAAkB,IAAI,EAAJ,cAAkB,EAAW,OAC9D,MAEG,IAAA,QACH,EAAe,kBAAkB,IAAI,EAAJ,eAIhC,IAAA,IAAI,KAAK,EAAa,OAAQ,CAC3B,MAAA,EAAQ,EAAE,WAAa,EAAE,WAAW,IAAI,GAAK,EAAkB,IAAI,EAAI,KAAO,GACpF,EAAM,UACA,MAAA,EAAQ,EAAE,MAAO,GACvB,EAAe,uBAAuB,EAAM,OAAO,GAAU,MAAL,IAA4B,GAG/E,OAAA,EAAe;;ACxBvB,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,4BAAA,EA5GD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAkCA,MAAM,EAAuB,IAAI,IACjC,SAAS,EAAsB,GACtB,OAAA,EAAY,EAAA,aAAA,EAAsB,EAAW,IAC5C,MAAA,EAAO,EAAU,cAAgB,cACjC,EAAO,EAAU,IACjB,EAAO,EAAU,WACjB,EAAM,EAAU,aACf,MAAA,CACL,OAAQ,KAAQ,KAAQ,KAAQ,IAChC,KAAA,EACA,KAAA,EACA,KAAA,EACA,IAAA,KAKA,SAAU,EAA4B,GACpC,MAAA,EAAW,IAAI,IACjB,IAAA,EAAY,EACV,MAAA,EAAY,CAAC,EAAuB,KACxC,EAAK,GAAK,IACV,EAAS,IAAI,EAAK,GAAI,GAClB,IACF,EAAK,OAAS,EAAO,IAGvB,EAAK,SAAS,QAAQ,GAAY,EAAU,EAAU,KAExD,EAAU,EAAc,MAGlB,MAAA,EAAoB,IACpB,GAAyB,IAAzB,EAAK,SAAS,OAAc,OAAO,EAAK,UAAY,EAClD,MAAA,EAAa,EAAK,SAAS,OAAO,CAAC,EAAe,IACtD,GAAS,EAAiB,GAEzB,EAAK,UAED,OADP,EAAK,UAAY,EACV,GAEH,EAAQ,EAAiB,EAAc,MAGvC,EAA8B,GAC/B,IAAA,IAAI,KAAe,EAAS,SAAU,CACrC,IAAA,EAA2B,GAGxB,IAFP,EAAM,KAAK,QAGkB,IAAvB,EAAY,QADL,CAEL,MAAA,EAAS,EAAS,IAAI,EAAY,QACpC,QAAW,IAAX,EAAsB,MAE1B,EAAM,QAAQ,GACd,EAAc,EAEhB,EAAO,KAAK,GAGR,MAAA,EAAU,IAAI,EAAJ,wBAA4B,GAEvC,IAAA,IAAI,KAAS,EAAQ,CAClB,MAAA,EAAY,EAAM,EAAM,OAAS,GACvC,EAAQ,uBACN,EAAM,IAAI,GAAS,EAAsB,EAAM,YAC/C,EAAU,UAKP,OADP,EAAQ,kBAAkB,IAAI,EAAJ,eACnB,EAAQ;;AC0XhB,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,sBAAA,EAAA,QAAA,kBAAA,EAreD,IAAA,EAAA,QAAA,gBACA,EAAA,QAAA,kBACA,EAAA,QAAA,2BAiEA,SAAS,EAAU,EAAa,GAEvB,UAAG,EAAQ,EAAA,SAAA,GAAK,EAAK,QAAO,EAAQ,EAAA,SAAA,GAAK,EAAK,MAGvD,SAAS,EAAkB,GACnB,MAAA,EAAM,IAAI,IAEX,IAAA,IAAI,KAAM,EAAQ,EACR,EAAY,EAAA,aAAA,EAAK,EAAU,EAAG,IAAK,EAAG,KAAM,IAAM,IAC1D,KAAK,GAGL,OAAA,EAGT,SAAS,EACP,EACA,GAEI,GAAuB,IAAvB,EAAY,QAAuC,IAAvB,EAAY,OACpC,MAAA,IAAI,MAAM,qDAEd,GAAuB,IAAvB,EAAY,OAAc,MAAO,IACjC,GAAuB,IAAvB,EAAY,OAAc,MAAO,IAE/B,MAAA,EAAS,EAAY,GACrB,EAAS,EAAY,GAErB,EAAM,EAAO,GACb,EAAM,EAAO,GAEf,OAAA,EAAM,EAAY,IAClB,EAAM,EAAY,IAUf,EAAO,OAAS,EAAO,KAAO,IAAM,IAG7C,SAAS,EAAqB,GACtB,MAAA,EAA6B,GAC7B,EAA2B,GAG7B,GAAA,EAAO,OAAS,EAAG,CACjB,IAAA,EAAU,OAAO,iBAChB,IAAA,IAAI,KAAM,EACb,EAAU,KAAK,IAAI,EAAS,EAAG,IAE5B,IAAA,IAAI,KAAM,EACb,EAAG,IAAM,EAKP,MAAA,EAAyB,GAC1B,IAAA,IAAI,KAAM,EACL,OAAA,EAAG,IACJ,IAAA,IACH,EAAY,KAAK,GACjB,MAGG,IAAA,IACH,EAAU,KAAK,GACf,MAGG,IAAA,IACH,EAAQ,KAAK,GACb,MAGF,QAES,OADyB,EAM7B,SAAA,EAAI,GA2Ud,IAAA,EAAA,EA1UG,OAAsB,QAAtB,EAAY,QAAZ,EAAO,EAAE,WAAG,IAAA,EAAA,EAAI,EAAE,YAAI,IAAA,EAAA,EAAI,EAG5B,EAAQ,KAAK,CAAC,EAAG,KACX,GAAA,EAAE,GAAK,EAAE,GAAI,OAAQ,EACrB,GAAA,EAAE,GAAK,EAAE,GAAI,OAAO,EAMlB,MAAA,EAAO,EAAI,GACX,EAAO,EAAI,GACb,OAAA,EAAO,GAAc,EACrB,EAAO,EAAa,EAGjB,IAGJ,IAAA,IAAI,KAAK,EAAS,CACf,MAAA,EAAO,EAAI,GACjB,EAAY,KAAK,OAAA,OAAA,OAAA,OAAA,GAAI,GAAC,CAAE,GAAI,OAC5B,EAAU,KAAK,OAAA,OAAA,OAAA,OAAA,GAAI,GAAC,CAAE,GAAI,IAAK,GAAI,EAAE,GAAK,KAGnC,SAAA,EAAkB,EAAe,GACpC,OAAA,EAAE,GAAK,EAAE,IAAY,EACrB,EAAE,GAAK,EAAE,GAAW,EAIjB,EAMF,OAHP,EAAY,KAAK,GACjB,EAAU,KAAK,GAER,CAAC,EAAa,GAGvB,SAAS,EAAwB,GACzB,MAAA,EAA8B,GAC/B,IAAA,IAAI,KAAM,EACL,OAAA,EAAG,IACJ,IAAA,IACA,IAAA,IACA,IAAA,IACH,EAAI,KAAK,GAGR,OAAA,EAGT,SAAS,EAAqB,GACtB,MAAA,EAAoB,IAAI,IACzB,IAAA,IAAI,KAAM,EACC,MAAV,EAAG,IAA0B,iBAAZ,EAAG,MAA2B,EAAG,MAAQ,EAAG,KAAK,MACpE,EAAkB,IAAI,EAAG,IAAK,EAAG,KAAK,MAGnC,OAAA,EAGT,SAAS,EAAuB,GACxB,MAAA,EAAqB,IAAI,IAE1B,IAAA,IAAI,KAAM,EACC,MAAV,EAAG,IAA0B,gBAAZ,EAAG,MAA0B,EAAG,MAAQ,EAAG,KAAK,MACnE,EAAmB,IAAI,EAAU,EAAG,IAAK,EAAG,KAAM,EAAG,KAAK,MAGvD,OAAA,EAGT,SAAS,EAAY,GACf,IAAA,KAAU,EAAM,MAAQ,cAIrB,OAHH,EAAM,OACR,OAAY,KAAK,UAAU,EAAM,SAE5B,EAGT,SAAS,EAAkB,GACnB,MAAA,EAAM,EAAY,GACjB,MAAA,CACL,KAAM,EACN,IAAK,GAIT,SAAS,EAAwB,GACzB,MACA,EAAc,EADK,EAAwB,IAG3C,EAAoB,EAAqB,GACzC,EAAsB,EAAuB,GAE7C,EAAoC,GAsKnC,OApKP,EAAY,QAAQ,IACd,GAA2B,IAA3B,EAAgB,OAAc,OAE5B,MAAA,IAAC,EAAD,IAAM,GAAO,EAAgB,GAE7B,EAAU,IAAI,EAAJ,uBAChB,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBAEtC,MAAA,EAAc,EAAkB,IAAI,GACpC,EAAa,EAAoB,IAAI,EAAU,EAAK,IAEvC,MAAf,GAAqC,MAAd,EACzB,EAAQ,WAAW,UAAoB,OAAS,UAAmB,MAC3C,MAAf,EACT,EAAQ,WAAW,UAAoB,UAAY,MAC5B,MAAd,EACT,EAAQ,WAAW,UAAmB,UAAY,MAElD,EAAQ,eAAe,UAAY,KAmB/B,MAAC,EAAa,GAAe,EAAqB,GAElD,EAA4B,GAC5B,EAAc,IAClB,EAAW,KAAK,GAChB,EAAQ,WAAW,EAAkB,GAAI,EAAE,KAGvC,EAAmB,IACjB,MAAA,GAAI,EAAO,EAAA,QAAA,GAEb,GAAK,MAAL,EAMF,YALA,QAAQ,4BAEJ,EAAkB,GAAG,yDAMrB,MAAA,EAAa,EAAkB,GAC/B,EAAa,EAAkB,GAEjC,EAAE,OAAS,EAAE,MAOb,EAAW,MAAQ,EAAW,KAChC,QAAQ,WACA,EAAE,qBAAqB,EAAW,cAAc,EAAW,4CAA4C,EAAW,gBAI5H,EAAW,MACX,EAAQ,WAAW,EAAY,EAAE,KAb/B,QAAQ,WACA,EAAE,qBAAqB,EAAW,cAAc,EAAW,6DAehE,KAAA,EAAY,OAAS,GAAK,EAAY,OAAS,GAAG,CACjD,MAAA,EAAY,EAA0B,EAAa,GACjD,OAAA,GACD,IAAA,IACH,EAAW,EAAY,SACvB,MAEG,IAAA,IAAK,CAKF,MAAA,GAAW,EAAO,EAAA,QAAA,GACpB,GAAY,MAAZ,EAAkB,CACd,MAAA,EAAa,EAAkB,GAEjC,IAAA,GAAmB,EAElB,IAAA,IAAI,EAAI,EAAG,EAAI,EAAY,OAAQ,IAAK,CACrC,MAAA,EAAS,EAAY,GACvB,GAAA,EAAO,GAAK,EAAY,GAAG,GAE7B,MAGI,MAAA,EAAa,EAAkB,GACjC,GAAA,EAAW,MAAQ,EAAW,IAAK,CAE/B,MAAA,EAAO,EAAY,GACzB,EAAY,GAAK,EAAY,GAC7B,EAAY,GAAK,EACjB,GAAU,EACV,OAIA,IAAC,EAEE,IAAA,IAAI,EAAI,EAAG,EAAI,EAAY,OAAQ,IAAK,CACrC,MAAA,EAAS,EAAY,GACvB,GAAA,EAAO,GAAK,EAAY,GAAG,GAE7B,MAGE,GAAA,EAAO,OAAS,EAAS,KAAM,CAE3B,MAAA,EAAO,EAAY,GACzB,EAAY,GAAK,EAAY,GAC7B,EAAY,GAAK,EACjB,GAAU,EACV,QAWR,EAFU,EAAY,SAGtB,MAGF,QAES,OADyB,GAKjC,IAAA,IAAI,EAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,CACzC,MAAA,EAAQ,EAAkB,EAAW,IAC3C,QAAQ,eAAe,EAAM,iEAC7B,EAAQ,WAAW,EAAO,EAAQ,kBAGpC,EAAa,KAAK,CAAC,EAAU,EAAK,GAAM,EAAQ,aAO3C,EAAA,EAAA,QAAA,EAAc,GAAK,EAAE,IAErB,CACL,KAAM,GACN,YAAa,EACb,SAAU,EAAa,IAAI,GAAK,EAAE,KAItC,SAAS,EAAiB,GACpB,IAAC,MAAM,QAAQ,GAAiB,OAAO,EACvC,GAA0B,IAA1B,EAAe,OAAc,OAAO,EAKnC,IAAA,IAAI,KAAM,EAAgB,CACzB,KAAE,OAAQ,GACL,OAAA,EAGD,OAAA,EAAG,IACJ,IAAA,IACA,IAAA,IACA,IAAA,IAGC,KAAE,OAAQ,GACL,OAAA,GAUR,OAAA,EAGT,SAAS,EACP,GAEI,MAAE,gBAAiB,GAChB,EAAiB,EAAqB,aAGzC,SAAU,EACd,GAKO,OAAA,EAAmB,IAAe,EAAiB,GAGtD,SAAU,EACd,GAEI,GAAA,EAAmB,GACd,OAAA,EAAwB,EAAW,aACrC,GAAI,EAAiB,GACnB,OAAA,EAAwB,GAGxB,OADyB;;ACkCnC,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,oBAAA,EA7aD,IAAA,EAAA,QAAA,kBACA,EAAA,QAAA,gBACA,EAAA,QAAA,2BAEA,MAAM,EAKJ,YAAoB,EAA0B,GAA1B,KAAA,SAAA,EAA0B,KAAA,UAAA,EAJtC,KAAA,SAAW,IAAI,EAAJ,SACX,KAAA,aAAe,IAAI,IACnB,KAAA,qBAAuB,IAAI,IAI3B,iBAAiB,GAChB,OAAA,EAAM,MAAA,YAAY,KAAK,SAAU,GAGlC,iBAAiB,EAAc,GAChC,KAAK,aAAa,IAAI,GAGpB,KAAA,aAAa,IAAI,EAAO,KAAK,aAAa,IAAI,GAAU,GAFxD,KAAA,aAAa,IAAI,EAAO,GAMjC,cAAc,EAAsB,GAC7B,KAAA,iBAAiB,KAAK,iBAAiB,GAAY,GAG1D,wBAAwB,EAAuB,EAAsB,GAC7D,MAAA,EAAS,KAAK,iBAAiB,GAC/B,EAAQ,KAAK,iBAAiB,GAE9B,GAAW,EAAY,EAAA,aAAA,KAAK,qBAAsB,EAAQ,GAAK,IAAI,KAEpE,EAAS,IAAI,GAGhB,EAAS,IAAI,EAAO,EAAS,IAAI,GAAS,GAF1C,EAAS,IAAI,EAAO,GAKjB,KAAA,iBAAiB,EAAQ,GAGhC,YAMQ,MAAA,EAAc,IAAI,IACnB,IAAA,IAAK,EAAO,KAAgB,KAAK,aACpC,EAAY,IAAI,EAAO,GAEpB,IAAA,IAAK,EAAG,KAAa,KAAK,qBACxB,IAAA,IAAK,EAAO,KAAW,EAC1B,EAAY,IAAI,GAAO,EAAU,EAAA,WAAA,EAAa,EAAO,IAAM,GAAU,GAIrE,IAAA,EAAqB,EACpB,IAAA,IAAK,EAAG,KAAe,EAC1B,GAAsB,EAGlB,MAAA,EAAU,IAAI,EAAJ,uBAEZ,IAAA,EAAiB,EAIE,gBAAnB,KAAK,WACP,EAAQ,WAAW,KAAK,oBACxB,EAAiB,GACjB,EAAQ,kBAAkB,IAAI,EAAJ,cAAkB,iBACjB,kBAAlB,KAAK,WACd,EAAQ,WAAW,KAAK,sBACxB,EAAQ,kBAAkB,IAAI,EAAJ,gBAE1B,EAAQ,WAAW,KAAK,eAAe,KAAK,aAG1C,IAAA,EAAkB,EAEhB,MAAA,EAAe,IAAI,IAEnB,EAAQ,CAAC,EAAc,KACvB,GAAA,EAAa,IAAI,GAMnB,OAqBE,GAAA,EAAiB,KAAO,EAuB1B,OAKI,MAAA,GAA0B,EAAU,EAAA,WAAA,KAAK,aAAc,EAAO,IAAM,GACtE,GAA4B,IAA5B,EACF,OAMI,MAAA,EAAQ,EAAiB,EAE3B,IAAA,EAAqB,EAEzB,EAAQ,WAAW,EAAO,EAAkB,GAE5C,EAAa,IAAI,GACZ,IAAA,IAAK,EAAO,KAAwB,KAAK,qBAAqB,IAAI,IAAU,GAAI,CACnF,GAAsB,EAEtB,EAAM,EADsB,EAAsB,GAGpD,EAAa,OAAO,GAEpB,GAAmB,EAAqB,EACxC,EAAQ,WAAW,EAAO,EAAkB,IAGzC,IAAA,IAAK,EAAW,KAAe,EAC9B,GAAc,GAKlB,EAAM,EAAW,GAGZ,OAAA,EAAQ,SAgBnB,MAAM,EAeJ,YAAY,EAA0B,GAAA,KAAA,iBAAA,EAX9B,KAAA,WAAiC,KACjC,KAAA,WAA4B,KAE5B,KAAA,SAA0B,KAC1B,KAAA,aAA8B,KAC9B,KAAA,eAAgC,KAChC,KAAA,mBAAoC,KAEpC,KAAA,eAAyC,GACzC,KAAA,mBAA6C,GAG9C,KAAA,MAAQ,EAAS,MAAM,MACvB,KAAA,QAAU,EAGjB,QACS,KAAA,KAAK,QAAU,KAAK,MAAM,QAAQ,CACjC,MAAA,EAAO,KAAK,MAAM,KAAK,WAEzB,IAAA,QAAQ,KAAK,MAKb,QAAQ,KAAK,IAKb,KAAK,gBAAgB,IAIrB,KAAK,oBAAoB,IAIzB,KAAK,cAAc,EAAM,SAIvB,MAAA,IAAI,4BAA4B,cAAiB,KAAK,WAG1D,OAAC,KAAK,WAGH,CACL,KAAM,KAAK,iBACX,YAAa,EACb,SAAU,KAAK,WAAW,IAAI,GAAM,EAAG,cALhC,KASH,YACA,MAAA,EAAO,KAAK,UAAY,YACxB,EAAO,KAAK,cAAgB,YAE3B,MAAA,CAAC,OADO,KAAQ,IACV,KAAA,EAAM,KAAA,GAGb,kBACA,MAAA,EAAO,KAAK,gBAAkB,YAC9B,EAAO,KAAK,oBAAsB,YAEjC,MAAA,CAAC,OADO,KAAQ,IACV,KAAA,EAAM,KAAA,GAGb,gBAAgB,GAChB,MAAA,EAAc,sBAAsB,KAAK,GAC3C,IAAC,EAAa,OAAO,EAErB,GAAmB,WAAnB,EAAY,GAEP,OAAA,EAIH,MAAA,EAAS,EAAY,GAAG,MAAM,KAEhC,GAAmB,MAAnB,KAAK,WACD,MAAA,IAAI,0DAC4C,KAAK,8BAA8B,SAAY,KAAK,YAQrG,OAJF,KAAA,WAAa,EAAO,IAAI,GACpB,IAAI,EAAU,KAAK,iBAAkB,KAGvC,EAGD,oBAAoB,GACpB,MAAA,EAAkB,kBAAkB,KAAK,GAC3C,IAAC,EAAiB,OAAO,EAEvB,MAAA,EAAM,EAAgB,GACtB,EAAQ,EAAgB,GAEtB,OAAA,GACD,IAAA,KACA,IAAA,KACA,IAAA,KACE,KAAA,SAAW,KAAK,yBAAyB,EAAO,KAAK,gBACrD,KAAA,eAAiB,KAAK,SAC3B,MAGG,IAAA,KACE,KAAA,aAAe,KAAK,yBAAyB,EAAO,KAAK,oBAC9D,MAGG,IAAA,MACA,IAAA,MACE,KAAA,eAAiB,KAAK,yBAAyB,EAAO,KAAK,gBAChE,MAGG,IAAA,MACE,KAAA,mBAAqB,KAAK,yBAAyB,EAAO,KAAK,oBACpE,MAGG,IAAA,QAKE,KAAA,cAAc,KAAK,MAAM,KAAK,WAAY,SAC/C,MAGF,QACE,QAAQ,gDAAgD,cAAiB,KAAK,WAI3E,OAAA,EAGD,yBAAyB,EAAc,GAC7C,CACQ,MAAA,EAAsB,qBAAqB,KAAK,GAElD,GAAA,EAAqB,CACjB,MAAA,EAAK,EAAoB,GACzB,EAAO,EAAoB,GAC7B,GAAA,KAAM,EACF,MAAA,IAAI,uCACyB,0BAA2B,EAAM,8BAA+B,cAAiB,KAAK,YAKpH,OADP,EAAM,GAAM,EACL,GAIX,CACQ,MAAA,EAAe,cAAc,KAAK,GACpC,GAAA,EAAc,CACV,MAAA,EAAK,EAAa,GACpB,KAAE,KAAM,GACJ,MAAA,IAAI,mCACqB,aAAc,KAAK,kCAG7C,OAAA,EAAM,IAIV,OAAA,EAGD,cAAc,EAAc,GAI5B,MAAA,EAAQ,EAAK,MAAM,OACnB,EAAiB,GAClB,IAAA,IAAI,KAAQ,EAAO,CAGhB,MAAA,EAAQ,SAAS,GACnB,GAAA,MAAM,GACD,OAAA,EAGT,EAAK,KAAK,GAGR,GAAe,GAAf,EAAK,OACA,OAAA,EAaL,IAAC,KAAK,WACF,MAAA,IAAI,yCAC2B,KAAK,oDAGvC,IAAA,IAAI,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IACzB,SAAb,EACG,KAAA,WAAW,GAAG,cAAc,KAAK,YAAa,EAhB7B,EAgBsD,IACtD,UAAb,GACJ,KAAA,WAAW,GAAG,wBACjB,KAAK,YACL,KAAK,kBACL,EArBoB,EAqBK,IAAM,GAK9B,OAAA,GAIL,SAAU,EACd,EACA,GAEO,OAAA,IAAI,EAAgB,EAAU,GAAkB;;ACnSxD,aAAA,OAAA,eAAA,QAAA,aAAA,CAAA,OAAA,IAAA,QAAA,2BAAA,EAAA,QAAA,6BAAA,EAAA,QAAA,uBAAA,EAAA,QAAA,8BAAA,EAAA,QAAA,mCAAA,EA7ND,IAAA,EAAA,QAAA,YAMA,EAAA,QAAA,eACA,EAAA,QAAA,iBACA,EAAA,QAAA,mBACA,EAAA,QAAA,aACA,EAAA,QAAA,sBACA,EAAA,QAAA,eACA,EAAA,QAAA,sBACA,EAAA,QAAA,aACA,EAAA,QAAA,YACA,EAAA,QAAA,WACA,EAAA,QAAA,WACA,EAAA,QAAA,gBACA,EAAA,QAAA,iBACA,EAAA,QAAA,iBACA,EAAA,QAAA,eAyMC,EAAA,SAAA,EAAA,EAAA,EAAA,GAAA,OAAA,IAAA,IAAA,EAAA,UAAA,SAAA,EAAA,GAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,KAAA,IAAA,MAAA,GAAA,EAAA,IAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,MAAA,IAAA,MAAA,GAAA,EAAA,IAAA,SAAA,EAAA,GAAA,IAAA,EAAA,EAAA,KAAA,EAAA,EAAA,QAAA,EAAA,EAAA,MAAA,aAAA,EAAA,EAAA,IAAA,EAAA,SAAA,GAAA,EAAA,MAAA,KAAA,EAAA,GAAA,GAAA,EAAA,EAAA,MAAA,EAAA,GAAA,KAAA,WAvMK,SAAgB,EACpB,EACA,GAqMD,OAAA,EAAA,UAAA,OAAA,EAAA,YAnMQ,aAAM,EAAmB,IAAI,EAAJ,sBAA0B,EAAU,MAGhE,SAAgB,EACpB,EACA,GA8LD,OAAA,EAAA,UAAA,OAAA,EAAA,YA5LQ,aAAM,EACX,EAA0B,0BAAA,gBAAgB,GAAU,EAAa,EAAA,cAAA,GAAa,WAI5E,SAAgB,EAAuB,GAuL5C,OAAA,EAAA,UAAA,OAAA,EAAA,YAtLQ,OAAA,EAAmB,EAA0B,0BAAA,SAAS,MAGzD,SAAgB,EACpB,EACA,GAiLD,OAAA,EAAA,UAAA,OAAA,EAAA,YA/KQ,OAAA,EAAmB,EAA0B,0BAAA,gBAAgB,EAAU,MAGhF,SAAe,EAAmB,GA4KjC,OAAA,EAAA,UAAA,OAAA,EAAA,YA3KO,MAAA,QAAiB,EAAW,OAE5B,QAAqB,EAAoB,GAC3C,GAAA,EAAc,CACX,EAAa,OAChB,EAAa,KAAO,GAEjB,IAAA,IAAI,KAAW,EAAa,SAC3B,IAAY,EAAQ,WACtB,EAAQ,QAAQ,GAGb,OAAA,EAEF,OAAA,OAGT,SAAS,EAAQ,GACX,OAAC,EACE,CAAC,KAAM,EAAQ,UAAW,YAAa,EAAG,SAAU,CAAC,IADvC,KAIvB,SAAS,EAAU,GAiBV,MANY,OADnB,EAAU,EAAQ,QACN,IAE0B,OADpC,EAAU,EAAQ,QAAQ,QAAS,KACvB,EAAQ,OAAS,KAC3B,GAAW,KAGR,EAGT,SAAe,EAAoB,GAiIlC,OAAA,EAAA,UAAA,OAAA,EAAA,YAhIO,MAAA,QAAiB,EAAW,OAE5B,QAAe,EAAW,oBAEhC,CACQ,MAAA,GAAU,EAAqB,EAAA,sBAAA,GACjC,GAAA,EAEK,OADP,QAAQ,IAAI,4CACL,EAAQ,GAIb,MAAA,QAAiB,EAAW,aAG9B,GAAA,EAAS,SAAS,oBAEb,OADP,QAAQ,IAAI,sCACL,EAAyB,EAAA,0BAAA,KAAK,MAAM,IACtC,GAAI,EAAS,SAAS,iBAAmB,sBAAsB,KAAK,GAElE,OADP,QAAQ,IAAI,iCACL,EAAyB,EAAA,0BAAA,KAAK,MAAM,GAAW,GACjD,GAAI,EAAS,SAAS,mBAEpB,OADP,QAAQ,IAAI,kCACL,GAAQ,EAAoB,EAAA,qBAAA,KAAK,MAAM,KACzC,GAAI,EAAS,SAAS,oBAEpB,OADP,QAAQ,IAAI,0CACL,GAAQ,EAA8B,EAAA,+BAAA,IACxC,GAAI,EAAS,SAAS,mBAEpB,OADP,QAAQ,IAAI,6CACL,EAAoB,EAAA,qBAAA,GACtB,GAAI,EAAS,SAAS,uBAEpB,OADP,QAAQ,IAAI,uCACL,GAAQ,EAAuB,EAAA,wBAAA,IACjC,GAAI,EAAS,SAAS,eAEpB,OADP,QAAQ,IAAI,sCACL,GAAQ,EAAoB,EAAA,qBAAA,KAAK,MAAM,KACzC,GAAI,EAAS,SAAS,gBAEpB,OADP,QAAQ,IAAI,oCACL,GAAQ,EAA4B,EAAA,6BAAA,KAAK,MAAM,KACjD,GAAI,EAAS,SAAS,mBAEpB,OADP,QAAQ,IAAI,+BACL,GAAQ,EAAiB,EAAA,kBAAA,KAAK,MAAM,KACtC,GAAI,EAAS,WAAW,cAEtB,OADP,QAAQ,IAAI,mCACL,EAAoB,EAAA,qBAAA,EAAU,GAInC,IAAA,EACA,IACF,EAAS,KAAK,MAAM,EAAU,IAC9B,MAAO,IACL,GAAA,EAAQ,CACN,GAAsB,uDAAtB,EAAM,QAED,OADP,QAAQ,IAAI,sCACL,EAAyB,EAAA,0BAAA,KAAK,MAAM,IACtC,GAAI,EAAM,YAAkD,WAAhC,EAAM,WAAN,KAE1B,OADP,QAAQ,IAAI,gCACL,GAAQ,EAAkB,EAAA,mBAAA,IAC5B,IAAI,EAAiB,EAAA,kBAAA,GAEnB,OADP,QAAQ,IAAI,iCACL,EAAyB,EAAA,0BAAA,EAAQ,GACnC,GAAI,UAAW,GAAU,YAAa,GAAU,eAAgB,EAE9D,OADP,QAAQ,IAAI,mCACL,GAAQ,EAA2B,EAAA,4BAAA,IACrC,IAAI,EAAsB,EAAA,uBAAA,GAExB,OADP,QAAQ,IAAI,4CACL,EAAkB,EAAA,mBAAA,GACpB,GAAI,SAAU,GAAU,YAAa,GAAU,eAAgB,EAE7D,OADP,QAAQ,IAAI,gDACL,GAAQ,EAA0B,EAAA,2BAAA,IACpC,GAAI,SAAU,GAAU,WAAY,GAAU,yBAA0B,EAEtE,OADP,QAAQ,IAAI,kCACL,GAAQ,EAAoB,EAAA,qBAAA,IAC9B,GAAI,SAAU,GAAU,cAAe,GAAU,UAAW,EAE1D,OADP,QAAQ,IAAI,sCACL,GAAQ,EAAoB,EAAA,qBAAA,IAC9B,GAAI,SAAU,GAAU,aAAc,EAAM,KAE1C,OADP,QAAQ,IAAI,oCACL,GAAQ,EAA4B,EAAA,6BAAA,KAAK,MAAM,KACjD,GAAI,kBAAmB,GAAU,yBAA0B,EAEzD,OADP,QAAQ,IAAI,0CACL,EAAkB,EAAA,mBAAA,GACpB,GAAI,cAAe,GAAU,sBAAuB,EAAO,UAEzD,OADP,QAAQ,IAAI,+BACL,GAAQ,EAAiB,EAAA,kBAAA,KAAK,MAAM,SAExC,CAMH,GAAA,sBAAsB,KAAK,IAC1B,YAAY,KAAK,IAAa,QAAQ,KAAK,GAGrC,OADP,QAAQ,IAAI,mCACL,EAAoB,EAAA,qBAAA,EAAU,GAKnC,GAAA,6BAA6B,KAAK,GAE7B,OADP,QAAQ,IAAI,0CACL,GAAQ,EAA8B,EAAA,+BAAA,IAKzC,MAAA,EAAY,EAAS,MAAM,MAAM,OACnC,GAAA,GAAa,GAAK,IAAc,EAAS,MAAM,aAAa,OAEvD,OADP,QAAQ,IAAI,uCACL,GAAQ,EAAuB,EAAA,wBAAA,IAGlC,MAAA,GAAgB,EAAoB,EAAA,qBAAA,GACtC,GAAA,EAEK,OADP,QAAQ,IAAI,2CACL,EAKJ,OAAA,OAGH,SAAgB,EAAmC,GAExD,OAAA,EAAA,UAAA,OAAA,EAAA,YADQ,OAAA,EAA2B,EAAA,4BAAA","file":"import.e3a73ef4.js","sourceRoot":"../../assets","sourcesContent":["import {CPUProfile, CPUProfileNode} from './chrome'\n\n/**\n * This importer handles an old format used by the C++ API of V8. This format is still used by v8-profiler-node8.\n * There are two differences between the two formats:\n * - Nodes are a tree in the old format and a flat array in the new format\n * - Weights are timestamps in the old format and deltas in the new format.\n *\n * For more information, see https://github.com/hyj1991/v8-profiler-node8\n */\n\ninterface OldCPUProfileNode {\n functionName: string\n lineNumber: number\n scriptId: string\n url: string\n hitCount: number\n bailoutReason: string\n id: number\n children: OldCPUProfileNode[]\n}\n\nexport interface OldCPUProfile {\n startTime: number\n endTime: number\n head: OldCPUProfileNode\n samples: number[]\n timestamps: number[]\n}\n\nfunction treeToArray(root: OldCPUProfileNode): CPUProfileNode[] {\n const nodes: CPUProfileNode[] = []\n function visit(node: OldCPUProfileNode) {\n nodes.push({\n id: node.id,\n callFrame: {\n columnNumber: 0,\n functionName: node.functionName,\n lineNumber: node.lineNumber,\n scriptId: node.scriptId,\n url: node.url,\n },\n hitCount: node.hitCount,\n children: node.children.map(child => child.id),\n })\n node.children.forEach(visit)\n }\n visit(root)\n return nodes\n}\n\nfunction timestampsToDeltas(timestamps: number[], startTime: number): number[] {\n return timestamps.map((timestamp, index) => {\n const lastTimestamp = index === 0 ? startTime * 1000000 : timestamps[index - 1]\n return timestamp - lastTimestamp\n })\n}\n\n/**\n * Convert the old tree-based format to the new flat-array based format\n */\nexport function chromeTreeToNodes(content: OldCPUProfile): CPUProfile {\n // Note that both startTime and endTime are now in microseconds\n return {\n samples: content.samples,\n startTime: content.startTime * 1000000,\n endTime: content.endTime * 1000000,\n nodes: treeToArray(content.head),\n timeDeltas: timestampsToDeltas(content.timestamps, content.startTime),\n }\n}\n","import {Profile, FrameInfo, CallTreeProfileBuilder, ProfileGroup} from '../lib/profile'\nimport {getOrInsert, lastOf, sortBy, itForEach} from '../lib/utils'\nimport {TimeFormatter} from '../lib/value-formatters'\nimport {chromeTreeToNodes, OldCPUProfile} from './v8cpuFormatter'\n\n// See: https://github.com/v8/v8/blob/master/src/inspector/js_protocol.json\n\ninterface TimelineEvent {\n pid: number\n tid: number\n ts: number\n ph: string\n cat: string\n name: string\n dur: number\n tdur: number\n tts: number\n args: {[key: string]: any}\n id?: string\n}\n\ninterface PositionTickInfo {\n line: number\n ticks: number\n}\n\ninterface CPUProfileCallFrame {\n columnNumber: number\n functionName: string\n lineNumber: number\n scriptId: string\n url: string\n}\n\nexport interface CPUProfileNode {\n callFrame: CPUProfileCallFrame\n hitCount: number\n id: number\n children?: number[]\n positionTicks?: PositionTickInfo[]\n parent?: CPUProfileNode\n}\n\nexport interface CPUProfile {\n startTime: number\n endTime: number\n nodes: CPUProfileNode[]\n samples: number[]\n timeDeltas: number[]\n}\n\nexport function isChromeTimeline(rawProfile: any): boolean {\n if (!Array.isArray(rawProfile)) return false\n if (rawProfile.length < 1) return false\n const first = rawProfile[0]\n if (!('pid' in first && 'tid' in first && 'ph' in first && 'cat' in first)) return false\n if (\n !rawProfile.find(\n e => e.name === 'CpuProfile' || e.name === 'Profile' || e.name === 'ProfileChunk',\n )\n )\n return false\n return true\n}\n\nexport function importFromChromeTimeline(events: TimelineEvent[], fileName: string): ProfileGroup {\n // It seems like sometimes Chrome timeline files contain multiple CpuProfiles?\n // For now, choose the first one in the list.\n\n const cpuProfileByID = new Map<string, CPUProfile>()\n\n // Maps profile IDs (like \"0x3\") to pid/tid pairs formatted as `${pid}:${tid}`\n const pidTidById = new Map<string, string>()\n\n // Maps pid/tid pairs to thread names\n const threadNameByPidTid = new Map<string, string>()\n\n // The events aren't necessarily recorded in chronological order. Sort them so\n // that they are.\n sortBy(events, e => e.ts)\n\n for (let event of events) {\n if (event.name === 'CpuProfile') {\n const pidTid = `${event.pid}:${event.tid}`\n const id = event.id || pidTid\n cpuProfileByID.set(id, event.args.data.cpuProfile as CPUProfile)\n pidTidById.set(id, pidTid)\n }\n\n if (event.name === 'Profile') {\n const pidTid = `${event.pid}:${event.tid}`\n cpuProfileByID.set(event.id || pidTid, {\n startTime: 0,\n endTime: 0,\n nodes: [],\n samples: [],\n timeDeltas: [],\n ...event.args.data,\n })\n\n if (event.id) {\n pidTidById.set(event.id, `${event.pid}:${event.tid}`)\n }\n }\n\n if (event.name === 'thread_name') {\n threadNameByPidTid.set(`${event.pid}:${event.tid}`, event.args.name)\n }\n\n if (event.name === 'ProfileChunk') {\n const pidTid = `${event.pid}:${event.tid}`\n const cpuProfile = cpuProfileByID.get(event.id || pidTid)\n if (cpuProfile) {\n const chunk = event.args.data\n if (chunk.cpuProfile) {\n if (chunk.cpuProfile.nodes) {\n cpuProfile.nodes = cpuProfile.nodes.concat(chunk.cpuProfile.nodes)\n }\n if (chunk.cpuProfile.samples) {\n cpuProfile.samples = cpuProfile.samples.concat(chunk.cpuProfile.samples)\n }\n }\n if (chunk.timeDeltas) {\n cpuProfile.timeDeltas = cpuProfile.timeDeltas.concat(chunk.timeDeltas)\n }\n if (chunk.startTime != null) {\n cpuProfile.startTime = chunk.startTime\n }\n if (chunk.endTime != null) {\n cpuProfile.endTime = chunk.endTime\n }\n } else {\n console.warn(`Ignoring ProfileChunk for undeclared Profile with id ${event.id || pidTid}`)\n }\n }\n }\n\n if (cpuProfileByID.size > 0) {\n const profiles: Profile[] = []\n let indexToView = 0\n\n itForEach(cpuProfileByID.keys(), profileId => {\n let threadName: string | null = null\n let pidTid = pidTidById.get(profileId)\n if (pidTid) {\n threadName = threadNameByPidTid.get(pidTid) || null\n if (threadName) {\n }\n }\n const profile = importFromChromeCPUProfile(cpuProfileByID.get(profileId)!)\n if (threadName && cpuProfileByID.size > 1) {\n profile.setName(`${fileName} - ${threadName}`)\n if (threadName === 'CrRendererMain') {\n indexToView = profiles.length\n }\n } else {\n profile.setName(`${fileName}`)\n }\n profiles.push(profile)\n })\n\n return {name: fileName, indexToView, profiles}\n } else {\n throw new Error('Could not find CPU profile in Timeline')\n }\n}\n\nconst callFrameToFrameInfo = new Map<CPUProfileCallFrame, FrameInfo>()\nfunction frameInfoForCallFrame(callFrame: CPUProfileCallFrame) {\n return getOrInsert(callFrameToFrameInfo, callFrame, callFrame => {\n const name = callFrame.functionName || '(anonymous)'\n const file = callFrame.url\n\n // In Chrome profiles, line numbers & column numbers are both 0-indexed.\n //\n // We're going to normalize these to be 1-based to avoid needing to normalize\n // these at the presentation layer.\n let line = callFrame.lineNumber\n if (line != null) line++\n\n let col = callFrame.columnNumber\n if (col != null) col++\n\n return {\n key: `${name}:${file}:${line}:${col}`,\n name,\n file,\n line,\n col,\n }\n })\n}\n\nfunction shouldIgnoreFunction(callFrame: CPUProfileCallFrame) {\n const {functionName, url} = callFrame\n if (url === 'native dummy.js') {\n // I'm not really sure what this is about, but this seems to be used\n // as a way of avoiding edge cases in V8's implementation.\n // See: https://github.com/v8/v8/blob/b8626ca4/tools/js2c.py#L419-L424\n return true\n }\n return functionName === '(root)' || functionName === '(idle)'\n}\n\nfunction shouldPlaceOnTopOfPreviousStack(functionName: string) {\n return functionName === '(garbage collector)' || functionName === '(program)'\n}\n\nexport function importFromChromeCPUProfile(chromeProfile: CPUProfile): Profile {\n const profile = new CallTreeProfileBuilder(chromeProfile.endTime - chromeProfile.startTime)\n\n const nodeById = new Map<number, CPUProfileNode>()\n for (let node of chromeProfile.nodes) {\n nodeById.set(node.id, node)\n }\n for (let node of chromeProfile.nodes) {\n if (typeof node.parent === 'number') {\n node.parent = nodeById.get(node.parent)\n }\n\n if (!node.children) continue\n for (let childId of node.children) {\n const child = nodeById.get(childId)\n if (!child) continue\n child.parent = node\n }\n }\n\n const samples: number[] = []\n const sampleTimes: number[] = []\n\n // The first delta is relative to the profile startTime.\n // Ref: https://github.com/v8/v8/blob/44bd8fd7/src/inspector/js_protocol.json#L1485\n let elapsed = chromeProfile.timeDeltas[0]\n\n // Prevents negative time deltas from causing bad data. See\n // https://github.com/jlfwong/speedscope/pull/305 for details.\n let lastValidElapsed = elapsed\n\n let lastNodeId = NaN\n\n // The chrome CPU profile format doesn't collapse identical samples. We'll do that\n // here to save a ton of work later doing mergers.\n for (let i = 0; i < chromeProfile.samples.length; i++) {\n const nodeId = chromeProfile.samples[i]\n if (nodeId != lastNodeId) {\n samples.push(nodeId)\n if (elapsed < lastValidElapsed) {\n sampleTimes.push(lastValidElapsed)\n } else {\n sampleTimes.push(elapsed)\n lastValidElapsed = elapsed\n }\n }\n\n if (i === chromeProfile.samples.length - 1) {\n if (!isNaN(lastNodeId)) {\n samples.push(lastNodeId)\n if (elapsed < lastValidElapsed) {\n sampleTimes.push(lastValidElapsed)\n } else {\n sampleTimes.push(elapsed)\n lastValidElapsed = elapsed\n }\n }\n } else {\n const timeDelta = chromeProfile.timeDeltas[i + 1]\n elapsed += timeDelta\n lastNodeId = nodeId\n }\n }\n\n let prevStack: CPUProfileNode[] = []\n\n for (let i = 0; i < samples.length; i++) {\n const value = sampleTimes[i]\n const nodeId = samples[i]\n let stackTop = nodeById.get(nodeId)\n if (!stackTop) continue\n\n // Find lowest common ancestor of the current stack and the previous one\n let lca: CPUProfileNode | null = null\n\n // This is O(n^2), but n should be relatively small here (stack height),\n // so hopefully this isn't much of a problem\n for (\n lca = stackTop;\n lca && prevStack.indexOf(lca) === -1;\n lca = shouldPlaceOnTopOfPreviousStack(lca.callFrame.functionName)\n ? lastOf(prevStack)\n : lca.parent || null\n ) {}\n\n // Close frames that are no longer open\n while (prevStack.length > 0 && lastOf(prevStack) != lca) {\n const closingNode = prevStack.pop()!\n const frame = frameInfoForCallFrame(closingNode.callFrame)\n profile.leaveFrame(frame, value)\n }\n\n // Open frames that are now becoming open\n const toOpen: CPUProfileNode[] = []\n for (\n let node: CPUProfileNode | null = stackTop;\n node && node != lca && !shouldIgnoreFunction(node.callFrame);\n // Place Chrome internal functions on top of the previous call stack\n node = shouldPlaceOnTopOfPreviousStack(node.callFrame.functionName)\n ? lastOf(prevStack)\n : node.parent || null\n ) {\n toOpen.push(node)\n }\n toOpen.reverse()\n\n for (let node of toOpen) {\n profile.enterFrame(frameInfoForCallFrame(node.callFrame), value)\n }\n\n prevStack = prevStack.concat(toOpen)\n }\n\n // Close frames that are open at the end of the trace\n for (let i = prevStack.length - 1; i >= 0; i--) {\n profile.leaveFrame(frameInfoForCallFrame(prevStack[i].callFrame), lastOf(sampleTimes)!)\n }\n\n profile.setValueFormatter(new TimeFormatter('microseconds'))\n return profile.build()\n}\n\nexport function importFromOldV8CPUProfile(content: OldCPUProfile): Profile {\n return importFromChromeCPUProfile(chromeTreeToNodes(content))\n}\n","// https://github.com/tmm1/stackprof\n\nimport {Profile, FrameInfo, StackListProfileBuilder} from '../lib/profile'\nimport {TimeFormatter} from '../lib/value-formatters'\n\ninterface StackprofFrame {\n name: string\n file?: string\n line?: number\n}\n\nexport interface StackprofProfile {\n frames: {[number: string]: StackprofFrame}\n raw: number[]\n raw_timestamp_deltas: number[]\n}\n\nexport function importFromStackprof(stackprofProfile: StackprofProfile): Profile {\n const duration = stackprofProfile.raw_timestamp_deltas.reduce((a, b) => a + b, 0)\n const profile = new StackListProfileBuilder(duration)\n\n const {frames, raw, raw_timestamp_deltas} = stackprofProfile\n let sampleIndex = 0\n\n let prevStack: FrameInfo[] = []\n\n for (let i = 0; i < raw.length; ) {\n const stackHeight = raw[i++]\n\n let stack: FrameInfo[] = []\n for (let j = 0; j < stackHeight; j++) {\n const id = raw[i++]\n stack.push({\n key: id,\n ...frames[id],\n })\n }\n if (stack.length === 1 && stack[0].name === '(garbage collection)') {\n stack = prevStack.concat(stack)\n }\n const nSamples = raw[i++]\n\n let sampleDuration = 0\n for (let j = 0; j < nSamples; j++) {\n sampleDuration += raw_timestamp_deltas[sampleIndex++]\n }\n\n profile.appendSampleWithWeight(stack, sampleDuration)\n prevStack = stack\n }\n\n profile.setValueFormatter(new TimeFormatter('microseconds'))\n return profile.build()\n}\n","'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n return;\n }\n // Fallback to ordinary array\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n};\n\nvar fnUntyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n};\n\nexports.setTyped(TYPED_OK);\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits = /* extra bits for each length code */\n [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];\n\nvar extra_dbits = /* extra bits for each distance code */\n [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];\n\nvar extra_blbits = /* extra bits for each bit length code */\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short(s, w) {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n}\n\n\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nfunction gen_bitlen(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n{\n var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS; bits++) {\n next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n var len = tree[n * 2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n var n; /* iterates over tree elements */\n var bits; /* bit counter */\n var length; /* length value */\n var code; /* code value */\n var dist; /* distance index */\n var bl_count = new Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n{\n var v = s.heap[k];\n var j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n var black_mask = 0xf3ffc07f;\n var n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //var out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize - 1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n}\n\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n","'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\n crc ^= -1;\n\n for (var i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar trees = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY = 0;\n//var Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction flush_block_only(s, last) {\n trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n// put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n var strend = s.strstart + MAX_MATCH;\n var scan_end1 = _win[scan + best_len - 1];\n var scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// var curr = s.strstart + s.lookahead;\n// var init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n var max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n var max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* scan goes up to strend for length of run */\n\n var _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);\n this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);\n this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\nfunction deflateResetKeep(strm) {\n var s;\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new utils.Buf8(s.w_size * 2);\n s.head = new utils.Buf16(s.hash_size);\n s.prev = new utils.Buf16(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n s = strm.state;\n\n if (!strm.output ||\n (!strm.input && strm.avail_in !== 0) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n s.strm = strm; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n else // DEFLATE header\n {\n var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n var level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush));\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n trees._tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var s;\n var str, n;\n var wrap;\n var avail;\n var next;\n var input;\n var tmpDict;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n s = strm.state;\n wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n tmpDict = new utils.Buf8(s.w_size);\n utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n avail = strm.avail_in;\n next = strm.next_in;\n input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n str = s.strstart;\n n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","// String encode/decode helpers\n'use strict';\n\n\nvar utils = require('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new utils.Buf8(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n // use fallback for big arrays to avoid stack overflow\n if (len < 65537) {\n if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nexports.utf8border = function (buf, max) {\n var pos;\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","'use strict';\n\n\nvar zlib_deflate = require('./zlib/deflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH = 0;\nvar Z_FINISH = 4;\n\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_SYNC_FLUSH = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY = 0;\n\nvar Z_DEFLATED = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n if (!(this instanceof Deflate)) return new Deflate(options);\n\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_deflate.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n var dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var status, _mode;\n\n if (this.ended) { return false; }\n\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n status = zlib_deflate.deflate(strm, _mode); /* no bad return value */\n\n if (status !== Z_STREAM_END && status !== Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n if (this.options.to === 'string') {\n this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n // Finalize on the last chunk.\n if (_mode === Z_FINISH) {\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === Z_SYNC_FLUSH) {\n this.onEnd(Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n var deflator = new Deflate(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\n//var Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window, src, end - copy, copy, 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* permutation of code lengths */\n [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n utils.arraySet(output, input, next, copy, put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inflate_fast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nmodule.exports = GZheader;\n","'use strict';\n\n\nvar zlib_inflate = require('./zlib/inflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar c = require('./zlib/constants');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\nvar GZheader = require('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n if (!(this instanceof Inflate)) return new Inflate(options);\n\n this.options = utils.assign({\n chunkSize: 16384,\n windowBits: 0,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_inflate.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new GZheader();\n\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n}\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var dictionary = this.options.dictionary;\n var status, _mode;\n var next_out_utf8, tail, utf8str;\n var dict;\n\n // Flag to properly process Z_BUF_ERROR on testing inflate call\n // when we check that all output data was flushed.\n var allowBufError = false;\n\n if (this.ended) { return false; }\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // Only binary strings can be decompressed on practice\n strm.input = strings.binstring2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */\n\n if (status === c.Z_NEED_DICT && dictionary) {\n // Convert data if needed\n if (typeof dictionary === 'string') {\n dict = strings.string2buf(dictionary);\n } else if (toString.call(dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(dictionary);\n } else {\n dict = dictionary;\n }\n\n status = zlib_inflate.inflateSetDictionary(this.strm, dict);\n\n }\n\n if (status === c.Z_BUF_ERROR && allowBufError === true) {\n status = c.Z_OK;\n allowBufError = false;\n }\n\n if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n if (this.options.to === 'string') {\n\n next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n tail = strm.next_out - next_out_utf8;\n utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n this.onData(utf8str);\n\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n }\n\n // When no more input data, we should check that internal inflate buffers\n // are flushed. The only way to do it when avail_out = 0 - run one more\n // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n // Here we set flag to process this error properly.\n //\n // NOTE. Deflate does not return error in this case and does not needs such\n // logic.\n if (strm.avail_in === 0 && strm.avail_out === 0) {\n allowBufError = true;\n }\n\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n if (status === c.Z_STREAM_END) {\n _mode = c.Z_FINISH;\n }\n\n // Finalize on the last chunk.\n if (_mode === c.Z_FINISH) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === c.Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === c.Z_SYNC_FLUSH) {\n this.onEnd(c.Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === c.Z_OK) {\n if (this.options.to === 'string') {\n // Glue & convert here, until we teach pako to send\n // utf8 aligned strings to onData\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n * , output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err)\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n var inflator = new Inflate(options);\n\n inflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip = inflate;\n","// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign = require('./lib/utils/common').assign;\n\nvar deflate = require('./lib/deflate');\nvar inflate = require('./lib/inflate');\nvar constants = require('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n","import * as pako from 'pako'\n\nexport interface ProfileDataSource {\n name(): Promise<string>\n readAsArrayBuffer(): Promise<ArrayBuffer>\n readAsText(): Promise<string>\n}\n\nexport class TextProfileDataSource implements ProfileDataSource {\n constructor(private fileName: string, private contents: string) {}\n async name() {\n return this.fileName\n }\n async readAsArrayBuffer() {\n // JavaScript strings are UTF-16 encoded, but if this string is\n // constructed based on\n\n // TODO(jlfwong): Might want to make this construct an array\n // buffer based on the text\n return new ArrayBuffer(0)\n }\n async readAsText() {\n return this.contents\n }\n}\n\nexport class MaybeCompressedDataReader implements ProfileDataSource {\n private uncompressedData: Promise<ArrayBuffer>\n\n constructor(\n private namePromise: Promise<string>,\n maybeCompressedDataPromise: Promise<ArrayBuffer>,\n ) {\n this.uncompressedData = maybeCompressedDataPromise.then(async (fileData: ArrayBuffer) => {\n try {\n const result = pako.inflate(new Uint8Array(fileData)).buffer\n return result\n } catch (e) {\n return fileData\n }\n })\n }\n\n async name(): Promise<string> {\n return await this.namePromise\n }\n\n async readAsArrayBuffer(): Promise<ArrayBuffer> {\n return await this.uncompressedData\n }\n\n async readAsText(): Promise<string> {\n const buffer = await this.readAsArrayBuffer()\n\n // By default, we assume the file is utf-8 encoded.\n let encoding = 'utf-8'\n\n const array = new Uint8Array(buffer)\n if (array.length > 2) {\n if (array[0] === 0xff && array[1] === 0xfe) {\n // UTF-16, Little Endian encoding\n encoding = 'utf-16le'\n } else if (array[0] === 0xfe && array[1] === 0xff) {\n // UTF-16, Big Endian encoding\n encoding = 'utf-16be'\n }\n }\n\n if (typeof TextDecoder !== 'undefined') {\n const decoder = new TextDecoder(encoding)\n return decoder.decode(buffer)\n } else {\n // JavaScript strings are UTF-16 encoded, but we're reading data from disk\n // that we're going to blindly assume it's ASCII encoded. This codepath\n // only exists for older browser support.\n console.warn('This browser does not support TextDecoder. Decoding text as ASCII.')\n let ret: string = ''\n for (let i = 0; i < array.length; i++) {\n ret += String.fromCharCode(array[i])\n }\n return ret\n }\n }\n\n static fromFile(file: File): MaybeCompressedDataReader {\n const maybeCompressedDataPromise: Promise<ArrayBuffer> = new Promise(resolve => {\n const reader = new FileReader()\n reader.addEventListener('loadend', () => {\n if (!(reader.result instanceof ArrayBuffer)) {\n throw new Error('Expected reader.result to be an instance of ArrayBuffer')\n }\n resolve(reader.result)\n })\n reader.readAsArrayBuffer(file)\n })\n\n return new MaybeCompressedDataReader(Promise.resolve(file.name), maybeCompressedDataPromise)\n }\n\n static fromArrayBuffer(name: string, buffer: ArrayBuffer): MaybeCompressedDataReader {\n return new MaybeCompressedDataReader(Promise.resolve(name), Promise.resolve(buffer))\n }\n}\n","// This file contains methods to import data from OS X Instruments.app\n// https://developer.apple.com/library/content/documentation/DeveloperTools/Conceptual/InstrumentsUserGuide/index.html\n\nimport {\n Profile,\n FrameInfo,\n CallTreeProfileBuilder,\n StackListProfileBuilder,\n ProfileGroup,\n} from '../lib/profile'\nimport {sortBy, getOrThrow, getOrInsert, lastOf, getOrElse, zeroPad} from '../lib/utils'\nimport {ByteFormatter, TimeFormatter} from '../lib/value-formatters'\nimport {FileSystemDirectoryEntry, FileSystemEntry, FileSystemFileEntry} from './file-system-entry'\nimport {MaybeCompressedDataReader} from './utils'\n\nfunction parseTSV<T>(contents: string): T[] {\n const lines = contents.split('\\n').map(l => l.split('\\t'))\n\n const headerLine = lines.shift()\n if (!headerLine) return []\n\n const indexToField = new Map<number, string>()\n for (let i = 0; i < headerLine.length; i++) {\n indexToField.set(i, headerLine[i])\n }\n\n const ret: T[] = []\n for (let line of lines) {\n const row = {} as T\n for (let i = 0; i < line.length; i++) {\n ;(row as any)[indexToField.get(i)!] = line[i]\n }\n ret.push(row)\n }\n return ret\n}\n\ninterface PastedTimeProfileRow {\n Weight?: string\n 'Source Path'?: string\n 'Symbol Name'?: string\n}\n\ninterface PastedAllocationsProfileRow {\n 'Bytes Used'?: string\n 'Source Path'?: string\n 'Symbol Name'?: string\n}\n\ninterface FrameInfoWithWeight extends FrameInfo {\n endValue: number\n}\n\nfunction getWeight(deepCopyRow: any): number {\n if ('Bytes Used' in deepCopyRow) {\n const bytesUsedString = deepCopyRow['Bytes Used']\n const parts = /\\s*(\\d+(?:[.]\\d+)?) (\\w+)\\s+(?:\\d+(?:[.]\\d+))%/.exec(bytesUsedString)\n if (!parts) return 0\n const value = parseInt(parts[1], 10)\n const units = parts[2]\n\n switch (units) {\n case 'Bytes':\n return value\n case 'KB':\n return 1024 * value\n case 'MB':\n return 1024 * 1024 * value\n case 'GB':\n return 1024 * 1024 * 1024 * value\n }\n throw new Error(`Unrecognized units ${units}`)\n }\n\n if ('Weight' in deepCopyRow || 'Running Time' in deepCopyRow) {\n const weightString = deepCopyRow['Weight'] || deepCopyRow['Running Time']\n const parts = /\\s*(\\d+(?:[.]\\d+)?) ?(\\w+)\\s+(?:\\d+(?:[.]\\d+))%/.exec(weightString)\n if (!parts) return 0\n const value = parseInt(parts[1], 10)\n const units = parts[2]\n\n switch (units) {\n case 'ms':\n return value\n case 's':\n return 1000 * value\n case 'min':\n return 1000 * value\n }\n throw new Error(`Unrecognized units ${units}`)\n }\n\n return -1\n}\n\n// Import from a deep copy made of a profile\nexport function importFromInstrumentsDeepCopy(contents: string): Profile {\n const profile = new CallTreeProfileBuilder()\n const rows = parseTSV<PastedTimeProfileRow | PastedAllocationsProfileRow>(contents)\n\n const stack: FrameInfoWithWeight[] = []\n let cumulativeValue: number = 0\n\n for (let row of rows) {\n const symbolName = row['Symbol Name']\n if (!symbolName) continue\n const trimmedSymbolName = symbolName.trim()\n let stackDepth = symbolName.length - trimmedSymbolName.length\n\n if (stack.length - stackDepth < 0) {\n throw new Error('Invalid format')\n }\n\n let framesToLeave: FrameInfoWithWeight[] = []\n\n while (stackDepth < stack.length) {\n const stackTop = stack.pop()!\n framesToLeave.push(stackTop)\n }\n\n for (let frameToLeave of framesToLeave) {\n cumulativeValue = Math.max(cumulativeValue, frameToLeave.endValue)\n profile.leaveFrame(frameToLeave, cumulativeValue)\n }\n\n const newFrameInfo: FrameInfoWithWeight = {\n key: `${row['Source Path'] || ''}:${trimmedSymbolName}`,\n name: trimmedSymbolName,\n file: row['Source Path'],\n endValue: cumulativeValue + getWeight(row),\n }\n\n profile.enterFrame(newFrameInfo, cumulativeValue)\n stack.push(newFrameInfo)\n }\n\n while (stack.length > 0) {\n const frameToLeave = stack.pop()!\n cumulativeValue = Math.max(cumulativeValue, frameToLeave.endValue)\n profile.leaveFrame(frameToLeave, cumulativeValue)\n }\n\n if ('Bytes Used' in rows[0]) {\n profile.setValueFormatter(new ByteFormatter())\n } else if ('Weight' in rows[0] || 'Running Time' in rows[0]) {\n profile.setValueFormatter(new TimeFormatter('milliseconds'))\n }\n\n return profile.build()\n}\n\ninterface TraceDirectoryTree {\n name: string\n files: Map<string, File>\n subdirectories: Map<string, TraceDirectoryTree>\n}\n\nasync function extractDirectoryTree(entry: FileSystemDirectoryEntry): Promise<TraceDirectoryTree> {\n const node: TraceDirectoryTree = {\n name: entry.name,\n files: new Map(),\n subdirectories: new Map(),\n }\n\n const children = await new Promise<FileSystemEntry[]>((resolve, reject) => {\n entry.createReader().readEntries((entries: any[]) => {\n resolve(entries)\n }, reject)\n })\n\n for (let child of children) {\n if (child.isDirectory) {\n const subtree = await extractDirectoryTree(child as FileSystemDirectoryEntry)\n node.subdirectories.set(subtree.name, subtree)\n } else {\n const file = await new Promise<File>((resolve, reject) => {\n ;(child as FileSystemFileEntry).file(resolve, reject)\n })\n node.files.set(file.name, file)\n }\n }\n\n return node\n}\n\nfunction readAsArrayBuffer(file: File): Promise<ArrayBuffer> {\n return MaybeCompressedDataReader.fromFile(file).readAsArrayBuffer()\n}\n\nfunction readAsText(file: File): Promise<string> {\n return MaybeCompressedDataReader.fromFile(file).readAsText()\n}\n\nfunction getCoreDirForRun(tree: TraceDirectoryTree, selectedRun: number): TraceDirectoryTree {\n const corespace = getOrThrow(tree.subdirectories, 'corespace')\n const corespaceRunDir = getOrThrow(corespace.subdirectories, `run${selectedRun}`)\n return getOrThrow(corespaceRunDir.subdirectories, 'core')\n}\n\nclass BinReader {\n private bytePos: number = 0\n private view: DataView\n constructor(buffer: ArrayBuffer) {\n this.view = new DataView(buffer)\n }\n seek(pos: number) {\n this.bytePos = pos\n }\n skip(byteCount: number) {\n this.bytePos += byteCount\n }\n hasMore() {\n return this.bytePos < this.view.byteLength\n }\n bytesLeft() {\n return this.view.byteLength - this.bytePos\n }\n readUint8() {\n this.bytePos++\n if (this.bytePos > this.view.byteLength) return 0\n return this.view.getUint8(this.bytePos - 1)\n }\n\n // Note: we intentionally use Math.pow here rather than bit shifts\n // because JavaScript doesn't have true 64 bit integers.\n readUint32() {\n this.bytePos += 4\n if (this.bytePos > this.view.byteLength) return 0\n return this.view.getUint32(this.bytePos - 4, true)\n }\n readUint48() {\n this.bytePos += 6\n if (this.bytePos > this.view.byteLength) return 0\n\n return (\n this.view.getUint32(this.bytePos - 6, true) +\n this.view.getUint16(this.bytePos - 2, true) * Math.pow(2, 32)\n )\n }\n readUint64() {\n this.bytePos += 8\n if (this.bytePos > this.view.byteLength) return 0\n return (\n this.view.getUint32(this.bytePos - 8, true) +\n this.view.getUint32(this.bytePos - 4, true) * Math.pow(2, 32)\n )\n }\n}\n\ninterface Sample {\n timestamp: number\n threadID: number\n backtraceID: number\n}\n\nasync function getRawSampleList(core: TraceDirectoryTree): Promise<Sample[]> {\n const stores = getOrThrow(core.subdirectories, 'stores')\n for (let storedir of stores.subdirectories.values()) {\n const schemaFile = storedir.files.get('schema.xml')\n if (!schemaFile) continue\n const schema = await readAsText(schemaFile)\n if (!/name=\"time-profile\"/.exec(schema)) {\n continue\n }\n const bulkstore = new BinReader(\n await readAsArrayBuffer(getOrThrow(storedir.files, 'bulkstore')),\n )\n // Ignore the first 3 words\n bulkstore.readUint32()\n bulkstore.readUint32()\n bulkstore.readUint32()\n const headerSize = bulkstore.readUint32()\n const bytesPerEntry = bulkstore.readUint32()\n\n bulkstore.seek(headerSize)\n\n const samples: Sample[] = []\n while (true) {\n // Schema as of Instruments 8.3.3 is a 6 byte timestamp, followed by a bunch\n // of stuff we don't care about, followed by a 4 byte backtrace ID\n const timestamp = bulkstore.readUint48()\n if (timestamp === 0) break\n\n const threadID = bulkstore.readUint32()\n\n bulkstore.skip(bytesPerEntry - 6 - 4 - 4)\n const backtraceID = bulkstore.readUint32()\n samples.push({timestamp, threadID, backtraceID})\n }\n return samples\n }\n throw new Error('Could not find sample list')\n}\n\nasync function getIntegerArrays(samples: Sample[], core: TraceDirectoryTree): Promise<number[][]> {\n const uniquing = getOrThrow(core.subdirectories, 'uniquing')\n const arrayUniquer = getOrThrow(uniquing.subdirectories, 'arrayUniquer')\n const integeruniquerindex = getOrThrow(arrayUniquer.files, 'integeruniquer.index')\n const integeruniquerdata = getOrThrow(arrayUniquer.files, 'integeruniquer.data')\n\n // integeruniquer.index is a binary file containing an array of [byte offset, MB offset] pairs\n // that indicate where array data starts in the .data file\n\n // integeruniquer.data is a binary file containing an array of arrays of 64 bit integer.\n // The schema is a 32 byte header followed by a stream of arrays.\n // Each array consists of a 4 byte size N followed by N 8 byte little endian integers\n\n // This table contains the memory addresses of stack frames\n\n const indexreader = new BinReader(await readAsArrayBuffer(integeruniquerindex))\n const datareader = new BinReader(await readAsArrayBuffer(integeruniquerdata))\n\n // Header we don't care about\n indexreader.seek(32)\n\n let arrays: number[][] = []\n\n while (indexreader.hasMore()) {\n const byteOffset = indexreader.readUint32() + indexreader.readUint32() * (1024 * 1024)\n\n if (byteOffset === 0) {\n // The first entry in the index table seems to just indicate the offset of\n // the header into the data file\n continue\n }\n\n datareader.seek(byteOffset)\n\n let length = datareader.readUint32()\n let array: number[] = []\n\n while (length--) {\n array.push(datareader.readUint64())\n }\n arrays.push(array)\n }\n\n return arrays\n}\n\ninterface SymbolInfo {\n symbolName: string | null\n sourcePath: string | null\n addressToLine: Map<number, number>\n}\n\ninterface FormTemplateRunData {\n number: number\n addressToFrameMap: Map<number, FrameInfo>\n}\n\ninterface FormTemplateData {\n version: number\n selectedRunNumber: number\n instrument: string\n runs: FormTemplateRunData[]\n}\n\nasync function readFormTemplate(tree: TraceDirectoryTree): Promise<FormTemplateData> {\n const formTemplate = getOrThrow(tree.files, 'form.template')\n const archive = readInstrumentsKeyedArchive(await readAsArrayBuffer(formTemplate))\n\n const version = archive['com.apple.xray.owner.template.version']\n let selectedRunNumber = 1\n if ('com.apple.xray.owner.template' in archive) {\n selectedRunNumber = archive['com.apple.xray.owner.template'].get('_selectedRunNumber')\n }\n let instrument = archive['$1']\n if ('stubInfoByUUID' in archive) {\n instrument = Array.from(archive['stubInfoByUUID'].keys())[0]\n }\n const allRunData = archive['com.apple.xray.run.data']\n\n const runs: FormTemplateRunData[] = []\n for (let runNumber of allRunData.runNumbers) {\n const runData = getOrThrow<number, Map<any, any>>(allRunData.runData, runNumber)\n\n const symbolsByPid = getOrThrow<string, Map<number, {symbols: SymbolInfo[]}>>(\n runData,\n 'symbolsByPid',\n )\n\n const addressToFrameMap = new Map<number, FrameInfo>()\n\n // TODO(jlfwong): Deal with profiles with conflicting addresses?\n for (let symbols of symbolsByPid.values()) {\n for (let symbol of symbols.symbols) {\n if (!symbol) continue\n const {sourcePath, symbolName, addressToLine} = symbol\n for (let address of addressToLine.keys()) {\n getOrInsert(addressToFrameMap, address, () => {\n const name = symbolName || `0x${zeroPad(address.toString(16), 16)}`\n const frame: FrameInfo = {\n key: `${sourcePath}:${name}`,\n name: name,\n }\n if (sourcePath) {\n frame.file = sourcePath\n }\n return frame\n })\n }\n }\n\n runs.push({\n number: runNumber,\n addressToFrameMap,\n })\n }\n }\n\n return {\n version,\n instrument,\n selectedRunNumber,\n runs,\n }\n}\n\n// Import from a .trace file saved from Mac Instruments.app\nexport async function importFromInstrumentsTrace(\n entry: FileSystemDirectoryEntry,\n): Promise<ProfileGroup> {\n const tree = await extractDirectoryTree(entry)\n\n const {version, runs, instrument, selectedRunNumber} = await readFormTemplate(tree)\n if (instrument !== 'com.apple.xray.instrument-type.coresampler2') {\n throw new Error(\n `The only supported instrument from .trace import is \"com.apple.xray.instrument-type.coresampler2\". Got ${instrument}`,\n )\n }\n console.log('version: ', version)\n console.log(`Importing time profile`)\n\n const profiles: Profile[] = []\n let indexToView = 0\n\n for (let run of runs) {\n const {addressToFrameMap, number} = run\n const group = await importRunFromInstrumentsTrace({\n fileName: entry.name,\n tree,\n addressToFrameMap,\n runNumber: number,\n })\n\n if (run.number === selectedRunNumber) {\n indexToView = profiles.length + group.indexToView\n }\n\n profiles.push(...group.profiles)\n }\n\n return {name: entry.name, indexToView, profiles}\n}\n\nexport async function importRunFromInstrumentsTrace(args: {\n fileName: string\n tree: TraceDirectoryTree\n addressToFrameMap: Map<number, FrameInfo>\n runNumber: number\n}): Promise<ProfileGroup> {\n const {fileName, tree, addressToFrameMap, runNumber} = args\n const core = getCoreDirForRun(tree, runNumber)\n let samples = await getRawSampleList(core)\n const arrays = await getIntegerArrays(samples, core)\n\n // We'll try to guess which thread is the main thread by assuming\n // it's the one with the most samples.\n const sampleCountByThreadID = new Map<number, number>()\n for (let sample of samples) {\n sampleCountByThreadID.set(\n sample.threadID,\n getOrElse(sampleCountByThreadID, sample.threadID, () => 0) + 1,\n )\n }\n const counts = Array.from(sampleCountByThreadID.entries())\n sortBy(counts, c => -c[1])\n const threadIDs = counts.map(c => c[0])\n\n return {\n name: fileName,\n indexToView: 0,\n profiles: threadIDs.map(threadID =>\n importThreadFromInstrumentsTrace({\n threadID,\n fileName,\n arrays,\n addressToFrameMap,\n samples,\n }),\n ),\n }\n}\n\nexport function importThreadFromInstrumentsTrace(args: {\n fileName: string\n addressToFrameMap: Map<number, FrameInfo>\n threadID: number\n arrays: number[][]\n samples: Sample[]\n}): Profile {\n let {fileName, addressToFrameMap, arrays, threadID, samples} = args\n\n const backtraceIDtoStack = new Map<number, FrameInfo[]>()\n samples = samples.filter(s => s.threadID === threadID)\n\n const profile = new StackListProfileBuilder(lastOf(samples)!.timestamp)\n profile.setName(`${fileName} - thread ${threadID}`)\n\n function appendRecursive(k: number, stack: FrameInfo[]) {\n const frame = addressToFrameMap.get(k)\n if (frame) {\n stack.push(frame)\n } else if (k in arrays) {\n for (let addr of arrays[k]) {\n appendRecursive(addr, stack)\n }\n } else {\n const rawAddressFrame: FrameInfo = {\n key: k,\n name: `0x${zeroPad(k.toString(16), 16)}`,\n }\n addressToFrameMap.set(k, rawAddressFrame)\n stack.push(rawAddressFrame)\n }\n }\n\n let lastTimestamp: null | number = null\n for (let sample of samples) {\n const stackForSample = getOrInsert(backtraceIDtoStack, sample.backtraceID, id => {\n const stack: FrameInfo[] = []\n appendRecursive(id, stack)\n stack.reverse()\n return stack\n })\n\n if (lastTimestamp === null) {\n // The first sample is sometimes fairly late in the profile for some reason.\n // We'll just say nothing was known to be on the stack in that time.\n profile.appendSampleWithWeight([], sample.timestamp)\n lastTimestamp = sample.timestamp\n }\n\n if (sample.timestamp < lastTimestamp) {\n throw new Error('Timestamps out of order!')\n }\n\n profile.appendSampleWithWeight(stackForSample, sample.timestamp - lastTimestamp)\n lastTimestamp = sample.timestamp\n }\n\n profile.setValueFormatter(new TimeFormatter('nanoseconds'))\n return profile.build()\n}\n\nexport function readInstrumentsKeyedArchive(buffer: ArrayBuffer): any {\n const byteArray = new Uint8Array(buffer)\n const parsedPlist = parseBinaryPlist(byteArray)\n const data = expandKeyedArchive(parsedPlist, ($classname, object) => {\n switch ($classname) {\n case 'NSTextStorage':\n case 'NSParagraphStyle':\n case 'NSFont':\n // Stuff that's irrelevant for constructing a flamegraph\n return null\n\n case 'PFTSymbolData': {\n const ret = Object.create(null)\n ret.symbolName = object.$0\n ret.sourcePath = object.$1\n ret.addressToLine = new Map<any, any>()\n for (let i = 3; ; i += 2) {\n const address = object['$' + i]\n const line = object['$' + (i + 1)]\n if (address == null || line == null) {\n break\n }\n ret.addressToLine.set(address, line)\n }\n return ret\n }\n\n case 'PFTOwnerData': {\n const ret = Object.create(null)\n ret.ownerName = object.$0\n ret.ownerPath = object.$1\n return ret\n }\n\n case 'PFTPersistentSymbols': {\n const ret = Object.create(null)\n const symbolCount = object.$4\n\n ret.threadNames = object.$3\n ret.symbols = []\n for (let i = 1; i < symbolCount; i++) {\n ret.symbols.push(object['$' + (4 + i)])\n }\n return ret\n }\n\n case 'XRRunListData': {\n const ret = Object.create(null)\n ret.runNumbers = object.$0\n ret.runData = object.$1\n return ret\n }\n\n case 'XRIntKeyedDictionary': {\n const ret = new Map()\n const size = object.$0\n for (let i = 0; i < size; i++) {\n const key = object['$' + (1 + 2 * i)]\n const value = object['$' + (1 + (2 * i + 1))]\n ret.set(key, value)\n }\n return ret\n }\n\n case 'XRCore': {\n const ret = Object.create(null)\n ret.number = object.$0\n ret.name = object.$1\n return ret\n }\n }\n return object\n })\n return data\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nexport function decodeUTF8(bytes: Uint8Array): string {\n let text = String.fromCharCode.apply(String, Array.from(bytes))\n if (text.slice(-1) === '\\0') text = text.slice(0, -1) // Remove a single trailing null character if present\n return decodeURIComponent(escape(text))\n}\n\nfunction isArray(value: any): boolean {\n return value instanceof Array\n}\n\nfunction isDictionary(value: any): boolean {\n return value !== null && typeof value === 'object' && Object.getPrototypeOf(value) === null\n}\n\nfunction followUID(objects: any[], value: any): any {\n return value instanceof UID ? objects[value.index] : value\n}\n\nfunction expandKeyedArchive(\n root: any,\n interpretClass: ($classname: string, obj: any) => any = x => x,\n): any {\n // Sanity checks\n if (\n root.$version !== 100000 ||\n root.$archiver !== 'NSKeyedArchiver' ||\n !isDictionary(root.$top) ||\n !isArray(root.$objects)\n ) {\n throw new Error('Invalid keyed archive')\n }\n\n // Substitute NSNull\n if (root.$objects[0] === '$null') {\n root.$objects[0] = null\n }\n\n // Pattern-match Objective-C constructs\n for (let i = 0; i < root.$objects.length; i++) {\n root.$objects[i] = paternMatchObjectiveC(root.$objects, root.$objects[i], interpretClass)\n }\n\n // Reconstruct the DAG from the parse tree\n let visit = (object: any) => {\n if (object instanceof UID) {\n return root.$objects[object.index]\n } else if (isArray(object)) {\n for (let i = 0; i < object.length; i++) {\n object[i] = visit(object[i])\n }\n } else if (isDictionary(object)) {\n for (let key in object) {\n object[key] = visit(object[key])\n }\n } else if (object instanceof Map) {\n const clone = new Map(object)\n object.clear()\n for (let [k, v] of clone.entries()) {\n object.set(visit(k), visit(v))\n }\n }\n return object\n }\n for (let i = 0; i < root.$objects.length; i++) {\n visit(root.$objects[i])\n }\n return visit(root.$top)\n}\n\nfunction paternMatchObjectiveC(\n objects: any[],\n value: any,\n interpretClass: ($classname: string, obj: any) => any = x => x,\n): any {\n if (isDictionary(value) && value.$class) {\n let name = followUID(objects, value.$class).$classname\n switch (name) {\n case 'NSDecimalNumberPlaceholder': {\n let length: number = value['NS.length']\n let exponent: number = value['NS.exponent']\n let byteOrder: number = value['NS.mantissa.bo']\n let negative: boolean = value['NS.negative']\n let mantissa = new Uint16Array(new Uint8Array(value['NS.mantissa']).buffer)\n let decimal = 0\n\n for (let i = 0; i < length; i++) {\n let digit = mantissa[i]\n\n if (byteOrder !== 1) {\n // I assume this is how this works but I am unable to test it\n digit = ((digit & 0xff00) >> 8) | ((digit & 0x00ff) << 8)\n }\n\n decimal += digit * Math.pow(65536, i)\n }\n\n decimal *= Math.pow(10, exponent)\n return negative ? -decimal : decimal\n }\n\n // Replace NSData with a Uint8Array\n case 'NSData':\n case 'NSMutableData':\n return value['NS.bytes'] || value['NS.data']\n\n // Replace NSString with a string\n case 'NSString':\n case 'NSMutableString':\n if (value['NS.string']) return value['NS.string']\n if (value['NS.bytes']) return decodeUTF8(value['NS.bytes'])\n console.warn(`Unexpected ${name} format: `, value)\n return null\n\n // Replace NSArray with an Array\n case 'NSArray':\n case 'NSMutableArray':\n if ('NS.objects' in value) {\n return value['NS.objects']\n }\n let array: any[] = []\n while (true) {\n let object = 'NS.object.' + array.length\n if (!(object in value)) {\n break\n }\n array.push(value[object])\n }\n return array\n\n case '_NSKeyedCoderOldStyleArray': {\n const count = value['NS.count']\n\n // const size = value['NS.size']\n // Types are encoded as single printable characters.\n // See: https://github.com/apple/swift-corelibs-foundation/blob/76995e8d3d8c10f3f3ec344dace43426ab941d0e/Foundation/NSObjCRuntime.swift#L19\n // const type = String.fromCharCode(value['NS.type'])\n\n let array: any[] = []\n for (let i = 0; i < count; i++) {\n const element = value['$' + i]\n array.push(element)\n }\n return array\n }\n\n case 'NSDictionary':\n case 'NSMutableDictionary':\n let map = new Map()\n if ('NS.keys' in value && 'NS.objects' in value) {\n for (let i = 0; i < value['NS.keys'].length; i++) {\n map.set(value['NS.keys'][i], value['NS.objects'][i])\n }\n } else {\n while (true) {\n let key = 'NS.key.' + map.size\n let object = 'NS.object.' + map.size\n if (!(key in value) || !(object in value)) {\n break\n }\n map.set(value[key], value[object])\n }\n }\n return map\n\n default:\n const converted = interpretClass(name, value)\n if (converted !== value) return converted\n }\n }\n return value\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nexport class UID {\n constructor(public index: number) {}\n}\n\nfunction parseBinaryPlist(bytes: Uint8Array): any {\n let text = 'bplist00'\n for (let i = 0; i < 8; i++) {\n if (bytes[i] !== text.charCodeAt(i)) {\n throw new Error('File is not a binary plist')\n }\n }\n return new BinaryPlistParser(\n new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength),\n ).parseRoot()\n}\n\ninterface LengthAndOffset {\n length: number\n offset: number\n}\n\n// See http://opensource.apple.com/source/CF/CF-550/CFBinaryPList.c for details\nclass BinaryPlistParser {\n referenceSize = 0\n objects: number[] = []\n offsetTable: number[] = []\n\n constructor(public view: DataView) {}\n\n parseRoot(): any {\n let trailer = this.view.byteLength - 32\n let offsetSize = this.view.getUint8(trailer + 6)\n this.referenceSize = this.view.getUint8(trailer + 7)\n\n // Just use the last 32-bits of these 64-bit big-endian values\n let objectCount = this.view.getUint32(trailer + 12, false)\n let rootIndex = this.view.getUint32(trailer + 20, false)\n let tableOffset = this.view.getUint32(trailer + 28, false)\n\n // Parse all offsets before starting to parse objects\n for (let i = 0; i < objectCount; i++) {\n this.offsetTable.push(this.parseInteger(tableOffset, offsetSize))\n tableOffset += offsetSize\n }\n\n // Parse the root object assuming the graph is a tree\n return this.parseObject(this.offsetTable[rootIndex])\n }\n\n parseLengthAndOffset(offset: number, extra: number): LengthAndOffset {\n if (extra !== 0x0f) return {length: extra, offset: 0}\n let marker = this.view.getUint8(offset++)\n if ((marker & 0xf0) !== 0x10)\n throw new Error('Unexpected non-integer length at offset ' + offset)\n let size = 1 << (marker & 0x0f)\n return {length: this.parseInteger(offset, size), offset: size + 1}\n }\n\n parseSingleton(offset: number, extra: number): any {\n if (extra === 0) return null\n if (extra === 8) return false\n if (extra === 9) return true\n throw new Error('Unexpected extra value ' + extra + ' at offset ' + offset)\n }\n\n parseInteger(offset: number, size: number): number {\n if (size === 1) return this.view.getUint8(offset)\n if (size === 2) return this.view.getUint16(offset, false)\n if (size === 4) return this.view.getUint32(offset, false)\n\n if (size === 8) {\n return (\n Math.pow(2, 32 * 1) * this.view.getUint32(offset + 0, false) +\n Math.pow(2, 32 * 0) * this.view.getUint32(offset + 4, false)\n )\n }\n\n if (size === 16) {\n return (\n Math.pow(2, 32 * 3) * this.view.getUint32(offset + 0, false) +\n Math.pow(2, 32 * 2) * this.view.getUint32(offset + 4, false) +\n Math.pow(2, 32 * 1) * this.view.getUint32(offset + 8, false) +\n Math.pow(2, 32 * 0) * this.view.getUint32(offset + 12, false)\n )\n }\n\n throw new Error('Unexpected integer of size ' + size + ' at offset ' + offset)\n }\n\n parseFloat(offset: number, size: number): number {\n if (size === 4) return this.view.getFloat32(offset, false)\n if (size === 8) return this.view.getFloat64(offset, false)\n throw new Error('Unexpected float of size ' + size + ' at offset ' + offset)\n }\n\n parseDate(offset: number, size: number): Date {\n if (size !== 8) throw new Error('Unexpected date of size ' + size + ' at offset ' + offset)\n let seconds = this.view.getFloat64(offset, false)\n return new Date(978307200000 + seconds * 1000) // Starts from January 1st, 2001\n }\n\n parseData(offset: number, extra: number): Uint8Array {\n let both = this.parseLengthAndOffset(offset, extra)\n return new Uint8Array(this.view.buffer, offset + both.offset, both.length)\n }\n\n parseStringASCII(offset: number, extra: number): string {\n let both = this.parseLengthAndOffset(offset, extra)\n let text = ''\n offset += both.offset\n for (let i = 0; i < both.length; i++) {\n text += String.fromCharCode(this.view.getUint8(offset++))\n }\n return text\n }\n\n parseStringUTF16(offset: number, extra: number): string {\n let both = this.parseLengthAndOffset(offset, extra)\n let text = ''\n offset += both.offset\n for (let i = 0; i < both.length; i++) {\n text += String.fromCharCode(this.view.getUint16(offset, false))\n offset += 2\n }\n return text\n }\n\n parseUID(offset: number, size: number): UID {\n return new UID(this.parseInteger(offset, size))\n }\n\n parseArray(offset: number, extra: number): any[] {\n let both = this.parseLengthAndOffset(offset, extra)\n let array: any[] = []\n let size = this.referenceSize\n offset += both.offset\n for (let i = 0; i < both.length; i++) {\n array.push(this.parseObject(this.offsetTable[this.parseInteger(offset, size)]))\n offset += size\n }\n return array\n }\n\n parseDictionary(offset: number, extra: number): Object {\n let both = this.parseLengthAndOffset(offset, extra)\n let dictionary = Object.create(null)\n let size = this.referenceSize\n let nextKey = offset + both.offset\n let nextValue = nextKey + both.length * size\n for (let i = 0; i < both.length; i++) {\n let key = this.parseObject(this.offsetTable[this.parseInteger(nextKey, size)])\n let value = this.parseObject(this.offsetTable[this.parseInteger(nextValue, size)])\n if (typeof key !== 'string') throw new Error('Unexpected non-string key at offset ' + nextKey)\n dictionary[key] = value\n nextKey += size\n nextValue += size\n }\n return dictionary\n }\n\n parseObject(offset: number): any {\n let marker = this.view.getUint8(offset++)\n let extra = marker & 0x0f\n switch (marker >> 4) {\n case 0x0:\n return this.parseSingleton(offset, extra)\n case 0x1:\n return this.parseInteger(offset, 1 << extra)\n case 0x2:\n return this.parseFloat(offset, 1 << extra)\n case 0x3:\n return this.parseDate(offset, 1 << extra)\n case 0x4:\n return this.parseData(offset, extra)\n case 0x5:\n return this.parseStringASCII(offset, extra)\n case 0x6:\n return this.parseStringUTF16(offset, extra)\n case 0x8:\n return this.parseUID(offset, extra + 1)\n case 0xa:\n return this.parseArray(offset, extra)\n case 0xd:\n return this.parseDictionary(offset, extra)\n }\n throw new Error('Unexpected marker ' + marker + ' at offset ' + --offset)\n }\n}\n","// https://github.com/brendangregg/FlameGraph#2-fold-stacks\n\nimport {Profile, FrameInfo, StackListProfileBuilder} from '../lib/profile'\n\ninterface BGSample {\n stack: FrameInfo[]\n duration: number\n}\n\nfunction parseBGFoldedStacks(contents: string): BGSample[] {\n const samples: BGSample[] = []\n contents.replace(/^(.*) (\\d+)$/gm, (match: string, stack: string, n: string) => {\n samples.push({\n stack: stack.split(';').map(name => ({key: name, name: name})),\n duration: parseInt(n, 10),\n })\n return match\n })\n return samples\n}\n\nexport function importFromBGFlameGraph(contents: string): Profile | null {\n const parsed = parseBGFoldedStacks(contents)\n const duration = parsed.reduce((prev: number, cur: BGSample) => prev + cur.duration, 0)\n const profile = new StackListProfileBuilder(duration)\n if (parsed.length === 0) {\n return null\n }\n for (let sample of parsed) {\n profile.appendSampleWithWeight(sample.stack, sample.duration)\n }\n return profile.build()\n}\n","import {Profile, FrameInfo, CallTreeProfileBuilder} from '../lib/profile'\nimport {getOrInsert} from '../lib/utils'\nimport {TimeFormatter} from '../lib/value-formatters'\n\ninterface Allocations {\n frames: any[]\n sites: any[]\n sizes: any[]\n timestamps: any[]\n}\n\ninterface Configuration {\n allocationsMaxLogLength: number\n allocationsSampleProbability: number\n bufferSize: number\n sampleFrequency: number\n withAllocations: boolean\n withMarkers: boolean\n withMemory: boolean\n withTicks: boolean\n}\n\ninterface Lib {\n arch: string\n breakpadId: string\n debugName: string\n debugPath: string\n end: any\n name: string\n offset: number\n path: string\n start: any\n}\n\ninterface Meta {\n abi: string\n asyncstack: number\n debug: number\n gcpoison: number\n interval: number\n misc: string\n oscpu: string\n platform: string\n processType: number\n product: string\n shutdownTime?: any\n stackwalk: number\n startTime: number\n toolkit: string\n version: number\n}\n\ninterface PausedRange {\n endTime: number\n reason: string\n startTime: number\n}\n\ntype Frame = [number] | [number, number | null, number | null, number, number]\n\ninterface FrameTable {\n data: Frame[]\n /*\n schema: {\n location: 0\n implementation: 1\n optimizations: 2\n line: 3\n category: 4\n }\n */\n}\n\ninterface MarkerMeta {\n category: string\n interval: string\n type: string\n}\ntype Marker = [number, number] | [number, number, MarkerMeta]\n\ninterface Markers {\n data: Marker[]\n /*\n schema: {\n name: 0\n time: 1\n data: 2\n }\n */\n}\n\ntype Sample = [number, number, number] | [number, number, number, number, number]\n\ninterface Samples {\n data: Sample[]\n /*\n schema: {\n stack: 0\n time: 1\n responsiveness: 2\n rss: 3\n uss: 4\n }\n */\n}\n\nexport interface StackTable {\n data: [number | null, number][]\n /*\n schema: {\n prefix: 0\n frame: 1\n }\n */\n}\n\nexport interface Thread {\n frameTable: FrameTable\n markers: Markers\n name: string\n pid: number\n processType: string\n registerTime: number\n samples: Samples\n stackTable: StackTable\n stringTable: string[]\n tid: number\n unregisterTime?: any\n}\n\nexport interface FirefoxCPUProfile {\n libs: Lib[]\n meta: Meta\n pausedRanges: PausedRange[]\n processes: any[]\n threads: Thread[]\n}\n\nexport interface FirefoxProfile {\n allocations: Allocations\n configuration: Configuration\n duration: number\n fileType: string\n frames: any[]\n label: string\n markers: any[]\n memory: any[]\n profile: FirefoxCPUProfile\n ticks: any[]\n version: number\n}\n\nexport function importFromFirefox(firefoxProfile: FirefoxProfile): Profile {\n const cpuProfile = firefoxProfile.profile\n\n const thread =\n cpuProfile.threads.length === 1\n ? cpuProfile.threads[0]\n : cpuProfile.threads.filter(t => t.name === 'GeckoMain')[0]\n\n const frameKeyToFrameInfo = new Map<string, FrameInfo>()\n\n function extractStack(sample: Sample): FrameInfo[] {\n let stackFrameId: number | null = sample[0]\n const ret: number[] = []\n\n while (stackFrameId != null) {\n const nextStackFrame: [number | null, number] = thread.stackTable.data[stackFrameId]\n const [nextStackId, frameId] = nextStackFrame\n ret.push(frameId)\n stackFrameId = nextStackId\n }\n ret.reverse()\n return ret\n .map(f => {\n const frameData = thread.frameTable.data[f]\n const location = thread.stringTable[frameData[0]]\n\n const match = /(.*)\\s+\\((.*?)(?::(\\d+))?(?::(\\d+))?\\)$/.exec(location)\n\n if (!match) return null\n\n if (\n match[2].startsWith('resource:') ||\n match[2] === 'self-hosted' ||\n match[2].startsWith('self-hosted:')\n ) {\n // Ignore Firefox-internals stuff\n return null\n }\n\n return getOrInsert(frameKeyToFrameInfo, location, () => ({\n key: location,\n name: match[1]!,\n file: match[2]!,\n\n // In Firefox profiles, line numbers are 1-based, but columns are\n // 0-based. Let's normalize both to be 1-based.\n line: match[3] ? parseInt(match[3]) : undefined,\n col: match[4] ? parseInt(match[4]) + 1 : undefined,\n }))\n })\n .filter(f => f != null) as FrameInfo[]\n }\n\n const profile = new CallTreeProfileBuilder(firefoxProfile.duration)\n\n let prevStack: FrameInfo[] = []\n for (let sample of thread.samples.data) {\n const stack = extractStack(sample)\n const value = sample[1]\n\n // Find lowest common ancestor of the current stack and the previous one\n let lcaIndex = -1\n\n for (let i = 0; i < Math.min(stack.length, prevStack.length); i++) {\n if (prevStack[i] !== stack[i]) {\n break\n }\n lcaIndex = i\n }\n\n // Close frames that are no longer open\n for (let i = prevStack.length - 1; i > lcaIndex; i--) {\n profile.leaveFrame(prevStack[i], value)\n }\n\n for (let i = lcaIndex + 1; i < stack.length; i++) {\n profile.enterFrame(stack[i], value)\n }\n\n prevStack = stack\n }\n\n profile.setValueFormatter(new TimeFormatter('milliseconds'))\n return profile.build()\n}\n","import {Profile, FrameInfo, StackListProfileBuilder} from '../lib/profile'\nimport {getOrInsert, sortBy} from '../lib/utils'\nimport {TimeFormatter} from '../lib/value-formatters'\n\n// This imports profiles generated by a combination of the following commands:\n//\n// node --prof /path/to/my/script.js\n// node --prof-process -preprocess -j isolate*.log > profile.v8log.json\n\n// References:\n// - https://github.com/nodejs/node/blob/7edd0a17af8d74dce7dd6c7554a8b8523f83efdc/lib/internal/v8_prof_processor.js#L5\n// - https://github.com/nodejs/node/blob/7edd0a17af8d74dce7dd6c7554a8b8523f83efdc/deps/v8/tools/tickprocessor.js\n// - https://github.com/nodejs/node/blob/2db2857c72c219e5ba1642a345e52cfdd8c44a66/deps/v8/tools/logreader.js#L147\n// - https://github.com/mapbox/flamebearer/blob/a8d4d5c0061ed439660783c613c43ab28b751219/index.js#L53\n\ninterface Code {\n name: string\n type: 'CODE' | 'CPP' | 'JS' | 'SHARED_LIB'\n timestamp?: number\n kind?:\n | 'Bultin'\n | 'BytecodeHandler'\n | 'Handler'\n | 'KeyedLoadIC'\n | 'KeyedStoreIC'\n | 'LoadGlobalIC'\n | 'LoadIC'\n | 'Opt'\n | 'StoreIC'\n | 'Stub'\n | 'Unopt'\n | 'Builtin'\n | 'RegExp'\n func?: number\n tm?: number\n}\n\ninterface Function {\n name: string\n codes: number[]\n}\n\ninterface Tick {\n // Timestamp\n tm: number\n\n // Virtual machine state?\n vm: number\n\n // stack\n s: number[]\n}\n\ninterface V8LogProfile {\n code: Code[]\n functions: Function[]\n ticks: Tick[]\n}\n\nfunction codeToFrameInfo(code: Code, v8log: V8LogProfile): FrameInfo {\n if (!code || !code.type) {\n return {\n key: '(unknown type)',\n name: '(unknown type)',\n }\n }\n\n let name = code.name\n switch (code.type) {\n case 'CPP': {\n const matches = name.match(/[tT] ([^(<]*)/)\n if (matches) name = `(c++) ${matches[1]}`\n break\n }\n\n case 'SHARED_LIB':\n name = '(LIB) ' + name\n break\n\n case 'JS': {\n const matches = name.match(/([a-zA-Z0-9\\._\\-$]*) ([a-zA-Z0-9\\.\\-_\\/$]*):(\\d+):(\\d+)/)\n if (matches) {\n return {\n key: name,\n name: matches[1].length > 0 ? matches[1] : '(anonymous)',\n file: matches[2].length > 0 ? matches[2] : '(unknown file)',\n line: parseInt(matches[3], 10),\n col: parseInt(matches[4], 10),\n }\n }\n break\n }\n\n case 'CODE': {\n switch (code.kind) {\n case 'LoadIC':\n case 'StoreIC':\n case 'KeyedStoreIC':\n case 'KeyedLoadIC':\n case 'LoadGlobalIC':\n case 'Handler':\n name = '(IC) ' + name\n break\n\n case 'BytecodeHandler':\n name = '(bytecode) ~' + name\n break\n case 'Stub':\n name = '(stub) ' + name\n break\n case 'Builtin':\n name = '(builtin) ' + name\n break\n case 'RegExp':\n name = '(regexp) ' + name\n break\n }\n break\n }\n\n default: {\n name = `(${code.type}) ${name}`\n break\n }\n }\n\n return {key: name, name}\n}\n\nexport function importFromV8ProfLog(v8log: V8LogProfile): Profile {\n const profile = new StackListProfileBuilder()\n\n const sToFrameInfo = new Map<number, FrameInfo>()\n function getFrameInfo(t: number) {\n return getOrInsert(sToFrameInfo, t, t => {\n const code = v8log.code[t]\n return codeToFrameInfo(code, v8log)\n })\n }\n\n let lastTm = 0\n\n sortBy(v8log.ticks, tick => tick.tm)\n\n for (let tick of v8log.ticks) {\n const stack: FrameInfo[] = []\n\n // tick.s holds the call stack at the time the sample was taken. The\n // structure is a little strange -- it seems to be capturing both the\n // JavaScript stack & the parallel C++ stack by interleaving the two.\n // Because the stacks might not be the same length, it looks like the\n // shorter stack is padded with indices of -1, so we'll just ignore those\n // stacks.\n //\n // If you change the start index to `let i = tick.s.length - 1` instead,\n // you'll see the C++ stack instead.\n //\n // Mostly the numbers in the stack seem to be indices into the `v8log.code`\n // array, but some of the numbers in the C++ stack seem to be raw memory\n // addresses.\n\n for (let i = tick.s.length - 2; i >= 0; i -= 2) {\n const id = tick.s[i]\n\n if (id === -1) continue\n if (id > v8log.code.length) {\n // Treat this like a memory address\n stack.push({\n key: id,\n name: `0x${id.toString(16)}`,\n })\n continue\n }\n stack.push(getFrameInfo(id))\n }\n profile.appendSampleWithWeight(stack, tick.tm - lastTm)\n lastTm = tick.tm\n }\n\n // Despite the code in the v8 processing library indicating that the\n // timestamps come from a variable called \"time_ns\", from making empirical\n // recordings, it really seems like these profiles are recording timestamps in\n // microseconds, not nanoseconds.\n // https://github.com/nodejs/node/blob/c39caa997c751473d0c8f50af8c6b14bcd389fa0/deps/v8/tools/profile.js#L1076\n profile.setValueFormatter(new TimeFormatter('microseconds'))\n\n return profile.build()\n}\n","import {StackListProfileBuilder, ProfileGroup} from '../lib/profile'\nimport {itMap, getOrInsert} from '../lib/utils'\nimport {TimeFormatter} from '../lib/value-formatters'\n\n// This imports the output of the \"perf script\" command on linux.\n//\n// Reference: https://github.com/torvalds/linux/blob/0fbc4aea/tools/perf/builtin-script.c#L1622\n// Reference: https://github.com/brendangregg/FlameGraph/blob/18c3dea/stackcollapse-perf.pl#L163\n\ninterface PerfStackFrame {\n address: string\n symbolName: string\n file: string\n}\n\ninterface PerfEvent {\n command: string | null\n processID: number | null\n threadID: number | null\n time: number | null\n eventType: string\n stack: PerfStackFrame[]\n}\n\nfunction parseEvent(rawEvent: string): PerfEvent | null {\n const lines = rawEvent.split('\\n').filter(l => !/^\\s*#/.exec(l))\n\n const event: PerfEvent = {\n command: null,\n processID: null,\n threadID: null,\n time: null,\n eventType: '',\n stack: [],\n }\n\n const firstLine = lines.shift()\n if (!firstLine) return null\n\n // Note: command name may contain spaces, e.g.\n //\n // V8 WorkerThread 25607 4794564.109216: cycles:\n const eventStartMatch = /^(\\S.+?)\\s+(\\d+)(?:\\/?(\\d+))?\\s+/.exec(firstLine)\n if (!eventStartMatch) return null\n\n event.command = eventStartMatch[1]\n\n // default \"perf script\" output has TID but not PID\n if (eventStartMatch[3]) {\n event.processID = parseInt(eventStartMatch[2], 10)\n event.threadID = parseInt(eventStartMatch[3], 10)\n } else {\n event.threadID = parseInt(eventStartMatch[2], 10)\n }\n\n const timeMatch = /\\s+(\\d+\\.\\d+):\\s+/.exec(firstLine)\n if (timeMatch) {\n event.time = parseFloat(timeMatch[1])\n }\n\n const evName = /(\\S+):\\s*$/.exec(firstLine)\n if (evName) {\n event.eventType = evName[1]\n }\n\n for (let line of lines) {\n const lineMatch = /^\\s*(\\w+)\\s*(.+) \\((\\S*)\\)/.exec(line)\n if (!lineMatch) continue\n let [, address, symbolName, file] = lineMatch\n\n // Linux 4.8 included symbol offsets in perf script output by default, eg:\n // 7fffb84c9afc cpu_startup_entry+0x800047c022ec ([kernel.kallsyms])\n // strip these off:\n symbolName = symbolName.replace(/\\+0x[\\da-f]+$/, '')\n\n event.stack.push({address: `0x${address}`, symbolName, file})\n }\n event.stack.reverse()\n\n return event\n}\n\nexport function importFromLinuxPerf(contents: string): ProfileGroup | null {\n const profiles = new Map<string, StackListProfileBuilder>()\n\n let eventType: string | null = null\n const events = contents.split('\\n\\n').map(parseEvent)\n\n for (let event of events) {\n if (event == null) continue\n if (eventType != null && eventType != event.eventType) continue\n if (event.time == null) continue\n eventType = event.eventType\n\n let profileNameParts = []\n if (event.command) profileNameParts.push(event.command)\n if (event.processID) profileNameParts.push(`pid: ${event.processID}`)\n if (event.threadID) profileNameParts.push(`tid: ${event.threadID}`)\n const profileName = profileNameParts.join(' ')\n const builderState = getOrInsert(profiles, profileName, () => {\n const builder = new StackListProfileBuilder()\n builder.setName(profileName)\n builder.setValueFormatter(new TimeFormatter('seconds'))\n return builder\n })\n\n const builder = builderState\n\n builder.appendSampleWithTimestamp(\n event.stack.map(({symbolName, file}) => {\n return {\n key: `${symbolName} (${file})`,\n name: symbolName === '[unknown]' ? `??? (${file})` : symbolName,\n file: file,\n }\n }),\n event.time!,\n )\n }\n\n if (profiles.size === 0) {\n return null\n }\n\n return {\n name: profiles.size === 1 ? Array.from(profiles.keys())[0] : '',\n indexToView: 0,\n profiles: Array.from(itMap(profiles.values(), builder => builder.build())),\n }\n}\n","import {ProfileGroup, FrameInfo, CallTreeProfileBuilder} from '../lib/profile'\nimport {TimeFormatter, ByteFormatter} from '../lib/value-formatters'\n\n// See https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/profiling.html#json-profile-format\n// for information on the GHC profiler JSON output format.\n\ninterface CostCentre {\n id: number\n label: string\n module: string\n src_loc: string\n is_caf: boolean\n}\n\ninterface ProfileTree {\n id: number\n entries: number\n alloc: number\n ticks: number\n children: ProfileTree[]\n}\n\ninterface HaskellProfile {\n program: string\n arguments: string[]\n rts_arguments: string[]\n end_time: string\n initial_capabilities: number\n total_time: number\n total_ticks: number\n tick_interval: number\n total_alloc: number\n cost_centres: CostCentre[]\n profile: ProfileTree\n}\n\n// The profiler already collapses recursion before output so using the JS stack here should be fine\nfunction addToProfile(\n tree: ProfileTree,\n startVal: number,\n profile: CallTreeProfileBuilder,\n infos: Map<number, FrameInfo>,\n attribute: (tree: ProfileTree) => number,\n): number {\n // If the expression never did anything we don't care about it\n if (tree.ticks === 0 && tree.entries === 0 && tree.alloc === 0 && tree.children.length === 0)\n return startVal\n\n let curVal = startVal\n let frameInfo = infos.get(tree.id)!\n\n profile.enterFrame(frameInfo, curVal)\n\n for (let child of tree.children) {\n curVal = addToProfile(child, curVal, profile, infos, attribute)\n }\n\n curVal += attribute(tree)\n\n profile.leaveFrame(frameInfo, curVal)\n\n return curVal\n}\n\nexport function importFromHaskell(haskellProfile: HaskellProfile): ProfileGroup {\n const idToFrameInfo = new Map<number, FrameInfo>()\n for (let centre of haskellProfile.cost_centres) {\n const frameInfo: FrameInfo = {\n key: centre.id,\n name: `${centre.module}.${centre.label}`,\n }\n\n // Ignore things like <entire-module> and <no location info>\n if (!centre.src_loc.startsWith('<')) {\n // This also contains line and column information, but sometimes it contains ranges,\n // and in varying formats, so it's a better experience just to leave it as is\n frameInfo.file = centre.src_loc\n }\n\n idToFrameInfo.set(centre.id, frameInfo)\n }\n\n const timeProfile = new CallTreeProfileBuilder(haskellProfile.total_ticks)\n addToProfile(haskellProfile.profile, 0, timeProfile, idToFrameInfo, tree => tree.ticks)\n timeProfile.setValueFormatter(new TimeFormatter('milliseconds'))\n timeProfile.setName(`${haskellProfile.program} time`)\n\n const allocProfile = new CallTreeProfileBuilder(haskellProfile.total_ticks)\n addToProfile(haskellProfile.profile, 0, allocProfile, idToFrameInfo, tree => tree.alloc)\n allocProfile.setValueFormatter(new ByteFormatter())\n allocProfile.setName(`${haskellProfile.program} allocation`)\n\n return {\n name: haskellProfile.program,\n indexToView: 0,\n profiles: [timeProfile.build(), allocProfile.build()],\n }\n}\n","import {Profile, FrameInfo, StackListProfileBuilder} from '../lib/profile'\nimport {TimeFormatter} from '../lib/value-formatters'\n\ninterface Record {\n type: string\n eventType?: string\n startTime?: number\n endTime?: number\n // timeline-record-type-cpu\n timestamp?: number\n usage?: number\n threads?: any[]\n // timeline-record-type-script\n details?: number | string | any\n extraDetails?: null | any\n // timeline-record-type-network\n archiveStartTime?: number\n entry?: any\n // timeline-record-type-layout\n quad?: number[]\n}\n\ninterface ExprLocation {\n line: number\n column: number\n}\n\ninterface StackFrame {\n sourceID: string\n name: string\n line: number\n column: number\n url: string\n expressionLocation?: ExprLocation\n}\n\ninterface Sample {\n timestamp: number\n stackFrames: StackFrame[]\n}\n\ninterface Recording {\n displayName: string\n startTime: number\n endTime: number\n discontinuities: any[]\n instrumentTypes: string[]\n records: Record[]\n markers: any[]\n memoryPressureEvents: any[]\n sampleStackTraces: Sample[]\n sampleDurations: number[]\n}\n\ninterface Overview {\n secondsPerPixel: number\n scrollStartTime: number\n selectionStartTime: number\n selectionDuration: number\n}\n\ninterface SafariProfile {\n version: number\n recording: Recording\n overview: Overview\n}\n\nfunction makeStack(frames: StackFrame[]): FrameInfo[] {\n return frames\n .map(({name, url, line, column}) => ({\n key: `${name}:${url}:${line}:${column}`,\n file: url,\n line,\n col: column,\n name: name || '(anonymous)',\n }))\n .reverse()\n}\n\nexport function importFromSafari(contents: SafariProfile): Profile | null {\n if (contents.version !== 1) {\n console.warn(`Unknown Safari profile version ${contents.version}... Might be incompatible.`)\n }\n\n const {recording} = contents\n const {sampleStackTraces, sampleDurations} = recording\n\n const count = sampleStackTraces.length\n if (count < 1) {\n console.warn('Empty profile')\n return null\n }\n\n const profileDuration =\n sampleStackTraces[count - 1].timestamp - sampleStackTraces[0].timestamp + sampleDurations[0]\n const profile = new StackListProfileBuilder(profileDuration)\n\n let previousEndTime = Number.MAX_VALUE\n\n sampleStackTraces.forEach((sample, i) => {\n const endTime = sample.timestamp\n const duration = sampleDurations[i]\n const startTime = endTime - duration\n const idleDurationBefore = startTime - previousEndTime\n\n // FIXME: 2ms is a lot, but Safari's timestamps and durations don't line up very well and will create\n // phantom idle time\n if (idleDurationBefore > 0.002) {\n profile.appendSampleWithWeight([], idleDurationBefore)\n }\n\n profile.appendSampleWithWeight(makeStack(sample.stackFrames), duration)\n\n previousEndTime = endTime\n })\n\n profile.setValueFormatter(new TimeFormatter('seconds'))\n profile.setName(recording.displayName)\n return profile.build()\n}\n","\"use strict\";\r\nmodule.exports = asPromise;\r\n\r\n/**\r\n * Callback as used by {@link util.asPromise}.\r\n * @typedef asPromiseCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {...*} params Additional arguments\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Returns a promise from a node-style callback function.\r\n * @memberof util\r\n * @param {asPromiseCallback} fn Function to call\r\n * @param {*} ctx Function context\r\n * @param {...*} params Function arguments\r\n * @returns {Promise<*>} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0,\r\n index = 2,\r\n pending = true;\r\n while (index < arguments.length)\r\n params[offset++] = arguments[index++];\r\n return new Promise(function executor(resolve, reject) {\r\n params[offset] = function callback(err/*, varargs */) {\r\n if (pending) {\r\n pending = false;\r\n if (err)\r\n reject(err);\r\n else {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0;\r\n while (offset < params.length)\r\n params[offset++] = arguments[offset];\r\n resolve.apply(null, params);\r\n }\r\n }\r\n };\r\n try {\r\n fn.apply(ctx || null, params);\r\n } catch (err) {\r\n if (pending) {\r\n pending = false;\r\n reject(err);\r\n }\r\n }\r\n });\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n var p = string.length;\r\n if (!p)\r\n return 0;\r\n var n = 0;\r\n while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n ++n;\r\n return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n var parts = null,\r\n chunk = [];\r\n var i = 0, // output index\r\n j = 0, // goto index\r\n t; // temporary\r\n while (start < end) {\r\n var b = buffer[start++];\r\n switch (j) {\r\n case 0:\r\n chunk[i++] = b64[b >> 2];\r\n t = (b & 3) << 4;\r\n j = 1;\r\n break;\r\n case 1:\r\n chunk[i++] = b64[t | b >> 4];\r\n t = (b & 15) << 2;\r\n j = 2;\r\n break;\r\n case 2:\r\n chunk[i++] = b64[t | b >> 6];\r\n chunk[i++] = b64[b & 63];\r\n j = 0;\r\n break;\r\n }\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (j) {\r\n chunk[i++] = b64[t];\r\n chunk[i++] = 61;\r\n if (j === 1)\r\n chunk[i++] = 61;\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n var start = offset;\r\n var j = 0, // goto index\r\n t; // temporary\r\n for (var i = 0; i < string.length;) {\r\n var c = string.charCodeAt(i++);\r\n if (c === 61 && j > 1)\r\n break;\r\n if ((c = s64[c]) === undefined)\r\n throw Error(invalidEncoding);\r\n switch (j) {\r\n case 0:\r\n t = c;\r\n j = 1;\r\n break;\r\n case 1:\r\n buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n t = c;\r\n j = 2;\r\n break;\r\n case 2:\r\n buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n t = c;\r\n j = 3;\r\n break;\r\n case 3:\r\n buffer[offset++] = (t & 3) << 6 | c;\r\n j = 0;\r\n break;\r\n }\r\n }\r\n if (j === 1)\r\n throw Error(invalidEncoding);\r\n return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n","\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n /**\r\n * Registered listeners.\r\n * @type {Object.<string,*>}\r\n * @private\r\n */\r\n this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n fn : fn,\r\n ctx : ctx || this\r\n });\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n if (evt === undefined)\r\n this._listeners = {};\r\n else {\r\n if (fn === undefined)\r\n this._listeners[evt] = [];\r\n else {\r\n var listeners = this._listeners[evt];\r\n for (var i = 0; i < listeners.length;)\r\n if (listeners[i].fn === fn)\r\n listeners.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n var listeners = this._listeners[evt];\r\n if (listeners) {\r\n var args = [],\r\n i = 1;\r\n for (; i < arguments.length;)\r\n args.push(arguments[i++]);\r\n for (i = 0; i < listeners.length;)\r\n listeners[i].fn.apply(listeners[i++].ctx, args);\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n // float: typed array\r\n if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n var f32 = new Float32Array([ -0 ]),\r\n f8b = new Uint8Array(f32.buffer),\r\n le = f8b[3] === 128;\r\n\r\n function writeFloat_f32_cpy(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n }\r\n\r\n function writeFloat_f32_rev(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[3];\r\n buf[pos + 1] = f8b[2];\r\n buf[pos + 2] = f8b[1];\r\n buf[pos + 3] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n function readFloat_f32_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n function readFloat_f32_rev(buf, pos) {\r\n f8b[3] = buf[pos ];\r\n f8b[2] = buf[pos + 1];\r\n f8b[1] = buf[pos + 2];\r\n f8b[0] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n // float: ieee754\r\n })(); else (function() {\r\n\r\n function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0)\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n else if (isNaN(val))\r\n writeUint(2143289344, buf, pos);\r\n else if (val > 3.4028234663852886e+38) // +-Infinity\r\n writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n else if (val < 1.1754943508222875e-38) // denormal\r\n writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n }\r\n }\r\n\r\n exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n function readFloat_ieee754(readUint, buf, pos) {\r\n var uint = readUint(buf, pos),\r\n sign = (uint >> 31) * 2 + 1,\r\n exponent = uint >>> 23 & 255,\r\n mantissa = uint & 8388607;\r\n return exponent === 255\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 1.401298464324817e-45 * mantissa\r\n : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n }\r\n\r\n exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n })();\r\n\r\n // double: typed array\r\n if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n var f64 = new Float64Array([-0]),\r\n f8b = new Uint8Array(f64.buffer),\r\n le = f8b[7] === 128;\r\n\r\n function writeDouble_f64_cpy(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n buf[pos + 4] = f8b[4];\r\n buf[pos + 5] = f8b[5];\r\n buf[pos + 6] = f8b[6];\r\n buf[pos + 7] = f8b[7];\r\n }\r\n\r\n function writeDouble_f64_rev(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[7];\r\n buf[pos + 1] = f8b[6];\r\n buf[pos + 2] = f8b[5];\r\n buf[pos + 3] = f8b[4];\r\n buf[pos + 4] = f8b[3];\r\n buf[pos + 5] = f8b[2];\r\n buf[pos + 6] = f8b[1];\r\n buf[pos + 7] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n function readDouble_f64_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n f8b[4] = buf[pos + 4];\r\n f8b[5] = buf[pos + 5];\r\n f8b[6] = buf[pos + 6];\r\n f8b[7] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n function readDouble_f64_rev(buf, pos) {\r\n f8b[7] = buf[pos ];\r\n f8b[6] = buf[pos + 1];\r\n f8b[5] = buf[pos + 2];\r\n f8b[4] = buf[pos + 3];\r\n f8b[3] = buf[pos + 4];\r\n f8b[2] = buf[pos + 5];\r\n f8b[1] = buf[pos + 6];\r\n f8b[0] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n // double: ieee754\r\n })(); else (function() {\r\n\r\n function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n } else if (isNaN(val)) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(2146959360, buf, pos + off1);\r\n } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n writeUint(0, buf, pos + off0);\r\n writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n } else {\r\n var mantissa;\r\n if (val < 2.2250738585072014e-308) { // denormal\r\n mantissa = val / 5e-324;\r\n writeUint(mantissa >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n } else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n if (exponent === 1024)\r\n exponent = 1023;\r\n mantissa = val * Math.pow(2, -exponent);\r\n writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n }\r\n }\r\n }\r\n\r\n exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n var lo = readUint(buf, pos + off0),\r\n hi = readUint(buf, pos + off1);\r\n var sign = (hi >> 31) * 2 + 1,\r\n exponent = hi >>> 20 & 2047,\r\n mantissa = 4294967296 * (hi & 1048575) + lo;\r\n return exponent === 2047\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 5e-324 * mantissa\r\n : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n }\r\n\r\n exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n })();\r\n\r\n return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n buf[pos ] = val >>> 24;\r\n buf[pos + 1] = val >>> 16 & 255;\r\n buf[pos + 2] = val >>> 8 & 255;\r\n buf[pos + 3] = val & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n return (buf[pos ]\r\n | buf[pos + 1] << 8\r\n | buf[pos + 2] << 16\r\n | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n return (buf[pos ] << 24\r\n | buf[pos + 1] << 16\r\n | buf[pos + 2] << 8\r\n | buf[pos + 3]) >>> 0;\r\n}\r\n","\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n try {\r\n var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n if (mod && (mod.length || Object.keys(mod).length))\r\n return mod;\r\n } catch (e) {} // eslint-disable-line no-empty\r\n return null;\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n var len = 0,\r\n c = 0;\r\n for (var i = 0; i < string.length; ++i) {\r\n c = string.charCodeAt(i);\r\n if (c < 128)\r\n len += 1;\r\n else if (c < 2048)\r\n len += 2;\r\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n ++i;\r\n len += 4;\r\n } else\r\n len += 3;\r\n }\r\n return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n var len = end - start;\r\n if (len < 1)\r\n return \"\";\r\n var parts = null,\r\n chunk = [],\r\n i = 0, // char offset\r\n t; // temporary\r\n while (start < end) {\r\n t = buffer[start++];\r\n if (t < 128)\r\n chunk[i++] = t;\r\n else if (t > 191 && t < 224)\r\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n else if (t > 239 && t < 365) {\r\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n chunk[i++] = 0xD800 + (t >> 10);\r\n chunk[i++] = 0xDC00 + (t & 1023);\r\n } else\r\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n var start = offset,\r\n c1, // character 1\r\n c2; // character 2\r\n for (var i = 0; i < string.length; ++i) {\r\n c1 = string.charCodeAt(i);\r\n if (c1 < 128) {\r\n buffer[offset++] = c1;\r\n } else if (c1 < 2048) {\r\n buffer[offset++] = c1 >> 6 | 192;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n ++i;\r\n buffer[offset++] = c1 >> 18 | 240;\r\n buffer[offset++] = c1 >> 12 & 63 | 128;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else {\r\n buffer[offset++] = c1 >> 12 | 224;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n }\r\n }\r\n return offset - start;\r\n};\r\n","\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n var SIZE = size || 8192;\r\n var MAX = SIZE >>> 1;\r\n var slab = null;\r\n var offset = SIZE;\r\n return function pool_alloc(size) {\r\n if (size < 1 || size > MAX)\r\n return alloc(size);\r\n if (offset + size > SIZE) {\r\n slab = alloc(SIZE);\r\n offset = 0;\r\n }\r\n var buf = slice.call(slab, offset, offset += size);\r\n if (offset & 7) // align to 32 bit\r\n offset = (offset | 7) + 1;\r\n return buf;\r\n };\r\n}\r\n","\"use strict\";\r\nmodule.exports = LongBits;\r\n\r\nvar util = require(\"../util/minimal\");\r\n\r\n/**\r\n * Constructs new long bits.\r\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\r\n * @memberof util\r\n * @constructor\r\n * @param {number} lo Low 32 bits, unsigned\r\n * @param {number} hi High 32 bits, unsigned\r\n */\r\nfunction LongBits(lo, hi) {\r\n\r\n // note that the casts below are theoretically unnecessary as of today, but older statically\r\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\r\n\r\n /**\r\n * Low bits.\r\n * @type {number}\r\n */\r\n this.lo = lo >>> 0;\r\n\r\n /**\r\n * High bits.\r\n * @type {number}\r\n */\r\n this.hi = hi >>> 0;\r\n}\r\n\r\n/**\r\n * Zero bits.\r\n * @memberof util.LongBits\r\n * @type {util.LongBits}\r\n */\r\nvar zero = LongBits.zero = new LongBits(0, 0);\r\n\r\nzero.toNumber = function() { return 0; };\r\nzero.zzEncode = zero.zzDecode = function() { return this; };\r\nzero.length = function() { return 1; };\r\n\r\n/**\r\n * Zero hash.\r\n * @memberof util.LongBits\r\n * @type {string}\r\n */\r\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\r\n\r\n/**\r\n * Constructs new long bits from the specified number.\r\n * @param {number} value Value\r\n * @returns {util.LongBits} Instance\r\n */\r\nLongBits.fromNumber = function fromNumber(value) {\r\n if (value === 0)\r\n return zero;\r\n var sign = value < 0;\r\n if (sign)\r\n value = -value;\r\n var lo = value >>> 0,\r\n hi = (value - lo) / 4294967296 >>> 0;\r\n if (sign) {\r\n hi = ~hi >>> 0;\r\n lo = ~lo >>> 0;\r\n if (++lo > 4294967295) {\r\n lo = 0;\r\n if (++hi > 4294967295)\r\n hi = 0;\r\n }\r\n }\r\n return new LongBits(lo, hi);\r\n};\r\n\r\n/**\r\n * Constructs new long bits from a number, long or string.\r\n * @param {Long|number|string} value Value\r\n * @returns {util.LongBits} Instance\r\n */\r\nLongBits.from = function from(value) {\r\n if (typeof value === \"number\")\r\n return LongBits.fromNumber(value);\r\n if (util.isString(value)) {\r\n /* istanbul ignore else */\r\n if (util.Long)\r\n value = util.Long.fromString(value);\r\n else\r\n return LongBits.fromNumber(parseInt(value, 10));\r\n }\r\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\r\n};\r\n\r\n/**\r\n * Converts this long bits to a possibly unsafe JavaScript number.\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {number} Possibly unsafe number\r\n */\r\nLongBits.prototype.toNumber = function toNumber(unsigned) {\r\n if (!unsigned && this.hi >>> 31) {\r\n var lo = ~this.lo + 1 >>> 0,\r\n hi = ~this.hi >>> 0;\r\n if (!lo)\r\n hi = hi + 1 >>> 0;\r\n return -(lo + hi * 4294967296);\r\n }\r\n return this.lo + this.hi * 4294967296;\r\n};\r\n\r\n/**\r\n * Converts this long bits to a long.\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {Long} Long\r\n */\r\nLongBits.prototype.toLong = function toLong(unsigned) {\r\n return util.Long\r\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\r\n /* istanbul ignore next */\r\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\r\n};\r\n\r\nvar charCodeAt = String.prototype.charCodeAt;\r\n\r\n/**\r\n * Constructs new long bits from the specified 8 characters long hash.\r\n * @param {string} hash Hash\r\n * @returns {util.LongBits} Bits\r\n */\r\nLongBits.fromHash = function fromHash(hash) {\r\n if (hash === zeroHash)\r\n return zero;\r\n return new LongBits(\r\n ( charCodeAt.call(hash, 0)\r\n | charCodeAt.call(hash, 1) << 8\r\n | charCodeAt.call(hash, 2) << 16\r\n | charCodeAt.call(hash, 3) << 24) >>> 0\r\n ,\r\n ( charCodeAt.call(hash, 4)\r\n | charCodeAt.call(hash, 5) << 8\r\n | charCodeAt.call(hash, 6) << 16\r\n | charCodeAt.call(hash, 7) << 24) >>> 0\r\n );\r\n};\r\n\r\n/**\r\n * Converts this long bits to a 8 characters long hash.\r\n * @returns {string} Hash\r\n */\r\nLongBits.prototype.toHash = function toHash() {\r\n return String.fromCharCode(\r\n this.lo & 255,\r\n this.lo >>> 8 & 255,\r\n this.lo >>> 16 & 255,\r\n this.lo >>> 24 ,\r\n this.hi & 255,\r\n this.hi >>> 8 & 255,\r\n this.hi >>> 16 & 255,\r\n this.hi >>> 24\r\n );\r\n};\r\n\r\n/**\r\n * Zig-zag encodes this long bits.\r\n * @returns {util.LongBits} `this`\r\n */\r\nLongBits.prototype.zzEncode = function zzEncode() {\r\n var mask = this.hi >> 31;\r\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\r\n this.lo = ( this.lo << 1 ^ mask) >>> 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Zig-zag decodes this long bits.\r\n * @returns {util.LongBits} `this`\r\n */\r\nLongBits.prototype.zzDecode = function zzDecode() {\r\n var mask = -(this.lo & 1);\r\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\r\n this.hi = ( this.hi >>> 1 ^ mask) >>> 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Calculates the length of this longbits when encoded as a varint.\r\n * @returns {number} Length\r\n */\r\nLongBits.prototype.length = function length() {\r\n var part0 = this.lo,\r\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\r\n part2 = this.hi >>> 24;\r\n return part2 === 0\r\n ? part1 === 0\r\n ? part0 < 16384\r\n ? part0 < 128 ? 1 : 2\r\n : part0 < 2097152 ? 3 : 4\r\n : part1 < 16384\r\n ? part1 < 128 ? 5 : 6\r\n : part1 < 2097152 ? 7 : 8\r\n : part2 < 128 ? 9 : 10;\r\n};\r\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","exports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <http://feross.org>\n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar isArray = require('isarray')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n * incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n ? global.TYPED_ARRAY_SUPPORT\n : typedArraySupport()\n\n/*\n * Export kMaxLength after typed array support is determined.\n */\nexports.kMaxLength = kMaxLength()\n\nfunction typedArraySupport () {\n try {\n var arr = new Uint8Array(1)\n arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n return arr.foo() === 42 && // typed array instances can be augmented\n typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`\n } catch (e) {\n return false\n }\n}\n\nfunction kMaxLength () {\n return Buffer.TYPED_ARRAY_SUPPORT\n ? 0x7fffffff\n : 0x3fffffff\n}\n\nfunction createBuffer (that, length) {\n if (kMaxLength() < length) {\n throw new RangeError('Invalid typed array length')\n }\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = new Uint8Array(length)\n that.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n if (that === null) {\n that = new Buffer(length)\n }\n that.length = length\n }\n\n return that\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\n// TODO: Legacy, not needed anymore. Remove in next major version.\nBuffer._augment = function (arr) {\n arr.__proto__ = Buffer.prototype\n return arr\n}\n\nfunction from (that, value, encodingOrOffset, 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, encodingOrOffset, length)\n }\n\n if (typeof value === 'string') {\n return fromString(that, value, encodingOrOffset)\n }\n\n return fromObject(that, value)\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(null, value, encodingOrOffset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n Buffer.prototype.__proto__ = Uint8Array.prototype\n Buffer.__proto__ = Uint8Array\n if (typeof Symbol !== 'undefined' && Symbol.species &&\n Buffer[Symbol.species] === Buffer) {\n // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true\n })\n }\n}\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n } else if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n}\n\nfunction alloc (that, size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(that, size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpretted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(that, size).fill(fill, encoding)\n : createBuffer(that, size).fill(fill)\n }\n return createBuffer(that, size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(null, size, fill, encoding)\n}\n\nfunction allocUnsafe (that, size) {\n assertSize(size)\n that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n that[i] = 0\n }\n }\n return that\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(null, size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(null, size)\n}\n\nfunction fromString (that, string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('\"encoding\" must be a valid string encoding')\n }\n\n var length = byteLength(string, encoding) | 0\n that = createBuffer(that, length)\n\n var actual = that.write(string, encoding)\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 that = that.slice(0, actual)\n }\n\n return that\n}\n\nfunction fromArrayLike (that, array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0\n that = createBuffer(that, length)\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n array.byteLength // this throws if `array` is not a valid ArrayBuffer\n\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 if (byteOffset === undefined && length === undefined) {\n array = new Uint8Array(array)\n } else if (length === undefined) {\n array = new Uint8Array(array, byteOffset)\n } else {\n array = new Uint8Array(array, byteOffset, length)\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = array\n that.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n that = fromArrayLike(that, array)\n }\n return that\n}\n\nfunction fromObject (that, obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0\n that = createBuffer(that, len)\n\n if (that.length === 0) {\n return that\n }\n\n obj.copy(that, 0, 0, len)\n return that\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' && 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 checked (length) {\n // Note: cannot use `length < kMaxLength()` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= kMaxLength()) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength().toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return !!(b != null && b._isBuffer)\n}\n\nBuffer.compare = function compare (a, b) {\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError('Arguments must be Buffers')\n }\n\n if (a === b) return 0\n\n var x = a.length\n var y = b.length\n\n for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\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 Buffer.alloc(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 = Buffer.allocUnsafe(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\nfunction byteLength (string, encoding) {\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 // Use a for loop to avoid recursion\n var loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n case undefined:\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) return utf8ToBytes(string).length // assume utf8\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n var loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n var i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n var len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (var i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n var len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (var i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n var len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (var i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n var length = this.length | 0\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n var str = ''\n var max = exports.INSPECT_MAX_BYTES\n if (this.length > 0) {\n str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')\n if (this.length > max) str += ' ... '\n }\n return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (!Buffer.isBuffer(target)) {\n throw new TypeError('Argument must be a Buffer')\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n var x = thisEnd - thisStart\n var y = end - start\n var len = Math.min(x, y)\n\n var thisCopy = this.slice(thisStart, thisEnd)\n var targetCopy = target.slice(start, end)\n\n for (var i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (isNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (Buffer.TYPED_ARRAY_SUPPORT &&\n typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n var indexSize = 1\n var arrLength = arr.length\n var valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n var i\n if (dir) {\n var foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n var found = true\n for (var j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n var remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n // must be an even number of digits\n var strLen = string.length\n if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n for (var i = 0; i < length; ++i) {\n var parsed = parseInt(string.substr(i * 2, 2), 16)\n if (isNaN(parsed)) return i\n buf[offset + i] = parsed\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 asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset | 0\n if (isFinite(length)) {\n length = length | 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n // legacy write(string, encoding, offset, length) - remove in v0.13\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\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 if (!encoding) encoding = 'utf8'\n\n var loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n return asciiWrite(this, string, offset, length)\n\n case 'latin1':\n case 'binary':\n return latin1Write(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n var res = []\n\n var i = start\n while (i < end) {\n var firstByte = buf[i]\n var codePoint = null\n var bytesPerSequence = (firstByte > 0xEF) ? 4\n : (firstByte > 0xDF) ? 3\n : (firstByte > 0xBF) ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n var secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n var len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n var res = ''\n var i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n var ret = ''\n end = Math.min(buf.length, end)\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n var ret = ''\n end = Math.min(buf.length, end)\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n var len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n var out = ''\n for (var i = start; i < end; ++i) {\n out += toHex(buf[i])\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n var bytes = buf.slice(start, end)\n var res = ''\n for (var i = 0; i < bytes.length; i += 2) {\n res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)\n }\n return res\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 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\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n var val = this[offset]\n var mul = 1\n var i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n var val = this[offset + --byteLength]\n var mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n var val = this[offset]\n var mul = 1\n var i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n var i = byteLength\n var mul = 1\n var val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n var val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n var val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n var mul = 1\n var i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n var i = byteLength - 1\n var mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffff + value + 1\n for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n (littleEndian ? i : 1 - i) * 8\n }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n } else {\n objectWriteUInt16(this, value, offset, true)\n }\n return offset + 2\n}\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n } else {\n objectWriteUInt16(this, value, offset, false)\n }\n return offset + 2\n}\n\nfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffffffff + value + 1\n for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff\n }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n } else {\n objectWriteUInt32(this, value, offset, true)\n }\n return offset + 4\n}\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n } else {\n objectWriteUInt32(this, value, offset, false)\n }\n return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n var i = 0\n var mul = 1\n var sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n var i = byteLength - 1\n var mul = 1\n var sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n } else {\n objectWriteUInt16(this, value, offset, true)\n }\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n } else {\n objectWriteUInt16(this, value, offset, false)\n }\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n } else {\n objectWriteUInt32(this, value, offset, true)\n }\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n } else {\n objectWriteUInt32(this, value, offset, false)\n }\n return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\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\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\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 if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\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 : utf8ToBytes(new Buffer(val, encoding).toString())\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\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = stringtrim(str).replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction stringtrim (str) {\n if (str.trim) return str.trim()\n return str.replace(/^\\s+|\\s+$/g, '')\n}\n\nfunction toHex (n) {\n if (n < 16) return '0' + n.toString(16)\n return n.toString(16)\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 asciiToBytes (str) {\n var byteArray = []\n for (var i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n var c, hi, lo\n var byteArray = []\n for (var i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\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 isnan (val) {\n return val !== val // eslint-disable-line no-self-compare\n}\n","\"use strict\";\r\nvar util = exports;\r\n\r\n// used to return a Promise where callback is omitted\r\nutil.asPromise = require(\"@protobufjs/aspromise\");\r\n\r\n// converts to / from base64 encoded strings\r\nutil.base64 = require(\"@protobufjs/base64\");\r\n\r\n// base class of rpc.Service\r\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\r\n\r\n// float handling accross browsers\r\nutil.float = require(\"@protobufjs/float\");\r\n\r\n// requires modules optionally and hides the call from bundlers\r\nutil.inquire = require(\"@protobufjs/inquire\");\r\n\r\n// converts to / from utf8 encoded strings\r\nutil.utf8 = require(\"@protobufjs/utf8\");\r\n\r\n// provides a node-like buffer pool in the browser\r\nutil.pool = require(\"@protobufjs/pool\");\r\n\r\n// utility to work with the low and high bits of a 64 bit value\r\nutil.LongBits = require(\"./longbits\");\r\n\r\n// global object reference\r\nutil.global = typeof window !== \"undefined\" && window\r\n || typeof global !== \"undefined\" && global\r\n || typeof self !== \"undefined\" && self\r\n || this; // eslint-disable-line no-invalid-this\r\n\r\n/**\r\n * An immuable empty array.\r\n * @memberof util\r\n * @type {Array.<*>}\r\n * @const\r\n */\r\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\r\n\r\n/**\r\n * An immutable empty object.\r\n * @type {Object}\r\n * @const\r\n */\r\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\r\n\r\n/**\r\n * Whether running within node or not.\r\n * @memberof util\r\n * @type {boolean}\r\n * @const\r\n */\r\nutil.isNode = Boolean(util.global.process && util.global.process.versions && util.global.process.versions.node);\r\n\r\n/**\r\n * Tests if the specified value is an integer.\r\n * @function\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is an integer\r\n */\r\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\r\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\r\n};\r\n\r\n/**\r\n * Tests if the specified value is a string.\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is a string\r\n */\r\nutil.isString = function isString(value) {\r\n return typeof value === \"string\" || value instanceof String;\r\n};\r\n\r\n/**\r\n * Tests if the specified value is a non-null object.\r\n * @param {*} value Value to test\r\n * @returns {boolean} `true` if the value is a non-null object\r\n */\r\nutil.isObject = function isObject(value) {\r\n return value && typeof value === \"object\";\r\n};\r\n\r\n/**\r\n * Checks if a property on a message is considered to be present.\r\n * This is an alias of {@link util.isSet}.\r\n * @function\r\n * @param {Object} obj Plain object or message instance\r\n * @param {string} prop Property name\r\n * @returns {boolean} `true` if considered to be present, otherwise `false`\r\n */\r\nutil.isset =\r\n\r\n/**\r\n * Checks if a property on a message is considered to be present.\r\n * @param {Object} obj Plain object or message instance\r\n * @param {string} prop Property name\r\n * @returns {boolean} `true` if considered to be present, otherwise `false`\r\n */\r\nutil.isSet = function isSet(obj, prop) {\r\n var value = obj[prop];\r\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\r\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\r\n return false;\r\n};\r\n\r\n/**\r\n * Any compatible Buffer instance.\r\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\r\n * @interface Buffer\r\n * @extends Uint8Array\r\n */\r\n\r\n/**\r\n * Node's Buffer class if available.\r\n * @type {Constructor<Buffer>}\r\n */\r\nutil.Buffer = (function() {\r\n try {\r\n var Buffer = util.inquire(\"buffer\").Buffer;\r\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\r\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\r\n } catch (e) {\r\n /* istanbul ignore next */\r\n return null;\r\n }\r\n})();\r\n\r\n// Internal alias of or polyfull for Buffer.from.\r\nutil._Buffer_from = null;\r\n\r\n// Internal alias of or polyfill for Buffer.allocUnsafe.\r\nutil._Buffer_allocUnsafe = null;\r\n\r\n/**\r\n * Creates a new buffer of whatever type supported by the environment.\r\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\r\n * @returns {Uint8Array|Buffer} Buffer\r\n */\r\nutil.newBuffer = function newBuffer(sizeOrArray) {\r\n /* istanbul ignore next */\r\n return typeof sizeOrArray === \"number\"\r\n ? util.Buffer\r\n ? util._Buffer_allocUnsafe(sizeOrArray)\r\n : new util.Array(sizeOrArray)\r\n : util.Buffer\r\n ? util._Buffer_from(sizeOrArray)\r\n : typeof Uint8Array === \"undefined\"\r\n ? sizeOrArray\r\n : new Uint8Array(sizeOrArray);\r\n};\r\n\r\n/**\r\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\r\n * @type {Constructor<Uint8Array>}\r\n */\r\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\r\n\r\n/**\r\n * Any compatible Long instance.\r\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\r\n * @interface Long\r\n * @property {number} low Low bits\r\n * @property {number} high High bits\r\n * @property {boolean} unsigned Whether unsigned or not\r\n */\r\n\r\n/**\r\n * Long.js's Long class if available.\r\n * @type {Constructor<Long>}\r\n */\r\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\r\n || /* istanbul ignore next */ util.global.Long\r\n || util.inquire(\"long\");\r\n\r\n/**\r\n * Regular expression used to verify 2 bit (`bool`) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key2Re = /^true|false|0|1$/;\r\n\r\n/**\r\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\r\n\r\n/**\r\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\r\n * @type {RegExp}\r\n * @const\r\n */\r\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\r\n\r\n/**\r\n * Converts a number or long to an 8 characters long hash string.\r\n * @param {Long|number} value Value to convert\r\n * @returns {string} Hash\r\n */\r\nutil.longToHash = function longToHash(value) {\r\n return value\r\n ? util.LongBits.from(value).toHash()\r\n : util.LongBits.zeroHash;\r\n};\r\n\r\n/**\r\n * Converts an 8 characters long hash string to a long or number.\r\n * @param {string} hash Hash\r\n * @param {boolean} [unsigned=false] Whether unsigned or not\r\n * @returns {Long|number} Original value\r\n */\r\nutil.longFromHash = function longFromHash(hash, unsigned) {\r\n var bits = util.LongBits.fromHash(hash);\r\n if (util.Long)\r\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\r\n return bits.toNumber(Boolean(unsigned));\r\n};\r\n\r\n/**\r\n * Merges the properties of the source object into the destination object.\r\n * @memberof util\r\n * @param {Object.<string,*>} dst Destination object\r\n * @param {Object.<string,*>} src Source object\r\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\r\n * @returns {Object.<string,*>} Destination object\r\n */\r\nfunction merge(dst, src, ifNotSet) { // used by converters\r\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\r\n if (dst[keys[i]] === undefined || !ifNotSet)\r\n dst[keys[i]] = src[keys[i]];\r\n return dst;\r\n}\r\n\r\nutil.merge = merge;\r\n\r\n/**\r\n * Converts the first character of a string to lower case.\r\n * @param {string} str String to convert\r\n * @returns {string} Converted string\r\n */\r\nutil.lcFirst = function lcFirst(str) {\r\n return str.charAt(0).toLowerCase() + str.substring(1);\r\n};\r\n\r\n/**\r\n * Creates a custom error constructor.\r\n * @memberof util\r\n * @param {string} name Error name\r\n * @returns {Constructor<Error>} Custom error constructor\r\n */\r\nfunction newError(name) {\r\n\r\n function CustomError(message, properties) {\r\n\r\n if (!(this instanceof CustomError))\r\n return new CustomError(message, properties);\r\n\r\n // Error.call(this, message);\r\n // ^ just returns a new error instance because the ctor can be called as a function\r\n\r\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\r\n\r\n /* istanbul ignore next */\r\n if (Error.captureStackTrace) // node\r\n Error.captureStackTrace(this, CustomError);\r\n else\r\n Object.defineProperty(this, \"stack\", { value: (new Error()).stack || \"\" });\r\n\r\n if (properties)\r\n merge(this, properties);\r\n }\r\n\r\n (CustomError.prototype = Object.create(Error.prototype)).constructor = CustomError;\r\n\r\n Object.defineProperty(CustomError.prototype, \"name\", { get: function() { return name; } });\r\n\r\n CustomError.prototype.toString = function toString() {\r\n return this.name + \": \" + this.message;\r\n };\r\n\r\n return CustomError;\r\n}\r\n\r\nutil.newError = newError;\r\n\r\n/**\r\n * Constructs a new protocol error.\r\n * @classdesc Error subclass indicating a protocol specifc error.\r\n * @memberof util\r\n * @extends Error\r\n * @template T extends Message<T>\r\n * @constructor\r\n * @param {string} message Error message\r\n * @param {Object.<string,*>} [properties] Additional properties\r\n * @example\r\n * try {\r\n * MyMessage.decode(someBuffer); // throws if required fields are missing\r\n * } catch (e) {\r\n * if (e instanceof ProtocolError && e.instance)\r\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\r\n * }\r\n */\r\nutil.ProtocolError = newError(\"ProtocolError\");\r\n\r\n/**\r\n * So far decoded message instance.\r\n * @name util.ProtocolError#instance\r\n * @type {Message<T>}\r\n */\r\n\r\n/**\r\n * A OneOf getter as returned by {@link util.oneOfGetter}.\r\n * @typedef OneOfGetter\r\n * @type {function}\r\n * @returns {string|undefined} Set field name, if any\r\n */\r\n\r\n/**\r\n * Builds a getter for a oneof's present field name.\r\n * @param {string[]} fieldNames Field names\r\n * @returns {OneOfGetter} Unbound getter\r\n */\r\nutil.oneOfGetter = function getOneOf(fieldNames) {\r\n var fieldMap = {};\r\n for (var i = 0; i < fieldNames.length; ++i)\r\n fieldMap[fieldNames[i]] = 1;\r\n\r\n /**\r\n * @returns {string|undefined} Set field name, if any\r\n * @this Object\r\n * @ignore\r\n */\r\n return function() { // eslint-disable-line consistent-return\r\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\r\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\r\n return keys[i];\r\n };\r\n};\r\n\r\n/**\r\n * A OneOf setter as returned by {@link util.oneOfSetter}.\r\n * @typedef OneOfSetter\r\n * @type {function}\r\n * @param {string|undefined} value Field name\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Builds a setter for a oneof's present field name.\r\n * @param {string[]} fieldNames Field names\r\n * @returns {OneOfSetter} Unbound setter\r\n */\r\nutil.oneOfSetter = function setOneOf(fieldNames) {\r\n\r\n /**\r\n * @param {string} name Field name\r\n * @returns {undefined}\r\n * @this Object\r\n * @ignore\r\n */\r\n return function(name) {\r\n for (var i = 0; i < fieldNames.length; ++i)\r\n if (fieldNames[i] !== name)\r\n delete this[fieldNames[i]];\r\n };\r\n};\r\n\r\n/**\r\n * Default conversion options used for {@link Message#toJSON} implementations.\r\n *\r\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\r\n *\r\n * - Longs become strings\r\n * - Enums become string keys\r\n * - Bytes become base64 encoded strings\r\n * - (Sub-)Messages become plain objects\r\n * - Maps become plain objects with all string keys\r\n * - Repeated fields become arrays\r\n * - NaN and Infinity for float and double fields become strings\r\n *\r\n * @type {IConversionOptions}\r\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\r\n */\r\nutil.toJSONOptions = {\r\n longs: String,\r\n enums: String,\r\n bytes: String,\r\n json: true\r\n};\r\n\r\n// Sets up buffer utility according to the environment (called in index-minimal)\r\nutil._configure = function() {\r\n var Buffer = util.Buffer;\r\n /* istanbul ignore if */\r\n if (!Buffer) {\r\n util._Buffer_from = util._Buffer_allocUnsafe = null;\r\n return;\r\n }\r\n // because node 4.x buffers are incompatible & immutable\r\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\r\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\r\n /* istanbul ignore next */\r\n function Buffer_from(value, encoding) {\r\n return new Buffer(value, encoding);\r\n };\r\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\r\n /* istanbul ignore next */\r\n function Buffer_allocUnsafe(size) {\r\n return new Buffer(size);\r\n };\r\n};\r\n","\"use strict\";\r\nmodule.exports = Writer;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar BufferWriter; // cyclic\r\n\r\nvar LongBits = util.LongBits,\r\n base64 = util.base64,\r\n utf8 = util.utf8;\r\n\r\n/**\r\n * Constructs a new writer operation instance.\r\n * @classdesc Scheduled writer operation.\r\n * @constructor\r\n * @param {function(*, Uint8Array, number)} fn Function to call\r\n * @param {number} len Value byte length\r\n * @param {*} val Value to write\r\n * @ignore\r\n */\r\nfunction Op(fn, len, val) {\r\n\r\n /**\r\n * Function to call.\r\n * @type {function(Uint8Array, number, *)}\r\n */\r\n this.fn = fn;\r\n\r\n /**\r\n * Value byte length.\r\n * @type {number}\r\n */\r\n this.len = len;\r\n\r\n /**\r\n * Next operation.\r\n * @type {Writer.Op|undefined}\r\n */\r\n this.next = undefined;\r\n\r\n /**\r\n * Value to write.\r\n * @type {*}\r\n */\r\n this.val = val; // type varies\r\n}\r\n\r\n/* istanbul ignore next */\r\nfunction noop() {} // eslint-disable-line no-empty-function\r\n\r\n/**\r\n * Constructs a new writer state instance.\r\n * @classdesc Copied writer state.\r\n * @memberof Writer\r\n * @constructor\r\n * @param {Writer} writer Writer to copy state from\r\n * @ignore\r\n */\r\nfunction State(writer) {\r\n\r\n /**\r\n * Current head.\r\n * @type {Writer.Op}\r\n */\r\n this.head = writer.head;\r\n\r\n /**\r\n * Current tail.\r\n * @type {Writer.Op}\r\n */\r\n this.tail = writer.tail;\r\n\r\n /**\r\n * Current buffer length.\r\n * @type {number}\r\n */\r\n this.len = writer.len;\r\n\r\n /**\r\n * Next state.\r\n * @type {State|null}\r\n */\r\n this.next = writer.states;\r\n}\r\n\r\n/**\r\n * Constructs a new writer instance.\r\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\r\n * @constructor\r\n */\r\nfunction Writer() {\r\n\r\n /**\r\n * Current length.\r\n * @type {number}\r\n */\r\n this.len = 0;\r\n\r\n /**\r\n * Operations head.\r\n * @type {Object}\r\n */\r\n this.head = new Op(noop, 0, 0);\r\n\r\n /**\r\n * Operations tail\r\n * @type {Object}\r\n */\r\n this.tail = this.head;\r\n\r\n /**\r\n * Linked forked states.\r\n * @type {Object|null}\r\n */\r\n this.states = null;\r\n\r\n // When a value is written, the writer calculates its byte length and puts it into a linked\r\n // list of operations to perform when finish() is called. This both allows us to allocate\r\n // buffers of the exact required size and reduces the amount of work we have to do compared\r\n // to first calculating over objects and then encoding over objects. In our case, the encoding\r\n // part is just a linked list walk calling operations with already prepared values.\r\n}\r\n\r\n/**\r\n * Creates a new writer.\r\n * @function\r\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\r\n */\r\nWriter.create = util.Buffer\r\n ? function create_buffer_setup() {\r\n return (Writer.create = function create_buffer() {\r\n return new BufferWriter();\r\n })();\r\n }\r\n /* istanbul ignore next */\r\n : function create_array() {\r\n return new Writer();\r\n };\r\n\r\n/**\r\n * Allocates a buffer of the specified size.\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\nWriter.alloc = function alloc(size) {\r\n return new util.Array(size);\r\n};\r\n\r\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\r\n/* istanbul ignore else */\r\nif (util.Array !== Array)\r\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\r\n\r\n/**\r\n * Pushes a new operation to the queue.\r\n * @param {function(Uint8Array, number, *)} fn Function to call\r\n * @param {number} len Value byte length\r\n * @param {number} val Value to write\r\n * @returns {Writer} `this`\r\n * @private\r\n */\r\nWriter.prototype._push = function push(fn, len, val) {\r\n this.tail = this.tail.next = new Op(fn, len, val);\r\n this.len += len;\r\n return this;\r\n};\r\n\r\nfunction writeByte(val, buf, pos) {\r\n buf[pos] = val & 255;\r\n}\r\n\r\nfunction writeVarint32(val, buf, pos) {\r\n while (val > 127) {\r\n buf[pos++] = val & 127 | 128;\r\n val >>>= 7;\r\n }\r\n buf[pos] = val;\r\n}\r\n\r\n/**\r\n * Constructs a new varint writer operation instance.\r\n * @classdesc Scheduled varint writer operation.\r\n * @extends Op\r\n * @constructor\r\n * @param {number} len Value byte length\r\n * @param {number} val Value to write\r\n * @ignore\r\n */\r\nfunction VarintOp(len, val) {\r\n this.len = len;\r\n this.next = undefined;\r\n this.val = val;\r\n}\r\n\r\nVarintOp.prototype = Object.create(Op.prototype);\r\nVarintOp.prototype.fn = writeVarint32;\r\n\r\n/**\r\n * Writes an unsigned 32 bit value as a varint.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.uint32 = function write_uint32(value) {\r\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\r\n // uint32 is by far the most frequently used operation and benefits significantly from this.\r\n this.len += (this.tail = this.tail.next = new VarintOp(\r\n (value = value >>> 0)\r\n < 128 ? 1\r\n : value < 16384 ? 2\r\n : value < 2097152 ? 3\r\n : value < 268435456 ? 4\r\n : 5,\r\n value)).len;\r\n return this;\r\n};\r\n\r\n/**\r\n * Writes a signed 32 bit value as a varint.\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.int32 = function write_int32(value) {\r\n return value < 0\r\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\r\n : this.uint32(value);\r\n};\r\n\r\n/**\r\n * Writes a 32 bit value as a varint, zig-zag encoded.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.sint32 = function write_sint32(value) {\r\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\r\n};\r\n\r\nfunction writeVarint64(val, buf, pos) {\r\n while (val.hi) {\r\n buf[pos++] = val.lo & 127 | 128;\r\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\r\n val.hi >>>= 7;\r\n }\r\n while (val.lo > 127) {\r\n buf[pos++] = val.lo & 127 | 128;\r\n val.lo = val.lo >>> 7;\r\n }\r\n buf[pos++] = val.lo;\r\n}\r\n\r\n/**\r\n * Writes an unsigned 64 bit value as a varint.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.uint64 = function write_uint64(value) {\r\n var bits = LongBits.from(value);\r\n return this._push(writeVarint64, bits.length(), bits);\r\n};\r\n\r\n/**\r\n * Writes a signed 64 bit value as a varint.\r\n * @function\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.int64 = Writer.prototype.uint64;\r\n\r\n/**\r\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.sint64 = function write_sint64(value) {\r\n var bits = LongBits.from(value).zzEncode();\r\n return this._push(writeVarint64, bits.length(), bits);\r\n};\r\n\r\n/**\r\n * Writes a boolish value as a varint.\r\n * @param {boolean} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.bool = function write_bool(value) {\r\n return this._push(writeByte, 1, value ? 1 : 0);\r\n};\r\n\r\nfunction writeFixed32(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\n/**\r\n * Writes an unsigned 32 bit value as fixed 32 bits.\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.fixed32 = function write_fixed32(value) {\r\n return this._push(writeFixed32, 4, value >>> 0);\r\n};\r\n\r\n/**\r\n * Writes a signed 32 bit value as fixed 32 bits.\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\r\n\r\n/**\r\n * Writes an unsigned 64 bit value as fixed 64 bits.\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.fixed64 = function write_fixed64(value) {\r\n var bits = LongBits.from(value);\r\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\r\n};\r\n\r\n/**\r\n * Writes a signed 64 bit value as fixed 64 bits.\r\n * @function\r\n * @param {Long|number|string} value Value to write\r\n * @returns {Writer} `this`\r\n * @throws {TypeError} If `value` is a string and no long library is present.\r\n */\r\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\r\n\r\n/**\r\n * Writes a float (32 bit).\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.float = function write_float(value) {\r\n return this._push(util.float.writeFloatLE, 4, value);\r\n};\r\n\r\n/**\r\n * Writes a double (64 bit float).\r\n * @function\r\n * @param {number} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.double = function write_double(value) {\r\n return this._push(util.float.writeDoubleLE, 8, value);\r\n};\r\n\r\nvar writeBytes = util.Array.prototype.set\r\n ? function writeBytes_set(val, buf, pos) {\r\n buf.set(val, pos); // also works for plain array values\r\n }\r\n /* istanbul ignore next */\r\n : function writeBytes_for(val, buf, pos) {\r\n for (var i = 0; i < val.length; ++i)\r\n buf[pos + i] = val[i];\r\n };\r\n\r\n/**\r\n * Writes a sequence of bytes.\r\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.bytes = function write_bytes(value) {\r\n var len = value.length >>> 0;\r\n if (!len)\r\n return this._push(writeByte, 1, 0);\r\n if (util.isString(value)) {\r\n var buf = Writer.alloc(len = base64.length(value));\r\n base64.decode(value, buf, 0);\r\n value = buf;\r\n }\r\n return this.uint32(len)._push(writeBytes, len, value);\r\n};\r\n\r\n/**\r\n * Writes a string.\r\n * @param {string} value Value to write\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.string = function write_string(value) {\r\n var len = utf8.length(value);\r\n return len\r\n ? this.uint32(len)._push(utf8.write, len, value)\r\n : this._push(writeByte, 1, 0);\r\n};\r\n\r\n/**\r\n * Forks this writer's state by pushing it to a stack.\r\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.fork = function fork() {\r\n this.states = new State(this);\r\n this.head = this.tail = new Op(noop, 0, 0);\r\n this.len = 0;\r\n return this;\r\n};\r\n\r\n/**\r\n * Resets this instance to the last state.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.reset = function reset() {\r\n if (this.states) {\r\n this.head = this.states.head;\r\n this.tail = this.states.tail;\r\n this.len = this.states.len;\r\n this.states = this.states.next;\r\n } else {\r\n this.head = this.tail = new Op(noop, 0, 0);\r\n this.len = 0;\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\r\n * @returns {Writer} `this`\r\n */\r\nWriter.prototype.ldelim = function ldelim() {\r\n var head = this.head,\r\n tail = this.tail,\r\n len = this.len;\r\n this.reset().uint32(len);\r\n if (len) {\r\n this.tail.next = head.next; // skip noop\r\n this.tail = tail;\r\n this.len += len;\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Finishes the write operation.\r\n * @returns {Uint8Array} Finished buffer\r\n */\r\nWriter.prototype.finish = function finish() {\r\n var head = this.head.next, // skip noop\r\n buf = this.constructor.alloc(this.len),\r\n pos = 0;\r\n while (head) {\r\n head.fn(head.val, buf, pos);\r\n pos += head.len;\r\n head = head.next;\r\n }\r\n // this.head = this.tail = null;\r\n return buf;\r\n};\r\n\r\nWriter._configure = function(BufferWriter_) {\r\n BufferWriter = BufferWriter_;\r\n};\r\n","\"use strict\";\r\nmodule.exports = BufferWriter;\r\n\r\n// extends Writer\r\nvar Writer = require(\"./writer\");\r\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar Buffer = util.Buffer;\r\n\r\n/**\r\n * Constructs a new buffer writer instance.\r\n * @classdesc Wire format writer using node buffers.\r\n * @extends Writer\r\n * @constructor\r\n */\r\nfunction BufferWriter() {\r\n Writer.call(this);\r\n}\r\n\r\n/**\r\n * Allocates a buffer of the specified size.\r\n * @param {number} size Buffer size\r\n * @returns {Buffer} Buffer\r\n */\r\nBufferWriter.alloc = function alloc_buffer(size) {\r\n return (BufferWriter.alloc = util._Buffer_allocUnsafe)(size);\r\n};\r\n\r\nvar writeBytesBuffer = Buffer && Buffer.prototype instanceof Uint8Array && Buffer.prototype.set.name === \"set\"\r\n ? function writeBytesBuffer_set(val, buf, pos) {\r\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\r\n // also works for plain array values\r\n }\r\n /* istanbul ignore next */\r\n : function writeBytesBuffer_copy(val, buf, pos) {\r\n if (val.copy) // Buffer values\r\n val.copy(buf, pos, 0, val.length);\r\n else for (var i = 0; i < val.length;) // plain array values\r\n buf[pos++] = val[i++];\r\n };\r\n\r\n/**\r\n * @override\r\n */\r\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\r\n if (util.isString(value))\r\n value = util._Buffer_from(value, \"base64\");\r\n var len = value.length >>> 0;\r\n this.uint32(len);\r\n if (len)\r\n this._push(writeBytesBuffer, len, value);\r\n return this;\r\n};\r\n\r\nfunction writeStringBuffer(val, buf, pos) {\r\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\r\n util.utf8.write(val, buf, pos);\r\n else\r\n buf.utf8Write(val, pos);\r\n}\r\n\r\n/**\r\n * @override\r\n */\r\nBufferWriter.prototype.string = function write_string_buffer(value) {\r\n var len = Buffer.byteLength(value);\r\n this.uint32(len);\r\n if (len)\r\n this._push(writeStringBuffer, len, value);\r\n return this;\r\n};\r\n\r\n\r\n/**\r\n * Finishes the write operation.\r\n * @name BufferWriter#finish\r\n * @function\r\n * @returns {Buffer} Finished buffer\r\n */\r\n","\"use strict\";\r\nmodule.exports = Reader;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\nvar BufferReader; // cyclic\r\n\r\nvar LongBits = util.LongBits,\r\n utf8 = util.utf8;\r\n\r\n/* istanbul ignore next */\r\nfunction indexOutOfRange(reader, writeLength) {\r\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\r\n}\r\n\r\n/**\r\n * Constructs a new reader instance using the specified buffer.\r\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\r\n * @constructor\r\n * @param {Uint8Array} buffer Buffer to read from\r\n */\r\nfunction Reader(buffer) {\r\n\r\n /**\r\n * Read buffer.\r\n * @type {Uint8Array}\r\n */\r\n this.buf = buffer;\r\n\r\n /**\r\n * Read buffer position.\r\n * @type {number}\r\n */\r\n this.pos = 0;\r\n\r\n /**\r\n * Read buffer length.\r\n * @type {number}\r\n */\r\n this.len = buffer.length;\r\n}\r\n\r\nvar create_array = typeof Uint8Array !== \"undefined\"\r\n ? function create_typed_array(buffer) {\r\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\r\n return new Reader(buffer);\r\n throw Error(\"illegal buffer\");\r\n }\r\n /* istanbul ignore next */\r\n : function create_array(buffer) {\r\n if (Array.isArray(buffer))\r\n return new Reader(buffer);\r\n throw Error(\"illegal buffer\");\r\n };\r\n\r\n/**\r\n * Creates a new reader using the specified buffer.\r\n * @function\r\n * @param {Uint8Array|Buffer} buffer Buffer to read from\r\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\r\n * @throws {Error} If `buffer` is not a valid buffer\r\n */\r\nReader.create = util.Buffer\r\n ? function create_buffer_setup(buffer) {\r\n return (Reader.create = function create_buffer(buffer) {\r\n return util.Buffer.isBuffer(buffer)\r\n ? new BufferReader(buffer)\r\n /* istanbul ignore next */\r\n : create_array(buffer);\r\n })(buffer);\r\n }\r\n /* istanbul ignore next */\r\n : create_array;\r\n\r\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\r\n\r\n/**\r\n * Reads a varint as an unsigned 32 bit value.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.uint32 = (function read_uint32_setup() {\r\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\r\n return function read_uint32() {\r\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\r\n\r\n /* istanbul ignore if */\r\n if ((this.pos += 5) > this.len) {\r\n this.pos = this.len;\r\n throw indexOutOfRange(this, 10);\r\n }\r\n return value;\r\n };\r\n})();\r\n\r\n/**\r\n * Reads a varint as a signed 32 bit value.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.int32 = function read_int32() {\r\n return this.uint32() | 0;\r\n};\r\n\r\n/**\r\n * Reads a zig-zag encoded varint as a signed 32 bit value.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.sint32 = function read_sint32() {\r\n var value = this.uint32();\r\n return value >>> 1 ^ -(value & 1) | 0;\r\n};\r\n\r\n/* eslint-disable no-invalid-this */\r\n\r\nfunction readLongVarint() {\r\n // tends to deopt with local vars for octet etc.\r\n var bits = new LongBits(0, 0);\r\n var i = 0;\r\n if (this.len - this.pos > 4) { // fast route (lo)\r\n for (; i < 4; ++i) {\r\n // 1st..4th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n // 5th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n i = 0;\r\n } else {\r\n for (; i < 3; ++i) {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n // 1st..3th\r\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n // 4th\r\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\r\n return bits;\r\n }\r\n if (this.len - this.pos > 4) { // fast route (hi)\r\n for (; i < 5; ++i) {\r\n // 6th..10th\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n } else {\r\n for (; i < 5; ++i) {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n // 6th..10th\r\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\r\n if (this.buf[this.pos++] < 128)\r\n return bits;\r\n }\r\n }\r\n /* istanbul ignore next */\r\n throw Error(\"invalid varint encoding\");\r\n}\r\n\r\n/* eslint-enable no-invalid-this */\r\n\r\n/**\r\n * Reads a varint as a signed 64 bit value.\r\n * @name Reader#int64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a varint as an unsigned 64 bit value.\r\n * @name Reader#uint64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a zig-zag encoded varint as a signed 64 bit value.\r\n * @name Reader#sint64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a varint as a boolean.\r\n * @returns {boolean} Value read\r\n */\r\nReader.prototype.bool = function read_bool() {\r\n return this.uint32() !== 0;\r\n};\r\n\r\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\r\n return (buf[end - 4]\r\n | buf[end - 3] << 8\r\n | buf[end - 2] << 16\r\n | buf[end - 1] << 24) >>> 0;\r\n}\r\n\r\n/**\r\n * Reads fixed 32 bits as an unsigned 32 bit integer.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.fixed32 = function read_fixed32() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n return readFixed32_end(this.buf, this.pos += 4);\r\n};\r\n\r\n/**\r\n * Reads fixed 32 bits as a signed 32 bit integer.\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.sfixed32 = function read_sfixed32() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n return readFixed32_end(this.buf, this.pos += 4) | 0;\r\n};\r\n\r\n/* eslint-disable no-invalid-this */\r\n\r\nfunction readFixed64(/* this: Reader */) {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 8 > this.len)\r\n throw indexOutOfRange(this, 8);\r\n\r\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\r\n}\r\n\r\n/* eslint-enable no-invalid-this */\r\n\r\n/**\r\n * Reads fixed 64 bits.\r\n * @name Reader#fixed64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads zig-zag encoded fixed 64 bits.\r\n * @name Reader#sfixed64\r\n * @function\r\n * @returns {Long} Value read\r\n */\r\n\r\n/**\r\n * Reads a float (32 bit) as a number.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.float = function read_float() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 4 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n var value = util.float.readFloatLE(this.buf, this.pos);\r\n this.pos += 4;\r\n return value;\r\n};\r\n\r\n/**\r\n * Reads a double (64 bit float) as a number.\r\n * @function\r\n * @returns {number} Value read\r\n */\r\nReader.prototype.double = function read_double() {\r\n\r\n /* istanbul ignore if */\r\n if (this.pos + 8 > this.len)\r\n throw indexOutOfRange(this, 4);\r\n\r\n var value = util.float.readDoubleLE(this.buf, this.pos);\r\n this.pos += 8;\r\n return value;\r\n};\r\n\r\n/**\r\n * Reads a sequence of bytes preceeded by its length as a varint.\r\n * @returns {Uint8Array} Value read\r\n */\r\nReader.prototype.bytes = function read_bytes() {\r\n var length = this.uint32(),\r\n start = this.pos,\r\n end = this.pos + length;\r\n\r\n /* istanbul ignore if */\r\n if (end > this.len)\r\n throw indexOutOfRange(this, length);\r\n\r\n this.pos += length;\r\n if (Array.isArray(this.buf)) // plain array\r\n return this.buf.slice(start, end);\r\n return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\r\n ? new this.buf.constructor(0)\r\n : this._slice.call(this.buf, start, end);\r\n};\r\n\r\n/**\r\n * Reads a string preceeded by its byte length as a varint.\r\n * @returns {string} Value read\r\n */\r\nReader.prototype.string = function read_string() {\r\n var bytes = this.bytes();\r\n return utf8.read(bytes, 0, bytes.length);\r\n};\r\n\r\n/**\r\n * Skips the specified number of bytes if specified, otherwise skips a varint.\r\n * @param {number} [length] Length if known, otherwise a varint is assumed\r\n * @returns {Reader} `this`\r\n */\r\nReader.prototype.skip = function skip(length) {\r\n if (typeof length === \"number\") {\r\n /* istanbul ignore if */\r\n if (this.pos + length > this.len)\r\n throw indexOutOfRange(this, length);\r\n this.pos += length;\r\n } else {\r\n do {\r\n /* istanbul ignore if */\r\n if (this.pos >= this.len)\r\n throw indexOutOfRange(this);\r\n } while (this.buf[this.pos++] & 128);\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Skips the next element of the specified wire type.\r\n * @param {number} wireType Wire type received\r\n * @returns {Reader} `this`\r\n */\r\nReader.prototype.skipType = function(wireType) {\r\n switch (wireType) {\r\n case 0:\r\n this.skip();\r\n break;\r\n case 1:\r\n this.skip(8);\r\n break;\r\n case 2:\r\n this.skip(this.uint32());\r\n break;\r\n case 3:\r\n while ((wireType = this.uint32() & 7) !== 4) {\r\n this.skipType(wireType);\r\n }\r\n break;\r\n case 5:\r\n this.skip(4);\r\n break;\r\n\r\n /* istanbul ignore next */\r\n default:\r\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\r\n }\r\n return this;\r\n};\r\n\r\nReader._configure = function(BufferReader_) {\r\n BufferReader = BufferReader_;\r\n\r\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\r\n util.merge(Reader.prototype, {\r\n\r\n int64: function read_int64() {\r\n return readLongVarint.call(this)[fn](false);\r\n },\r\n\r\n uint64: function read_uint64() {\r\n return readLongVarint.call(this)[fn](true);\r\n },\r\n\r\n sint64: function read_sint64() {\r\n return readLongVarint.call(this).zzDecode()[fn](false);\r\n },\r\n\r\n fixed64: function read_fixed64() {\r\n return readFixed64.call(this)[fn](true);\r\n },\r\n\r\n sfixed64: function read_sfixed64() {\r\n return readFixed64.call(this)[fn](false);\r\n }\r\n\r\n });\r\n};\r\n","\"use strict\";\r\nmodule.exports = BufferReader;\r\n\r\n// extends Reader\r\nvar Reader = require(\"./reader\");\r\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\r\n\r\nvar util = require(\"./util/minimal\");\r\n\r\n/**\r\n * Constructs a new buffer reader instance.\r\n * @classdesc Wire format reader using node buffers.\r\n * @extends Reader\r\n * @constructor\r\n * @param {Buffer} buffer Buffer to read from\r\n */\r\nfunction BufferReader(buffer) {\r\n Reader.call(this, buffer);\r\n\r\n /**\r\n * Read buffer.\r\n * @name BufferReader#buf\r\n * @type {Buffer}\r\n */\r\n}\r\n\r\n/* istanbul ignore else */\r\nif (util.Buffer)\r\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\r\n\r\n/**\r\n * @override\r\n */\r\nBufferReader.prototype.string = function read_string_buffer() {\r\n var len = this.uint32(); // modifies pos\r\n return this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len));\r\n};\r\n\r\n/**\r\n * Reads a sequence of bytes preceeded by its length as a varint.\r\n * @name BufferReader#bytes\r\n * @function\r\n * @returns {Buffer} Value read\r\n */\r\n","\"use strict\";\r\nmodule.exports = Service;\r\n\r\nvar util = require(\"../util/minimal\");\r\n\r\n// Extends EventEmitter\r\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\r\n\r\n/**\r\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\r\n *\r\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\r\n * @typedef rpc.ServiceMethodCallback\r\n * @template TRes extends Message<TRes>\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {TRes} [response] Response message\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\r\n * @typedef rpc.ServiceMethod\r\n * @template TReq extends Message<TReq>\r\n * @template TRes extends Message<TRes>\r\n * @type {function}\r\n * @param {TReq|Properties<TReq>} request Request message or plain object\r\n * @param {rpc.ServiceMethodCallback<TRes>} [callback] Node-style callback called with the error, if any, and the response message\r\n * @returns {Promise<Message<TRes>>} Promise if `callback` has been omitted, otherwise `undefined`\r\n */\r\n\r\n/**\r\n * Constructs a new RPC service instance.\r\n * @classdesc An RPC service as returned by {@link Service#create}.\r\n * @exports rpc.Service\r\n * @extends util.EventEmitter\r\n * @constructor\r\n * @param {RPCImpl} rpcImpl RPC implementation\r\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\r\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\r\n */\r\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\r\n\r\n if (typeof rpcImpl !== \"function\")\r\n throw TypeError(\"rpcImpl must be a function\");\r\n\r\n util.EventEmitter.call(this);\r\n\r\n /**\r\n * RPC implementation. Becomes `null` once the service is ended.\r\n * @type {RPCImpl|null}\r\n */\r\n this.rpcImpl = rpcImpl;\r\n\r\n /**\r\n * Whether requests are length-delimited.\r\n * @type {boolean}\r\n */\r\n this.requestDelimited = Boolean(requestDelimited);\r\n\r\n /**\r\n * Whether responses are length-delimited.\r\n * @type {boolean}\r\n */\r\n this.responseDelimited = Boolean(responseDelimited);\r\n}\r\n\r\n/**\r\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\r\n * @param {Method|rpc.ServiceMethod<TReq,TRes>} method Reflected or static method\r\n * @param {Constructor<TReq>} requestCtor Request constructor\r\n * @param {Constructor<TRes>} responseCtor Response constructor\r\n * @param {TReq|Properties<TReq>} request Request message or plain object\r\n * @param {rpc.ServiceMethodCallback<TRes>} callback Service callback\r\n * @returns {undefined}\r\n * @template TReq extends Message<TReq>\r\n * @template TRes extends Message<TRes>\r\n */\r\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\r\n\r\n if (!request)\r\n throw TypeError(\"request must be specified\");\r\n\r\n var self = this;\r\n if (!callback)\r\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\r\n\r\n if (!self.rpcImpl) {\r\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\r\n return undefined;\r\n }\r\n\r\n try {\r\n return self.rpcImpl(\r\n method,\r\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\r\n function rpcCallback(err, response) {\r\n\r\n if (err) {\r\n self.emit(\"error\", err, method);\r\n return callback(err);\r\n }\r\n\r\n if (response === null) {\r\n self.end(/* endedByRPC */ true);\r\n return undefined;\r\n }\r\n\r\n if (!(response instanceof responseCtor)) {\r\n try {\r\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\r\n } catch (err) {\r\n self.emit(\"error\", err, method);\r\n return callback(err);\r\n }\r\n }\r\n\r\n self.emit(\"data\", response, method);\r\n return callback(null, response);\r\n }\r\n );\r\n } catch (err) {\r\n self.emit(\"error\", err, method);\r\n setTimeout(function() { callback(err); }, 0);\r\n return undefined;\r\n }\r\n};\r\n\r\n/**\r\n * Ends this service and emits the `end` event.\r\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\r\n * @returns {rpc.Service} `this`\r\n */\r\nService.prototype.end = function end(endedByRPC) {\r\n if (this.rpcImpl) {\r\n if (!endedByRPC) // signal end to rpcImpl\r\n this.rpcImpl(null, null, null);\r\n this.rpcImpl = null;\r\n this.emit(\"end\").off();\r\n }\r\n return this;\r\n};\r\n","\"use strict\";\r\n\r\n/**\r\n * Streaming RPC helpers.\r\n * @namespace\r\n */\r\nvar rpc = exports;\r\n\r\n/**\r\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\r\n * @typedef RPCImpl\r\n * @type {function}\r\n * @param {Method|rpc.ServiceMethod<Message<{}>,Message<{}>>} method Reflected or static method being called\r\n * @param {Uint8Array} requestData Request data\r\n * @param {RPCImplCallback} callback Callback function\r\n * @returns {undefined}\r\n * @example\r\n * function rpcImpl(method, requestData, callback) {\r\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\r\n * throw Error(\"no such method\");\r\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\r\n * callback(err, responseData);\r\n * });\r\n * }\r\n */\r\n\r\n/**\r\n * Node-style callback as used by {@link RPCImpl}.\r\n * @typedef RPCImplCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any, otherwise `null`\r\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\r\n * @returns {undefined}\r\n */\r\n\r\nrpc.Service = require(\"./rpc/service\");\r\n","\"use strict\";\r\nmodule.exports = {};\r\n\r\n/**\r\n * Named roots.\r\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\r\n * Can also be used manually to make roots available accross modules.\r\n * @name roots\r\n * @type {Object.<string,Root>}\r\n * @example\r\n * // pbjs -r myroot -o compiled.js ...\r\n *\r\n * // in another module:\r\n * require(\"./compiled.js\");\r\n *\r\n * // in any subsequent module:\r\n * var root = protobuf.roots[\"myroot\"];\r\n */\r\n","\"use strict\";\r\nvar protobuf = exports;\r\n\r\n/**\r\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\r\n * @name build\r\n * @type {string}\r\n * @const\r\n */\r\nprotobuf.build = \"minimal\";\r\n\r\n// Serialization\r\nprotobuf.Writer = require(\"./writer\");\r\nprotobuf.BufferWriter = require(\"./writer_buffer\");\r\nprotobuf.Reader = require(\"./reader\");\r\nprotobuf.BufferReader = require(\"./reader_buffer\");\r\n\r\n// Utility\r\nprotobuf.util = require(\"./util/minimal\");\r\nprotobuf.rpc = require(\"./rpc\");\r\nprotobuf.roots = require(\"./roots\");\r\nprotobuf.configure = configure;\r\n\r\n/* istanbul ignore next */\r\n/**\r\n * Reconfigures the library according to the environment.\r\n * @returns {undefined}\r\n */\r\nfunction configure() {\r\n protobuf.Reader._configure(protobuf.BufferReader);\r\n protobuf.util._configure();\r\n}\r\n\r\n// Set up buffer utility according to the environment\r\nprotobuf.Writer._configure(protobuf.BufferWriter);\r\nconfigure();\r\n","// minimal library entry point.\r\n\r\n\"use strict\";\r\nmodule.exports = require(\"./src/index-minimal\");\r\n","// THIS FILE WAS AUTOMATICALLY GENERATED. DO NOT MODIFY THIS FILE MANUALLY.\n//\n// To regenerate this file, run the following in the repository root:\n//\n// node node_modules/protobufjs/cli/bin/pbjs -t static-module -w commonjs -o src/import/profile.proto.js src/import/profile.proto\n//\n// Then prepend this comment to the result.\n/*eslint-disable block-scoped-var, id-length, no-control-regex, no-magic-numbers, no-prototype-builtins, no-redeclare, no-shadow, no-var, sort-vars*/\n'use strict'\n\nvar $protobuf = require('protobufjs/minimal')\n\n// Common aliases\nvar $Reader = $protobuf.Reader,\n $Writer = $protobuf.Writer,\n $util = $protobuf.util\n\n// Exported root namespace\nvar $root = $protobuf.roots['default'] || ($protobuf.roots['default'] = {})\n\n$root.perftools = (function() {\n /**\n * Namespace perftools.\n * @exports perftools\n * @namespace\n */\n var perftools = {}\n\n perftools.profiles = (function() {\n /**\n * Namespace profiles.\n * @memberof perftools\n * @namespace\n */\n var profiles = {}\n\n profiles.Profile = (function() {\n /**\n * Properties of a Profile.\n * @memberof perftools.profiles\n * @interface IProfile\n * @property {Array.<perftools.profiles.IValueType>|null} [sampleType] Profile sampleType\n * @property {Array.<perftools.profiles.ISample>|null} [sample] Profile sample\n * @property {Array.<perftools.profiles.IMapping>|null} [mapping] Profile mapping\n * @property {Array.<perftools.profiles.ILocation>|null} [location] Profile location\n * @property {Array.<perftools.profiles.IFunction>|null} [\"function\"] Profile function\n * @property {Array.<string>|null} [stringTable] Profile stringTable\n * @property {number|Long|null} [dropFrames] Profile dropFrames\n * @property {number|Long|null} [keepFrames] Profile keepFrames\n * @property {number|Long|null} [timeNanos] Profile timeNanos\n * @property {number|Long|null} [durationNanos] Profile durationNanos\n * @property {perftools.profiles.IValueType|null} [periodType] Profile periodType\n * @property {number|Long|null} [period] Profile period\n * @property {Array.<number|Long>|null} [comment] Profile comment\n * @property {number|Long|null} [defaultSampleType] Profile defaultSampleType\n */\n\n /**\n * Constructs a new Profile.\n * @memberof perftools.profiles\n * @classdesc Represents a Profile.\n * @implements IProfile\n * @constructor\n * @param {perftools.profiles.IProfile=} [properties] Properties to set\n */\n function Profile(properties) {\n this.sampleType = []\n this.sample = []\n this.mapping = []\n this.location = []\n this['function'] = []\n this.stringTable = []\n this.comment = []\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Profile sampleType.\n * @member {Array.<perftools.profiles.IValueType>} sampleType\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.sampleType = $util.emptyArray\n\n /**\n * Profile sample.\n * @member {Array.<perftools.profiles.ISample>} sample\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.sample = $util.emptyArray\n\n /**\n * Profile mapping.\n * @member {Array.<perftools.profiles.IMapping>} mapping\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.mapping = $util.emptyArray\n\n /**\n * Profile location.\n * @member {Array.<perftools.profiles.ILocation>} location\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.location = $util.emptyArray\n\n /**\n * Profile function.\n * @member {Array.<perftools.profiles.IFunction>} function\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype['function'] = $util.emptyArray\n\n /**\n * Profile stringTable.\n * @member {Array.<string>} stringTable\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.stringTable = $util.emptyArray\n\n /**\n * Profile dropFrames.\n * @member {number|Long} dropFrames\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.dropFrames = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Profile keepFrames.\n * @member {number|Long} keepFrames\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.keepFrames = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Profile timeNanos.\n * @member {number|Long} timeNanos\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.timeNanos = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Profile durationNanos.\n * @member {number|Long} durationNanos\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.durationNanos = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Profile periodType.\n * @member {perftools.profiles.IValueType|null|undefined} periodType\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.periodType = null\n\n /**\n * Profile period.\n * @member {number|Long} period\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.period = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Profile comment.\n * @member {Array.<number|Long>} comment\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.comment = $util.emptyArray\n\n /**\n * Profile defaultSampleType.\n * @member {number|Long} defaultSampleType\n * @memberof perftools.profiles.Profile\n * @instance\n */\n Profile.prototype.defaultSampleType = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Creates a new Profile instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Profile\n * @static\n * @param {perftools.profiles.IProfile=} [properties] Properties to set\n * @returns {perftools.profiles.Profile} Profile instance\n */\n Profile.create = function create(properties) {\n return new Profile(properties)\n }\n\n /**\n * Encodes the specified Profile message. Does not implicitly {@link perftools.profiles.Profile.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Profile\n * @static\n * @param {perftools.profiles.IProfile} message Profile message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Profile.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.sampleType != null && message.sampleType.length)\n for (var i = 0; i < message.sampleType.length; ++i)\n $root.perftools.profiles.ValueType.encode(\n message.sampleType[i],\n writer.uint32(/* id 1, wireType 2 =*/ 10).fork(),\n ).ldelim()\n if (message.sample != null && message.sample.length)\n for (var i = 0; i < message.sample.length; ++i)\n $root.perftools.profiles.Sample.encode(\n message.sample[i],\n writer.uint32(/* id 2, wireType 2 =*/ 18).fork(),\n ).ldelim()\n if (message.mapping != null && message.mapping.length)\n for (var i = 0; i < message.mapping.length; ++i)\n $root.perftools.profiles.Mapping.encode(\n message.mapping[i],\n writer.uint32(/* id 3, wireType 2 =*/ 26).fork(),\n ).ldelim()\n if (message.location != null && message.location.length)\n for (var i = 0; i < message.location.length; ++i)\n $root.perftools.profiles.Location.encode(\n message.location[i],\n writer.uint32(/* id 4, wireType 2 =*/ 34).fork(),\n ).ldelim()\n if (message['function'] != null && message['function'].length)\n for (var i = 0; i < message['function'].length; ++i)\n $root.perftools.profiles.Function.encode(\n message['function'][i],\n writer.uint32(/* id 5, wireType 2 =*/ 42).fork(),\n ).ldelim()\n if (message.stringTable != null && message.stringTable.length)\n for (var i = 0; i < message.stringTable.length; ++i)\n writer.uint32(/* id 6, wireType 2 =*/ 50).string(message.stringTable[i])\n if (message.dropFrames != null && message.hasOwnProperty('dropFrames'))\n writer.uint32(/* id 7, wireType 0 =*/ 56).int64(message.dropFrames)\n if (message.keepFrames != null && message.hasOwnProperty('keepFrames'))\n writer.uint32(/* id 8, wireType 0 =*/ 64).int64(message.keepFrames)\n if (message.timeNanos != null && message.hasOwnProperty('timeNanos'))\n writer.uint32(/* id 9, wireType 0 =*/ 72).int64(message.timeNanos)\n if (message.durationNanos != null && message.hasOwnProperty('durationNanos'))\n writer.uint32(/* id 10, wireType 0 =*/ 80).int64(message.durationNanos)\n if (message.periodType != null && message.hasOwnProperty('periodType'))\n $root.perftools.profiles.ValueType.encode(\n message.periodType,\n writer.uint32(/* id 11, wireType 2 =*/ 90).fork(),\n ).ldelim()\n if (message.period != null && message.hasOwnProperty('period'))\n writer.uint32(/* id 12, wireType 0 =*/ 96).int64(message.period)\n if (message.comment != null && message.comment.length) {\n writer.uint32(/* id 13, wireType 2 =*/ 106).fork()\n for (var i = 0; i < message.comment.length; ++i) writer.int64(message.comment[i])\n writer.ldelim()\n }\n if (message.defaultSampleType != null && message.hasOwnProperty('defaultSampleType'))\n writer.uint32(/* id 14, wireType 0 =*/ 112).int64(message.defaultSampleType)\n return writer\n }\n\n /**\n * Encodes the specified Profile message, length delimited. Does not implicitly {@link perftools.profiles.Profile.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Profile\n * @static\n * @param {perftools.profiles.IProfile} message Profile message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Profile.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Profile message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Profile\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Profile} Profile\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Profile.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Profile()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n if (!(message.sampleType && message.sampleType.length)) message.sampleType = []\n message.sampleType.push(\n $root.perftools.profiles.ValueType.decode(reader, reader.uint32()),\n )\n break\n case 2:\n if (!(message.sample && message.sample.length)) message.sample = []\n message.sample.push($root.perftools.profiles.Sample.decode(reader, reader.uint32()))\n break\n case 3:\n if (!(message.mapping && message.mapping.length)) message.mapping = []\n message.mapping.push($root.perftools.profiles.Mapping.decode(reader, reader.uint32()))\n break\n case 4:\n if (!(message.location && message.location.length)) message.location = []\n message.location.push(\n $root.perftools.profiles.Location.decode(reader, reader.uint32()),\n )\n break\n case 5:\n if (!(message['function'] && message['function'].length)) message['function'] = []\n message['function'].push(\n $root.perftools.profiles.Function.decode(reader, reader.uint32()),\n )\n break\n case 6:\n if (!(message.stringTable && message.stringTable.length)) message.stringTable = []\n message.stringTable.push(reader.string())\n break\n case 7:\n message.dropFrames = reader.int64()\n break\n case 8:\n message.keepFrames = reader.int64()\n break\n case 9:\n message.timeNanos = reader.int64()\n break\n case 10:\n message.durationNanos = reader.int64()\n break\n case 11:\n message.periodType = $root.perftools.profiles.ValueType.decode(\n reader,\n reader.uint32(),\n )\n break\n case 12:\n message.period = reader.int64()\n break\n case 13:\n if (!(message.comment && message.comment.length)) message.comment = []\n if ((tag & 7) === 2) {\n var end2 = reader.uint32() + reader.pos\n while (reader.pos < end2) message.comment.push(reader.int64())\n } else message.comment.push(reader.int64())\n break\n case 14:\n message.defaultSampleType = reader.int64()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Profile message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Profile\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Profile} Profile\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Profile.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Profile message.\n * @function verify\n * @memberof perftools.profiles.Profile\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Profile.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.sampleType != null && message.hasOwnProperty('sampleType')) {\n if (!Array.isArray(message.sampleType)) return 'sampleType: array expected'\n for (var i = 0; i < message.sampleType.length; ++i) {\n var error = $root.perftools.profiles.ValueType.verify(message.sampleType[i])\n if (error) return 'sampleType.' + error\n }\n }\n if (message.sample != null && message.hasOwnProperty('sample')) {\n if (!Array.isArray(message.sample)) return 'sample: array expected'\n for (var i = 0; i < message.sample.length; ++i) {\n var error = $root.perftools.profiles.Sample.verify(message.sample[i])\n if (error) return 'sample.' + error\n }\n }\n if (message.mapping != null && message.hasOwnProperty('mapping')) {\n if (!Array.isArray(message.mapping)) return 'mapping: array expected'\n for (var i = 0; i < message.mapping.length; ++i) {\n var error = $root.perftools.profiles.Mapping.verify(message.mapping[i])\n if (error) return 'mapping.' + error\n }\n }\n if (message.location != null && message.hasOwnProperty('location')) {\n if (!Array.isArray(message.location)) return 'location: array expected'\n for (var i = 0; i < message.location.length; ++i) {\n var error = $root.perftools.profiles.Location.verify(message.location[i])\n if (error) return 'location.' + error\n }\n }\n if (message['function'] != null && message.hasOwnProperty('function')) {\n if (!Array.isArray(message['function'])) return 'function: array expected'\n for (var i = 0; i < message['function'].length; ++i) {\n var error = $root.perftools.profiles.Function.verify(message['function'][i])\n if (error) return 'function.' + error\n }\n }\n if (message.stringTable != null && message.hasOwnProperty('stringTable')) {\n if (!Array.isArray(message.stringTable)) return 'stringTable: array expected'\n for (var i = 0; i < message.stringTable.length; ++i)\n if (!$util.isString(message.stringTable[i])) return 'stringTable: string[] expected'\n }\n if (message.dropFrames != null && message.hasOwnProperty('dropFrames'))\n if (\n !$util.isInteger(message.dropFrames) &&\n !(\n message.dropFrames &&\n $util.isInteger(message.dropFrames.low) &&\n $util.isInteger(message.dropFrames.high)\n )\n )\n return 'dropFrames: integer|Long expected'\n if (message.keepFrames != null && message.hasOwnProperty('keepFrames'))\n if (\n !$util.isInteger(message.keepFrames) &&\n !(\n message.keepFrames &&\n $util.isInteger(message.keepFrames.low) &&\n $util.isInteger(message.keepFrames.high)\n )\n )\n return 'keepFrames: integer|Long expected'\n if (message.timeNanos != null && message.hasOwnProperty('timeNanos'))\n if (\n !$util.isInteger(message.timeNanos) &&\n !(\n message.timeNanos &&\n $util.isInteger(message.timeNanos.low) &&\n $util.isInteger(message.timeNanos.high)\n )\n )\n return 'timeNanos: integer|Long expected'\n if (message.durationNanos != null && message.hasOwnProperty('durationNanos'))\n if (\n !$util.isInteger(message.durationNanos) &&\n !(\n message.durationNanos &&\n $util.isInteger(message.durationNanos.low) &&\n $util.isInteger(message.durationNanos.high)\n )\n )\n return 'durationNanos: integer|Long expected'\n if (message.periodType != null && message.hasOwnProperty('periodType')) {\n var error = $root.perftools.profiles.ValueType.verify(message.periodType)\n if (error) return 'periodType.' + error\n }\n if (message.period != null && message.hasOwnProperty('period'))\n if (\n !$util.isInteger(message.period) &&\n !(\n message.period &&\n $util.isInteger(message.period.low) &&\n $util.isInteger(message.period.high)\n )\n )\n return 'period: integer|Long expected'\n if (message.comment != null && message.hasOwnProperty('comment')) {\n if (!Array.isArray(message.comment)) return 'comment: array expected'\n for (var i = 0; i < message.comment.length; ++i)\n if (\n !$util.isInteger(message.comment[i]) &&\n !(\n message.comment[i] &&\n $util.isInteger(message.comment[i].low) &&\n $util.isInteger(message.comment[i].high)\n )\n )\n return 'comment: integer|Long[] expected'\n }\n if (message.defaultSampleType != null && message.hasOwnProperty('defaultSampleType'))\n if (\n !$util.isInteger(message.defaultSampleType) &&\n !(\n message.defaultSampleType &&\n $util.isInteger(message.defaultSampleType.low) &&\n $util.isInteger(message.defaultSampleType.high)\n )\n )\n return 'defaultSampleType: integer|Long expected'\n return null\n }\n\n /**\n * Creates a Profile message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Profile\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Profile} Profile\n */\n Profile.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Profile) return object\n var message = new $root.perftools.profiles.Profile()\n if (object.sampleType) {\n if (!Array.isArray(object.sampleType))\n throw TypeError('.perftools.profiles.Profile.sampleType: array expected')\n message.sampleType = []\n for (var i = 0; i < object.sampleType.length; ++i) {\n if (typeof object.sampleType[i] !== 'object')\n throw TypeError('.perftools.profiles.Profile.sampleType: object expected')\n message.sampleType[i] = $root.perftools.profiles.ValueType.fromObject(\n object.sampleType[i],\n )\n }\n }\n if (object.sample) {\n if (!Array.isArray(object.sample))\n throw TypeError('.perftools.profiles.Profile.sample: array expected')\n message.sample = []\n for (var i = 0; i < object.sample.length; ++i) {\n if (typeof object.sample[i] !== 'object')\n throw TypeError('.perftools.profiles.Profile.sample: object expected')\n message.sample[i] = $root.perftools.profiles.Sample.fromObject(object.sample[i])\n }\n }\n if (object.mapping) {\n if (!Array.isArray(object.mapping))\n throw TypeError('.perftools.profiles.Profile.mapping: array expected')\n message.mapping = []\n for (var i = 0; i < object.mapping.length; ++i) {\n if (typeof object.mapping[i] !== 'object')\n throw TypeError('.perftools.profiles.Profile.mapping: object expected')\n message.mapping[i] = $root.perftools.profiles.Mapping.fromObject(object.mapping[i])\n }\n }\n if (object.location) {\n if (!Array.isArray(object.location))\n throw TypeError('.perftools.profiles.Profile.location: array expected')\n message.location = []\n for (var i = 0; i < object.location.length; ++i) {\n if (typeof object.location[i] !== 'object')\n throw TypeError('.perftools.profiles.Profile.location: object expected')\n message.location[i] = $root.perftools.profiles.Location.fromObject(object.location[i])\n }\n }\n if (object['function']) {\n if (!Array.isArray(object['function']))\n throw TypeError('.perftools.profiles.Profile.function: array expected')\n message['function'] = []\n for (var i = 0; i < object['function'].length; ++i) {\n if (typeof object['function'][i] !== 'object')\n throw TypeError('.perftools.profiles.Profile.function: object expected')\n message['function'][i] = $root.perftools.profiles.Function.fromObject(\n object['function'][i],\n )\n }\n }\n if (object.stringTable) {\n if (!Array.isArray(object.stringTable))\n throw TypeError('.perftools.profiles.Profile.stringTable: array expected')\n message.stringTable = []\n for (var i = 0; i < object.stringTable.length; ++i)\n message.stringTable[i] = String(object.stringTable[i])\n }\n if (object.dropFrames != null)\n if ($util.Long)\n (message.dropFrames = $util.Long.fromValue(object.dropFrames)).unsigned = false\n else if (typeof object.dropFrames === 'string')\n message.dropFrames = parseInt(object.dropFrames, 10)\n else if (typeof object.dropFrames === 'number') message.dropFrames = object.dropFrames\n else if (typeof object.dropFrames === 'object')\n message.dropFrames = new $util.LongBits(\n object.dropFrames.low >>> 0,\n object.dropFrames.high >>> 0,\n ).toNumber()\n if (object.keepFrames != null)\n if ($util.Long)\n (message.keepFrames = $util.Long.fromValue(object.keepFrames)).unsigned = false\n else if (typeof object.keepFrames === 'string')\n message.keepFrames = parseInt(object.keepFrames, 10)\n else if (typeof object.keepFrames === 'number') message.keepFrames = object.keepFrames\n else if (typeof object.keepFrames === 'object')\n message.keepFrames = new $util.LongBits(\n object.keepFrames.low >>> 0,\n object.keepFrames.high >>> 0,\n ).toNumber()\n if (object.timeNanos != null)\n if ($util.Long)\n (message.timeNanos = $util.Long.fromValue(object.timeNanos)).unsigned = false\n else if (typeof object.timeNanos === 'string')\n message.timeNanos = parseInt(object.timeNanos, 10)\n else if (typeof object.timeNanos === 'number') message.timeNanos = object.timeNanos\n else if (typeof object.timeNanos === 'object')\n message.timeNanos = new $util.LongBits(\n object.timeNanos.low >>> 0,\n object.timeNanos.high >>> 0,\n ).toNumber()\n if (object.durationNanos != null)\n if ($util.Long)\n (message.durationNanos = $util.Long.fromValue(object.durationNanos)).unsigned = false\n else if (typeof object.durationNanos === 'string')\n message.durationNanos = parseInt(object.durationNanos, 10)\n else if (typeof object.durationNanos === 'number')\n message.durationNanos = object.durationNanos\n else if (typeof object.durationNanos === 'object')\n message.durationNanos = new $util.LongBits(\n object.durationNanos.low >>> 0,\n object.durationNanos.high >>> 0,\n ).toNumber()\n if (object.periodType != null) {\n if (typeof object.periodType !== 'object')\n throw TypeError('.perftools.profiles.Profile.periodType: object expected')\n message.periodType = $root.perftools.profiles.ValueType.fromObject(object.periodType)\n }\n if (object.period != null)\n if ($util.Long) (message.period = $util.Long.fromValue(object.period)).unsigned = false\n else if (typeof object.period === 'string') message.period = parseInt(object.period, 10)\n else if (typeof object.period === 'number') message.period = object.period\n else if (typeof object.period === 'object')\n message.period = new $util.LongBits(\n object.period.low >>> 0,\n object.period.high >>> 0,\n ).toNumber()\n if (object.comment) {\n if (!Array.isArray(object.comment))\n throw TypeError('.perftools.profiles.Profile.comment: array expected')\n message.comment = []\n for (var i = 0; i < object.comment.length; ++i)\n if ($util.Long)\n (message.comment[i] = $util.Long.fromValue(object.comment[i])).unsigned = false\n else if (typeof object.comment[i] === 'string')\n message.comment[i] = parseInt(object.comment[i], 10)\n else if (typeof object.comment[i] === 'number') message.comment[i] = object.comment[i]\n else if (typeof object.comment[i] === 'object')\n message.comment[i] = new $util.LongBits(\n object.comment[i].low >>> 0,\n object.comment[i].high >>> 0,\n ).toNumber()\n }\n if (object.defaultSampleType != null)\n if ($util.Long)\n (message.defaultSampleType = $util.Long.fromValue(\n object.defaultSampleType,\n )).unsigned = false\n else if (typeof object.defaultSampleType === 'string')\n message.defaultSampleType = parseInt(object.defaultSampleType, 10)\n else if (typeof object.defaultSampleType === 'number')\n message.defaultSampleType = object.defaultSampleType\n else if (typeof object.defaultSampleType === 'object')\n message.defaultSampleType = new $util.LongBits(\n object.defaultSampleType.low >>> 0,\n object.defaultSampleType.high >>> 0,\n ).toNumber()\n return message\n }\n\n /**\n * Creates a plain object from a Profile message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Profile\n * @static\n * @param {perftools.profiles.Profile} message Profile\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Profile.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.arrays || options.defaults) {\n object.sampleType = []\n object.sample = []\n object.mapping = []\n object.location = []\n object['function'] = []\n object.stringTable = []\n object.comment = []\n }\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.dropFrames =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.dropFrames = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.keepFrames =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.keepFrames = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.timeNanos =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.timeNanos = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.durationNanos =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.durationNanos = options.longs === String ? '0' : 0\n object.periodType = null\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.period =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.period = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.defaultSampleType =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.defaultSampleType = options.longs === String ? '0' : 0\n }\n if (message.sampleType && message.sampleType.length) {\n object.sampleType = []\n for (var j = 0; j < message.sampleType.length; ++j)\n object.sampleType[j] = $root.perftools.profiles.ValueType.toObject(\n message.sampleType[j],\n options,\n )\n }\n if (message.sample && message.sample.length) {\n object.sample = []\n for (var j = 0; j < message.sample.length; ++j)\n object.sample[j] = $root.perftools.profiles.Sample.toObject(message.sample[j], options)\n }\n if (message.mapping && message.mapping.length) {\n object.mapping = []\n for (var j = 0; j < message.mapping.length; ++j)\n object.mapping[j] = $root.perftools.profiles.Mapping.toObject(\n message.mapping[j],\n options,\n )\n }\n if (message.location && message.location.length) {\n object.location = []\n for (var j = 0; j < message.location.length; ++j)\n object.location[j] = $root.perftools.profiles.Location.toObject(\n message.location[j],\n options,\n )\n }\n if (message['function'] && message['function'].length) {\n object['function'] = []\n for (var j = 0; j < message['function'].length; ++j)\n object['function'][j] = $root.perftools.profiles.Function.toObject(\n message['function'][j],\n options,\n )\n }\n if (message.stringTable && message.stringTable.length) {\n object.stringTable = []\n for (var j = 0; j < message.stringTable.length; ++j)\n object.stringTable[j] = message.stringTable[j]\n }\n if (message.dropFrames != null && message.hasOwnProperty('dropFrames'))\n if (typeof message.dropFrames === 'number')\n object.dropFrames =\n options.longs === String ? String(message.dropFrames) : message.dropFrames\n else\n object.dropFrames =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.dropFrames)\n : options.longs === Number\n ? new $util.LongBits(\n message.dropFrames.low >>> 0,\n message.dropFrames.high >>> 0,\n ).toNumber()\n : message.dropFrames\n if (message.keepFrames != null && message.hasOwnProperty('keepFrames'))\n if (typeof message.keepFrames === 'number')\n object.keepFrames =\n options.longs === String ? String(message.keepFrames) : message.keepFrames\n else\n object.keepFrames =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.keepFrames)\n : options.longs === Number\n ? new $util.LongBits(\n message.keepFrames.low >>> 0,\n message.keepFrames.high >>> 0,\n ).toNumber()\n : message.keepFrames\n if (message.timeNanos != null && message.hasOwnProperty('timeNanos'))\n if (typeof message.timeNanos === 'number')\n object.timeNanos =\n options.longs === String ? String(message.timeNanos) : message.timeNanos\n else\n object.timeNanos =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.timeNanos)\n : options.longs === Number\n ? new $util.LongBits(\n message.timeNanos.low >>> 0,\n message.timeNanos.high >>> 0,\n ).toNumber()\n : message.timeNanos\n if (message.durationNanos != null && message.hasOwnProperty('durationNanos'))\n if (typeof message.durationNanos === 'number')\n object.durationNanos =\n options.longs === String ? String(message.durationNanos) : message.durationNanos\n else\n object.durationNanos =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.durationNanos)\n : options.longs === Number\n ? new $util.LongBits(\n message.durationNanos.low >>> 0,\n message.durationNanos.high >>> 0,\n ).toNumber()\n : message.durationNanos\n if (message.periodType != null && message.hasOwnProperty('periodType'))\n object.periodType = $root.perftools.profiles.ValueType.toObject(\n message.periodType,\n options,\n )\n if (message.period != null && message.hasOwnProperty('period'))\n if (typeof message.period === 'number')\n object.period = options.longs === String ? String(message.period) : message.period\n else\n object.period =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.period)\n : options.longs === Number\n ? new $util.LongBits(\n message.period.low >>> 0,\n message.period.high >>> 0,\n ).toNumber()\n : message.period\n if (message.comment && message.comment.length) {\n object.comment = []\n for (var j = 0; j < message.comment.length; ++j)\n if (typeof message.comment[j] === 'number')\n object.comment[j] =\n options.longs === String ? String(message.comment[j]) : message.comment[j]\n else\n object.comment[j] =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.comment[j])\n : options.longs === Number\n ? new $util.LongBits(\n message.comment[j].low >>> 0,\n message.comment[j].high >>> 0,\n ).toNumber()\n : message.comment[j]\n }\n if (message.defaultSampleType != null && message.hasOwnProperty('defaultSampleType'))\n if (typeof message.defaultSampleType === 'number')\n object.defaultSampleType =\n options.longs === String\n ? String(message.defaultSampleType)\n : message.defaultSampleType\n else\n object.defaultSampleType =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.defaultSampleType)\n : options.longs === Number\n ? new $util.LongBits(\n message.defaultSampleType.low >>> 0,\n message.defaultSampleType.high >>> 0,\n ).toNumber()\n : message.defaultSampleType\n return object\n }\n\n /**\n * Converts this Profile to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Profile\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Profile.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Profile\n })()\n\n profiles.ValueType = (function() {\n /**\n * Properties of a ValueType.\n * @memberof perftools.profiles\n * @interface IValueType\n * @property {number|Long|null} [type] ValueType type\n * @property {number|Long|null} [unit] ValueType unit\n */\n\n /**\n * Constructs a new ValueType.\n * @memberof perftools.profiles\n * @classdesc Represents a ValueType.\n * @implements IValueType\n * @constructor\n * @param {perftools.profiles.IValueType=} [properties] Properties to set\n */\n function ValueType(properties) {\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * ValueType type.\n * @member {number|Long} type\n * @memberof perftools.profiles.ValueType\n * @instance\n */\n ValueType.prototype.type = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * ValueType unit.\n * @member {number|Long} unit\n * @memberof perftools.profiles.ValueType\n * @instance\n */\n ValueType.prototype.unit = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Creates a new ValueType instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {perftools.profiles.IValueType=} [properties] Properties to set\n * @returns {perftools.profiles.ValueType} ValueType instance\n */\n ValueType.create = function create(properties) {\n return new ValueType(properties)\n }\n\n /**\n * Encodes the specified ValueType message. Does not implicitly {@link perftools.profiles.ValueType.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {perftools.profiles.IValueType} message ValueType message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n ValueType.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.type != null && message.hasOwnProperty('type'))\n writer.uint32(/* id 1, wireType 0 =*/ 8).int64(message.type)\n if (message.unit != null && message.hasOwnProperty('unit'))\n writer.uint32(/* id 2, wireType 0 =*/ 16).int64(message.unit)\n return writer\n }\n\n /**\n * Encodes the specified ValueType message, length delimited. Does not implicitly {@link perftools.profiles.ValueType.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {perftools.profiles.IValueType} message ValueType message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n ValueType.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a ValueType message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.ValueType} ValueType\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n ValueType.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.ValueType()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n message.type = reader.int64()\n break\n case 2:\n message.unit = reader.int64()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a ValueType message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.ValueType} ValueType\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n ValueType.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a ValueType message.\n * @function verify\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n ValueType.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.type != null && message.hasOwnProperty('type'))\n if (\n !$util.isInteger(message.type) &&\n !(\n message.type &&\n $util.isInteger(message.type.low) &&\n $util.isInteger(message.type.high)\n )\n )\n return 'type: integer|Long expected'\n if (message.unit != null && message.hasOwnProperty('unit'))\n if (\n !$util.isInteger(message.unit) &&\n !(\n message.unit &&\n $util.isInteger(message.unit.low) &&\n $util.isInteger(message.unit.high)\n )\n )\n return 'unit: integer|Long expected'\n return null\n }\n\n /**\n * Creates a ValueType message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.ValueType} ValueType\n */\n ValueType.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.ValueType) return object\n var message = new $root.perftools.profiles.ValueType()\n if (object.type != null)\n if ($util.Long) (message.type = $util.Long.fromValue(object.type)).unsigned = false\n else if (typeof object.type === 'string') message.type = parseInt(object.type, 10)\n else if (typeof object.type === 'number') message.type = object.type\n else if (typeof object.type === 'object')\n message.type = new $util.LongBits(\n object.type.low >>> 0,\n object.type.high >>> 0,\n ).toNumber()\n if (object.unit != null)\n if ($util.Long) (message.unit = $util.Long.fromValue(object.unit)).unsigned = false\n else if (typeof object.unit === 'string') message.unit = parseInt(object.unit, 10)\n else if (typeof object.unit === 'number') message.unit = object.unit\n else if (typeof object.unit === 'object')\n message.unit = new $util.LongBits(\n object.unit.low >>> 0,\n object.unit.high >>> 0,\n ).toNumber()\n return message\n }\n\n /**\n * Creates a plain object from a ValueType message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.ValueType\n * @static\n * @param {perftools.profiles.ValueType} message ValueType\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n ValueType.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.type =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.type = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.unit =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.unit = options.longs === String ? '0' : 0\n }\n if (message.type != null && message.hasOwnProperty('type'))\n if (typeof message.type === 'number')\n object.type = options.longs === String ? String(message.type) : message.type\n else\n object.type =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.type)\n : options.longs === Number\n ? new $util.LongBits(message.type.low >>> 0, message.type.high >>> 0).toNumber()\n : message.type\n if (message.unit != null && message.hasOwnProperty('unit'))\n if (typeof message.unit === 'number')\n object.unit = options.longs === String ? String(message.unit) : message.unit\n else\n object.unit =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.unit)\n : options.longs === Number\n ? new $util.LongBits(message.unit.low >>> 0, message.unit.high >>> 0).toNumber()\n : message.unit\n return object\n }\n\n /**\n * Converts this ValueType to JSON.\n * @function toJSON\n * @memberof perftools.profiles.ValueType\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n ValueType.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return ValueType\n })()\n\n profiles.Sample = (function() {\n /**\n * Properties of a Sample.\n * @memberof perftools.profiles\n * @interface ISample\n * @property {Array.<number|Long>|null} [locationId] Sample locationId\n * @property {Array.<number|Long>|null} [value] Sample value\n * @property {Array.<perftools.profiles.ILabel>|null} [label] Sample label\n */\n\n /**\n * Constructs a new Sample.\n * @memberof perftools.profiles\n * @classdesc Represents a Sample.\n * @implements ISample\n * @constructor\n * @param {perftools.profiles.ISample=} [properties] Properties to set\n */\n function Sample(properties) {\n this.locationId = []\n this.value = []\n this.label = []\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Sample locationId.\n * @member {Array.<number|Long>} locationId\n * @memberof perftools.profiles.Sample\n * @instance\n */\n Sample.prototype.locationId = $util.emptyArray\n\n /**\n * Sample value.\n * @member {Array.<number|Long>} value\n * @memberof perftools.profiles.Sample\n * @instance\n */\n Sample.prototype.value = $util.emptyArray\n\n /**\n * Sample label.\n * @member {Array.<perftools.profiles.ILabel>} label\n * @memberof perftools.profiles.Sample\n * @instance\n */\n Sample.prototype.label = $util.emptyArray\n\n /**\n * Creates a new Sample instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Sample\n * @static\n * @param {perftools.profiles.ISample=} [properties] Properties to set\n * @returns {perftools.profiles.Sample} Sample instance\n */\n Sample.create = function create(properties) {\n return new Sample(properties)\n }\n\n /**\n * Encodes the specified Sample message. Does not implicitly {@link perftools.profiles.Sample.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Sample\n * @static\n * @param {perftools.profiles.ISample} message Sample message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Sample.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.locationId != null && message.locationId.length) {\n writer.uint32(/* id 1, wireType 2 =*/ 10).fork()\n for (var i = 0; i < message.locationId.length; ++i) writer.uint64(message.locationId[i])\n writer.ldelim()\n }\n if (message.value != null && message.value.length) {\n writer.uint32(/* id 2, wireType 2 =*/ 18).fork()\n for (var i = 0; i < message.value.length; ++i) writer.int64(message.value[i])\n writer.ldelim()\n }\n if (message.label != null && message.label.length)\n for (var i = 0; i < message.label.length; ++i)\n $root.perftools.profiles.Label.encode(\n message.label[i],\n writer.uint32(/* id 3, wireType 2 =*/ 26).fork(),\n ).ldelim()\n return writer\n }\n\n /**\n * Encodes the specified Sample message, length delimited. Does not implicitly {@link perftools.profiles.Sample.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Sample\n * @static\n * @param {perftools.profiles.ISample} message Sample message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Sample.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Sample message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Sample\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Sample} Sample\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Sample.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Sample()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n if (!(message.locationId && message.locationId.length)) message.locationId = []\n if ((tag & 7) === 2) {\n var end2 = reader.uint32() + reader.pos\n while (reader.pos < end2) message.locationId.push(reader.uint64())\n } else message.locationId.push(reader.uint64())\n break\n case 2:\n if (!(message.value && message.value.length)) message.value = []\n if ((tag & 7) === 2) {\n var end2 = reader.uint32() + reader.pos\n while (reader.pos < end2) message.value.push(reader.int64())\n } else message.value.push(reader.int64())\n break\n case 3:\n if (!(message.label && message.label.length)) message.label = []\n message.label.push($root.perftools.profiles.Label.decode(reader, reader.uint32()))\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Sample message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Sample\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Sample} Sample\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Sample.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Sample message.\n * @function verify\n * @memberof perftools.profiles.Sample\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Sample.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.locationId != null && message.hasOwnProperty('locationId')) {\n if (!Array.isArray(message.locationId)) return 'locationId: array expected'\n for (var i = 0; i < message.locationId.length; ++i)\n if (\n !$util.isInteger(message.locationId[i]) &&\n !(\n message.locationId[i] &&\n $util.isInteger(message.locationId[i].low) &&\n $util.isInteger(message.locationId[i].high)\n )\n )\n return 'locationId: integer|Long[] expected'\n }\n if (message.value != null && message.hasOwnProperty('value')) {\n if (!Array.isArray(message.value)) return 'value: array expected'\n for (var i = 0; i < message.value.length; ++i)\n if (\n !$util.isInteger(message.value[i]) &&\n !(\n message.value[i] &&\n $util.isInteger(message.value[i].low) &&\n $util.isInteger(message.value[i].high)\n )\n )\n return 'value: integer|Long[] expected'\n }\n if (message.label != null && message.hasOwnProperty('label')) {\n if (!Array.isArray(message.label)) return 'label: array expected'\n for (var i = 0; i < message.label.length; ++i) {\n var error = $root.perftools.profiles.Label.verify(message.label[i])\n if (error) return 'label.' + error\n }\n }\n return null\n }\n\n /**\n * Creates a Sample message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Sample\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Sample} Sample\n */\n Sample.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Sample) return object\n var message = new $root.perftools.profiles.Sample()\n if (object.locationId) {\n if (!Array.isArray(object.locationId))\n throw TypeError('.perftools.profiles.Sample.locationId: array expected')\n message.locationId = []\n for (var i = 0; i < object.locationId.length; ++i)\n if ($util.Long)\n (message.locationId[i] = $util.Long.fromValue(object.locationId[i])).unsigned = true\n else if (typeof object.locationId[i] === 'string')\n message.locationId[i] = parseInt(object.locationId[i], 10)\n else if (typeof object.locationId[i] === 'number')\n message.locationId[i] = object.locationId[i]\n else if (typeof object.locationId[i] === 'object')\n message.locationId[i] = new $util.LongBits(\n object.locationId[i].low >>> 0,\n object.locationId[i].high >>> 0,\n ).toNumber(true)\n }\n if (object.value) {\n if (!Array.isArray(object.value))\n throw TypeError('.perftools.profiles.Sample.value: array expected')\n message.value = []\n for (var i = 0; i < object.value.length; ++i)\n if ($util.Long)\n (message.value[i] = $util.Long.fromValue(object.value[i])).unsigned = false\n else if (typeof object.value[i] === 'string')\n message.value[i] = parseInt(object.value[i], 10)\n else if (typeof object.value[i] === 'number') message.value[i] = object.value[i]\n else if (typeof object.value[i] === 'object')\n message.value[i] = new $util.LongBits(\n object.value[i].low >>> 0,\n object.value[i].high >>> 0,\n ).toNumber()\n }\n if (object.label) {\n if (!Array.isArray(object.label))\n throw TypeError('.perftools.profiles.Sample.label: array expected')\n message.label = []\n for (var i = 0; i < object.label.length; ++i) {\n if (typeof object.label[i] !== 'object')\n throw TypeError('.perftools.profiles.Sample.label: object expected')\n message.label[i] = $root.perftools.profiles.Label.fromObject(object.label[i])\n }\n }\n return message\n }\n\n /**\n * Creates a plain object from a Sample message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Sample\n * @static\n * @param {perftools.profiles.Sample} message Sample\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Sample.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.arrays || options.defaults) {\n object.locationId = []\n object.value = []\n object.label = []\n }\n if (message.locationId && message.locationId.length) {\n object.locationId = []\n for (var j = 0; j < message.locationId.length; ++j)\n if (typeof message.locationId[j] === 'number')\n object.locationId[j] =\n options.longs === String ? String(message.locationId[j]) : message.locationId[j]\n else\n object.locationId[j] =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.locationId[j])\n : options.longs === Number\n ? new $util.LongBits(\n message.locationId[j].low >>> 0,\n message.locationId[j].high >>> 0,\n ).toNumber(true)\n : message.locationId[j]\n }\n if (message.value && message.value.length) {\n object.value = []\n for (var j = 0; j < message.value.length; ++j)\n if (typeof message.value[j] === 'number')\n object.value[j] =\n options.longs === String ? String(message.value[j]) : message.value[j]\n else\n object.value[j] =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.value[j])\n : options.longs === Number\n ? new $util.LongBits(\n message.value[j].low >>> 0,\n message.value[j].high >>> 0,\n ).toNumber()\n : message.value[j]\n }\n if (message.label && message.label.length) {\n object.label = []\n for (var j = 0; j < message.label.length; ++j)\n object.label[j] = $root.perftools.profiles.Label.toObject(message.label[j], options)\n }\n return object\n }\n\n /**\n * Converts this Sample to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Sample\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Sample.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Sample\n })()\n\n profiles.Label = (function() {\n /**\n * Properties of a Label.\n * @memberof perftools.profiles\n * @interface ILabel\n * @property {number|Long|null} [key] Label key\n * @property {number|Long|null} [str] Label str\n * @property {number|Long|null} [num] Label num\n * @property {number|Long|null} [numUnit] Label numUnit\n */\n\n /**\n * Constructs a new Label.\n * @memberof perftools.profiles\n * @classdesc Represents a Label.\n * @implements ILabel\n * @constructor\n * @param {perftools.profiles.ILabel=} [properties] Properties to set\n */\n function Label(properties) {\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Label key.\n * @member {number|Long} key\n * @memberof perftools.profiles.Label\n * @instance\n */\n Label.prototype.key = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Label str.\n * @member {number|Long} str\n * @memberof perftools.profiles.Label\n * @instance\n */\n Label.prototype.str = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Label num.\n * @member {number|Long} num\n * @memberof perftools.profiles.Label\n * @instance\n */\n Label.prototype.num = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Label numUnit.\n * @member {number|Long} numUnit\n * @memberof perftools.profiles.Label\n * @instance\n */\n Label.prototype.numUnit = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Creates a new Label instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Label\n * @static\n * @param {perftools.profiles.ILabel=} [properties] Properties to set\n * @returns {perftools.profiles.Label} Label instance\n */\n Label.create = function create(properties) {\n return new Label(properties)\n }\n\n /**\n * Encodes the specified Label message. Does not implicitly {@link perftools.profiles.Label.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Label\n * @static\n * @param {perftools.profiles.ILabel} message Label message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Label.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.key != null && message.hasOwnProperty('key'))\n writer.uint32(/* id 1, wireType 0 =*/ 8).int64(message.key)\n if (message.str != null && message.hasOwnProperty('str'))\n writer.uint32(/* id 2, wireType 0 =*/ 16).int64(message.str)\n if (message.num != null && message.hasOwnProperty('num'))\n writer.uint32(/* id 3, wireType 0 =*/ 24).int64(message.num)\n if (message.numUnit != null && message.hasOwnProperty('numUnit'))\n writer.uint32(/* id 4, wireType 0 =*/ 32).int64(message.numUnit)\n return writer\n }\n\n /**\n * Encodes the specified Label message, length delimited. Does not implicitly {@link perftools.profiles.Label.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Label\n * @static\n * @param {perftools.profiles.ILabel} message Label message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Label.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Label message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Label\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Label} Label\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Label.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Label()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n message.key = reader.int64()\n break\n case 2:\n message.str = reader.int64()\n break\n case 3:\n message.num = reader.int64()\n break\n case 4:\n message.numUnit = reader.int64()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Label message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Label\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Label} Label\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Label.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Label message.\n * @function verify\n * @memberof perftools.profiles.Label\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Label.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.key != null && message.hasOwnProperty('key'))\n if (\n !$util.isInteger(message.key) &&\n !(message.key && $util.isInteger(message.key.low) && $util.isInteger(message.key.high))\n )\n return 'key: integer|Long expected'\n if (message.str != null && message.hasOwnProperty('str'))\n if (\n !$util.isInteger(message.str) &&\n !(message.str && $util.isInteger(message.str.low) && $util.isInteger(message.str.high))\n )\n return 'str: integer|Long expected'\n if (message.num != null && message.hasOwnProperty('num'))\n if (\n !$util.isInteger(message.num) &&\n !(message.num && $util.isInteger(message.num.low) && $util.isInteger(message.num.high))\n )\n return 'num: integer|Long expected'\n if (message.numUnit != null && message.hasOwnProperty('numUnit'))\n if (\n !$util.isInteger(message.numUnit) &&\n !(\n message.numUnit &&\n $util.isInteger(message.numUnit.low) &&\n $util.isInteger(message.numUnit.high)\n )\n )\n return 'numUnit: integer|Long expected'\n return null\n }\n\n /**\n * Creates a Label message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Label\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Label} Label\n */\n Label.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Label) return object\n var message = new $root.perftools.profiles.Label()\n if (object.key != null)\n if ($util.Long) (message.key = $util.Long.fromValue(object.key)).unsigned = false\n else if (typeof object.key === 'string') message.key = parseInt(object.key, 10)\n else if (typeof object.key === 'number') message.key = object.key\n else if (typeof object.key === 'object')\n message.key = new $util.LongBits(object.key.low >>> 0, object.key.high >>> 0).toNumber()\n if (object.str != null)\n if ($util.Long) (message.str = $util.Long.fromValue(object.str)).unsigned = false\n else if (typeof object.str === 'string') message.str = parseInt(object.str, 10)\n else if (typeof object.str === 'number') message.str = object.str\n else if (typeof object.str === 'object')\n message.str = new $util.LongBits(object.str.low >>> 0, object.str.high >>> 0).toNumber()\n if (object.num != null)\n if ($util.Long) (message.num = $util.Long.fromValue(object.num)).unsigned = false\n else if (typeof object.num === 'string') message.num = parseInt(object.num, 10)\n else if (typeof object.num === 'number') message.num = object.num\n else if (typeof object.num === 'object')\n message.num = new $util.LongBits(object.num.low >>> 0, object.num.high >>> 0).toNumber()\n if (object.numUnit != null)\n if ($util.Long) (message.numUnit = $util.Long.fromValue(object.numUnit)).unsigned = false\n else if (typeof object.numUnit === 'string')\n message.numUnit = parseInt(object.numUnit, 10)\n else if (typeof object.numUnit === 'number') message.numUnit = object.numUnit\n else if (typeof object.numUnit === 'object')\n message.numUnit = new $util.LongBits(\n object.numUnit.low >>> 0,\n object.numUnit.high >>> 0,\n ).toNumber()\n return message\n }\n\n /**\n * Creates a plain object from a Label message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Label\n * @static\n * @param {perftools.profiles.Label} message Label\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Label.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.key =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.key = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.str =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.str = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.num =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.num = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.numUnit =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.numUnit = options.longs === String ? '0' : 0\n }\n if (message.key != null && message.hasOwnProperty('key'))\n if (typeof message.key === 'number')\n object.key = options.longs === String ? String(message.key) : message.key\n else\n object.key =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.key)\n : options.longs === Number\n ? new $util.LongBits(message.key.low >>> 0, message.key.high >>> 0).toNumber()\n : message.key\n if (message.str != null && message.hasOwnProperty('str'))\n if (typeof message.str === 'number')\n object.str = options.longs === String ? String(message.str) : message.str\n else\n object.str =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.str)\n : options.longs === Number\n ? new $util.LongBits(message.str.low >>> 0, message.str.high >>> 0).toNumber()\n : message.str\n if (message.num != null && message.hasOwnProperty('num'))\n if (typeof message.num === 'number')\n object.num = options.longs === String ? String(message.num) : message.num\n else\n object.num =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.num)\n : options.longs === Number\n ? new $util.LongBits(message.num.low >>> 0, message.num.high >>> 0).toNumber()\n : message.num\n if (message.numUnit != null && message.hasOwnProperty('numUnit'))\n if (typeof message.numUnit === 'number')\n object.numUnit = options.longs === String ? String(message.numUnit) : message.numUnit\n else\n object.numUnit =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.numUnit)\n : options.longs === Number\n ? new $util.LongBits(\n message.numUnit.low >>> 0,\n message.numUnit.high >>> 0,\n ).toNumber()\n : message.numUnit\n return object\n }\n\n /**\n * Converts this Label to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Label\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Label.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Label\n })()\n\n profiles.Mapping = (function() {\n /**\n * Properties of a Mapping.\n * @memberof perftools.profiles\n * @interface IMapping\n * @property {number|Long|null} [id] Mapping id\n * @property {number|Long|null} [memoryStart] Mapping memoryStart\n * @property {number|Long|null} [memoryLimit] Mapping memoryLimit\n * @property {number|Long|null} [fileOffset] Mapping fileOffset\n * @property {number|Long|null} [filename] Mapping filename\n * @property {number|Long|null} [buildId] Mapping buildId\n * @property {boolean|null} [hasFunctions] Mapping hasFunctions\n * @property {boolean|null} [hasFilenames] Mapping hasFilenames\n * @property {boolean|null} [hasLineNumbers] Mapping hasLineNumbers\n * @property {boolean|null} [hasInlineFrames] Mapping hasInlineFrames\n */\n\n /**\n * Constructs a new Mapping.\n * @memberof perftools.profiles\n * @classdesc Represents a Mapping.\n * @implements IMapping\n * @constructor\n * @param {perftools.profiles.IMapping=} [properties] Properties to set\n */\n function Mapping(properties) {\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Mapping id.\n * @member {number|Long} id\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.id = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Mapping memoryStart.\n * @member {number|Long} memoryStart\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.memoryStart = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Mapping memoryLimit.\n * @member {number|Long} memoryLimit\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.memoryLimit = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Mapping fileOffset.\n * @member {number|Long} fileOffset\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.fileOffset = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Mapping filename.\n * @member {number|Long} filename\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.filename = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Mapping buildId.\n * @member {number|Long} buildId\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.buildId = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Mapping hasFunctions.\n * @member {boolean} hasFunctions\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.hasFunctions = false\n\n /**\n * Mapping hasFilenames.\n * @member {boolean} hasFilenames\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.hasFilenames = false\n\n /**\n * Mapping hasLineNumbers.\n * @member {boolean} hasLineNumbers\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.hasLineNumbers = false\n\n /**\n * Mapping hasInlineFrames.\n * @member {boolean} hasInlineFrames\n * @memberof perftools.profiles.Mapping\n * @instance\n */\n Mapping.prototype.hasInlineFrames = false\n\n /**\n * Creates a new Mapping instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {perftools.profiles.IMapping=} [properties] Properties to set\n * @returns {perftools.profiles.Mapping} Mapping instance\n */\n Mapping.create = function create(properties) {\n return new Mapping(properties)\n }\n\n /**\n * Encodes the specified Mapping message. Does not implicitly {@link perftools.profiles.Mapping.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {perftools.profiles.IMapping} message Mapping message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Mapping.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.id != null && message.hasOwnProperty('id'))\n writer.uint32(/* id 1, wireType 0 =*/ 8).uint64(message.id)\n if (message.memoryStart != null && message.hasOwnProperty('memoryStart'))\n writer.uint32(/* id 2, wireType 0 =*/ 16).uint64(message.memoryStart)\n if (message.memoryLimit != null && message.hasOwnProperty('memoryLimit'))\n writer.uint32(/* id 3, wireType 0 =*/ 24).uint64(message.memoryLimit)\n if (message.fileOffset != null && message.hasOwnProperty('fileOffset'))\n writer.uint32(/* id 4, wireType 0 =*/ 32).uint64(message.fileOffset)\n if (message.filename != null && message.hasOwnProperty('filename'))\n writer.uint32(/* id 5, wireType 0 =*/ 40).int64(message.filename)\n if (message.buildId != null && message.hasOwnProperty('buildId'))\n writer.uint32(/* id 6, wireType 0 =*/ 48).int64(message.buildId)\n if (message.hasFunctions != null && message.hasOwnProperty('hasFunctions'))\n writer.uint32(/* id 7, wireType 0 =*/ 56).bool(message.hasFunctions)\n if (message.hasFilenames != null && message.hasOwnProperty('hasFilenames'))\n writer.uint32(/* id 8, wireType 0 =*/ 64).bool(message.hasFilenames)\n if (message.hasLineNumbers != null && message.hasOwnProperty('hasLineNumbers'))\n writer.uint32(/* id 9, wireType 0 =*/ 72).bool(message.hasLineNumbers)\n if (message.hasInlineFrames != null && message.hasOwnProperty('hasInlineFrames'))\n writer.uint32(/* id 10, wireType 0 =*/ 80).bool(message.hasInlineFrames)\n return writer\n }\n\n /**\n * Encodes the specified Mapping message, length delimited. Does not implicitly {@link perftools.profiles.Mapping.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {perftools.profiles.IMapping} message Mapping message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Mapping.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Mapping message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Mapping} Mapping\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Mapping.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Mapping()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n message.id = reader.uint64()\n break\n case 2:\n message.memoryStart = reader.uint64()\n break\n case 3:\n message.memoryLimit = reader.uint64()\n break\n case 4:\n message.fileOffset = reader.uint64()\n break\n case 5:\n message.filename = reader.int64()\n break\n case 6:\n message.buildId = reader.int64()\n break\n case 7:\n message.hasFunctions = reader.bool()\n break\n case 8:\n message.hasFilenames = reader.bool()\n break\n case 9:\n message.hasLineNumbers = reader.bool()\n break\n case 10:\n message.hasInlineFrames = reader.bool()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Mapping message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Mapping} Mapping\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Mapping.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Mapping message.\n * @function verify\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Mapping.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.id != null && message.hasOwnProperty('id'))\n if (\n !$util.isInteger(message.id) &&\n !(message.id && $util.isInteger(message.id.low) && $util.isInteger(message.id.high))\n )\n return 'id: integer|Long expected'\n if (message.memoryStart != null && message.hasOwnProperty('memoryStart'))\n if (\n !$util.isInteger(message.memoryStart) &&\n !(\n message.memoryStart &&\n $util.isInteger(message.memoryStart.low) &&\n $util.isInteger(message.memoryStart.high)\n )\n )\n return 'memoryStart: integer|Long expected'\n if (message.memoryLimit != null && message.hasOwnProperty('memoryLimit'))\n if (\n !$util.isInteger(message.memoryLimit) &&\n !(\n message.memoryLimit &&\n $util.isInteger(message.memoryLimit.low) &&\n $util.isInteger(message.memoryLimit.high)\n )\n )\n return 'memoryLimit: integer|Long expected'\n if (message.fileOffset != null && message.hasOwnProperty('fileOffset'))\n if (\n !$util.isInteger(message.fileOffset) &&\n !(\n message.fileOffset &&\n $util.isInteger(message.fileOffset.low) &&\n $util.isInteger(message.fileOffset.high)\n )\n )\n return 'fileOffset: integer|Long expected'\n if (message.filename != null && message.hasOwnProperty('filename'))\n if (\n !$util.isInteger(message.filename) &&\n !(\n message.filename &&\n $util.isInteger(message.filename.low) &&\n $util.isInteger(message.filename.high)\n )\n )\n return 'filename: integer|Long expected'\n if (message.buildId != null && message.hasOwnProperty('buildId'))\n if (\n !$util.isInteger(message.buildId) &&\n !(\n message.buildId &&\n $util.isInteger(message.buildId.low) &&\n $util.isInteger(message.buildId.high)\n )\n )\n return 'buildId: integer|Long expected'\n if (message.hasFunctions != null && message.hasOwnProperty('hasFunctions'))\n if (typeof message.hasFunctions !== 'boolean') return 'hasFunctions: boolean expected'\n if (message.hasFilenames != null && message.hasOwnProperty('hasFilenames'))\n if (typeof message.hasFilenames !== 'boolean') return 'hasFilenames: boolean expected'\n if (message.hasLineNumbers != null && message.hasOwnProperty('hasLineNumbers'))\n if (typeof message.hasLineNumbers !== 'boolean') return 'hasLineNumbers: boolean expected'\n if (message.hasInlineFrames != null && message.hasOwnProperty('hasInlineFrames'))\n if (typeof message.hasInlineFrames !== 'boolean')\n return 'hasInlineFrames: boolean expected'\n return null\n }\n\n /**\n * Creates a Mapping message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Mapping} Mapping\n */\n Mapping.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Mapping) return object\n var message = new $root.perftools.profiles.Mapping()\n if (object.id != null)\n if ($util.Long) (message.id = $util.Long.fromValue(object.id)).unsigned = true\n else if (typeof object.id === 'string') message.id = parseInt(object.id, 10)\n else if (typeof object.id === 'number') message.id = object.id\n else if (typeof object.id === 'object')\n message.id = new $util.LongBits(object.id.low >>> 0, object.id.high >>> 0).toNumber(\n true,\n )\n if (object.memoryStart != null)\n if ($util.Long)\n (message.memoryStart = $util.Long.fromValue(object.memoryStart)).unsigned = true\n else if (typeof object.memoryStart === 'string')\n message.memoryStart = parseInt(object.memoryStart, 10)\n else if (typeof object.memoryStart === 'number') message.memoryStart = object.memoryStart\n else if (typeof object.memoryStart === 'object')\n message.memoryStart = new $util.LongBits(\n object.memoryStart.low >>> 0,\n object.memoryStart.high >>> 0,\n ).toNumber(true)\n if (object.memoryLimit != null)\n if ($util.Long)\n (message.memoryLimit = $util.Long.fromValue(object.memoryLimit)).unsigned = true\n else if (typeof object.memoryLimit === 'string')\n message.memoryLimit = parseInt(object.memoryLimit, 10)\n else if (typeof object.memoryLimit === 'number') message.memoryLimit = object.memoryLimit\n else if (typeof object.memoryLimit === 'object')\n message.memoryLimit = new $util.LongBits(\n object.memoryLimit.low >>> 0,\n object.memoryLimit.high >>> 0,\n ).toNumber(true)\n if (object.fileOffset != null)\n if ($util.Long)\n (message.fileOffset = $util.Long.fromValue(object.fileOffset)).unsigned = true\n else if (typeof object.fileOffset === 'string')\n message.fileOffset = parseInt(object.fileOffset, 10)\n else if (typeof object.fileOffset === 'number') message.fileOffset = object.fileOffset\n else if (typeof object.fileOffset === 'object')\n message.fileOffset = new $util.LongBits(\n object.fileOffset.low >>> 0,\n object.fileOffset.high >>> 0,\n ).toNumber(true)\n if (object.filename != null)\n if ($util.Long)\n (message.filename = $util.Long.fromValue(object.filename)).unsigned = false\n else if (typeof object.filename === 'string')\n message.filename = parseInt(object.filename, 10)\n else if (typeof object.filename === 'number') message.filename = object.filename\n else if (typeof object.filename === 'object')\n message.filename = new $util.LongBits(\n object.filename.low >>> 0,\n object.filename.high >>> 0,\n ).toNumber()\n if (object.buildId != null)\n if ($util.Long) (message.buildId = $util.Long.fromValue(object.buildId)).unsigned = false\n else if (typeof object.buildId === 'string')\n message.buildId = parseInt(object.buildId, 10)\n else if (typeof object.buildId === 'number') message.buildId = object.buildId\n else if (typeof object.buildId === 'object')\n message.buildId = new $util.LongBits(\n object.buildId.low >>> 0,\n object.buildId.high >>> 0,\n ).toNumber()\n if (object.hasFunctions != null) message.hasFunctions = Boolean(object.hasFunctions)\n if (object.hasFilenames != null) message.hasFilenames = Boolean(object.hasFilenames)\n if (object.hasLineNumbers != null) message.hasLineNumbers = Boolean(object.hasLineNumbers)\n if (object.hasInlineFrames != null)\n message.hasInlineFrames = Boolean(object.hasInlineFrames)\n return message\n }\n\n /**\n * Creates a plain object from a Mapping message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Mapping\n * @static\n * @param {perftools.profiles.Mapping} message Mapping\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Mapping.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.id =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.id = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.memoryStart =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.memoryStart = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.memoryLimit =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.memoryLimit = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.fileOffset =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.fileOffset = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.filename =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.filename = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.buildId =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.buildId = options.longs === String ? '0' : 0\n object.hasFunctions = false\n object.hasFilenames = false\n object.hasLineNumbers = false\n object.hasInlineFrames = false\n }\n if (message.id != null && message.hasOwnProperty('id'))\n if (typeof message.id === 'number')\n object.id = options.longs === String ? String(message.id) : message.id\n else\n object.id =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.id)\n : options.longs === Number\n ? new $util.LongBits(message.id.low >>> 0, message.id.high >>> 0).toNumber(true)\n : message.id\n if (message.memoryStart != null && message.hasOwnProperty('memoryStart'))\n if (typeof message.memoryStart === 'number')\n object.memoryStart =\n options.longs === String ? String(message.memoryStart) : message.memoryStart\n else\n object.memoryStart =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.memoryStart)\n : options.longs === Number\n ? new $util.LongBits(\n message.memoryStart.low >>> 0,\n message.memoryStart.high >>> 0,\n ).toNumber(true)\n : message.memoryStart\n if (message.memoryLimit != null && message.hasOwnProperty('memoryLimit'))\n if (typeof message.memoryLimit === 'number')\n object.memoryLimit =\n options.longs === String ? String(message.memoryLimit) : message.memoryLimit\n else\n object.memoryLimit =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.memoryLimit)\n : options.longs === Number\n ? new $util.LongBits(\n message.memoryLimit.low >>> 0,\n message.memoryLimit.high >>> 0,\n ).toNumber(true)\n : message.memoryLimit\n if (message.fileOffset != null && message.hasOwnProperty('fileOffset'))\n if (typeof message.fileOffset === 'number')\n object.fileOffset =\n options.longs === String ? String(message.fileOffset) : message.fileOffset\n else\n object.fileOffset =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.fileOffset)\n : options.longs === Number\n ? new $util.LongBits(\n message.fileOffset.low >>> 0,\n message.fileOffset.high >>> 0,\n ).toNumber(true)\n : message.fileOffset\n if (message.filename != null && message.hasOwnProperty('filename'))\n if (typeof message.filename === 'number')\n object.filename = options.longs === String ? String(message.filename) : message.filename\n else\n object.filename =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.filename)\n : options.longs === Number\n ? new $util.LongBits(\n message.filename.low >>> 0,\n message.filename.high >>> 0,\n ).toNumber()\n : message.filename\n if (message.buildId != null && message.hasOwnProperty('buildId'))\n if (typeof message.buildId === 'number')\n object.buildId = options.longs === String ? String(message.buildId) : message.buildId\n else\n object.buildId =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.buildId)\n : options.longs === Number\n ? new $util.LongBits(\n message.buildId.low >>> 0,\n message.buildId.high >>> 0,\n ).toNumber()\n : message.buildId\n if (message.hasFunctions != null && message.hasOwnProperty('hasFunctions'))\n object.hasFunctions = message.hasFunctions\n if (message.hasFilenames != null && message.hasOwnProperty('hasFilenames'))\n object.hasFilenames = message.hasFilenames\n if (message.hasLineNumbers != null && message.hasOwnProperty('hasLineNumbers'))\n object.hasLineNumbers = message.hasLineNumbers\n if (message.hasInlineFrames != null && message.hasOwnProperty('hasInlineFrames'))\n object.hasInlineFrames = message.hasInlineFrames\n return object\n }\n\n /**\n * Converts this Mapping to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Mapping\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Mapping.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Mapping\n })()\n\n profiles.Location = (function() {\n /**\n * Properties of a Location.\n * @memberof perftools.profiles\n * @interface ILocation\n * @property {number|Long|null} [id] Location id\n * @property {number|Long|null} [mappingId] Location mappingId\n * @property {number|Long|null} [address] Location address\n * @property {Array.<perftools.profiles.ILine>|null} [line] Location line\n * @property {boolean|null} [isFolded] Location isFolded\n */\n\n /**\n * Constructs a new Location.\n * @memberof perftools.profiles\n * @classdesc Represents a Location.\n * @implements ILocation\n * @constructor\n * @param {perftools.profiles.ILocation=} [properties] Properties to set\n */\n function Location(properties) {\n this.line = []\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Location id.\n * @member {number|Long} id\n * @memberof perftools.profiles.Location\n * @instance\n */\n Location.prototype.id = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Location mappingId.\n * @member {number|Long} mappingId\n * @memberof perftools.profiles.Location\n * @instance\n */\n Location.prototype.mappingId = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Location address.\n * @member {number|Long} address\n * @memberof perftools.profiles.Location\n * @instance\n */\n Location.prototype.address = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Location line.\n * @member {Array.<perftools.profiles.ILine>} line\n * @memberof perftools.profiles.Location\n * @instance\n */\n Location.prototype.line = $util.emptyArray\n\n /**\n * Location isFolded.\n * @member {boolean} isFolded\n * @memberof perftools.profiles.Location\n * @instance\n */\n Location.prototype.isFolded = false\n\n /**\n * Creates a new Location instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Location\n * @static\n * @param {perftools.profiles.ILocation=} [properties] Properties to set\n * @returns {perftools.profiles.Location} Location instance\n */\n Location.create = function create(properties) {\n return new Location(properties)\n }\n\n /**\n * Encodes the specified Location message. Does not implicitly {@link perftools.profiles.Location.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Location\n * @static\n * @param {perftools.profiles.ILocation} message Location message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Location.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.id != null && message.hasOwnProperty('id'))\n writer.uint32(/* id 1, wireType 0 =*/ 8).uint64(message.id)\n if (message.mappingId != null && message.hasOwnProperty('mappingId'))\n writer.uint32(/* id 2, wireType 0 =*/ 16).uint64(message.mappingId)\n if (message.address != null && message.hasOwnProperty('address'))\n writer.uint32(/* id 3, wireType 0 =*/ 24).uint64(message.address)\n if (message.line != null && message.line.length)\n for (var i = 0; i < message.line.length; ++i)\n $root.perftools.profiles.Line.encode(\n message.line[i],\n writer.uint32(/* id 4, wireType 2 =*/ 34).fork(),\n ).ldelim()\n if (message.isFolded != null && message.hasOwnProperty('isFolded'))\n writer.uint32(/* id 5, wireType 0 =*/ 40).bool(message.isFolded)\n return writer\n }\n\n /**\n * Encodes the specified Location message, length delimited. Does not implicitly {@link perftools.profiles.Location.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Location\n * @static\n * @param {perftools.profiles.ILocation} message Location message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Location.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Location message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Location\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Location} Location\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Location.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Location()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n message.id = reader.uint64()\n break\n case 2:\n message.mappingId = reader.uint64()\n break\n case 3:\n message.address = reader.uint64()\n break\n case 4:\n if (!(message.line && message.line.length)) message.line = []\n message.line.push($root.perftools.profiles.Line.decode(reader, reader.uint32()))\n break\n case 5:\n message.isFolded = reader.bool()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Location message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Location\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Location} Location\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Location.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Location message.\n * @function verify\n * @memberof perftools.profiles.Location\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Location.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.id != null && message.hasOwnProperty('id'))\n if (\n !$util.isInteger(message.id) &&\n !(message.id && $util.isInteger(message.id.low) && $util.isInteger(message.id.high))\n )\n return 'id: integer|Long expected'\n if (message.mappingId != null && message.hasOwnProperty('mappingId'))\n if (\n !$util.isInteger(message.mappingId) &&\n !(\n message.mappingId &&\n $util.isInteger(message.mappingId.low) &&\n $util.isInteger(message.mappingId.high)\n )\n )\n return 'mappingId: integer|Long expected'\n if (message.address != null && message.hasOwnProperty('address'))\n if (\n !$util.isInteger(message.address) &&\n !(\n message.address &&\n $util.isInteger(message.address.low) &&\n $util.isInteger(message.address.high)\n )\n )\n return 'address: integer|Long expected'\n if (message.line != null && message.hasOwnProperty('line')) {\n if (!Array.isArray(message.line)) return 'line: array expected'\n for (var i = 0; i < message.line.length; ++i) {\n var error = $root.perftools.profiles.Line.verify(message.line[i])\n if (error) return 'line.' + error\n }\n }\n if (message.isFolded != null && message.hasOwnProperty('isFolded'))\n if (typeof message.isFolded !== 'boolean') return 'isFolded: boolean expected'\n return null\n }\n\n /**\n * Creates a Location message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Location\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Location} Location\n */\n Location.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Location) return object\n var message = new $root.perftools.profiles.Location()\n if (object.id != null)\n if ($util.Long) (message.id = $util.Long.fromValue(object.id)).unsigned = true\n else if (typeof object.id === 'string') message.id = parseInt(object.id, 10)\n else if (typeof object.id === 'number') message.id = object.id\n else if (typeof object.id === 'object')\n message.id = new $util.LongBits(object.id.low >>> 0, object.id.high >>> 0).toNumber(\n true,\n )\n if (object.mappingId != null)\n if ($util.Long)\n (message.mappingId = $util.Long.fromValue(object.mappingId)).unsigned = true\n else if (typeof object.mappingId === 'string')\n message.mappingId = parseInt(object.mappingId, 10)\n else if (typeof object.mappingId === 'number') message.mappingId = object.mappingId\n else if (typeof object.mappingId === 'object')\n message.mappingId = new $util.LongBits(\n object.mappingId.low >>> 0,\n object.mappingId.high >>> 0,\n ).toNumber(true)\n if (object.address != null)\n if ($util.Long) (message.address = $util.Long.fromValue(object.address)).unsigned = true\n else if (typeof object.address === 'string')\n message.address = parseInt(object.address, 10)\n else if (typeof object.address === 'number') message.address = object.address\n else if (typeof object.address === 'object')\n message.address = new $util.LongBits(\n object.address.low >>> 0,\n object.address.high >>> 0,\n ).toNumber(true)\n if (object.line) {\n if (!Array.isArray(object.line))\n throw TypeError('.perftools.profiles.Location.line: array expected')\n message.line = []\n for (var i = 0; i < object.line.length; ++i) {\n if (typeof object.line[i] !== 'object')\n throw TypeError('.perftools.profiles.Location.line: object expected')\n message.line[i] = $root.perftools.profiles.Line.fromObject(object.line[i])\n }\n }\n if (object.isFolded != null) message.isFolded = Boolean(object.isFolded)\n return message\n }\n\n /**\n * Creates a plain object from a Location message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Location\n * @static\n * @param {perftools.profiles.Location} message Location\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Location.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.arrays || options.defaults) object.line = []\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.id =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.id = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.mappingId =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.mappingId = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.address =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.address = options.longs === String ? '0' : 0\n object.isFolded = false\n }\n if (message.id != null && message.hasOwnProperty('id'))\n if (typeof message.id === 'number')\n object.id = options.longs === String ? String(message.id) : message.id\n else\n object.id =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.id)\n : options.longs === Number\n ? new $util.LongBits(message.id.low >>> 0, message.id.high >>> 0).toNumber(true)\n : message.id\n if (message.mappingId != null && message.hasOwnProperty('mappingId'))\n if (typeof message.mappingId === 'number')\n object.mappingId =\n options.longs === String ? String(message.mappingId) : message.mappingId\n else\n object.mappingId =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.mappingId)\n : options.longs === Number\n ? new $util.LongBits(\n message.mappingId.low >>> 0,\n message.mappingId.high >>> 0,\n ).toNumber(true)\n : message.mappingId\n if (message.address != null && message.hasOwnProperty('address'))\n if (typeof message.address === 'number')\n object.address = options.longs === String ? String(message.address) : message.address\n else\n object.address =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.address)\n : options.longs === Number\n ? new $util.LongBits(\n message.address.low >>> 0,\n message.address.high >>> 0,\n ).toNumber(true)\n : message.address\n if (message.line && message.line.length) {\n object.line = []\n for (var j = 0; j < message.line.length; ++j)\n object.line[j] = $root.perftools.profiles.Line.toObject(message.line[j], options)\n }\n if (message.isFolded != null && message.hasOwnProperty('isFolded'))\n object.isFolded = message.isFolded\n return object\n }\n\n /**\n * Converts this Location to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Location\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Location.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Location\n })()\n\n profiles.Line = (function() {\n /**\n * Properties of a Line.\n * @memberof perftools.profiles\n * @interface ILine\n * @property {number|Long|null} [functionId] Line functionId\n * @property {number|Long|null} [line] Line line\n */\n\n /**\n * Constructs a new Line.\n * @memberof perftools.profiles\n * @classdesc Represents a Line.\n * @implements ILine\n * @constructor\n * @param {perftools.profiles.ILine=} [properties] Properties to set\n */\n function Line(properties) {\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Line functionId.\n * @member {number|Long} functionId\n * @memberof perftools.profiles.Line\n * @instance\n */\n Line.prototype.functionId = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Line line.\n * @member {number|Long} line\n * @memberof perftools.profiles.Line\n * @instance\n */\n Line.prototype.line = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Creates a new Line instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Line\n * @static\n * @param {perftools.profiles.ILine=} [properties] Properties to set\n * @returns {perftools.profiles.Line} Line instance\n */\n Line.create = function create(properties) {\n return new Line(properties)\n }\n\n /**\n * Encodes the specified Line message. Does not implicitly {@link perftools.profiles.Line.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Line\n * @static\n * @param {perftools.profiles.ILine} message Line message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Line.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.functionId != null && message.hasOwnProperty('functionId'))\n writer.uint32(/* id 1, wireType 0 =*/ 8).uint64(message.functionId)\n if (message.line != null && message.hasOwnProperty('line'))\n writer.uint32(/* id 2, wireType 0 =*/ 16).int64(message.line)\n return writer\n }\n\n /**\n * Encodes the specified Line message, length delimited. Does not implicitly {@link perftools.profiles.Line.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Line\n * @static\n * @param {perftools.profiles.ILine} message Line message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Line.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Line message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Line\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Line} Line\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Line.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Line()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n message.functionId = reader.uint64()\n break\n case 2:\n message.line = reader.int64()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Line message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Line\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Line} Line\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Line.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Line message.\n * @function verify\n * @memberof perftools.profiles.Line\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Line.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.functionId != null && message.hasOwnProperty('functionId'))\n if (\n !$util.isInteger(message.functionId) &&\n !(\n message.functionId &&\n $util.isInteger(message.functionId.low) &&\n $util.isInteger(message.functionId.high)\n )\n )\n return 'functionId: integer|Long expected'\n if (message.line != null && message.hasOwnProperty('line'))\n if (\n !$util.isInteger(message.line) &&\n !(\n message.line &&\n $util.isInteger(message.line.low) &&\n $util.isInteger(message.line.high)\n )\n )\n return 'line: integer|Long expected'\n return null\n }\n\n /**\n * Creates a Line message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Line\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Line} Line\n */\n Line.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Line) return object\n var message = new $root.perftools.profiles.Line()\n if (object.functionId != null)\n if ($util.Long)\n (message.functionId = $util.Long.fromValue(object.functionId)).unsigned = true\n else if (typeof object.functionId === 'string')\n message.functionId = parseInt(object.functionId, 10)\n else if (typeof object.functionId === 'number') message.functionId = object.functionId\n else if (typeof object.functionId === 'object')\n message.functionId = new $util.LongBits(\n object.functionId.low >>> 0,\n object.functionId.high >>> 0,\n ).toNumber(true)\n if (object.line != null)\n if ($util.Long) (message.line = $util.Long.fromValue(object.line)).unsigned = false\n else if (typeof object.line === 'string') message.line = parseInt(object.line, 10)\n else if (typeof object.line === 'number') message.line = object.line\n else if (typeof object.line === 'object')\n message.line = new $util.LongBits(\n object.line.low >>> 0,\n object.line.high >>> 0,\n ).toNumber()\n return message\n }\n\n /**\n * Creates a plain object from a Line message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Line\n * @static\n * @param {perftools.profiles.Line} message Line\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Line.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.functionId =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.functionId = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.line =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.line = options.longs === String ? '0' : 0\n }\n if (message.functionId != null && message.hasOwnProperty('functionId'))\n if (typeof message.functionId === 'number')\n object.functionId =\n options.longs === String ? String(message.functionId) : message.functionId\n else\n object.functionId =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.functionId)\n : options.longs === Number\n ? new $util.LongBits(\n message.functionId.low >>> 0,\n message.functionId.high >>> 0,\n ).toNumber(true)\n : message.functionId\n if (message.line != null && message.hasOwnProperty('line'))\n if (typeof message.line === 'number')\n object.line = options.longs === String ? String(message.line) : message.line\n else\n object.line =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.line)\n : options.longs === Number\n ? new $util.LongBits(message.line.low >>> 0, message.line.high >>> 0).toNumber()\n : message.line\n return object\n }\n\n /**\n * Converts this Line to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Line\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Line.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Line\n })()\n\n profiles.Function = (function() {\n /**\n * Properties of a Function.\n * @memberof perftools.profiles\n * @interface IFunction\n * @property {number|Long|null} [id] Function id\n * @property {number|Long|null} [name] Function name\n * @property {number|Long|null} [systemName] Function systemName\n * @property {number|Long|null} [filename] Function filename\n * @property {number|Long|null} [startLine] Function startLine\n */\n\n /**\n * Constructs a new Function.\n * @memberof perftools.profiles\n * @classdesc Represents a Function.\n * @implements IFunction\n * @constructor\n * @param {perftools.profiles.IFunction=} [properties] Properties to set\n */\n function Function(properties) {\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n if (properties[keys[i]] != null) this[keys[i]] = properties[keys[i]]\n }\n\n /**\n * Function id.\n * @member {number|Long} id\n * @memberof perftools.profiles.Function\n * @instance\n */\n Function.prototype.id = $util.Long ? $util.Long.fromBits(0, 0, true) : 0\n\n /**\n * Function name.\n * @member {number|Long} name\n * @memberof perftools.profiles.Function\n * @instance\n */\n Function.prototype.name = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Function systemName.\n * @member {number|Long} systemName\n * @memberof perftools.profiles.Function\n * @instance\n */\n Function.prototype.systemName = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Function filename.\n * @member {number|Long} filename\n * @memberof perftools.profiles.Function\n * @instance\n */\n Function.prototype.filename = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Function startLine.\n * @member {number|Long} startLine\n * @memberof perftools.profiles.Function\n * @instance\n */\n Function.prototype.startLine = $util.Long ? $util.Long.fromBits(0, 0, false) : 0\n\n /**\n * Creates a new Function instance using the specified properties.\n * @function create\n * @memberof perftools.profiles.Function\n * @static\n * @param {perftools.profiles.IFunction=} [properties] Properties to set\n * @returns {perftools.profiles.Function} Function instance\n */\n Function.create = function create(properties) {\n return new Function(properties)\n }\n\n /**\n * Encodes the specified Function message. Does not implicitly {@link perftools.profiles.Function.verify|verify} messages.\n * @function encode\n * @memberof perftools.profiles.Function\n * @static\n * @param {perftools.profiles.IFunction} message Function message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Function.encode = function encode(message, writer) {\n if (!writer) writer = $Writer.create()\n if (message.id != null && message.hasOwnProperty('id'))\n writer.uint32(/* id 1, wireType 0 =*/ 8).uint64(message.id)\n if (message.name != null && message.hasOwnProperty('name'))\n writer.uint32(/* id 2, wireType 0 =*/ 16).int64(message.name)\n if (message.systemName != null && message.hasOwnProperty('systemName'))\n writer.uint32(/* id 3, wireType 0 =*/ 24).int64(message.systemName)\n if (message.filename != null && message.hasOwnProperty('filename'))\n writer.uint32(/* id 4, wireType 0 =*/ 32).int64(message.filename)\n if (message.startLine != null && message.hasOwnProperty('startLine'))\n writer.uint32(/* id 5, wireType 0 =*/ 40).int64(message.startLine)\n return writer\n }\n\n /**\n * Encodes the specified Function message, length delimited. Does not implicitly {@link perftools.profiles.Function.verify|verify} messages.\n * @function encodeDelimited\n * @memberof perftools.profiles.Function\n * @static\n * @param {perftools.profiles.IFunction} message Function message or plain object to encode\n * @param {$protobuf.Writer} [writer] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n Function.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer).ldelim()\n }\n\n /**\n * Decodes a Function message from the specified reader or buffer.\n * @function decode\n * @memberof perftools.profiles.Function\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Message length if known beforehand\n * @returns {perftools.profiles.Function} Function\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Function.decode = function decode(reader, length) {\n if (!(reader instanceof $Reader)) reader = $Reader.create(reader)\n var end = length === undefined ? reader.len : reader.pos + length,\n message = new $root.perftools.profiles.Function()\n while (reader.pos < end) {\n var tag = reader.uint32()\n switch (tag >>> 3) {\n case 1:\n message.id = reader.uint64()\n break\n case 2:\n message.name = reader.int64()\n break\n case 3:\n message.systemName = reader.int64()\n break\n case 4:\n message.filename = reader.int64()\n break\n case 5:\n message.startLine = reader.int64()\n break\n default:\n reader.skipType(tag & 7)\n break\n }\n }\n return message\n }\n\n /**\n * Decodes a Function message from the specified reader or buffer, length delimited.\n * @function decodeDelimited\n * @memberof perftools.profiles.Function\n * @static\n * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {perftools.profiles.Function} Function\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n Function.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof $Reader)) reader = new $Reader(reader)\n return this.decode(reader, reader.uint32())\n }\n\n /**\n * Verifies a Function message.\n * @function verify\n * @memberof perftools.profiles.Function\n * @static\n * @param {Object.<string,*>} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\n Function.verify = function verify(message) {\n if (typeof message !== 'object' || message === null) return 'object expected'\n if (message.id != null && message.hasOwnProperty('id'))\n if (\n !$util.isInteger(message.id) &&\n !(message.id && $util.isInteger(message.id.low) && $util.isInteger(message.id.high))\n )\n return 'id: integer|Long expected'\n if (message.name != null && message.hasOwnProperty('name'))\n if (\n !$util.isInteger(message.name) &&\n !(\n message.name &&\n $util.isInteger(message.name.low) &&\n $util.isInteger(message.name.high)\n )\n )\n return 'name: integer|Long expected'\n if (message.systemName != null && message.hasOwnProperty('systemName'))\n if (\n !$util.isInteger(message.systemName) &&\n !(\n message.systemName &&\n $util.isInteger(message.systemName.low) &&\n $util.isInteger(message.systemName.high)\n )\n )\n return 'systemName: integer|Long expected'\n if (message.filename != null && message.hasOwnProperty('filename'))\n if (\n !$util.isInteger(message.filename) &&\n !(\n message.filename &&\n $util.isInteger(message.filename.low) &&\n $util.isInteger(message.filename.high)\n )\n )\n return 'filename: integer|Long expected'\n if (message.startLine != null && message.hasOwnProperty('startLine'))\n if (\n !$util.isInteger(message.startLine) &&\n !(\n message.startLine &&\n $util.isInteger(message.startLine.low) &&\n $util.isInteger(message.startLine.high)\n )\n )\n return 'startLine: integer|Long expected'\n return null\n }\n\n /**\n * Creates a Function message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof perftools.profiles.Function\n * @static\n * @param {Object.<string,*>} object Plain object\n * @returns {perftools.profiles.Function} Function\n */\n Function.fromObject = function fromObject(object) {\n if (object instanceof $root.perftools.profiles.Function) return object\n var message = new $root.perftools.profiles.Function()\n if (object.id != null)\n if ($util.Long) (message.id = $util.Long.fromValue(object.id)).unsigned = true\n else if (typeof object.id === 'string') message.id = parseInt(object.id, 10)\n else if (typeof object.id === 'number') message.id = object.id\n else if (typeof object.id === 'object')\n message.id = new $util.LongBits(object.id.low >>> 0, object.id.high >>> 0).toNumber(\n true,\n )\n if (object.name != null)\n if ($util.Long) (message.name = $util.Long.fromValue(object.name)).unsigned = false\n else if (typeof object.name === 'string') message.name = parseInt(object.name, 10)\n else if (typeof object.name === 'number') message.name = object.name\n else if (typeof object.name === 'object')\n message.name = new $util.LongBits(\n object.name.low >>> 0,\n object.name.high >>> 0,\n ).toNumber()\n if (object.systemName != null)\n if ($util.Long)\n (message.systemName = $util.Long.fromValue(object.systemName)).unsigned = false\n else if (typeof object.systemName === 'string')\n message.systemName = parseInt(object.systemName, 10)\n else if (typeof object.systemName === 'number') message.systemName = object.systemName\n else if (typeof object.systemName === 'object')\n message.systemName = new $util.LongBits(\n object.systemName.low >>> 0,\n object.systemName.high >>> 0,\n ).toNumber()\n if (object.filename != null)\n if ($util.Long)\n (message.filename = $util.Long.fromValue(object.filename)).unsigned = false\n else if (typeof object.filename === 'string')\n message.filename = parseInt(object.filename, 10)\n else if (typeof object.filename === 'number') message.filename = object.filename\n else if (typeof object.filename === 'object')\n message.filename = new $util.LongBits(\n object.filename.low >>> 0,\n object.filename.high >>> 0,\n ).toNumber()\n if (object.startLine != null)\n if ($util.Long)\n (message.startLine = $util.Long.fromValue(object.startLine)).unsigned = false\n else if (typeof object.startLine === 'string')\n message.startLine = parseInt(object.startLine, 10)\n else if (typeof object.startLine === 'number') message.startLine = object.startLine\n else if (typeof object.startLine === 'object')\n message.startLine = new $util.LongBits(\n object.startLine.low >>> 0,\n object.startLine.high >>> 0,\n ).toNumber()\n return message\n }\n\n /**\n * Creates a plain object from a Function message. Also converts values to other types if specified.\n * @function toObject\n * @memberof perftools.profiles.Function\n * @static\n * @param {perftools.profiles.Function} message Function\n * @param {$protobuf.IConversionOptions} [options] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n Function.toObject = function toObject(message, options) {\n if (!options) options = {}\n var object = {}\n if (options.defaults) {\n if ($util.Long) {\n var long = new $util.Long(0, 0, true)\n object.id =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.id = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.name =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.name = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.systemName =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.systemName = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.filename =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.filename = options.longs === String ? '0' : 0\n if ($util.Long) {\n var long = new $util.Long(0, 0, false)\n object.startLine =\n options.longs === String\n ? long.toString()\n : options.longs === Number\n ? long.toNumber()\n : long\n } else object.startLine = options.longs === String ? '0' : 0\n }\n if (message.id != null && message.hasOwnProperty('id'))\n if (typeof message.id === 'number')\n object.id = options.longs === String ? String(message.id) : message.id\n else\n object.id =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.id)\n : options.longs === Number\n ? new $util.LongBits(message.id.low >>> 0, message.id.high >>> 0).toNumber(true)\n : message.id\n if (message.name != null && message.hasOwnProperty('name'))\n if (typeof message.name === 'number')\n object.name = options.longs === String ? String(message.name) : message.name\n else\n object.name =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.name)\n : options.longs === Number\n ? new $util.LongBits(message.name.low >>> 0, message.name.high >>> 0).toNumber()\n : message.name\n if (message.systemName != null && message.hasOwnProperty('systemName'))\n if (typeof message.systemName === 'number')\n object.systemName =\n options.longs === String ? String(message.systemName) : message.systemName\n else\n object.systemName =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.systemName)\n : options.longs === Number\n ? new $util.LongBits(\n message.systemName.low >>> 0,\n message.systemName.high >>> 0,\n ).toNumber()\n : message.systemName\n if (message.filename != null && message.hasOwnProperty('filename'))\n if (typeof message.filename === 'number')\n object.filename = options.longs === String ? String(message.filename) : message.filename\n else\n object.filename =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.filename)\n : options.longs === Number\n ? new $util.LongBits(\n message.filename.low >>> 0,\n message.filename.high >>> 0,\n ).toNumber()\n : message.filename\n if (message.startLine != null && message.hasOwnProperty('startLine'))\n if (typeof message.startLine === 'number')\n object.startLine =\n options.longs === String ? String(message.startLine) : message.startLine\n else\n object.startLine =\n options.longs === String\n ? $util.Long.prototype.toString.call(message.startLine)\n : options.longs === Number\n ? new $util.LongBits(\n message.startLine.low >>> 0,\n message.startLine.high >>> 0,\n ).toNumber()\n : message.startLine\n return object\n }\n\n /**\n * Converts this Function to JSON.\n * @function toJSON\n * @memberof perftools.profiles.Function\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n Function.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions)\n }\n\n return Function\n })()\n\n return profiles\n })()\n\n return perftools\n})()\n\nmodule.exports = $root\n","import {perftools} from './profile.proto.js'\nimport {FrameInfo, StackListProfileBuilder, Profile} from '../lib/profile'\nimport {lastOf} from '../lib/utils'\nimport {TimeFormatter, ByteFormatter} from '../lib/value-formatters'\n\ninterface SampleType {\n type: string\n unit: string\n}\n\nexport function importAsPprofProfile(rawProfile: ArrayBuffer): Profile | null {\n if (rawProfile.byteLength === 0) return null\n\n let protoProfile: perftools.profiles.Profile\n try {\n protoProfile = perftools.profiles.Profile.decode(new Uint8Array(rawProfile))\n } catch (e) {\n return null\n }\n\n function i32(n: number | Long): number {\n return typeof n === 'number' ? n : (n as Long).low\n }\n\n function stringVal(key: number | Long): string | null {\n return protoProfile.stringTable[i32(key)] || null\n }\n\n const frameInfoByFunctionID = new Map<number, FrameInfo>()\n\n function frameInfoForFunction(f: perftools.profiles.IFunction): FrameInfo | null {\n const {name, filename, startLine} = f\n\n const nameString = (name != null && stringVal(name)) || '(unknown)'\n const fileNameString = filename != null ? stringVal(filename) : null\n const line = startLine != null ? +startLine : null\n\n const key = `${nameString}:${fileNameString}:${line}`\n\n const frameInfo: FrameInfo = {\n key,\n name: nameString,\n }\n\n if (fileNameString != null) {\n frameInfo.file = fileNameString\n }\n\n if (line != null) {\n frameInfo.line = line\n }\n\n return frameInfo\n }\n\n for (let f of protoProfile.function) {\n if (f.id) {\n const frameInfo = frameInfoForFunction(f)\n if (frameInfo != null) {\n frameInfoByFunctionID.set(i32(f.id), frameInfo)\n }\n }\n }\n\n function frameInfoForLocation(location: perftools.profiles.ILocation): FrameInfo | null {\n const {line} = location\n if (line == null) return null\n\n // From a comment on profile.proto:\n //\n // Multiple line indicates this location has inlined functions,\n // where the last entry represents the caller into which the\n // preceding entries were inlined.\n //\n // E.g., if memcpy() is inlined into printf:\n // line[0].function_name == \"memcpy\"\n // line[1].function_name == \"printf\"\n //\n // Let's just take the last line then\n const lastLine = lastOf(line)\n if (lastLine == null) return null\n\n if (lastLine.functionId) {\n return frameInfoByFunctionID.get(i32(lastLine.functionId)) || null\n } else {\n return null\n }\n }\n\n const frameByLocationID = new Map<number, FrameInfo>()\n\n for (let l of protoProfile.location) {\n if (l.id != null) {\n const frameInfo = frameInfoForLocation(l)\n if (frameInfo) {\n frameByLocationID.set(i32(l.id), frameInfo)\n }\n }\n }\n\n const sampleTypes: SampleType[] = protoProfile.sampleType.map(type => ({\n type: (type.type && stringVal(type.type)) || 'samples',\n unit: (type.unit && stringVal(type.unit)) || 'count',\n }))\n\n const sampleTypeIndex = protoProfile.defaultSampleType\n ? +protoProfile.defaultSampleType\n : sampleTypes.length - 1\n const sampleType = sampleTypes[sampleTypeIndex]\n\n const profileBuilder = new StackListProfileBuilder()\n\n switch (sampleType.unit) {\n case 'nanoseconds':\n case 'microseconds':\n case 'milliseconds':\n case 'seconds':\n profileBuilder.setValueFormatter(new TimeFormatter(sampleType.unit))\n break\n\n case 'bytes':\n profileBuilder.setValueFormatter(new ByteFormatter())\n break\n }\n\n for (let s of protoProfile.sample) {\n const stack = s.locationId ? s.locationId.map(l => frameByLocationID.get(i32(l))) : []\n stack.reverse()\n const value = s.value![sampleTypeIndex]\n profileBuilder.appendSampleWithWeight(stack.filter(f => f != null) as FrameInfo[], +value)\n }\n\n return profileBuilder.build()\n}\n","import {Profile, FrameInfo, StackListProfileBuilder} from '../lib/profile'\nimport {getOrInsert} from '../lib/utils'\nimport {ByteFormatter} from '../lib/value-formatters'\n\n/**\n * The V8 Heap Allocation profile is a way to represent heap allocation for each\n * javascript function. The format is a simple tree where the weight of each node\n * represent the memory allocated by the function and all its callee.\n * You can find more information on how to get a profile there :\n * https://developers.google.com/web/tools/chrome-devtools/memory-problems/#allocation-profile\n * You need to scroll down to \"Investigate memory allocation by function\"\n *\n * Note that Node.JS can retrieve this kind of profile via the Inspector protocol.\n */\n\ninterface HeapProfileCallFrame {\n columnNumber: number\n functionName: string\n lineNumber: number\n scriptId: string\n url: string\n}\n\ninterface HeapProfileNode {\n callFrame: HeapProfileCallFrame\n selfSize: number\n children: HeapProfileNode[]\n id: number\n parent?: number\n totalSize: number\n}\n\ninterface HeapProfile {\n head: HeapProfileNode\n}\n\nconst callFrameToFrameInfo = new Map<HeapProfileCallFrame, FrameInfo>()\nfunction frameInfoForCallFrame(callFrame: HeapProfileCallFrame) {\n return getOrInsert(callFrameToFrameInfo, callFrame, callFrame => {\n const name = callFrame.functionName || '(anonymous)'\n const file = callFrame.url\n const line = callFrame.lineNumber\n const col = callFrame.columnNumber\n return {\n key: `${name}:${file}:${line}:${col}`,\n name,\n file,\n line,\n col,\n }\n })\n}\n\nexport function importFromChromeHeapProfile(chromeProfile: HeapProfile): Profile {\n const nodeById = new Map<number, HeapProfileNode>()\n let currentId = 0\n const computeId = (node: HeapProfileNode, parent?: HeapProfileNode) => {\n node.id = currentId++\n nodeById.set(node.id, node)\n if (parent) {\n node.parent = parent.id\n }\n\n node.children.forEach(children => computeId(children, node))\n }\n computeId(chromeProfile.head)\n\n // Compute the total size\n const computeTotalSize = (node: HeapProfileNode): number => {\n if (node.children.length === 0) return node.selfSize || 0\n const totalChild = node.children.reduce((total: number, children) => {\n total += computeTotalSize(children)\n return total\n }, node.selfSize)\n node.totalSize = totalChild\n return totalChild\n }\n const total = computeTotalSize(chromeProfile.head)\n\n // Compute all stacks by taking each last node and going upward\n const stacks: HeapProfileNode[][] = []\n for (let currentNode of nodeById.values()) {\n let stack: HeapProfileNode[] = []\n stack.push(currentNode)\n // While we found a parent\n while (true) {\n if (currentNode.parent === undefined) break\n const parent = nodeById.get(currentNode.parent)\n if (parent === undefined) break\n // Push the parent at the beginning of the stack\n stack.unshift(parent)\n currentNode = parent\n }\n stacks.push(stack)\n }\n\n const profile = new StackListProfileBuilder(total)\n\n for (let stack of stacks) {\n const lastFrame = stack[stack.length - 1]\n profile.appendSampleWithWeight(\n stack.map(frame => frameInfoForCallFrame(frame.callFrame)),\n lastFrame.selfSize,\n )\n }\n\n profile.setValueFormatter(new ByteFormatter())\n return profile.build()\n}\n","import {sortBy, zeroPad, getOrInsert, lastOf} from '../lib/utils'\nimport {ProfileGroup, CallTreeProfileBuilder, FrameInfo, Profile} from '../lib/profile'\nimport {TimeFormatter} from '../lib/value-formatters'\n\n// This file concerns import from the \"Trace Event Format\", authored by Google\n// and used for Google's own chrome://trace.\n//\n// The file format is extremely general, and we only support the parts of it\n// that logically map onto speedscope's visualization capabilities.\n// Specifically, we only support the \"B\", \"E\", and \"X\" event types. Everything\n// else is ignored. We do, however, support import of profiles that are\n// multi-process/multi-threaded. Each process is split into a separate profile.\n//\n// Note that Chrome Developer Tools uses this format as well, but all the\n// relevant data used in those profiles is stored in events with the name\n// \"CpuProfile\", \"Profile\", or \"ProfileChunk\". If we detect those, we prioritize\n// importing the profile as a Chrome Developer Tools profile. Otherwise,\n// we try to import it as a \"Trace Event Format\" file.\n//\n// Spec: https://docs.google.com/document/d/1CvAClvFfyA5R-PhYUmn5OOQtYMH4h6I0nSsKchNAySU/preview\n\ninterface TraceEvent {\n // The process ID for the process that output this event.\n pid: number\n\n // The thread ID for the thread that output this event.\n tid: number\n\n // The event type. This is a single character which changes depending on the type of event being output. The valid values are listed in the table below. We will discuss each phase type below.\n ph: string\n\n // The tracing clock timestamp of the event. The timestamps are provided at microsecond granularity.\n ts: number\n\n // The thread clock timestamp of the event. The timestamps are provided at microsecond granularity.\n tts?: number\n\n // The name of the event, as displayed in Trace Viewer\n name?: string\n\n // The event categories. This is a comma separated list of categories for the event. The categories can be used to hide events in the Trace Viewer UI.\n cat?: string\n\n // Any arguments provided for the event. Some of the event types have required argument fields, otherwise, you can put any information you wish in here. The arguments are displayed in Trace Viewer when you view an event in the analysis section.\n args: any\n\n // A fixed color name to associate with the event. If provided, cname must be one of the names listed in trace-viewer's base color scheme's reserved color names list\n cname?: string\n}\n\ninterface BTraceEvent extends TraceEvent {\n ph: 'B'\n}\n\ninterface ETraceEvent extends TraceEvent {\n ph: 'E'\n}\n\ninterface XTraceEvent extends TraceEvent {\n ph: 'X'\n dur?: number\n tdur?: number\n}\n\n// The trace format supports a number of event types that we ignore.\ntype ImportableTraceEvent = BTraceEvent | ETraceEvent | XTraceEvent\n\nfunction pidTidKey(pid: number, tid: number): string {\n // We zero-pad the PID and TID to make sorting them by pid/tid pair later easier.\n return `${zeroPad('' + pid, 10)}:${zeroPad('' + tid, 10)}`\n}\n\nfunction partitionByPidTid(events: ImportableTraceEvent[]): Map<string, ImportableTraceEvent[]> {\n const map = new Map<string, ImportableTraceEvent[]>()\n\n for (let ev of events) {\n const list = getOrInsert(map, pidTidKey(ev.pid, ev.tid), () => [])\n list.push(ev)\n }\n\n return map\n}\n\nfunction selectQueueToTakeFromNext(\n bEventQueue: BTraceEvent[],\n eEventQueue: ETraceEvent[],\n): 'B' | 'E' {\n if (bEventQueue.length === 0 && eEventQueue.length === 0) {\n throw new Error('This method should not be given both queues empty')\n }\n if (eEventQueue.length === 0) return 'B'\n if (bEventQueue.length === 0) return 'E'\n\n const bFront = bEventQueue[0]\n const eFront = eEventQueue[0]\n\n const bts = bFront.ts\n const ets = eFront.ts\n\n if (bts < ets) return 'B'\n if (ets < bts) return 'E'\n\n // If we got here, the 'B' event queue and the 'E' event queue have events at\n // the front with equal timestamps.\n\n // If the front of the 'E' queue matches the front of the 'B' queue by name,\n // then it means we have a zero duration event. Process the 'B' queue first\n // to ensure it opens before we try to close it.\n //\n // Otherwise, process the 'E' queue first.\n return bFront.name === eFront.name ? 'B' : 'E'\n}\n\nfunction convertToEventQueues(events: ImportableTraceEvent[]): [BTraceEvent[], ETraceEvent[]] {\n const beginEvents: BTraceEvent[] = []\n const endEvents: ETraceEvent[] = []\n\n // Rebase all of the timestamps on the lowest timestamp\n if (events.length > 0) {\n let firstTs = Number.MAX_SAFE_INTEGER\n for (let ev of events) {\n firstTs = Math.min(firstTs, ev.ts)\n }\n for (let ev of events) {\n ev.ts -= firstTs\n }\n }\n\n // Next, combine B, E, and X events into two timestamp ordered queues.\n const xEvents: XTraceEvent[] = []\n for (let ev of events) {\n switch (ev.ph) {\n case 'B': {\n beginEvents.push(ev)\n break\n }\n\n case 'E': {\n endEvents.push(ev)\n break\n }\n\n case 'X': {\n xEvents.push(ev)\n break\n }\n\n default: {\n const _exhaustiveCheck: never = ev\n return _exhaustiveCheck\n }\n }\n }\n\n function dur(x: XTraceEvent): number {\n return x.dur ?? x.tdur ?? 0\n }\n\n xEvents.sort((a, b) => {\n if (a.ts < b.ts) return -1\n if (a.ts > b.ts) return 1\n\n // Super weird special case: if we have two 'X' events with the same 'ts'\n // but different 'dur' the only valid interpretation is to put the one with\n // the longer 'dur' first, because you can't nest longer things in shorter\n // things.\n const aDur = dur(a)\n const bDur = dur(b)\n if (aDur > bDur) return -1\n if (aDur < bDur) return 1\n\n // Otherwise, retain the original order by relying upon a stable sort here.\n return 0\n })\n\n for (let x of xEvents) {\n const xDur = dur(x)\n beginEvents.push({...x, ph: 'B'} as BTraceEvent)\n endEvents.push({...x, ph: 'E', ts: x.ts + xDur} as ETraceEvent)\n }\n\n function compareTimestamps(a: TraceEvent, b: TraceEvent) {\n if (a.ts < b.ts) return -1\n if (a.ts > b.ts) return 1\n\n // Important: if the timestamps are the same, return zero. We're going to\n // rely upon a stable sort here.\n return 0\n }\n\n beginEvents.sort(compareTimestamps)\n endEvents.sort(compareTimestamps)\n\n return [beginEvents, endEvents]\n}\n\nfunction filterIgnoredEventTypes(events: TraceEvent[]): ImportableTraceEvent[] {\n const ret: ImportableTraceEvent[] = []\n for (let ev of events) {\n switch (ev.ph) {\n case 'B':\n case 'E':\n case 'X':\n ret.push(ev as ImportableTraceEvent)\n }\n }\n return ret\n}\n\nfunction getProcessNamesByPid(events: TraceEvent[]): Map<number, string> {\n const processNamesByPid = new Map<number, string>()\n for (let ev of events) {\n if (ev.ph === 'M' && ev.name === 'process_name' && ev.args && ev.args.name) {\n processNamesByPid.set(ev.pid, ev.args.name)\n }\n }\n return processNamesByPid\n}\n\nfunction getThreadNamesByPidTid(events: TraceEvent[]): Map<string, string> {\n const threadNameByPidTid = new Map<string, string>()\n\n for (let ev of events) {\n if (ev.ph === 'M' && ev.name === 'thread_name' && ev.args && ev.args.name) {\n threadNameByPidTid.set(pidTidKey(ev.pid, ev.tid), ev.args.name)\n }\n }\n return threadNameByPidTid\n}\n\nfunction keyForEvent(event: TraceEvent): string {\n let name = `${event.name || '(unnamed)'}`\n if (event.args) {\n name += ` ${JSON.stringify(event.args)}`\n }\n return name\n}\n\nfunction frameInfoForEvent(event: TraceEvent): FrameInfo {\n const key = keyForEvent(event)\n return {\n name: key,\n key: key,\n }\n}\n\nfunction eventListToProfileGroup(events: TraceEvent[]): ProfileGroup {\n const importableEvents = filterIgnoredEventTypes(events)\n const partitioned = partitionByPidTid(importableEvents)\n\n const processNamesByPid = getProcessNamesByPid(events)\n const threadNamesByPidTid = getThreadNamesByPidTid(events)\n\n const profilePairs: [string, Profile][] = []\n\n partitioned.forEach(eventsForThread => {\n if (eventsForThread.length === 0) return\n\n const {pid, tid} = eventsForThread[0]\n\n const profile = new CallTreeProfileBuilder()\n profile.setValueFormatter(new TimeFormatter('microseconds'))\n\n const processName = processNamesByPid.get(pid)\n const threadName = threadNamesByPidTid.get(pidTidKey(pid, tid))\n\n if (processName != null && threadName != null) {\n profile.setName(`${processName} (pid ${pid}), ${threadName} (tid ${tid})`)\n } else if (processName != null) {\n profile.setName(`${processName} (pid ${pid}, tid ${tid})`)\n } else if (threadName != null) {\n profile.setName(`${threadName} (pid ${pid}, tid ${tid})`)\n } else {\n profile.setName(`pid ${pid}, tid ${tid}`)\n }\n\n // The trace event format is hard to deal with because it specifically\n // allows events to be recorded out of order, *but* event ordering is still\n // important for events with the same timestamp. Because of this, rather\n // than thinking about the entire event stream as a single queue of events,\n // we're going to first construct two time-ordered lists of events:\n //\n // 1. ts ordered queue of 'B' events\n // 2. ts ordered queue of 'E' events\n //\n // We deal with 'X' events by converting them to one entry in the 'B' event\n // queue and one entry in the 'E' event queue.\n //\n // The high level goal is to deal with 'B' events in 'ts' order, breaking\n // ties by the order the events occurred in the file, and deal with 'E'\n // events in 'ts' order, breaking ties in whatever order causes the 'E'\n // events to match whatever is on the top of the stack.\n const [bEventQueue, eEventQueue] = convertToEventQueues(eventsForThread)\n\n const frameStack: BTraceEvent[] = []\n const enterFrame = (b: BTraceEvent) => {\n frameStack.push(b)\n profile.enterFrame(frameInfoForEvent(b), b.ts)\n }\n\n const tryToLeaveFrame = (e: ETraceEvent) => {\n const b = lastOf(frameStack)\n\n if (b == null) {\n console.warn(\n `Tried to end frame \"${\n frameInfoForEvent(e).key\n }\", but the stack was empty. Doing nothing instead.`,\n )\n return\n }\n\n const eFrameInfo = frameInfoForEvent(e)\n const bFrameInfo = frameInfoForEvent(b)\n\n if (e.name !== b.name) {\n console.warn(\n `ts=${e.ts}: Tried to end \"${eFrameInfo.key}\" when \"${bFrameInfo.key}\" was on the top of the stack. Doing nothing instead.`,\n )\n return\n }\n\n if (eFrameInfo.key !== bFrameInfo.key) {\n console.warn(\n `ts=${e.ts}: Tried to end \"${eFrameInfo.key}\" when \"${bFrameInfo.key}\" was on the top of the stack. Ending ${bFrameInfo.key} instead.`,\n )\n }\n\n frameStack.pop()\n profile.leaveFrame(bFrameInfo, e.ts)\n }\n\n while (bEventQueue.length > 0 || eEventQueue.length > 0) {\n const queueName = selectQueueToTakeFromNext(bEventQueue, eEventQueue)\n switch (queueName) {\n case 'B': {\n enterFrame(bEventQueue.shift()!)\n break\n }\n case 'E': {\n // Before we take the first event in the 'E' queue, let's first see if\n // there are any e events that exactly match the top of the stack.\n // We'll prioritize first by key, then by name if we can't find a key\n // match.\n const stackTop = lastOf(frameStack)\n if (stackTop != null) {\n const bFrameInfo = frameInfoForEvent(stackTop)\n\n let swapped: boolean = false\n\n for (let i = 1; i < eEventQueue.length; i++) {\n const eEvent = eEventQueue[i]\n if (eEvent.ts > eEventQueue[0].ts) {\n // Only consider 'E' events with the same ts as the front of the queue.\n break\n }\n\n const eFrameInfo = frameInfoForEvent(eEvent)\n if (bFrameInfo.key === eFrameInfo.key) {\n // We have a match! Process this one first.\n const temp = eEventQueue[0]\n eEventQueue[0] = eEventQueue[i]\n eEventQueue[i] = temp\n swapped = true\n break\n }\n }\n\n if (!swapped) {\n // There was no key match, let's see if we can find a name match\n for (let i = 1; i < eEventQueue.length; i++) {\n const eEvent = eEventQueue[i]\n if (eEvent.ts > eEventQueue[0].ts) {\n // Only consider 'E' events with the same ts as the front of the queue.\n break\n }\n\n if (eEvent.name === stackTop.name) {\n // We have a match! Process this one first.\n const temp = eEventQueue[0]\n eEventQueue[0] = eEventQueue[i]\n eEventQueue[i] = temp\n swapped = true\n break\n }\n }\n }\n\n // If swapped is still false at this point, it means we're about to\n // pop a stack frame that doesn't even match by name. Bummer.\n }\n\n const e = eEventQueue.shift()!\n\n tryToLeaveFrame(e)\n break\n }\n\n default:\n const _exhaustiveCheck: never = queueName\n return _exhaustiveCheck\n }\n }\n\n for (let i = frameStack.length - 1; i >= 0; i--) {\n const frame = frameInfoForEvent(frameStack[i])\n console.warn(`Frame \"${frame.key}\" was still open at end of profile. Closing automatically.`)\n profile.leaveFrame(frame, profile.getTotalWeight())\n }\n\n profilePairs.push([pidTidKey(pid, tid), profile.build()])\n })\n\n // For now, we just sort processes by pid & tid.\n // TODO: The standard specifies that metadata events with the name\n // \"process_sort_index\" and \"thread_sort_index\" can be used to influence the\n // order, but for simplicity we'll ignore that until someone complains :)\n sortBy(profilePairs, p => p[0])\n\n return {\n name: '',\n indexToView: 0,\n profiles: profilePairs.map(p => p[1]),\n }\n}\n\nfunction isTraceEventList(maybeEventList: any): maybeEventList is TraceEvent[] {\n if (!Array.isArray(maybeEventList)) return false\n if (maybeEventList.length === 0) return false\n\n // Both ph and ts should be provided for every event. In theory, many other\n // fields are mandatory, but without these fields, we won't usefully be able\n // to import the data, so we'll rely upon these.\n for (let el of maybeEventList) {\n if (!('ph' in el)) {\n return false\n }\n\n switch (el.ph) {\n case 'B':\n case 'E':\n case 'X':\n // All B, E, and X events must have a timestamp specified, otherwise we\n // won't be able to import correctly.\n if (!('ts' in el)) {\n return false\n }\n\n case 'M':\n // It's explicitly okay for \"M\" (metadata) events not to specify a \"ts\"\n // field, since usually there is no logical timestamp for them to have\n break\n }\n }\n\n return true\n}\n\nfunction isTraceEventObject(\n maybeTraceEventObject: any,\n): maybeTraceEventObject is {traceEvents: TraceEvent[]} {\n if (!('traceEvents' in maybeTraceEventObject)) return false\n return isTraceEventList(maybeTraceEventObject['traceEvents'])\n}\n\nexport function isTraceEventFormatted(\n rawProfile: any,\n): rawProfile is {traceEvents: TraceEvent[]} | TraceEvent[] {\n // We're only going to support the JSON formatted profiles for now.\n // The spec also discusses support for data embedded in ftrace supported data: https://lwn.net/Articles/365835/.\n\n return isTraceEventObject(rawProfile) || isTraceEventList(rawProfile)\n}\n\nexport function importTraceEvents(\n rawProfile: {traceEvents: TraceEvent[]} | TraceEvent[],\n): ProfileGroup {\n if (isTraceEventObject(rawProfile)) {\n return eventListToProfileGroup(rawProfile.traceEvents)\n } else if (isTraceEventList(rawProfile)) {\n return eventListToProfileGroup(rawProfile)\n } else {\n const _exhaustiveCheck: never = rawProfile\n return _exhaustiveCheck\n }\n}\n","// https://www.valgrind.org/docs/manual/cl-format.html\n//\n// Larger example files can be found by searching on github:\n// https://github.com/search?q=cfn%3D&type=code\n//\n// Converting callgrind files into flamegraphs is challenging because callgrind\n// formatted profiles contain call graphs with weighted nodes and edges, and\n// such a weighted call graph does not uniquely define a flamegraph.\n//\n// Consider a program that looks like this:\n//\n// // example.js\n// function backup(read) {\n// if (read) {\n// read()\n// } else {\n// write()\n// }\n// }\n//\n// function start() {\n// backup(true)\n// }\n//\n// function end() {\n// backup(false)\n// }\n//\n// start()\n// end()\n//\n// Profiling this program might result in a profile that looks like the\n// following flame graph defined in Brendan Gregg's plaintext format:\n//\n// start;backup;read 4\n// end;backup;write 4\n//\n// When we convert this execution into a call-graph, we get the following:\n//\n// +------------------+ +---------------+\n// | start (self: 0) | | end (self: 0) |\n// +------------------+ +---------------|\n// \\ /\n// (total: 4) \\ / (total: 4)\n// v v\n// +------------------+\n// | backup (self: 0) |\n// +------------------+\n// / \\\n// (total: 4) / \\ (total: 4)\n// v v\n// +----------------+ +-----------------+\n// | read (self: 4) | | write (self: 4) |\n// +----------------+ +-----------------+\n//\n// In the process of the conversion, we've lost information about the ratio of\n// time spent in read v.s. write in the start call v.s. the end call. The\n// following flame graph would yield the exact same call-graph, and therefore\n// the exact sample call-grind formatted profile:\n//\n// start;backup;read 3\n// start;backup;write 1\n// end;backup;read 1\n// end;backup;write 3\n//\n// This is unfortunate, since it means we can't produce a flamegraph that isn't\n// potentially lying about the what the actual execution behavior was. To\n// produce a flamegraph at all from the call graph representation, we have to\n// decide how much weight each sub-call should have. Given that we know the\n// total weight of each node, we'll make the incorrect assumption that every\n// invocation of a function will have the average distribution of costs among\n// the sub-function invocations. In the example given, this means we assume that\n// every invocation of backup() is assumed to spend half its time in read() and\n// half its time in write().\n//\n// So the flamegraph we'll produce from the given call-graph will actually be:\n//\n// start;backup;read 2\n// start;backup;write 2\n// end;backup;read 2\n// end;backup;write 2\n//\n// A particularly bad consequence is that the resulting flamegraph will suggest\n// that there was at some point a call stack that looked like\n// strat;backup;write, even though that never happened in the real program\n// execution.\n\nimport {CallTreeProfileBuilder, Frame, FrameInfo, Profile, ProfileGroup} from '../lib/profile'\nimport {getOrElse, getOrInsert, KeyedSet} from '../lib/utils'\nimport {ByteFormatter, TimeFormatter} from '../lib/value-formatters'\n\nclass CallGraph {\n private frameSet = new KeyedSet<Frame>()\n private totalWeights = new Map<Frame, number>()\n private childrenTotalWeights = new Map<Frame, Map<Frame, number>>()\n\n constructor(private fileName: string, private fieldName: string) {}\n\n private getOrInsertFrame(info: FrameInfo): Frame {\n return Frame.getOrInsert(this.frameSet, info)\n }\n\n private addToTotalWeight(frame: Frame, weight: number) {\n if (!this.totalWeights.has(frame)) {\n this.totalWeights.set(frame, weight)\n } else {\n this.totalWeights.set(frame, this.totalWeights.get(frame)! + weight)\n }\n }\n\n addSelfWeight(frameInfo: FrameInfo, weight: number) {\n this.addToTotalWeight(this.getOrInsertFrame(frameInfo), weight)\n }\n\n addChildWithTotalWeight(parentInfo: FrameInfo, childInfo: FrameInfo, weight: number) {\n const parent = this.getOrInsertFrame(parentInfo)\n const child = this.getOrInsertFrame(childInfo)\n\n const childMap = getOrInsert(this.childrenTotalWeights, parent, k => new Map())\n\n if (!childMap.has(child)) {\n childMap.set(child, weight)\n } else {\n childMap.set(child, childMap.get(child) + weight)\n }\n\n this.addToTotalWeight(parent, weight)\n }\n\n toProfile(): Profile {\n // To convert a call graph into a profile, we first need to identify what\n // the \"root weights\" are. \"root weights\" are the total weight of each frame\n // while at the bottom of the call-stack. The majority of functions will have\n // zero weight while at the bottom of the call-stack, since most functions\n // are never at the bottom of the call-stack.\n const rootWeights = new Map<Frame, number>()\n for (let [frame, totalWeight] of this.totalWeights) {\n rootWeights.set(frame, totalWeight)\n }\n for (let [_, childMap] of this.childrenTotalWeights) {\n for (let [child, weight] of childMap) {\n rootWeights.set(child, getOrElse(rootWeights, child, () => weight) - weight)\n }\n }\n\n let totalProfileWeight = 0\n for (let [_, rootWeight] of rootWeights) {\n totalProfileWeight += rootWeight\n }\n\n const profile = new CallTreeProfileBuilder()\n\n let unitMultiplier = 1\n\n // These are common field names used by Xdebug. Let's give them special\n // treatment to more helpfully display units.\n if (this.fieldName === 'Time_(10ns)') {\n profile.setName(`${this.fileName} -- Time`)\n unitMultiplier = 10\n profile.setValueFormatter(new TimeFormatter('nanoseconds'))\n } else if (this.fieldName == 'Memory_(bytes)') {\n profile.setName(`${this.fileName} -- Memory`)\n profile.setValueFormatter(new ByteFormatter())\n } else {\n profile.setName(`${this.fileName} -- ${this.fieldName}`)\n }\n\n let totalCumulative = 0\n\n const currentStack = new Set<Frame>()\n\n const visit = (frame: Frame, callTreeWeight: number) => {\n if (currentStack.has(frame)) {\n // Call-graphs are allowed to have cycles. Call-trees are not. In case\n // we run into a cycle, we'll just avoid recursing into the same subtree\n // more than once in a call stack. The result will be that the time\n // spent in the recursive call will instead be attributed as self time\n // in the parent.\n return\n }\n\n // We need to calculate how much weight to give to a particular node in\n // the call-tree based on information from the call-graph. A given node\n // from the call-graph might correspond to several nodes in the call-tree,\n // so we need to decide how to distribute the weight of the call-graph\n // node to the various call-tree nodes.\n //\n // We assume that the weighting is evenly distributed. If a call-tree node\n // X occurs with weights x1 and x2, and we know from the call-graph that\n // child Y of X has a total weight y, then we assume the child Y of X has\n // weight y*x1/(x1 + x2) for the first occurrence, and y*x2(y1 + x2) for\n // the second occurrence.\n //\n // This assumption is incorrectly (sometimes wildly so), but we need to\n // make *some* assumption, and this seems to me the sanest option.\n //\n // See the comment at the top of the file for an example where this\n // assumption can yield especially misleading results.\n\n if (callTreeWeight < 1e-4 * totalProfileWeight) {\n // This assumption about even distribution can cause us to generate a\n // call tree with dramatically more nodes than the call graph.\n //\n // Consider a function which is called 1000 times, where the result is\n // cached. The first invocation has a complex call tree and may take\n // 100ms. Let's say that this complex call tree has 250 nodes.\n //\n // Subsequent calls use the cached result, so take only 1ms, and have no\n // children in their call trees. So we have, in total, (1 + 250) + 999\n // nodes in the call-tree for a total of 1250 nodes.\n //\n // The information specific to each invocation is, however, lost in the\n // call-graph representation.\n //\n // Because of the even distribution assumption we make, this means that\n // the call-trees of each invocation will have the same shape. Each 1ms\n // call-tree will look identical to the 100ms call-tree, just\n // horizontally compacted. So instead of 1251 nodes, we have\n // 1000*250=250,000 nodes in the resulting call graph.\n //\n // To mitigate this explosion of the # of nodes, we ignore subtrees\n // whose weights are less than 0.01% of the total weight of the profile.\n return\n }\n\n // totalWeightForFrame is the total weight for the given frame in the\n // entire call graph.\n const callGraphWeightForFrame = getOrElse(this.totalWeights, frame, () => 0)\n if (callGraphWeightForFrame === 0) {\n return\n }\n\n // This is the portion of the total time the given child spends within the\n // given parent that we'll attribute to this specific path in the call\n // tree.\n const ratio = callTreeWeight / callGraphWeightForFrame\n\n let selfWeightForFrame = callGraphWeightForFrame\n\n profile.enterFrame(frame, totalCumulative * unitMultiplier)\n\n currentStack.add(frame)\n for (let [child, callGraphEdgeWeight] of this.childrenTotalWeights.get(frame) || []) {\n selfWeightForFrame -= callGraphEdgeWeight\n const childCallTreeWeight = callGraphEdgeWeight * ratio\n visit(child, childCallTreeWeight)\n }\n currentStack.delete(frame)\n\n totalCumulative += selfWeightForFrame * ratio\n profile.leaveFrame(frame, totalCumulative * unitMultiplier)\n }\n\n for (let [rootFrame, rootWeight] of rootWeights) {\n if (rootWeight <= 0) {\n continue\n }\n // If we've reached here, it means that the given root frame has some\n // weight while at the top of the call-stack.\n visit(rootFrame, rootWeight)\n }\n\n return profile.build()\n }\n}\n\n// In writing this, I initially tried to use the formal grammar described in\n// section 3.2 of https://www.valgrind.org/docs/manual/cl-format.html, but\n// stopped because most of the information isn't relevant for visualization, and\n// because there's inconsistency between the grammar and subsequence\n// descriptions.\n//\n// For example, the grammar for headers specifies all the valid header names,\n// but then the writing below that mentions there may be a \"totals\" or \"summary\"\n// header, which should be disallowed by the formal grammar.\n//\n// So, instead, I'm not going to bother with a formal parse. Since there are no\n// real recursive structures in this file format, that should be okay.\nclass CallgrindParser {\n private lines: string[]\n private lineNum: number\n\n private callGraphs: CallGraph[] | null = null\n private eventsLine: string | null = null\n\n private filename: string | null = null\n private functionName: string | null = null\n private calleeFilename: string | null = null\n private calleeFunctionName: string | null = null\n\n private savedFileNames: {[id: string]: string} = {}\n private savedFunctionNames: {[id: string]: string} = {}\n\n constructor(contents: string, private importedFileName: string) {\n this.lines = contents.split('\\n')\n this.lineNum = 0\n }\n\n parse(): ProfileGroup | null {\n while (this.lineNum < this.lines.length) {\n const line = this.lines[this.lineNum++]\n\n if (/^\\s*#/.exec(line)) {\n // Line is a comment. Ignore it.\n continue\n }\n\n if (/^\\s*$/.exec(line)) {\n // Line is empty. Ignore it.\n continue\n }\n\n if (this.parseHeaderLine(line)) {\n continue\n }\n\n if (this.parseAssignmentLine(line)) {\n continue\n }\n\n if (this.parseCostLine(line, 'self')) {\n continue\n }\n\n throw new Error(`Unrecognized line \"${line}\" on line ${this.lineNum}`)\n }\n\n if (!this.callGraphs) {\n return null\n }\n return {\n name: this.importedFileName,\n indexToView: 0,\n profiles: this.callGraphs.map(cg => cg.toProfile()),\n }\n }\n\n private frameInfo(): FrameInfo {\n const file = this.filename || '(unknown)'\n const name = this.functionName || '(unknown)'\n const key = `${file}:${name}`\n return {key, name, file}\n }\n\n private calleeFrameInfo(): FrameInfo {\n const file = this.calleeFilename || '(unknown)'\n const name = this.calleeFunctionName || '(unknown)'\n const key = `${file}:${name}`\n return {key, name, file}\n }\n\n private parseHeaderLine(line: string): boolean {\n const headerMatch = /^\\s*(\\w+):\\s*(.*)+$/.exec(line)\n if (!headerMatch) return false\n\n if (headerMatch[1] !== 'events') {\n // We don't care about other headers. Ignore this line.\n return true\n }\n\n // Line specifies the formatting of subsequent cost lines.\n const fields = headerMatch[2].split(' ')\n\n if (this.callGraphs != null) {\n throw new Error(\n `Duplicate \"events: \" lines specified. First was \"${this.eventsLine}\", now received \"${line}\" on ${this.lineNum}.`,\n )\n }\n\n this.callGraphs = fields.map(fieldName => {\n return new CallGraph(this.importedFileName, fieldName)\n })\n\n return true\n }\n\n private parseAssignmentLine(line: string): boolean {\n const assignmentMatch = /^(\\w+)=\\s*(.*)$/.exec(line)\n if (!assignmentMatch) return false\n\n const key = assignmentMatch[1]\n const value = assignmentMatch[2]\n\n switch (key) {\n case 'fe':\n case 'fi':\n case 'fl': {\n this.filename = this.parseNameWithCompression(value, this.savedFileNames)\n this.calleeFilename = this.filename\n break\n }\n\n case 'fn': {\n this.functionName = this.parseNameWithCompression(value, this.savedFunctionNames)\n break\n }\n\n case 'cfi':\n case 'cfl': {\n this.calleeFilename = this.parseNameWithCompression(value, this.savedFileNames)\n break\n }\n\n case 'cfn': {\n this.calleeFunctionName = this.parseNameWithCompression(value, this.savedFunctionNames)\n break\n }\n\n case 'calls': {\n // TODO(jlfwong): This is currently ignoring the number of calls being\n // made. Accounting for the number of calls might be unhelpful anyway,\n // since it'll just be copying the exact same frame over-and-over again,\n // but that might be better than ignoring it.\n this.parseCostLine(this.lines[this.lineNum++], 'child')\n break\n }\n\n default: {\n console.log(`Ignoring assignment to unrecognized key \"${line}\" on line ${this.lineNum}`)\n }\n }\n\n return true\n }\n\n private parseNameWithCompression(name: string, saved: {[id: string]: string}): string {\n {\n const nameDefinitionMatch = /^\\((\\d+)\\)\\s*(.+)$/.exec(name)\n\n if (nameDefinitionMatch) {\n const id = nameDefinitionMatch[1]\n const name = nameDefinitionMatch[2]\n if (id in saved) {\n throw new Error(\n `Redefinition of name with id: ${id}. Original value was \"${saved[id]}\". Tried to redefine as \"${name}\" on line ${this.lineNum}.`,\n )\n }\n\n saved[id] = name\n return name\n }\n }\n\n {\n const nameUseMatch = /^\\((\\d+)\\)$/.exec(name)\n if (nameUseMatch) {\n const id = nameUseMatch[1]\n if (!(id in saved)) {\n throw new Error(\n `Tried to use name with id ${id} on line ${this.lineNum} before it was defined.`,\n )\n }\n return saved[id]\n }\n }\n\n return name\n }\n\n private parseCostLine(line: string, costType: 'self' | 'child'): boolean {\n // TODO(jlfwong): Handle \"Subposition compression\"\n // TODO(jlfwong): Allow hexadecimal encoding\n\n const parts = line.split(/\\s+/)\n const nums: number[] = []\n for (let part of parts) {\n // As far as I can tell from the specification, the callgrind format does\n // not accept floating point numbers.\n const asNum = parseInt(part)\n if (isNaN(asNum)) {\n return false\n }\n\n nums.push(asNum)\n }\n\n if (nums.length == 0) {\n return false\n }\n\n // TODO(jlfwong): Handle custom positions format w/ multiple parts\n const numPositionFields = 1\n\n // NOTE: We intentionally do not include the line number here because\n // callgrind uses the line number of the function invocation, not the\n // line number of the function definition, which conflicts with how\n // speedscope uses line numbers.\n //\n // const lineNum = nums[0]\n\n if (!this.callGraphs) {\n throw new Error(\n `Encountered a cost line on line ${this.lineNum} before event specification was provided.`,\n )\n }\n for (let i = 0; i < this.callGraphs.length; i++) {\n if (costType === 'self') {\n this.callGraphs[i].addSelfWeight(this.frameInfo(), nums[numPositionFields + i])\n } else if (costType === 'child') {\n this.callGraphs[i].addChildWithTotalWeight(\n this.frameInfo(),\n this.calleeFrameInfo(),\n nums[numPositionFields + i] || 0,\n )\n }\n }\n\n return true\n }\n}\n\nexport function importFromCallgrind(\n contents: string,\n importedFileName: string,\n): ProfileGroup | null {\n return new CallgrindParser(contents, importedFileName).parse()\n}\n","import {Profile, ProfileGroup} from '../lib/profile'\nimport {FileSystemDirectoryEntry} from './file-system-entry'\n\nimport {\n importFromChromeCPUProfile,\n importFromChromeTimeline,\n isChromeTimeline,\n importFromOldV8CPUProfile,\n} from './chrome'\nimport {importFromStackprof} from './stackprof'\nimport {importFromInstrumentsDeepCopy, importFromInstrumentsTrace} from './instruments'\nimport {importFromBGFlameGraph} from './bg-flamegraph'\nimport {importFromFirefox} from './firefox'\nimport {importSpeedscopeProfiles} from '../lib/file-format'\nimport {importFromV8ProfLog} from './v8proflog'\nimport {importFromLinuxPerf} from './linux-tools-perf'\nimport {importFromHaskell} from './haskell'\nimport {importFromSafari} from './safari'\nimport {ProfileDataSource, TextProfileDataSource, MaybeCompressedDataReader} from './utils'\nimport {importAsPprofProfile} from './pprof'\nimport {decodeBase64} from '../lib/utils'\nimport {importFromChromeHeapProfile} from './v8heapalloc'\nimport {isTraceEventFormatted, importTraceEvents} from './trace-event'\nimport {importFromCallgrind} from './callgrind'\n\nexport async function importProfileGroupFromText(\n fileName: string,\n contents: string,\n): Promise<ProfileGroup | null> {\n return await importProfileGroup(new TextProfileDataSource(fileName, contents))\n}\n\nexport async function importProfileGroupFromBase64(\n fileName: string,\n b64contents: string,\n): Promise<ProfileGroup | null> {\n return await importProfileGroup(\n MaybeCompressedDataReader.fromArrayBuffer(fileName, decodeBase64(b64contents).buffer),\n )\n}\n\nexport async function importProfilesFromFile(file: File): Promise<ProfileGroup | null> {\n return importProfileGroup(MaybeCompressedDataReader.fromFile(file))\n}\n\nexport async function importProfilesFromArrayBuffer(\n fileName: string,\n buffer: ArrayBuffer,\n): Promise<ProfileGroup | null> {\n return importProfileGroup(MaybeCompressedDataReader.fromArrayBuffer(fileName, buffer))\n}\n\nasync function importProfileGroup(dataSource: ProfileDataSource): Promise<ProfileGroup | null> {\n const fileName = await dataSource.name()\n\n const profileGroup = await _importProfileGroup(dataSource)\n if (profileGroup) {\n if (!profileGroup.name) {\n profileGroup.name = fileName\n }\n for (let profile of profileGroup.profiles) {\n if (profile && !profile.getName()) {\n profile.setName(fileName)\n }\n }\n return profileGroup\n }\n return null\n}\n\nfunction toGroup(profile: Profile | null): ProfileGroup | null {\n if (!profile) return null\n return {name: profile.getName(), indexToView: 0, profiles: [profile]}\n}\n\nfunction fixUpJSON(content: string): string {\n // This code is similar to the code from here:\n // https://github.com/catapult-project/catapult/blob/27e047e0494df162022be6aa8a8862742a270232/tracing/tracing/extras/importer/trace_event_importer.html#L197-L208\n //\n // If the event data begins with a [, then we know it should end with a ]. The\n // reason we check for this is because some tracing implementations cannot\n // guarantee that a ']' gets written to the trace file. So, we are forgiving\n // and if this is obviously the case, we fix it up before throwing the string\n // at JSON.parse.\n //\n content = content.trim()\n if (content[0] === '[') {\n content = content.replace(/,\\s*$/, '')\n if (content[content.length - 1] !== ']') {\n content += ']'\n }\n }\n return content\n}\n\nasync function _importProfileGroup(dataSource: ProfileDataSource): Promise<ProfileGroup | null> {\n const fileName = await dataSource.name()\n\n const buffer = await dataSource.readAsArrayBuffer()\n\n {\n const profile = importAsPprofProfile(buffer)\n if (profile) {\n console.log('Importing as protobuf encoded pprof file')\n return toGroup(profile)\n }\n }\n\n const contents = await dataSource.readAsText()\n\n // First pass: Check known file format names to infer the file type\n if (fileName.endsWith('.speedscope.json')) {\n console.log('Importing as speedscope json file')\n return importSpeedscopeProfiles(JSON.parse(contents))\n } else if (fileName.endsWith('.chrome.json') || /Profile-\\d{8}T\\d{6}/.exec(fileName)) {\n console.log('Importing as Chrome Timeline')\n return importFromChromeTimeline(JSON.parse(contents), fileName)\n } else if (fileName.endsWith('.stackprof.json')) {\n console.log('Importing as stackprof profile')\n return toGroup(importFromStackprof(JSON.parse(contents)))\n } else if (fileName.endsWith('.instruments.txt')) {\n console.log('Importing as Instruments.app deep copy')\n return toGroup(importFromInstrumentsDeepCopy(contents))\n } else if (fileName.endsWith('.linux-perf.txt')) {\n console.log('Importing as output of linux perf script')\n return importFromLinuxPerf(contents)\n } else if (fileName.endsWith('.collapsedstack.txt')) {\n console.log('Importing as collapsed stack format')\n return toGroup(importFromBGFlameGraph(contents))\n } else if (fileName.endsWith('.v8log.json')) {\n console.log('Importing as --prof-process v8 log')\n return toGroup(importFromV8ProfLog(JSON.parse(contents)))\n } else if (fileName.endsWith('.heapprofile')) {\n console.log('Importing as Chrome Heap Profile')\n return toGroup(importFromChromeHeapProfile(JSON.parse(contents)))\n } else if (fileName.endsWith('-recording.json')) {\n console.log('Importing as Safari profile')\n return toGroup(importFromSafari(JSON.parse(contents)))\n } else if (fileName.startsWith('callgrind.')) {\n console.log('Importing as Callgrind profile')\n return importFromCallgrind(contents, fileName)\n }\n\n // Second pass: Try to guess what file format it is based on structure\n let parsed: any\n try {\n parsed = JSON.parse(fixUpJSON(contents))\n } catch (e) {}\n if (parsed) {\n if (parsed['$schema'] === 'https://www.speedscope.app/file-format-schema.json') {\n console.log('Importing as speedscope json file')\n return importSpeedscopeProfiles(JSON.parse(contents))\n } else if (parsed['systemHost'] && parsed['systemHost']['name'] == 'Firefox') {\n console.log('Importing as Firefox profile')\n return toGroup(importFromFirefox(parsed))\n } else if (isChromeTimeline(parsed)) {\n console.log('Importing as Chrome Timeline')\n return importFromChromeTimeline(parsed, fileName)\n } else if ('nodes' in parsed && 'samples' in parsed && 'timeDeltas' in parsed) {\n console.log('Importing as Chrome CPU Profile')\n return toGroup(importFromChromeCPUProfile(parsed))\n } else if (isTraceEventFormatted(parsed)) {\n console.log('Importing as Trace Event Format profile')\n return importTraceEvents(parsed)\n } else if ('head' in parsed && 'samples' in parsed && 'timestamps' in parsed) {\n console.log('Importing as Chrome CPU Profile (old format)')\n return toGroup(importFromOldV8CPUProfile(parsed))\n } else if ('mode' in parsed && 'frames' in parsed && 'raw_timestamp_deltas' in parsed) {\n console.log('Importing as stackprof profile')\n return toGroup(importFromStackprof(parsed))\n } else if ('code' in parsed && 'functions' in parsed && 'ticks' in parsed) {\n console.log('Importing as --prof-process v8 log')\n return toGroup(importFromV8ProfLog(parsed))\n } else if ('head' in parsed && 'selfSize' in parsed['head']) {\n console.log('Importing as Chrome Heap Profile')\n return toGroup(importFromChromeHeapProfile(JSON.parse(contents)))\n } else if ('rts_arguments' in parsed && 'initial_capabilities' in parsed) {\n console.log('Importing as Haskell GHC JSON Profile')\n return importFromHaskell(parsed)\n } else if ('recording' in parsed && 'sampleStackTraces' in parsed.recording) {\n console.log('Importing as Safari profile')\n return toGroup(importFromSafari(JSON.parse(contents)))\n }\n } else {\n // Format is not JSON\n\n // If the first line is \"# callgrind format\", it's probably in Callgrind\n // Profile Format.\n if (\n /^# callgrind format/.exec(contents) ||\n (/^events:/m.exec(contents) && /^fn=/m.exec(contents))\n ) {\n console.log('Importing as Callgrind profile')\n return importFromCallgrind(contents, fileName)\n }\n\n // If the first line contains \"Symbol Name\", preceded by a tab, it's probably\n // a deep copy from OS X Instruments.app\n if (/^[\\w \\t\\(\\)]*\\tSymbol Name/.exec(contents)) {\n console.log('Importing as Instruments.app deep copy')\n return toGroup(importFromInstrumentsDeepCopy(contents))\n }\n\n // If every line ends with a space followed by a number, it's probably\n // the collapsed stack format.\n const lineCount = contents.split(/\\n/).length\n if (lineCount >= 1 && lineCount === contents.split(/ \\d+\\r?\\n/).length) {\n console.log('Importing as collapsed stack format')\n return toGroup(importFromBGFlameGraph(contents))\n }\n\n const fromLinuxPerf = importFromLinuxPerf(contents)\n if (fromLinuxPerf) {\n console.log('Importing from linux perf script output')\n return fromLinuxPerf\n }\n }\n\n // Unrecognized format\n return null\n}\n\nexport async function importFromFileSystemDirectoryEntry(entry: FileSystemDirectoryEntry) {\n return importFromInstrumentsTrace(entry)\n}\n"]} |