@k67/kaitai-struct-ts 0.8.0 → 0.10.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (10) hide show
  1. package/dist/browser/index.mjs +272 -0
  2. package/dist/browser/index.mjs.map +1 -0
  3. package/dist/cli.js +1614 -923
  4. package/dist/index.d.mts +70 -7
  5. package/dist/index.d.ts +70 -7
  6. package/dist/index.js +704 -46
  7. package/dist/index.js.map +1 -1
  8. package/dist/index.mjs +704 -46
  9. package/dist/index.mjs.map +1 -1
  10. package/package.json +6 -3
package/dist/browser/index.mjs.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../src/utils/errors.ts","../../src/utils/encoding.ts","../../src/stream/KaitaiStream.ts","../../src/parser/schema.ts","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/identity.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/visit.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/doc/directives.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/doc/anchors.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/doc/applyReviver.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/toJS.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/Node.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/Alias.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/Scalar.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/doc/createNode.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/Collection.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringifyComment.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/foldFlowLines.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringifyString.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringify.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringifyPair.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/merge.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/addPairToJSMap.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/Pair.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringifyCollection.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/YAMLMap.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/common/map.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/nodes/YAMLSeq.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/common/seq.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/common/string.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/common/null.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/core/bool.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringifyNumber.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/core/float.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/core/int.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/core/schema.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/json/schema.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/binary.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/pairs.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/omap.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/bool.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/float.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/int.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/set.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/timestamp.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/yaml-1.1/schema.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/tags.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/schema/Schema.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/stringify/stringifyDocument.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/doc/Document.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/errors.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-props.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/util-contains-newline.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/util-flow-indent-check.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/util-map-includes.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-block-map.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-block-seq.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-end.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-flow-collection.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/compose-collection.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-block-scalar.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/resolve-flow-scalar.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/compose-scalar.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/util-empty-scalar-position.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/compose-node.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/compose-doc.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/compose/composer.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/parse/cst.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/parse/lexer.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/parse/line-counter.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/parse/parser.js","../../node_modules/.pnpm/yaml@2.8.1/node_modules/yaml/browser/dist/public-api.js","../../src/parser/KsyParser.ts","../../src/interpreter/Context.ts","../../src/expression/Token.ts","../../src/expression/Lexer.ts","../../src/expression/AST.ts","../../src/expression/Parser.ts","../../src/expression/Evaluator.ts","../../src/expression/index.ts","../../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../../src/utils/process.ts","../../src/interpreter/TypeInterpreter.ts","../../src/index.ts"],"names":["KaitaiError","_KaitaiError","message","position","context","formatted","hexContext","data","start","end","chunk","lines","offset","i","lineBytes","hex","b","ascii","offsetStr","marker","ValidationError","_ValidationError","ParseError","_ParseError","EOFError","_EOFError","NotImplementedError","_NotImplementedError","feature","decodeString","bytes","encoding","decodeUtf8","decodeAscii","decodeUtf16Le","decodeUtf16Be","decodeLatin1","result","byte1","byte2","byte3","byte4","codePoint","charCode","KaitaiStream","_KaitaiStream","buffer","_pos","_bits","_bitsLeft","value","pos","count","length","term","include","consume","eosError","foundTerm","includeEnd","n","bitsNeeded","bitsToRead","mask","shift","bitPos","size","subBuffer","BUILTIN_TYPES","isBuiltinType","type","getTypeEndianness","getBaseType","isIntegerType","base","isFloatType","isStringType","ALIAS","DOC","MAP","PAIR","SCALAR","SEQ","NODE_TYPE","isAlias","node","isDocument","isMap","isPair","isScalar","isSeq","isCollection","isNode","hasAnchor","BREAK","SKIP","REMOVE","visit","visitor","visitor_","initVisitor","visit_","key","path","ctrl","callVisitor","replaceNode","ci","ck","cv","parent","pt","escapeChars","escapeTagName","tn","ch","Directives","_Directives","yaml","tags","copy","res","line","onError","parts","name","handle","prefix","version","isValid","source","verbatim","suffix","error","tag","doc","tagEntries","tagNames","_key","anchorIsValid","anchor","msg","anchorNames","root","anchors","findNewAnchor","exclude","createNodeAnchors","aliasObjects","sourceObjects","prevAnchors","ref","applyReviver","reviver","obj","val","len","v0","v1","k","toJS","arg","ctx","v","NodeBase","mapAsMap","maxAliasCount","onAnchor","Alias","nodes","found","_arg","getAliasCount","_onComment","_onChompKeep","src","item","c","kc","vc","isScalarValue","Scalar","defaultTagPrefix","findTagObject","tagName","match","t","tagObj","createNode","map","aliasDuplicateObjects","onTagObj","schema","collectionFromPath","a","isEmptyPath","Collection","it","rest","keepScalar","allowScalar","stringifyComment","str","indentComment","comment","indent","lineComment","FOLD_FLOW","FOLD_BLOCK","FOLD_QUOTED","foldFlowLines","text","mode","indentAtStart","lineWidth","minContentWidth","onFold","onOverflow","endStep","folds","escapedFolds","split","prev","overflow","escStart","escEnd","consumeMoreIndentedLines","next","j","fold","getFoldOptions","isBlock","containsDocumentMarker","lineLengthOverLimit","indentLength","limit","strLen","doubleQuotedString","json","implicitKey","minMultiLineLength","code","singleQuotedString","quotedString","singleQuote","qs","hasDouble","hasSingle","blockEndNewlines","blockString","onComment","onChompKeep","blockQuote","commentString","literal","chomp","endStart","endNlPos","startWithSpace","startEnd","startNlPos","header","foldedValue","literalFallback","foldOptions","body","plainString","actualString","indentStep","inFlow","test","compat","stringifyString","ss","_stringify","_type","defaultKeyType","defaultStringType","createStringifyContext","options","opt","getTagObject","testMatch","stringifyProps","props","stringify","o","stringifyPair","allNullValues","indentSeq","simpleKeys","keyComment","explicitKey","keyCommentDone","chompKeep","vsb","vcb","valueComment","valueCommentDone","valueStr","ws","cs","vs0","nl0","hasNewline","flow","hasPropsLine","sp0","MERGE_KEY","merge","addMergeToJSMap","isMergeKey","mergeValue","srcMap","addPairToJSMap","jsKey","stringKey","stringifyKey","jsValue","strCtx","strKey","jsonStr","createPair","Pair","_Pair","_","pair","stringifyCollection","collection","stringifyFlowCollection","stringifyBlockCollection","items","blockItemPrefix","flowChars","itemIndent","itemCtx","addCommentBefore","ik","fcPadding","reqNewline","linesAtValue","iv","sum","ic","findPair","YAMLMap","keepUndefined","replacer","add","overwrite","_pair","sortEntries","Type","YAMLSeq","idx","asItemIndex","seq","string","nullTag","boolTag","sv","stringifyNumber","format","minFractionDigits","num","d","floatNaN","floatExp","float","dot","intIdentify","intResolve","radix","intAsBigInt","intStringify","intOct","_onError","int","intHex","stringifyJSON","jsonScalars","jsonError","binary","buf","s","resolvePairs","cn","createPairs","iterable","pairs","keys","YAMLOMap","_YAMLOMap","omap","seenKeys","boolStringify","trueTag","falseTag","f","sign","intBin","YAMLSet","_YAMLSet","keepPair","set","parseSexagesimal","asBigInt","p","stringifySexagesimal","_60","intTime","floatTime","timestamp","year","month","day","hour","minute","second","millisec","date","tz","schemas","tagsByName","coreKnownTags","getTags","customTags","schemaName","addMergeTag","schemaTags","sortMapEntriesByKey","Schema","_Schema","resolveKnownTags","sortMapEntries","toStringDefaults","stringifyDocument","hasDirectives","dir","contentComment","dc","Document","_Document","_replacer","_directives","assertCollection","keyToStr","asStr","anchorPrefix","setAnchors","jsonArg","contents","YAMLError","YAMLParseError","YAMLWarning","prettifyError","lc","col","lineStr","trimStart","pointer","resolveProps","tokens","indicator","parentIndent","startOnNewline","spaceBefore","atNewline","hasSpace","commentSep","reqSpace","tab","newlineAfterProp","comma","token","cb","last","containsNewline","st","flowIndentCheck","fc","mapIncludes","search","uniqueKeys","isEqual","startColMsg","resolveBlockMap","composeNode","composeEmptyNode","bm","NodeClass","commentEnd","collItem","sep","keyProps","keyStart","keyNode","valueProps","valueNode","resolveBlockSeq","bs","resolveEnd","blockMsg","resolveFlowCollection","fcName","coll","atRoot","prevItemComment","loop","endRange","expectedEnd","ce","ee","cePos","resolveCollection","CN","Coll","composeCollection","tagToken","nl","lastProp","expType","kt","resolveBlockScalar","scalar","parseBlockScalarHeader","splitLines","chompStart","content","trimIndent","contentStart","prevMoreIndented","crlf","strict","ts","first","m","resolveFlowScalar","rel","plainValue","singleQuotedValue","doubleQuotedValue","valueEnd","re","badChar","foldLines","foldNewline","cc","escapeCodes","parseCharCode","raw","wsStart","composeScalar","range","findScalarTagByName","findScalarTagByTest","matchWithTest","atKey","directives","emptyScalarPosition","before","isSrcToken","composeAlias","alias","composeDoc","opts","contentEnd","getErrorPos","parsePrelude","prelude","atComment","afterEmptyLine","Composer","warning","afterDoc","forceDoc","endOffset","BOM","DOCUMENT","FLOW_END","tokenType","isEmpty","hexDigits","tagChars","flowIndicatorChars","invalidAnchorChars","isNotAnchorChar","Lexer","incomplete","dt","state","dirEnd","sp","ch0","ch1","quote","qb","lastChar","allowEmpty","allowTabs","LineCounter","low","high","mid","includesToken","list","findNonEmptyIndex","isFlowToken","getPrevProps","getFirstKeyStartProps","fixFlowSeqItems","Parser","onNewLine","lexeme","top","bv","atMapIndent","atNextItem","fs","docEnd","parseOptions","prettyErrors","parseDocument","lineCounter","parser","composer","_doc","parse","_reviver","KsyParser","validate","parsed","errorMessages","e","isNested","errors","warnings","attr","index","instance","typeResult","w","_strict","mainYaml","imports","mainSchema","resolvedTypes","importPath","importYaml","importedSchema","namespace","typeName","typeSchema","qualifiedName","enumName","enumSpec","qualifiedEnumName","segments","Context","_Context","_io","_root","_parent","enums","_current","_enums","valueName","enumDef","numKey","stream","cloned","createToken","input","char","createLiteral","createIdentifier","createBinaryOp","operator","left","right","createUnaryOp","operand","createTernary","condition","ifTrue","ifFalse","createMemberAccess","object","property","createIndexAccess","createMethodCall","method","args","createEnumAccess","createArrayLiteral","elements","ExpressionParser","expr","types","memberExpr","Evaluator","leftVal","rightVal","condValue","numIdx","evalArgs","replace","fillString","arr","array","op","leftBig","rightBig","leftNum","rightNum","toArray","x","leftArr","rightArr","evaluateExpression","expression","preprocessed","ast","zero$1","MIN_MATCH$1","MAX_MATCH$1","LENGTH_CODES$1","LITERALS$1","L_CODES$1","D_CODES$1","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","adler32","adler","s1","s2","adler32_1","makeTable","table","crcTable","crc32","crc","crc32_1","messages","constants$2","_has","assign","sources","flattenChunks","chunks","l","common","STR_APPLY_UIA_OK","_utf8len","q","string2buf","c2","m_pos","str_len","buf_len","buf2binstring","buf2string","max","out","utf16buf","c_len","utf8border","strings","ZStream","zstream","BAD$1","TYPE$1","inffast","strm","_in","_out","beg","dmax","wsize","whave","wnext","s_window","hold","bits","lcode","dcode","lmask","dmask","here","dist","from","from_source","output","dolen","dodist","MAXBITS","ENOUGH_LENS$1","ENOUGH_DISTS$1","CODES$1","LENS$1","DISTS$1","lbase","lext","dbase","dext","inflate_table","lens","lens_index","codes","table_index","work","sym","min","curr","drop","used","huff","incr","fill","offs","extra","here_bits","here_op","here_val","inftrees","CODES","LENS","DISTS","Z_FINISH$1","Z_BLOCK","Z_TREES","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","Z_BUF_ERROR","Z_DEFLATED","HEAD","FLAGS","TIME","OS","EXLEN","EXTRA","NAME","COMMENT","HCRC","DICTID","DICT","TYPE","TYPEDO","STORED","COPY_","COPY","TABLE","LENLENS","CODELENS","LEN_","LEN","LENEXT","DIST","DISTEXT","MATCH","LIT","CHECK","LENGTH","DONE","BAD","MEM","SYNC","ENOUGH_LENS","ENOUGH_DISTS","MAX_WBITS","DEF_WBITS","zswap32","InflateState","inflateStateCheck","inflateResetKeep","inflateReset","inflateReset2","windowBits","wrap","inflateInit2","ret","inflateInit","virgin","lenfix","distfix","fixedtables","updatewindow","inflate$2","flush","put","have","last_bits","last_op","last_val","hbuf","order","inf_leave","inflateEnd","inflateGetHeader","head","inflateSetDictionary","dictionary","dictLength","dictid","inflateReset_1","inflateReset2_1","inflateResetKeep_1","inflateInit_1","inflateInit2_1","inflate_2$1","inflateEnd_1","inflateGetHeader_1","inflateSetDictionary_1","inflateInfo","inflate_1$2","GZheader","gzheader","toString","Z_NO_FLUSH","Z_FINISH","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Inflate$1","status","flush_mode","chunkSize","_flush_mode","last_avail_out","next_out_utf8","tail","utf8str","inflate$1","inflator","inflate_2","inflate_1$1","inflate","inflate_1","applyProcess","process","spec","algorithm","processZlib","processXor","processRol","processRor","processByteswap","keyBytes","amount","group","groupSize","byte","TypeInterpreter","_TypeInterpreter","parentMeta","maybe","typeArgs","actualRoot","startPos","param","argValue","evaluatedArg","endPos","cached","evaluated","savedPos","ioVal","kio","countValue","expected","sizeValue","substream","sub","effectiveArgs","meta","typeSpec","argsString","current","inString","stringChar","parenDepth","switchType","switchOn","cases","defaultType","switchValue","switchKey","selectedType","typeEndian","metaEndian","endian","maxSafe","endianExpr","ksyYaml"],"mappings":"AAkBO,IAAMA,EAAAA,CAAN,MAAMC,CAAAA,SAAoB,KAAM,CACrC,WAAA,CACEC,CAAAA,CACOC,CAAAA,CACAC,CAAAA,CACP,CACA,KAAA,CAAMH,CAAAA,CAAY,cAAcC,CAAAA,CAASC,CAAAA,CAAUC,CAAO,CAAC,CAAA,CAHpD,IAAA,CAAA,QAAA,CAAAD,CAAAA,CACA,IAAA,CAAA,OAAA,CAAAC,CAAAA,CAGP,IAAA,CAAK,IAAA,CAAO,aAAA,CACZ,MAAA,CAAO,cAAA,CAAe,IAAA,CAAMH,CAAAA,CAAY,SAAS,EACnD,CAMA,OAAe,aAAA,CACbC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACQ,CACR,IAAIC,CAAAA,CAAYH,CAAAA,CAMhB,GAJIC,CAAAA,GAAa,MAAA,GACfE,CAAAA,EAAa,CAAA,mBAAA,EAAsBF,EAAS,QAAA,CAAS,EAAE,CAAA,CAAE,WAAA,EAAa,CAAA,CAAA,CAAA,CAAA,CAGpEC,CAAAA,EAAWA,CAAAA,CAAQ,OAAS,CAAA,CAAG,CACjC,IAAME,CAAAA,CAAaL,CAAAA,CAAY,gBAAA,CAAiBG,CAAAA,CAASD,CAAQ,EACjEE,CAAAA,EAAa;AAAA,EAAKC,CAAU,CAAA,EAC9B,CAEA,OAAOD,CACT,CAMA,OAAe,gBAAA,CAAiBE,CAAAA,CAAkBJ,CAAAA,CAA2B,CAE3E,IAAMK,CAAAA,CAAQ,KAAK,GAAA,CAAI,CAAA,CAAA,CAAIL,CAAAA,EAAY,CAAA,EAAK,EAAW,CAAA,CACjDM,CAAAA,CAAM,IAAA,CAAK,IAAIF,CAAAA,CAAK,MAAA,CAAA,CAASJ,CAAAA,EAAY,CAAA,EAAK,EAAW,CAAA,CACzDO,CAAAA,CAAQH,CAAAA,CAAK,MAAMC,CAAAA,CAAOC,CAAG,CAAA,CAE7BE,CAAAA,CAAkB,CAAC,UAAU,CAAA,CAC/BC,CAAAA,CAASJ,EAEb,IAAA,IAASK,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIH,CAAAA,CAAM,MAAA,CAAQG,CAAAA,EAAK,EAAA,CAAI,CACzC,IAAMC,CAAAA,CAAYJ,CAAAA,CAAM,KAAA,CAAMG,CAAAA,CAAGA,CAAAA,CAAI,EAAE,CAAA,CACjCE,EAAM,KAAA,CAAM,IAAA,CAAKD,CAAS,CAAA,CAC7B,GAAA,CAAKE,CAAAA,EAAMA,CAAAA,CAAE,QAAA,CAAS,EAAE,CAAA,CAAE,QAAA,CAAS,CAAA,CAAG,GAAG,CAAC,CAAA,CAC1C,IAAA,CAAK,GAAG,EACLC,CAAAA,CAAQ,KAAA,CAAM,IAAA,CAAKH,CAAS,CAAA,CAC/B,GAAA,CAAKE,CAAAA,EAAOA,CAAAA,EAAK,IAAMA,CAAAA,EAAK,GAAA,CAAM,MAAA,CAAO,YAAA,CAAaA,CAAC,CAAA,CAAI,GAAI,CAAA,CAC/D,KAAK,EAAE,CAAA,CAEJE,CAAAA,CAAY,CAAA,EAAA,EAAA,CAAMN,CAAAA,CAASC,CAAAA,EAAG,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,CAAG,GAAG,CAAC,CAAA,CAAA,CAC3DM,CAAAA,CACJhB,CAAAA,GAAa,MAAA,EACbA,GAAYS,CAAAA,CAASC,CAAAA,EACrBV,CAAAA,CAAWS,CAAAA,CAASC,CAAAA,CAAIC,CAAAA,CAAU,MAAA,CAC9B,MAAA,CACA,GAENH,CAAAA,CAAM,IAAA,CAAK,CAAA,EAAGO,CAAS,CAAA,EAAA,EAAKH,CAAAA,CAAI,MAAA,CAAO,EAAA,CAAI,GAAG,CAAC,CAAA,GAAA,EAAME,CAAK,CAAA,EAAGE,CAAM,CAAA,CAAE,EACvE,CAEA,OAAOR,EAAM,IAAA,CAAK;AAAA,CAAI,CACxB,CACF,CAAA,CAaaS,EAAAA,CAAN,MAAMC,UAAwBrB,EAAY,CAC/C,WAAA,CAAYE,CAAAA,CAAiBC,EAAmBC,CAAAA,CAAsB,CACpE,MAAMF,CAAAA,CAASC,CAAAA,CAAUC,CAAO,CAAA,CAChC,IAAA,CAAK,IAAA,CAAO,iBAAA,CACZ,OAAO,cAAA,CAAe,IAAA,CAAMiB,CAAAA,CAAgB,SAAS,EACvD,CACF,CAAA,CAaaC,CAAAA,CAAN,MAAMC,UAAmBvB,EAAY,CAC1C,YAAYE,CAAAA,CAAiBC,CAAAA,CAAmBC,EAAsB,CACpE,KAAA,CAAMF,CAAAA,CAASC,CAAAA,CAAUC,CAAO,CAAA,CAChC,IAAA,CAAK,IAAA,CAAO,YAAA,CACZ,OAAO,cAAA,CAAe,IAAA,CAAMmB,CAAAA,CAAW,SAAS,EAClD,CACF,CAAA,CAaaC,GAAN,MAAMC,CAAAA,SAAiBzB,EAAY,CACxC,WAAA,CACEE,CAAAA,CAAkB,0BAAA,CAClBC,EACAC,CAAAA,CACA,CACA,KAAA,CAAMF,CAAAA,CAASC,EAAUC,CAAO,CAAA,CAChC,IAAA,CAAK,IAAA,CAAO,WACZ,MAAA,CAAO,cAAA,CAAe,KAAMqB,CAAAA,CAAS,SAAS,EAChD,CACF,CAAA,CAaaC,EAAAA,CAAN,MAAMC,UAA4B3B,EAAY,CACnD,WAAA,CAAY4B,CAAAA,CAAiB,CAC3B,KAAA,CAAM,CAAA,6BAAA,EAAgCA,CAAO,CAAA,CAAE,EAC/C,IAAA,CAAK,IAAA,CAAO,sBACZ,MAAA,CAAO,cAAA,CAAe,KAAMD,CAAAA,CAAoB,SAAS,EAC3D,CACF,ECjJO,SAASE,EAAAA,CAAaC,CAAAA,CAAmBC,CAAAA,CAA0B,CAKxE,OAH2BA,CAAAA,CAAS,WAAA,EAAY,CAAE,QAAQ,OAAA,CAAS,EAAE,GAInE,KAAK,OACL,KAAK,OAAA,CACH,OAAOC,EAAAA,CAAWF,CAAK,CAAA,CAEzB,KAAK,OAAA,CACL,KAAK,UACH,OAAOG,EAAAA,CAAYH,CAAK,CAAA,CAE1B,KAAK,OAAA,CACL,KAAK,UACL,KAAK,UAAA,CACH,OAAOI,EAAAA,CAAcJ,CAAK,CAAA,CAE5B,KAAK,UACL,KAAK,UAAA,CACH,OAAOK,EAAAA,CAAcL,CAAK,CAAA,CAE5B,KAAK,QAAA,CACL,KAAK,WACL,KAAK,YAAA,CACH,OAAOM,EAAAA,CAAaN,CAAK,EAE3B,QAEE,GAAI,OAAO,WAAA,CAAgB,IACzB,GAAI,CAEF,OAAO,IAAI,YAAYC,CAAQ,CAAA,CAAE,MAAA,CAAOD,CAAK,CAC/C,CAAA,KAAQ,CACN,MAAM,IAAI,KAAA,CAAM,yBAAyBC,CAAQ,CAAA,CAAE,CACrD,CAEF,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyBA,CAAQ,EAAE,CACvD,CACF,CAUA,SAASC,GAAWF,CAAAA,CAA2B,CAC7C,GAAI,OAAO,WAAA,CAAgB,IAEzB,OAAO,IAAI,WAAA,CAAY,OAAO,EAAE,MAAA,CAAOA,CAAK,CAAA,CAI9C,IAAIO,EAAS,EAAA,CACTxB,CAAAA,CAAI,CAAA,CAER,KAAOA,EAAIiB,CAAAA,CAAM,MAAA,EAAQ,CACvB,IAAMQ,CAAAA,CAAQR,EAAMjB,CAAAA,EAAG,CAAA,CAEvB,GAAIyB,CAAAA,CAAQ,IAEVD,CAAAA,EAAU,MAAA,CAAO,YAAA,CAAaC,CAAK,UAC1BA,CAAAA,CAAQ,GAAA,CAAM,CAEvB,IAAMC,EAAQT,CAAAA,CAAMjB,CAAAA,EAAG,EACvBwB,CAAAA,EAAU,MAAA,CAAO,cAAeC,CAAAA,CAAQ,EAAA,GAAS,CAAA,CAAMC,CAAAA,CAAQ,EAAK,EACtE,CAAA,KAAA,GAAWD,CAAAA,CAAQ,GAAA,CAAM,CAEvB,IAAMC,CAAAA,CAAQT,CAAAA,CAAMjB,CAAAA,EAAG,EACjB2B,CAAAA,CAAQV,CAAAA,CAAMjB,GAAG,CAAA,CACvBwB,CAAAA,EAAU,OAAO,YAAA,CAAA,CACbC,CAAAA,CAAQ,EAAA,GAAS,EAAA,CAAA,CAAQC,EAAQ,EAAA,GAAS,CAAA,CAAMC,CAAAA,CAAQ,EAC5D,EACF,CAAA,KAAO,CAEL,IAAMD,CAAAA,CAAQT,EAAMjB,CAAAA,EAAG,CAAA,CACjB2B,EAAQV,CAAAA,CAAMjB,CAAAA,EAAG,EACjB4B,CAAAA,CAAQX,CAAAA,CAAMjB,CAAAA,EAAG,CAAA,CACnB6B,GACAJ,CAAAA,CAAQ,CAAA,GAAS,EAAA,CAAA,CACjBC,CAAAA,CAAQ,KAAS,EAAA,CAAA,CACjBC,CAAAA,CAAQ,EAAA,GAAS,CAAA,CAClBC,EAAQ,EAAA,CACXC,CAAAA,EAAa,MACbL,CAAAA,EAAU,MAAA,CAAO,aACf,KAAA,EAAUK,CAAAA,EAAa,EAAA,CAAA,CACvB,KAAA,EAAUA,EAAY,IAAA,CACxB,EACF,CACF,CAEA,OAAOL,CACT,CAUA,SAASJ,EAAAA,CAAYH,EAA2B,CAC9C,IAAIO,EAAS,EAAA,CACb,IAAA,IAASxB,EAAI,CAAA,CAAGA,CAAAA,CAAIiB,CAAAA,CAAM,MAAA,CAAQjB,IAChCwB,CAAAA,EAAU,MAAA,CAAO,YAAA,CAAaP,CAAAA,CAAMjB,CAAC,CAAA,CAAI,GAAI,CAAA,CAE/C,OAAOwB,CACT,CAUA,SAASD,GAAaN,CAAAA,CAA2B,CAC/C,IAAIO,CAAAA,CAAS,EAAA,CACb,IAAA,IAASxB,CAAAA,CAAI,EAAGA,CAAAA,CAAIiB,CAAAA,CAAM,MAAA,CAAQjB,CAAAA,EAAAA,CAChCwB,GAAU,MAAA,CAAO,YAAA,CAAaP,CAAAA,CAAMjB,CAAC,CAAC,CAAA,CAExC,OAAOwB,CACT,CAUA,SAASH,GAAcJ,CAAAA,CAA2B,CAChD,GAAI,OAAO,YAAgB,GAAA,CAEzB,OAAO,IAAI,WAAA,CAAY,UAAU,CAAA,CAAE,MAAA,CAAOA,CAAK,CAAA,CAGjD,IAAIO,CAAAA,CAAS,EAAA,CACb,QAASxB,CAAAA,CAAI,CAAA,CAAGA,EAAIiB,CAAAA,CAAM,MAAA,CAAQjB,CAAAA,EAAK,CAAA,CAAG,CACxC,IAAM8B,CAAAA,CAAWb,CAAAA,CAAMjB,CAAC,EAAKiB,CAAAA,CAAMjB,CAAAA,CAAI,CAAC,CAAA,EAAK,EAC7CwB,CAAAA,EAAU,MAAA,CAAO,aAAaM,CAAQ,EACxC,CACA,OAAON,CACT,CAUA,SAASF,GAAcL,CAAAA,CAA2B,CAChD,GAAI,OAAO,YAAgB,GAAA,CAEzB,OAAO,IAAI,WAAA,CAAY,UAAU,CAAA,CAAE,MAAA,CAAOA,CAAK,CAAA,CAGjD,IAAIO,EAAS,EAAA,CACb,IAAA,IAASxB,CAAAA,CAAI,CAAA,CAAGA,EAAIiB,CAAAA,CAAM,MAAA,CAAQjB,CAAAA,EAAK,CAAA,CAAG,CACxC,IAAM8B,CAAAA,CAAYb,CAAAA,CAAMjB,CAAC,GAAK,CAAA,CAAKiB,CAAAA,CAAMjB,EAAI,CAAC,CAAA,CAC9CwB,GAAU,MAAA,CAAO,YAAA,CAAaM,CAAQ,EACxC,CACA,OAAON,CACT,CCjKO,IAAMO,GAAN,MAAMC,CAAa,CAWxB,WAAA,CAAYC,EAAkC,CAR9C,IAAA,CAAQC,EAAe,CAAA,CACvB,IAAA,CAAQC,EAAgB,CAAA,CACxB,IAAA,CAAQC,CAAAA,CAAoB,CAAA,CAOtBH,aAAkB,WAAA,EACpB,IAAA,CAAK,MAAA,CAAS,IAAI,WAAWA,CAAM,CAAA,CACnC,IAAA,CAAK,IAAA,CAAO,IAAI,QAAA,CAASA,CAAM,IAE/B,IAAA,CAAK,MAAA,CAASA,EACd,IAAA,CAAK,IAAA,CAAO,IAAI,QAAA,CACdA,EAAO,MAAA,CACPA,CAAAA,CAAO,UAAA,CACPA,CAAAA,CAAO,UACT,CAAA,EAEJ,CAKA,IAAI,GAAA,EAAc,CAChB,OAAO,IAAA,CAAKC,CACd,CAEA,IAAI,IAAIG,CAAAA,CAAe,CACrB,IAAA,CAAKH,CAAAA,CAAOG,EACZ,IAAA,CAAKD,CAAAA,CAAY,EACnB,CAKA,IAAI,IAAA,EAAe,CACjB,OAAO,IAAA,CAAK,OAAO,MACrB,CAKA,OAAiB,CACf,OAAO,KAAKF,CAAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,MAClC,CAMA,IAAA,CAAKI,CAAAA,CAAmB,CACtB,GAAIA,EAAM,CAAA,EAAKA,CAAAA,CAAM,IAAA,CAAK,MAAA,CAAO,OAC/B,MAAM,IAAI,MAAM,CAAA,uBAAA,EAA0BA,CAAG,EAAE,CAAA,CAEjD,IAAA,CAAK,GAAA,CAAMA,EACb,CAMQ,WAAA,CAAYC,CAAAA,CAAqB,CACvC,GAAI,KAAKL,CAAAA,CAAOK,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,OAClC,MAAM,IAAI5B,GACR,CAAA,UAAA,EAAa4B,CAAK,sBAAsB,IAAA,CAAKL,CAAI,CAAA,WAAA,EAC/C,IAAA,CAAK,OAAO,MAAA,CAAS,IAAA,CAAKA,CAC5B,CAAA,gBAAA,CAAA,CACA,KAAKA,CACP,CAEJ,CAOA,MAAA,EAAiB,CACf,OAAA,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CACX,IAAA,CAAK,OAAO,IAAA,CAAKA,CAAAA,EAAM,CAChC,CAKA,UAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,EAClB,IAAMG,CAAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,UAAU,IAAA,CAAKH,CAAAA,CAAM,IAAI,CAAA,CACjD,OAAA,IAAA,CAAKA,GAAQ,CAAA,CACNG,CACT,CAKA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,SAAA,CAAU,KAAKH,CAAAA,CAAM,KAAK,EAClD,OAAA,IAAA,CAAKA,CAAAA,EAAQ,EACNG,CACT,CAKA,QAAA,EAAmB,CACjB,KAAK,WAAA,CAAY,CAAC,EAClB,IAAMA,CAAAA,CAAQ,KAAK,IAAA,CAAK,SAAA,CAAU,IAAA,CAAKH,CAAAA,CAAM,IAAI,CAAA,CACjD,OAAA,IAAA,CAAKA,GAAQ,CAAA,CACNG,CACT,CAKA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,KAAK,SAAA,CAAU,IAAA,CAAKH,CAAAA,CAAM,KAAK,EAClD,OAAA,IAAA,CAAKA,CAAAA,EAAQ,EACNG,CACT,CAMA,UAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,EAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,aAAa,IAAA,CAAKH,CAAAA,CAAM,IAAI,CAAA,CACpD,YAAKA,CAAAA,EAAQ,CAAA,CACNG,CACT,CAMA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,KAAKH,CAAAA,CAAM,KAAK,CAAA,CACrD,OAAA,IAAA,CAAKA,GAAQ,CAAA,CACNG,CACT,CAOA,MAAA,EAAiB,CACf,YAAK,WAAA,CAAY,CAAC,CAAA,CACX,IAAA,CAAK,KAAK,OAAA,CAAQ,IAAA,CAAKH,CAAAA,EAAM,CACtC,CAKA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMG,EAAQ,IAAA,CAAK,IAAA,CAAK,SAAS,IAAA,CAAKH,CAAAA,CAAM,IAAI,CAAA,CAChD,YAAKA,CAAAA,EAAQ,CAAA,CACNG,CACT,CAKA,UAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,EAClB,IAAMA,CAAAA,CAAQ,KAAK,IAAA,CAAK,QAAA,CAAS,KAAKH,CAAAA,CAAM,KAAK,CAAA,CACjD,OAAA,IAAA,CAAKA,GAAQ,CAAA,CACNG,CACT,CAKA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,KAAK,QAAA,CAAS,IAAA,CAAKH,EAAM,IAAI,CAAA,CAChD,OAAA,IAAA,CAAKA,CAAAA,EAAQ,EACNG,CACT,CAKA,QAAA,EAAmB,CACjB,KAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,EAAQ,IAAA,CAAK,IAAA,CAAK,SAAS,IAAA,CAAKH,CAAAA,CAAM,KAAK,CAAA,CACjD,OAAA,IAAA,CAAKA,CAAAA,EAAQ,CAAA,CACNG,CACT,CAMA,QAAA,EAAmB,CACjB,IAAA,CAAK,YAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,KAAK,IAAA,CAAK,WAAA,CAAY,KAAKH,CAAAA,CAAM,IAAI,EACnD,OAAA,IAAA,CAAKA,CAAAA,EAAQ,CAAA,CACNG,CACT,CAMA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,KAAK,WAAA,CAAY,IAAA,CAAKH,EAAM,KAAK,CAAA,CACpD,YAAKA,CAAAA,EAAQ,CAAA,CACNG,CACT,CAOA,UAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,EAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,WAAW,IAAA,CAAKH,CAAAA,CAAM,IAAI,CAAA,CAClD,OAAA,IAAA,CAAKA,GAAQ,CAAA,CACNG,CACT,CAKA,QAAA,EAAmB,CACjB,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,KAAKH,CAAAA,CAAM,KAAK,EACnD,OAAA,IAAA,CAAKA,CAAAA,EAAQ,EACNG,CACT,CAKA,QAAA,EAAmB,CACjB,KAAK,WAAA,CAAY,CAAC,CAAA,CAClB,IAAMA,EAAQ,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,IAAA,CAAKH,EAAM,IAAI,CAAA,CAClD,YAAKA,CAAAA,EAAQ,CAAA,CACNG,CACT,CAKA,QAAA,EAAmB,CACjB,IAAA,CAAK,YAAY,CAAC,CAAA,CAClB,IAAMA,CAAAA,CAAQ,KAAK,IAAA,CAAK,UAAA,CAAW,IAAA,CAAKH,CAAAA,CAAM,KAAK,CAAA,CACnD,OAAA,IAAA,CAAKA,GAAQ,CAAA,CACNG,CACT,CAQA,SAAA,CAAUG,CAAAA,CAA4B,CACpC,IAAA,CAAK,YAAYA,CAAM,CAAA,CACvB,IAAMvB,CAAAA,CAAQ,KAAK,MAAA,CAAO,KAAA,CAAM,IAAA,CAAKiB,CAAAA,CAAM,KAAKA,CAAAA,CAAOM,CAAM,EAC7D,OAAA,IAAA,CAAKN,CAAAA,EAAQM,EACNvB,CACT,CAKA,aAAA,EAA4B,CAC1B,IAAMA,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,KAAKiB,CAAI,CAAA,CACzC,OAAA,IAAA,CAAKA,CAAAA,CAAO,KAAK,MAAA,CAAO,MAAA,CACjBjB,CACT,CASA,aAAA,CACEwB,EACAC,CAAAA,CAAmB,KAAA,CACnBC,CAAAA,CAAmB,IAAA,CACnBC,EAAoB,IAAA,CACR,CACZ,IAAMjD,CAAAA,CAAQ,KAAKuC,CAAAA,CACftC,CAAAA,CAAMD,CAAAA,CAGV,KAAOC,EAAM,IAAA,CAAK,MAAA,CAAO,QAAU,IAAA,CAAK,MAAA,CAAOA,CAAG,CAAA,GAAM6C,CAAAA,EACtD7C,CAAAA,EAAAA,CAIF,IAAMiD,EAAYjD,CAAAA,CAAM,IAAA,CAAK,MAAA,CAAO,MAAA,CAEpC,GAAI,CAACiD,CAAAA,EAAaD,CAAAA,CAChB,MAAM,IAAIjC,EAAAA,CACR,CAAA,gBAAA,EAAmB8B,CAAI,CAAA,+BAAA,CAAA,CACvB,IAAA,CAAKP,CACP,CAAA,CAIF,IAAMY,CAAAA,CAAaJ,CAAAA,EAAWG,EAAYjD,CAAAA,CAAM,CAAA,CAAIA,CAAAA,CAC9CqB,CAAAA,CAAQ,KAAK,MAAA,CAAO,KAAA,CAAMtB,CAAAA,CAAOmD,CAAU,EAGjD,OAAID,CAAAA,EAAaF,EACf,IAAA,CAAKT,CAAAA,CAAOtC,EAAM,CAAA,CAElB,IAAA,CAAKsC,CAAAA,CAAOtC,CAAAA,CAGPqB,CACT,CASA,OAAA,CAAQuB,CAAAA,CAAgBtB,CAAAA,CAAmB,QAAiB,CAC1D,IAAMD,CAAAA,CAAQ,IAAA,CAAK,UAAUuB,CAAM,CAAA,CACnC,OAAOxB,EAAAA,CAAaC,CAAAA,CAAOC,CAAQ,CACrC,CAUA,QAAA,CACEA,CAAAA,CAAmB,QACnBuB,CAAAA,CAAe,CAAA,CACfC,CAAAA,CAAmB,KAAA,CACnBC,EAAmB,IAAA,CACnBC,CAAAA,CAAoB,IAAA,CACZ,CACR,IAAM3B,CAAAA,CAAQ,IAAA,CAAK,cAAcwB,CAAAA,CAAMC,CAAAA,CAASC,EAASC,CAAQ,CAAA,CACjE,OAAO5B,EAAAA,CAAaC,EAAOC,CAAQ,CACrC,CAOA,WAAA,EAAoB,CAClB,IAAA,CAAKkB,CAAAA,CAAY,EACnB,CAMA,cAAcW,CAAAA,CAAmB,CAC/B,GAAIA,CAAAA,CAAI,CAAA,EAAKA,EAAI,EAAA,CACf,MAAM,IAAI,KAAA,CAAM,sBAAsBA,CAAC,CAAA,0BAAA,CAA4B,CAAA,CAGrE,IAAIvB,EAAS,EAAA,CAEb,IAAA,IAASwB,CAAAA,CAAaD,CAAAA,CAAGC,EAAa,CAAA,EAAK,CACrC,KAAKZ,CAAAA,GAAc,CAAA,GACrB,KAAKD,CAAAA,CAAQ,IAAA,CAAK,MAAA,EAAO,CACzB,KAAKC,CAAAA,CAAY,CAAA,CAAA,CAGnB,IAAMa,CAAAA,CAAa,KAAK,GAAA,CAAID,CAAAA,CAAY,IAAA,CAAKZ,CAAS,EAChDc,CAAAA,CAAAA,CAAQ,CAAA,EAAKD,GAAc,CAAA,CAC3BE,CAAAA,CAAQ,KAAKf,CAAAA,CAAYa,CAAAA,CAE/BzB,CAAAA,CACGA,CAAAA,EAAU,OAAOyB,CAAU,CAAA,CAAK,MAAA,CAAQ,IAAA,CAAKd,GAASgB,CAAAA,CAASD,CAAI,CAAA,CAEtE,IAAA,CAAKd,GAAaa,CAAAA,CAClBD,CAAAA,EAAcC,EAChB,CAEA,OAAOzB,CACT,CAMA,aAAA,CAAcuB,CAAAA,CAAmB,CAC/B,GAAIA,CAAAA,CAAI,CAAA,EAAKA,CAAAA,CAAI,EAAA,CACf,MAAM,IAAI,KAAA,CAAM,CAAA,mBAAA,EAAsBA,CAAC,4BAA4B,CAAA,CAGrE,IAAIvB,EAAS,EAAA,CACT4B,CAAAA,CAAS,EAEb,IAAA,IAASJ,CAAAA,CAAaD,CAAAA,CAAGC,CAAAA,CAAa,GAAK,CACrC,IAAA,CAAKZ,CAAAA,GAAc,CAAA,GACrB,KAAKD,CAAAA,CAAQ,IAAA,CAAK,MAAA,EAAO,CACzB,KAAKC,CAAAA,CAAY,CAAA,CAAA,CAGnB,IAAMa,CAAAA,CAAa,IAAA,CAAK,IAAID,CAAAA,CAAY,IAAA,CAAKZ,CAAS,CAAA,CAChDc,GAAQ,CAAA,EAAKD,CAAAA,EAAc,CAAA,CAEjCzB,CAAAA,EAAU,OAAO,IAAA,CAAKW,CAAAA,CAAQe,CAAI,CAAA,EAAK,OAAOE,CAAM,CAAA,CAEpD,KAAKjB,CAAAA,GAAUc,CAAAA,CACf,KAAKb,CAAAA,EAAaa,CAAAA,CAClBD,CAAAA,EAAcC,CAAAA,CACdG,GAAUH,EACZ,CAEA,OAAOzB,CACT,CAOA,SAAA,EAAwB,CACtB,OAAO,IAAA,CAAK,MACd,CAMA,SAAA,CAAU6B,EAA4B,CACpC,IAAA,CAAK,YAAYA,CAAI,CAAA,CACrB,IAAMC,CAAAA,CAAY,KAAK,MAAA,CAAO,KAAA,CAAM,IAAA,CAAKpB,CAAAA,CAAM,KAAKA,CAAAA,CAAOmB,CAAI,CAAA,CAC/D,OAAA,IAAA,CAAKnB,GAAQmB,CAAAA,CACN,IAAIrB,EAAasB,CAAS,CACnC,CACF,ECxJO,IAAMC,EAAAA,CAAgB,CAE3B,KACA,IAAA,CACA,MAAA,CACA,MAAA,CACA,IAAA,CACA,OACA,MAAA,CACA,IAAA,CACA,MAAA,CACA,MAAA,CAEA,KACA,IAAA,CACA,MAAA,CACA,OACA,IAAA,CACA,MAAA,CACA,OACA,IAAA,CACA,MAAA,CACA,MAAA,CAEA,IAAA,CACA,OACA,MAAA,CACA,IAAA,CACA,MAAA,CACA,MAAA,CAEA,MACA,MACF,EAQO,SAASC,EAAAA,CAAcC,EAAuB,CAGnD,OAFK,GAAAF,EAAAA,CAAoC,QAAA,CAASE,CAAI,CAAA,EAElD,QAAA,CAAS,IAAA,CAAKA,CAAI,EAExB,CASO,SAASC,GAAkBD,CAAAA,CAAsC,CACtE,GAAIA,CAAAA,CAAK,QAAA,CAAS,IAAI,CAAA,CAAG,OAAO,IAAA,CAChC,GAAIA,EAAK,QAAA,CAAS,IAAI,EAAG,OAAO,IAElC,CAcO,SAASE,GAAYF,CAAAA,CAAsB,CAChD,OAAIA,CAAAA,CAAK,SAAS,IAAI,CAAA,EAAKA,CAAAA,CAAK,QAAA,CAAS,IAAI,CAAA,CACpCA,CAAAA,CAAK,MAAM,CAAA,CAAG,EAAE,EAElBA,CACT,CAQO,SAASG,EAAAA,CAAcH,EAAuB,CACnD,IAAMI,CAAAA,CAAOF,EAAAA,CAAYF,CAAI,CAAA,CAC7B,OAAO,cAAA,CAAe,IAAA,CAAKI,CAAI,CACjC,CAQO,SAASC,EAAAA,CAAYL,CAAAA,CAAuB,CACjD,IAAMI,CAAAA,CAAOF,EAAAA,CAAYF,CAAI,EAC7B,OAAO,SAAA,CAAU,IAAA,CAAKI,CAAI,CAC5B,CAQO,SAASE,EAAAA,CAAaN,CAAAA,CAAuB,CAClD,OAAOA,CAAAA,GAAS,OAASA,CAAAA,GAAS,MACpC,CC3bA,IAAMO,EAAAA,CAAQ,MAAA,CAAO,GAAA,CAAI,YAAY,CAAA,CAC/BC,EAAAA,CAAM,MAAA,CAAO,GAAA,CAAI,eAAe,CAAA,CAChCC,EAAAA,CAAM,MAAA,CAAO,GAAA,CAAI,UAAU,CAAA,CAC3BC,EAAAA,CAAO,OAAO,GAAA,CAAI,WAAW,EAC7BC,CAAAA,CAAS,MAAA,CAAO,GAAA,CAAI,aAAa,EACjCC,EAAAA,CAAM,MAAA,CAAO,GAAA,CAAI,UAAU,EAC3BC,CAAAA,CAAY,MAAA,CAAO,GAAA,CAAI,gBAAgB,EACvCC,CAAAA,CAAWC,CAAAA,EAAS,CAAC,CAACA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,EAAYA,CAAAA,CAAKF,CAAS,IAAMN,EAAAA,CAC9ES,EAAAA,CAAcD,CAAAA,EAAS,CAAC,CAACA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,EAAYA,EAAKF,CAAS,CAAA,GAAML,GACjFS,EAAAA,CAASF,CAAAA,EAAS,CAAC,CAACA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,UAAYA,CAAAA,CAAKF,CAAS,CAAA,GAAMJ,EAAAA,CAC5ES,EAAUH,CAAAA,EAAS,CAAC,CAACA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,EAAYA,EAAKF,CAAS,CAAA,GAAMH,GAC7ES,CAAAA,CAAYJ,CAAAA,EAAS,CAAC,CAACA,GAAQ,OAAOA,CAAAA,EAAS,QAAA,EAAYA,CAAAA,CAAKF,CAAS,CAAA,GAAMF,CAAAA,CAC/ES,EAAAA,CAASL,CAAAA,EAAS,CAAC,CAACA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,EAAYA,EAAKF,CAAS,CAAA,GAAMD,EAAAA,CAClF,SAASS,EAAaN,CAAAA,CAAM,CACxB,GAAIA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,CACxB,OAAQA,CAAAA,CAAKF,CAAS,CAAA,EAClB,KAAKJ,EAAAA,CACL,KAAKG,GACD,OAAO,KACf,CACJ,OAAO,MACX,CACA,SAASU,CAAAA,CAAOP,CAAAA,CAAM,CAClB,GAAIA,CAAAA,EAAQ,OAAOA,CAAAA,EAAS,SACxB,OAAQA,CAAAA,CAAKF,CAAS,CAAA,EAClB,KAAKN,EAAAA,CACL,KAAKE,EAAAA,CACL,KAAKE,EACL,KAAKC,EAAAA,CACD,OAAO,KACf,CACJ,OAAO,MACX,CACA,IAAMW,GAAaR,CAAAA,EAAAA,CAAUI,CAAAA,CAASJ,CAAI,CAAA,EAAKM,CAAAA,CAAaN,CAAI,CAAA,GAAM,CAAC,CAACA,CAAAA,CAAK,OC/B7E,IAAMS,CAAAA,CAAQ,MAAA,CAAO,aAAa,EAC5BC,EAAAA,CAAO,MAAA,CAAO,eAAe,CAAA,CAC7BC,GAAS,MAAA,CAAO,aAAa,EA+BnC,SAASC,EAAAA,CAAMZ,EAAMa,CAAAA,CAAS,CAC1B,IAAMC,CAAAA,CAAWC,GAAYF,CAAO,CAAA,CAChCZ,EAAAA,CAAWD,CAAI,EACJgB,EAAAA,CAAO,IAAA,CAAMhB,CAAAA,CAAK,QAAA,CAAUc,EAAU,MAAA,CAAO,MAAA,CAAO,CAACd,CAAI,CAAC,CAAC,CAAA,GAC3DW,EAAAA,GACPX,CAAAA,CAAK,QAAA,CAAW,MAGpBgB,EAAAA,CAAO,IAAA,CAAMhB,CAAAA,CAAMc,CAAAA,CAAU,OAAO,MAAA,CAAO,EAAE,CAAC,EACtD,CAKAF,EAAAA,CAAM,MAAQH,CAAAA,CAEdG,EAAAA,CAAM,KAAOF,EAAAA,CAEbE,EAAAA,CAAM,MAAA,CAASD,EAAAA,CACf,SAASK,EAAAA,CAAOC,CAAAA,CAAKjB,CAAAA,CAAMa,CAAAA,CAASK,EAAM,CACtC,IAAMC,CAAAA,CAAOC,EAAAA,CAAYH,EAAKjB,CAAAA,CAAMa,CAAAA,CAASK,CAAI,CAAA,CACjD,GAAIX,EAAOY,CAAI,CAAA,EAAKhB,CAAAA,CAAOgB,CAAI,EAC3B,OAAAE,EAAAA,CAAYJ,CAAAA,CAAKC,CAAAA,CAAMC,CAAI,CAAA,CACpBH,EAAAA,CAAOC,CAAAA,CAAKE,CAAAA,CAAMN,EAASK,CAAI,CAAA,CAE1C,GAAI,OAAOC,CAAAA,EAAS,UAChB,GAAIb,CAAAA,CAAaN,CAAI,CAAA,CAAG,CACpBkB,CAAAA,CAAO,MAAA,CAAO,MAAA,CAAOA,CAAAA,CAAK,OAAOlB,CAAI,CAAC,CAAA,CACtC,IAAA,IAASxE,EAAI,CAAA,CAAGA,CAAAA,CAAIwE,EAAK,KAAA,CAAM,MAAA,CAAQ,EAAExE,CAAAA,CAAG,CACxC,IAAM8F,CAAAA,CAAKN,GAAOxF,CAAAA,CAAGwE,CAAAA,CAAK,KAAA,CAAMxE,CAAC,EAAGqF,CAAAA,CAASK,CAAI,CAAA,CACjD,GAAI,OAAOI,CAAAA,EAAO,QAAA,CACd9F,EAAI8F,CAAAA,CAAK,CAAA,CAAA,KACR,IAAIA,CAAAA,GAAOb,CAAAA,CACZ,OAAOA,CAAAA,CACFa,IAAOX,EAAAA,GACZX,CAAAA,CAAK,KAAA,CAAM,MAAA,CAAOxE,EAAG,CAAC,CAAA,CACtBA,CAAAA,EAAK,CAAA,EAAA,CAEb,CACJ,CAAA,KAAA,GACS2E,CAAAA,CAAOH,CAAI,CAAA,CAAG,CACnBkB,EAAO,MAAA,CAAO,MAAA,CAAOA,CAAAA,CAAK,MAAA,CAAOlB,CAAI,CAAC,CAAA,CACtC,IAAMuB,CAAAA,CAAKP,GAAO,KAAA,CAAOhB,CAAAA,CAAK,GAAA,CAAKa,CAAAA,CAASK,CAAI,CAAA,CAChD,GAAIK,IAAOd,CAAAA,CACP,OAAOA,EACFc,CAAAA,GAAOZ,EAAAA,GACZX,CAAAA,CAAK,GAAA,CAAM,MACf,IAAMwB,CAAAA,CAAKR,EAAAA,CAAO,OAAA,CAAShB,EAAK,KAAA,CAAOa,CAAAA,CAASK,CAAI,CAAA,CACpD,GAAIM,CAAAA,GAAOf,CAAAA,CACP,OAAOA,CAAAA,CACFe,CAAAA,GAAOb,KACZX,CAAAA,CAAK,KAAA,CAAQ,IAAA,EACrB,CAAA,CAEJ,OAAOmB,CACX,CAwFA,SAASJ,EAAAA,CAAYF,EAAS,CAC1B,OAAI,OAAOA,CAAAA,EAAY,QAAA,GAClBA,EAAQ,UAAA,EAAcA,CAAAA,CAAQ,IAAA,EAAQA,CAAAA,CAAQ,OACxC,MAAA,CAAO,MAAA,CAAO,CACjB,KAAA,CAAOA,CAAAA,CAAQ,KACf,GAAA,CAAKA,CAAAA,CAAQ,IAAA,CACb,MAAA,CAAQA,EAAQ,IAAA,CAChB,GAAA,CAAKA,CAAAA,CAAQ,IACjB,EAAGA,CAAAA,CAAQ,KAAA,EAAS,CAChB,GAAA,CAAKA,EAAQ,KAAA,CACb,MAAA,CAAQA,EAAQ,KAAA,CAChB,GAAA,CAAKA,EAAQ,KACjB,CAAA,CAAGA,CAAAA,CAAQ,UAAA,EAAc,CACrB,GAAA,CAAKA,CAAAA,CAAQ,UAAA,CACb,GAAA,CAAKA,EAAQ,UACjB,CAAA,CAAGA,CAAO,CAAA,CAEPA,CACX,CACA,SAASO,GAAYH,CAAAA,CAAKjB,CAAAA,CAAMa,EAASK,CAAAA,CAAM,CAC3C,GAAI,OAAOL,GAAY,UAAA,CACnB,OAAOA,CAAAA,CAAQI,CAAAA,CAAKjB,EAAMkB,CAAI,CAAA,CAClC,GAAIhB,EAAAA,CAAMF,CAAI,CAAA,CACV,OAAOa,EAAQ,GAAA,GAAMI,CAAAA,CAAKjB,EAAMkB,CAAI,CAAA,CACxC,GAAIb,EAAAA,CAAML,CAAI,CAAA,CACV,OAAOa,CAAAA,CAAQ,GAAA,GAAMI,EAAKjB,CAAAA,CAAMkB,CAAI,CAAA,CACxC,GAAIf,EAAOH,CAAI,CAAA,CACX,OAAOa,CAAAA,CAAQ,IAAA,GAAOI,EAAKjB,CAAAA,CAAMkB,CAAI,CAAA,CACzC,GAAId,EAASJ,CAAI,CAAA,CACb,OAAOa,CAAAA,CAAQ,SAASI,CAAAA,CAAKjB,CAAAA,CAAMkB,CAAI,CAAA,CAC3C,GAAInB,CAAAA,CAAQC,CAAI,EACZ,OAAOa,CAAAA,CAAQ,QAAQI,CAAAA,CAAKjB,CAAAA,CAAMkB,CAAI,CAE9C,CACA,SAASG,EAAAA,CAAYJ,CAAAA,CAAKC,CAAAA,CAAMlB,EAAM,CAClC,IAAMyB,CAAAA,CAASP,CAAAA,CAAKA,EAAK,MAAA,CAAS,CAAC,EACnC,GAAIZ,CAAAA,CAAamB,CAAM,CAAA,CACnBA,CAAAA,CAAO,KAAA,CAAMR,CAAG,EAAIjB,CAAAA,CAAAA,KAAAA,GAEfG,CAAAA,CAAOsB,CAAM,CAAA,CACdR,IAAQ,KAAA,CACRQ,CAAAA,CAAO,GAAA,CAAMzB,CAAAA,CAEbyB,EAAO,KAAA,CAAQzB,CAAAA,CAAAA,KAAAA,GAEdC,GAAWwB,CAAM,CAAA,CACtBA,EAAO,QAAA,CAAWzB,CAAAA,CAAAA,KAEjB,CACD,IAAM0B,EAAK3B,CAAAA,CAAQ0B,CAAM,CAAA,CAAI,OAAA,CAAU,SACvC,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4BC,CAAE,CAAA,OAAA,CAAS,CAC3D,CACJ,CCnOA,IAAMC,GAAc,CAChB,GAAA,CAAK,KAAA,CACL,GAAA,CAAK,MACL,GAAA,CAAK,KAAA,CACL,GAAA,CAAK,KAAA,CACL,IAAK,KAAA,CACL,GAAA,CAAK,KACT,CAAA,CACMC,GAAiBC,CAAAA,EAAOA,CAAAA,CAAG,QAAQ,YAAA,CAAcC,CAAAA,EAAMH,GAAYG,CAAE,CAAC,CAAA,CACtEC,EAAAA,CAAN,MAAMC,CAAW,CACb,WAAA,CAAYC,CAAAA,CAAMC,EAAM,CAKpB,IAAA,CAAK,QAAA,CAAW,IAAA,CAEhB,KAAK,MAAA,CAAS,KAAA,CACd,KAAK,IAAA,CAAO,MAAA,CAAO,OAAO,EAAC,CAAGF,CAAAA,CAAW,WAAA,CAAaC,CAAI,CAAA,CAC1D,IAAA,CAAK,IAAA,CAAO,MAAA,CAAO,OAAO,EAAC,CAAGD,CAAAA,CAAW,WAAA,CAAaE,CAAI,EAC9D,CACA,OAAQ,CACJ,IAAMC,EAAO,IAAIH,CAAAA,CAAW,IAAA,CAAK,IAAA,CAAM,KAAK,IAAI,CAAA,CAChD,OAAAG,CAAAA,CAAK,SAAW,IAAA,CAAK,QAAA,CACdA,CACX,CAKA,YAAa,CACT,IAAMC,EAAM,IAAIJ,CAAAA,CAAW,KAAK,IAAA,CAAM,IAAA,CAAK,IAAI,CAAA,CAC/C,OAAQ,IAAA,CAAK,IAAA,CAAK,OAAA,EACd,KAAK,KAAA,CACD,IAAA,CAAK,cAAA,CAAiB,IAAA,CACtB,MACJ,KAAK,KAAA,CACD,KAAK,cAAA,CAAiB,KAAA,CACtB,KAAK,IAAA,CAAO,CACR,QAAA,CAAUA,CAAAA,CAAW,YAAY,QAAA,CACjC,OAAA,CAAS,KACb,CAAA,CACA,KAAK,IAAA,CAAO,MAAA,CAAO,MAAA,CAAO,GAAIA,CAAAA,CAAW,WAAW,EACpD,KACR,CACA,OAAOI,CACX,CAKA,GAAA,CAAIC,CAAAA,CAAMC,EAAS,CACX,IAAA,CAAK,cAAA,GACL,IAAA,CAAK,KAAO,CAAE,QAAA,CAAUN,CAAAA,CAAW,WAAA,CAAY,SAAU,OAAA,CAAS,KAAM,EACxE,IAAA,CAAK,IAAA,CAAO,OAAO,MAAA,CAAO,EAAC,CAAGA,CAAAA,CAAW,WAAW,CAAA,CACpD,IAAA,CAAK,cAAA,CAAiB,KAAA,CAAA,CAE1B,IAAMO,CAAAA,CAAQF,CAAAA,CAAK,IAAA,EAAK,CAAE,MAAM,QAAQ,CAAA,CAClCG,EAAOD,CAAAA,CAAM,KAAA,GACnB,OAAQC,CAAAA,EACJ,KAAK,OAAQ,CACT,GAAID,CAAAA,CAAM,MAAA,GAAW,IACjBD,CAAAA,CAAQ,CAAA,CAAG,iDAAiD,CAAA,CACxDC,EAAM,MAAA,CAAS,CAAA,CAAA,CACf,OAAO,MAAA,CAEf,GAAM,CAACE,CAAAA,CAAQC,CAAM,CAAA,CAAIH,CAAAA,CACzB,YAAK,IAAA,CAAKE,CAAM,CAAA,CAAIC,CAAAA,CACb,IACX,CACA,KAAK,OAAA,CAAS,CAEV,GADA,IAAA,CAAK,IAAA,CAAK,SAAW,IAAA,CACjBH,CAAAA,CAAM,SAAW,CAAA,CACjB,OAAAD,CAAAA,CAAQ,CAAA,CAAG,iDAAiD,CAAA,CACrD,KAAA,CAEX,GAAM,CAACK,CAAO,CAAA,CAAIJ,CAAAA,CAClB,GAAII,CAAAA,GAAY,OAASA,CAAAA,GAAY,KAAA,CACjC,YAAK,IAAA,CAAK,OAAA,CAAUA,EACb,IAAA,CAEN,CACD,IAAMC,CAAAA,CAAU,aAAa,IAAA,CAAKD,CAAO,CAAA,CACzC,OAAAL,EAAQ,CAAA,CAAG,CAAA,yBAAA,EAA4BK,CAAO,CAAA,CAAA,CAAIC,CAAO,CAAA,CAClD,KACX,CACJ,CACA,QACI,OAAAN,CAAAA,CAAQ,CAAA,CAAG,CAAA,kBAAA,EAAqBE,CAAI,GAAI,IAAI,CAAA,CACrC,KACf,CACJ,CAOA,OAAA,CAAQK,CAAAA,CAAQP,CAAAA,CAAS,CACrB,GAAIO,CAAAA,GAAW,GAAA,CACX,OAAO,GAAA,CACX,GAAIA,EAAO,CAAC,CAAA,GAAM,GAAA,CACd,OAAAP,EAAQ,CAAA,iBAAA,EAAoBO,CAAM,CAAA,CAAE,CAAA,CAC7B,KAEX,GAAIA,CAAAA,CAAO,CAAC,CAAA,GAAM,IAAK,CACnB,IAAMC,EAAWD,CAAAA,CAAO,KAAA,CAAM,EAAG,EAAE,CAAA,CACnC,OAAIC,CAAAA,GAAa,KAAOA,CAAAA,GAAa,IAAA,EACjCR,CAAAA,CAAQ,CAAA,kCAAA,EAAqCO,CAAM,CAAA,YAAA,CAAc,CAAA,CAC1D,IAAA,GAEPA,CAAAA,CAAOA,EAAO,MAAA,CAAS,CAAC,IAAM,GAAA,EAC9BP,CAAAA,CAAQ,iCAAiC,CAAA,CACtCQ,CAAAA,CACX,CACA,GAAM,EAAGL,CAAAA,CAAQM,CAAM,CAAA,CAAIF,EAAO,KAAA,CAAM,iBAAiB,CAAA,CACpDE,CAAAA,EACDT,EAAQ,CAAA,IAAA,EAAOO,CAAM,oBAAoB,CAAA,CAC7C,IAAMH,EAAS,IAAA,CAAK,IAAA,CAAKD,CAAM,CAAA,CAC/B,GAAIC,CAAAA,CACA,GAAI,CACA,OAAOA,EAAS,kBAAA,CAAmBK,CAAM,CAC7C,CAAA,MACOC,EAAO,CACV,OAAAV,EAAQ,MAAA,CAAOU,CAAK,CAAC,CAAA,CACd,IACX,CAEJ,OAAIP,IAAW,GAAA,CACJI,CAAAA,EACXP,CAAAA,CAAQ,CAAA,uBAAA,EAA0BO,CAAM,CAAA,CAAE,CAAA,CACnC,IAAA,CACX,CAKA,UAAUI,CAAAA,CAAK,CACX,OAAW,CAACR,CAAAA,CAAQC,CAAM,CAAA,GAAK,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,CACnD,GAAIO,CAAAA,CAAI,UAAA,CAAWP,CAAM,CAAA,CACrB,OAAOD,CAAAA,CAASb,EAAAA,CAAcqB,EAAI,SAAA,CAAUP,CAAAA,CAAO,MAAM,CAAC,CAAA,CAElE,OAAOO,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAA,CAAMA,EAAM,CAAA,EAAA,EAAKA,CAAG,CAAA,CAAA,CAC1C,CACA,SAASC,CAAAA,CAAK,CACV,IAAM5H,CAAAA,CAAQ,KAAK,IAAA,CAAK,QAAA,CAClB,CAAC,CAAA,MAAA,EAAS,IAAA,CAAK,KAAK,OAAA,EAAW,KAAK,CAAA,CAAE,CAAA,CACtC,EAAC,CACD6H,CAAAA,CAAa,MAAA,CAAO,OAAA,CAAQ,KAAK,IAAI,CAAA,CACvCC,CAAAA,CACJ,GAAIF,GAAOC,CAAAA,CAAW,MAAA,CAAS,GAAK5C,CAAAA,CAAO2C,CAAAA,CAAI,QAAQ,CAAA,CAAG,CACtD,IAAMhB,CAAAA,CAAO,EAAC,CACdtB,EAAAA,CAAMsC,CAAAA,CAAI,QAAA,CAAU,CAACG,CAAAA,CAAMrD,CAAAA,GAAS,CAC5BO,CAAAA,CAAOP,CAAI,CAAA,EAAKA,CAAAA,CAAK,MACrBkC,CAAAA,CAAKlC,CAAAA,CAAK,GAAG,CAAA,CAAI,IAAA,EACzB,CAAC,CAAA,CACDoD,EAAW,MAAA,CAAO,IAAA,CAAKlB,CAAI,EAC/B,MAEIkB,CAAAA,CAAW,EAAC,CAChB,IAAA,GAAW,CAACX,CAAAA,CAAQC,CAAM,IAAKS,CAAAA,CACvBV,CAAAA,GAAW,MAAQC,CAAAA,GAAW,oBAAA,EAAA,CAE9B,CAACQ,CAAAA,EAAOE,EAAS,IAAA,CAAKvB,CAAAA,EAAMA,EAAG,UAAA,CAAWa,CAAM,CAAC,CAAA,GACjDpH,CAAAA,CAAM,IAAA,CAAK,CAAA,KAAA,EAAQmH,CAAM,CAAA,CAAA,EAAIC,CAAM,EAAE,CAAA,CAE7C,OAAOpH,EAAM,IAAA,CAAK;AAAA,CAAI,CAC1B,CACJ,CAAA,CACAyG,EAAAA,CAAW,WAAA,CAAc,CAAE,QAAA,CAAU,KAAA,CAAO,OAAA,CAAS,KAAM,CAAA,CAC3DA,EAAAA,CAAW,YAAc,CAAE,IAAA,CAAM,oBAAqB,CAAA,CCrKtD,SAASuB,EAAAA,CAAcC,EAAQ,CAC3B,GAAI,qBAAA,CAAsB,IAAA,CAAKA,CAAM,CAAA,CAAG,CAEpC,IAAMC,CAAAA,CAAM,CAAA,0DAAA,EADD,IAAA,CAAK,SAAA,CAAUD,CAAM,CAC2C,CAAA,CAAA,CAC3E,MAAM,IAAI,KAAA,CAAMC,CAAG,CACvB,CACA,OAAO,KACX,CACA,SAASC,EAAAA,CAAYC,CAAAA,CAAM,CACvB,IAAMC,CAAAA,CAAU,IAAI,GAAA,CACpB,OAAA/C,EAAAA,CAAM8C,EAAM,CACR,KAAA,CAAML,CAAAA,CAAMrD,CAAAA,CAAM,CACVA,CAAAA,CAAK,QACL2D,CAAAA,CAAQ,GAAA,CAAI3D,CAAAA,CAAK,MAAM,EAC/B,CACJ,CAAC,CAAA,CACM2D,CACX,CAEA,SAASC,EAAAA,CAAclB,CAAAA,CAAQmB,EAAS,CACpC,IAAA,IAASrI,CAAAA,CAAI,CAAA,EAAS,EAAEA,CAAAA,CAAG,CACvB,IAAMgH,CAAAA,CAAO,CAAA,EAAGE,CAAM,CAAA,EAAGlH,CAAC,GAC1B,GAAI,CAACqI,CAAAA,CAAQ,GAAA,CAAIrB,CAAI,CAAA,CACjB,OAAOA,CACf,CACJ,CACA,SAASsB,EAAAA,CAAkBZ,CAAAA,CAAKR,EAAQ,CACpC,IAAMqB,CAAAA,CAAe,EAAC,CAChBC,CAAAA,CAAgB,IAAI,GAAA,CACtBC,CAAAA,CAAc,IAAA,CAClB,OAAO,CACH,QAAA,CAAWpB,GAAW,CAClBkB,CAAAA,CAAa,IAAA,CAAKlB,CAAM,CAAA,CACxBoB,CAAAA,GAAgBA,EAAcR,EAAAA,CAAYP,CAAG,CAAA,CAAA,CAC7C,IAAMK,CAAAA,CAASK,EAAAA,CAAclB,EAAQuB,CAAW,CAAA,CAChD,OAAAA,CAAAA,CAAY,GAAA,CAAIV,CAAM,EACfA,CACX,CAAA,CAMA,UAAA,CAAY,IAAM,CACd,IAAA,IAAWV,KAAUkB,CAAAA,CAAc,CAC/B,IAAMG,CAAAA,CAAMF,CAAAA,CAAc,GAAA,CAAInB,CAAM,CAAA,CACpC,GAAI,OAAOqB,CAAAA,EAAQ,QAAA,EACfA,CAAAA,CAAI,SACH9D,CAAAA,CAAS8D,CAAAA,CAAI,IAAI,CAAA,EAAK5D,CAAAA,CAAa4D,CAAAA,CAAI,IAAI,CAAA,CAAA,CAC5CA,CAAAA,CAAI,IAAA,CAAK,MAAA,CAASA,CAAAA,CAAI,MAAA,CAAA,KAErB,CACD,IAAMlB,CAAAA,CAAQ,IAAI,KAAA,CAAM,4DAA4D,CAAA,CACpF,MAAAA,CAAAA,CAAM,MAAA,CAASH,CAAAA,CACTG,CACV,CACJ,CACJ,EACA,aAAA,CAAAgB,CACJ,CACJ,CC7DA,SAASG,EAAAA,CAAaC,EAASC,CAAAA,CAAKpD,CAAAA,CAAKqD,CAAAA,CAAK,CAC1C,GAAIA,CAAAA,EAAO,OAAOA,CAAAA,EAAQ,QAAA,CACtB,GAAI,KAAA,CAAM,OAAA,CAAQA,CAAG,EACjB,IAAA,IAAS9I,CAAAA,CAAI,CAAA,CAAG+I,CAAAA,CAAMD,CAAAA,CAAI,MAAA,CAAQ9I,EAAI+I,CAAAA,CAAK,EAAE/I,CAAAA,CAAG,CAC5C,IAAMgJ,CAAAA,CAAKF,EAAI9I,CAAC,CAAA,CACViJ,CAAAA,CAAKN,EAAAA,CAAaC,CAAAA,CAASE,CAAAA,CAAK,OAAO9I,CAAC,CAAA,CAAGgJ,CAAE,CAAA,CAE/CC,CAAAA,GAAO,MAAA,CACP,OAAOH,CAAAA,CAAI9I,CAAC,CAAA,CACPiJ,CAAAA,GAAOD,CAAAA,GACZF,CAAAA,CAAI9I,CAAC,CAAA,CAAIiJ,CAAAA,EACjB,CAAA,KAAA,GAEKH,CAAAA,YAAe,GAAA,CACpB,IAAA,IAAWI,KAAK,KAAA,CAAM,IAAA,CAAKJ,CAAAA,CAAI,IAAA,EAAM,CAAA,CAAG,CACpC,IAAME,CAAAA,CAAKF,CAAAA,CAAI,GAAA,CAAII,CAAC,CAAA,CACdD,EAAKN,EAAAA,CAAaC,CAAAA,CAASE,CAAAA,CAAKI,CAAAA,CAAGF,CAAE,CAAA,CACvCC,IAAO,MAAA,CACPH,CAAAA,CAAI,MAAA,CAAOI,CAAC,CAAA,CACPD,CAAAA,GAAOD,GACZF,CAAAA,CAAI,GAAA,CAAII,CAAAA,CAAGD,CAAE,EACrB,CAAA,KAAA,GAEKH,aAAe,GAAA,CACpB,IAAA,IAAWE,CAAAA,IAAM,KAAA,CAAM,IAAA,CAAKF,CAAG,EAAG,CAC9B,IAAMG,CAAAA,CAAKN,EAAAA,CAAaC,CAAAA,CAASE,CAAAA,CAAKE,EAAIA,CAAE,CAAA,CACxCC,CAAAA,GAAO,MAAA,CACPH,CAAAA,CAAI,MAAA,CAAOE,CAAE,CAAA,CACRC,CAAAA,GAAOD,CAAAA,GACZF,CAAAA,CAAI,MAAA,CAAOE,CAAE,EACbF,CAAAA,CAAI,GAAA,CAAIG,CAAE,CAAA,EAElB,CAAA,KAGA,IAAA,GAAW,CAACC,CAAAA,CAAGF,CAAE,CAAA,GAAK,MAAA,CAAO,OAAA,CAAQF,CAAG,EAAG,CACvC,IAAMG,CAAAA,CAAKN,EAAAA,CAAaC,CAAAA,CAASE,CAAAA,CAAKI,EAAGF,CAAE,CAAA,CACvCC,CAAAA,GAAO,MAAA,CACP,OAAOH,CAAAA,CAAII,CAAC,CAAA,CACPD,CAAAA,GAAOD,CAAAA,GACZF,CAAAA,CAAII,CAAC,CAAA,CAAID,GACjB,CAGR,OAAOL,CAAAA,CAAQ,IAAA,CAAKC,CAAAA,CAAKpD,CAAAA,CAAKqD,CAAG,CACrC,CCxCA,SAASK,CAAAA,CAAK9G,CAAAA,CAAO+G,CAAAA,CAAKC,EAAK,CAE3B,GAAI,KAAA,CAAM,OAAA,CAAQhH,CAAK,CAAA,CACnB,OAAOA,CAAAA,CAAM,GAAA,CAAI,CAACiH,CAAAA,CAAGtJ,CAAAA,GAAMmJ,CAAAA,CAAKG,EAAG,MAAA,CAAOtJ,CAAC,CAAA,CAAGqJ,CAAG,CAAC,CAAA,CACtD,GAAIhH,CAAAA,EAAS,OAAOA,CAAAA,CAAM,MAAA,EAAW,UAAA,CAAY,CAE7C,GAAI,CAACgH,CAAAA,EAAO,CAACrE,EAAAA,CAAU3C,CAAK,CAAA,CACxB,OAAOA,CAAAA,CAAM,MAAA,CAAO+G,CAAAA,CAAKC,CAAG,CAAA,CAChC,IAAM3J,EAAO,CAAE,UAAA,CAAY,CAAA,CAAG,KAAA,CAAO,CAAA,CAAG,GAAA,CAAK,MAAU,CAAA,CACvD2J,CAAAA,CAAI,OAAA,CAAQ,GAAA,CAAIhH,CAAAA,CAAO3C,CAAI,EAC3B2J,CAAAA,CAAI,QAAA,CAAWzC,CAAAA,EAAO,CAClBlH,CAAAA,CAAK,GAAA,CAAMkH,EACX,OAAOyC,CAAAA,CAAI,SACf,CAAA,CACA,IAAMzC,CAAAA,CAAMvE,EAAM,MAAA,CAAO+G,CAAAA,CAAKC,CAAG,CAAA,CACjC,OAAIA,CAAAA,CAAI,UACJA,CAAAA,CAAI,QAAA,CAASzC,CAAG,CAAA,CACbA,CACX,CACA,OAAI,OAAOvE,CAAAA,EAAU,QAAA,EAAY,CAACgH,CAAAA,EAAK,IAAA,CAC5B,OAAOhH,CAAK,CAAA,CAChBA,CACX,CC9BA,IAAMkH,EAAAA,CAAN,KAAe,CACX,WAAA,CAAY9F,CAAAA,CAAM,CACd,MAAA,CAAO,cAAA,CAAe,KAAMa,CAAAA,CAAW,CAAE,KAAA,CAAOb,CAAK,CAAC,EAC1D,CAEA,KAAA,EAAQ,CACJ,IAAMkD,CAAAA,CAAO,MAAA,CAAO,MAAA,CAAO,OAAO,cAAA,CAAe,IAAI,CAAA,CAAG,MAAA,CAAO,yBAAA,CAA0B,IAAI,CAAC,CAAA,CAC9F,OAAI,IAAA,CAAK,KAAA,GACLA,CAAAA,CAAK,KAAA,CAAQ,KAAK,KAAA,CAAM,KAAA,EAAM,CAAA,CAC3BA,CACX,CAEA,IAAA,CAAKe,EAAK,CAAE,QAAA,CAAA8B,CAAAA,CAAU,aAAA,CAAAC,CAAAA,CAAe,QAAA,CAAAC,EAAU,OAAA,CAAAd,CAAQ,CAAA,CAAI,EAAC,CAAG,CAC3D,GAAI,CAACnE,EAAAA,CAAWiD,CAAG,CAAA,CACf,MAAM,IAAI,UAAU,iCAAiC,CAAA,CACzD,IAAM2B,CAAAA,CAAM,CACR,OAAA,CAAS,IAAI,GAAA,CACb,GAAA,CAAA3B,CAAAA,CACA,IAAA,CAAM,IAAA,CACN,QAAA,CAAU8B,IAAa,IAAA,CACvB,YAAA,CAAc,KAAA,CACd,aAAA,CAAe,OAAOC,CAAAA,EAAkB,SAAWA,CAAAA,CAAgB,GACvE,CAAA,CACM7C,CAAAA,CAAMuC,CAAAA,CAAK,IAAA,CAAM,GAAIE,CAAG,CAAA,CAC9B,GAAI,OAAOK,CAAAA,EAAa,UAAA,CACpB,OAAW,CAAE,KAAA,CAAAnH,CAAAA,CAAO,GAAA,CAAAqE,CAAI,CAAA,GAAKyC,EAAI,OAAA,CAAQ,MAAA,EAAO,CAC5CK,CAAAA,CAAS9C,CAAAA,CAAKrE,CAAK,EAC3B,OAAO,OAAOqG,CAAAA,EAAY,UAAA,CACpBD,EAAAA,CAAaC,CAAAA,CAAS,CAAE,EAAA,CAAIhC,CAAI,CAAA,CAAG,EAAA,CAAIA,CAAG,CAAA,CAC1CA,CACV,CACJ,CAAA,CC7BA,IAAM+C,EAAAA,CAAN,cAAoBJ,EAAS,CACzB,WAAA,CAAYlC,CAAAA,CAAQ,CAChB,KAAA,CAAMrD,EAAK,CAAA,CACX,KAAK,MAAA,CAASqD,CAAAA,CACd,MAAA,CAAO,cAAA,CAAe,IAAA,CAAM,KAAA,CAAO,CAC/B,GAAA,EAAM,CACF,MAAM,IAAI,KAAA,CAAM,8BAA8B,CAClD,CACJ,CAAC,EACL,CAKA,OAAA,CAAQK,CAAAA,CAAK2B,EAAK,CACd,IAAIO,CAAAA,CACAP,CAAAA,EAAK,iBAAA,CACLO,CAAAA,CAAQP,EAAI,iBAAA,EAGZO,CAAAA,CAAQ,EAAC,CACTxE,EAAAA,CAAMsC,CAAAA,CAAK,CACP,IAAA,CAAM,CAACG,CAAAA,CAAMrD,CAAAA,GAAS,CAAA,CACdD,CAAAA,CAAQC,CAAI,CAAA,EAAKQ,EAAAA,CAAUR,CAAI,CAAA,GAC/BoF,CAAAA,CAAM,IAAA,CAAKpF,CAAI,EACvB,CACJ,CAAC,CAAA,CACG6E,CAAAA,GACAA,CAAAA,CAAI,kBAAoBO,CAAAA,CAAAA,CAAAA,CAEhC,IAAIC,CAAAA,CACJ,IAAA,IAAWrF,CAAAA,IAAQoF,CAAAA,CAAO,CACtB,GAAIpF,CAAAA,GAAS,IAAA,CACT,MACAA,CAAAA,CAAK,MAAA,GAAW,KAAK,MAAA,GACrBqF,CAAAA,CAAQrF,CAAAA,EAChB,CACA,OAAOqF,CACX,CACA,MAAA,CAAOC,CAAAA,CAAMT,CAAAA,CAAK,CACd,GAAI,CAACA,EACD,OAAO,CAAE,MAAA,CAAQ,IAAA,CAAK,MAAO,CAAA,CACjC,GAAM,CAAE,OAAA,CAAAlB,CAAAA,CAAS,GAAA,CAAAT,CAAAA,CAAK,aAAA,CAAA+B,CAAc,CAAA,CAAIJ,CAAAA,CAClChC,CAAAA,CAAS,IAAA,CAAK,OAAA,CAAQK,CAAAA,CAAK2B,CAAG,CAAA,CACpC,GAAI,CAAChC,CAAAA,CAAQ,CACT,IAAMW,EAAM,CAAA,4DAAA,EAA+D,IAAA,CAAK,MAAM,CAAA,CAAA,CACtF,MAAM,IAAI,eAAeA,CAAG,CAChC,CACA,IAAItI,CAAAA,CAAOyI,CAAAA,CAAQ,IAAId,CAAM,CAAA,CAO7B,GANK3H,CAAAA,GAEDyJ,CAAAA,CAAK9B,CAAAA,CAAQ,KAAMgC,CAAG,CAAA,CACtB3J,CAAAA,CAAOyI,CAAAA,CAAQ,GAAA,CAAId,CAAM,GAGzB,CAAC3H,CAAAA,EAAQA,CAAAA,CAAK,GAAA,GAAQ,MAAA,CAAW,CACjC,IAAMsI,CAAAA,CAAM,wDAAA,CACZ,MAAM,IAAI,cAAA,CAAeA,CAAG,CAChC,CACA,GAAIyB,CAAAA,EAAiB,CAAA,GACjB/J,CAAAA,CAAK,KAAA,EAAS,EACVA,CAAAA,CAAK,UAAA,GAAe,CAAA,GACpBA,CAAAA,CAAK,UAAA,CAAaqK,EAAAA,CAAcrC,EAAKL,CAAAA,CAAQc,CAAO,CAAA,CAAA,CACpDzI,CAAAA,CAAK,KAAA,CAAQA,CAAAA,CAAK,WAAa+J,CAAAA,CAAAA,CAAe,CAC9C,IAAMzB,CAAAA,CAAM,8DAAA,CACZ,MAAM,IAAI,cAAA,CAAeA,CAAG,CAChC,CAEJ,OAAOtI,CAAAA,CAAK,GAChB,CACA,QAAA,CAAS2J,CAAAA,CAAKW,CAAAA,CAAYC,CAAAA,CAAc,CACpC,IAAMC,CAAAA,CAAM,CAAA,CAAA,EAAI,IAAA,CAAK,MAAM,CAAA,CAAA,CAC3B,GAAIb,EAAK,CAEL,GADAvB,EAAAA,CAAc,IAAA,CAAK,MAAM,CAAA,CACrBuB,EAAI,OAAA,CAAQ,gBAAA,EAAoB,CAACA,CAAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,KAAK,MAAM,CAAA,CAAG,CAC/D,IAAMrB,CAAAA,CAAM,CAAA,4DAAA,EAA+D,KAAK,MAAM,CAAA,CAAA,CACtF,MAAM,IAAI,KAAA,CAAMA,CAAG,CACvB,CACA,GAAIqB,CAAAA,CAAI,WAAA,CACJ,OAAO,CAAA,EAAGa,CAAG,CAAA,CAAA,CACrB,CACA,OAAOA,CACX,CACJ,CAAA,CACA,SAASH,EAAAA,CAAcrC,CAAAA,CAAKlD,CAAAA,CAAM2D,CAAAA,CAAS,CACvC,GAAI5D,EAAQC,CAAI,CAAA,CAAG,CACf,IAAM6C,CAAAA,CAAS7C,CAAAA,CAAK,QAAQkD,CAAG,CAAA,CACzBK,CAAAA,CAASI,CAAAA,EAAWd,CAAAA,EAAUc,CAAAA,CAAQ,IAAId,CAAM,CAAA,CACtD,OAAOU,CAAAA,CAASA,CAAAA,CAAO,KAAA,CAAQA,EAAO,UAAA,CAAa,CACvD,CAAA,KAAA,GACSjD,CAAAA,CAAaN,CAAI,CAAA,CAAG,CACzB,IAAIjC,CAAAA,CAAQ,CAAA,CACZ,IAAA,IAAW4H,CAAAA,IAAQ3F,CAAAA,CAAK,MAAO,CAC3B,IAAM4F,CAAAA,CAAIL,EAAAA,CAAcrC,CAAAA,CAAKyC,CAAAA,CAAMhC,CAAO,CAAA,CACtCiC,CAAAA,CAAI7H,CAAAA,GACJA,CAAAA,CAAQ6H,CAAAA,EAChB,CACA,OAAO7H,CACX,CAAA,KAAA,GACSoC,CAAAA,CAAOH,CAAI,CAAA,CAAG,CACnB,IAAM6F,CAAAA,CAAKN,EAAAA,CAAcrC,CAAAA,CAAKlD,CAAAA,CAAK,GAAA,CAAK2D,CAAO,EACzCmC,CAAAA,CAAKP,EAAAA,CAAcrC,CAAAA,CAAKlD,CAAAA,CAAK,KAAA,CAAO2D,CAAO,EACjD,OAAO,IAAA,CAAK,GAAA,CAAIkC,CAAAA,CAAIC,CAAE,CAC1B,CACA,OAAO,CACX,CC3GA,IAAMC,EAAAA,CAAiBlI,CAAAA,EAAU,CAACA,CAAAA,EAAU,OAAOA,CAAAA,EAAU,UAAA,EAAc,OAAOA,CAAAA,EAAU,SACtFmI,CAAAA,CAAN,cAAqBjB,EAAS,CAC1B,WAAA,CAAYlH,CAAAA,CAAO,CACf,KAAA,CAAM+B,CAAM,CAAA,CACZ,IAAA,CAAK,KAAA,CAAQ/B,EACjB,CACA,MAAA,CAAO+G,CAAAA,CAAKC,CAAAA,CAAK,CACb,OAAOA,CAAAA,EAAK,KAAO,IAAA,CAAK,KAAA,CAAQF,CAAAA,CAAK,IAAA,CAAK,KAAA,CAAOC,CAAAA,CAAKC,CAAG,CAC7D,CACA,QAAA,EAAW,CACP,OAAO,MAAA,CAAO,KAAK,KAAK,CAC5B,CACJ,CAAA,CACAmB,CAAAA,CAAO,YAAA,CAAe,eACtBA,CAAAA,CAAO,aAAA,CAAgB,eAAA,CACvBA,CAAAA,CAAO,KAAA,CAAQ,OAAA,CACfA,EAAO,YAAA,CAAe,cAAA,CACtBA,CAAAA,CAAO,YAAA,CAAe,cAAA,CCjBtB,IAAMC,GAAmB,oBAAA,CACzB,SAASC,EAAAA,CAAcrI,CAAAA,CAAOsI,CAAAA,CAASjE,CAAAA,CAAM,CACzC,GAAIiE,CAAAA,CAAS,CACT,IAAMC,CAAAA,CAAQlE,CAAAA,CAAK,OAAOmE,CAAAA,EAAKA,CAAAA,CAAE,GAAA,GAAQF,CAAO,CAAA,CAC1CG,CAAAA,CAASF,EAAM,IAAA,CAAKC,CAAAA,EAAK,CAACA,CAAAA,CAAE,MAAM,CAAA,EAAKD,EAAM,CAAC,CAAA,CACpD,GAAI,CAACE,CAAAA,CACD,MAAM,IAAI,KAAA,CAAM,CAAA,IAAA,EAAOH,CAAO,CAAA,UAAA,CAAY,CAAA,CAC9C,OAAOG,CACX,CACA,OAAOpE,CAAAA,CAAK,IAAA,CAAKmE,CAAAA,EAAKA,CAAAA,CAAE,WAAWxI,CAAK,CAAA,EAAK,CAACwI,CAAAA,CAAE,MAAM,CAC1D,CACA,SAASE,EAAAA,CAAW1I,CAAAA,CAAOsI,CAAAA,CAAStB,CAAAA,CAAK,CAGrC,GAFI5E,EAAAA,CAAWpC,CAAK,CAAA,GAChBA,CAAAA,CAAQA,CAAAA,CAAM,QAAA,CAAA,CACd0C,EAAO1C,CAAK,CAAA,CACZ,OAAOA,CAAAA,CACX,GAAIsC,CAAAA,CAAOtC,CAAK,CAAA,CAAG,CACf,IAAM2I,CAAAA,CAAM3B,CAAAA,CAAI,MAAA,CAAOnF,EAAG,CAAA,CAAE,UAAA,GAAamF,CAAAA,CAAI,MAAA,CAAQ,IAAA,CAAMA,CAAG,EAC9D,OAAA2B,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAK3I,CAAK,CAAA,CACb2I,CACX,CAAA,CACI3I,CAAAA,YAAiB,MAAA,EACjBA,CAAAA,YAAiB,MAAA,EACjBA,CAAAA,YAAiB,SAChB,OAAO,MAAA,CAAW,GAAA,EAAeA,CAAAA,YAAiB,MAAA,IAGnDA,CAAAA,CAAQA,EAAM,OAAA,EAAQ,CAAA,CAE1B,GAAM,CAAE,qBAAA,CAAA4I,CAAAA,CAAuB,SAAAvB,CAAAA,CAAU,QAAA,CAAAwB,CAAAA,CAAU,MAAA,CAAAC,CAAAA,CAAQ,aAAA,CAAA3C,CAAc,CAAA,CAAIa,CAAAA,CAGzEX,CAAAA,CACJ,GAAIuC,CAAAA,EAAyB5I,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CAAU,CAE7D,GADAqG,CAAAA,CAAMF,CAAAA,CAAc,IAAInG,CAAK,CAAA,CACzBqG,CAAAA,CACA,OAAAA,CAAAA,CAAI,MAAA,GAAWA,EAAI,MAAA,CAASgB,CAAAA,CAASrH,CAAK,CAAA,CAAA,CACnC,IAAIsH,EAAAA,CAAMjB,EAAI,MAAM,CAAA,CAG3BA,CAAAA,CAAM,CAAE,MAAA,CAAQ,IAAA,CAAM,KAAM,IAAK,CAAA,CACjCF,CAAAA,CAAc,GAAA,CAAInG,CAAAA,CAAOqG,CAAG,EAEpC,CACIiC,CAAAA,EAAS,UAAA,CAAW,IAAI,CAAA,GACxBA,CAAAA,CAAUF,GAAmBE,CAAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,CAAA,CAChD,IAAIG,CAAAA,CAASJ,GAAcrI,CAAAA,CAAOsI,CAAAA,CAASQ,CAAAA,CAAO,IAAI,CAAA,CACtD,GAAI,CAACL,CAAAA,CAAQ,CAKT,GAJIzI,CAAAA,EAAS,OAAOA,CAAAA,CAAM,QAAW,UAAA,GAEjCA,CAAAA,CAAQA,CAAAA,CAAM,MAAA,EAAO,CAAA,CAErB,CAACA,GAAS,OAAOA,CAAAA,EAAU,QAAA,CAAU,CACrC,IAAMmC,CAAAA,CAAO,IAAIgG,CAAAA,CAAOnI,CAAK,CAAA,CAC7B,OAAIqG,CAAAA,GACAA,CAAAA,CAAI,KAAOlE,CAAAA,CAAAA,CACRA,CACX,CACAsG,CAAAA,CACIzI,CAAAA,YAAiB,GAAA,CACX8I,EAAOjH,EAAG,CAAA,CACV,MAAA,CAAO,QAAA,IAAY,MAAA,CAAO7B,CAAK,EAC3B8I,CAAAA,CAAO9G,EAAG,CAAA,CACV8G,CAAAA,CAAOjH,EAAG,EAC5B,CACIgH,CAAAA,GACAA,CAAAA,CAASJ,CAAM,CAAA,CACf,OAAOzB,CAAAA,CAAI,UAEf,IAAM7E,CAAAA,CAAOsG,CAAAA,EAAQ,UAAA,CACfA,CAAAA,CAAO,UAAA,CAAWzB,EAAI,MAAA,CAAQhH,CAAAA,CAAOgH,CAAG,CAAA,CACxC,OAAOyB,CAAAA,EAAQ,WAAW,IAAA,EAAS,UAAA,CAC/BA,CAAAA,CAAO,SAAA,CAAU,IAAA,CAAKzB,CAAAA,CAAI,OAAQhH,CAAAA,CAAOgH,CAAG,CAAA,CAC5C,IAAImB,CAAAA,CAAOnI,CAAK,EAC1B,OAAIsI,CAAAA,CACAnG,CAAAA,CAAK,GAAA,CAAMmG,CAAAA,CACLG,CAAAA,CAAO,UACbtG,CAAAA,CAAK,GAAA,CAAMsG,CAAAA,CAAO,GAAA,CAAA,CAClBpC,CAAAA,GACAA,CAAAA,CAAI,KAAOlE,CAAAA,CAAAA,CACRA,CACX,CCjFA,SAAS4G,EAAAA,CAAmBD,CAAAA,CAAQzF,EAAMrD,CAAAA,CAAO,CAC7C,IAAIiH,CAAAA,CAAIjH,CAAAA,CACR,IAAA,IAASrC,EAAI0F,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAG1F,CAAAA,EAAK,CAAA,CAAG,EAAEA,EAAG,CACvC,IAAMkJ,CAAAA,CAAIxD,CAAAA,CAAK1F,CAAC,CAAA,CAChB,GAAI,OAAOkJ,CAAAA,EAAM,QAAA,EAAY,MAAA,CAAO,SAAA,CAAUA,CAAC,GAAKA,CAAAA,EAAK,CAAA,CAAG,CACxD,IAAMmC,CAAAA,CAAI,GACVA,CAAAA,CAAEnC,CAAC,CAAA,CAAII,CAAAA,CACPA,CAAAA,CAAI+B,EACR,MAEI/B,CAAAA,CAAI,IAAI,GAAA,CAAI,CAAC,CAACJ,CAAAA,CAAGI,CAAC,CAAC,CAAC,EAE5B,CACA,OAAOyB,EAAAA,CAAWzB,EAAG,MAAA,CAAW,CAC5B,qBAAA,CAAuB,KAAA,CACvB,aAAA,CAAe,KAAA,CACf,SAAU,IAAM,CACZ,MAAM,IAAI,KAAA,CAAM,8CAA8C,CAClE,CAAA,CACA,MAAA,CAAA6B,CAAAA,CACA,aAAA,CAAe,IAAI,GACvB,CAAC,CACL,CAGA,IAAMG,EAAAA,CAAe5F,CAAAA,EAASA,CAAAA,EAAQ,MACjC,OAAOA,CAAAA,EAAS,QAAA,EAAY,CAAC,CAACA,CAAAA,CAAK,OAAO,QAAQ,CAAA,EAAE,CAAE,IAAA,EAAK,CAAE,IAAA,CAC5D6F,GAAN,cAAyBhC,EAAS,CAC9B,WAAA,CAAY9F,CAAAA,CAAM0H,CAAAA,CAAQ,CACtB,KAAA,CAAM1H,CAAI,CAAA,CACV,MAAA,CAAO,cAAA,CAAe,IAAA,CAAM,SAAU,CAClC,KAAA,CAAO0H,CAAAA,CACP,YAAA,CAAc,IAAA,CACd,UAAA,CAAY,MACZ,QAAA,CAAU,IACd,CAAC,EACL,CAMA,KAAA,CAAMA,EAAQ,CACV,IAAMxE,CAAAA,CAAO,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,eAAe,IAAI,CAAA,CAAG,MAAA,CAAO,yBAAA,CAA0B,IAAI,CAAC,EAC9F,OAAIwE,CAAAA,GACAxE,CAAAA,CAAK,MAAA,CAASwE,CAAAA,CAAAA,CAClBxE,CAAAA,CAAK,MAAQA,CAAAA,CAAK,KAAA,CAAM,GAAA,CAAI6E,CAAAA,EAAMzG,CAAAA,CAAOyG,CAAE,GAAK7G,CAAAA,CAAO6G,CAAE,CAAA,CAAIA,CAAAA,CAAG,KAAA,CAAML,CAAM,EAAIK,CAAE,CAAA,CAC9E,IAAA,CAAK,KAAA,GACL7E,CAAAA,CAAK,KAAA,CAAQ,KAAK,KAAA,CAAM,KAAA,EAAM,CAAA,CAC3BA,CACX,CAMA,KAAA,CAAMjB,EAAMrD,CAAAA,CAAO,CACf,GAAIiJ,EAAAA,CAAY5F,CAAI,CAAA,CAChB,KAAK,GAAA,CAAIrD,CAAK,CAAA,CAAA,KACb,CACD,GAAM,CAACoD,EAAK,GAAGgG,CAAI,CAAA,CAAI/F,CAAAA,CACjBlB,CAAAA,CAAO,IAAA,CAAK,IAAIiB,CAAAA,CAAK,IAAI,CAAA,CAC/B,GAAIX,CAAAA,CAAaN,CAAI,EACjBA,CAAAA,CAAK,KAAA,CAAMiH,CAAAA,CAAMpJ,CAAK,CAAA,CAAA,KAAA,GACjBmC,CAAAA,GAAS,QAAa,IAAA,CAAK,MAAA,CAChC,IAAA,CAAK,GAAA,CAAIiB,CAAAA,CAAK2F,EAAAA,CAAmB,KAAK,MAAA,CAAQK,CAAAA,CAAMpJ,CAAK,CAAC,CAAA,CAAA,KAE1D,MAAM,IAAI,KAAA,CAAM,CAAA,4BAAA,EAA+BoD,CAAG,CAAA,kBAAA,EAAqBgG,CAAI,CAAA,CAAE,CACrF,CACJ,CAKA,QAAA,CAAS/F,CAAAA,CAAM,CACX,GAAM,CAACD,CAAAA,CAAK,GAAGgG,CAAI,CAAA,CAAI/F,CAAAA,CACvB,GAAI+F,EAAK,MAAA,GAAW,CAAA,CAChB,OAAO,IAAA,CAAK,MAAA,CAAOhG,CAAG,EAC1B,IAAMjB,CAAAA,CAAO,IAAA,CAAK,GAAA,CAAIiB,CAAAA,CAAK,IAAI,EAC/B,GAAIX,CAAAA,CAAaN,CAAI,CAAA,CACjB,OAAOA,CAAAA,CAAK,SAASiH,CAAI,CAAA,CAEzB,MAAM,IAAI,KAAA,CAAM,CAAA,4BAAA,EAA+BhG,CAAG,CAAA,kBAAA,EAAqBgG,CAAI,CAAA,CAAE,CACrF,CAMA,KAAA,CAAM/F,EAAMgG,CAAAA,CAAY,CACpB,GAAM,CAACjG,CAAAA,CAAK,GAAGgG,CAAI,CAAA,CAAI/F,CAAAA,CACjBlB,CAAAA,CAAO,IAAA,CAAK,GAAA,CAAIiB,CAAAA,CAAK,IAAI,CAAA,CAC/B,OAAIgG,CAAAA,CAAK,MAAA,GAAW,CAAA,CACT,CAACC,GAAc9G,CAAAA,CAASJ,CAAI,CAAA,CAAIA,CAAAA,CAAK,KAAA,CAAQA,CAAAA,CAE7CM,EAAaN,CAAI,CAAA,CAAIA,CAAAA,CAAK,KAAA,CAAMiH,CAAAA,CAAMC,CAAU,EAAI,MACnE,CACA,gBAAA,CAAiBC,CAAAA,CAAa,CAC1B,OAAO,KAAK,KAAA,CAAM,KAAA,CAAMnH,CAAAA,EAAQ,CAC5B,GAAI,CAACG,EAAOH,CAAI,CAAA,CACZ,OAAO,MAAA,CACX,IAAMzB,CAAAA,CAAIyB,EAAK,KAAA,CACf,OAAQzB,CAAAA,EAAK,IAAA,EACR4I,CAAAA,EACG/G,CAAAA,CAAS7B,CAAC,CAAA,EACVA,CAAAA,CAAE,KAAA,EAAS,IAAA,EACX,CAACA,CAAAA,CAAE,eACH,CAACA,CAAAA,CAAE,OAAA,EACH,CAACA,CAAAA,CAAE,GACf,CAAC,CACL,CAIA,KAAA,CAAM2C,CAAAA,CAAM,CACR,GAAM,CAACD,CAAAA,CAAK,GAAGgG,CAAI,CAAA,CAAI/F,CAAAA,CACvB,GAAI+F,EAAK,MAAA,GAAW,CAAA,CAChB,OAAO,IAAA,CAAK,GAAA,CAAIhG,CAAG,EACvB,IAAMjB,CAAAA,CAAO,IAAA,CAAK,GAAA,CAAIiB,CAAAA,CAAK,IAAI,EAC/B,OAAOX,CAAAA,CAAaN,CAAI,CAAA,CAAIA,CAAAA,CAAK,KAAA,CAAMiH,CAAI,CAAA,CAAI,KACnD,CAKA,KAAA,CAAM/F,CAAAA,CAAMrD,CAAAA,CAAO,CACf,GAAM,CAACoD,CAAAA,CAAK,GAAGgG,CAAI,CAAA,CAAI/F,EACvB,GAAI+F,CAAAA,CAAK,MAAA,GAAW,CAAA,CAChB,IAAA,CAAK,GAAA,CAAIhG,EAAKpD,CAAK,CAAA,CAAA,KAElB,CACD,IAAMmC,CAAAA,CAAO,IAAA,CAAK,IAAIiB,CAAAA,CAAK,IAAI,CAAA,CAC/B,GAAIX,CAAAA,CAAaN,CAAI,EACjBA,CAAAA,CAAK,KAAA,CAAMiH,CAAAA,CAAMpJ,CAAK,CAAA,CAAA,KAAA,GACjBmC,CAAAA,GAAS,QAAa,IAAA,CAAK,MAAA,CAChC,IAAA,CAAK,GAAA,CAAIiB,CAAAA,CAAK2F,EAAAA,CAAmB,KAAK,MAAA,CAAQK,CAAAA,CAAMpJ,CAAK,CAAC,CAAA,CAAA,KAE1D,MAAM,IAAI,KAAA,CAAM,CAAA,4BAAA,EAA+BoD,CAAG,CAAA,kBAAA,EAAqBgG,CAAI,CAAA,CAAE,CACrF,CACJ,CACJ,CAAA,CCzIA,IAAMG,EAAAA,CAAoBC,CAAAA,EAAQA,EAAI,OAAA,CAAQ,iBAAA,CAAmB,GAAG,CAAA,CACpE,SAASC,EAAAA,CAAcC,EAASC,CAAAA,CAAQ,CACpC,OAAI,OAAA,CAAQ,IAAA,CAAKD,CAAO,EACbA,CAAAA,CAAQ,SAAA,CAAU,CAAC,CAAA,CACvBC,CAAAA,CAASD,CAAAA,CAAQ,QAAQ,YAAA,CAAcC,CAAM,CAAA,CAAID,CAC5D,CACA,IAAME,EAAAA,CAAc,CAACJ,CAAAA,CAAKG,CAAAA,CAAQD,CAAAA,GAAYF,CAAAA,CAAI,QAAA,CAAS;AAAA,CAAI,EACzDC,EAAAA,CAAcC,CAAAA,CAASC,CAAM,CAAA,CAC7BD,EAAQ,QAAA,CAAS;AAAA,CAAI,CAAA,CACjB;AAAA,CAAA,CAAOD,GAAcC,CAAAA,CAASC,CAAM,CAAA,CAAA,CACnCH,CAAAA,CAAI,SAAS,GAAG,CAAA,CAAI,EAAA,CAAK,GAAA,EAAOE,ECjB3C,IAAMG,EAAAA,CAAY,OACZC,EAAAA,CAAa,OAAA,CACbC,GAAc,QAAA,CAMpB,SAASC,EAAAA,CAAcC,CAAAA,CAAMN,EAAQO,CAAAA,CAAO,MAAA,CAAQ,CAAE,aAAA,CAAAC,EAAe,SAAA,CAAAC,CAAAA,CAAY,EAAA,CAAI,eAAA,CAAAC,EAAkB,EAAA,CAAI,MAAA,CAAAC,EAAQ,UAAA,CAAAC,CAAW,EAAI,EAAC,CAAG,CAClI,GAAI,CAACH,CAAAA,EAAaA,CAAAA,CAAY,CAAA,CAC1B,OAAOH,EACPG,CAAAA,CAAYC,CAAAA,GACZA,CAAAA,CAAkB,CAAA,CAAA,CACtB,IAAMG,CAAAA,CAAU,IAAA,CAAK,IAAI,CAAA,CAAIH,CAAAA,CAAiB,EAAID,CAAAA,CAAYT,CAAAA,CAAO,MAAM,CAAA,CAC3E,GAAIM,CAAAA,CAAK,MAAA,EAAUO,EACf,OAAOP,CAAAA,CACX,IAAMQ,CAAAA,CAAQ,EAAC,CACTC,CAAAA,CAAe,EAAC,CAClBnN,CAAAA,CAAM6M,EAAYT,CAAAA,CAAO,MAAA,CACzB,OAAOQ,CAAAA,EAAkB,QAAA,GACrBA,CAAAA,CAAgBC,CAAAA,CAAY,KAAK,GAAA,CAAI,CAAA,CAAGC,CAAe,CAAA,CACvDI,EAAM,IAAA,CAAK,CAAC,CAAA,CAEZlN,CAAAA,CAAM6M,EAAYD,CAAAA,CAAAA,CAE1B,IAAIQ,EACAC,CAAAA,CACAC,CAAAA,CAAW,MACXlN,CAAAA,CAAI,EAAA,CACJmN,CAAAA,CAAW,EAAA,CACXC,EAAS,EAAA,CACTb,CAAAA,GAASJ,KACTnM,CAAAA,CAAIqN,EAAAA,CAAyBf,EAAMtM,CAAAA,CAAGgM,CAAAA,CAAO,MAAM,CAAA,CAC/ChM,IAAM,EAAA,GACNJ,CAAAA,CAAMI,EAAI6M,CAAAA,CAAAA,CAAAA,CAElB,IAAA,IAASvG,EAAKA,CAAAA,CAAKgG,CAAAA,CAAMtM,CAAAA,EAAK,CAAE,GAAK,CACjC,GAAIuM,CAAAA,GAASH,EAAAA,EAAe9F,IAAO,IAAA,CAAM,CAErC,OADA6G,CAAAA,CAAWnN,EACHsM,CAAAA,CAAKtM,CAAAA,CAAI,CAAC,CAAA,EACd,KAAK,GAAA,CACDA,CAAAA,EAAK,CAAA,CACL,MACJ,KAAK,GAAA,CACDA,CAAAA,EAAK,EACL,MACJ,KAAK,IACDA,CAAAA,EAAK,CAAA,CACL,MACJ,QACIA,GAAK,EACb,CACAoN,EAASpN,EACb,CACA,GAAIsG,CAAAA,GAAO;AAAA,CAAA,CACHiG,CAAAA,GAASJ,KACTnM,CAAAA,CAAIqN,EAAAA,CAAyBf,EAAMtM,CAAAA,CAAGgM,CAAAA,CAAO,MAAM,CAAA,CAAA,CACvDpM,CAAAA,CAAMI,CAAAA,CAAIgM,EAAO,MAAA,CAASa,CAAAA,CAC1BG,CAAAA,CAAQ,MAAA,CAAA,KAEP,CACD,GAAI1G,IAAO,GAAA,EACP2G,CAAAA,EACAA,CAAAA,GAAS,GAAA,EACTA,CAAAA,GAAS;AAAA,CAAA,EACTA,CAAAA,GAAS,GAAA,CAAM,CAEf,IAAMK,CAAAA,CAAOhB,CAAAA,CAAKtM,CAAAA,CAAI,CAAC,CAAA,CACnBsN,CAAAA,EAAQA,CAAAA,GAAS,GAAA,EAAOA,CAAAA,GAAS;AAAA,CAAA,EAAQA,CAAAA,GAAS,GAAA,GAClDN,CAAAA,CAAQhN,CAAAA,EAChB,CACA,GAAIA,CAAAA,EAAKJ,CAAAA,CACL,GAAIoN,CAAAA,CACAF,CAAAA,CAAM,IAAA,CAAKE,CAAK,EAChBpN,CAAAA,CAAMoN,CAAAA,CAAQH,CAAAA,CACdG,CAAAA,CAAQ,MAAA,CAAA,KAAA,GAEHT,CAAAA,GAASH,EAAAA,CAAa,CAE3B,KAAOa,CAAAA,GAAS,GAAA,EAAOA,CAAAA,GAAS,GAAA,EAC5BA,CAAAA,CAAO3G,EACPA,CAAAA,CAAKgG,CAAAA,CAAMtM,CAAAA,EAAK,CAAE,CAAA,CAClBkN,CAAAA,CAAW,IAAA,CAGf,IAAMK,CAAAA,CAAIvN,CAAAA,CAAIoN,CAAAA,CAAS,CAAA,CAAIpN,CAAAA,CAAI,CAAA,CAAImN,EAAW,CAAA,CAE9C,GAAIJ,CAAAA,CAAaQ,CAAC,CAAA,CACd,OAAOjB,CAAAA,CACXQ,CAAAA,CAAM,IAAA,CAAKS,CAAC,CAAA,CACZR,CAAAA,CAAaQ,CAAC,CAAA,CAAI,KAClB3N,CAAAA,CAAM2N,CAAAA,CAAIV,CAAAA,CACVG,CAAAA,CAAQ,OACZ,CAAA,KAEIE,CAAAA,CAAW,KAGvB,CACAD,CAAAA,CAAO3G,EACX,CAGA,GAFI4G,CAAAA,EAAYN,GACZA,CAAAA,EAAW,CACXE,CAAAA,CAAM,MAAA,GAAW,CAAA,CACjB,OAAOR,CAAAA,CACPK,CAAAA,EACAA,CAAAA,EAAO,CACX,IAAI/F,CAAAA,CAAM0F,CAAAA,CAAK,KAAA,CAAM,EAAGQ,CAAAA,CAAM,CAAC,CAAC,CAAA,CAChC,IAAA,IAAS9M,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI8M,CAAAA,CAAM,MAAA,CAAQ,EAAE9M,CAAAA,CAAG,CACnC,IAAMwN,EAAOV,CAAAA,CAAM9M,CAAC,CAAA,CACdJ,CAAAA,CAAMkN,CAAAA,CAAM9M,CAAAA,CAAI,CAAC,CAAA,EAAKsM,CAAAA,CAAK,MAAA,CAC7BkB,CAAAA,GAAS,CAAA,CACT5G,CAAAA,CAAM;AAAA,EAAKoF,CAAM,CAAA,EAAGM,CAAAA,CAAK,MAAM,CAAA,CAAG1M,CAAG,CAAC,CAAA,CAAA,EAElC2M,CAAAA,GAASH,IAAeW,CAAAA,CAAaS,CAAI,IACzC5G,CAAAA,EAAO,CAAA,EAAG0F,EAAKkB,CAAI,CAAC,MACxB5G,CAAAA,EAAO;AAAA,EAAKoF,CAAM,GAAGM,CAAAA,CAAK,KAAA,CAAMkB,EAAO,CAAA,CAAG5N,CAAG,CAAC,CAAA,CAAA,EAEtD,CACA,OAAOgH,CACX,CAKA,SAASyG,EAAAA,CAAyBf,CAAAA,CAAMtM,CAAAA,CAAGgM,CAAAA,CAAQ,CAC/C,IAAIpM,CAAAA,CAAMI,CAAAA,CACNL,CAAAA,CAAQK,CAAAA,CAAI,CAAA,CACZsG,EAAKgG,CAAAA,CAAK3M,CAAK,CAAA,CACnB,KAAO2G,CAAAA,GAAO,GAAA,EAAOA,IAAO,GAAA,EACxB,GAAItG,CAAAA,CAAIL,CAAAA,CAAQqM,CAAAA,CACZ1F,CAAAA,CAAKgG,EAAK,EAAEtM,CAAC,CAAA,CAAA,KAEZ,CACD,GACIsG,CAAAA,CAAKgG,EAAK,EAAEtM,CAAC,CAAA,CAAA,MACRsG,CAAAA,EAAMA,CAAAA,GAAO;AAAA,CAAA,EACtB1G,EAAMI,CAAAA,CACNL,CAAAA,CAAQK,CAAAA,CAAI,CAAA,CACZsG,EAAKgG,CAAAA,CAAK3M,CAAK,EACnB,CAEJ,OAAOC,CACX,CC5IA,IAAM6N,EAAAA,CAAiB,CAACpE,CAAAA,CAAKqE,CAAAA,IAAa,CACtC,aAAA,CAAeA,EAAUrE,CAAAA,CAAI,MAAA,CAAO,MAAA,CAASA,CAAAA,CAAI,cACjD,SAAA,CAAWA,CAAAA,CAAI,OAAA,CAAQ,SAAA,CACvB,gBAAiBA,CAAAA,CAAI,OAAA,CAAQ,eACjC,CAAA,CAAA,CAGMsE,EAAAA,CAA0B9B,GAAQ,kBAAA,CAAmB,IAAA,CAAKA,CAAG,CAAA,CACnE,SAAS+B,EAAAA,CAAoB/B,CAAAA,CAAKY,CAAAA,CAAWoB,CAAAA,CAAc,CACvD,GAAI,CAACpB,CAAAA,EAAaA,CAAAA,CAAY,EAC1B,OAAO,MAAA,CACX,IAAMqB,CAAAA,CAAQrB,EAAYoB,CAAAA,CACpBE,CAAAA,CAASlC,CAAAA,CAAI,MAAA,CACnB,GAAIkC,CAAAA,EAAUD,CAAAA,CACV,OAAO,MAAA,CACX,QAAS9N,CAAAA,CAAI,CAAA,CAAGL,CAAAA,CAAQ,CAAA,CAAGK,EAAI+N,CAAAA,CAAQ,EAAE/N,EACrC,GAAI6L,CAAAA,CAAI7L,CAAC,CAAA,GAAM;AAAA,CAAA,CAAM,CACjB,GAAIA,CAAAA,CAAIL,CAAAA,CAAQmO,EACZ,OAAO,KAAA,CAEX,GADAnO,CAAAA,CAAQK,CAAAA,CAAI,CAAA,CACR+N,EAASpO,CAAAA,EAASmO,CAAAA,CAClB,OAAO,MACf,CAEJ,OAAO,KACX,CACA,SAASE,EAAAA,CAAmB3L,CAAAA,CAAOgH,CAAAA,CAAK,CACpC,IAAM4E,CAAAA,CAAO,IAAA,CAAK,UAAU5L,CAAK,CAAA,CACjC,GAAIgH,CAAAA,CAAI,OAAA,CAAQ,kBAAA,CACZ,OAAO4E,CAAAA,CACX,GAAM,CAAE,WAAA,CAAAC,CAAY,CAAA,CAAI7E,CAAAA,CAClB8E,CAAAA,CAAqB9E,CAAAA,CAAI,QAAQ,8BAAA,CACjC2C,CAAAA,CAAS3C,CAAAA,CAAI,MAAA,GAAWsE,EAAAA,CAAuBtL,CAAK,EAAI,IAAA,CAAO,EAAA,CAAA,CACjEwJ,EAAM,EAAA,CACNlM,CAAAA,CAAQ,EACZ,IAAA,IAASK,CAAAA,CAAI,CAAA,CAAGsG,CAAAA,CAAK2H,CAAAA,CAAKjO,CAAC,EAAGsG,CAAAA,CAAIA,CAAAA,CAAK2H,CAAAA,CAAK,EAAEjO,CAAC,CAAA,CAQ3C,GAPIsG,CAAAA,GAAO,GAAA,EAAO2H,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,MAAQiO,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAA,GAEtD6L,CAAAA,EAAOoC,EAAK,KAAA,CAAMtO,CAAAA,CAAOK,CAAC,CAAA,CAAI,KAAA,CAC9BA,CAAAA,EAAK,EACLL,CAAAA,CAAQK,CAAAA,CACRsG,CAAAA,CAAK,IAAA,CAAA,CAELA,CAAAA,GAAO,IAAA,CACP,OAAQ2H,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,EACd,KAAK,IACD,CACI6L,CAAAA,EAAOoC,EAAK,KAAA,CAAMtO,CAAAA,CAAOK,CAAC,CAAA,CAC1B,IAAMoO,CAAAA,CAAOH,CAAAA,CAAK,MAAA,CAAOjO,CAAAA,CAAI,EAAG,CAAC,CAAA,CACjC,OAAQoO,CAAAA,EACJ,KAAK,OACDvC,CAAAA,EAAO,KAAA,CACP,MACJ,KAAK,MAAA,CACDA,CAAAA,EAAO,MACP,MACJ,KAAK,OACDA,CAAAA,EAAO,KAAA,CACP,MACJ,KAAK,MAAA,CACDA,CAAAA,EAAO,KAAA,CACP,MACJ,KAAK,OACDA,CAAAA,EAAO,KAAA,CACP,MACJ,KAAK,MAAA,CACDA,CAAAA,EAAO,MACP,MACJ,KAAK,MAAA,CACDA,CAAAA,EAAO,KAAA,CACP,MACJ,KAAK,MAAA,CACDA,CAAAA,EAAO,MACP,MACJ,QACQuC,EAAK,MAAA,CAAO,CAAA,CAAG,CAAC,CAAA,GAAM,IAAA,CACtBvC,CAAAA,EAAO,MAAQuC,CAAAA,CAAK,MAAA,CAAO,CAAC,CAAA,CAE5BvC,CAAAA,EAAOoC,CAAAA,CAAK,OAAOjO,CAAAA,CAAG,CAAC,EACnC,CACAA,CAAAA,EAAK,CAAA,CACLL,EAAQK,CAAAA,CAAI,EAChB,CACA,MACJ,KAAK,GAAA,CACD,GAAIkO,CAAAA,EACAD,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAA,EAChBiO,EAAK,MAAA,CAASE,CAAAA,CACdnO,CAAAA,EAAK,CAAA,CAAA,KAEJ,CAGD,IADA6L,GAAOoC,CAAAA,CAAK,KAAA,CAAMtO,CAAAA,CAAOK,CAAC,CAAA,CAAI;;AAAA,CAAA,CACvBiO,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,MACnBiO,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,KAChBiO,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,KAChB6L,CAAAA,EAAO;AAAA,CAAA,CACP7L,CAAAA,EAAK,CAAA,CAET6L,CAAAA,EAAOG,CAAAA,CAEHiC,CAAAA,CAAKjO,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAA,GAChB6L,CAAAA,EAAO,IAAA,CAAA,CACX7L,CAAAA,EAAK,CAAA,CACLL,EAAQK,CAAAA,CAAI,EAChB,CACA,MACJ,QACIA,CAAAA,EAAK,EACb,CAER,OAAA6L,CAAAA,CAAMlM,CAAAA,CAAQkM,CAAAA,CAAMoC,CAAAA,CAAK,KAAA,CAAMtO,CAAK,CAAA,CAAIsO,CAAAA,CACjCC,CAAAA,CACDrC,CAAAA,CACAQ,EAAAA,CAAcR,CAAAA,CAAKG,CAAAA,CAAQI,EAAAA,CAAaqB,EAAAA,CAAepE,CAAAA,CAAK,KAAK,CAAC,CAC5E,CACA,SAASgF,EAAAA,CAAmBhM,CAAAA,CAAOgH,CAAAA,CAAK,CACpC,GAAIA,CAAAA,CAAI,OAAA,CAAQ,WAAA,GAAgB,KAAA,EAC3BA,CAAAA,CAAI,WAAA,EAAehH,CAAAA,CAAM,QAAA,CAAS;AAAA,CAAI,CAAA,EACvC,iBAAA,CAAkB,IAAA,CAAKA,CAAK,CAAA,CAE5B,OAAO2L,EAAAA,CAAmB3L,CAAAA,CAAOgH,CAAG,CAAA,CACxC,IAAM2C,CAAAA,CAAS3C,CAAAA,CAAI,MAAA,GAAWsE,EAAAA,CAAuBtL,CAAK,CAAA,CAAI,IAAA,CAAO,EAAA,CAAA,CAC/DuE,CAAAA,CAAM,GAAA,CAAMvE,CAAAA,CAAM,OAAA,CAAQ,IAAA,CAAM,IAAI,CAAA,CAAE,OAAA,CAAQ,MAAA,CAAQ,CAAA;AAAA,EAAO2J,CAAM,CAAA,CAAE,CAAA,CAAI,GAAA,CAC/E,OAAO3C,CAAAA,CAAI,WAAA,CACLzC,CAAAA,CACAyF,EAAAA,CAAczF,EAAKoF,CAAAA,CAAQE,EAAAA,CAAWuB,EAAAA,CAAepE,CAAAA,CAAK,KAAK,CAAC,CAC1E,CACA,SAASiF,GAAajM,CAAAA,CAAOgH,CAAAA,CAAK,CAC9B,GAAM,CAAE,WAAA,CAAAkF,CAAY,CAAA,CAAIlF,CAAAA,CAAI,QACxBmF,CAAAA,CACJ,GAAID,CAAAA,GAAgB,KAAA,CAChBC,EAAKR,EAAAA,CAAAA,KACJ,CACD,IAAMS,CAAAA,CAAYpM,EAAM,QAAA,CAAS,GAAG,CAAA,CAC9BqM,CAAAA,CAAYrM,EAAM,QAAA,CAAS,GAAG,CAAA,CAChCoM,CAAAA,EAAa,CAACC,CAAAA,CACdF,CAAAA,CAAKH,EAAAA,CACAK,CAAAA,EAAa,CAACD,CAAAA,CACnBD,CAAAA,CAAKR,EAAAA,CAELQ,CAAAA,CAAKD,EAAcF,EAAAA,CAAqBL,GAChD,CACA,OAAOQ,EAAGnM,CAAAA,CAAOgH,CAAG,CACxB,CAGA,IAAIsF,EAAAA,CACJ,GAAI,CACAA,EAAAA,CAAmB,IAAI,MAAA,CAAO,CAAA;AAAA;AAAA;AAAA,GAAA,CAAA,CAA0B,GAAG,EAC/D,CAAA,KACM,CACFA,EAAAA,CAAmB,eACvB,CACA,SAASC,EAAAA,CAAY,CAAE,QAAA7C,CAAAA,CAAS,IAAA,CAAAtI,EAAM,KAAA,CAAApB,CAAM,EAAGgH,CAAAA,CAAKwF,CAAAA,CAAWC,CAAAA,CAAa,CACxE,GAAM,CAAE,UAAA,CAAAC,CAAAA,CAAY,aAAA,CAAAC,EAAe,SAAA,CAAAvC,CAAU,CAAA,CAAIpD,CAAAA,CAAI,QAGrD,GAAI,CAAC0F,GAAc,WAAA,CAAY,IAAA,CAAK1M,CAAK,CAAA,CACrC,OAAOiM,EAAAA,CAAajM,CAAAA,CAAOgH,CAAG,CAAA,CAElC,IAAM2C,CAAAA,CAAS3C,CAAAA,CAAI,SACdA,CAAAA,CAAI,gBAAA,EAAoBsE,EAAAA,CAAuBtL,CAAK,EAAI,IAAA,CAAO,EAAA,CAAA,CAC9D4M,EAAUF,CAAAA,GAAe,SAAA,CACzB,KACAA,CAAAA,GAAe,QAAA,EAAYtL,CAAAA,GAAS+G,CAAAA,CAAO,aACvC,KAAA,CACA/G,CAAAA,GAAS+G,CAAAA,CAAO,aAAA,CACZ,KACA,CAACoD,EAAAA,CAAoBvL,CAAAA,CAAOoK,CAAAA,CAAWT,EAAO,MAAM,CAAA,CAClE,GAAI,CAAC3J,CAAAA,CACD,OAAO4M,CAAAA,CAAU,CAAA;AAAA,CAAA,CAAQ,CAAA;AAAA,CAAA,CAE7B,IAAIC,CAAAA,CACAC,CAAAA,CACJ,IAAKA,CAAAA,CAAW9M,CAAAA,CAAM,OAAQ8M,CAAAA,CAAW,CAAA,CAAG,EAAEA,CAAAA,CAAU,CACpD,IAAM7I,CAAAA,CAAKjE,CAAAA,CAAM8M,EAAW,CAAC,CAAA,CAC7B,GAAI7I,CAAAA,GAAO;AAAA,CAAA,EAAQA,CAAAA,GAAO,GAAA,EAAQA,CAAAA,GAAO,GAAA,CACrC,KACR,CACA,IAAI1G,CAAAA,CAAMyC,CAAAA,CAAM,SAAA,CAAU8M,CAAQ,CAAA,CAC5BC,CAAAA,CAAWxP,EAAI,OAAA,CAAQ;AAAA,CAAI,CAAA,CAC7BwP,CAAAA,GAAa,EAAA,CACbF,CAAAA,CAAQ,GAAA,CAEH7M,CAAAA,GAAUzC,CAAAA,EAAOwP,CAAAA,GAAaxP,CAAAA,CAAI,MAAA,CAAS,CAAA,EAChDsP,CAAAA,CAAQ,IACJJ,CAAAA,EACAA,CAAAA,EAAY,EAGhBI,CAAAA,CAAQ,EAAA,CAERtP,CAAAA,GACAyC,CAAAA,CAAQA,CAAAA,CAAM,MAAM,CAAA,CAAG,CAACzC,CAAAA,CAAI,MAAM,CAAA,CAC9BA,CAAAA,CAAIA,CAAAA,CAAI,MAAA,CAAS,CAAC,CAAA,GAAM;AAAA,CAAA,GACxBA,EAAMA,CAAAA,CAAI,KAAA,CAAM,CAAA,CAAG,EAAE,GACzBA,CAAAA,CAAMA,CAAAA,CAAI,OAAA,CAAQ+O,EAAAA,CAAkB,KAAK3C,CAAM,CAAA,CAAE,GAGrD,IAAIqD,CAAAA,CAAiB,MACjBC,CAAAA,CACAC,CAAAA,CAAa,EAAA,CACjB,IAAKD,EAAW,CAAA,CAAGA,CAAAA,CAAWjN,EAAM,MAAA,CAAQ,EAAEiN,EAAU,CACpD,IAAMhJ,CAAAA,CAAKjE,CAAAA,CAAMiN,CAAQ,CAAA,CACzB,GAAIhJ,IAAO,GAAA,CACP+I,CAAAA,CAAiB,aACZ/I,CAAAA,GAAO;AAAA,CAAA,CACZiJ,CAAAA,CAAaD,CAAAA,CAAAA,KAEb,KACR,CACA,IAAI3P,CAAAA,CAAQ0C,CAAAA,CAAM,SAAA,CAAU,CAAA,CAAGkN,CAAAA,CAAaD,CAAAA,CAAWC,CAAAA,CAAa,CAAA,CAAID,CAAQ,CAAA,CAC5E3P,CAAAA,GACA0C,CAAAA,CAAQA,CAAAA,CAAM,SAAA,CAAU1C,CAAAA,CAAM,MAAM,CAAA,CACpCA,CAAAA,CAAQA,CAAAA,CAAM,OAAA,CAAQ,MAAA,CAAQ,CAAA,EAAA,EAAKqM,CAAM,CAAA,CAAE,CAAA,CAAA,CAI/C,IAAIwD,CAAAA,CAAAA,CAAUH,CAAAA,CAFKrD,CAAAA,CAAS,GAAA,CAAM,GAAA,CAEU,EAAA,EAAMkD,CAAAA,CAMlD,GALInD,CAAAA,GACAyD,CAAAA,EAAU,GAAA,CAAMR,CAAAA,CAAcjD,CAAAA,CAAQ,OAAA,CAAQ,YAAA,CAAc,GAAG,CAAC,CAAA,CAC5D8C,CAAAA,EACAA,CAAAA,EAAU,CAAA,CAEd,CAACI,CAAAA,CAAS,CACV,IAAMQ,CAAAA,CAAcpN,CAAAA,CACf,OAAA,CAAQ,MAAA,CAAQ;AAAA,EAAA,CAAM,CAAA,CACtB,QAAQ,gDAAA,CAAkD,MAAM,EAEhE,OAAA,CAAQ,MAAA,CAAQ,CAAA,EAAA,EAAK2J,CAAM,CAAA,CAAE,CAAA,CAC9B0D,EAAkB,KAAA,CAChBC,CAAAA,CAAclC,GAAepE,CAAAA,CAAK,IAAI,EACxC0F,CAAAA,GAAe,QAAA,EAAYtL,CAAAA,GAAS+G,CAAAA,CAAO,YAAA,GAC3CmF,CAAAA,CAAY,WAAa,IAAM,CAC3BD,EAAkB,KACtB,CAAA,CAAA,CAEJ,IAAME,CAAAA,CAAOvD,EAAAA,CAAc,CAAA,EAAG1M,CAAK,CAAA,EAAG8P,CAAW,GAAG7P,CAAG,CAAA,CAAA,CAAIoM,CAAAA,CAAQG,EAAAA,CAAYwD,CAAW,CAAA,CAC1F,GAAI,CAACD,CAAAA,CACD,OAAO,CAAA,CAAA,EAAIF,CAAM;AAAA,EAAKxD,CAAM,CAAA,EAAG4D,CAAI,CAAA,CAC3C,CACA,OAAAvN,CAAAA,CAAQA,CAAAA,CAAM,OAAA,CAAQ,OAAQ,CAAA,EAAA,EAAK2J,CAAM,CAAA,CAAE,CAAA,CACpC,IAAIwD,CAAM;AAAA,EAAKxD,CAAM,CAAA,EAAGrM,CAAK,GAAG0C,CAAK,CAAA,EAAGzC,CAAG,CAAA,CACtD,CACA,SAASiQ,EAAAA,CAAY1F,EAAMd,CAAAA,CAAKwF,CAAAA,CAAWC,EAAa,CACpD,GAAM,CAAE,IAAA,CAAArL,CAAAA,CAAM,KAAA,CAAApB,CAAM,EAAI8H,CAAAA,CAClB,CAAE,aAAA2F,CAAAA,CAAc,WAAA,CAAA5B,EAAa,MAAA,CAAAlC,CAAAA,CAAQ,UAAA,CAAA+D,CAAAA,CAAY,OAAAC,CAAO,CAAA,CAAI3G,EAClE,GAAK6E,CAAAA,EAAe7L,EAAM,QAAA,CAAS;AAAA,CAAI,CAAA,EAClC2N,GAAU,UAAA,CAAW,IAAA,CAAK3N,CAAK,CAAA,CAChC,OAAOiM,GAAajM,CAAAA,CAAOgH,CAAG,EAElC,GAAI,mFAAA,CAAoF,KAAKhH,CAAK,CAAA,CAO9F,OAAO6L,CAAAA,EAAe8B,CAAAA,EAAU,CAAC3N,CAAAA,CAAM,QAAA,CAAS;AAAA,CAAI,CAAA,CAC9CiM,GAAajM,CAAAA,CAAOgH,CAAG,EACvBuF,EAAAA,CAAYzE,CAAAA,CAAMd,EAAKwF,CAAAA,CAAWC,CAAW,EAEvD,GAAI,CAACZ,GACD,CAAC8B,CAAAA,EACDvM,IAAS+G,CAAAA,CAAO,KAAA,EAChBnI,EAAM,QAAA,CAAS;AAAA,CAAI,EAEnB,OAAOuM,EAAAA,CAAYzE,EAAMd,CAAAA,CAAKwF,CAAAA,CAAWC,CAAW,CAAA,CAExD,GAAInB,EAAAA,CAAuBtL,CAAK,EAAG,CAC/B,GAAI2J,IAAW,EAAA,CACX,OAAA3C,EAAI,gBAAA,CAAmB,IAAA,CAChBuF,EAAAA,CAAYzE,CAAAA,CAAMd,EAAKwF,CAAAA,CAAWC,CAAW,EAEnD,GAAIZ,CAAAA,EAAelC,IAAW+D,CAAAA,CAC/B,OAAOzB,EAAAA,CAAajM,CAAAA,CAAOgH,CAAG,CAEtC,CACA,IAAMwC,CAAAA,CAAMxJ,CAAAA,CAAM,QAAQ,MAAA,CAAQ,CAAA;AAAA,EAAO2J,CAAM,CAAA,CAAE,CAAA,CAIjD,GAAI8D,CAAAA,CAAc,CACd,IAAMG,CAAAA,CAAQxI,CAAAA,EAAQA,CAAAA,CAAI,SAAWA,CAAAA,CAAI,GAAA,GAAQ,uBAAA,EAA2BA,CAAAA,CAAI,MAAM,IAAA,CAAKoE,CAAG,CAAA,CACxF,CAAE,OAAAqE,CAAAA,CAAQ,IAAA,CAAAxJ,CAAK,CAAA,CAAI2C,EAAI,GAAA,CAAI,MAAA,CACjC,GAAI3C,CAAAA,CAAK,KAAKuJ,CAAI,CAAA,EAAKC,GAAQ,IAAA,CAAKD,CAAI,EACpC,OAAO3B,EAAAA,CAAajM,CAAAA,CAAOgH,CAAG,CACtC,CACA,OAAO6E,CAAAA,CACDrC,CAAAA,CACAQ,GAAcR,CAAAA,CAAKG,CAAAA,CAAQE,EAAAA,CAAWuB,EAAAA,CAAepE,EAAK,KAAK,CAAC,CAC1E,CACA,SAAS8G,GAAgBhG,CAAAA,CAAMd,CAAAA,CAAKwF,CAAAA,CAAWC,CAAAA,CAAa,CACxD,GAAM,CAAE,WAAA,CAAAZ,CAAAA,CAAa,OAAA8B,CAAO,CAAA,CAAI3G,CAAAA,CAC1B+G,CAAAA,CAAK,OAAOjG,CAAAA,CAAK,KAAA,EAAU,SAC3BA,CAAAA,CACA,MAAA,CAAO,OAAO,EAAC,CAAGA,CAAAA,CAAM,CAAE,MAAO,MAAA,CAAOA,CAAAA,CAAK,KAAK,CAAE,CAAC,CAAA,CACvD,CAAE,IAAA,CAAA1G,CAAK,EAAI0G,CAAAA,CACX1G,CAAAA,GAAS+G,CAAAA,CAAO,YAAA,EAEZ,kDAAkD,IAAA,CAAK4F,CAAAA,CAAG,KAAK,CAAA,GAC/D3M,EAAO+G,CAAAA,CAAO,YAAA,CAAA,CAEtB,IAAM6F,CAAAA,CAAcC,GAAU,CAC1B,OAAQA,CAAAA,EACJ,KAAK9F,CAAAA,CAAO,YAAA,CACZ,KAAKA,CAAAA,CAAO,aAAA,CACR,OAAO0D,CAAAA,EAAe8B,CAAAA,CAChB1B,EAAAA,CAAa8B,CAAAA,CAAG,MAAO/G,CAAG,CAAA,CAC1BuF,EAAAA,CAAYwB,CAAAA,CAAI/G,EAAKwF,CAAAA,CAAWC,CAAW,CAAA,CACrD,KAAKtE,EAAO,YAAA,CACR,OAAOwD,GAAmBoC,CAAAA,CAAG,KAAA,CAAO/G,CAAG,CAAA,CAC3C,KAAKmB,CAAAA,CAAO,YAAA,CACR,OAAO6D,EAAAA,CAAmB+B,CAAAA,CAAG,KAAA,CAAO/G,CAAG,EAC3C,KAAKmB,CAAAA,CAAO,KAAA,CACR,OAAOqF,GAAYO,CAAAA,CAAI/G,CAAAA,CAAKwF,EAAWC,CAAW,CAAA,CACtD,QACI,OAAO,IACf,CACJ,CAAA,CACIlI,EAAMyJ,CAAAA,CAAW5M,CAAI,CAAA,CACzB,GAAImD,IAAQ,IAAA,CAAM,CACd,GAAM,CAAE,eAAA2J,CAAAA,CAAgB,iBAAA,CAAAC,CAAkB,CAAA,CAAInH,EAAI,OAAA,CAC5CwB,CAAAA,CAAKqD,CAAAA,EAAeqC,CAAAA,EAAmBC,EAE7C,GADA5J,CAAAA,CAAMyJ,CAAAA,CAAWxF,CAAC,EACdjE,CAAAA,GAAQ,IAAA,CACR,MAAM,IAAI,MAAM,CAAA,gCAAA,EAAmCiE,CAAC,EAAE,CAC9D,CACA,OAAOjE,CACX,CCxUA,SAAS6J,EAAAA,CAAuB/I,EAAKgJ,CAAAA,CAAS,CAC1C,IAAMC,CAAAA,CAAM,OAAO,MAAA,CAAO,CACtB,UAAA,CAAY,IAAA,CACZ,cAAe/E,EAAAA,CACf,cAAA,CAAgB,KAChB,iBAAA,CAAmB,OAAA,CACnB,WAAY,IAAA,CACZ,kBAAA,CAAoB,KAAA,CACpB,8BAAA,CAAgC,GAChC,QAAA,CAAU,OAAA,CACV,qBAAA,CAAuB,IAAA,CACvB,UAAW,IAAA,CACX,SAAA,CAAW,EAAA,CACX,eAAA,CAAiB,GACjB,OAAA,CAAS,MAAA,CACT,WAAY,KAAA,CACZ,WAAA,CAAa,KACb,OAAA,CAAS,MAAA,CACT,gBAAA,CAAkB,IACtB,EAAGlE,CAAAA,CAAI,MAAA,CAAO,eAAA,CAAiBgJ,CAAO,EAClCV,CAAAA,CACJ,OAAQW,CAAAA,CAAI,eAAA,EACR,KAAK,OAAA,CACDX,CAAAA,CAAS,KAAA,CACT,MACJ,KAAK,MAAA,CACDA,CAAAA,CAAS,IAAA,CACT,MACJ,QACIA,CAAAA,CAAS,KACjB,CACA,OAAO,CACH,OAAA,CAAS,IAAI,GAAA,CACb,IAAAtI,CAAAA,CACA,qBAAA,CAAuBiJ,EAAI,qBAAA,CAAwB,GAAA,CAAM,GACzD,MAAA,CAAQ,EAAA,CACR,UAAA,CAAY,OAAOA,EAAI,MAAA,EAAW,QAAA,CAAW,GAAA,CAAI,MAAA,CAAOA,EAAI,MAAM,CAAA,CAAI,IAAA,CACtE,MAAA,CAAAX,EACA,OAAA,CAASW,CACb,CACJ,CACA,SAASC,GAAalK,CAAAA,CAAMyD,CAAAA,CAAM,CAC9B,GAAIA,EAAK,GAAA,CAAK,CACV,IAAMS,CAAAA,CAAQlE,EAAK,MAAA,CAAOmE,CAAAA,EAAKA,CAAAA,CAAE,GAAA,GAAQV,EAAK,GAAG,CAAA,CACjD,GAAIS,CAAAA,CAAM,MAAA,CAAS,EACf,OAAOA,CAAAA,CAAM,IAAA,CAAKC,CAAAA,EAAKA,EAAE,MAAA,GAAWV,CAAAA,CAAK,MAAM,CAAA,EAAKS,EAAM,CAAC,CACnE,CACA,IAAIE,EACAjC,CAAAA,CACJ,GAAIjE,CAAAA,CAASuF,CAAI,EAAG,CAChBtB,CAAAA,CAAMsB,CAAAA,CAAK,KAAA,CACX,IAAIS,CAAAA,CAAQlE,CAAAA,CAAK,MAAA,CAAOmE,CAAAA,EAAKA,EAAE,QAAA,GAAWhC,CAAG,CAAC,CAAA,CAC9C,GAAI+B,CAAAA,CAAM,MAAA,CAAS,EAAG,CAClB,IAAMiG,EAAYjG,CAAAA,CAAM,MAAA,CAAOC,CAAAA,EAAKA,CAAAA,CAAE,IAAI,CAAA,CACtCgG,CAAAA,CAAU,MAAA,CAAS,CAAA,GACnBjG,EAAQiG,CAAAA,EAChB,CACA/F,CAAAA,CACIF,CAAAA,CAAM,KAAKC,CAAAA,EAAKA,CAAAA,CAAE,SAAWV,CAAAA,CAAK,MAAM,GAAKS,CAAAA,CAAM,IAAA,CAAKC,CAAAA,EAAK,CAACA,EAAE,MAAM,EAC9E,CAAA,KAEIhC,CAAAA,CAAMsB,EACNW,CAAAA,CAASpE,CAAAA,CAAK,IAAA,CAAKmE,CAAAA,EAAKA,EAAE,SAAA,EAAahC,CAAAA,YAAegC,EAAE,SAAS,CAAA,CAErE,GAAI,CAACC,CAAAA,CAAQ,CACT,IAAM9D,EAAO6B,CAAAA,EAAK,WAAA,EAAa,IAAA,GAASA,CAAAA,GAAQ,KAAO,MAAA,CAAS,OAAOA,CAAAA,CAAAA,CACvE,MAAM,IAAI,KAAA,CAAM,CAAA,qBAAA,EAAwB7B,CAAI,CAAA,MAAA,CAAQ,CACxD,CACA,OAAO8D,CACX,CAEA,SAASgG,EAAAA,CAAetM,CAAAA,CAAMsG,CAAAA,CAAQ,CAAE,QAAA3C,CAAAA,CAAS,GAAA,CAAAT,CAAI,CAAA,CAAG,CACpD,GAAI,CAACA,EAAI,UAAA,CACL,OAAO,GACX,IAAMqJ,CAAAA,CAAQ,EAAC,CACThJ,GAAUnD,CAAAA,CAASJ,CAAI,CAAA,EAAKM,CAAAA,CAAaN,CAAI,CAAA,GAAMA,CAAAA,CAAK,MAAA,CAC1DuD,CAAAA,EAAUD,GAAcC,CAAM,CAAA,GAC9BI,EAAQ,GAAA,CAAIJ,CAAM,EAClBgJ,CAAAA,CAAM,IAAA,CAAK,CAAA,CAAA,EAAIhJ,CAAM,EAAE,CAAA,CAAA,CAE3B,IAAMN,CAAAA,CAAMjD,CAAAA,CAAK,MAAQsG,CAAAA,CAAO,OAAA,CAAU,IAAA,CAAOA,CAAAA,CAAO,KACxD,OAAIrD,CAAAA,EACAsJ,EAAM,IAAA,CAAKrJ,CAAAA,CAAI,WAAW,SAAA,CAAUD,CAAG,CAAC,CAAA,CACrCsJ,EAAM,IAAA,CAAK,GAAG,CACzB,CACA,SAASC,EAAAA,CAAU7G,CAAAA,CAAMd,CAAAA,CAAKwF,CAAAA,CAAWC,EAAa,CAClD,GAAInK,CAAAA,CAAOwF,CAAI,EACX,OAAOA,CAAAA,CAAK,QAAA,CAASd,CAAAA,CAAKwF,EAAWC,CAAW,CAAA,CACpD,GAAIvK,CAAAA,CAAQ4F,CAAI,CAAA,CAAG,CACf,GAAId,CAAAA,CAAI,IAAI,UAAA,CACR,OAAOc,EAAK,QAAA,CAASd,CAAG,EAC5B,GAAIA,CAAAA,CAAI,eAAA,EAAiB,GAAA,CAAIc,CAAI,CAAA,CAC7B,MAAM,IAAI,SAAA,CAAU,yDAAyD,CAAA,CAGzEd,CAAAA,CAAI,eAAA,CACJA,CAAAA,CAAI,gBAAgB,GAAA,CAAIc,CAAI,EAE5Bd,CAAAA,CAAI,eAAA,CAAkB,IAAI,GAAA,CAAI,CAACc,CAAI,CAAC,EACxCA,CAAAA,CAAOA,CAAAA,CAAK,OAAA,CAAQd,CAAAA,CAAI,GAAG,EAEnC,CACA,IAAIyB,CAAAA,CACEtG,EAAOO,CAAAA,CAAOoF,CAAI,EAClBA,CAAAA,CACAd,CAAAA,CAAI,IAAI,UAAA,CAAWc,CAAAA,CAAM,CAAE,QAAA,CAAU8G,GAAMnG,CAAAA,CAASmG,CAAG,CAAC,CAAA,CAC9DnG,IAAWA,CAAAA,CAAS8F,EAAAA,CAAavH,CAAAA,CAAI,GAAA,CAAI,OAAO,IAAA,CAAM7E,CAAI,CAAA,CAAA,CAC1D,IAAMuM,EAAQD,EAAAA,CAAetM,CAAAA,CAAMsG,CAAAA,CAAQzB,CAAG,EAC1C0H,CAAAA,CAAM,MAAA,CAAS,CAAA,GACf1H,CAAAA,CAAI,eAAiBA,CAAAA,CAAI,aAAA,EAAiB,CAAA,EAAK0H,CAAAA,CAAM,OAAS,CAAA,CAAA,CAClE,IAAMlF,EAAM,OAAOf,CAAAA,CAAO,WAAc,UAAA,CAClCA,CAAAA,CAAO,SAAA,CAAUtG,CAAAA,CAAM6E,EAAKwF,CAAAA,CAAWC,CAAW,CAAA,CAClDlK,CAAAA,CAASJ,CAAI,CAAA,CACT2L,EAAAA,CAAgB3L,CAAAA,CAAM6E,CAAAA,CAAKwF,EAAWC,CAAW,CAAA,CACjDtK,EAAK,QAAA,CAAS6E,CAAAA,CAAKwF,EAAWC,CAAW,CAAA,CACnD,OAAKiC,CAAAA,CAEEnM,EAASJ,CAAI,CAAA,EAAKqH,CAAAA,CAAI,CAAC,IAAM,GAAA,EAAOA,CAAAA,CAAI,CAAC,CAAA,GAAM,IAChD,CAAA,EAAGkF,CAAK,IAAIlF,CAAG,CAAA,CAAA,CACf,GAAGkF,CAAK;AAAA,EAAK1H,CAAAA,CAAI,MAAM,CAAA,EAAGwC,CAAG,CAAA,CAAA,CAHxBA,CAIf,CCxHA,SAASqF,EAAAA,CAAc,CAAE,GAAA,CAAAzL,CAAAA,CAAK,MAAApD,CAAM,CAAA,CAAGgH,CAAAA,CAAKwF,CAAAA,CAAWC,CAAAA,CAAa,CAChE,GAAM,CAAE,aAAA,CAAAqC,CAAAA,CAAe,GAAA,CAAAzJ,CAAAA,CAAK,MAAA,CAAAsE,CAAAA,CAAQ,WAAA+D,CAAAA,CAAY,OAAA,CAAS,CAAE,aAAA,CAAAf,CAAAA,CAAe,SAAA,CAAAoC,EAAW,UAAA,CAAAC,CAAW,CAAE,CAAA,CAAIhI,CAAAA,CAClGiI,CAAAA,CAAcvM,EAAOU,CAAG,CAAA,EAAKA,CAAAA,CAAI,OAAA,EAAY,IAAA,CACjD,GAAI4L,CAAAA,CAAY,CACZ,GAAIC,CAAAA,CACA,MAAM,IAAI,KAAA,CAAM,kDAAkD,EAEtE,GAAIxM,CAAAA,CAAaW,CAAG,CAAA,EAAM,CAACV,CAAAA,CAAOU,CAAG,CAAA,EAAK,OAAOA,CAAAA,EAAQ,QAAA,CAAW,CAChE,IAAMuC,EAAM,4DAAA,CACZ,MAAM,IAAI,KAAA,CAAMA,CAAG,CACvB,CACJ,CACA,IAAIuJ,CAAAA,CAAc,CAACF,CAAAA,GACd,CAAC5L,CAAAA,EACG6L,GAAcjP,CAAAA,EAAS,IAAA,EAAQ,CAACgH,CAAAA,CAAI,MAAA,EACrCvE,CAAAA,CAAaW,CAAG,CAAA,GACfb,CAAAA,CAASa,CAAG,CAAA,CACPA,CAAAA,CAAI,IAAA,GAAS+E,EAAO,YAAA,EAAgB/E,CAAAA,CAAI,IAAA,GAAS+E,CAAAA,CAAO,aAAA,CACxD,OAAO/E,CAAAA,EAAQ,QAAA,CAAA,CAAA,CAC7B4D,CAAAA,CAAM,MAAA,CAAO,MAAA,CAAO,EAAC,CAAGA,CAAAA,CAAK,CACzB,aAAA,CAAe,KAAA,CACf,WAAA,CAAa,CAACkI,CAAAA,GAAgBF,CAAAA,EAAc,CAACF,CAAAA,CAAAA,CAC7C,MAAA,CAAQnF,CAAAA,CAAS+D,CACrB,CAAC,CAAA,CACD,IAAIyB,CAAAA,CAAiB,KAAA,CACjBC,CAAAA,CAAY,KAAA,CACZ5F,CAAAA,CAAMmF,EAAAA,CAAUvL,CAAAA,CAAK4D,CAAAA,CAAK,IAAOmI,CAAAA,CAAiB,IAAA,CAAO,IAAOC,CAAAA,CAAY,IAAK,EACrF,GAAI,CAACF,CAAAA,EAAe,CAAClI,CAAAA,CAAI,MAAA,EAAUwC,EAAI,MAAA,CAAS,IAAA,CAAM,CAClD,GAAIwF,CAAAA,CACA,MAAM,IAAI,KAAA,CAAM,8EAA8E,CAAA,CAClGE,CAAAA,CAAc,KAClB,CACA,GAAIlI,CAAAA,CAAI,MAAA,CAAA,CACJ,GAAI8H,CAAAA,EAAiB9O,CAAAA,EAAS,IAAA,CAC1B,OAAImP,GAAkB3C,CAAAA,EAClBA,CAAAA,EAAU,CACPhD,CAAAA,GAAQ,EAAA,CAAK,GAAA,CAAM0F,EAAc,CAAA,EAAA,EAAK1F,CAAG,CAAA,CAAA,CAAKA,CAAAA,CAAAA,KAAAA,GAGnDsF,CAAAA,EAAiB,CAACE,GAAgBhP,CAAAA,EAAS,IAAA,EAAQkP,CAAAA,CACzD,OAAA1F,CAAAA,CAAM,CAAA,EAAA,EAAKA,CAAG,CAAA,CAAA,CACVyF,CAAAA,EAAc,CAACE,CAAAA,CACf3F,CAAAA,EAAOI,EAAAA,CAAYJ,CAAAA,CAAKxC,EAAI,MAAA,CAAQ2F,CAAAA,CAAcsC,CAAU,CAAC,CAAA,CAExDG,CAAAA,EAAa3C,GAClBA,CAAAA,EAAY,CACTjD,CAAAA,CAEP2F,CAAAA,GACAF,CAAAA,CAAa,IAAA,CAAA,CACbC,GACID,CAAAA,GACAzF,CAAAA,EAAOI,EAAAA,CAAYJ,CAAAA,CAAKxC,CAAAA,CAAI,MAAA,CAAQ2F,CAAAA,CAAcsC,CAAU,CAAC,CAAA,CAAA,CACjEzF,CAAAA,CAAM,CAAA,EAAA,EAAKA,CAAG;AAAA,EAAKG,CAAM,CAAA,CAAA,CAAA,GAGzBH,CAAAA,CAAM,CAAA,EAAGA,CAAG,CAAA,CAAA,CAAA,CACRyF,CAAAA,GACAzF,CAAAA,EAAOI,EAAAA,CAAYJ,CAAAA,CAAKxC,CAAAA,CAAI,MAAA,CAAQ2F,CAAAA,CAAcsC,CAAU,CAAC,CAAA,CAAA,CAAA,CAErE,IAAII,CAAAA,CAAKC,CAAAA,CAAKC,CAAAA,CACV7M,CAAAA,CAAO1C,CAAK,CAAA,EACZqP,CAAAA,CAAM,CAAC,CAACrP,CAAAA,CAAM,WAAA,CACdsP,EAAMtP,CAAAA,CAAM,aAAA,CACZuP,CAAAA,CAAevP,CAAAA,CAAM,OAAA,GAGrBqP,CAAAA,CAAM,KAAA,CACNC,CAAAA,CAAM,IAAA,CACNC,CAAAA,CAAe,IAAA,CACXvP,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,GAC1BA,CAAAA,CAAQqF,CAAAA,CAAI,UAAA,CAAWrF,CAAK,CAAA,CAAA,CAAA,CAEpCgH,CAAAA,CAAI,WAAA,CAAc,KAAA,CACd,CAACkI,CAAAA,EAAe,CAACD,CAAAA,EAAc1M,CAAAA,CAASvC,CAAK,CAAA,GAC7CgH,EAAI,aAAA,CAAgBwC,CAAAA,CAAI,MAAA,CAAS,CAAA,CAAA,CACrC4F,CAAAA,CAAY,KAAA,CACR,CAACL,CAAAA,EACDrB,CAAAA,CAAW,MAAA,EAAU,CAAA,EACrB,CAAC1G,CAAAA,CAAI,MAAA,EACL,CAACkI,CAAAA,EACD1M,EAAAA,CAAMxC,CAAK,CAAA,EACX,CAACA,CAAAA,CAAM,IAAA,EACP,CAACA,CAAAA,CAAM,GAAA,EACP,CAACA,CAAAA,CAAM,MAAA,GAEPgH,CAAAA,CAAI,OAASA,CAAAA,CAAI,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CAAA,CAEvC,IAAIwI,CAAAA,CAAmB,KAAA,CACjBC,CAAAA,CAAWd,EAAAA,CAAU3O,CAAAA,CAAOgH,CAAAA,CAAK,IAAOwI,CAAAA,CAAmB,IAAA,CAAO,IAAOJ,CAAAA,CAAY,IAAK,CAAA,CAC5FM,CAAAA,CAAK,GAAA,CACT,GAAIT,CAAAA,EAAcI,CAAAA,EAAOC,CAAAA,CAAK,CAE1B,GADAI,CAAAA,CAAKL,CAAAA,CAAM;AAAA,CAAA,CAAO,EAAA,CACdC,EAAK,CACL,IAAMK,EAAKhD,CAAAA,CAAc2C,CAAG,EAC5BI,CAAAA,EAAM;AAAA,EAAKjG,EAAAA,CAAckG,CAAAA,CAAI3I,CAAAA,CAAI,MAAM,CAAC,CAAA,EAC5C,CACIyI,CAAAA,GAAa,EAAA,EAAM,CAACzI,CAAAA,CAAI,MAAA,CACpB0I,CAAAA,GAAO;AAAA,CAAA,GACPA,CAAAA,CAAK;;AAAA,CAAA,CAAA,CAGTA,CAAAA,EAAM;AAAA,EAAK1I,EAAI,MAAM,CAAA,EAE7B,CAAA,KAAA,GACS,CAACkI,GAAezM,CAAAA,CAAazC,CAAK,CAAA,CAAG,CAC1C,IAAM4P,CAAAA,CAAMH,CAAAA,CAAS,CAAC,CAAA,CAChBI,CAAAA,CAAMJ,EAAS,OAAA,CAAQ;AAAA,CAAI,CAAA,CAC3BK,CAAAA,CAAaD,CAAAA,GAAQ,EAAA,CACrBE,CAAAA,CAAO/I,CAAAA,CAAI,MAAA,EAAUhH,CAAAA,CAAM,IAAA,EAAQA,CAAAA,CAAM,KAAA,CAAM,MAAA,GAAW,CAAA,CAChE,GAAI8P,CAAAA,EAAc,CAACC,CAAAA,CAAM,CACrB,IAAIC,CAAAA,CAAe,KAAA,CACnB,GAAIF,CAAAA,GAAeF,CAAAA,GAAQ,GAAA,EAAOA,CAAAA,GAAQ,GAAA,CAAA,CAAM,CAC5C,IAAIK,CAAAA,CAAMR,CAAAA,CAAS,OAAA,CAAQ,GAAG,CAAA,CAC1BG,CAAAA,GAAQ,GAAA,EACRK,CAAAA,GAAQ,EAAA,EACRA,CAAAA,CAAMJ,CAAAA,EACNJ,CAAAA,CAASQ,CAAAA,CAAM,CAAC,CAAA,GAAM,GAAA,GACtBA,CAAAA,CAAMR,CAAAA,CAAS,OAAA,CAAQ,GAAA,CAAKQ,CAAAA,CAAM,CAAC,CAAA,CAAA,CAAA,CAEnCA,CAAAA,GAAQ,EAAA,EAAMJ,CAAAA,CAAMI,CAAAA,IACpBD,CAAAA,CAAe,IAAA,EACvB,CACKA,CAAAA,GACDN,CAAAA,CAAK;AAAA,EAAK1I,CAAAA,CAAI,MAAM,CAAA,CAAA,EAC5B,CACJ,OACSyI,CAAAA,GAAa,EAAA,EAAMA,CAAAA,CAAS,CAAC,CAAA,GAAM;AAAA,CAAA,IACxCC,CAAAA,CAAK,IAET,OAAAlG,CAAAA,EAAOkG,EAAKD,CAAAA,CACRzI,CAAAA,CAAI,OACAwI,CAAAA,EAAoBhD,CAAAA,EACpBA,GAAU,CAET+C,CAAAA,EAAgB,CAACC,CAAAA,CACtBhG,CAAAA,EAAOI,GAAYJ,CAAAA,CAAKxC,CAAAA,CAAI,OAAQ2F,CAAAA,CAAc4C,CAAY,CAAC,CAAA,CAE1DH,CAAAA,EAAa3C,GAClBA,CAAAA,EAAY,CAETjD,CACX,CCzIA,IAAM0G,GAAY,IAAA,CACZC,EAAAA,CAAQ,CACV,QAAA,CAAUnQ,CAAAA,EAASA,IAAUkQ,EAAAA,EACxB,OAAOlQ,GAAU,QAAA,EAAYA,CAAAA,CAAM,cAAgBkQ,EAAAA,CACxD,OAAA,CAAS,MACT,GAAA,CAAK,yBAAA,CACL,KAAM,MAAA,CACN,OAAA,CAAS,IAAM,MAAA,CAAO,MAAA,CAAO,IAAI/H,CAAAA,CAAO,MAAA,CAAO+H,EAAS,CAAC,CAAA,CAAG,CACxD,UAAA,CAAYE,EAChB,CAAC,CAAA,CACD,SAAA,CAAW,IAAMF,EACrB,CAAA,CACMG,GAAa,CAACrJ,CAAAA,CAAK5D,KAAS+M,EAAAA,CAAM,QAAA,CAAS/M,CAAG,CAAA,EAC/Cb,CAAAA,CAASa,CAAG,CAAA,GACR,CAACA,EAAI,IAAA,EAAQA,CAAAA,CAAI,OAAS+E,CAAAA,CAAO,KAAA,CAAA,EAClCgI,GAAM,QAAA,CAAS/M,CAAAA,CAAI,KAAK,CAAA,GAC5B4D,CAAAA,EAAK,IAAI,MAAA,CAAO,IAAA,CAAK,KAAK5B,CAAAA,EAAOA,CAAAA,CAAI,MAAQ+K,EAAAA,CAAM,GAAA,EAAO/K,EAAI,OAAO,CAAA,CACzE,SAASgL,EAAAA,CAAgBpJ,CAAAA,CAAK2B,EAAK3I,CAAAA,CAAO,CAEtC,GADAA,CAAAA,CAAQgH,CAAAA,EAAO9E,EAAQlC,CAAK,CAAA,CAAIA,EAAM,OAAA,CAAQgH,CAAAA,CAAI,GAAG,CAAA,CAAIhH,CAAAA,CACrDwC,GAAMxC,CAAK,CAAA,CACX,QAAWmJ,CAAAA,IAAMnJ,CAAAA,CAAM,MACnBsQ,EAAAA,CAAWtJ,CAAAA,CAAK2B,EAAKQ,CAAE,CAAA,CAAA,KAAA,GACtB,MAAM,OAAA,CAAQnJ,CAAK,EACxB,IAAA,IAAWmJ,CAAAA,IAAMnJ,EACbsQ,EAAAA,CAAWtJ,CAAAA,CAAK2B,EAAKQ,CAAE,CAAA,CAAA,KAE3BmH,GAAWtJ,CAAAA,CAAK2B,CAAAA,CAAK3I,CAAK,EAClC,CACA,SAASsQ,EAAAA,CAAWtJ,CAAAA,CAAK2B,EAAK3I,CAAAA,CAAO,CACjC,IAAMgF,CAAAA,CAASgC,CAAAA,EAAO9E,EAAQlC,CAAK,CAAA,CAAIA,EAAM,OAAA,CAAQgH,CAAAA,CAAI,GAAG,CAAA,CAAIhH,CAAAA,CAChE,GAAI,CAACqC,EAAAA,CAAM2C,CAAM,CAAA,CACb,MAAM,IAAI,KAAA,CAAM,2CAA2C,EAC/D,IAAMuL,CAAAA,CAASvL,EAAO,MAAA,CAAO,IAAA,CAAMgC,EAAK,GAAG,CAAA,CAC3C,OAAW,CAAC5D,CAAAA,CAAKpD,CAAK,CAAA,GAAKuQ,CAAAA,CACnB5H,aAAe,GAAA,CACVA,CAAAA,CAAI,IAAIvF,CAAG,CAAA,EACZuF,EAAI,GAAA,CAAIvF,CAAAA,CAAKpD,CAAK,CAAA,CAEjB2I,CAAAA,YAAe,IACpBA,CAAAA,CAAI,GAAA,CAAIvF,CAAG,CAAA,CAEL,MAAA,CAAO,UAAU,cAAA,CAAe,IAAA,CAAKuF,EAAKvF,CAAG,CAAA,EACnD,OAAO,cAAA,CAAeuF,CAAAA,CAAKvF,EAAK,CAC5B,KAAA,CAAApD,EACA,QAAA,CAAU,IAAA,CACV,WAAY,IAAA,CACZ,YAAA,CAAc,IAClB,CAAC,CAAA,CAGT,OAAO2I,CACX,CCvDA,SAAS6H,EAAAA,CAAexJ,CAAAA,CAAK2B,EAAK,CAAE,GAAA,CAAAvF,EAAK,KAAA,CAAApD,CAAM,EAAG,CAC9C,GAAI0C,EAAOU,CAAG,CAAA,EAAKA,EAAI,UAAA,CACnBA,CAAAA,CAAI,WAAW4D,CAAAA,CAAK2B,CAAAA,CAAK3I,CAAK,CAAA,CAAA,KAAA,GAEzBqQ,EAAAA,CAAWrJ,EAAK5D,CAAG,CAAA,CACxBgN,GAAgBpJ,CAAAA,CAAK2B,CAAAA,CAAK3I,CAAK,CAAA,CAAA,KAC9B,CACD,IAAMyQ,CAAAA,CAAQ3J,CAAAA,CAAK1D,EAAK,EAAA,CAAI4D,CAAG,EAC/B,GAAI2B,CAAAA,YAAe,IACfA,CAAAA,CAAI,GAAA,CAAI8H,EAAO3J,CAAAA,CAAK9G,CAAAA,CAAOyQ,EAAOzJ,CAAG,CAAC,UAEjC2B,CAAAA,YAAe,GAAA,CACpBA,EAAI,GAAA,CAAI8H,CAAK,OAEZ,CACD,IAAMC,EAAYC,EAAAA,CAAavN,CAAAA,CAAKqN,EAAOzJ,CAAG,CAAA,CACxC4J,EAAU9J,CAAAA,CAAK9G,CAAAA,CAAO0Q,EAAW1J,CAAG,CAAA,CACtC0J,KAAa/H,CAAAA,CACb,MAAA,CAAO,eAAeA,CAAAA,CAAK+H,CAAAA,CAAW,CAClC,KAAA,CAAOE,CAAAA,CACP,SAAU,IAAA,CACV,UAAA,CAAY,KACZ,YAAA,CAAc,IAClB,CAAC,CAAA,CAEDjI,CAAAA,CAAI+H,CAAS,CAAA,CAAIE,EACzB,CACJ,CACA,OAAOjI,CACX,CACA,SAASgI,GAAavN,CAAAA,CAAKqN,CAAAA,CAAOzJ,EAAK,CACnC,GAAIyJ,IAAU,IAAA,CACV,OAAO,GAEX,GAAI,OAAOA,GAAU,QAAA,CACjB,OAAO,OAAOA,CAAK,CAAA,CACvB,GAAI/N,CAAAA,CAAOU,CAAG,GAAK4D,CAAAA,EAAK,GAAA,CAAK,CACzB,IAAM6J,CAAAA,CAASzC,GAAuBpH,CAAAA,CAAI,GAAA,CAAK,EAAE,CAAA,CACjD6J,EAAO,OAAA,CAAU,IAAI,IACrB,IAAA,IAAW1O,CAAAA,IAAQ6E,EAAI,OAAA,CAAQ,IAAA,EAAK,CAChC6J,CAAAA,CAAO,OAAA,CAAQ,GAAA,CAAI1O,EAAK,MAAM,CAAA,CAClC0O,EAAO,MAAA,CAAS,IAAA,CAChBA,EAAO,cAAA,CAAiB,IAAA,CACxB,IAAMC,CAAAA,CAAS1N,CAAAA,CAAI,SAASyN,CAAM,CAAA,CAClC,GAAI,CAAC7J,CAAAA,CAAI,aAAc,CACnB,IAAI+J,EAAU,IAAA,CAAK,SAAA,CAAUD,CAAM,CAAA,CAC/BC,CAAAA,CAAQ,OAAS,EAAA,GACjBA,CAAAA,CAAUA,EAAQ,SAAA,CAAU,CAAA,CAAG,EAAE,CAAA,CAAI,MAAA,CAAA,CACpC/J,EAAI,GAAA,CAAI,OAAA,CAAQ,SACrBA,CAAAA,CAAI,YAAA,CAAe,KACvB,CACA,OAAO8J,CACX,CACA,OAAO,KAAK,SAAA,CAAUL,CAAK,CAC/B,CCvDA,SAASO,GAAW5N,CAAAA,CAAKpD,CAAAA,CAAOgH,EAAK,CACjC,IAAMH,EAAI6B,EAAAA,CAAWtF,CAAAA,CAAK,OAAW4D,CAAG,CAAA,CAClCC,EAAIyB,EAAAA,CAAW1I,CAAAA,CAAO,OAAWgH,CAAG,CAAA,CAC1C,OAAO,IAAIiK,CAAAA,CAAKpK,EAAGI,CAAC,CACxB,CACA,IAAMgK,CAAAA,CAAN,MAAMC,CAAK,CACP,YAAY9N,CAAAA,CAAKpD,CAAAA,CAAQ,KAAM,CAC3B,MAAA,CAAO,eAAe,IAAA,CAAMiC,CAAAA,CAAW,CAAE,KAAA,CAAOH,EAAK,CAAC,CAAA,CACtD,IAAA,CAAK,IAAMsB,CAAAA,CACX,IAAA,CAAK,MAAQpD,EACjB,CACA,MAAM8I,CAAAA,CAAQ,CACV,GAAI,CAAE,GAAA,CAAA1F,EAAK,KAAA,CAAApD,CAAM,EAAI,IAAA,CACrB,OAAI0C,EAAOU,CAAG,CAAA,GACVA,EAAMA,CAAAA,CAAI,KAAA,CAAM0F,CAAM,CAAA,CAAA,CACtBpG,CAAAA,CAAO1C,CAAK,CAAA,GACZA,CAAAA,CAAQA,EAAM,KAAA,CAAM8I,CAAM,GACvB,IAAIoI,CAAAA,CAAK9N,EAAKpD,CAAK,CAC9B,CACA,MAAA,CAAOmR,CAAAA,CAAGnK,EAAK,CACX,IAAMoK,EAAOpK,CAAAA,EAAK,QAAA,CAAW,IAAI,GAAA,CAAQ,GACzC,OAAOwJ,EAAAA,CAAexJ,EAAKoK,CAAAA,CAAM,IAAI,CACzC,CACA,QAAA,CAASpK,EAAKwF,CAAAA,CAAWC,CAAAA,CAAa,CAClC,OAAOzF,CAAAA,EAAK,IACN6H,EAAAA,CAAc,IAAA,CAAM7H,EAAKwF,CAAAA,CAAWC,CAAW,EAC/C,IAAA,CAAK,SAAA,CAAU,IAAI,CAC7B,CACJ,EC7BA,SAAS4E,EAAAA,CAAoBC,EAAYtK,CAAAA,CAAKqH,CAAAA,CAAS,CAGnD,OAAA,CAFarH,CAAAA,CAAI,MAAA,EAAUsK,CAAAA,CAAW,IAAA,CACbC,EAAAA,CAA0BC,IAClCF,CAAAA,CAAYtK,CAAAA,CAAKqH,CAAO,CAC7C,CACA,SAASmD,EAAAA,CAAyB,CAAE,QAAA9H,CAAAA,CAAS,KAAA,CAAA+H,CAAM,CAAA,CAAGzK,CAAAA,CAAK,CAAE,eAAA,CAAA0K,CAAAA,CAAiB,UAAAC,CAAAA,CAAW,UAAA,CAAAC,EAAY,WAAA,CAAAnF,CAAAA,CAAa,UAAAD,CAAU,CAAA,CAAG,CAC3H,GAAM,CAAE,OAAA7C,CAAAA,CAAQ,OAAA,CAAS,CAAE,aAAA,CAAAgD,CAAc,CAAE,CAAA,CAAI3F,CAAAA,CACzC6K,EAAU,MAAA,CAAO,MAAA,CAAO,EAAC,CAAG7K,CAAAA,CAAK,CAAE,MAAA,CAAQ4K,CAAAA,CAAY,KAAM,IAAK,CAAC,EACrExC,CAAAA,CAAY,KAAA,CACV3R,EAAQ,EAAC,CACf,QAASE,CAAAA,CAAI,CAAA,CAAGA,EAAI8T,CAAAA,CAAM,MAAA,CAAQ,EAAE9T,CAAAA,CAAG,CACnC,IAAMmK,CAAAA,CAAO2J,CAAAA,CAAM9T,CAAC,CAAA,CAChB+L,CAAAA,CAAU,KACd,GAAIhH,CAAAA,CAAOoF,CAAI,CAAA,CACP,CAACsH,GAAatH,CAAAA,CAAK,WAAA,EACnBrK,EAAM,IAAA,CAAK,EAAE,EACjBqU,EAAAA,CAAiB9K,CAAAA,CAAKvJ,EAAOqK,CAAAA,CAAK,aAAA,CAAesH,CAAS,CAAA,CACtDtH,CAAAA,CAAK,UACL4B,CAAAA,CAAU5B,CAAAA,CAAK,iBAEdxF,CAAAA,CAAOwF,CAAI,EAAG,CACnB,IAAMiK,EAAKrP,CAAAA,CAAOoF,CAAAA,CAAK,GAAG,CAAA,CAAIA,CAAAA,CAAK,IAAM,IAAA,CACrCiK,CAAAA,GACI,CAAC3C,CAAAA,EAAa2C,CAAAA,CAAG,aACjBtU,CAAAA,CAAM,IAAA,CAAK,EAAE,CAAA,CACjBqU,EAAAA,CAAiB9K,EAAKvJ,CAAAA,CAAOsU,CAAAA,CAAG,cAAe3C,CAAS,CAAA,EAEhE,CACAA,CAAAA,CAAY,KAAA,CACZ,IAAI5F,CAAAA,CAAMmF,EAAAA,CAAU7G,EAAM+J,CAAAA,CAAS,IAAOnI,EAAU,IAAA,CAAO,IAAO0F,EAAY,IAAK,CAAA,CAC/E1F,IACAF,CAAAA,EAAOI,EAAAA,CAAYJ,EAAKoI,CAAAA,CAAYjF,CAAAA,CAAcjD,CAAO,CAAC,CAAA,CAAA,CAC1D0F,GAAa1F,CAAAA,GACb0F,CAAAA,CAAY,OAChB3R,CAAAA,CAAM,IAAA,CAAKiU,EAAkBlI,CAAG,EACpC,CACA,IAAIA,CAAAA,CACJ,GAAI/L,CAAAA,CAAM,MAAA,GAAW,EACjB+L,CAAAA,CAAMmI,CAAAA,CAAU,MAAQA,CAAAA,CAAU,GAAA,CAAA,KAEjC,CACDnI,CAAAA,CAAM/L,CAAAA,CAAM,CAAC,CAAA,CACb,IAAA,IAASE,EAAI,CAAA,CAAGA,CAAAA,CAAIF,EAAM,MAAA,CAAQ,EAAEE,EAAG,CACnC,IAAM6G,EAAO/G,CAAAA,CAAME,CAAC,CAAA,CACpB6L,CAAAA,EAAOhF,CAAAA,CAAO;AAAA,EAAKmF,CAAM,CAAA,EAAGnF,CAAI,CAAA,CAAA,CAAK;AAAA,EACzC,CACJ,CACA,OAAIkF,CAAAA,EACAF,CAAAA,EAAO;AAAA,CAAA,CAAOC,EAAAA,CAAckD,EAAcjD,CAAO,CAAA,CAAGC,CAAM,CAAA,CACtD6C,CAAAA,EACAA,GAAU,EAET4C,CAAAA,EAAa3C,GAClBA,CAAAA,EAAY,CACTjD,CACX,CACA,SAAS+H,GAAwB,CAAE,KAAA,CAAAE,CAAM,CAAA,CAAGzK,CAAAA,CAAK,CAAE,UAAA2K,CAAAA,CAAW,UAAA,CAAAC,CAAW,CAAA,CAAG,CACxE,GAAM,CAAE,MAAA,CAAAjI,EAAQ,UAAA,CAAA+D,CAAAA,CAAY,sBAAuBsE,CAAAA,CAAW,OAAA,CAAS,CAAE,aAAA,CAAArF,CAAc,CAAE,CAAA,CAAI3F,CAAAA,CAC7F4K,CAAAA,EAAclE,CAAAA,CACd,IAAMmE,CAAAA,CAAU,OAAO,MAAA,CAAO,GAAI7K,CAAAA,CAAK,CACnC,OAAQ4K,CAAAA,CACR,MAAA,CAAQ,KACR,IAAA,CAAM,IACV,CAAC,CAAA,CACGK,CAAAA,CAAa,MACbC,CAAAA,CAAe,CAAA,CACbzU,EAAQ,EAAC,CACf,IAAA,IAASE,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI8T,EAAM,MAAA,CAAQ,EAAE9T,EAAG,CACnC,IAAMmK,EAAO2J,CAAAA,CAAM9T,CAAC,CAAA,CAChB+L,CAAAA,CAAU,IAAA,CACd,GAAIhH,EAAOoF,CAAI,CAAA,CACPA,EAAK,WAAA,EACLrK,CAAAA,CAAM,KAAK,EAAE,CAAA,CACjBqU,EAAAA,CAAiB9K,CAAAA,CAAKvJ,CAAAA,CAAOqK,CAAAA,CAAK,cAAe,KAAK,CAAA,CAClDA,EAAK,OAAA,GACL4B,CAAAA,CAAU5B,EAAK,OAAA,CAAA,CAAA,KAAA,GAEdxF,CAAAA,CAAOwF,CAAI,CAAA,CAAG,CACnB,IAAMiK,CAAAA,CAAKrP,CAAAA,CAAOoF,EAAK,GAAG,CAAA,CAAIA,EAAK,GAAA,CAAM,IAAA,CACrCiK,CAAAA,GACIA,CAAAA,CAAG,WAAA,EACHtU,CAAAA,CAAM,KAAK,EAAE,CAAA,CACjBqU,GAAiB9K,CAAAA,CAAKvJ,CAAAA,CAAOsU,EAAG,aAAA,CAAe,KAAK,CAAA,CAChDA,CAAAA,CAAG,OAAA,GACHE,CAAAA,CAAa,OAErB,IAAME,CAAAA,CAAKzP,EAAOoF,CAAAA,CAAK,KAAK,EAAIA,CAAAA,CAAK,KAAA,CAAQ,IAAA,CACzCqK,CAAAA,EACIA,CAAAA,CAAG,OAAA,GACHzI,EAAUyI,CAAAA,CAAG,OAAA,CAAA,CACbA,EAAG,aAAA,GACHF,CAAAA,CAAa,OAEZnK,CAAAA,CAAK,KAAA,EAAS,MAAQiK,CAAAA,EAAI,OAAA,GAC/BrI,EAAUqI,CAAAA,CAAG,OAAA,EAErB,CACIrI,CAAAA,GACAuI,CAAAA,CAAa,MACjB,IAAIzI,CAAAA,CAAMmF,EAAAA,CAAU7G,CAAAA,CAAM+J,CAAAA,CAAS,IAAOnI,EAAU,IAAK,CAAA,CACrD/L,EAAI8T,CAAAA,CAAM,MAAA,CAAS,IACnBjI,CAAAA,EAAO,GAAA,CAAA,CACPE,CAAAA,GACAF,CAAAA,EAAOI,EAAAA,CAAYJ,CAAAA,CAAKoI,EAAYjF,CAAAA,CAAcjD,CAAO,CAAC,CAAA,CAAA,CAC1D,CAACuI,IAAexU,CAAAA,CAAM,MAAA,CAASyU,CAAAA,EAAgB1I,CAAAA,CAAI,QAAA,CAAS;AAAA,CAAI,CAAA,CAAA,GAChEyI,CAAAA,CAAa,IAAA,CAAA,CACjBxU,CAAAA,CAAM,IAAA,CAAK+L,CAAG,CAAA,CACd0I,CAAAA,CAAezU,CAAAA,CAAM,OACzB,CACA,GAAM,CAAE,KAAA,CAAAH,CAAAA,CAAO,GAAA,CAAAC,CAAI,CAAA,CAAIoU,CAAAA,CACvB,GAAIlU,CAAAA,CAAM,MAAA,GAAW,CAAA,CACjB,OAAOH,CAAAA,CAAQC,CAAAA,CAGf,GAAI,CAAC0U,EAAY,CACb,IAAMvL,CAAAA,CAAMjJ,CAAAA,CAAM,MAAA,CAAO,CAAC2U,CAAAA,CAAK5N,CAAAA,GAAS4N,CAAAA,CAAM5N,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAG,CAAC,CAAA,CAChEyN,CAAAA,CAAajL,CAAAA,CAAI,QAAQ,SAAA,CAAY,CAAA,EAAKN,CAAAA,CAAMM,CAAAA,CAAI,OAAA,CAAQ,UAChE,CACA,GAAIiL,CAAAA,CAAY,CACZ,IAAIzI,CAAAA,CAAMlM,CAAAA,CACV,IAAA,IAAWkH,CAAAA,IAAQ/G,CAAAA,CACf+L,GAAOhF,CAAAA,CAAO;AAAA,EAAKkJ,CAAU,CAAA,EAAG/D,CAAM,CAAA,EAAGnF,CAAI,CAAA,CAAA,CAAK;AAAA,CAAA,CACtD,OAAO,GAAGgF,CAAG;AAAA,EAAKG,CAAM,CAAA,EAAGpM,CAAG,CAAA,CAClC,CAAA,YAEW,CAAA,EAAGD,CAAK,CAAA,EAAG0U,CAAS,CAAA,EAAGvU,CAAAA,CAAM,KAAK,GAAG,CAAC,CAAA,EAAGuU,CAAS,CAAA,EAAGzU,CAAG,EAG3E,CACA,SAASuU,EAAAA,CAAiB,CAAE,MAAA,CAAAnI,CAAAA,CAAQ,QAAS,CAAE,aAAA,CAAAgD,CAAc,CAAE,CAAA,CAAGlP,CAAAA,CAAOiM,EAAS0F,CAAAA,CAAW,CAGzF,GAFI1F,CAAAA,EAAW0F,CAAAA,GACX1F,CAAAA,CAAUA,EAAQ,OAAA,CAAQ,MAAA,CAAQ,EAAE,CAAA,CAAA,CACpCA,CAAAA,CAAS,CACT,IAAM2I,CAAAA,CAAK5I,EAAAA,CAAckD,CAAAA,CAAcjD,CAAO,CAAA,CAAGC,CAAM,EACvDlM,CAAAA,CAAM,IAAA,CAAK4U,CAAAA,CAAG,SAAA,EAAW,EAC7B,CACJ,CCrIA,SAASC,EAAAA,CAASb,CAAAA,CAAOrO,CAAAA,CAAK,CAC1B,IAAMyD,CAAAA,CAAItE,CAAAA,CAASa,CAAG,CAAA,CAAIA,CAAAA,CAAI,KAAA,CAAQA,EACtC,IAAA,IAAW+F,CAAAA,IAAMsI,CAAAA,CACb,GAAInP,CAAAA,CAAO6G,CAAE,IACLA,CAAAA,CAAG,GAAA,GAAQ/F,CAAAA,EAAO+F,CAAAA,CAAG,GAAA,GAAQtC,CAAAA,EAE7BtE,EAAS4G,CAAAA,CAAG,GAAG,CAAA,EAAKA,CAAAA,CAAG,GAAA,CAAI,KAAA,GAAUtC,GACrC,OAAOsC,CAIvB,CACA,IAAMoJ,CAAAA,CAAN,cAAsBrJ,EAAW,CAC7B,WAAW,OAAA,EAAU,CACjB,OAAO,uBACX,CACA,WAAA,CAAYJ,CAAAA,CAAQ,CAChB,KAAA,CAAMjH,EAAAA,CAAKiH,CAAM,EACjB,IAAA,CAAK,KAAA,CAAQ,GACjB,CAKA,OAAO,KAAKA,CAAAA,CAAQtC,CAAAA,CAAKQ,CAAAA,CAAK,CAC1B,GAAM,CAAE,cAAAwL,CAAAA,CAAe,QAAA,CAAAC,CAAS,CAAA,CAAIzL,CAAAA,CAC9B2B,CAAAA,CAAM,IAAI,IAAA,CAAKG,CAAM,CAAA,CACrB4J,CAAAA,CAAM,CAACtP,CAAAA,CAAKpD,IAAU,CACxB,GAAI,OAAOyS,CAAAA,EAAa,UAAA,CACpBzS,CAAAA,CAAQyS,EAAS,IAAA,CAAKjM,CAAAA,CAAKpD,CAAAA,CAAKpD,CAAK,CAAA,CAAA,KAAA,GAChC,KAAA,CAAM,QAAQyS,CAAQ,CAAA,EAAK,CAACA,CAAAA,CAAS,QAAA,CAASrP,CAAG,EACtD,OAAA,CACApD,CAAAA,GAAU,MAAA,EAAawS,CAAAA,GACvB7J,CAAAA,CAAI,KAAA,CAAM,KAAKqI,EAAAA,CAAW5N,CAAAA,CAAKpD,CAAAA,CAAOgH,CAAG,CAAC,EAClD,EACA,GAAIR,CAAAA,YAAe,GAAA,CACf,IAAA,GAAW,CAACpD,CAAAA,CAAKpD,CAAK,CAAA,GAAKwG,CAAAA,CACvBkM,CAAAA,CAAItP,CAAAA,CAAKpD,CAAK,CAAA,CAAA,KAAA,GAEbwG,GAAO,OAAOA,CAAAA,EAAQ,QAAA,CAC3B,IAAA,IAAWpD,CAAAA,IAAO,MAAA,CAAO,KAAKoD,CAAG,CAAA,CAC7BkM,CAAAA,CAAItP,CAAAA,CAAKoD,CAAAA,CAAIpD,CAAG,CAAC,CAAA,CAEzB,OAAI,OAAO0F,CAAAA,CAAO,cAAA,EAAmB,UAAA,EACjCH,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAKG,CAAAA,CAAO,cAAc,CAAA,CAEjCH,CACX,CAOA,IAAIyI,CAAAA,CAAMuB,CAAAA,CAAW,CACjB,IAAIC,CAAAA,CACAtQ,CAAAA,CAAO8O,CAAI,CAAA,CACXwB,CAAAA,CAAQxB,CAAAA,CACH,CAACA,CAAAA,EAAQ,OAAOA,GAAS,QAAA,EAAY,EAAE,KAAA,GAASA,CAAAA,CAAAA,CAErDwB,CAAAA,CAAQ,IAAI3B,EAAKG,CAAAA,CAAMA,CAAAA,EAAM,KAAK,CAAA,CAGlCwB,CAAAA,CAAQ,IAAI3B,EAAKG,CAAAA,CAAK,GAAA,CAAKA,CAAAA,CAAK,KAAK,CAAA,CACzC,IAAMxG,EAAO0H,EAAAA,CAAS,IAAA,CAAK,KAAA,CAAOM,CAAAA,CAAM,GAAG,CAAA,CACrCC,EAAc,IAAA,CAAK,MAAA,EAAQ,cAAA,CACjC,GAAIjI,CAAAA,CAAM,CACN,GAAI,CAAC+H,CAAAA,CACD,MAAM,IAAI,KAAA,CAAM,CAAA,IAAA,EAAOC,EAAM,GAAG,CAAA,YAAA,CAAc,CAAA,CAE9CrQ,CAAAA,CAASqI,CAAAA,CAAK,KAAK,GAAK1C,EAAAA,CAAc0K,CAAAA,CAAM,KAAK,CAAA,CACjDhI,CAAAA,CAAK,KAAA,CAAM,MAAQgI,CAAAA,CAAM,KAAA,CAEzBhI,CAAAA,CAAK,KAAA,CAAQgI,CAAAA,CAAM,MAC3B,SACSC,CAAAA,CAAa,CAClB,IAAMlV,CAAAA,CAAI,IAAA,CAAK,KAAA,CAAM,UAAUmK,CAAAA,EAAQ+K,CAAAA,CAAYD,CAAAA,CAAO9K,CAAI,CAAA,CAAI,CAAC,EAC/DnK,CAAAA,GAAM,EAAA,CACN,IAAA,CAAK,KAAA,CAAM,IAAA,CAAKiV,CAAK,EAErB,IAAA,CAAK,KAAA,CAAM,MAAA,CAAOjV,CAAAA,CAAG,CAAA,CAAGiV,CAAK,EACrC,CAAA,KAEI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAKA,CAAK,EAE7B,CACA,MAAA,CAAOxP,CAAAA,CAAK,CACR,IAAM+F,CAAAA,CAAKmJ,EAAAA,CAAS,KAAK,KAAA,CAAOlP,CAAG,CAAA,CACnC,OAAK+F,CAAAA,CAEO,IAAA,CAAK,MAAM,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQA,CAAE,CAAA,CAAG,CAAC,CAAA,CAC5C,MAAA,CAAS,CAAA,CAFT,KAGf,CACA,GAAA,CAAI/F,EAAKiG,CAAAA,CAAY,CAEjB,IAAMlH,CAAAA,CADKmQ,EAAAA,CAAS,IAAA,CAAK,MAAOlP,CAAG,CAAA,EAClB,KAAA,CACjB,OAAA,CAAQ,CAACiG,CAAAA,EAAc9G,EAASJ,CAAI,CAAA,CAAIA,CAAAA,CAAK,KAAA,CAAQA,CAAAA,GAAS,MAClE,CACA,GAAA,CAAIiB,CAAAA,CAAK,CACL,OAAO,CAAC,CAACkP,GAAS,IAAA,CAAK,KAAA,CAAOlP,CAAG,CACrC,CACA,GAAA,CAAIA,EAAKpD,CAAAA,CAAO,CACZ,IAAA,CAAK,GAAA,CAAI,IAAIiR,CAAAA,CAAK7N,EAAKpD,CAAK,CAAA,CAAG,IAAI,EACvC,CAMA,MAAA,CAAOmR,EAAGnK,CAAAA,CAAK8L,CAAAA,CAAM,CACjB,IAAMnK,CAAAA,CAAMmK,CAAAA,CAAO,IAAIA,CAAAA,CAAS9L,CAAAA,EAAK,QAAA,CAAW,IAAI,GAAA,CAAQ,GACxDA,CAAAA,EAAK,QAAA,EACLA,CAAAA,CAAI,QAAA,CAAS2B,CAAG,CAAA,CACpB,QAAWb,CAAAA,IAAQ,IAAA,CAAK,KAAA,CACpB0I,EAAAA,CAAexJ,CAAAA,CAAK2B,CAAAA,CAAKb,CAAI,CAAA,CACjC,OAAOa,CACX,CACA,QAAA,CAAS3B,CAAAA,CAAKwF,CAAAA,CAAWC,EAAa,CAClC,GAAI,CAACzF,CAAAA,CACD,OAAO,IAAA,CAAK,UAAU,IAAI,CAAA,CAC9B,IAAA,IAAWc,CAAAA,IAAQ,IAAA,CAAK,KAAA,CACpB,GAAI,CAACxF,CAAAA,CAAOwF,CAAI,CAAA,CACZ,MAAM,IAAI,MAAM,CAAA,mCAAA,EAAsC,IAAA,CAAK,SAAA,CAAUA,CAAI,CAAC,CAAA,QAAA,CAAU,EAE5F,OAAI,CAACd,CAAAA,CAAI,aAAA,EAAiB,IAAA,CAAK,gBAAA,CAAiB,KAAK,CAAA,GACjDA,CAAAA,CAAM,MAAA,CAAO,MAAA,CAAO,EAAC,CAAGA,EAAK,CAAE,aAAA,CAAe,IAAK,CAAC,CAAA,CAAA,CACjDqK,EAAAA,CAAoB,KAAMrK,CAAAA,CAAK,CAClC,eAAA,CAAiB,EAAA,CACjB,SAAA,CAAW,CAAE,MAAO,GAAA,CAAK,GAAA,CAAK,GAAI,CAAA,CAClC,UAAA,CAAYA,CAAAA,CAAI,QAAU,EAAA,CAC1B,WAAA,CAAAyF,CAAAA,CACA,SAAA,CAAAD,CACJ,CAAC,CACL,CACJ,CAAA,CC1IA,IAAM7D,EAAAA,CAAM,CACR,UAAA,CAAY,MACZ,OAAA,CAAS,IAAA,CACT,SAAA,CAAW4J,CAAAA,CACX,GAAA,CAAK,uBAAA,CACL,QAAQ5J,CAAAA,CAAKlE,CAAAA,CAAS,CAClB,OAAKpC,EAAAA,CAAMsG,CAAG,GACVlE,CAAAA,CAAQ,iCAAiC,CAAA,CACtCkE,CACX,CAAA,CACA,UAAA,CAAY,CAACG,CAAAA,CAAQtC,CAAAA,CAAKQ,CAAAA,GAAQuL,CAAAA,CAAQ,IAAA,CAAKzJ,CAAAA,CAAQtC,EAAKQ,CAAG,CACnE,CAAA,CCPA,IAAM+L,CAAAA,CAAN,cAAsB7J,EAAW,CAC7B,WAAW,OAAA,EAAU,CACjB,OAAO,uBACX,CACA,WAAA,CAAYJ,CAAAA,CAAQ,CAChB,KAAA,CAAM9G,EAAAA,CAAK8G,CAAM,EACjB,IAAA,CAAK,KAAA,CAAQ,GACjB,CACA,GAAA,CAAI9I,EAAO,CACP,IAAA,CAAK,KAAA,CAAM,IAAA,CAAKA,CAAK,EACzB,CASA,MAAA,CAAOoD,CAAAA,CAAK,CACR,IAAM4P,CAAAA,CAAMC,EAAAA,CAAY7P,CAAG,CAAA,CAC3B,OAAI,OAAO4P,CAAAA,EAAQ,QAAA,CACR,KAAA,CACC,KAAK,KAAA,CAAM,MAAA,CAAOA,CAAAA,CAAK,CAAC,CAAA,CACzB,MAAA,CAAS,CACxB,CACA,GAAA,CAAI5P,CAAAA,CAAKiG,CAAAA,CAAY,CACjB,IAAM2J,EAAMC,EAAAA,CAAY7P,CAAG,CAAA,CAC3B,GAAI,OAAO4P,CAAAA,EAAQ,SACf,OACJ,IAAM7J,CAAAA,CAAK,IAAA,CAAK,KAAA,CAAM6J,CAAG,EACzB,OAAO,CAAC3J,CAAAA,EAAc9G,CAAAA,CAAS4G,CAAE,CAAA,CAAIA,EAAG,KAAA,CAAQA,CACpD,CAOA,GAAA,CAAI/F,CAAAA,CAAK,CACL,IAAM4P,CAAAA,CAAMC,EAAAA,CAAY7P,CAAG,CAAA,CAC3B,OAAO,OAAO4P,GAAQ,QAAA,EAAYA,CAAAA,CAAM,IAAA,CAAK,KAAA,CAAM,MACvD,CAQA,IAAI5P,CAAAA,CAAKpD,CAAAA,CAAO,CACZ,IAAMgT,CAAAA,CAAMC,EAAAA,CAAY7P,CAAG,CAAA,CAC3B,GAAI,OAAO4P,CAAAA,EAAQ,QAAA,CACf,MAAM,IAAI,MAAM,CAAA,4BAAA,EAA+B5P,CAAG,CAAA,CAAA,CAAG,CAAA,CACzD,IAAMwH,CAAAA,CAAO,KAAK,KAAA,CAAMoI,CAAG,CAAA,CACvBzQ,CAAAA,CAASqI,CAAI,CAAA,EAAK1C,GAAclI,CAAK,CAAA,CACrC4K,CAAAA,CAAK,KAAA,CAAQ5K,CAAAA,CAEb,IAAA,CAAK,MAAMgT,CAAG,CAAA,CAAIhT,EAC1B,CACA,MAAA,CAAOmR,CAAAA,CAAGnK,EAAK,CACX,IAAMkM,CAAAA,CAAM,EAAC,CACTlM,CAAAA,EAAK,UACLA,CAAAA,CAAI,QAAA,CAASkM,CAAG,CAAA,CACpB,IAAIvV,CAAAA,CAAI,EACR,IAAA,IAAWmK,CAAAA,IAAQ,IAAA,CAAK,KAAA,CACpBoL,CAAAA,CAAI,IAAA,CAAKpM,EAAKgB,CAAAA,CAAM,MAAA,CAAOnK,CAAAA,EAAG,CAAA,CAAGqJ,CAAG,CAAC,EACzC,OAAOkM,CACX,CACA,QAAA,CAASlM,CAAAA,CAAKwF,CAAAA,CAAWC,EAAa,CAClC,OAAKzF,CAAAA,CAEEqK,EAAAA,CAAoB,IAAA,CAAMrK,CAAAA,CAAK,CAClC,eAAA,CAAiB,IAAA,CACjB,SAAA,CAAW,CAAE,KAAA,CAAO,GAAA,CAAK,IAAK,GAAI,CAAA,CAClC,UAAA,CAAA,CAAaA,CAAAA,CAAI,MAAA,EAAU,EAAA,EAAM,KACjC,WAAA,CAAAyF,CAAAA,CACA,SAAA,CAAAD,CACJ,CAAC,CAAA,CAPU,KAAK,SAAA,CAAU,IAAI,CAQlC,CACA,OAAO,IAAA,CAAK1D,EAAQtC,CAAAA,CAAKQ,CAAAA,CAAK,CAC1B,GAAM,CAAE,QAAA,CAAAyL,CAAS,CAAA,CAAIzL,CAAAA,CACfkM,CAAAA,CAAM,IAAI,IAAA,CAAKpK,CAAM,CAAA,CAC3B,GAAItC,CAAAA,EAAO,MAAA,CAAO,QAAA,IAAY,MAAA,CAAOA,CAAG,CAAA,CAAG,CACvC,IAAI7I,CAAAA,CAAI,CAAA,CACR,IAAA,IAASwL,CAAAA,IAAM3C,CAAAA,CAAK,CAChB,GAAI,OAAOiM,CAAAA,EAAa,UAAA,CAAY,CAChC,IAAMrP,EAAMoD,CAAAA,YAAe,GAAA,CAAM2C,CAAAA,CAAK,MAAA,CAAOxL,CAAAA,EAAG,CAAA,CAChDwL,EAAKsJ,CAAAA,CAAS,IAAA,CAAKjM,CAAAA,CAAKpD,CAAAA,CAAK+F,CAAE,EACnC,CACA+J,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAKxK,EAAAA,CAAWS,CAAAA,CAAI,MAAA,CAAWnC,CAAG,CAAC,EACjD,CACJ,CACA,OAAOkM,CACX,CACJ,CAAA,CACA,SAASD,EAAAA,CAAY7P,CAAAA,CAAK,CACtB,IAAI4P,EAAMzQ,CAAAA,CAASa,CAAG,CAAA,CAAIA,CAAAA,CAAI,KAAA,CAAQA,CAAAA,CACtC,OAAI4P,CAAAA,EAAO,OAAOA,CAAAA,EAAQ,QAAA,GACtBA,CAAAA,CAAM,MAAA,CAAOA,CAAG,CAAA,CAAA,CACb,OAAOA,CAAAA,EAAQ,QAAA,EAAY,MAAA,CAAO,SAAA,CAAUA,CAAG,CAAA,EAAKA,CAAAA,EAAO,CAAA,CAC5DA,CAAAA,CACA,IACV,CC3GA,IAAME,EAAAA,CAAM,CACR,UAAA,CAAY,KAAA,CACZ,OAAA,CAAS,IAAA,CACT,UAAWH,CAAAA,CACX,GAAA,CAAK,uBAAA,CACL,OAAA,CAAQG,CAAAA,CAAKzO,CAAAA,CAAS,CAClB,OAAKjC,EAAAA,CAAM0Q,CAAG,CAAA,EACVzO,CAAAA,CAAQ,kCAAkC,CAAA,CACvCyO,CACX,CAAA,CACA,UAAA,CAAY,CAACpK,CAAAA,CAAQtC,CAAAA,CAAKQ,CAAAA,GAAQ+L,EAAQ,IAAA,CAAKjK,CAAAA,CAAQtC,CAAAA,CAAKQ,CAAG,CACnE,CAAA,CCZA,IAAMmM,EAAAA,CAAS,CACX,QAAA,CAAUnT,CAAAA,EAAS,OAAOA,CAAAA,EAAU,SACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,OAAA,CAASwJ,CAAAA,EAAOA,EAChB,SAAA,CAAU1B,CAAAA,CAAMd,CAAAA,CAAKwF,CAAAA,CAAWC,CAAAA,CAAa,CACzC,OAAAzF,CAAAA,CAAM,MAAA,CAAO,MAAA,CAAO,CAAE,YAAA,CAAc,IAAK,EAAGA,CAAG,CAAA,CACxC8G,EAAAA,CAAgBhG,CAAAA,CAAMd,CAAAA,CAAKwF,CAAAA,CAAWC,CAAW,CAC5D,CACJ,CAAA,CCTA,IAAM2G,EAAAA,CAAU,CACZ,SAAUpT,CAAAA,EAASA,CAAAA,EAAS,IAAA,CAC5B,UAAA,CAAY,IAAM,IAAImI,EAAO,IAAI,CAAA,CACjC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,wBAAA,CACL,KAAM,uBAAA,CACN,OAAA,CAAS,IAAM,IAAIA,CAAAA,CAAO,IAAI,EAC9B,SAAA,CAAW,CAAC,CAAE,MAAA,CAAAnD,CAAO,CAAA,CAAGgC,IAAQ,OAAOhC,CAAAA,EAAW,QAAA,EAAYoO,EAAAA,CAAQ,IAAA,CAAK,IAAA,CAAKpO,CAAM,CAAA,CAChFA,CAAAA,CACAgC,CAAAA,CAAI,OAAA,CAAQ,OACtB,CAAA,CCVA,IAAMqM,EAAAA,CAAU,CACZ,QAAA,CAAUrT,CAAAA,EAAS,OAAOA,CAAAA,EAAU,UACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,wBAAA,CACL,IAAA,CAAM,mCAAA,CACN,QAASwJ,CAAAA,EAAO,IAAIrB,CAAAA,CAAOqB,CAAAA,CAAI,CAAC,CAAA,GAAM,KAAOA,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAG,CAAA,CAC3D,SAAA,CAAU,CAAE,MAAA,CAAAxE,CAAAA,CAAQ,KAAA,CAAAhF,CAAM,CAAA,CAAGgH,CAAAA,CAAK,CAC9B,GAAIhC,CAAAA,EAAUqO,EAAAA,CAAQ,IAAA,CAAK,IAAA,CAAKrO,CAAM,EAAG,CACrC,IAAMsO,CAAAA,CAAKtO,CAAAA,CAAO,CAAC,CAAA,GAAM,KAAOA,CAAAA,CAAO,CAAC,CAAA,GAAM,GAAA,CAC9C,GAAIhF,CAAAA,GAAUsT,EACV,OAAOtO,CACf,CACA,OAAOhF,CAAAA,CAAQgH,CAAAA,CAAI,QAAQ,OAAA,CAAUA,CAAAA,CAAI,OAAA,CAAQ,QACrD,CACJ,CAAA,CChBA,SAASuM,CAAAA,CAAgB,CAAE,MAAA,CAAAC,CAAAA,CAAQ,iBAAA,CAAAC,CAAAA,CAAmB,IAAArO,CAAAA,CAAK,KAAA,CAAApF,CAAM,CAAA,CAAG,CAChE,GAAI,OAAOA,CAAAA,EAAU,QAAA,CACjB,OAAO,MAAA,CAAOA,CAAK,CAAA,CACvB,IAAM0T,CAAAA,CAAM,OAAO1T,CAAAA,EAAU,QAAA,CAAWA,CAAAA,CAAQ,MAAA,CAAOA,CAAK,CAAA,CAC5D,GAAI,CAAC,QAAA,CAAS0T,CAAG,CAAA,CACb,OAAO,KAAA,CAAMA,CAAG,CAAA,CAAI,MAAA,CAASA,CAAAA,CAAM,CAAA,CAAI,QAAU,MAAA,CACrD,IAAIhT,CAAAA,CAAI,IAAA,CAAK,SAAA,CAAUV,CAAK,EAC5B,GAAI,CAACwT,CAAAA,EACDC,CAAAA,GACC,CAACrO,CAAAA,EAAOA,CAAAA,GAAQ,yBAAA,CAAA,EACjB,KAAA,CAAM,IAAA,CAAK1E,CAAC,CAAA,CAAG,CACf,IAAI/C,EAAI+C,CAAAA,CAAE,OAAA,CAAQ,GAAG,CAAA,CACjB/C,CAAAA,CAAI,CAAA,GACJA,EAAI+C,CAAAA,CAAE,MAAA,CACNA,CAAAA,EAAK,GAAA,CAAA,CAET,IAAIiT,CAAAA,CAAIF,GAAqB/S,CAAAA,CAAE,MAAA,CAAS/C,CAAAA,CAAI,CAAA,CAAA,CAC5C,KAAOgW,CAAAA,EAAAA,EAAM,GACTjT,CAAAA,EAAK,IACb,CACA,OAAOA,CACX,CClBA,IAAMkT,EAAAA,CAAW,CACb,QAAA,CAAU5T,CAAAA,EAAS,OAAOA,CAAAA,EAAU,SACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,yBAAA,CACL,IAAA,CAAM,gDAAA,CACN,QAASwJ,CAAAA,EAAOA,CAAAA,CAAI,KAAA,CAAM,EAAE,CAAA,CAAE,WAAA,KAAkB,KAAA,CAC1C,GAAA,CACAA,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAA,CACP,OAAO,iBAAA,CACP,MAAA,CAAO,iBAAA,CACjB,SAAA,CAAW+J,CACf,CAAA,CACMM,GAAW,CACb,QAAA,CAAU7T,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,QAAS,IAAA,CACT,GAAA,CAAK,yBAAA,CACL,MAAA,CAAQ,KAAA,CACR,IAAA,CAAM,yDACN,OAAA,CAASwJ,CAAAA,EAAO,UAAA,CAAWA,CAAG,CAAA,CAC9B,SAAA,CAAUrH,EAAM,CACZ,IAAMuR,CAAAA,CAAM,MAAA,CAAOvR,CAAAA,CAAK,KAAK,EAC7B,OAAO,QAAA,CAASuR,CAAG,CAAA,CAAIA,CAAAA,CAAI,aAAA,GAAkBH,CAAAA,CAAgBpR,CAAI,CACrE,CACJ,CAAA,CACM2R,EAAAA,CAAQ,CACV,QAAA,CAAU9T,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,OAAA,CAAS,IAAA,CACT,IAAK,yBAAA,CACL,IAAA,CAAM,oCAAA,CACN,OAAA,CAAQwJ,CAAAA,CAAK,CACT,IAAMrH,CAAAA,CAAO,IAAIgG,CAAAA,CAAO,UAAA,CAAWqB,CAAG,CAAC,EACjCuK,CAAAA,CAAMvK,CAAAA,CAAI,OAAA,CAAQ,GAAG,CAAA,CAC3B,OAAIuK,IAAQ,EAAA,EAAMvK,CAAAA,CAAIA,CAAAA,CAAI,MAAA,CAAS,CAAC,CAAA,GAAM,MACtCrH,CAAAA,CAAK,iBAAA,CAAoBqH,CAAAA,CAAI,MAAA,CAASuK,CAAAA,CAAM,CAAA,CAAA,CACzC5R,CACX,CAAA,CACA,SAAA,CAAWoR,CACf,CAAA,CCtCA,IAAMS,EAAAA,CAAehU,GAAU,OAAOA,CAAAA,EAAU,QAAA,EAAY,MAAA,CAAO,SAAA,CAAUA,CAAK,EAC5EiU,EAAAA,CAAa,CAACzK,CAAAA,CAAK9L,CAAAA,CAAQwW,CAAAA,CAAO,CAAE,YAAAC,CAAY,CAAA,GAAOA,CAAAA,CAAc,MAAA,CAAO3K,CAAG,CAAA,CAAI,SAASA,CAAAA,CAAI,SAAA,CAAU9L,CAAM,CAAA,CAAGwW,CAAK,CAAA,CAC9H,SAASE,EAAAA,CAAajS,CAAAA,CAAM+R,CAAAA,CAAOrP,CAAAA,CAAQ,CACvC,GAAM,CAAE,KAAA,CAAA7E,CAAM,CAAA,CAAImC,CAAAA,CAClB,OAAI6R,EAAAA,CAAYhU,CAAK,CAAA,EAAKA,CAAAA,EAAS,CAAA,CACxB6E,CAAAA,CAAS7E,CAAAA,CAAM,QAAA,CAASkU,CAAK,CAAA,CACjCX,CAAAA,CAAgBpR,CAAI,CAC/B,CACA,IAAMkS,GAAS,CACX,QAAA,CAAUrU,CAAAA,EAASgU,EAAAA,CAAYhU,CAAK,CAAA,EAAKA,CAAAA,EAAS,CAAA,CAClD,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,MAAA,CAAQ,KAAA,CACR,KAAM,YAAA,CACN,OAAA,CAAS,CAACwJ,CAAAA,CAAK8K,CAAAA,CAAUhG,CAAAA,GAAQ2F,GAAWzK,CAAAA,CAAK,CAAA,CAAG,CAAA,CAAG8E,CAAG,CAAA,CAC1D,SAAA,CAAWnM,GAAQiS,EAAAA,CAAajS,CAAAA,CAAM,CAAA,CAAG,IAAI,CACjD,CAAA,CACMoS,GAAM,CACR,QAAA,CAAUP,EAAAA,CACV,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,wBACL,IAAA,CAAM,eAAA,CACN,OAAA,CAAS,CAACxK,CAAAA,CAAK8K,CAAAA,CAAUhG,IAAQ2F,EAAAA,CAAWzK,CAAAA,CAAK,CAAA,CAAG,EAAA,CAAI8E,CAAG,CAAA,CAC3D,UAAWiF,CACf,CAAA,CACMiB,EAAAA,CAAS,CACX,QAAA,CAAUxU,CAAAA,EAASgU,GAAYhU,CAAK,CAAA,EAAKA,CAAAA,EAAS,CAAA,CAClD,OAAA,CAAS,IAAA,CACT,IAAK,uBAAA,CACL,MAAA,CAAQ,KAAA,CACR,IAAA,CAAM,kBAAA,CACN,OAAA,CAAS,CAACwJ,CAAAA,CAAK8K,CAAAA,CAAUhG,CAAAA,GAAQ2F,EAAAA,CAAWzK,CAAAA,CAAK,CAAA,CAAG,GAAI8E,CAAG,CAAA,CAC3D,SAAA,CAAWnM,CAAAA,EAAQiS,EAAAA,CAAajS,CAAAA,CAAM,GAAI,IAAI,CAClD,CAAA,CC3BA,IAAM2G,EAAAA,CAAS,CACXH,GACAuK,EAAAA,CACAC,EAAAA,CACAC,EAAAA,CACAC,EAAAA,CACAgB,EAAAA,CACAE,EAAAA,CACAC,GACAZ,EAAAA,CACAC,EAAAA,CACAC,EACJ,CAAA,CChBA,SAASE,EAAAA,CAAYhU,EAAO,CACxB,OAAO,OAAOA,CAAAA,EAAU,QAAA,EAAY,MAAA,CAAO,UAAUA,CAAK,CAC9D,CACA,IAAMyU,EAAAA,CAAgB,CAAC,CAAE,KAAA,CAAAzU,CAAM,CAAA,GAAM,IAAA,CAAK,SAAA,CAAUA,CAAK,EACnD0U,EAAAA,CAAc,CAChB,CACI,QAAA,CAAU1U,CAAAA,EAAS,OAAOA,GAAU,QAAA,CACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,OAAA,CAASwJ,GAAOA,CAAAA,CAChB,SAAA,CAAWiL,EACf,CAAA,CACA,CACI,QAAA,CAAUzU,GAASA,CAAAA,EAAS,IAAA,CAC5B,UAAA,CAAY,IAAM,IAAImI,CAAAA,CAAO,IAAI,CAAA,CACjC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,wBAAA,CACL,IAAA,CAAM,SACN,OAAA,CAAS,IAAM,IAAA,CACf,SAAA,CAAWsM,EACf,CAAA,CACA,CACI,QAAA,CAAUzU,CAAAA,EAAS,OAAOA,CAAAA,EAAU,SAAA,CACpC,OAAA,CAAS,KACT,GAAA,CAAK,wBAAA,CACL,IAAA,CAAM,gBAAA,CACN,OAAA,CAASwJ,CAAAA,EAAOA,IAAQ,MAAA,CACxB,SAAA,CAAWiL,EACf,CAAA,CACA,CACI,QAAA,CAAUT,GACV,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,IAAA,CAAM,uBAAA,CACN,QAAS,CAACxK,CAAAA,CAAK8K,CAAAA,CAAU,CAAE,WAAA,CAAAH,CAAY,IAAMA,CAAAA,CAAc,MAAA,CAAO3K,CAAG,CAAA,CAAI,QAAA,CAASA,CAAAA,CAAK,EAAE,CAAA,CACzF,SAAA,CAAW,CAAC,CAAE,KAAA,CAAAxJ,CAAM,IAAMgU,EAAAA,CAAYhU,CAAK,CAAA,CAAIA,CAAAA,CAAM,QAAA,EAAS,CAAI,IAAA,CAAK,SAAA,CAAUA,CAAK,CAC1F,CAAA,CACA,CACI,QAAA,CAAUA,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,yBAAA,CACL,KAAM,wDAAA,CACN,OAAA,CAASwJ,CAAAA,EAAO,UAAA,CAAWA,CAAG,CAAA,CAC9B,UAAWiL,EACf,CACJ,CAAA,CACME,EAAAA,CAAY,CACd,OAAA,CAAS,KACT,GAAA,CAAK,EAAA,CACL,IAAA,CAAM,GAAA,CACN,OAAA,CAAQnL,CAAAA,CAAK/E,EAAS,CAClB,OAAAA,CAAAA,CAAQ,CAAA,wBAAA,EAA2B,IAAA,CAAK,SAAA,CAAU+E,CAAG,CAAC,CAAA,CAAE,CAAA,CACjDA,CACX,CACJ,CAAA,CACMV,GAAS,CAACH,EAAAA,CAAKuK,EAAG,CAAA,CAAE,MAAA,CAAOwB,EAAAA,CAAaC,EAAS,CAAA,CCxDvD,IAAMC,EAAAA,CAAS,CACX,QAAA,CAAU5U,CAAAA,EAASA,aAAiB,UAAA,CACpC,OAAA,CAAS,KAAA,CACT,GAAA,CAAK,0BAAA,CASL,OAAA,CAAQ6H,EAAKpD,CAAAA,CAAS,CAClB,GAAI,OAAO,IAAA,EAAS,UAAA,CAAY,CAE5B,IAAM+E,CAAAA,CAAM,IAAA,CAAK3B,CAAAA,CAAI,OAAA,CAAQ,SAAA,CAAW,EAAE,CAAC,CAAA,CACrCjI,CAAAA,CAAS,IAAI,UAAA,CAAW4J,CAAAA,CAAI,MAAM,CAAA,CACxC,IAAA,IAAS7L,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI6L,CAAAA,CAAI,OAAQ,EAAE7L,CAAAA,CAC9BiC,CAAAA,CAAOjC,CAAC,CAAA,CAAI6L,CAAAA,CAAI,WAAW7L,CAAC,CAAA,CAChC,OAAOiC,CACX,CAAA,KAEI,OAAA6E,CAAAA,CAAQ,0FAA0F,CAAA,CAC3FoD,CAEf,CAAA,CACA,SAAA,CAAU,CAAE,OAAA,CAAA6B,EAAS,IAAA,CAAAtI,CAAAA,CAAM,KAAA,CAAApB,CAAM,CAAA,CAAGgH,CAAAA,CAAKwF,EAAWC,CAAAA,CAAa,CAC7D,GAAI,CAACzM,CAAAA,CACD,OAAO,GACX,IAAM6U,CAAAA,CAAM7U,CAAAA,CACRwJ,CAAAA,CACJ,GAAI,OAAO,MAAS,UAAA,CAAY,CAC5B,IAAIsL,CAAAA,CAAI,EAAA,CACR,IAAA,IAASnX,EAAI,CAAA,CAAGA,CAAAA,CAAIkX,CAAAA,CAAI,MAAA,CAAQ,EAAElX,CAAAA,CAC9BmX,GAAK,MAAA,CAAO,YAAA,CAAaD,CAAAA,CAAIlX,CAAC,CAAC,CAAA,CACnC6L,EAAM,IAAA,CAAKsL,CAAC,EAChB,CAAA,KAEI,MAAM,IAAI,MAAM,0FAA0F,CAAA,CAG9G,GADA1T,CAAAA,GAASA,CAAAA,CAAO+G,CAAAA,CAAO,eACnB/G,CAAAA,GAAS+G,CAAAA,CAAO,YAAA,CAAc,CAC9B,IAAMiC,CAAAA,CAAY,KAAK,GAAA,CAAIpD,CAAAA,CAAI,OAAA,CAAQ,SAAA,CAAYA,CAAAA,CAAI,MAAA,CAAO,OAAQA,CAAAA,CAAI,OAAA,CAAQ,eAAe,CAAA,CAC3FtG,CAAAA,CAAI,IAAA,CAAK,KAAK8I,CAAAA,CAAI,MAAA,CAASY,CAAS,CAAA,CACpC3M,CAAAA,CAAQ,IAAI,MAAMiD,CAAC,CAAA,CACzB,IAAA,IAAS/C,CAAAA,CAAI,CAAA,CAAGiR,CAAAA,CAAI,EAAGjR,CAAAA,CAAI+C,CAAAA,CAAG,EAAE/C,CAAAA,CAAGiR,CAAAA,EAAKxE,CAAAA,CACpC3M,EAAME,CAAC,CAAA,CAAI6L,CAAAA,CAAI,MAAA,CAAOoF,CAAAA,CAAGxE,CAAS,CAAA,CAEtCZ,CAAAA,CAAM/L,CAAAA,CAAM,IAAA,CAAK2D,CAAAA,GAAS+G,CAAAA,CAAO,aAAA,CAAgB;AAAA,CAAA,CAAO,GAAG,EAC/D,CACA,OAAO2F,EAAAA,CAAgB,CAAE,QAAApE,CAAAA,CAAS,IAAA,CAAAtI,CAAAA,CAAM,KAAA,CAAOoI,CAAI,CAAA,CAAGxC,CAAAA,CAAKwF,EAAWC,CAAW,CACrF,CACJ,CAAA,CClDA,SAASsI,EAAAA,CAAa7B,CAAAA,CAAKzO,EAAS,CAChC,GAAIjC,GAAM0Q,CAAG,CAAA,CACT,QAASvV,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIuV,CAAAA,CAAI,MAAM,MAAA,CAAQ,EAAEvV,EAAG,CACvC,IAAImK,EAAOoL,CAAAA,CAAI,KAAA,CAAMvV,CAAC,CAAA,CACtB,GAAI,CAAA2E,CAAAA,CAAOwF,CAAI,CAAA,CAEV,CAAA,GAAIzF,GAAMyF,CAAI,CAAA,CAAG,CACdA,CAAAA,CAAK,MAAM,MAAA,CAAS,CAAA,EACpBrD,EAAQ,gDAAgD,CAAA,CAC5D,IAAM2M,CAAAA,CAAOtJ,CAAAA,CAAK,KAAA,CAAM,CAAC,GAAK,IAAImJ,CAAAA,CAAK,IAAI9I,CAAAA,CAAO,IAAI,CAAC,CAAA,CAKvD,GAJIL,EAAK,aAAA,GACLsJ,CAAAA,CAAK,IAAI,aAAA,CAAgBA,CAAAA,CAAK,IAAI,aAAA,CAC5B,CAAA,EAAGtJ,EAAK,aAAa;AAAA,EAAKsJ,CAAAA,CAAK,IAAI,aAAa,CAAA,CAAA,CAChDtJ,EAAK,aAAA,CAAA,CACXA,CAAAA,CAAK,QAAS,CACd,IAAMkN,EAAK5D,CAAAA,CAAK,KAAA,EAASA,EAAK,GAAA,CAC9B4D,CAAAA,CAAG,QAAUA,CAAAA,CAAG,OAAA,CACV,CAAA,EAAGlN,CAAAA,CAAK,OAAO;AAAA,EAAKkN,CAAAA,CAAG,OAAO,CAAA,CAAA,CAC9BlN,CAAAA,CAAK,QACf,CACAA,CAAAA,CAAOsJ,EACX,CACA8B,CAAAA,CAAI,KAAA,CAAMvV,CAAC,CAAA,CAAI2E,CAAAA,CAAOwF,CAAI,CAAA,CAAIA,CAAAA,CAAO,IAAImJ,CAAAA,CAAKnJ,CAAI,EAAA,CACtD,CAAA,KAGArD,CAAAA,CAAQ,kCAAkC,CAAA,CAC9C,OAAOyO,CACX,CACA,SAAS+B,EAAAA,CAAYnM,CAAAA,CAAQoM,CAAAA,CAAUlO,CAAAA,CAAK,CACxC,GAAM,CAAE,QAAA,CAAAyL,CAAS,CAAA,CAAIzL,CAAAA,CACfmO,CAAAA,CAAQ,IAAIpC,CAAAA,CAAQjK,CAAM,CAAA,CAChCqM,EAAM,GAAA,CAAM,yBAAA,CACZ,IAAIxX,CAAAA,CAAI,CAAA,CACR,GAAIuX,CAAAA,EAAY,MAAA,CAAO,QAAA,IAAY,MAAA,CAAOA,CAAQ,CAAA,CAC9C,IAAA,IAAS/L,CAAAA,IAAM+L,CAAAA,CAAU,CACjB,OAAOzC,CAAAA,EAAa,UAAA,GACpBtJ,CAAAA,CAAKsJ,CAAAA,CAAS,IAAA,CAAKyC,CAAAA,CAAU,MAAA,CAAOvX,CAAAA,EAAG,CAAA,CAAGwL,CAAE,CAAA,CAAA,CAChD,IAAI/F,CAAAA,CAAKpD,CAAAA,CACT,GAAI,KAAA,CAAM,OAAA,CAAQmJ,CAAE,CAAA,CAChB,GAAIA,CAAAA,CAAG,MAAA,GAAW,CAAA,CACd/F,CAAAA,CAAM+F,CAAAA,CAAG,CAAC,CAAA,CACVnJ,CAAAA,CAAQmJ,CAAAA,CAAG,CAAC,CAAA,CAAA,KAGZ,MAAM,IAAI,SAAA,CAAU,CAAA,6BAAA,EAAgCA,CAAE,CAAA,CAAE,CAAA,CAAA,KAAA,GAEvDA,CAAAA,EAAMA,CAAAA,YAAc,MAAA,CAAQ,CACjC,IAAMiM,CAAAA,CAAO,MAAA,CAAO,IAAA,CAAKjM,CAAE,CAAA,CAC3B,GAAIiM,EAAK,MAAA,GAAW,CAAA,CAChBhS,CAAAA,CAAMgS,CAAAA,CAAK,CAAC,CAAA,CACZpV,CAAAA,CAAQmJ,CAAAA,CAAG/F,CAAG,CAAA,CAAA,KAGd,MAAM,IAAI,SAAA,CAAU,CAAA,iCAAA,EAAoCgS,CAAAA,CAAK,MAAM,OAAO,CAElF,CAAA,KAEIhS,CAAAA,CAAM+F,CAAAA,CAEVgM,CAAAA,CAAM,KAAA,CAAM,IAAA,CAAKnE,EAAAA,CAAW5N,CAAAA,CAAKpD,CAAAA,CAAOgH,CAAG,CAAC,EAChD,CACJ,OAAOmO,CACX,CACA,IAAMA,EAAAA,CAAQ,CACV,UAAA,CAAY,KAAA,CACZ,OAAA,CAAS,KAAA,CACT,GAAA,CAAK,yBAAA,CACL,OAAA,CAASJ,EAAAA,CACT,UAAA,CAAYE,EAChB,CAAA,CCrEA,IAAMI,GAAN,MAAMC,CAAAA,SAAiBvC,CAAQ,CAC3B,WAAA,EAAc,CACV,KAAA,EAAM,CACN,IAAA,CAAK,GAAA,CAAMR,CAAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA,CAC1C,KAAK,MAAA,CAASA,CAAAA,CAAQ,SAAA,CAAU,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAChD,IAAA,CAAK,GAAA,CAAMA,CAAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA,CAC1C,IAAA,CAAK,IAAMA,CAAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA,CAC1C,IAAA,CAAK,GAAA,CAAMA,CAAAA,CAAQ,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA,CAC1C,IAAA,CAAK,GAAA,CAAM+C,CAAAA,CAAS,IACxB,CAKA,MAAA,CAAOnE,CAAAA,CAAGnK,CAAAA,CAAK,CACX,GAAI,CAACA,CAAAA,CACD,OAAO,KAAA,CAAM,MAAA,CAAOmK,CAAC,CAAA,CACzB,IAAMxI,EAAM,IAAI,GAAA,CACZ3B,CAAAA,EAAK,QAAA,EACLA,CAAAA,CAAI,QAAA,CAAS2B,CAAG,CAAA,CACpB,IAAA,IAAWyI,CAAAA,IAAQ,IAAA,CAAK,KAAA,CAAO,CAC3B,IAAIhO,CAAAA,CAAKpD,CAAAA,CAQT,GAPIsC,CAAAA,CAAO8O,CAAI,CAAA,EACXhO,CAAAA,CAAM0D,CAAAA,CAAKsK,CAAAA,CAAK,GAAA,CAAK,EAAA,CAAIpK,CAAG,CAAA,CAC5BhH,CAAAA,CAAQ8G,CAAAA,CAAKsK,CAAAA,CAAK,KAAA,CAAOhO,CAAAA,CAAK4D,CAAG,GAGjC5D,CAAAA,CAAM0D,CAAAA,CAAKsK,CAAAA,CAAM,EAAA,CAAIpK,CAAG,CAAA,CAExB2B,CAAAA,CAAI,GAAA,CAAIvF,CAAG,CAAA,CACX,MAAM,IAAI,KAAA,CAAM,8CAA8C,CAAA,CAClEuF,CAAAA,CAAI,GAAA,CAAIvF,CAAAA,CAAKpD,CAAK,EACtB,CACA,OAAO2I,CACX,CACA,OAAO,IAAA,CAAKG,CAAAA,CAAQoM,CAAAA,CAAUlO,CAAAA,CAAK,CAC/B,IAAMmO,CAAAA,CAAQF,GAAYnM,CAAAA,CAAQoM,CAAAA,CAAUlO,CAAG,CAAA,CACzCuO,CAAAA,CAAO,IAAI,IAAA,CACjB,OAAAA,CAAAA,CAAK,KAAA,CAAQJ,CAAAA,CAAM,KAAA,CACZI,CACX,CACJ,CAAA,CACAF,EAAAA,CAAS,IAAM,wBAAA,CACf,IAAME,EAAAA,CAAO,CACT,UAAA,CAAY,KAAA,CACZ,QAAA,CAAUvV,CAAAA,EAASA,CAAAA,YAAiB,GAAA,CACpC,SAAA,CAAWqV,EAAAA,CACX,OAAA,CAAS,KAAA,CACT,GAAA,CAAK,wBAAA,CACL,QAAQnC,CAAAA,CAAKzO,CAAAA,CAAS,CAClB,IAAM0Q,CAAAA,CAAQJ,EAAAA,CAAa7B,CAAAA,CAAKzO,CAAO,CAAA,CACjC+Q,CAAAA,CAAW,EAAC,CAClB,IAAA,GAAW,CAAE,GAAA,CAAApS,CAAI,CAAA,GAAK+R,CAAAA,CAAM,KAAA,CACpB5S,CAAAA,CAASa,CAAG,CAAA,GACRoS,CAAAA,CAAS,QAAA,CAASpS,CAAAA,CAAI,KAAK,CAAA,CAC3BqB,CAAAA,CAAQ,CAAA,8CAAA,EAAiDrB,CAAAA,CAAI,KAAK,CAAA,CAAE,EAGpEoS,CAAAA,CAAS,IAAA,CAAKpS,CAAAA,CAAI,KAAK,CAAA,CAAA,CAInC,OAAO,MAAA,CAAO,MAAA,CAAO,IAAIiS,EAAAA,CAAYF,CAAK,CAC9C,CAAA,CACA,UAAA,CAAY,CAACrM,CAAAA,CAAQoM,EAAUlO,CAAAA,GAAQqO,EAAAA,CAAS,IAAA,CAAKvM,CAAAA,CAAQoM,CAAAA,CAAUlO,CAAG,CAC9E,CAAA,CCrEA,SAASyO,EAAAA,CAAc,CAAE,KAAA,CAAAzV,CAAAA,CAAO,MAAA,CAAAgF,CAAO,CAAA,CAAGgC,EAAK,CAE3C,OAAIhC,CAAAA,EAAAA,CADYhF,CAAAA,CAAQ0V,EAAAA,CAAUC,EAAAA,EACZ,IAAA,CAAK,IAAA,CAAK3Q,CAAM,CAAA,CAC3BA,CAAAA,CACJhF,CAAAA,CAAQgH,CAAAA,CAAI,OAAA,CAAQ,OAAA,CAAUA,CAAAA,CAAI,OAAA,CAAQ,QACrD,CACA,IAAM0O,EAAAA,CAAU,CACZ,QAAA,CAAU1V,CAAAA,EAASA,CAAAA,GAAU,IAAA,CAC7B,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,wBAAA,CACL,IAAA,CAAM,4CAAA,CACN,QAAS,IAAM,IAAImI,CAAAA,CAAO,IAAI,CAAA,CAC9B,SAAA,CAAWsN,EACf,CAAA,CACME,EAAAA,CAAW,CACb,QAAA,CAAU3V,CAAAA,EAASA,CAAAA,GAAU,KAAA,CAC7B,OAAA,CAAS,IAAA,CACT,IAAK,wBAAA,CACL,IAAA,CAAM,8CAAA,CACN,OAAA,CAAS,IAAM,IAAImI,CAAAA,CAAO,KAAK,CAAA,CAC/B,SAAA,CAAWsN,EACf,CAAA,CCpBA,IAAM7B,EAAAA,CAAW,CACb,QAAA,CAAU5T,GAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,yBAAA,CACL,IAAA,CAAM,gDAAA,CACN,OAAA,CAAUwJ,CAAAA,EAAQA,CAAAA,CAAI,KAAA,CAAM,EAAE,CAAA,CAAE,WAAA,EAAY,GAAM,KAAA,CAC5C,GAAA,CACAA,CAAAA,CAAI,CAAC,CAAA,GAAM,GAAA,CACP,MAAA,CAAO,iBAAA,CACP,MAAA,CAAO,iBAAA,CACjB,SAAA,CAAW+J,CACf,CAAA,CACMM,EAAAA,CAAW,CACb,SAAU7T,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,yBAAA,CACL,MAAA,CAAQ,KAAA,CACR,IAAA,CAAM,uDAAA,CACN,OAAA,CAAUwJ,CAAAA,EAAQ,UAAA,CAAWA,CAAAA,CAAI,QAAQ,IAAA,CAAM,EAAE,CAAC,CAAA,CAClD,SAAA,CAAUrH,CAAAA,CAAM,CACZ,IAAMuR,CAAAA,CAAM,MAAA,CAAOvR,CAAAA,CAAK,KAAK,CAAA,CAC7B,OAAO,QAAA,CAASuR,CAAG,EAAIA,CAAAA,CAAI,aAAA,EAAc,CAAIH,CAAAA,CAAgBpR,CAAI,CACrE,CACJ,CAAA,CACM2R,EAAAA,CAAQ,CACV,QAAA,CAAU9T,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,yBAAA,CACL,IAAA,CAAM,mCAAA,CACN,OAAA,CAAQwJ,CAAAA,CAAK,CACT,IAAMrH,CAAAA,CAAO,IAAIgG,CAAAA,CAAO,UAAA,CAAWqB,CAAAA,CAAI,OAAA,CAAQ,IAAA,CAAM,EAAE,CAAC,CAAC,CAAA,CACnDuK,CAAAA,CAAMvK,CAAAA,CAAI,OAAA,CAAQ,GAAG,CAAA,CAC3B,GAAIuK,CAAAA,GAAQ,EAAA,CAAI,CACZ,IAAM6B,CAAAA,CAAIpM,CAAAA,CAAI,SAAA,CAAUuK,EAAM,CAAC,CAAA,CAAE,OAAA,CAAQ,IAAA,CAAM,EAAE,CAAA,CAC7C6B,CAAAA,CAAEA,CAAAA,CAAE,MAAA,CAAS,CAAC,CAAA,GAAM,GAAA,GACpBzT,CAAAA,CAAK,iBAAA,CAAoByT,CAAAA,CAAE,MAAA,EACnC,CACA,OAAOzT,CACX,CAAA,CACA,SAAA,CAAWoR,CACf,CAAA,CCzCA,IAAMS,EAAAA,CAAehU,CAAAA,EAAU,OAAOA,CAAAA,EAAU,QAAA,EAAY,MAAA,CAAO,SAAA,CAAUA,CAAK,CAAA,CAClF,SAASiU,EAAAA,CAAWzK,CAAAA,CAAK9L,CAAAA,CAAQwW,CAAAA,CAAO,CAAE,WAAA,CAAAC,CAAY,CAAA,CAAG,CACrD,IAAM0B,CAAAA,CAAOrM,CAAAA,CAAI,CAAC,CAAA,CAIlB,GAAA,CAHIqM,IAAS,GAAA,EAAOA,CAAAA,GAAS,GAAA,IACzBnY,CAAAA,EAAU,CAAA,CAAA,CACd8L,CAAAA,CAAMA,CAAAA,CAAI,SAAA,CAAU9L,CAAM,CAAA,CAAE,OAAA,CAAQ,IAAA,CAAM,EAAE,CAAA,CACxCyW,CAAAA,CAAa,CACb,OAAQD,CAAAA,EACJ,KAAK,CAAA,CACD1K,CAAAA,CAAM,CAAA,EAAA,EAAKA,CAAG,CAAA,CAAA,CACd,MACJ,KAAK,CAAA,CACDA,CAAAA,CAAM,CAAA,EAAA,EAAKA,CAAG,CAAA,CAAA,CACd,MACJ,KAAK,EAAA,CACDA,CAAAA,CAAM,CAAA,EAAA,EAAKA,CAAG,CAAA,CAAA,CACd,KACR,CACA,IAAM9I,CAAAA,CAAI,MAAA,CAAO8I,CAAG,CAAA,CACpB,OAAOqM,CAAAA,GAAS,GAAA,CAAM,MAAA,CAAO,EAAE,CAAA,CAAInV,CAAAA,CAAIA,CAC3C,CACA,IAAMA,CAAAA,CAAI,QAAA,CAAS8I,CAAAA,CAAK0K,CAAK,CAAA,CAC7B,OAAO2B,CAAAA,GAAS,GAAA,CAAM,EAAA,CAAKnV,CAAAA,CAAIA,CACnC,CACA,SAAS0T,EAAAA,CAAajS,CAAAA,CAAM+R,CAAAA,CAAOrP,CAAAA,CAAQ,CACvC,GAAM,CAAE,KAAA,CAAA7E,CAAM,CAAA,CAAImC,CAAAA,CAClB,GAAI6R,EAAAA,CAAYhU,CAAK,EAAG,CACpB,IAAMwJ,CAAAA,CAAMxJ,CAAAA,CAAM,QAAA,CAASkU,CAAK,CAAA,CAChC,OAAOlU,CAAAA,CAAQ,CAAA,CAAI,GAAA,CAAM6E,CAAAA,CAAS2E,CAAAA,CAAI,MAAA,CAAO,CAAC,CAAA,CAAI3E,EAAS2E,CAC/D,CACA,OAAO+J,CAAAA,CAAgBpR,CAAI,CAC/B,CACA,IAAM2T,EAAAA,CAAS,CACX,QAAA,CAAU9B,EAAAA,CACV,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,MAAA,CAAQ,KAAA,CACR,IAAA,CAAM,kBAAA,CACN,OAAA,CAAS,CAACxK,CAAAA,CAAK8K,CAAAA,CAAUhG,CAAAA,GAAQ2F,EAAAA,CAAWzK,CAAAA,CAAK,CAAA,CAAG,CAAA,CAAG8E,CAAG,CAAA,CAC1D,SAAA,CAAWnM,GAAQiS,EAAAA,CAAajS,CAAAA,CAAM,CAAA,CAAG,IAAI,CACjD,CAAA,CACMkS,EAAAA,CAAS,CACX,QAAA,CAAUL,EAAAA,CACV,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,MAAA,CAAQ,KAAA,CACR,KAAM,iBAAA,CACN,OAAA,CAAS,CAACxK,CAAAA,CAAK8K,CAAAA,CAAUhG,CAAAA,GAAQ2F,EAAAA,CAAWzK,CAAAA,CAAK,CAAA,CAAG,CAAA,CAAG8E,CAAG,CAAA,CAC1D,SAAA,CAAWnM,CAAAA,EAAQiS,EAAAA,CAAajS,CAAAA,CAAM,EAAG,GAAG,CAChD,CAAA,CACMoS,EAAAA,CAAM,CACR,QAAA,CAAUP,EAAAA,CACV,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,IAAA,CAAM,qBAAA,CACN,OAAA,CAAS,CAACxK,CAAAA,CAAK8K,CAAAA,CAAUhG,CAAAA,GAAQ2F,EAAAA,CAAWzK,CAAAA,CAAK,CAAA,CAAG,EAAA,CAAI8E,CAAG,CAAA,CAC3D,SAAA,CAAWiF,CACf,CAAA,CACMiB,EAAAA,CAAS,CACX,QAAA,CAAUR,EAAAA,CACV,OAAA,CAAS,KACT,GAAA,CAAK,uBAAA,CACL,MAAA,CAAQ,KAAA,CACR,IAAA,CAAM,wBAAA,CACN,OAAA,CAAS,CAACxK,CAAAA,CAAK8K,CAAAA,CAAUhG,CAAAA,GAAQ2F,EAAAA,CAAWzK,CAAAA,CAAK,CAAA,CAAG,EAAA,CAAI8E,CAAG,EAC3D,SAAA,CAAWnM,CAAAA,EAAQiS,EAAAA,CAAajS,CAAAA,CAAM,EAAA,CAAI,IAAI,CAClD,CAAA,CChEA,IAAM4T,EAAAA,CAAN,MAAMC,CAAAA,SAAgBzD,CAAQ,CAC1B,WAAA,CAAYzJ,CAAAA,CAAQ,CAChB,KAAA,CAAMA,CAAM,CAAA,CACZ,IAAA,CAAK,GAAA,CAAMkN,CAAAA,CAAQ,IACvB,CACA,GAAA,CAAI5S,CAAAA,CAAK,CACL,IAAIgO,CAAAA,CACA9O,CAAAA,CAAOc,CAAG,CAAA,CACVgO,CAAAA,CAAOhO,CAAAA,CACFA,CAAAA,EACL,OAAOA,CAAAA,EAAQ,QAAA,EACf,KAAA,GAASA,CAAAA,EACT,OAAA,GAAWA,CAAAA,EACXA,CAAAA,CAAI,KAAA,GAAU,IAAA,CACdgO,CAAAA,CAAO,IAAIH,CAAAA,CAAK7N,EAAI,GAAA,CAAK,IAAI,CAAA,CAE7BgO,CAAAA,CAAO,IAAIH,CAAAA,CAAK7N,CAAAA,CAAK,IAAI,CAAA,CAChBkP,EAAAA,CAAS,IAAA,CAAK,KAAA,CAAOlB,CAAAA,CAAK,GAAG,CAAA,EAEtC,IAAA,CAAK,MAAM,IAAA,CAAKA,CAAI,EAC5B,CAKA,GAAA,CAAIhO,CAAAA,CAAK6S,CAAAA,CAAU,CACf,IAAM7E,CAAAA,CAAOkB,EAAAA,CAAS,IAAA,CAAK,KAAA,CAAOlP,CAAG,CAAA,CACrC,OAAO,CAAC6S,CAAAA,EAAY3T,CAAAA,CAAO8O,CAAI,CAAA,CACzB7O,CAAAA,CAAS6O,CAAAA,CAAK,GAAG,CAAA,CACbA,CAAAA,CAAK,GAAA,CAAI,KAAA,CACTA,CAAAA,CAAK,GAAA,CACTA,CACV,CACA,GAAA,CAAIhO,CAAAA,CAAKpD,CAAAA,CAAO,CACZ,GAAI,OAAOA,CAAAA,EAAU,SAAA,CACjB,MAAM,IAAI,KAAA,CAAM,CAAA,8DAAA,EAAiE,OAAOA,CAAK,CAAA,CAAE,CAAA,CACnG,IAAM4K,EAAO0H,EAAAA,CAAS,IAAA,CAAK,KAAA,CAAOlP,CAAG,CAAA,CACjCwH,CAAAA,EAAQ,CAAC5K,CAAAA,CACT,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ4K,CAAI,CAAA,CAAG,CAAC,CAAA,CAExC,CAACA,CAAAA,EAAQ5K,CAAAA,EACd,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAIiR,CAAAA,CAAK7N,CAAG,CAAC,EAErC,CACA,MAAA,CAAO+N,CAAAA,CAAGnK,CAAAA,CAAK,CACX,OAAO,KAAA,CAAM,MAAA,CAAOmK,CAAAA,CAAGnK,CAAAA,CAAK,GAAG,CACnC,CACA,QAAA,CAASA,CAAAA,CAAKwF,CAAAA,CAAWC,CAAAA,CAAa,CAClC,GAAI,CAACzF,CAAAA,CACD,OAAO,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,CAC9B,GAAI,IAAA,CAAK,gBAAA,CAAiB,IAAI,CAAA,CAC1B,OAAO,KAAA,CAAM,QAAA,CAAS,MAAA,CAAO,MAAA,CAAO,EAAC,CAAGA,EAAK,CAAE,aAAA,CAAe,IAAK,CAAC,CAAA,CAAGwF,CAAAA,CAAWC,CAAW,CAAA,CAE7F,MAAM,IAAI,KAAA,CAAM,qCAAqC,CAC7D,CACA,OAAO,IAAA,CAAK3D,EAAQoM,CAAAA,CAAUlO,CAAAA,CAAK,CAC/B,GAAM,CAAE,QAAA,CAAAyL,CAAS,CAAA,CAAIzL,CAAAA,CACfkP,CAAAA,CAAM,IAAI,IAAA,CAAKpN,CAAM,CAAA,CAC3B,GAAIoM,CAAAA,EAAY,OAAO,QAAA,IAAY,MAAA,CAAOA,CAAQ,CAAA,CAC9C,IAAA,IAASlV,CAAAA,IAASkV,CAAAA,CACV,OAAOzC,CAAAA,EAAa,UAAA,GACpBzS,CAAAA,CAAQyS,CAAAA,CAAS,IAAA,CAAKyC,CAAAA,CAAUlV,CAAAA,CAAOA,CAAK,CAAA,CAAA,CAChDkW,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAKlF,EAAAA,CAAWhR,CAAAA,CAAO,IAAA,CAAMgH,CAAG,CAAC,CAAA,CAEnD,OAAOkP,CACX,CACJ,CAAA,CACAH,EAAAA,CAAQ,GAAA,CAAM,wBACd,IAAMG,EAAAA,CAAM,CACR,UAAA,CAAY,KAAA,CACZ,QAAA,CAAUlW,CAAAA,EAASA,CAAAA,YAAiB,GAAA,CACpC,SAAA,CAAW+V,EAAAA,CACX,OAAA,CAAS,KAAA,CACT,GAAA,CAAK,uBAAA,CACL,UAAA,CAAY,CAACjN,CAAAA,CAAQoM,CAAAA,CAAUlO,CAAAA,GAAQ+O,EAAAA,CAAQ,IAAA,CAAKjN,CAAAA,CAAQoM,CAAAA,CAAUlO,CAAG,CAAA,CACzE,OAAA,CAAQ2B,CAAAA,CAAKlE,CAAAA,CAAS,CAClB,GAAIpC,EAAAA,CAAMsG,CAAG,EAAG,CACZ,GAAIA,CAAAA,CAAI,gBAAA,CAAiB,IAAI,CAAA,CACzB,OAAO,MAAA,CAAO,MAAA,CAAO,IAAIoN,EAAAA,CAAWpN,CAAG,CAAA,CAEvClE,CAAAA,CAAQ,qCAAqC,EACrD,CAAA,KAEIA,CAAAA,CAAQ,iCAAiC,CAAA,CAC7C,OAAOkE,CACX,CACJ,CAAA,CCvFA,SAASwN,EAAAA,CAAiB3M,CAAAA,CAAK4M,CAAAA,CAAU,CACrC,IAAMP,CAAAA,CAAOrM,CAAAA,CAAI,CAAC,CAAA,CACZ9E,CAAAA,CAAQmR,CAAAA,GAAS,GAAA,EAAOA,CAAAA,GAAS,GAAA,CAAMrM,CAAAA,CAAI,SAAA,CAAU,CAAC,CAAA,CAAIA,CAAAA,CAC1DkK,CAAAA,CAAOhT,CAAAA,EAAM0V,CAAAA,CAAW,MAAA,CAAO1V,CAAC,EAAI,MAAA,CAAOA,CAAC,CAAA,CAC5C6D,CAAAA,CAAMG,CAAAA,CACP,OAAA,CAAQ,IAAA,CAAM,EAAE,CAAA,CAChB,KAAA,CAAM,GAAG,CAAA,CACT,MAAA,CAAO,CAACH,CAAAA,CAAK8R,CAAAA,GAAM9R,EAAMmP,CAAAA,CAAI,EAAE,CAAA,CAAIA,CAAAA,CAAI2C,CAAC,CAAA,CAAG3C,CAAAA,CAAI,CAAC,CAAC,CAAA,CACtD,OAAQmC,CAAAA,GAAS,GAAA,CAAMnC,CAAAA,CAAI,EAAE,CAAA,CAAInP,CAAAA,CAAMA,CAC3C,CAMA,SAAS+R,EAAAA,CAAqBnU,CAAAA,CAAM,CAChC,GAAI,CAAE,KAAA,CAAAnC,CAAM,CAAA,CAAImC,CAAAA,CACZuR,CAAAA,CAAOhT,CAAAA,EAAMA,CAAAA,CACjB,GAAI,OAAOV,CAAAA,EAAU,QAAA,CACjB0T,CAAAA,CAAMhT,CAAAA,EAAK,MAAA,CAAOA,CAAC,CAAA,CAAA,KAAA,GACd,KAAA,CAAMV,CAAK,CAAA,EAAK,CAAC,QAAA,CAASA,CAAK,CAAA,CACpC,OAAOuT,EAAgBpR,CAAI,CAAA,CAC/B,IAAI0T,CAAAA,CAAO,EAAA,CACP7V,CAAAA,CAAQ,CAAA,GACR6V,CAAAA,CAAO,GAAA,CACP7V,CAAAA,EAAS0T,CAAAA,CAAI,EAAE,CAAA,CAAA,CAEnB,IAAM6C,CAAAA,CAAM7C,CAAAA,CAAI,EAAE,CAAA,CACZhP,CAAAA,CAAQ,CAAC1E,CAAAA,CAAQuW,CAAG,CAAA,CAC1B,OAAIvW,CAAAA,CAAQ,EAAA,CACR0E,CAAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAGf1E,CAAAA,CAAAA,CAASA,CAAAA,CAAQ0E,CAAAA,CAAM,CAAC,CAAA,EAAK6R,CAAAA,CAC7B7R,CAAAA,CAAM,OAAA,CAAQ1E,CAAAA,CAAQuW,CAAG,CAAA,CACrBvW,CAAAA,EAAS,EAAA,GACTA,CAAAA,CAAAA,CAASA,CAAAA,CAAQ0E,CAAAA,CAAM,CAAC,CAAA,EAAK6R,CAAAA,CAC7B7R,EAAM,OAAA,CAAQ1E,CAAK,CAAA,CAAA,CAAA,CAGnB6V,CAAAA,CACJnR,CAAAA,CACK,GAAA,CAAIhE,CAAAA,EAAK,MAAA,CAAOA,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA,CAAG,GAAG,CAAC,CAAA,CACnC,IAAA,CAAK,GAAG,CAAA,CACR,OAAA,CAAQ,YAAA,CAAc,EAAE,CAErC,CACA,IAAM8V,EAAAA,CAAU,CACZ,QAAA,CAAUxW,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,EAAY,MAAA,CAAO,SAAA,CAAUA,CAAK,CAAA,CACtE,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,uBAAA,CACL,MAAA,CAAQ,MAAA,CACR,IAAA,CAAM,sCAAA,CACN,OAAA,CAAS,CAACwJ,CAAAA,CAAK8K,CAAAA,CAAU,CAAE,WAAA,CAAAH,CAAY,CAAA,GAAMgC,EAAAA,CAAiB3M,CAAAA,CAAK2K,CAAW,CAAA,CAC9E,SAAA,CAAWmC,EACf,CAAA,CACMG,EAAAA,CAAY,CACd,QAAA,CAAUzW,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CACpC,OAAA,CAAS,KACT,GAAA,CAAK,yBAAA,CACL,MAAA,CAAQ,MAAA,CACR,IAAA,CAAM,+CAAA,CACN,OAAA,CAASwJ,CAAAA,EAAO2M,EAAAA,CAAiB3M,CAAAA,CAAK,KAAK,CAAA,CAC3C,SAAA,CAAW8M,EACf,CAAA,CACMI,EAAAA,CAAY,CACd,QAAA,CAAU1W,CAAAA,EAASA,CAAAA,YAAiB,IAAA,CACpC,OAAA,CAAS,IAAA,CACT,GAAA,CAAK,6BAAA,CAIL,IAAA,CAAM,MAAA,CAAO,2JAKJ,CAAA,CACT,OAAA,CAAQwJ,CAAAA,CAAK,CACT,IAAMjB,EAAQiB,CAAAA,CAAI,KAAA,CAAMkN,EAAAA,CAAU,IAAI,CAAA,CACtC,GAAI,CAACnO,CAAAA,CACD,MAAM,IAAI,KAAA,CAAM,sDAAsD,CAAA,CAC1E,GAAM,EAAGoO,CAAAA,CAAMC,CAAAA,CAAOC,CAAAA,CAAKC,CAAAA,CAAMC,CAAAA,CAAQC,CAAM,CAAA,CAAIzO,CAAAA,CAAM,GAAA,CAAI,MAAM,CAAA,CAC7D0O,CAAAA,CAAW1O,CAAAA,CAAM,CAAC,CAAA,CAAI,MAAA,CAAA,CAAQA,EAAM,CAAC,CAAA,CAAI,IAAA,EAAM,MAAA,CAAO,CAAA,CAAG,CAAC,CAAC,CAAA,CAAI,CAAA,CACjE2O,CAAAA,CAAO,IAAA,CAAK,GAAA,CAAIP,CAAAA,CAAMC,CAAAA,CAAQ,CAAA,CAAGC,CAAAA,CAAKC,GAAQ,CAAA,CAAGC,CAAAA,EAAU,CAAA,CAAGC,CAAAA,EAAU,CAAA,CAAGC,CAAQ,CAAA,CACjFE,CAAAA,CAAK5O,CAAAA,CAAM,CAAC,CAAA,CAClB,GAAI4O,CAAAA,EAAMA,CAAAA,GAAO,GAAA,CAAK,CAClB,IAAI,CAAA,CAAIhB,EAAAA,CAAiBgB,CAAAA,CAAI,KAAK,CAAA,CAC9B,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,CAAI,EAAA,GACd,CAAA,EAAK,EAAA,CAAA,CACTD,CAAAA,EAAQ,GAAA,CAAQ,EACpB,CACA,OAAO,IAAI,IAAA,CAAKA,CAAI,CACxB,CAAA,CACA,SAAA,CAAW,CAAC,CAAE,KAAA,CAAAlX,CAAM,CAAA,GAAMA,CAAAA,EAAO,WAAA,EAAY,CAAE,OAAA,CAAQ,sBAAuB,EAAE,CAAA,EAAK,EACzF,CAAA,CCpFA,IAAM8I,EAAAA,CAAS,CACXH,EAAAA,CACAuK,EAAAA,CACAC,EAAAA,CACAC,EAAAA,CACAsC,EAAAA,CACAC,EAAAA,CACAG,EAAAA,CACAzB,EAAAA,CACAE,EAAAA,CACAC,GACAZ,EAAAA,CACAC,EAAAA,CACAC,EAAAA,CACAc,EAAAA,CACAzE,EAAAA,CACAoF,EAAAA,CACAJ,EAAAA,CACAe,EAAAA,CACAM,EAAAA,CACAC,EAAAA,CACAC,EACJ,CAAA,CCnBA,IAAMU,EAAAA,CAAU,IAAI,GAAA,CAAI,CACpB,CAAC,MAAA,CAAQtO,EAAM,CAAA,CACf,CAAC,UAAA,CAAY,CAACH,EAAAA,CAAKuK,EAAAA,CAAKC,EAAM,CAAC,CAAA,CAC/B,CAAC,MAAA,CAAQrK,EAAQ,CAAA,CACjB,CAAC,QAAA,CAAUA,EAAQ,CAAA,CACnB,CAAC,UAAA,CAAYA,EAAQ,CACzB,CAAC,CAAA,CACKuO,EAAAA,CAAa,CACf,MAAA,CAAAzC,EAAAA,CACA,IAAA,CAAMvB,EAAAA,CACN,MAAAS,EAAAA,CACA,QAAA,CAAAD,EAAAA,CACA,QAAA,CAAAD,EAAAA,CACA,SAAA,CAAA6C,EAAAA,CACA,GAAA,CAAAlC,EAAAA,CACA,MAAA,CAAAC,EAAAA,CACA,MAAA,CAAAH,EAAAA,CACA,OAAA,CAAAmC,EAAAA,CACA,GAAA,CAAA7N,GACA,KAAA,CAAAwH,EAAAA,CACA,IAAA,CAAMiD,EAAAA,CACN,IAAA,CAAAmC,EAAAA,CACA,KAAA,CAAAJ,EAAAA,CACA,GAAA,CAAAjC,EAAAA,CACA,GAAA,CAAAgD,EAAAA,CACA,SAAA,CAAAQ,EACJ,CAAA,CACMY,EAAAA,CAAgB,CAClB,0BAAA,CAA4B1C,EAAAA,CAC5B,yBAAA,CAA2BzE,EAAAA,CAC3B,wBAAA,CAA0BoF,EAAAA,CAC1B,yBAAA,CAA2BJ,EAAAA,CAC3B,uBAAA,CAAyBe,EAAAA,CACzB,6BAAA,CAA+BQ,EACnC,CAAA,CACA,SAASa,EAAAA,CAAQC,CAAAA,CAAYC,CAAAA,CAAYC,CAAAA,CAAa,CAClD,IAAMC,CAAAA,CAAaP,EAAAA,CAAQ,GAAA,CAAIK,CAAU,CAAA,CACzC,GAAIE,CAAAA,EAAc,CAACH,CAAAA,CACf,OAAOE,CAAAA,EAAe,CAACC,EAAW,QAAA,CAASxH,EAAK,CAAA,CAC1CwH,CAAAA,CAAW,MAAA,CAAOxH,EAAK,CAAA,CACvBwH,CAAAA,CAAW,KAAA,EAAM,CAE3B,IAAItT,CAAAA,CAAOsT,CAAAA,CACX,GAAI,CAACtT,CAAAA,CACD,GAAI,KAAA,CAAM,OAAA,CAAQmT,CAAU,CAAA,CACxBnT,CAAAA,CAAO,EAAC,CAAA,KACP,CACD,IAAM+Q,CAAAA,CAAO,KAAA,CAAM,IAAA,CAAKgC,EAAAA,CAAQ,IAAA,EAAM,CAAA,CACjC,OAAOhU,CAAAA,EAAOA,CAAAA,GAAQ,QAAQ,CAAA,CAC9B,GAAA,CAAIA,CAAAA,EAAO,IAAA,CAAK,SAAA,CAAUA,CAAG,CAAC,CAAA,CAC9B,IAAA,CAAK,IAAI,CAAA,CACd,MAAM,IAAI,KAAA,CAAM,CAAA,gBAAA,EAAmBqU,CAAU,CAAA,cAAA,EAAiBrC,CAAI,CAAA,2BAAA,CAA6B,CACnG,CAEJ,GAAI,KAAA,CAAM,OAAA,CAAQoC,CAAU,CAAA,CACxB,IAAA,IAAWpS,CAAAA,IAAOoS,CAAAA,CACdnT,EAAOA,CAAAA,CAAK,MAAA,CAAOe,CAAG,CAAA,CAAA,KAErB,OAAOoS,CAAAA,EAAe,UAAA,GAC3BnT,CAAAA,CAAOmT,CAAAA,CAAWnT,CAAAA,CAAK,KAAA,EAAO,CAAA,CAAA,CAElC,OAAIqT,CAAAA,GACArT,CAAAA,CAAOA,EAAK,MAAA,CAAO8L,EAAK,CAAA,CAAA,CACrB9L,CAAAA,CAAK,MAAA,CAAO,CAACA,CAAAA,CAAMe,CAAAA,GAAQ,CAC9B,IAAMqD,CAAAA,CAAS,OAAOrD,CAAAA,EAAQ,QAAA,CAAWiS,EAAAA,CAAWjS,CAAG,EAAIA,CAAAA,CAC3D,GAAI,CAACqD,CAAAA,CAAQ,CACT,IAAMH,CAAAA,CAAU,IAAA,CAAK,SAAA,CAAUlD,CAAG,CAAA,CAC5BgQ,CAAAA,CAAO,MAAA,CAAO,IAAA,CAAKiC,EAAU,CAAA,CAC9B,GAAA,CAAIjU,CAAAA,EAAO,IAAA,CAAK,SAAA,CAAUA,CAAG,CAAC,CAAA,CAC9B,IAAA,CAAK,IAAI,CAAA,CACd,MAAM,IAAI,KAAA,CAAM,CAAA,mBAAA,EAAsBkF,CAAO,CAAA,aAAA,EAAgB8M,CAAI,CAAA,CAAE,CACvE,CACA,OAAK/Q,CAAAA,CAAK,QAAA,CAASoE,CAAM,CAAA,EACrBpE,CAAAA,CAAK,IAAA,CAAKoE,CAAM,CAAA,CACbpE,CACX,CAAA,CAAG,EAAE,CACT,CCvFA,IAAMuT,EAAAA,CAAsB,CAAC5O,CAAAA,CAAGlL,CAAAA,GAAMkL,CAAAA,CAAE,GAAA,CAAMlL,CAAAA,CAAE,GAAA,CAAM,EAAA,CAAKkL,CAAAA,CAAE,GAAA,CAAMlL,CAAAA,CAAE,GAAA,CAAM,CAAA,CAAI,EACzE+Z,EAAAA,CAAN,MAAMC,CAAO,CACT,WAAA,CAAY,CAAE,MAAA,CAAAjK,CAAAA,CAAQ,UAAA,CAAA2J,CAAAA,CAAY,KAAA,CAAArH,CAAAA,CAAO,gBAAA,CAAA4H,CAAAA,CAAkB,MAAA,CAAAjP,CAAAA,CAAQ,cAAA,CAAAkP,CAAAA,CAAgB,gBAAA,CAAAC,CAAiB,CAAA,CAAG,CACnG,IAAA,CAAK,MAAA,CAAS,KAAA,CAAM,OAAA,CAAQpK,CAAM,CAAA,CAC5B0J,EAAAA,CAAQ1J,CAAAA,CAAQ,QAAQ,CAAA,CACxBA,EACI0J,EAAAA,CAAQ,IAAA,CAAM1J,CAAM,CAAA,CACpB,IAAA,CACV,IAAA,CAAK,IAAA,CAAQ,OAAO/E,CAAAA,EAAW,QAAA,EAAYA,CAAAA,EAAW,MAAA,CACtD,IAAA,CAAK,SAAA,CAAYiP,CAAAA,CAAmBT,EAAAA,CAAgB,EAAC,CACrD,IAAA,CAAK,IAAA,CAAOC,EAAAA,CAAQC,CAAAA,CAAY,IAAA,CAAK,IAAA,CAAMrH,CAAK,CAAA,CAChD,IAAA,CAAK,eAAA,CAAkB8H,CAAAA,EAAoB,IAAA,CAC3C,MAAA,CAAO,cAAA,CAAe,IAAA,CAAMpW,GAAK,CAAE,KAAA,CAAO8G,EAAI,CAAC,CAAA,CAC/C,MAAA,CAAO,cAAA,CAAe,IAAA,CAAM5G,CAAAA,CAAQ,CAAE,KAAA,CAAOoR,EAAO,CAAC,CAAA,CACrD,MAAA,CAAO,cAAA,CAAe,IAAA,CAAMnR,EAAAA,CAAK,CAAE,KAAA,CAAOkR,EAAI,CAAC,CAAA,CAE/C,IAAA,CAAK,cAAA,CACD,OAAO8E,CAAAA,EAAmB,UAAA,CACpBA,CAAAA,CACAA,CAAAA,GAAmB,IAAA,CACfJ,EAAAA,CACA,KAClB,CACA,KAAA,EAAQ,CACJ,IAAMtT,CAAAA,CAAO,MAAA,CAAO,MAAA,CAAOwT,CAAAA,CAAO,SAAA,CAAW,MAAA,CAAO,yBAAA,CAA0B,IAAI,CAAC,CAAA,CACnF,OAAAxT,CAAAA,CAAK,KAAO,IAAA,CAAK,IAAA,CAAK,KAAA,EAAM,CACrBA,CACX,CACJ,CAAA,CC9BA,SAAS4T,EAAAA,CAAkB7S,CAAAA,CAAKgJ,CAAAA,CAAS,CACrC,IAAM5Q,CAAAA,CAAQ,EAAC,CACX0a,EAAgB9J,CAAAA,CAAQ,UAAA,GAAe,IAAA,CAC3C,GAAIA,CAAAA,CAAQ,UAAA,GAAe,KAAA,EAAShJ,CAAAA,CAAI,UAAA,CAAY,CAChD,IAAM+S,CAAAA,CAAM/S,CAAAA,CAAI,UAAA,CAAW,QAAA,CAASA,CAAG,CAAA,CACnC+S,CAAAA,EACA3a,CAAAA,CAAM,IAAA,CAAK2a,CAAG,CAAA,CACdD,CAAAA,CAAgB,IAAA,EAEX9S,CAAAA,CAAI,UAAA,CAAW,QAAA,GACpB8S,CAAAA,CAAgB,IAAA,EACxB,CACIA,CAAAA,EACA1a,CAAAA,CAAM,KAAK,KAAK,CAAA,CACpB,IAAMuJ,CAAAA,CAAMoH,EAAAA,CAAuB/I,CAAAA,CAAKgJ,CAAO,CAAA,CACzC,CAAE,aAAA,CAAA1B,CAAc,CAAA,CAAI3F,CAAAA,CAAI,OAAA,CAC9B,GAAI3B,CAAAA,CAAI,cAAe,CACf5H,CAAAA,CAAM,MAAA,GAAW,CAAA,EACjBA,CAAAA,CAAM,OAAA,CAAQ,EAAE,CAAA,CACpB,IAAMkS,CAAAA,CAAKhD,CAAAA,CAActH,CAAAA,CAAI,aAAa,CAAA,CAC1C5H,CAAAA,CAAM,OAAA,CAAQgM,GAAckG,CAAAA,CAAI,EAAE,CAAC,EACvC,CACA,IAAIP,CAAAA,CAAY,KAAA,CACZiJ,CAAAA,CAAiB,IAAA,CACrB,GAAIhT,CAAAA,CAAI,QAAA,CAAU,CACd,GAAI3C,CAAAA,CAAO2C,CAAAA,CAAI,QAAQ,CAAA,CAAG,CAGtB,GAFIA,CAAAA,CAAI,QAAA,CAAS,WAAA,EAAe8S,CAAAA,EAC5B1a,CAAAA,CAAM,IAAA,CAAK,EAAE,CAAA,CACb4H,CAAAA,CAAI,QAAA,CAAS,aAAA,CAAe,CAC5B,IAAMsK,CAAAA,CAAKhD,CAAAA,CAActH,CAAAA,CAAI,QAAA,CAAS,aAAa,CAAA,CACnD5H,CAAAA,CAAM,IAAA,CAAKgM,EAAAA,CAAckG,CAAAA,CAAI,EAAE,CAAC,EACpC,CAEA3I,CAAAA,CAAI,iBAAmB,CAAC,CAAC3B,CAAAA,CAAI,OAAA,CAC7BgT,CAAAA,CAAiBhT,CAAAA,CAAI,QAAA,CAAS,QAClC,CACA,IAAMoH,CAAAA,CAAc4L,CAAAA,CAAiB,MAAA,CAAY,IAAOjJ,CAAAA,CAAY,IAAA,CAChE7B,EAAOoB,EAAAA,CAAUtJ,CAAAA,CAAI,QAAA,CAAU2B,CAAAA,CAAK,IAAOqR,CAAAA,CAAiB,IAAA,CAAO5L,CAAW,CAAA,CAC9E4L,CAAAA,GACA9K,CAAAA,EAAQ3D,EAAAA,CAAY2D,CAAAA,CAAM,EAAA,CAAIZ,CAAAA,CAAc0L,CAAc,CAAC,CAAA,CAAA,CAAA,CAC1D9K,CAAAA,CAAK,CAAC,CAAA,GAAM,GAAA,EAAOA,CAAAA,CAAK,CAAC,CAAA,GAAM,GAAA,GAChC9P,CAAAA,CAAMA,CAAAA,CAAM,MAAA,CAAS,CAAC,CAAA,GAAM,KAAA,CAG5BA,CAAAA,CAAMA,EAAM,MAAA,CAAS,CAAC,CAAA,CAAI,CAAA,IAAA,EAAO8P,CAAI,CAAA,CAAA,CAGrC9P,CAAAA,CAAM,IAAA,CAAK8P,CAAI,EACvB,CAAA,KAEI9P,CAAAA,CAAM,IAAA,CAAKkR,EAAAA,CAAUtJ,CAAAA,CAAI,QAAA,CAAU2B,CAAG,CAAC,CAAA,CAE3C,GAAI3B,CAAAA,CAAI,UAAA,EAAY,MAAA,CAChB,GAAIA,CAAAA,CAAI,OAAA,CAAS,CACb,IAAMsK,CAAAA,CAAKhD,CAAAA,CAActH,CAAAA,CAAI,OAAO,CAAA,CAChCsK,EAAG,QAAA,CAAS;AAAA,CAAI,CAAA,EAChBlS,CAAAA,CAAM,IAAA,CAAK,KAAK,CAAA,CAChBA,CAAAA,CAAM,IAAA,CAAKgM,EAAAA,CAAckG,CAAAA,CAAI,EAAE,CAAC,CAAA,EAGhClS,CAAAA,CAAM,IAAA,CAAK,CAAA,IAAA,EAAOkS,CAAE,CAAA,CAAE,EAE9B,CAAA,KAEIlS,CAAAA,CAAM,IAAA,CAAK,KAAK,CAAA,CAAA,KAGnB,CACD,IAAI6a,CAAAA,CAAKjT,CAAAA,CAAI,OAAA,CACTiT,GAAMlJ,CAAAA,GACNkJ,CAAAA,CAAKA,CAAAA,CAAG,OAAA,CAAQ,MAAA,CAAQ,EAAE,CAAA,CAAA,CAC1BA,CAAAA,GAAAA,CACK,CAAClJ,CAAAA,EAAaiJ,CAAAA,GAAmB5a,CAAAA,CAAMA,CAAAA,CAAM,MAAA,CAAS,CAAC,CAAA,GAAM,EAAA,EAC9DA,CAAAA,CAAM,IAAA,CAAK,EAAE,CAAA,CACjBA,CAAAA,CAAM,IAAA,CAAKgM,EAAAA,CAAckD,CAAAA,CAAc2L,CAAE,CAAA,CAAG,EAAE,CAAC,CAAA,EAEvD,CACA,OAAO7a,EAAM,IAAA,CAAK;AAAA,CAAI,CAAA,CAAI;AAAA,CAC9B,CCtEA,IAAM8a,EAAAA,CAAN,MAAMC,CAAS,CACX,WAAA,CAAYxY,CAAAA,CAAOyS,CAAAA,CAAUpE,CAAAA,CAAS,CAElC,IAAA,CAAK,cAAgB,IAAA,CAErB,IAAA,CAAK,OAAA,CAAU,IAAA,CAEf,IAAA,CAAK,MAAA,CAAS,EAAC,CAEf,KAAK,QAAA,CAAW,EAAC,CACjB,MAAA,CAAO,cAAA,CAAe,IAAA,CAAMpM,CAAAA,CAAW,CAAE,MAAOL,EAAI,CAAC,CAAA,CACrD,IAAI6W,CAAAA,CAAY,IAAA,CACZ,OAAOhG,CAAAA,EAAa,UAAA,EAAc,KAAA,CAAM,OAAA,CAAQA,CAAQ,CAAA,CACxDgG,CAAAA,CAAYhG,CAAAA,CAEPpE,CAAAA,GAAY,QAAaoE,CAAAA,GAC9BpE,CAAAA,CAAUoE,CAAAA,CACVA,CAAAA,CAAW,MAAA,CAAA,CAEf,IAAMnE,CAAAA,CAAM,MAAA,CAAO,OAAO,CACtB,WAAA,CAAa,KAAA,CACb,gBAAA,CAAkB,KAAA,CAClB,QAAA,CAAU,MAAA,CACV,YAAA,CAAc,KACd,MAAA,CAAQ,IAAA,CACR,UAAA,CAAY,KAAA,CACZ,UAAA,CAAY,IAAA,CACZ,OAAA,CAAS,KACb,CAAA,CAAGD,CAAO,CAAA,CACV,IAAA,CAAK,OAAA,CAAUC,CAAAA,CACf,GAAI,CAAE,QAAAxJ,CAAQ,CAAA,CAAIwJ,CAAAA,CACdD,CAAAA,EAASqK,CAAAA,EACT,IAAA,CAAK,UAAA,CAAarK,CAAAA,CAAQqK,EAAY,UAAA,EAAW,CAC7C,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,QAAA,GACrB5T,CAAAA,CAAU,IAAA,CAAK,WAAW,IAAA,CAAK,OAAA,CAAA,EAGnC,IAAA,CAAK,UAAA,CAAa,IAAIZ,EAAAA,CAAW,CAAE,OAAA,CAAAY,CAAQ,CAAC,CAAA,CAChD,IAAA,CAAK,SAAA,CAAUA,CAAAA,CAASuJ,CAAO,CAAA,CAE/B,KAAK,QAAA,CACDrO,CAAAA,GAAU,MAAA,CAAY,IAAA,CAAO,IAAA,CAAK,UAAA,CAAWA,CAAAA,CAAOyY,CAAAA,CAAWpK,CAAO,EAC9E,CAMA,KAAA,EAAQ,CACJ,IAAM/J,CAAAA,CAAO,MAAA,CAAO,MAAA,CAAOkU,EAAS,SAAA,CAAW,CAC3C,CAACvW,CAAS,EAAG,CAAE,KAAA,CAAOL,EAAI,CAC9B,CAAC,CAAA,CACD,OAAA0C,CAAAA,CAAK,aAAA,CAAgB,IAAA,CAAK,aAAA,CAC1BA,EAAK,OAAA,CAAU,IAAA,CAAK,OAAA,CACpBA,CAAAA,CAAK,MAAA,CAAS,IAAA,CAAK,MAAA,CAAO,KAAA,GAC1BA,CAAAA,CAAK,QAAA,CAAW,IAAA,CAAK,QAAA,CAAS,KAAA,EAAM,CACpCA,CAAAA,CAAK,OAAA,CAAU,OAAO,MAAA,CAAO,EAAC,CAAG,IAAA,CAAK,OAAO,CAAA,CACzC,IAAA,CAAK,UAAA,GACLA,CAAAA,CAAK,UAAA,CAAa,IAAA,CAAK,UAAA,CAAW,KAAA,EAAM,CAAA,CAC5CA,CAAAA,CAAK,MAAA,CAAS,KAAK,MAAA,CAAO,KAAA,EAAM,CAEhCA,CAAAA,CAAK,QAAA,CAAW5B,CAAAA,CAAO,IAAA,CAAK,QAAQ,EAC9B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM4B,CAAAA,CAAK,MAAM,CAAA,CAC/B,IAAA,CAAK,QAAA,CACP,KAAK,KAAA,GACLA,CAAAA,CAAK,KAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,KAAA,EAAM,CAAA,CAC3BA,CACX,CAEA,GAAA,CAAItE,CAAAA,CAAO,CACH2Y,EAAAA,CAAiB,IAAA,CAAK,QAAQ,CAAA,EAC9B,KAAK,QAAA,CAAS,GAAA,CAAI3Y,CAAK,EAC/B,CAEA,KAAA,CAAMqD,CAAAA,CAAMrD,CAAAA,CAAO,CACX2Y,EAAAA,CAAiB,IAAA,CAAK,QAAQ,CAAA,EAC9B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAMtV,CAAAA,CAAMrD,CAAK,EACvC,CAUA,WAAA,CAAYmC,CAAAA,CAAMwC,CAAAA,CAAM,CACpB,GAAI,CAACxC,CAAAA,CAAK,MAAA,CAAQ,CACd,IAAMyI,CAAAA,CAAOhF,EAAAA,CAAY,IAAI,CAAA,CAC7BzD,EAAK,MAAA,CAED,CAACwC,CAAAA,EAAQiG,CAAAA,CAAK,GAAA,CAAIjG,CAAI,CAAA,CAAIoB,EAAAA,CAAcpB,GAAQ,GAAA,CAAKiG,CAAI,CAAA,CAAIjG,EACrE,CACA,OAAO,IAAI2C,EAAAA,CAAMnF,EAAK,MAAM,CAChC,CACA,UAAA,CAAWnC,CAAAA,CAAOyS,CAAAA,CAAUpE,CAAAA,CAAS,CACjC,IAAIoK,CAAAA,CACJ,GAAI,OAAOhG,CAAAA,EAAa,UAAA,CACpBzS,CAAAA,CAAQyS,CAAAA,CAAS,KAAK,CAAE,EAAA,CAAIzS,CAAM,CAAA,CAAG,EAAA,CAAIA,CAAK,CAAA,CAC9CyY,CAAAA,CAAYhG,UAEP,KAAA,CAAM,OAAA,CAAQA,CAAQ,CAAA,CAAG,CAC9B,IAAMmG,CAAAA,CAAY3R,CAAAA,EAAM,OAAOA,CAAAA,EAAM,QAAA,EAAYA,CAAAA,YAAa,MAAA,EAAUA,CAAAA,YAAa,MAAA,CAC/E4R,CAAAA,CAAQpG,CAAAA,CAAS,MAAA,CAAOmG,CAAQ,CAAA,CAAE,GAAA,CAAI,MAAM,CAAA,CAC9CC,CAAAA,CAAM,MAAA,CAAS,IACfpG,CAAAA,CAAWA,CAAAA,CAAS,MAAA,CAAOoG,CAAK,CAAA,CAAA,CACpCJ,CAAAA,CAAYhG,EAChB,CAAA,KACSpE,IAAY,MAAA,EAAaoE,CAAAA,GAC9BpE,CAAAA,CAAUoE,CAAAA,CACVA,CAAAA,CAAW,MAAA,CAAA,CAEf,GAAM,CAAE,sBAAA7J,CAAAA,CAAuB,YAAA,CAAAkQ,CAAAA,CAAc,IAAA,CAAA/I,CAAAA,CAAM,aAAA,CAAAyC,CAAAA,CAAe,QAAA,CAAA3J,CAAAA,CAAU,GAAA,CAAAzD,CAAI,CAAA,CAAIiJ,CAAAA,EAAW,EAAC,CAC1F,CAAE,SAAAhH,CAAAA,CAAU,UAAA,CAAA0R,CAAAA,CAAY,aAAA,CAAA5S,CAAc,CAAA,CAAIF,EAAAA,CAAkB,IAAA,CAElE6S,GAAgB,GAAG,CAAA,CACb9R,CAAAA,CAAM,CACR,qBAAA,CAAuB4B,CAAAA,EAAyB,IAAA,CAChD,aAAA,CAAe4J,GAAiB,KAAA,CAChC,QAAA,CAAAnL,CAAAA,CACA,QAAA,CAAAwB,CAAAA,CACA,QAAA,CAAU4P,CAAAA,CACV,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,aAAA,CAAAtS,CACJ,CAAA,CACMhE,CAAAA,CAAOuG,EAAAA,CAAW1I,CAAAA,CAAOoF,EAAK4B,CAAG,CAAA,CACvC,OAAI+I,CAAAA,EAAQtN,CAAAA,CAAaN,CAAI,CAAA,GACzBA,CAAAA,CAAK,KAAO,IAAA,CAAA,CAChB4W,CAAAA,EAAW,CACJ5W,CACX,CAKA,UAAA,CAAWiB,CAAAA,CAAKpD,CAAAA,CAAOqO,EAAU,EAAC,CAAG,CACjC,IAAMxH,CAAAA,CAAI,IAAA,CAAK,UAAA,CAAWzD,CAAAA,CAAK,IAAA,CAAMiL,CAAO,CAAA,CACtCpH,CAAAA,CAAI,IAAA,CAAK,UAAA,CAAWjH,CAAAA,CAAO,IAAA,CAAMqO,CAAO,CAAA,CAC9C,OAAO,IAAI4C,CAAAA,CAAKpK,CAAAA,CAAGI,CAAC,CACxB,CAKA,OAAO7D,CAAAA,CAAK,CACR,OAAOuV,EAAAA,CAAiB,IAAA,CAAK,QAAQ,CAAA,CAAI,IAAA,CAAK,SAAS,MAAA,CAAOvV,CAAG,CAAA,CAAI,KACzE,CAKA,QAAA,CAASC,CAAAA,CAAM,CACX,OAAI4F,EAAAA,CAAY5F,CAAI,CAAA,CACZ,IAAA,CAAK,QAAA,EAAY,IAAA,CACV,KAAA,EAEX,KAAK,QAAA,CAAW,IAAA,CACT,IAAA,CAAA,CAEJsV,EAAAA,CAAiB,IAAA,CAAK,QAAQ,CAAA,CAC/B,IAAA,CAAK,SAAS,QAAA,CAAStV,CAAI,CAAA,CAC3B,KACV,CAMA,GAAA,CAAID,CAAAA,CAAKiG,CAAAA,CAAY,CACjB,OAAO5G,CAAAA,CAAa,IAAA,CAAK,QAAQ,CAAA,CAC3B,IAAA,CAAK,QAAA,CAAS,GAAA,CAAIW,CAAAA,CAAKiG,CAAU,CAAA,CACjC,MACV,CAMA,KAAA,CAAMhG,CAAAA,CAAMgG,CAAAA,CAAY,CACpB,OAAIJ,EAAAA,CAAY5F,CAAI,CAAA,CACT,CAACgG,CAAAA,EAAc9G,CAAAA,CAAS,IAAA,CAAK,QAAQ,CAAA,CACtC,IAAA,CAAK,QAAA,CAAS,KAAA,CACd,IAAA,CAAK,QAAA,CACRE,CAAAA,CAAa,IAAA,CAAK,QAAQ,CAAA,CAC3B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAMY,CAAAA,CAAMgG,CAAU,CAAA,CACpC,MACV,CAIA,GAAA,CAAIjG,CAAAA,CAAK,CACL,OAAOX,CAAAA,CAAa,IAAA,CAAK,QAAQ,CAAA,CAAI,KAAK,QAAA,CAAS,GAAA,CAAIW,CAAG,CAAA,CAAI,KAClE,CAIA,KAAA,CAAMC,CAAAA,CAAM,CACR,OAAI4F,EAAAA,CAAY5F,CAAI,CAAA,CACT,IAAA,CAAK,QAAA,GAAa,MAAA,CACtBZ,CAAAA,CAAa,KAAK,QAAQ,CAAA,CAAI,IAAA,CAAK,QAAA,CAAS,KAAA,CAAMY,CAAI,CAAA,CAAI,KACrE,CAKA,GAAA,CAAID,CAAAA,CAAKpD,CAAAA,CAAO,CACR,IAAA,CAAK,QAAA,EAAY,IAAA,CAEjB,KAAK,QAAA,CAAW+I,EAAAA,CAAmB,IAAA,CAAK,MAAA,CAAQ,CAAC3F,CAAG,CAAA,CAAGpD,CAAK,EAEvD2Y,EAAAA,CAAiB,IAAA,CAAK,QAAQ,CAAA,EACnC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAIvV,CAAAA,CAAKpD,CAAK,EAEpC,CAKA,KAAA,CAAMqD,CAAAA,CAAMrD,CAAAA,CAAO,CACXiJ,EAAAA,CAAY5F,CAAI,CAAA,CAEhB,IAAA,CAAK,QAAA,CAAWrD,CAAAA,CAEX,IAAA,CAAK,QAAA,EAAY,IAAA,CAEtB,IAAA,CAAK,SAAW+I,EAAAA,CAAmB,IAAA,CAAK,MAAA,CAAQ,KAAA,CAAM,IAAA,CAAK1F,CAAI,CAAA,CAAGrD,CAAK,EAElE2Y,EAAAA,CAAiB,IAAA,CAAK,QAAQ,CAAA,EACnC,IAAA,CAAK,QAAA,CAAS,KAAA,CAAMtV,CAAAA,CAAMrD,CAAK,EAEvC,CAQA,SAAA,CAAU8E,CAAAA,CAASuJ,CAAAA,CAAU,EAAC,CAAG,CACzB,OAAOvJ,CAAAA,EAAY,QAAA,GACnBA,CAAAA,CAAU,MAAA,CAAOA,CAAO,CAAA,CAAA,CAC5B,IAAIwJ,EACJ,OAAQxJ,CAAAA,EACJ,KAAK,KAAA,CACG,IAAA,CAAK,UAAA,CACL,IAAA,CAAK,WAAW,IAAA,CAAK,OAAA,CAAU,KAAA,CAE/B,IAAA,CAAK,UAAA,CAAa,IAAIZ,EAAAA,CAAW,CAAE,QAAS,KAAM,CAAC,CAAA,CACvDoK,CAAAA,CAAM,CAAE,gBAAA,CAAkB,KAAA,CAAO,MAAA,CAAQ,UAAW,CAAA,CACpD,MACJ,KAAK,KAAA,CACL,KAAK,MAAA,CACG,IAAA,CAAK,WACL,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,OAAA,CAAUxJ,CAAAA,CAE/B,IAAA,CAAK,UAAA,CAAa,IAAIZ,GAAW,CAAE,OAAA,CAAAY,CAAQ,CAAC,CAAA,CAChDwJ,CAAAA,CAAM,CAAE,gBAAA,CAAkB,KAAM,MAAA,CAAQ,MAAO,CAAA,CAC/C,MACJ,KAAK,IAAA,CACG,IAAA,CAAK,UAAA,EACL,OAAO,IAAA,CAAK,UAAA,CAChBA,CAAAA,CAAM,IAAA,CACN,MACJ,QAAS,CACL,IAAMgF,CAAAA,CAAK,IAAA,CAAK,SAAA,CAAUxO,CAAO,CAAA,CACjC,MAAM,IAAI,KAAA,CAAM,+DAA+DwO,CAAE,CAAA,CAAE,CACvF,CACJ,CAEA,GAAIjF,CAAAA,CAAQ,MAAA,YAAkB,OAC1B,IAAA,CAAK,MAAA,CAASA,CAAAA,CAAQ,MAAA,CAAA,KAAA,GACjBC,CAAAA,CACL,IAAA,CAAK,MAAA,CAAS,IAAIuJ,EAAAA,CAAO,MAAA,CAAO,MAAA,CAAOvJ,CAAAA,CAAKD,CAAO,CAAC,CAAA,CAAA,KAEpD,MAAM,IAAI,KAAA,CAAM,qEAAqE,CAC7F,CAEA,IAAA,CAAK,CAAE,IAAA,CAAAzC,CAAAA,CAAM,QAAAoN,CAAAA,CAAS,QAAA,CAAA7R,CAAAA,CAAU,aAAA,CAAAC,CAAAA,CAAe,QAAA,CAAAC,CAAAA,CAAU,OAAA,CAAAd,CAAQ,CAAA,CAAI,EAAC,CAAG,CACrE,IAAMS,CAAAA,CAAM,CACR,OAAA,CAAS,IAAI,GAAA,CACb,GAAA,CAAK,IAAA,CACL,IAAA,CAAM,CAAC4E,CAAAA,CACP,QAAA,CAAUzE,IAAa,IAAA,CACvB,YAAA,CAAc,KAAA,CACd,aAAA,CAAe,OAAOC,CAAAA,EAAkB,QAAA,CAAWA,CAAAA,CAAgB,GACvE,CAAA,CACM7C,CAAAA,CAAMuC,CAAAA,CAAK,IAAA,CAAK,QAAA,CAAUkS,CAAAA,EAAW,EAAA,CAAIhS,CAAG,EAClD,GAAI,OAAOK,CAAAA,EAAa,UAAA,CACpB,IAAA,GAAW,CAAE,KAAA,CAAAnH,CAAAA,CAAO,IAAAqE,CAAI,CAAA,GAAKyC,CAAAA,CAAI,OAAA,CAAQ,MAAA,EAAO,CAC5CK,CAAAA,CAAS9C,CAAAA,CAAKrE,CAAK,CAAA,CAC3B,OAAO,OAAOqG,CAAAA,EAAY,UAAA,CACpBD,EAAAA,CAAaC,CAAAA,CAAS,CAAE,GAAIhC,CAAI,CAAA,CAAG,EAAA,CAAIA,CAAG,CAAA,CAC1CA,CACV,CAOA,MAAA,CAAOyU,EAAS3R,CAAAA,CAAU,CACtB,OAAO,IAAA,CAAK,IAAA,CAAK,CAAE,IAAA,CAAM,IAAA,CAAM,OAAA,CAAA2R,CAAAA,CAAS,QAAA,CAAU,KAAA,CAAO,QAAA,CAAA3R,CAAS,CAAC,CACvE,CAEA,QAAA,CAASgH,CAAAA,CAAU,EAAC,CAAG,CACnB,GAAI,IAAA,CAAK,MAAA,CAAO,OAAS,CAAA,CACrB,MAAM,IAAI,KAAA,CAAM,4CAA4C,CAAA,CAChE,GAAI,QAAA,GAAYA,IACX,CAAC,MAAA,CAAO,SAAA,CAAUA,CAAAA,CAAQ,MAAM,CAAA,EAAK,MAAA,CAAOA,CAAAA,CAAQ,MAAM,CAAA,EAAK,CAAA,CAAA,CAAI,CACpE,IAAMyG,CAAAA,CAAI,IAAA,CAAK,SAAA,CAAUzG,EAAQ,MAAM,CAAA,CACvC,MAAM,IAAI,KAAA,CAAM,CAAA,gDAAA,EAAmDyG,CAAC,CAAA,CAAE,CAC1E,CACA,OAAOoD,EAAAA,CAAkB,IAAA,CAAM7J,CAAO,CAC1C,CACJ,CAAA,CACA,SAASsK,EAAAA,CAAiBM,CAAAA,CAAU,CAChC,GAAIxW,CAAAA,CAAawW,CAAQ,CAAA,CACrB,OAAO,KAAA,CACX,MAAM,IAAI,KAAA,CAAM,iDAAiD,CACrE,CC5UA,IAAMC,GAAN,cAAwB,KAAM,CAC1B,WAAA,CAAYvU,CAAAA,CAAM1E,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAAA,CAAS,CAClC,KAAA,EAAM,CACN,IAAA,CAAK,IAAA,CAAO2H,CAAAA,CACZ,IAAA,CAAK,IAAA,CAAOoH,CAAAA,CACZ,KAAK,OAAA,CAAU/O,CAAAA,CACf,IAAA,CAAK,GAAA,CAAMiD,EACf,CACJ,CAAA,CACMkZ,EAAAA,CAAN,cAA6BD,EAAU,CACnC,WAAA,CAAYjZ,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAAA,CAAS,CAC5B,MAAM,gBAAA,CAAkBiD,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAO,EAC9C,CACJ,CAAA,CACMoc,EAAAA,CAAN,cAA0BF,EAAU,CAChC,WAAA,CAAYjZ,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAAA,CAAS,CAC5B,KAAA,CAAM,cAAeiD,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAO,EAC3C,CACJ,CAAA,CACMqc,EAAAA,CAAgB,CAACxR,CAAAA,CAAKyR,CAAAA,GAAQnU,CAAAA,EAAU,CAC1C,GAAIA,CAAAA,CAAM,GAAA,CAAI,CAAC,IAAM,EAAA,CACjB,OACJA,CAAAA,CAAM,OAAA,CAAUA,CAAAA,CAAM,GAAA,CAAI,GAAA,CAAIlF,CAAAA,EAAOqZ,EAAG,OAAA,CAAQrZ,CAAG,CAAC,CAAA,CACpD,GAAM,CAAE,IAAA,CAAAuE,CAAAA,CAAM,IAAA+U,CAAI,CAAA,CAAIpU,CAAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,CACrCA,CAAAA,CAAM,OAAA,EAAW,CAAA,SAAA,EAAYX,CAAI,CAAA,SAAA,EAAY+U,CAAG,CAAA,CAAA,CAChD,IAAI9V,CAAAA,CAAK8V,CAAAA,CAAM,EACXC,CAAAA,CAAU3R,CAAAA,CACT,SAAA,CAAUyR,CAAAA,CAAG,UAAA,CAAW9U,CAAAA,CAAO,CAAC,CAAA,CAAG8U,EAAG,UAAA,CAAW9U,CAAI,CAAC,CAAA,CACtD,OAAA,CAAQ,UAAA,CAAY,EAAE,CAAA,CAE3B,GAAIf,CAAAA,EAAM,EAAA,EAAM+V,CAAAA,CAAQ,MAAA,CAAS,EAAA,CAAI,CACjC,IAAMC,CAAAA,CAAY,IAAA,CAAK,GAAA,CAAIhW,CAAAA,CAAK,EAAA,CAAI+V,CAAAA,CAAQ,MAAA,CAAS,EAAE,CAAA,CACvDA,EAAU,QAAA,CAAMA,CAAAA,CAAQ,SAAA,CAAUC,CAAS,CAAA,CAC3ChW,CAAAA,EAAMgW,CAAAA,CAAY,EACtB,CAIA,GAHID,CAAAA,CAAQ,MAAA,CAAS,EAAA,GACjBA,CAAAA,CAAUA,CAAAA,CAAQ,SAAA,CAAU,CAAA,CAAG,EAAE,CAAA,CAAI,QAAA,CAAA,CAErChV,CAAAA,CAAO,CAAA,EAAK,MAAA,CAAO,IAAA,CAAKgV,CAAAA,CAAQ,SAAA,CAAU,EAAG/V,CAAE,CAAC,CAAA,CAAG,CAEnD,IAAImH,CAAAA,CAAO/C,CAAAA,CAAI,SAAA,CAAUyR,EAAG,UAAA,CAAW9U,CAAAA,CAAO,CAAC,CAAA,CAAG8U,CAAAA,CAAG,UAAA,CAAW9U,CAAAA,CAAO,CAAC,CAAC,CAAA,CACrEoG,CAAAA,CAAK,MAAA,CAAS,EAAA,GACdA,CAAAA,CAAOA,CAAAA,CAAK,SAAA,CAAU,CAAA,CAAG,EAAE,CAAA,CAAI,CAAA;AAAA,CAAA,CAAA,CACnC4O,CAAAA,CAAU5O,EAAO4O,EACrB,CACA,GAAI,MAAA,CAAO,IAAA,CAAKA,CAAO,CAAA,CAAG,CACtB,IAAItZ,EAAQ,CAAA,CACN3C,CAAAA,CAAM4H,EAAM,OAAA,CAAQ,CAAC,EACvB5H,CAAAA,EAAOA,CAAAA,CAAI,IAAA,GAASiH,CAAAA,EAAQjH,CAAAA,CAAI,GAAA,CAAMgc,IACtCrZ,CAAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,CAAG,IAAA,CAAK,IAAI3C,CAAAA,CAAI,GAAA,CAAMgc,CAAAA,CAAK,EAAA,CAAK9V,CAAE,CAAC,GAExD,IAAMiW,CAAAA,CAAU,GAAA,CAAI,MAAA,CAAOjW,CAAE,CAAA,CAAI,IAAI,MAAA,CAAOvD,CAAK,CAAA,CACjDiF,CAAAA,CAAM,OAAA,EAAW,CAAA;;AAAA,EAAQqU,CAAO;AAAA,EAAKE,CAAO;AAAA,EAChD,CACJ,ECtDA,SAASC,EAAAA,CAAaC,EAAQ,CAAE,IAAA,CAAA7J,EAAM,SAAA,CAAA8J,CAAAA,CAAW,KAAA5O,CAAAA,CAAM,MAAA,CAAAvN,EAAQ,OAAA,CAAA+G,CAAAA,CAAS,aAAAqV,CAAAA,CAAc,cAAA,CAAAC,CAAe,CAAA,CAAG,CACpG,IAAIC,EAAc,KAAA,CACdC,CAAAA,CAAYF,EACZG,CAAAA,CAAWH,CAAAA,CACXrQ,EAAU,EAAA,CACVyQ,CAAAA,CAAa,GACbrK,CAAAA,CAAa,KAAA,CACbsK,EAAW,KAAA,CACXC,CAAAA,CAAM,KACN3U,CAAAA,CAAS,IAAA,CACTN,EAAM,IAAA,CACNkV,CAAAA,CAAmB,IAAA,CACnBC,CAAAA,CAAQ,IAAA,CACR/S,CAAAA,CAAQ,KACRlK,CAAAA,CAAQ,IAAA,CACZ,QAAWkd,CAAAA,IAASZ,CAAAA,CAchB,OAbIQ,CAAAA,GACII,CAAAA,CAAM,OAAS,OAAA,EACfA,CAAAA,CAAM,OAAS,SAAA,EACfA,CAAAA,CAAM,OAAS,OAAA,EACf/V,CAAAA,CAAQ+V,EAAM,MAAA,CAAQ,cAAA,CAAgB,uEAAuE,CAAA,CACjHJ,CAAAA,CAAW,KAAA,CAAA,CAEXC,IACIJ,CAAAA,EAAaO,CAAAA,CAAM,OAAS,SAAA,EAAaA,CAAAA,CAAM,OAAS,SAAA,EACxD/V,CAAAA,CAAQ4V,EAAK,eAAA,CAAiB,qCAAqC,EAEvEA,CAAAA,CAAM,IAAA,CAAA,CAEFG,EAAM,IAAA,EACV,KAAK,OAAA,CAIG,CAACzK,CAAAA,GACA8J,CAAAA,GAAc,WAAA,EAAe5O,CAAAA,EAAM,OAAS,iBAAA,CAAA,EAC7CuP,CAAAA,CAAM,OAAO,QAAA,CAAS,GAAI,IAC1BH,CAAAA,CAAMG,CAAAA,CAAAA,CAEVN,EAAW,IAAA,CACX,MACJ,KAAK,SAAA,CAAW,CACPA,GACDzV,CAAAA,CAAQ+V,CAAAA,CAAO,eAAgB,wEAAwE,CAAA,CAC3G,IAAMC,CAAAA,CAAKD,CAAAA,CAAM,MAAA,CAAO,UAAU,CAAC,CAAA,EAAK,IACnC9Q,CAAAA,CAGDA,CAAAA,EAAWyQ,EAAaM,CAAAA,CAFxB/Q,CAAAA,CAAU+Q,EAGdN,CAAAA,CAAa,EAAA,CACbF,EAAY,KAAA,CACZ,KACJ,CACA,KAAK,SAAA,CACGA,EACIvQ,CAAAA,CACAA,CAAAA,EAAW8Q,CAAAA,CAAM,MAAA,CAAA,CACZ,CAAChT,CAAAA,EAASqS,IAAc,cAAA,IAC7BG,CAAAA,CAAc,MAGlBG,CAAAA,EAAcK,CAAAA,CAAM,OACxBP,CAAAA,CAAY,IAAA,CACZnK,EAAa,IAAA,CAAA,CACTpK,CAAAA,EAAUN,KACVkV,CAAAA,CAAmBE,CAAAA,CAAAA,CACvBN,EAAW,IAAA,CACX,MACJ,KAAK,QAAA,CACGxU,CAAAA,EACAjB,CAAAA,CAAQ+V,CAAAA,CAAO,kBAAA,CAAoB,oCAAoC,EACvEA,CAAAA,CAAM,MAAA,CAAO,SAAS,GAAG,CAAA,EACzB/V,EAAQ+V,CAAAA,CAAM,MAAA,CAASA,CAAAA,CAAM,MAAA,CAAO,MAAA,CAAS,CAAA,CAAG,YAAa,iCAAA,CAAmC,IAAI,EACxG9U,CAAAA,CAAS8U,CAAAA,CACTld,IAAUA,CAAAA,CAAQkd,CAAAA,CAAM,MAAA,CAAA,CACxBP,CAAAA,CAAY,KAAA,CACZC,CAAAA,CAAW,MACXE,CAAAA,CAAW,IAAA,CACX,MACJ,KAAK,KAAA,CAAO,CACJhV,CAAAA,EACAX,CAAAA,CAAQ+V,EAAO,eAAA,CAAiB,iCAAiC,EACrEpV,CAAAA,CAAMoV,CAAAA,CACNld,IAAUA,CAAAA,CAAQkd,CAAAA,CAAM,QACxBP,CAAAA,CAAY,KAAA,CACZC,CAAAA,CAAW,KAAA,CACXE,CAAAA,CAAW,IAAA,CACX,KACJ,CACA,KAAKP,GAEGnU,CAAAA,EAAUN,CAAAA,GACVX,EAAQ+V,CAAAA,CAAO,gBAAA,CAAkB,sCAAsCA,CAAAA,CAAM,MAAM,YAAY,CAAA,CAC/FhT,CAAAA,EACA/C,EAAQ+V,CAAAA,CAAO,kBAAA,CAAoB,cAAcA,CAAAA,CAAM,MAAM,CAAA,IAAA,EAAOzK,CAAAA,EAAQ,YAAY,CAAA,CAAE,EAC9FvI,CAAAA,CAAQgT,CAAAA,CACRP,EACIJ,CAAAA,GAAc,cAAA,EAAkBA,IAAc,kBAAA,CAClDK,CAAAA,CAAW,MACX,MACJ,KAAK,QACD,GAAInK,CAAAA,CAAM,CACFwK,CAAAA,EACA9V,CAAAA,CAAQ+V,EAAO,kBAAA,CAAoB,CAAA,gBAAA,EAAmBzK,CAAI,CAAA,CAAE,CAAA,CAChEwK,CAAAA,CAAQC,EACRP,CAAAA,CAAY,KAAA,CACZC,EAAW,KAAA,CACX,KACJ,CAEJ,QACIzV,CAAAA,CAAQ+V,EAAO,kBAAA,CAAoB,CAAA,WAAA,EAAcA,EAAM,IAAI,CAAA,MAAA,CAAQ,EACnEP,CAAAA,CAAY,KAAA,CACZC,EAAW,MACnB,CAEJ,IAAMQ,CAAAA,CAAOd,CAAAA,CAAOA,CAAAA,CAAO,OAAS,CAAC,CAAA,CAC/Brc,EAAMmd,CAAAA,CAAOA,CAAAA,CAAK,OAASA,CAAAA,CAAK,MAAA,CAAO,OAAShd,CAAAA,CACtD,OAAI0c,GACAnP,CAAAA,EACAA,CAAAA,CAAK,OAAS,OAAA,EACdA,CAAAA,CAAK,OAAS,SAAA,EACdA,CAAAA,CAAK,IAAA,GAAS,OAAA,GACbA,CAAAA,CAAK,IAAA,GAAS,UAAYA,CAAAA,CAAK,MAAA,GAAW,KAC3CxG,CAAAA,CAAQwG,CAAAA,CAAK,OAAQ,cAAA,CAAgB,uEAAuE,EAE5GoP,CAAAA,GACEJ,CAAAA,EAAaI,EAAI,MAAA,EAAUP,CAAAA,EACzB7O,GAAM,IAAA,GAAS,WAAA,EACfA,GAAM,IAAA,GAAS,WAAA,CAAA,EACnBxG,CAAAA,CAAQ4V,CAAAA,CAAK,eAAA,CAAiB,qCAAqC,EAChE,CACH,KAAA,CAAAE,EACA,KAAA,CAAA/S,CAAAA,CACA,YAAAwS,CAAAA,CACA,OAAA,CAAAtQ,EACA,UAAA,CAAAoG,CAAAA,CACA,OAAApK,CAAAA,CACA,GAAA,CAAAN,EACA,gBAAA,CAAAkV,CAAAA,CACA,IAAA/c,CAAAA,CACA,KAAA,CAAOD,CAAAA,EAASC,CACpB,CACJ,CC/IA,SAASod,EAAAA,CAAgBvX,CAAAA,CAAK,CAC1B,GAAI,CAACA,EACD,OAAO,IAAA,CACX,OAAQA,CAAAA,CAAI,IAAA,EACR,KAAK,OAAA,CACL,KAAK,SACL,KAAK,sBAAA,CACL,KAAK,sBAAA,CACD,GAAIA,CAAAA,CAAI,MAAA,CAAO,QAAA,CAAS;AAAA,CAAI,CAAA,CACxB,OAAO,KAAA,CACX,GAAIA,CAAAA,CAAI,GAAA,CAAA,CACJ,IAAA,IAAWwX,CAAAA,IAAMxX,CAAAA,CAAI,GAAA,CACjB,GAAIwX,CAAAA,CAAG,OAAS,SAAA,CACZ,OAAO,KAAA,CACnB,OAAO,MAAA,CACX,KAAK,iBAAA,CACD,IAAA,IAAWzR,KAAM/F,CAAAA,CAAI,KAAA,CAAO,CACxB,IAAA,IAAWwX,CAAAA,IAAMzR,CAAAA,CAAG,KAAA,CAChB,GAAIyR,EAAG,IAAA,GAAS,SAAA,CACZ,OAAO,KAAA,CACf,GAAIzR,CAAAA,CAAG,GAAA,CAAA,CACH,IAAA,IAAWyR,CAAAA,IAAMzR,CAAAA,CAAG,GAAA,CAChB,GAAIyR,CAAAA,CAAG,IAAA,GAAS,SAAA,CACZ,OAAO,MACnB,GAAID,EAAAA,CAAgBxR,CAAAA,CAAG,GAAG,CAAA,EAAKwR,EAAAA,CAAgBxR,CAAAA,CAAG,KAAK,EACnD,OAAO,KACf,CACA,OAAO,MAAA,CACX,QACI,OAAO,KACf,CACJ,CC7BA,SAAS0R,EAAAA,CAAgBlR,CAAAA,CAAQmR,CAAAA,CAAIrW,CAAAA,CAAS,CAC1C,GAAIqW,CAAAA,EAAI,IAAA,GAAS,iBAAA,CAAmB,CAChC,IAAMvd,CAAAA,CAAMud,CAAAA,CAAG,GAAA,CAAI,CAAC,CAAA,CAChBvd,CAAAA,CAAI,MAAA,GAAWoM,CAAAA,GACdpM,CAAAA,CAAI,MAAA,GAAW,GAAA,EAAOA,CAAAA,CAAI,SAAW,GAAA,CAAA,EACtCod,EAAAA,CAAgBG,CAAE,CAAA,EAElBrW,CAAAA,CAAQlH,CAAAA,CAAK,YAAA,CADD,wDAAA,CACoB,IAAI,EAE5C,CACJ,CCVA,SAASwd,EAAAA,CAAY/T,CAAAA,CAAKyK,CAAAA,CAAOuJ,CAAAA,CAAQ,CACrC,GAAM,CAAE,UAAA,CAAAC,CAAW,CAAA,CAAIjU,CAAAA,CAAI,OAAA,CAC3B,GAAIiU,CAAAA,GAAe,KAAA,CACf,OAAO,MAAA,CACX,IAAMC,CAAAA,CAAU,OAAOD,CAAAA,EAAe,WAChCA,CAAAA,CACA,CAACjS,CAAAA,CAAGlL,CAAAA,GAAMkL,CAAAA,GAAMlL,CAAAA,EAAMyE,CAAAA,CAASyG,CAAC,GAAKzG,CAAAA,CAASzE,CAAC,CAAA,EAAKkL,CAAAA,CAAE,KAAA,GAAUlL,CAAAA,CAAE,KAAA,CACxE,OAAO2T,CAAAA,CAAM,IAAA,CAAKL,CAAAA,EAAQ8J,CAAAA,CAAQ9J,CAAAA,CAAK,GAAA,CAAK4J,CAAM,CAAC,CACvD,CCHA,IAAMG,EAAAA,CAAc,iDAAA,CACpB,SAASC,EAAAA,CAAgB,CAAE,WAAA,CAAAC,EAAa,gBAAA,CAAAC,CAAiB,CAAA,CAAGtU,CAAAA,CAAKuU,CAAAA,CAAI9W,CAAAA,CAASW,CAAAA,CAAK,CAC/E,IAAMoW,CAAAA,CAAYpW,CAAAA,EAAK,SAAA,EAAamN,CAAAA,CAC9B5J,CAAAA,CAAM,IAAI6S,CAAAA,CAAUxU,CAAAA,CAAI,MAAM,CAAA,CAChCA,CAAAA,CAAI,MAAA,GACJA,CAAAA,CAAI,MAAA,CAAS,KAAA,CAAA,CACjB,IAAItJ,EAAS6d,CAAAA,CAAG,MAAA,CACZE,CAAAA,CAAa,IAAA,CACjB,IAAA,IAAWC,CAAAA,IAAYH,CAAAA,CAAG,KAAA,CAAO,CAC7B,GAAM,CAAE,KAAA,CAAAje,CAAAA,CAAO,GAAA,CAAA8F,CAAAA,CAAK,GAAA,CAAAuY,CAAAA,CAAK,MAAA3b,CAAM,CAAA,CAAI0b,CAAAA,CAE7BE,CAAAA,CAAWjC,EAAAA,CAAarc,CAAAA,CAAO,CACjC,SAAA,CAAW,kBAAA,CACX,IAAA,CAAM8F,CAAAA,EAAOuY,CAAAA,GAAM,CAAC,CAAA,CACpB,MAAA,CAAAje,CAAAA,CACA,QAAA+G,CAAAA,CACA,YAAA,CAAc8W,CAAAA,CAAG,MAAA,CACjB,cAAA,CAAgB,IACpB,CAAC,CAAA,CACK1P,EAAc,CAAC+P,CAAAA,CAAS,KAAA,CAC9B,GAAI/P,CAAAA,CAAa,CAOb,GANIzI,CAAAA,GACIA,EAAI,IAAA,GAAS,WAAA,CACbqB,CAAAA,CAAQ/G,CAAAA,CAAQ,uBAAA,CAAyB,yDAAyD,CAAA,CAC7F,QAAA,GAAY0F,CAAAA,EAAOA,CAAAA,CAAI,MAAA,GAAWmY,CAAAA,CAAG,MAAA,EAC1C9W,CAAAA,CAAQ/G,CAAAA,CAAQ,YAAA,CAAcyd,EAAW,CAAA,CAAA,CAE7C,CAACS,CAAAA,CAAS,MAAA,EAAU,CAACA,CAAAA,CAAS,GAAA,EAAO,CAACD,EAAK,CAC3CF,CAAAA,CAAaG,CAAAA,CAAS,GAAA,CAClBA,CAAAA,CAAS,OAAA,GACLjT,CAAAA,CAAI,OAAA,CACJA,EAAI,OAAA,EAAW;AAAA,CAAA,CAAOiT,CAAAA,CAAS,QAE/BjT,CAAAA,CAAI,OAAA,CAAUiT,EAAS,OAAA,CAAA,CAE/B,QACJ,CAAA,CACIA,CAAAA,CAAS,gBAAA,EAAoBjB,EAAAA,CAAgBvX,CAAG,CAAA,GAChDqB,CAAAA,CAAQrB,GAAO9F,CAAAA,CAAMA,CAAAA,CAAM,OAAS,CAAC,CAAA,CAAG,wBAAA,CAA0B,2CAA2C,EAErH,CAAA,KACSse,EAAS,KAAA,EAAO,MAAA,GAAWL,EAAG,MAAA,EACnC9W,CAAAA,CAAQ/G,EAAQ,YAAA,CAAcyd,EAAW,CAAA,CAG7CnU,CAAAA,CAAI,KAAA,CAAQ,IAAA,CACZ,IAAM6U,CAAAA,CAAWD,CAAAA,CAAS,IACpBE,CAAAA,CAAU1Y,CAAAA,CACViY,EAAYrU,CAAAA,CAAK5D,CAAAA,CAAKwY,CAAAA,CAAUnX,CAAO,CAAA,CACvC6W,CAAAA,CAAiBtU,EAAK6U,CAAAA,CAAUve,CAAAA,CAAO,KAAMse,CAAAA,CAAUnX,CAAO,EAChEuC,CAAAA,CAAI,MAAA,CAAO,MAAA,EACX6T,EAAAA,CAAgBU,CAAAA,CAAG,MAAA,CAAQnY,EAAKqB,CAAO,CAAA,CAC3CuC,EAAI,KAAA,CAAQ,KAAA,CACR+T,GAAY/T,CAAAA,CAAK2B,CAAAA,CAAI,KAAA,CAAOmT,CAAO,CAAA,EACnCrX,CAAAA,CAAQoX,EAAU,eAAA,CAAiB,yBAAyB,EAEhE,IAAME,CAAAA,CAAapC,GAAagC,CAAAA,EAAO,EAAC,CAAG,CACvC,SAAA,CAAW,eAAA,CACX,KAAM3b,CAAAA,CACN,MAAA,CAAQ8b,CAAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,CACvB,QAAArX,CAAAA,CACA,YAAA,CAAc8W,CAAAA,CAAG,MAAA,CACjB,cAAA,CAAgB,CAACnY,GAAOA,CAAAA,CAAI,IAAA,GAAS,cACzC,CAAC,CAAA,CAED,GADA1F,CAAAA,CAASqe,CAAAA,CAAW,GAAA,CAChBA,CAAAA,CAAW,KAAA,CAAO,CACdlQ,IACI7L,CAAAA,EAAO,IAAA,GAAS,aAAe,CAAC+b,CAAAA,CAAW,YAC3CtX,CAAAA,CAAQ/G,CAAAA,CAAQ,uBAAA,CAAyB,qDAAqD,CAAA,CAC9FsJ,CAAAA,CAAI,QAAQ,MAAA,EACZ4U,CAAAA,CAAS,MAAQG,CAAAA,CAAW,KAAA,CAAM,OAAS,IAAA,EAC3CtX,CAAAA,CAAQqX,CAAAA,CAAQ,KAAA,CAAO,qBAAA,CAAuB,6FAA6F,GAGnJ,IAAME,CAAAA,CAAYhc,EACZqb,CAAAA,CAAYrU,CAAAA,CAAKhH,EAAO+b,CAAAA,CAAYtX,CAAO,CAAA,CAC3C6W,CAAAA,CAAiBtU,CAAAA,CAAKtJ,CAAAA,CAAQie,EAAK,IAAA,CAAMI,CAAAA,CAAYtX,CAAO,CAAA,CAC9DuC,CAAAA,CAAI,OAAO,MAAA,EACX6T,EAAAA,CAAgBU,CAAAA,CAAG,MAAA,CAAQvb,CAAAA,CAAOyE,CAAO,EAC7C/G,CAAAA,CAASse,CAAAA,CAAU,MAAM,CAAC,CAAA,CAC1B,IAAM5K,CAAAA,CAAO,IAAIH,CAAAA,CAAK6K,CAAAA,CAASE,CAAS,CAAA,CACpChV,EAAI,OAAA,CAAQ,gBAAA,GACZoK,EAAK,QAAA,CAAWsK,CAAAA,CAAAA,CACpB/S,EAAI,KAAA,CAAM,IAAA,CAAKyI,CAAI,EACvB,CAAA,KACK,CAEGvF,GACApH,CAAAA,CAAQqX,CAAAA,CAAQ,KAAA,CAAO,cAAA,CAAgB,qDAAqD,CAAA,CAC5FC,EAAW,OAAA,GACPD,CAAAA,CAAQ,OAAA,CACRA,CAAAA,CAAQ,OAAA,EAAW;AAAA,CAAA,CAAOC,CAAAA,CAAW,OAAA,CAErCD,CAAAA,CAAQ,OAAA,CAAUC,CAAAA,CAAW,SAErC,IAAM3K,CAAAA,CAAO,IAAIH,CAAAA,CAAK6K,CAAO,CAAA,CACzB9U,EAAI,OAAA,CAAQ,gBAAA,GACZoK,CAAAA,CAAK,QAAA,CAAWsK,CAAAA,CAAAA,CACpB/S,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAKyI,CAAI,EACvB,CACJ,CACA,OAAIqK,CAAAA,EAAcA,EAAa/d,CAAAA,EAC3B+G,CAAAA,CAAQgX,CAAAA,CAAY,YAAA,CAAc,mCAAmC,CAAA,CACzE9S,EAAI,KAAA,CAAQ,CAAC4S,CAAAA,CAAG,MAAA,CAAQ7d,CAAAA,CAAQ+d,CAAAA,EAAc/d,CAAM,CAAA,CAC7CiL,CACX,CC5GA,SAASsT,EAAAA,CAAgB,CAAE,WAAA,CAAAZ,CAAAA,CAAa,gBAAA,CAAAC,CAAiB,CAAA,CAAGtU,CAAAA,CAAKkV,CAAAA,CAAIzX,CAAAA,CAASW,EAAK,CAC/E,IAAMoW,CAAAA,CAAYpW,CAAAA,EAAK,SAAA,EAAa2N,CAAAA,CAC9BG,EAAM,IAAIsI,CAAAA,CAAUxU,CAAAA,CAAI,MAAM,CAAA,CAChCA,CAAAA,CAAI,SACJA,CAAAA,CAAI,MAAA,CAAS,KAAA,CAAA,CACbA,CAAAA,CAAI,KAAA,GACJA,CAAAA,CAAI,KAAA,CAAQ,KAAA,CAAA,CAChB,IAAItJ,CAAAA,CAASwe,CAAAA,CAAG,MAAA,CACZT,CAAAA,CAAa,IAAA,CACjB,OAAW,CAAE,KAAA,CAAAne,CAAAA,CAAO,KAAA,CAAA0C,CAAM,CAAA,GAAKkc,CAAAA,CAAG,KAAA,CAAO,CACrC,IAAMxN,CAAAA,CAAQiL,EAAAA,CAAarc,CAAAA,CAAO,CAC9B,UAAW,cAAA,CACX,IAAA,CAAM0C,CAAAA,CACN,MAAA,CAAAtC,CAAAA,CACA,OAAA,CAAA+G,CAAAA,CACA,YAAA,CAAcyX,CAAAA,CAAG,MAAA,CACjB,cAAA,CAAgB,IACpB,CAAC,CAAA,CACD,GAAI,CAACxN,CAAAA,CAAM,KAAA,CACP,GAAIA,CAAAA,CAAM,MAAA,EAAUA,EAAM,GAAA,EAAO1O,CAAAA,CACzBA,CAAAA,EAASA,CAAAA,CAAM,IAAA,GAAS,WAAA,CACxByE,EAAQiK,CAAAA,CAAM,GAAA,CAAK,YAAA,CAAc,kDAAkD,CAAA,CAEnFjK,CAAAA,CAAQ/G,CAAAA,CAAQ,cAAA,CAAgB,mCAAmC,CAAA,CAAA,KAEtE,CACD+d,CAAAA,CAAa/M,CAAAA,CAAM,GAAA,CACfA,EAAM,OAAA,GACNwE,CAAAA,CAAI,OAAA,CAAUxE,CAAAA,CAAM,OAAA,CAAA,CACxB,QACJ,CAEJ,IAAMvM,CAAAA,CAAOnC,CAAAA,CACPqb,CAAAA,CAAYrU,CAAAA,CAAKhH,CAAAA,CAAO0O,CAAAA,CAAOjK,CAAO,CAAA,CACtC6W,CAAAA,CAAiBtU,CAAAA,CAAK0H,CAAAA,CAAM,GAAA,CAAKpR,CAAAA,CAAO,IAAA,CAAMoR,CAAAA,CAAOjK,CAAO,CAAA,CAC9DuC,CAAAA,CAAI,MAAA,CAAO,MAAA,EACX6T,EAAAA,CAAgBqB,EAAG,MAAA,CAAQlc,CAAAA,CAAOyE,CAAO,CAAA,CAC7C/G,CAAAA,CAASyE,CAAAA,CAAK,MAAM,CAAC,CAAA,CACrB+Q,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAK/Q,CAAI,EACvB,CACA,OAAA+Q,CAAAA,CAAI,KAAA,CAAQ,CAACgJ,CAAAA,CAAG,MAAA,CAAQxe,CAAAA,CAAQ+d,CAAAA,EAAc/d,CAAM,CAAA,CAC7CwV,CACX,CC9CA,SAASiJ,GAAW5e,CAAAA,CAAKG,CAAAA,CAAQ0c,CAAAA,CAAU3V,CAAAA,CAAS,CAChD,IAAIiF,CAAAA,CAAU,EAAA,CACd,GAAInM,CAAAA,CAAK,CACL,IAAI2c,CAAAA,CAAW,KAAA,CACXyB,EAAM,EAAA,CACV,IAAA,IAAWnB,CAAAA,IAASjd,CAAAA,CAAK,CACrB,GAAM,CAAE,MAAA,CAAAyH,CAAAA,CAAQ,IAAA,CAAA5D,CAAK,CAAA,CAAIoZ,CAAAA,CACzB,OAAQpZ,GACJ,KAAK,OAAA,CACD8Y,CAAAA,CAAW,IAAA,CACX,MACJ,KAAK,SAAA,CAAW,CACRE,CAAAA,EAAY,CAACF,CAAAA,EACbzV,CAAAA,CAAQ+V,EAAO,cAAA,CAAgB,wEAAwE,CAAA,CAC3G,IAAMC,CAAAA,CAAKzV,CAAAA,CAAO,SAAA,CAAU,CAAC,CAAA,EAAK,GAAA,CAC7B0E,CAAAA,CAGDA,CAAAA,EAAWiS,CAAAA,CAAMlB,CAAAA,CAFjB/Q,EAAU+Q,CAAAA,CAGdkB,CAAAA,CAAM,EAAA,CACN,KACJ,CACA,KAAK,SAAA,CACGjS,CAAAA,GACAiS,CAAAA,EAAO3W,CAAAA,CAAAA,CACXkV,CAAAA,CAAW,IAAA,CACX,MACJ,QACIzV,EAAQ+V,CAAAA,CAAO,kBAAA,CAAoB,CAAA,WAAA,EAAcpZ,CAAI,CAAA,YAAA,CAAc,EAC3E,CACA1D,CAAAA,EAAUsH,CAAAA,CAAO,OACrB,CACJ,CACA,OAAO,CAAE,QAAA0E,CAAAA,CAAS,MAAA,CAAAhM,CAAO,CAC7B,CCzBA,IAAM0e,GAAW,2DAAA,CACX/Q,EAAAA,CAAWmP,CAAAA,EAAUA,CAAAA,GAAUA,CAAAA,CAAM,IAAA,GAAS,aAAeA,CAAAA,CAAM,IAAA,GAAS,WAAA,CAAA,CAClF,SAAS6B,EAAAA,CAAsB,CAAE,WAAA,CAAAhB,CAAAA,CAAa,gBAAA,CAAAC,CAAiB,CAAA,CAAGtU,CAAAA,CAAK8T,CAAAA,CAAIrW,CAAAA,CAASW,EAAK,CACrF,IAAM/C,CAAAA,CAAQyY,CAAAA,CAAG,KAAA,CAAM,MAAA,GAAW,GAAA,CAC5BwB,CAAAA,CAASja,CAAAA,CAAQ,UAAA,CAAa,eAAA,CAC9BmZ,CAAAA,CAAapW,CAAAA,EAAK,SAAA,GAAc/C,EAAQkQ,CAAAA,CAAUQ,CAAAA,CAAAA,CAClDwJ,CAAAA,CAAO,IAAIf,CAAAA,CAAUxU,CAAAA,CAAI,MAAM,CAAA,CACrCuV,CAAAA,CAAK,IAAA,CAAO,IAAA,CACZ,IAAMC,CAAAA,CAASxV,CAAAA,CAAI,OACfwV,CAAAA,GACAxV,CAAAA,CAAI,MAAA,CAAS,KAAA,CAAA,CACbA,CAAAA,CAAI,KAAA,GACJA,EAAI,KAAA,CAAQ,KAAA,CAAA,CAChB,IAAItJ,CAAAA,CAASod,CAAAA,CAAG,MAAA,CAASA,EAAG,KAAA,CAAM,MAAA,CAAO,MAAA,CACzC,IAAA,IAASnd,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAImd,CAAAA,CAAG,KAAA,CAAM,MAAA,CAAQ,EAAEnd,CAAAA,CAAG,CACtC,IAAM+d,EAAWZ,CAAAA,CAAG,KAAA,CAAMnd,CAAC,CAAA,CACrB,CAAE,KAAA,CAAAL,CAAAA,CAAO,GAAA,CAAA8F,CAAAA,CAAK,GAAA,CAAAuY,CAAAA,CAAK,KAAA,CAAA3b,CAAM,CAAA,CAAI0b,EAC7BhN,CAAAA,CAAQiL,EAAAA,CAAarc,CAAAA,CAAO,CAC9B,IAAA,CAAMgf,CAAAA,CACN,SAAA,CAAW,kBAAA,CACX,IAAA,CAAMlZ,CAAAA,EAAOuY,CAAAA,GAAM,CAAC,CAAA,CACpB,MAAA,CAAAje,EACA,OAAA,CAAA+G,CAAAA,CACA,YAAA,CAAcqW,CAAAA,CAAG,MAAA,CACjB,cAAA,CAAgB,KACpB,CAAC,CAAA,CACD,GAAI,CAACpM,CAAAA,CAAM,KAAA,CAAO,CACd,GAAI,CAACA,CAAAA,CAAM,MAAA,EAAU,CAACA,CAAAA,CAAM,GAAA,EAAO,CAACiN,CAAAA,EAAO,CAAC3b,CAAAA,CAAO,CAC3CrC,CAAAA,GAAM,CAAA,EAAK+Q,EAAM,KAAA,CACjBjK,CAAAA,CAAQiK,CAAAA,CAAM,KAAA,CAAO,kBAAA,CAAoB,CAAA,gBAAA,EAAmB4N,CAAM,CAAA,CAAE,CAAA,CAC/D3e,CAAAA,CAAImd,CAAAA,CAAG,KAAA,CAAM,MAAA,CAAS,CAAA,EAC3BrW,EAAQiK,CAAAA,CAAM,KAAA,CAAO,kBAAA,CAAoB,CAAA,yBAAA,EAA4B4N,CAAM,CAAA,CAAE,CAAA,CAC7E5N,CAAAA,CAAM,OAAA,GACF6N,CAAAA,CAAK,OAAA,CACLA,CAAAA,CAAK,OAAA,EAAW;AAAA,CAAA,CAAO7N,CAAAA,CAAM,QAE7B6N,CAAAA,CAAK,OAAA,CAAU7N,EAAM,OAAA,CAAA,CAE7BhR,CAAAA,CAASgR,CAAAA,CAAM,GAAA,CACf,QACJ,CACI,CAACrM,CAAAA,EAAS2E,CAAAA,CAAI,OAAA,CAAQ,MAAA,EAAU2T,EAAAA,CAAgBvX,CAAG,GACnDqB,CAAAA,CAAQrB,CAAAA,CACR,wBAAA,CAA0B,kEAAkE,EACpG,CACA,GAAIzF,CAAAA,GAAM,CAAA,CACF+Q,EAAM,KAAA,EACNjK,CAAAA,CAAQiK,EAAM,KAAA,CAAO,kBAAA,CAAoB,CAAA,gBAAA,EAAmB4N,CAAM,CAAA,CAAE,CAAA,CAAA,KAAA,GAGnE5N,EAAM,KAAA,EACPjK,CAAAA,CAAQiK,CAAAA,CAAM,KAAA,CAAO,cAAA,CAAgB,CAAA,kBAAA,EAAqB4N,CAAM,CAAA,MAAA,CAAQ,CAAA,CACxE5N,CAAAA,CAAM,OAAA,CAAS,CACf,IAAI+N,EAAkB,EAAA,CACtBC,CAAAA,CAAM,QAAW9B,CAAAA,IAAMtd,CAAAA,CACnB,OAAQsd,CAAAA,CAAG,IAAA,EACP,KAAK,OAAA,CACL,KAAK,QACD,MACJ,KAAK,SAAA,CACD6B,CAAAA,CAAkB7B,CAAAA,CAAG,MAAA,CAAO,UAAU,CAAC,CAAA,CACvC,MAAM8B,CAAAA,CACV,QACI,MAAMA,CACd,CAEJ,GAAID,EAAiB,CACjB,IAAI7R,EAAO2R,CAAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,KAAA,CAAM,MAAA,CAAS,CAAC,EACvCja,CAAAA,CAAOsI,CAAI,CAAA,GACXA,CAAAA,CAAOA,CAAAA,CAAK,KAAA,EAASA,EAAK,GAAA,CAAA,CAC1BA,CAAAA,CAAK,OAAA,CACLA,CAAAA,CAAK,OAAA,EAAW;AAAA,CAAA,CAAO6R,CAAAA,CAEvB7R,CAAAA,CAAK,OAAA,CAAU6R,CAAAA,CACnB/N,CAAAA,CAAM,OAAA,CAAUA,CAAAA,CAAM,OAAA,CAAQ,SAAA,CAAU+N,CAAAA,CAAgB,MAAA,CAAS,CAAC,EACtE,CACJ,CAEJ,GAAI,CAACpa,CAAAA,EAAS,CAACsZ,CAAAA,EAAO,CAACjN,CAAAA,CAAM,KAAA,CAAO,CAGhC,IAAMsN,CAAAA,CAAYhc,CAAAA,CACZqb,CAAAA,CAAYrU,EAAKhH,CAAAA,CAAO0O,CAAAA,CAAOjK,CAAO,CAAA,CACtC6W,CAAAA,CAAiBtU,CAAAA,CAAK0H,CAAAA,CAAM,GAAA,CAAKiN,CAAAA,CAAK,IAAA,CAAMjN,CAAAA,CAAOjK,CAAO,CAAA,CAChE8X,CAAAA,CAAK,MAAM,IAAA,CAAKP,CAAS,CAAA,CACzBte,CAAAA,CAASse,CAAAA,CAAU,KAAA,CAAM,CAAC,CAAA,CACtB3Q,EAAAA,CAAQrL,CAAK,CAAA,EACbyE,CAAAA,CAAQuX,CAAAA,CAAU,KAAA,CAAO,gBAAiBI,EAAQ,EAC1D,CAAA,KACK,CAGDpV,CAAAA,CAAI,KAAA,CAAQ,IAAA,CACZ,IAAM6U,CAAAA,CAAWnN,CAAAA,CAAM,GAAA,CACjBoN,CAAAA,CAAU1Y,CAAAA,CACViY,CAAAA,CAAYrU,EAAK5D,CAAAA,CAAKsL,CAAAA,CAAOjK,CAAO,CAAA,CACpC6W,CAAAA,CAAiBtU,CAAAA,CAAK6U,CAAAA,CAAUve,CAAAA,CAAO,IAAA,CAAMoR,CAAAA,CAAOjK,CAAO,CAAA,CAC7D4G,EAAAA,CAAQjI,CAAG,GACXqB,CAAAA,CAAQqX,CAAAA,CAAQ,KAAA,CAAO,eAAA,CAAiBM,EAAQ,CAAA,CACpDpV,CAAAA,CAAI,KAAA,CAAQ,KAAA,CAEZ,IAAM+U,CAAAA,CAAapC,EAAAA,CAAagC,CAAAA,EAAO,GAAI,CACvC,IAAA,CAAMW,CAAAA,CACN,SAAA,CAAW,eAAA,CACX,IAAA,CAAMtc,CAAAA,CACN,MAAA,CAAQ8b,CAAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,CACvB,OAAA,CAAArX,CAAAA,CACA,aAAcqW,CAAAA,CAAG,MAAA,CACjB,cAAA,CAAgB,KACpB,CAAC,CAAA,CACD,GAAIiB,CAAAA,CAAW,KAAA,CAAA,CACX,GAAI,CAAC1Z,CAAAA,EAAS,CAACqM,CAAAA,CAAM,OAAS1H,CAAAA,CAAI,OAAA,CAAQ,MAAA,CAAQ,CAC9C,GAAI2U,CAAAA,CACA,IAAA,IAAWf,CAAAA,IAAMe,CAAAA,CAAK,CAClB,GAAIf,CAAAA,GAAOmB,CAAAA,CAAW,KAAA,CAClB,MACJ,GAAInB,CAAAA,CAAG,IAAA,GAAS,SAAA,CAAW,CACvBnW,CAAAA,CAAQmW,CAAAA,CAAI,wBAAA,CAA0B,kEAAkE,CAAA,CACxG,KACJ,CACJ,CACAlM,CAAAA,CAAM,MAAQqN,CAAAA,CAAW,KAAA,CAAM,MAAA,CAAS,IAAA,EACxCtX,CAAAA,CAAQsX,CAAAA,CAAW,KAAA,CAAO,qBAAA,CAAuB,6FAA6F,EACtJ,CAAA,CAAA,KAEK/b,CAAAA,GACD,QAAA,GAAYA,CAAAA,EAASA,EAAM,MAAA,EAAUA,CAAAA,CAAM,MAAA,CAAO,CAAC,CAAA,GAAM,GAAA,CACzDyE,CAAAA,CAAQzE,CAAAA,CAAO,cAAA,CAAgB,CAAA,yBAAA,EAA4Bsc,CAAM,CAAA,CAAE,CAAA,CAEnE7X,CAAAA,CAAQsX,EAAW,KAAA,CAAO,cAAA,CAAgB,CAAA,uBAAA,EAA0BO,CAAM,CAAA,MAAA,CAAQ,CAAA,CAAA,CAG1F,IAAMN,CAAAA,CAAYhc,CAAAA,CACZqb,CAAAA,CAAYrU,CAAAA,CAAKhH,CAAAA,CAAO+b,CAAAA,CAAYtX,CAAO,EAC3CsX,CAAAA,CAAW,KAAA,CACPT,CAAAA,CAAiBtU,CAAAA,CAAK+U,CAAAA,CAAW,GAAA,CAAKJ,CAAAA,CAAK,IAAA,CAAMI,CAAAA,CAAYtX,CAAO,CAAA,CACpE,IAAA,CACNuX,CAAAA,CACI3Q,EAAAA,CAAQrL,CAAK,CAAA,EACbyE,CAAAA,CAAQuX,CAAAA,CAAU,KAAA,CAAO,eAAA,CAAiBI,EAAQ,CAAA,CAEjDL,CAAAA,CAAW,OAAA,GACZD,CAAAA,CAAQ,OAAA,CACRA,CAAAA,CAAQ,OAAA,EAAW;AAAA,CAAA,CAAOC,EAAW,OAAA,CAErCD,CAAAA,CAAQ,QAAUC,CAAAA,CAAW,OAAA,CAAA,CAErC,IAAM3K,CAAAA,CAAO,IAAIH,CAAAA,CAAK6K,CAAAA,CAASE,CAAS,CAAA,CAGxC,GAFIhV,EAAI,OAAA,CAAQ,gBAAA,GACZoK,EAAK,QAAA,CAAWsK,CAAAA,CAAAA,CAChBrZ,CAAAA,CAAO,CACP,IAAMsG,CAAAA,CAAM4T,CAAAA,CACRxB,GAAY/T,CAAAA,CAAK2B,CAAAA,CAAI,MAAOmT,CAAO,CAAA,EACnCrX,EAAQoX,CAAAA,CAAU,eAAA,CAAiB,yBAAyB,CAAA,CAChElT,CAAAA,CAAI,MAAM,IAAA,CAAKyI,CAAI,EACvB,CAAA,KACK,CACD,IAAMzI,CAAAA,CAAM,IAAI4J,CAAAA,CAAQvL,CAAAA,CAAI,MAAM,CAAA,CAClC2B,CAAAA,CAAI,KAAO,IAAA,CACXA,CAAAA,CAAI,MAAM,IAAA,CAAKyI,CAAI,EACnB,IAAMuL,EAAAA,CAAAA,CAAYX,GAAaF,CAAAA,EAAS,KAAA,CACxCnT,EAAI,KAAA,CAAQ,CAACmT,CAAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,CAAGa,EAAAA,CAAS,CAAC,CAAA,CAAGA,EAAAA,CAAS,CAAC,CAAC,CAAA,CACvDJ,EAAK,KAAA,CAAM,IAAA,CAAK5T,CAAG,EACvB,CACAjL,EAASse,CAAAA,CAAYA,CAAAA,CAAU,MAAM,CAAC,CAAA,CAAID,CAAAA,CAAW,IACzD,CACJ,CACA,IAAMa,EAAcva,CAAAA,CAAQ,GAAA,CAAM,IAC5B,CAACwa,CAAAA,CAAI,GAAGC,CAAE,CAAA,CAAIhC,EAAG,GAAA,CACnBiC,CAAAA,CAAQrf,EACZ,GAAImf,CAAAA,EAAMA,EAAG,MAAA,GAAWD,CAAAA,CACpBG,CAAAA,CAAQF,CAAAA,CAAG,OAASA,CAAAA,CAAG,MAAA,CAAO,YAC7B,CACD,IAAMlY,EAAO2X,CAAAA,CAAO,CAAC,EAAE,WAAA,EAAY,CAAIA,EAAO,SAAA,CAAU,CAAC,EACnD3W,CAAAA,CAAM6W,CAAAA,CACN,GAAG7X,CAAI,CAAA,iBAAA,EAAoBiY,CAAW,CAAA,CAAA,CACtC,GAAGjY,CAAI,CAAA,kEAAA,EAAqEiY,CAAW,CAAA,CAAA,CAC7FnY,CAAAA,CAAQ/G,EAAQ8e,CAAAA,CAAS,cAAA,CAAiB,aAAc7W,CAAG,CAAA,CACvDkX,GAAMA,CAAAA,CAAG,MAAA,CAAO,SAAW,CAAA,EAC3BC,CAAAA,CAAG,QAAQD,CAAE,EACrB,CACA,GAAIC,EAAG,MAAA,CAAS,CAAA,CAAG,CACf,IAAMvf,CAAAA,CAAM4e,GAAWW,CAAAA,CAAIC,CAAAA,CAAO/V,EAAI,OAAA,CAAQ,MAAA,CAAQvC,CAAO,CAAA,CACzDlH,CAAAA,CAAI,UACAgf,CAAAA,CAAK,OAAA,CACLA,EAAK,OAAA,EAAW;AAAA,CAAA,CAAOhf,CAAAA,CAAI,QAE3Bgf,CAAAA,CAAK,OAAA,CAAUhf,EAAI,OAAA,CAAA,CAE3Bgf,CAAAA,CAAK,KAAA,CAAQ,CAACzB,CAAAA,CAAG,MAAA,CAAQiC,EAAOxf,CAAAA,CAAI,MAAM,EAC9C,CAAA,KAEIgf,CAAAA,CAAK,MAAQ,CAACzB,CAAAA,CAAG,MAAA,CAAQiC,CAAAA,CAAOA,CAAK,CAAA,CAEzC,OAAOR,CACX,CCpMA,SAASS,EAAAA,CAAkBC,CAAAA,CAAIjW,EAAKwT,CAAAA,CAAO/V,CAAAA,CAAS6D,CAAAA,CAASlD,CAAAA,CAAK,CAC9D,IAAMmX,EAAO/B,CAAAA,CAAM,IAAA,GAAS,YACtBY,EAAAA,CAAgB6B,CAAAA,CAAIjW,EAAKwT,CAAAA,CAAO/V,CAAAA,CAASW,CAAG,CAAA,CAC5CoV,CAAAA,CAAM,IAAA,GAAS,YACXyB,EAAAA,CAAgBgB,CAAAA,CAAIjW,EAAKwT,CAAAA,CAAO/V,CAAAA,CAASW,CAAG,CAAA,CAC5CiX,EAAAA,CAAsBY,CAAAA,CAAIjW,CAAAA,CAAKwT,CAAAA,CAAO/V,CAAAA,CAASW,CAAG,CAAA,CACtD8X,CAAAA,CAAOX,EAAK,WAAA,CAGlB,OAAIjU,IAAY,GAAA,EAAOA,CAAAA,GAAY4U,CAAAA,CAAK,OAAA,EACpCX,CAAAA,CAAK,GAAA,CAAMW,EAAK,OAAA,CACTX,CAAAA,GAEPjU,IACAiU,CAAAA,CAAK,GAAA,CAAMjU,GACRiU,CAAAA,CACX,CACA,SAASY,EAAAA,CAAkBF,CAAAA,CAAIjW,CAAAA,CAAKwT,EAAO9L,CAAAA,CAAOjK,CAAAA,CAAS,CACvD,IAAM2Y,CAAAA,CAAW1O,EAAM,GAAA,CACjBpG,CAAAA,CAAW8U,CAAAA,CAEXpW,CAAAA,CAAI,UAAA,CAAW,OAAA,CAAQoW,EAAS,MAAA,CAAQzX,CAAAA,EAAOlB,EAAQ2Y,CAAAA,CAAU,oBAAA,CAAsBzX,CAAG,CAAC,CAAA,CAD3F,IAAA,CAEN,GAAI6U,CAAAA,CAAM,IAAA,GAAS,YAAa,CAC5B,GAAM,CAAE,MAAA,CAAA9U,CAAAA,CAAQ,iBAAkB2X,CAAG,CAAA,CAAI3O,CAAAA,CACnC4O,CAAAA,CAAW5X,CAAAA,EAAU0X,CAAAA,CACrB1X,EAAO,MAAA,CAAS0X,CAAAA,CAAS,OACrB1X,CAAAA,CACA0X,CAAAA,CACH1X,GAAU0X,CAAAA,CACbE,CAAAA,GAAa,CAACD,CAAAA,EAAMA,CAAAA,CAAG,MAAA,CAASC,EAAS,MAAA,CAAA,EAEzC7Y,CAAAA,CAAQ6Y,EAAU,cAAA,CADF,4CACyB,EAEjD,CACA,IAAMC,CAAAA,CAAU/C,CAAAA,CAAM,IAAA,GAAS,WAAA,CACzB,MACAA,CAAAA,CAAM,IAAA,GAAS,YACX,KAAA,CACAA,CAAAA,CAAM,MAAM,MAAA,GAAW,GAAA,CACnB,KAAA,CACA,KAAA,CAGd,GAAI,CAAC4C,GACD,CAAC9U,CAAAA,EACDA,IAAY,GAAA,EACXA,CAAAA,GAAYiK,EAAQ,OAAA,EAAWgL,CAAAA,GAAY,KAAA,EAC3CjV,CAAAA,GAAYyK,CAAAA,CAAQ,OAAA,EAAWwK,IAAY,KAAA,CAC5C,OAAOP,GAAkBC,CAAAA,CAAIjW,CAAAA,CAAKwT,EAAO/V,CAAAA,CAAS6D,CAAO,CAAA,CAE7D,IAAIlD,CAAAA,CAAM4B,CAAAA,CAAI,OAAO,IAAA,CAAK,IAAA,CAAKwB,GAAKA,CAAAA,CAAE,GAAA,GAAQF,GAAWE,CAAAA,CAAE,UAAA,GAAe+U,CAAO,CAAA,CACjF,GAAI,CAACnY,EAAK,CACN,IAAMoY,EAAKxW,CAAAA,CAAI,MAAA,CAAO,UAAUsB,CAAO,CAAA,CACvC,GAAIkV,CAAAA,EAAMA,CAAAA,CAAG,UAAA,GAAeD,EACxBvW,CAAAA,CAAI,MAAA,CAAO,KAAK,IAAA,CAAK,MAAA,CAAO,OAAO,EAAC,CAAGwW,CAAAA,CAAI,CAAE,OAAA,CAAS,KAAM,CAAC,CAAC,CAAA,CAC9DpY,EAAMoY,CAAAA,CAAAA,KAGN,OAAIA,EACA/Y,CAAAA,CAAQ2Y,CAAAA,CAAU,qBAAA,CAAuB,CAAA,EAAGI,CAAAA,CAAG,GAAG,aAAaD,CAAO,CAAA,yBAAA,EAA4BC,EAAG,UAAA,EAAc,QAAQ,GAAI,IAAI,CAAA,CAGnI/Y,CAAAA,CAAQ2Y,CAAAA,CAAU,oBAAA,CAAsB,CAAA,gBAAA,EAAmB9U,CAAO,CAAA,CAAA,CAAI,IAAI,EAEvE0U,EAAAA,CAAkBC,CAAAA,CAAIjW,EAAKwT,CAAAA,CAAO/V,CAAAA,CAAS6D,CAAO,CAEjE,CACA,IAAMiU,EAAOS,EAAAA,CAAkBC,CAAAA,CAAIjW,EAAKwT,CAAAA,CAAO/V,CAAAA,CAAS6D,EAASlD,CAAG,CAAA,CAC9Db,CAAAA,CAAMa,CAAAA,CAAI,OAAA,GAAUmX,CAAAA,CAAM5W,GAAOlB,CAAAA,CAAQ2Y,CAAAA,CAAU,qBAAsBzX,CAAG,CAAA,CAAGqB,EAAI,OAAO,CAAA,EAAKuV,CAAAA,CAC/Fpa,CAAAA,CAAOO,CAAAA,CAAO6B,CAAG,EACjBA,CAAAA,CACA,IAAI4D,EAAO5D,CAAG,CAAA,CACpB,OAAApC,CAAAA,CAAK,KAAA,CAAQoa,CAAAA,CAAK,KAAA,CAClBpa,CAAAA,CAAK,GAAA,CAAMmG,EACPlD,CAAAA,EAAK,MAAA,GACLjD,EAAK,MAAA,CAASiD,CAAAA,CAAI,QACfjD,CACX,CCnFA,SAASsb,EAAAA,CAAmBzW,CAAAA,CAAK0W,CAAAA,CAAQjZ,EAAS,CAC9C,IAAMnH,EAAQogB,CAAAA,CAAO,MAAA,CACfvQ,EAASwQ,EAAAA,CAAuBD,CAAAA,CAAQ1W,CAAAA,CAAI,OAAA,CAAQ,MAAA,CAAQvC,CAAO,EACzE,GAAI,CAAC0I,EACD,OAAO,CAAE,MAAO,EAAA,CAAI,IAAA,CAAM,IAAA,CAAM,OAAA,CAAS,EAAA,CAAI,KAAA,CAAO,CAAC7P,CAAAA,CAAOA,CAAAA,CAAOA,CAAK,CAAE,CAAA,CAC9E,IAAM8D,CAAAA,CAAO+L,CAAAA,CAAO,IAAA,GAAS,GAAA,CAAMhF,CAAAA,CAAO,YAAA,CAAeA,EAAO,aAAA,CAC1D1K,CAAAA,CAAQigB,EAAO,MAAA,CAASE,EAAAA,CAAWF,EAAO,MAAM,CAAA,CAAI,EAAC,CAEvDG,CAAAA,CAAapgB,CAAAA,CAAM,OACvB,IAAA,IAASE,CAAAA,CAAIF,EAAM,MAAA,CAAS,CAAA,CAAGE,GAAK,CAAA,CAAG,EAAEA,CAAAA,CAAG,CACxC,IAAMmgB,CAAAA,CAAUrgB,EAAME,CAAC,CAAA,CAAE,CAAC,CAAA,CAC1B,GAAImgB,IAAY,EAAA,EAAMA,CAAAA,GAAY,IAAA,CAC9BD,CAAAA,CAAalgB,CAAAA,CAAAA,KAEb,KACR,CAEA,GAAIkgB,CAAAA,GAAe,CAAA,CAAG,CAClB,IAAM7d,CAAAA,CAAQmN,EAAO,KAAA,GAAU,GAAA,EAAO1P,CAAAA,CAAM,MAAA,CAAS,CAAA,CAC/C;AAAA,CAAA,CAAK,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAGA,CAAAA,CAAM,OAAS,CAAC,CAAC,CAAA,CACzC,EAAA,CACFF,EAAMD,CAAAA,CAAQ6P,CAAAA,CAAO,MAAA,CACzB,OAAIuQ,EAAO,MAAA,GACPngB,CAAAA,EAAOmgB,CAAAA,CAAO,MAAA,CAAO,QAClB,CAAE,KAAA,CAAA1d,CAAAA,CAAO,IAAA,CAAAoB,EAAM,OAAA,CAAS+L,CAAAA,CAAO,OAAA,CAAS,KAAA,CAAO,CAAC7P,CAAAA,CAAOC,CAAAA,CAAKA,CAAG,CAAE,CAC5E,CAEA,IAAIwgB,CAAAA,CAAaL,CAAAA,CAAO,OAASvQ,CAAAA,CAAO,MAAA,CACpCzP,CAAAA,CAASggB,CAAAA,CAAO,OAASvQ,CAAAA,CAAO,MAAA,CAChC6Q,CAAAA,CAAe,CAAA,CACnB,QAASrgB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIkgB,CAAAA,CAAY,EAAElgB,CAAAA,CAAG,CACjC,GAAM,CAACgM,EAAQmU,CAAO,CAAA,CAAIrgB,CAAAA,CAAME,CAAC,EACjC,GAAImgB,CAAAA,GAAY,EAAA,EAAMA,CAAAA,GAAY,KAC1B3Q,CAAAA,CAAO,MAAA,GAAW,GAAKxD,CAAAA,CAAO,MAAA,CAASoU,IACvCA,CAAAA,CAAapU,CAAAA,CAAO,MAAA,CAAA,CAAA,KAEvB,CACGA,EAAO,MAAA,CAASoU,CAAAA,EAEhBtZ,CAAAA,CAAQ/G,CAAAA,CAASiM,EAAO,MAAA,CAAQ,cAAA,CADhB,iGACuC,CAAA,CAEvDwD,EAAO,MAAA,GAAW,CAAA,GAClB4Q,CAAAA,CAAapU,CAAAA,CAAO,QACxBqU,CAAAA,CAAergB,CAAAA,CACXogB,CAAAA,GAAe,CAAA,EAAK,CAAC/W,CAAAA,CAAI,MAAA,EAEzBvC,CAAAA,CAAQ/G,CAAAA,CAAQ,aADA,qDACqB,CAAA,CAEzC,KACJ,CACAA,GAAUiM,CAAAA,CAAO,MAAA,CAASmU,EAAQ,MAAA,CAAS,EAC/C,CAEA,IAAA,IAASngB,CAAAA,CAAIF,CAAAA,CAAM,MAAA,CAAS,EAAGE,CAAAA,EAAKkgB,CAAAA,CAAY,EAAElgB,CAAAA,CAC1CF,EAAME,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,OAASogB,CAAAA,GACrBF,CAAAA,CAAalgB,CAAAA,CAAI,CAAA,CAAA,CAEzB,IAAIqC,CAAAA,CAAQ,EAAA,CACR2b,CAAAA,CAAM,EAAA,CACNsC,EAAmB,KAAA,CAEvB,IAAA,IAAStgB,CAAAA,CAAI,CAAA,CAAGA,EAAIqgB,CAAAA,CAAc,EAAErgB,CAAAA,CAChCqC,CAAAA,EAASvC,EAAME,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAMogB,CAAU,CAAA,CAAI;AAAA,CAAA,CAC7C,IAAA,IAASpgB,CAAAA,CAAIqgB,CAAAA,CAAcrgB,CAAAA,CAAIkgB,EAAY,EAAElgB,CAAAA,CAAG,CAC5C,GAAI,CAACgM,CAAAA,CAAQmU,CAAO,CAAA,CAAIrgB,CAAAA,CAAME,CAAC,CAAA,CAC/BD,CAAAA,EAAUiM,CAAAA,CAAO,MAAA,CAASmU,EAAQ,MAAA,CAAS,CAAA,CAC3C,IAAMI,CAAAA,CAAOJ,EAAQA,CAAAA,CAAQ,MAAA,CAAS,CAAC,CAAA,GAAM,KAI7C,GAHII,CAAAA,GACAJ,CAAAA,CAAUA,CAAAA,CAAQ,MAAM,CAAA,CAAG,EAAE,CAAA,CAAA,CAE7BA,CAAAA,EAAWnU,CAAAA,CAAO,MAAA,CAASoU,CAAAA,CAAY,CAIvC,IAAM/gB,CAAAA,CAAU,CAAA,wDAAA,EAHJmQ,CAAAA,CAAO,MAAA,CACb,iCACA,YACwE,CAAA,CAAA,CAC9E1I,CAAAA,CAAQ/G,CAAAA,CAASogB,EAAQ,MAAA,EAAUI,CAAAA,CAAO,CAAA,CAAI,CAAA,CAAA,CAAI,aAAclhB,CAAO,CAAA,CACvE2M,CAAAA,CAAS,GACb,CACIvI,CAAAA,GAAS+G,CAAAA,CAAO,aAAA,EAChBnI,CAAAA,EAAS2b,EAAMhS,CAAAA,CAAO,KAAA,CAAMoU,CAAU,CAAA,CAAID,EAC1CnC,CAAAA,CAAM;AAAA,CAAA,EAEDhS,CAAAA,CAAO,OAASoU,CAAAA,EAAcD,CAAAA,CAAQ,CAAC,CAAA,GAAM,GAAA,EAE9CnC,CAAAA,GAAQ,GAAA,CACRA,CAAAA,CAAM;AAAA,CAAA,CACD,CAACsC,GAAoBtC,CAAAA,GAAQ;AAAA,CAAA,GAClCA,CAAAA,CAAM;;AAAA,CAAA,CAAA,CACV3b,GAAS2b,CAAAA,CAAMhS,CAAAA,CAAO,MAAMoU,CAAU,CAAA,CAAID,EAC1CnC,CAAAA,CAAM;AAAA,CAAA,CACNsC,CAAAA,CAAmB,IAAA,EAEdH,CAAAA,GAAY,EAAA,CAEbnC,CAAAA,GAAQ;AAAA,CAAA,CACR3b,CAAAA,EAAS;AAAA,CAAA,CAET2b,CAAAA,CAAM;AAAA,CAAA,EAGV3b,CAAAA,EAAS2b,CAAAA,CAAMmC,CAAAA,CACfnC,CAAAA,CAAM,GAAA,CACNsC,EAAmB,KAAA,EAE3B,CACA,OAAQ9Q,CAAAA,CAAO,KAAA,EACX,KAAK,GAAA,CACD,MACJ,KAAK,GAAA,CACD,IAAA,IAASxP,CAAAA,CAAIkgB,CAAAA,CAAYlgB,CAAAA,CAAIF,CAAAA,CAAM,MAAA,CAAQ,EAAEE,CAAAA,CACzCqC,CAAAA,EAAS;AAAA,CAAA,CAAOvC,CAAAA,CAAME,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAMogB,CAAU,CAAA,CAC5C/d,CAAAA,CAAMA,CAAAA,CAAM,MAAA,CAAS,CAAC,CAAA,GAAM;AAAA,CAAA,GAC5BA,CAAAA,EAAS;AAAA,CAAA,CAAA,CACb,MACJ,QACIA,CAAAA,EAAS;AAAA,EACjB,CACA,IAAMzC,CAAAA,CAAMD,CAAAA,CAAQ6P,CAAAA,CAAO,MAAA,CAASuQ,CAAAA,CAAO,MAAA,CAAO,MAAA,CAClD,OAAO,CAAE,KAAA,CAAA1d,CAAAA,CAAO,IAAA,CAAAoB,CAAAA,CAAM,OAAA,CAAS+L,CAAAA,CAAO,OAAA,CAAS,KAAA,CAAO,CAAC7P,CAAAA,CAAOC,CAAAA,CAAKA,CAAG,CAAE,CAC5E,CACA,SAASogB,EAAAA,CAAuB,CAAE,MAAA,CAAAjgB,CAAAA,CAAQ,KAAA,CAAAgR,CAAM,CAAA,CAAGyP,CAAAA,CAAQ1Z,CAAAA,CAAS,CAEhE,GAAIiK,CAAAA,CAAM,CAAC,CAAA,CAAE,IAAA,GAAS,qBAAA,CAClB,OAAAjK,CAAAA,CAAQiK,EAAM,CAAC,CAAA,CAAG,YAAA,CAAc,+BAA+B,CAAA,CACxD,IAAA,CAEX,GAAM,CAAE,MAAA,CAAA1J,CAAO,CAAA,CAAI0J,CAAAA,CAAM,CAAC,CAAA,CACpBxE,CAAAA,CAAOlF,CAAAA,CAAO,CAAC,CAAA,CACjB2E,CAAAA,CAAS,CAAA,CACTkD,CAAAA,CAAQ,EAAA,CACR1H,CAAAA,CAAQ,EAAA,CACZ,IAAA,IAASxH,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIqH,CAAAA,CAAO,MAAA,CAAQ,EAAErH,CAAAA,CAAG,CACpC,IAAMsG,CAAAA,CAAKe,CAAAA,CAAOrH,CAAC,CAAA,CACnB,GAAI,CAACkP,CAAAA,GAAU5I,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,CAAA,CAChC4I,CAAAA,CAAQ5I,CAAAA,CAAAA,KACP,CACD,IAAMvD,EAAI,MAAA,CAAOuD,CAAE,CAAA,CACf,CAAC0F,CAAAA,EAAUjJ,CAAAA,CACXiJ,CAAAA,CAASjJ,CAAAA,CACJyE,CAAAA,GAAU,EAAA,GACfA,CAAAA,CAAQzH,CAAAA,CAASC,CAAAA,EACzB,CACJ,CACIwH,CAAAA,GAAU,IACVV,CAAAA,CAAQU,CAAAA,CAAO,kBAAA,CAAoB,CAAA,+CAAA,EAAkDH,CAAM,CAAA,CAAE,CAAA,CACjG,IAAIkV,CAAAA,CAAW,KAAA,CACXxQ,CAAAA,CAAU,EAAA,CACVvJ,CAAAA,CAAS6E,CAAAA,CAAO,MAAA,CACpB,IAAA,IAASrH,EAAI,CAAA,CAAGA,CAAAA,CAAI+Q,CAAAA,CAAM,MAAA,CAAQ,EAAE/Q,CAAAA,CAAG,CACnC,IAAM6c,CAAAA,CAAQ9L,CAAAA,CAAM/Q,CAAC,CAAA,CACrB,OAAQ6c,CAAAA,CAAM,IAAA,EACV,KAAK,OAAA,CACDN,CAAAA,CAAW,IAAA,CAEf,KAAK,SAAA,CACD/Z,CAAAA,EAAUqa,CAAAA,CAAM,MAAA,CAAO,MAAA,CACvB,MACJ,KAAK,SAAA,CACG2D,CAAAA,EAAU,CAACjE,CAAAA,EAEXzV,EAAQ+V,CAAAA,CAAO,cAAA,CADC,wEACsB,CAAA,CAE1Cra,CAAAA,EAAUqa,CAAAA,CAAM,MAAA,CAAO,MAAA,CACvB9Q,CAAAA,CAAU8Q,CAAAA,CAAM,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CAClC,MACJ,KAAK,QACD/V,CAAAA,CAAQ+V,CAAAA,CAAO,kBAAA,CAAoBA,CAAAA,CAAM,OAAO,CAAA,CAChDra,CAAAA,EAAUqa,CAAAA,CAAM,MAAA,CAAO,MAAA,CACvB,MAEJ,QAAS,CACL,IAAMxd,CAAAA,CAAU,CAAA,yCAAA,EAA4Cwd,EAAM,IAAI,CAAA,CAAA,CACtE/V,CAAAA,CAAQ+V,CAAAA,CAAO,kBAAA,CAAoBxd,CAAO,CAAA,CAC1C,IAAMohB,CAAAA,CAAK5D,CAAAA,CAAM,MAAA,CACb4D,CAAAA,EAAM,OAAOA,CAAAA,EAAO,QAAA,GACpBje,CAAAA,EAAUie,CAAAA,CAAG,MAAA,EACrB,CACJ,CACJ,CACA,OAAO,CAAE,IAAA,CAAAlU,CAAAA,CAAM,MAAA,CAAAP,CAAAA,CAAQ,KAAA,CAAAkD,CAAAA,CAAO,OAAA,CAAAnD,CAAAA,CAAS,MAAA,CAAAvJ,CAAO,CAClD,CAEA,SAASyd,EAAAA,CAAW5Y,CAAAA,CAAQ,CACxB,IAAM2F,CAAAA,CAAQ3F,CAAAA,CAAO,KAAA,CAAM,QAAQ,CAAA,CAC7BqZ,CAAAA,CAAQ1T,CAAAA,CAAM,CAAC,CAAA,CACf2T,EAAID,CAAAA,CAAM,KAAA,CAAM,OAAO,CAAA,CAIvB5gB,CAAAA,CAAQ,CAHA6gB,CAAAA,GAAI,CAAC,CAAA,CACb,CAACA,CAAAA,CAAE,CAAC,CAAA,CAAGD,CAAAA,CAAM,KAAA,CAAMC,CAAAA,CAAE,CAAC,CAAA,CAAE,MAAM,CAAC,CAAA,CAC/B,CAAC,EAAA,CAAID,CAAK,CACI,CAAA,CACpB,IAAA,IAAS1gB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIgN,CAAAA,CAAM,MAAA,CAAQhN,CAAAA,EAAK,CAAA,CACnCF,CAAAA,CAAM,IAAA,CAAK,CAACkN,CAAAA,CAAMhN,CAAC,CAAA,CAAGgN,CAAAA,CAAMhN,CAAAA,CAAI,CAAC,CAAC,CAAC,CAAA,CACvC,OAAOF,CACX,CChMA,SAAS8gB,EAAAA,CAAkBb,CAAAA,CAAQS,CAAAA,CAAQ1Z,CAAAA,CAAS,CAChD,GAAM,CAAE,MAAA,CAAA/G,CAAAA,CAAQ,IAAA,CAAA0D,CAAAA,CAAM,MAAA,CAAA4D,CAAAA,CAAQ,GAAA,CAAAzH,CAAI,CAAA,CAAImgB,EAClCzP,CAAAA,CACAjO,CAAAA,CACEsU,CAAAA,CAAW,CAACkK,CAAAA,CAAKzS,CAAAA,CAAMpG,CAAAA,GAAQlB,CAAAA,CAAQ/G,CAAAA,CAAS8gB,CAAAA,CAAKzS,CAAAA,CAAMpG,CAAG,CAAA,CACpE,OAAQvE,CAAAA,EACJ,KAAK,QAAA,CACD6M,CAAAA,CAAQ9F,CAAAA,CAAO,KAAA,CACfnI,CAAAA,CAAQye,EAAAA,CAAWzZ,CAAAA,CAAQsP,CAAQ,CAAA,CACnC,MACJ,KAAK,sBAAA,CACDrG,CAAAA,CAAQ9F,CAAAA,CAAO,YAAA,CACfnI,CAAAA,CAAQ0e,EAAAA,CAAkB1Z,CAAAA,CAAQsP,CAAQ,CAAA,CAC1C,MACJ,KAAK,sBAAA,CACDrG,CAAAA,CAAQ9F,CAAAA,CAAO,YAAA,CACfnI,CAAAA,CAAQ2e,EAAAA,CAAkB3Z,CAAAA,CAAQsP,CAAQ,CAAA,CAC1C,MAEJ,QACI,OAAA7P,CAAAA,CAAQiZ,CAAAA,CAAQ,kBAAA,CAAoB,CAAA,yCAAA,EAA4Ctc,CAAI,CAAA,CAAE,CAAA,CAC/E,CACH,KAAA,CAAO,EAAA,CACP,IAAA,CAAM,IAAA,CACN,OAAA,CAAS,EAAA,CACT,KAAA,CAAO,CAAC1D,CAAAA,CAAQA,CAAAA,CAASsH,CAAAA,CAAO,MAAA,CAAQtH,CAAAA,CAASsH,CAAAA,CAAO,MAAM,CAClE,CACR,CACA,IAAM4Z,CAAAA,CAAWlhB,CAAAA,CAASsH,CAAAA,CAAO,MAAA,CAC3B6Z,CAAAA,CAAK1C,GAAW5e,CAAAA,CAAKqhB,CAAAA,CAAUT,CAAAA,CAAQ1Z,CAAO,CAAA,CACpD,OAAO,CACH,KAAA,CAAAzE,CAAAA,CACA,IAAA,CAAMiO,CAAAA,CACN,OAAA,CAAS4Q,CAAAA,CAAG,OAAA,CACZ,KAAA,CAAO,CAACnhB,CAAAA,CAAQkhB,CAAAA,CAAUC,CAAAA,CAAG,MAAM,CACvC,CACJ,CACA,SAASJ,EAAAA,CAAWzZ,CAAAA,CAAQP,CAAAA,CAAS,CACjC,IAAIqa,CAAAA,CAAU,EAAA,CACd,OAAQ9Z,EAAO,CAAC,CAAA,EAEZ,KAAK,GAAA,CACD8Z,CAAAA,CAAU,iBAAA,CACV,MACJ,KAAK,GAAA,CACDA,CAAAA,CAAU,4BAAA,CACV,MACJ,KAAK,GAAA,CACDA,CAAAA,CAAU,kCACV,MACJ,KAAK,GAAA,CACL,KAAK,GAAA,CAAK,CACNA,CAAAA,CAAU,CAAA,uBAAA,EAA0B9Z,CAAAA,CAAO,CAAC,CAAC,CAAA,CAAA,CAC7C,KACJ,CACA,KAAK,GAAA,CACL,KAAK,GAAA,CAAK,CACN8Z,CAAAA,CAAU,CAAA,mBAAA,EAAsB9Z,CAAAA,CAAO,CAAC,CAAC,CAAA,CAAA,CACzC,KACJ,CACJ,CACA,OAAI8Z,CAAAA,EACAra,CAAAA,CAAQ,CAAA,CAAG,kBAAA,CAAoB,iCAAiCqa,CAAO,CAAA,CAAE,CAAA,CACtEC,EAAAA,CAAU/Z,CAAM,CAC3B,CACA,SAAS0Z,EAAAA,CAAkB1Z,CAAAA,CAAQP,CAAAA,CAAS,CACxC,OAAA,CAAIO,CAAAA,CAAOA,CAAAA,CAAO,MAAA,CAAS,CAAC,CAAA,GAAM,GAAA,EAAOA,CAAAA,CAAO,MAAA,GAAW,CAAA,GACvDP,CAAAA,CAAQO,CAAAA,CAAO,MAAA,CAAQ,cAAA,CAAgB,wBAAwB,CAAA,CAC5D+Z,EAAAA,CAAU/Z,CAAAA,CAAO,KAAA,CAAM,CAAA,CAAG,EAAE,CAAC,CAAA,CAAE,OAAA,CAAQ,KAAA,CAAO,GAAG,CAC5D,CACA,SAAS+Z,EAAAA,CAAU/Z,CAAAA,CAAQ,CAQvB,IAAIqZ,CAAAA,CAAO7Z,CAAAA,CACX,GAAI,CACA6Z,CAAAA,CAAQ,IAAI,MAAA,CAAO,CAAA;AAAA,CAAA,CAA8B,IAAI,CAAA,CACrD7Z,CAAAA,CAAO,IAAI,MAAA,CAAO,CAAA;AAAA,CAAA,CAAyC,IAAI,EACnE,CAAA,KACM,CACF6Z,CAAAA,CAAQ,oBAAA,CACR7Z,EAAO,2BACX,CACA,IAAI+D,CAAAA,CAAQ8V,CAAAA,CAAM,KAAKrZ,CAAM,CAAA,CAC7B,GAAI,CAACuD,CAAAA,CACD,OAAOvD,CAAAA,CACX,IAAIT,EAAMgE,CAAAA,CAAM,CAAC,EACboT,CAAAA,CAAM,GAAA,CACN1b,EAAMoe,CAAAA,CAAM,SAAA,CAEhB,IADA7Z,CAAAA,CAAK,SAAA,CAAYvE,EACTsI,CAAAA,CAAQ/D,CAAAA,CAAK,KAAKQ,CAAM,CAAA,EACxBuD,EAAM,CAAC,CAAA,GAAM,GACToT,CAAAA,GAAQ;AAAA,CAAA,CACRpX,CAAAA,EAAOoX,EAEPA,CAAAA,CAAM;AAAA,CAAA,EAGVpX,CAAAA,EAAOoX,CAAAA,CAAMpT,CAAAA,CAAM,CAAC,CAAA,CACpBoT,CAAAA,CAAM,GAAA,CAAA,CAEV1b,CAAAA,CAAMuE,CAAAA,CAAK,SAAA,CAEf,IAAMkW,CAAAA,CAAO,cAAA,CACb,OAAAA,CAAAA,CAAK,SAAA,CAAYza,CAAAA,CACjBsI,CAAAA,CAAQmS,CAAAA,CAAK,IAAA,CAAK1V,CAAM,CAAA,CACjBT,CAAAA,CAAMoX,CAAAA,EAAOpT,CAAAA,GAAQ,CAAC,CAAA,EAAK,EAAA,CACtC,CACA,SAASoW,EAAAA,CAAkB3Z,CAAAA,CAAQP,CAAAA,CAAS,CACxC,IAAIF,CAAAA,CAAM,EAAA,CACV,IAAA,IAAS,CAAA,CAAI,CAAA,CAAG,CAAA,CAAIS,CAAAA,CAAO,MAAA,CAAS,CAAA,CAAG,EAAE,CAAA,CAAG,CACxC,IAAMf,CAAAA,CAAKe,CAAAA,CAAO,CAAC,CAAA,CACnB,GAAI,EAAAf,CAAAA,GAAO,IAAA,EAAQe,CAAAA,CAAO,CAAA,CAAI,CAAC,CAAA,GAAM;AAAA,CAAA,CAAA,CAErC,GAAIf,CAAAA,GAAO;AAAA,CAAA,CAAM,CACb,GAAM,CAAE,IAAA,CAAAkH,EAAM,MAAA,CAAAzN,CAAO,CAAA,CAAIshB,EAAAA,CAAYha,EAAQ,CAAC,CAAA,CAC9CT,CAAAA,EAAO4G,CAAAA,CACP,EAAIzN,EACR,CAAA,KAAA,GACSuG,CAAAA,GAAO,IAAA,CAAM,CAClB,IAAIgH,CAAAA,CAAOjG,CAAAA,CAAO,EAAE,CAAC,CAAA,CACfia,CAAAA,CAAKC,EAAAA,CAAYjU,CAAI,CAAA,CAC3B,GAAIgU,CAAAA,CACA1a,CAAAA,EAAO0a,UACFhU,CAAAA,GAAS;AAAA,CAAA,CAGd,IADAA,EAAOjG,CAAAA,CAAO,CAAA,CAAI,CAAC,CAAA,CACZiG,CAAAA,GAAS,KAAOA,CAAAA,GAAS,GAAA,EAC5BA,EAAOjG,CAAAA,CAAO,EAAE,EAAI,CAAC,CAAA,CAAA,KAAA,GAEpBiG,IAAS,IAAA,EAAQjG,CAAAA,CAAO,CAAA,CAAI,CAAC,CAAA,GAAM;AAAA,CAAA,CAGxC,IADAiG,EAAOjG,CAAAA,CAAO,EAAE,EAAI,CAAC,CAAA,CACdiG,IAAS,GAAA,EAAOA,CAAAA,GAAS,KAC5BA,CAAAA,CAAOjG,CAAAA,CAAO,EAAE,CAAA,CAAI,CAAC,UAEpBiG,CAAAA,GAAS,GAAA,EAAOA,IAAS,GAAA,EAAOA,CAAAA,GAAS,IAAK,CACnD,IAAM9K,EAAS,CAAE,CAAA,CAAG,EAAG,CAAA,CAAG,CAAA,CAAG,EAAG,CAAE,CAAA,CAAE8K,CAAI,CAAA,CACxC1G,CAAAA,EAAO4a,GAAcna,CAAAA,CAAQ,CAAA,CAAI,EAAG7E,CAAAA,CAAQsE,CAAO,EACnD,CAAA,EAAKtE,EACT,MACK,CACD,IAAMif,EAAMpa,CAAAA,CAAO,MAAA,CAAO,EAAI,CAAA,CAAG,CAAC,EAClCP,CAAAA,CAAQ,CAAA,CAAI,EAAG,eAAA,CAAiB,CAAA,wBAAA,EAA2B2a,CAAG,CAAA,CAAE,CAAA,CAChE7a,GAAO6a,EACX,CACJ,SACSnb,CAAAA,GAAO,GAAA,EAAOA,IAAO,GAAA,CAAM,CAEhC,IAAMob,CAAAA,CAAU,CAAA,CACZpU,EAAOjG,CAAAA,CAAO,CAAA,CAAI,CAAC,CAAA,CACvB,KAAOiG,IAAS,GAAA,EAAOA,CAAAA,GAAS,KAC5BA,CAAAA,CAAOjG,CAAAA,CAAO,EAAE,CAAA,CAAI,CAAC,EACrBiG,CAAAA,GAAS;AAAA,CAAA,EAAQ,EAAEA,CAAAA,GAAS,IAAA,EAAQjG,CAAAA,CAAO,CAAA,CAAI,CAAC,CAAA,GAAM;AAAA,CAAA,CAAA,GACtDT,CAAAA,EAAO,EAAI8a,CAAAA,CAAUra,CAAAA,CAAO,MAAMqa,CAAAA,CAAS,CAAA,CAAI,CAAC,CAAA,CAAIpb,CAAAA,EAC5D,CAAA,KAEIM,GAAON,EAEf,CACA,OAAA,CAAIe,CAAAA,CAAOA,CAAAA,CAAO,MAAA,CAAS,CAAC,CAAA,GAAM,GAAA,EAAOA,CAAAA,CAAO,MAAA,GAAW,CAAA,GACvDP,CAAAA,CAAQO,EAAO,MAAA,CAAQ,cAAA,CAAgB,wBAAwB,CAAA,CAC5DT,CACX,CAKA,SAASya,EAAAA,CAAYha,CAAAA,CAAQtH,CAAAA,CAAQ,CACjC,IAAIyN,EAAO,EAAA,CACPlH,CAAAA,CAAKe,CAAAA,CAAOtH,CAAAA,CAAS,CAAC,CAAA,CAC1B,MAAOuG,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,EAAQA,CAAAA,GAAO;AAAA,CAAA,EAAQA,CAAAA,GAAO,OAClD,EAAAA,CAAAA,GAAO,MAAQe,CAAAA,CAAOtH,CAAAA,CAAS,CAAC,CAAA,GAAM;AAAA,CAAA,CAAA,EAEtCuG,CAAAA,GAAO;AAAA,CAAA,GACPkH,CAAAA,EAAQ;AAAA,CAAA,CAAA,CACZzN,CAAAA,EAAU,CAAA,CACVuG,CAAAA,CAAKe,CAAAA,CAAOtH,CAAAA,CAAS,CAAC,CAAA,CAE1B,OAAKyN,CAAAA,GACDA,CAAAA,CAAO,GAAA,CAAA,CACJ,CAAE,KAAAA,CAAAA,CAAM,MAAA,CAAAzN,CAAO,CAC1B,CACA,IAAMwhB,EAAAA,CAAc,CAChB,EAAK,IAAA,CACL,CAAA,CAAG,MAAA,CACH,CAAA,CAAG,IAAA,CACH,CAAA,CAAG,MAAA,CACH,CAAA,CAAG,KACH,CAAA,CAAG;AAAA,CAAA,CACH,CAAA,CAAG,IAAA,CACH,CAAA,CAAG,GAAA,CACH,CAAA,CAAG,IAAA,CACH,CAAA,CAAG,MAAA,CACH/N,CAAAA,CAAG,MAAA,CACH,CAAA,CAAG,QAAA,CACH,CAAA,CAAG,QAAA,CACH,GAAA,CAAK,GAAA,CACL,GAAA,CAAK,GAAA,CACL,GAAA,CAAK,GAAA,CACL,IAAA,CAAM,IAAA,CACN,GAAA,CAAM,GACV,CAAA,CACA,SAASgO,EAAAA,CAAcna,CAAAA,CAAQtH,EAAQyC,CAAAA,CAAQsE,CAAAA,CAAS,CACpD,IAAMwa,CAAAA,CAAKja,CAAAA,CAAO,MAAA,CAAOtH,CAAAA,CAAQyC,CAAM,CAAA,CAEjC4L,CAAAA,CADKkT,CAAAA,CAAG,MAAA,GAAW9e,CAAAA,EAAU,gBAAA,CAAiB,IAAA,CAAK8e,CAAE,CAAA,CACzC,QAAA,CAASA,CAAAA,CAAI,EAAE,CAAA,CAAI,GAAA,CACrC,GAAI,KAAA,CAAMlT,CAAI,CAAA,CAAG,CACb,IAAMqT,CAAAA,CAAMpa,CAAAA,CAAO,MAAA,CAAOtH,CAAAA,CAAS,EAAGyC,CAAAA,CAAS,CAAC,CAAA,CAChD,OAAAsE,CAAAA,CAAQ/G,CAAAA,CAAS,CAAA,CAAG,eAAA,CAAiB,CAAA,wBAAA,EAA2B0hB,CAAG,CAAA,CAAE,CAAA,CAC9DA,CACX,CACA,OAAO,MAAA,CAAO,aAAA,CAAcrT,CAAI,CACpC,CCvNA,SAASuT,EAAAA,CAActY,CAAAA,CAAKwT,CAAAA,CAAO4C,CAAAA,CAAU3Y,CAAAA,CAAS,CAClD,GAAM,CAAE,KAAA,CAAAzE,CAAAA,CAAO,IAAA,CAAAoB,EAAM,OAAA,CAAAsI,CAAAA,CAAS,KAAA,CAAA6V,CAAM,CAAA,CAAI/E,CAAAA,CAAM,IAAA,GAAS,cAAA,CACjDiD,EAAAA,CAAmBzW,CAAAA,CAAKwT,CAAAA,CAAO/V,CAAO,CAAA,CACtC8Z,EAAAA,CAAkB/D,CAAAA,CAAOxT,CAAAA,CAAI,QAAQ,MAAA,CAAQvC,CAAO,CAAA,CACpD6D,CAAAA,CAAU8U,CAAAA,CACVpW,CAAAA,CAAI,UAAA,CAAW,OAAA,CAAQoW,CAAAA,CAAS,MAAA,CAAQzX,CAAAA,EAAOlB,CAAAA,CAAQ2Y,CAAAA,CAAU,oBAAA,CAAsBzX,CAAG,CAAC,EAC3F,IAAA,CACFP,CAAAA,CACA4B,CAAAA,CAAI,OAAA,CAAQ,UAAA,EAAcA,CAAAA,CAAI,KAAA,CAC9B5B,CAAAA,CAAM4B,CAAAA,CAAI,MAAA,CAAOjF,CAAM,CAAA,CAElBuG,CAAAA,CACLlD,CAAAA,CAAMoa,EAAAA,CAAoBxY,CAAAA,CAAI,MAAA,CAAQhH,CAAAA,CAAOsI,CAAAA,CAAS8U,CAAAA,CAAU3Y,CAAO,CAAA,CAClE+V,CAAAA,CAAM,IAAA,GAAS,QAAA,CACpBpV,CAAAA,CAAMqa,EAAAA,CAAoBzY,CAAAA,CAAKhH,CAAAA,CAAOwa,CAAAA,CAAO/V,CAAO,CAAA,CAEpDW,EAAM4B,CAAAA,CAAI,MAAA,CAAOjF,CAAM,CAAA,CAC3B,IAAI2b,CAAAA,CACJ,GAAI,CACA,IAAMnZ,CAAAA,CAAMa,CAAAA,CAAI,OAAA,CAAQpF,CAAAA,CAAO2F,CAAAA,EAAOlB,CAAAA,CAAQ2Y,CAAAA,EAAY5C,EAAO,oBAAA,CAAsB7U,CAAG,CAAA,CAAGqB,CAAAA,CAAI,OAAO,CAAA,CACxG0W,CAAAA,CAASnb,CAAAA,CAASgC,CAAG,CAAA,CAAIA,CAAAA,CAAM,IAAI4D,CAAAA,CAAO5D,CAAG,EACjD,CAAA,MACOY,EAAO,CACV,IAAMQ,CAAAA,CAAMR,CAAAA,YAAiB,KAAA,CAAQA,CAAAA,CAAM,OAAA,CAAU,MAAA,CAAOA,CAAK,CAAA,CACjEV,CAAAA,CAAQ2Y,CAAAA,EAAY5C,CAAAA,CAAO,oBAAA,CAAsB7U,CAAG,CAAA,CACpD+X,CAAAA,CAAS,IAAIvV,CAAAA,CAAOnI,CAAK,EAC7B,CACA,OAAA0d,CAAAA,CAAO,KAAA,CAAQ6B,CAAAA,CACf7B,CAAAA,CAAO,MAAA,CAAS1d,CAAAA,CACZoB,CAAAA,GACAsc,CAAAA,CAAO,IAAA,CAAOtc,GACdkH,CAAAA,GACAoV,CAAAA,CAAO,GAAA,CAAMpV,CAAAA,CAAAA,CACblD,CAAAA,CAAI,MAAA,GACJsY,CAAAA,CAAO,MAAA,CAAStY,CAAAA,CAAI,MAAA,CAAA,CACpBsE,CAAAA,GACAgU,CAAAA,CAAO,OAAA,CAAUhU,CAAAA,CAAAA,CACdgU,CACX,CACA,SAAS8B,EAAAA,CAAoB1W,CAAAA,CAAQ9I,CAAAA,CAAOsI,CAAAA,CAAS8U,CAAAA,CAAU3Y,CAAAA,CAAS,CACpE,GAAI6D,CAAAA,GAAY,GAAA,CACZ,OAAOQ,CAAAA,CAAO/G,CAAM,CAAA,CACxB,IAAM2d,CAAAA,CAAgB,EAAC,CACvB,IAAA,IAAWta,CAAAA,IAAO0D,CAAAA,CAAO,IAAA,CACrB,GAAI,CAAC1D,CAAAA,CAAI,UAAA,EAAcA,CAAAA,CAAI,GAAA,GAAQkD,CAAAA,CAC/B,GAAIlD,CAAAA,CAAI,OAAA,EAAWA,CAAAA,CAAI,IAAA,CACnBsa,CAAAA,CAAc,IAAA,CAAKta,CAAG,CAAA,CAAA,KAEtB,OAAOA,CAAAA,CAGnB,IAAA,IAAWA,CAAAA,IAAOsa,CAAAA,CACd,GAAIta,CAAAA,CAAI,IAAA,EAAM,IAAA,CAAKpF,CAAK,CAAA,CACpB,OAAOoF,CAAAA,CACf,IAAMoY,CAAAA,CAAK1U,CAAAA,CAAO,SAAA,CAAUR,CAAO,CAAA,CACnC,OAAIkV,CAAAA,EAAM,CAACA,CAAAA,CAAG,UAAA,EAGV1U,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,MAAA,CAAO,OAAO,EAAC,CAAG0U,CAAAA,CAAI,CAAE,OAAA,CAAS,KAAA,CAAO,IAAA,CAAM,MAAU,CAAC,CAAC,CAAA,CACpEA,CAAAA,GAEX/Y,CAAAA,CAAQ2Y,CAAAA,CAAU,oBAAA,CAAsB,CAAA,gBAAA,EAAmB9U,CAAO,CAAA,CAAA,CAAIA,CAAAA,GAAY,uBAAuB,CAAA,CAClGQ,CAAAA,CAAO/G,CAAM,CAAA,CACxB,CACA,SAAS0d,EAAAA,CAAoB,CAAE,KAAA,CAAAE,CAAAA,CAAO,UAAA,CAAAC,CAAAA,CAAY,MAAA,CAAA9W,CAAO,CAAA,CAAG9I,CAAAA,CAAOwa,CAAAA,CAAO/V,CAAAA,CAAS,CAC/E,IAAMW,CAAAA,CAAM0D,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK1D,CAAAA,EAAAA,CAAQA,CAAAA,CAAI,OAAA,GAAY,IAAA,EAASua,CAAAA,EAASva,EAAI,OAAA,GAAY,KAAA,GACnFA,CAAAA,CAAI,IAAA,EAAM,IAAA,CAAKpF,CAAK,CAAC,CAAA,EAAK8I,CAAAA,CAAO/G,CAAM,CAAA,CAC3C,GAAI+G,CAAAA,CAAO,MAAA,CAAQ,CACf,IAAM+E,EAAS/E,CAAAA,CAAO,MAAA,CAAO,IAAA,CAAK1D,CAAAA,EAAOA,CAAAA,CAAI,OAAA,EAAWA,CAAAA,CAAI,IAAA,EAAM,IAAA,CAAKpF,CAAK,CAAC,CAAA,EACzE8I,CAAAA,CAAO/G,CAAM,CAAA,CACjB,GAAIqD,EAAI,GAAA,GAAQyI,CAAAA,CAAO,GAAA,CAAK,CACxB,IAAMuQ,CAAAA,CAAKwB,CAAAA,CAAW,SAAA,CAAUxa,CAAAA,CAAI,GAAG,CAAA,CACjCuK,CAAAA,CAAKiQ,CAAAA,CAAW,SAAA,CAAU/R,CAAAA,CAAO,GAAG,CAAA,CACpClI,CAAAA,CAAM,CAAA,8BAAA,EAAiCyY,CAAE,CAAA,IAAA,EAAOzO,CAAE,CAAA,CAAA,CACxDlL,CAAAA,CAAQ+V,CAAAA,CAAO,oBAAA,CAAsB7U,CAAAA,CAAK,IAAI,EAClD,CACJ,CACA,OAAOP,CACX,CCnFA,SAASya,EAAAA,CAAoBniB,CAAAA,CAAQoiB,CAAAA,CAAQ7f,CAAAA,CAAK,CAC9C,GAAI6f,CAAAA,CAAQ,CACR7f,CAAAA,GAAQA,CAAAA,CAAM6f,CAAAA,CAAO,MAAA,CAAA,CACrB,IAAA,IAAS,CAAA,CAAI7f,EAAM,CAAA,CAAG,CAAA,EAAK,CAAA,CAAG,EAAE,CAAA,CAAG,CAC/B,IAAI2a,CAAAA,CAAKkF,CAAAA,CAAO,CAAC,CAAA,CACjB,OAAQlF,CAAAA,CAAG,IAAA,EACP,KAAK,QACL,KAAK,SAAA,CACL,KAAK,SAAA,CACDld,CAAAA,EAAUkd,CAAAA,CAAG,MAAA,CAAO,MAAA,CACpB,QACR,CAIA,IADAA,CAAAA,CAAKkF,CAAAA,CAAO,EAAE,CAAC,CAAA,CACRlF,GAAI,IAAA,GAAS,OAAA,EAChBld,CAAAA,EAAUkd,CAAAA,CAAG,MAAA,CAAO,MAAA,CACpBA,CAAAA,CAAKkF,CAAAA,CAAO,EAAE,CAAC,CAAA,CAEnB,KACJ,CACJ,CACA,OAAOpiB,CACX,CChBA,IAAMuf,EAAAA,CAAK,CAAE,WAAA,CAAA5B,EAAAA,CAAa,gBAAA,CAAAC,EAAiB,CAAA,CAC3C,SAASD,EAAAA,CAAYrU,CAAAA,CAAKwT,CAAAA,CAAO9L,CAAAA,CAAOjK,CAAAA,CAAS,CAC7C,IAAMkb,EAAQ3Y,CAAAA,CAAI,KAAA,CACZ,CAAE,WAAA,CAAAgT,CAAAA,CAAa,OAAA,CAAAtQ,CAAAA,CAAS,MAAA,CAAAhE,CAAAA,CAAQ,GAAA,CAAAN,CAAI,CAAA,CAAIsJ,CAAAA,CAC1CvM,CAAAA,CACA4d,CAAAA,CAAa,IAAA,CACjB,OAAQvF,CAAAA,CAAM,IAAA,EACV,KAAK,OAAA,CACDrY,CAAAA,CAAO6d,EAAAA,CAAahZ,CAAAA,CAAKwT,CAAAA,CAAO/V,CAAO,CAAA,CAAA,CACnCiB,CAAAA,EAAUN,CAAAA,GACVX,CAAAA,CAAQ+V,CAAAA,CAAO,aAAA,CAAe,+CAA+C,CAAA,CACjF,MACJ,KAAK,QAAA,CACL,KAAK,sBAAA,CACL,KAAK,sBAAA,CACL,KAAK,cAAA,CACDrY,CAAAA,CAAOmd,EAAAA,CAActY,CAAAA,CAAKwT,CAAAA,CAAOpV,CAAAA,CAAKX,CAAO,CAAA,CACzCiB,CAAAA,GACAvD,CAAAA,CAAK,MAAA,CAASuD,CAAAA,CAAO,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CAAA,CAC3C,MACJ,KAAK,WAAA,CACL,KAAK,WAAA,CACL,KAAK,iBAAA,CACDvD,EAAOgb,EAAAA,CAAkBF,EAAAA,CAAIjW,CAAAA,CAAKwT,CAAAA,CAAO9L,CAAAA,CAAOjK,CAAO,CAAA,CACnDiB,CAAAA,GACAvD,CAAAA,CAAK,MAAA,CAASuD,CAAAA,CAAO,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CAAA,CAC3C,MACJ,QAAS,CACL,IAAM1I,CAAAA,CAAUwd,CAAAA,CAAM,IAAA,GAAS,OAAA,CACzBA,CAAAA,CAAM,OAAA,CACN,CAAA,yBAAA,EAA4BA,CAAAA,CAAM,IAAI,CAAA,CAAA,CAAA,CAC5C/V,CAAAA,CAAQ+V,CAAAA,CAAO,kBAAA,CAAoBxd,CAAO,CAAA,CAC1CmF,CAAAA,CAAOmZ,EAAAA,CAAiBtU,CAAAA,CAAKwT,CAAAA,CAAM,MAAA,CAAQ,MAAA,CAAW,IAAA,CAAM9L,CAAAA,CAAOjK,CAAO,CAAA,CAC1Esb,CAAAA,CAAa,MACjB,CACJ,CACA,OAAIra,GAAUvD,CAAAA,CAAK,MAAA,GAAW,EAAA,EAC1BsC,CAAAA,CAAQiB,CAAAA,CAAQ,WAAA,CAAa,kCAAkC,CAAA,CAC/Dia,CAAAA,EACA3Y,CAAAA,CAAI,OAAA,CAAQ,UAAA,GACX,CAACzE,CAAAA,CAASJ,CAAI,CAAA,EACX,OAAOA,CAAAA,CAAK,KAAA,EAAU,QAAA,EACrBA,CAAAA,CAAK,GAAA,EAAOA,CAAAA,CAAK,GAAA,GAAQ,uBAAA,CAAA,EAE9BsC,CAAAA,CAAQW,CAAAA,EAAOoV,CAAAA,CAAO,gBAAA,CADV,2CAC+B,CAAA,CAE3CR,CAAAA,GACA7X,CAAAA,CAAK,YAAc,IAAA,CAAA,CACnBuH,CAAAA,GACI8Q,CAAAA,CAAM,IAAA,GAAS,QAAA,EAAYA,CAAAA,CAAM,MAAA,GAAW,EAAA,CAC5CrY,CAAAA,CAAK,OAAA,CAAUuH,CAAAA,CAEfvH,CAAAA,CAAK,aAAA,CAAgBuH,CAAAA,CAAAA,CAGzB1C,CAAAA,CAAI,OAAA,CAAQ,gBAAA,EAAoB+Y,CAAAA,GAChC5d,CAAAA,CAAK,QAAA,CAAWqY,CAAAA,CAAAA,CACbrY,CACX,CACA,SAASmZ,EAAAA,CAAiBtU,CAAAA,CAAKtJ,CAAAA,CAAQoiB,CAAAA,CAAQ7f,CAAAA,CAAK,CAAE,WAAA,CAAA+Z,CAAAA,CAAa,QAAAtQ,CAAAA,CAAS,MAAA,CAAAhE,CAAAA,CAAQ,GAAA,CAAAN,CAAAA,CAAK,GAAA,CAAA7H,CAAI,CAAA,CAAGkH,CAAAA,CAAS,CACrG,IAAM+V,CAAAA,CAAQ,CACV,IAAA,CAAM,QAAA,CACN,MAAA,CAAQqF,GAAoBniB,CAAAA,CAAQoiB,CAAAA,CAAQ7f,CAAG,CAAA,CAC/C,MAAA,CAAQ,EAAA,CACR,MAAA,CAAQ,EACZ,CAAA,CACMkC,CAAAA,CAAOmd,EAAAA,CAActY,CAAAA,CAAKwT,CAAAA,CAAOpV,CAAAA,CAAKX,CAAO,CAAA,CACnD,OAAIiB,CAAAA,GACAvD,CAAAA,CAAK,MAAA,CAASuD,CAAAA,CAAO,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CACnCvD,CAAAA,CAAK,MAAA,GAAW,EAAA,EAChBsC,CAAAA,CAAQiB,CAAAA,CAAQ,WAAA,CAAa,kCAAkC,CAAA,CAAA,CAEnEsU,CAAAA,GACA7X,CAAAA,CAAK,WAAA,CAAc,IAAA,CAAA,CACnBuH,CAAAA,GACAvH,CAAAA,CAAK,OAAA,CAAUuH,CAAAA,CACfvH,CAAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAI5E,CAAAA,CAAAA,CAEb4E,CACX,CACA,SAAS6d,GAAa,CAAE,OAAA,CAAA3R,CAAQ,CAAA,CAAG,CAAE,MAAA,CAAA3Q,CAAAA,CAAQ,MAAA,CAAAsH,CAAAA,CAAQ,GAAA,CAAAzH,CAAI,CAAA,CAAGkH,CAAAA,CAAS,CACjE,IAAMwb,CAAAA,CAAQ,IAAI3Y,EAAAA,CAAMtC,CAAAA,CAAO,SAAA,CAAU,CAAC,CAAC,CAAA,CACvCib,CAAAA,CAAM,MAAA,GAAW,EAAA,EACjBxb,CAAAA,CAAQ/G,CAAAA,CAAQ,WAAA,CAAa,iCAAiC,CAAA,CAC9DuiB,CAAAA,CAAM,MAAA,CAAO,SAAS,GAAG,CAAA,EACzBxb,CAAAA,CAAQ/G,CAAAA,CAASsH,CAAAA,CAAO,MAAA,CAAS,CAAA,CAAG,WAAA,CAAa,gCAAA,CAAkC,IAAI,CAAA,CAC3F,IAAM4Z,CAAAA,CAAWlhB,CAAAA,CAASsH,CAAAA,CAAO,MAAA,CAC3B6Z,CAAAA,CAAK1C,EAAAA,CAAW5e,CAAAA,CAAKqhB,CAAAA,CAAUvQ,CAAAA,CAAQ,MAAA,CAAQ5J,CAAO,CAAA,CAC5D,OAAAwb,CAAAA,CAAM,KAAA,CAAQ,CAACviB,CAAAA,CAAQkhB,CAAAA,CAAUC,CAAAA,CAAG,MAAM,EACtCA,CAAAA,CAAG,OAAA,GACHoB,CAAAA,CAAM,OAAA,CAAUpB,CAAAA,CAAG,OAAA,CAAA,CAChBoB,CACX,CC9FA,SAASC,EAAAA,CAAW7R,CAAAA,CAASuR,CAAAA,CAAY,CAAE,MAAA,CAAAliB,CAAAA,CAAQ,KAAA,CAAAJ,EAAO,KAAA,CAAA0C,CAAAA,CAAO,GAAA,CAAAzC,CAAI,CAAA,CAAGkH,CAAAA,CAAS,CAC7E,IAAM0b,CAAAA,CAAO,MAAA,CAAO,MAAA,CAAO,CAAEzH,CAAAA,CAAakH,CAAW,CAAA,CAAGvR,CAAO,EACzDhJ,CAAAA,CAAM,IAAIkT,EAAAA,CAAS,MAAA,CAAW4H,CAAI,CAAA,CAClCnZ,CAAAA,CAAM,CACR,KAAA,CAAO,KAAA,CACP,MAAA,CAAQ,IAAA,CACR,UAAA,CAAY3B,CAAAA,CAAI,UAAA,CAChB,OAAA,CAASA,CAAAA,CAAI,OAAA,CACb,MAAA,CAAQA,CAAAA,CAAI,MAChB,CAAA,CACMqJ,CAAAA,CAAQiL,EAAAA,CAAarc,CAAAA,CAAO,CAC9B,SAAA,CAAW,WAAA,CACX,IAAA,CAAM0C,CAAAA,EAASzC,CAAAA,GAAM,CAAC,EACtB,MAAA,CAAAG,CAAAA,CACA,OAAA,CAAA+G,CAAAA,CACA,YAAA,CAAc,CAAA,CACd,cAAA,CAAgB,IACpB,CAAC,CAAA,CACGiK,CAAAA,CAAM,KAAA,GACNrJ,CAAAA,CAAI,UAAA,CAAW,QAAA,CAAW,IAAA,CACtBrF,IACCA,CAAAA,CAAM,IAAA,GAAS,WAAA,EAAeA,CAAAA,CAAM,IAAA,GAAS,WAAA,CAAA,EAC9C,CAAC0O,CAAAA,CAAM,UAAA,EACPjK,CAAAA,CAAQiK,CAAAA,CAAM,GAAA,CAAK,cAAA,CAAgB,uEAAuE,CAAA,CAAA,CAGlHrJ,CAAAA,CAAI,SAAWrF,CAAAA,CACTqb,EAAAA,CAAYrU,CAAAA,CAAKhH,CAAAA,CAAO0O,CAAAA,CAAOjK,CAAO,CAAA,CACtC6W,EAAAA,CAAiBtU,CAAAA,CAAK0H,CAAAA,CAAM,GAAA,CAAKpR,CAAAA,CAAO,IAAA,CAAMoR,CAAAA,CAAOjK,CAAO,CAAA,CAClE,IAAM2b,CAAAA,CAAa/a,CAAAA,CAAI,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,CACjCwZ,CAAAA,CAAK1C,EAAAA,CAAW5e,CAAAA,CAAK6iB,CAAAA,CAAY,KAAA,CAAO3b,CAAO,CAAA,CACrD,OAAIoa,CAAAA,CAAG,UACHxZ,CAAAA,CAAI,OAAA,CAAUwZ,CAAAA,CAAG,OAAA,CAAA,CACrBxZ,CAAAA,CAAI,KAAA,CAAQ,CAAC3H,CAAAA,CAAQ0iB,CAAAA,CAAYvB,CAAAA,CAAG,MAAM,CAAA,CACnCxZ,CACX,CCjCA,SAASgb,EAAAA,CAAYxY,EAAK,CACtB,GAAI,OAAOA,CAAAA,EAAQ,QAAA,CACf,OAAO,CAACA,CAAAA,CAAKA,CAAAA,CAAM,CAAC,CAAA,CACxB,GAAI,KAAA,CAAM,OAAA,CAAQA,CAAG,CAAA,CACjB,OAAOA,CAAAA,CAAI,MAAA,GAAW,CAAA,CAAIA,CAAAA,CAAM,CAACA,CAAAA,CAAI,CAAC,CAAA,CAAGA,CAAAA,CAAI,CAAC,CAAC,CAAA,CACnD,GAAM,CAAE,MAAA,CAAAnK,CAAAA,CAAQ,OAAAsH,CAAO,CAAA,CAAI6C,CAAAA,CAC3B,OAAO,CAACnK,CAAAA,CAAQA,CAAAA,EAAU,OAAOsH,CAAAA,EAAW,QAAA,CAAWA,CAAAA,CAAO,MAAA,CAAS,CAAA,CAAE,CAC7E,CACA,SAASsb,GAAaC,CAAAA,CAAS,CAC3B,IAAI7W,CAAAA,CAAU,EAAA,CACV8W,CAAAA,CAAY,KAAA,CACZC,CAAAA,CAAiB,KAAA,CACrB,IAAA,IAAS9iB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI4iB,CAAAA,CAAQ,MAAA,CAAQ,EAAE5iB,EAAG,CACrC,IAAMqH,CAAAA,CAASub,CAAAA,CAAQ5iB,CAAC,CAAA,CACxB,OAAQqH,CAAAA,CAAO,CAAC,CAAA,EACZ,KAAK,GAAA,CACD0E,CAAAA,EAAAA,CACKA,CAAAA,GAAY,EAAA,CAAK,GAAK+W,CAAAA,CAAiB;;AAAA,CAAA,CAAS;AAAA,CAAA,GAC5Czb,CAAAA,CAAO,SAAA,CAAU,CAAC,CAAA,EAAK,KAChCwb,CAAAA,CAAY,IAAA,CACZC,CAAAA,CAAiB,KAAA,CACjB,MACJ,KAAK,GAAA,CACGF,CAAAA,CAAQ5iB,EAAI,CAAC,CAAA,GAAI,CAAC,CAAA,GAAM,GAAA,GACxBA,CAAAA,EAAK,CAAA,CAAA,CACT6iB,CAAAA,CAAY,MACZ,MACJ,QAESA,CAAAA,GACDC,CAAAA,CAAiB,MACrBD,CAAAA,CAAY,MACpB,CACJ,CACA,OAAO,CAAE,OAAA,CAAA9W,CAAAA,CAAS,cAAA,CAAA+W,CAAe,CACrC,CAYA,IAAMC,GAAN,KAAe,CACX,WAAA,CAAYrS,CAAAA,CAAU,EAAC,CAAG,CACtB,IAAA,CAAK,GAAA,CAAM,KACX,IAAA,CAAK,YAAA,CAAe,KAAA,CACpB,IAAA,CAAK,OAAA,CAAU,EAAC,CAChB,IAAA,CAAK,OAAS,EAAC,CACf,IAAA,CAAK,QAAA,CAAW,EAAC,CACjB,IAAA,CAAK,OAAA,CAAU,CAACrJ,EAAQ+G,CAAAA,CAAM/O,CAAAA,CAAS2jB,CAAAA,GAAY,CAC/C,IAAM1gB,CAAAA,CAAMogB,EAAAA,CAAYrb,CAAM,EAC1B2b,CAAAA,CACA,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,IAAIvH,EAAAA,CAAYnZ,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAO,CAAC,CAAA,CAEtD,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,IAAImc,EAAAA,CAAelZ,CAAAA,CAAK8L,CAAAA,CAAM/O,CAAO,CAAC,EAC/D,CAAA,CAEA,IAAA,CAAK,WAAa,IAAIkH,EAAAA,CAAW,CAAE,OAAA,CAASmK,EAAQ,OAAA,EAAW,KAAM,CAAC,CAAA,CACtE,IAAA,CAAK,OAAA,CAAUA,EACnB,CACA,SAAShJ,CAAAA,CAAKub,CAAAA,CAAU,CACpB,GAAM,CAAE,OAAA,CAAAlX,CAAAA,CAAS,cAAA,CAAA+W,CAAe,EAAIH,EAAAA,CAAa,IAAA,CAAK,OAAO,CAAA,CAE7D,GAAI5W,CAAAA,CAAS,CACT,IAAM4O,EAAKjT,CAAAA,CAAI,QAAA,CACf,GAAIub,CAAAA,CACAvb,EAAI,OAAA,CAAUA,CAAAA,CAAI,OAAA,CAAU,CAAA,EAAGA,EAAI,OAAO;AAAA,EAAKqE,CAAO,CAAA,CAAA,CAAKA,CAAAA,CAAAA,KAAAA,GAEtD+W,GAAkBpb,CAAAA,CAAI,UAAA,CAAW,UAAY,CAACiT,CAAAA,CACnDjT,EAAI,aAAA,CAAgBqE,CAAAA,CAAAA,KAAAA,GAEfjH,EAAa6V,CAAE,CAAA,EAAK,CAACA,CAAAA,CAAG,IAAA,EAAQA,EAAG,KAAA,CAAM,MAAA,CAAS,EAAG,CAC1D,IAAInP,EAAKmP,CAAAA,CAAG,KAAA,CAAM,CAAC,CAAA,CACfhW,CAAAA,CAAO6G,CAAE,CAAA,GACTA,CAAAA,CAAKA,EAAG,GAAA,CAAA,CACZ,IAAMsR,EAAKtR,CAAAA,CAAG,aAAA,CACdA,EAAG,aAAA,CAAgBsR,CAAAA,CAAK,GAAG/Q,CAAO;AAAA,EAAK+Q,CAAE,CAAA,CAAA,CAAK/Q,EAClD,CAAA,KACK,CACD,IAAM+Q,CAAAA,CAAKnC,CAAAA,CAAG,aAAA,CACdA,CAAAA,CAAG,aAAA,CAAgBmC,CAAAA,CAAK,GAAG/Q,CAAO;AAAA,EAAK+Q,CAAE,CAAA,CAAA,CAAK/Q,EAClD,CACJ,CACIkX,CAAAA,EACA,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,MAAMvb,CAAAA,CAAI,MAAA,CAAQ,IAAA,CAAK,MAAM,EAClD,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,KAAA,CAAMA,EAAI,QAAA,CAAU,IAAA,CAAK,QAAQ,CAAA,GAGtDA,EAAI,MAAA,CAAS,IAAA,CAAK,MAAA,CAClBA,CAAAA,CAAI,SAAW,IAAA,CAAK,QAAA,CAAA,CAExB,IAAA,CAAK,OAAA,CAAU,EAAC,CAChB,IAAA,CAAK,MAAA,CAAS,EAAC,CACf,IAAA,CAAK,QAAA,CAAW,GACpB,CAMA,UAAA,EAAa,CACT,OAAO,CACH,OAAA,CAASib,EAAAA,CAAa,IAAA,CAAK,OAAO,EAAE,OAAA,CACpC,UAAA,CAAY,IAAA,CAAK,UAAA,CACjB,OAAQ,IAAA,CAAK,MAAA,CACb,QAAA,CAAU,IAAA,CAAK,QACnB,CACJ,CAOA,CAAC,OAAA,CAAQ1G,EAAQiH,CAAAA,CAAW,KAAA,CAAOC,CAAAA,CAAY,EAAA,CAAI,CAC/C,IAAA,IAAWtG,CAAAA,IAASZ,CAAAA,CAChB,MAAO,IAAA,CAAK,IAAA,CAAKY,CAAK,CAAA,CAC1B,MAAO,IAAA,CAAK,GAAA,CAAIqG,CAAAA,CAAUC,CAAS,EACvC,CAEA,CAAC,IAAA,CAAKtG,CAAAA,CAAO,CACT,OAAQA,CAAAA,CAAM,IAAA,EACV,KAAK,WAAA,CACD,IAAA,CAAK,UAAA,CAAW,GAAA,CAAIA,EAAM,MAAA,CAAQ,CAAC9c,CAAAA,CAAQV,CAAAA,CAAS2jB,IAAY,CAC5D,IAAM1gB,CAAAA,CAAMogB,EAAAA,CAAY7F,CAAK,CAAA,CAC7Bva,CAAAA,CAAI,CAAC,CAAA,EAAKvC,EACV,IAAA,CAAK,OAAA,CAAQuC,CAAAA,CAAK,eAAA,CAAiBjD,EAAS2jB,CAAO,EACvD,CAAC,CAAA,CACD,KAAK,OAAA,CAAQ,IAAA,CAAKnG,CAAAA,CAAM,MAAM,EAC9B,IAAA,CAAK,YAAA,CAAe,IAAA,CACpB,MACJ,KAAK,UAAA,CAAY,CACb,IAAMnV,CAAAA,CAAM6a,GAAW,IAAA,CAAK,OAAA,CAAS,IAAA,CAAK,UAAA,CAAY1F,EAAO,IAAA,CAAK,OAAO,CAAA,CACrE,IAAA,CAAK,cAAgB,CAACnV,CAAAA,CAAI,UAAA,CAAW,QAAA,EACrC,IAAA,CAAK,OAAA,CAAQmV,CAAAA,CAAO,cAAA,CAAgB,iDAAiD,CAAA,CACzF,IAAA,CAAK,QAAA,CAASnV,CAAAA,CAAK,KAAK,CAAA,CACpB,IAAA,CAAK,GAAA,GACL,MAAM,KAAK,GAAA,CAAA,CACf,IAAA,CAAK,GAAA,CAAMA,CAAAA,CACX,KAAK,YAAA,CAAe,KAAA,CACpB,KACJ,CACA,KAAK,iBAAA,CACL,KAAK,OAAA,CACD,MACJ,KAAK,SAAA,CACL,KAAK,SAAA,CACD,IAAA,CAAK,QAAQ,IAAA,CAAKmV,CAAAA,CAAM,MAAM,CAAA,CAC9B,MACJ,KAAK,OAAA,CAAS,CACV,IAAM7U,CAAAA,CAAM6U,CAAAA,CAAM,MAAA,CACZ,CAAA,EAAGA,EAAM,OAAO,CAAA,EAAA,EAAK,IAAA,CAAK,SAAA,CAAUA,EAAM,MAAM,CAAC,CAAA,CAAA,CACjDA,CAAAA,CAAM,QACNrV,CAAAA,CAAQ,IAAIgU,EAAAA,CAAekH,EAAAA,CAAY7F,CAAK,CAAA,CAAG,kBAAA,CAAoB7U,CAAG,CAAA,CACxE,KAAK,YAAA,EAAgB,CAAC,IAAA,CAAK,GAAA,CAC3B,KAAK,MAAA,CAAO,IAAA,CAAKR,CAAK,CAAA,CAEtB,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,IAAA,CAAKA,CAAK,CAAA,CAC9B,KACJ,CACA,KAAK,UAAW,CACZ,GAAI,CAAC,IAAA,CAAK,IAAK,CACX,IAAMQ,CAAAA,CAAM,+CAAA,CACZ,KAAK,MAAA,CAAO,IAAA,CAAK,IAAIwT,EAAAA,CAAekH,GAAY7F,CAAK,CAAA,CAAG,kBAAA,CAAoB7U,CAAG,CAAC,CAAA,CAChF,KACJ,CACA,IAAA,CAAK,IAAI,UAAA,CAAW,MAAA,CAAS,IAAA,CAC7B,IAAMpI,EAAM4e,EAAAA,CAAW3B,CAAAA,CAAM,GAAA,CAAKA,CAAAA,CAAM,OAASA,CAAAA,CAAM,MAAA,CAAO,MAAA,CAAQ,IAAA,CAAK,IAAI,OAAA,CAAQ,MAAA,CAAQ,IAAA,CAAK,OAAO,EAE3G,GADA,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,IAAK,IAAI,CAAA,CACxBjd,CAAAA,CAAI,OAAA,CAAS,CACb,IAAM+a,CAAAA,CAAK,IAAA,CAAK,GAAA,CAAI,QACpB,IAAA,CAAK,GAAA,CAAI,OAAA,CAAUA,CAAAA,CAAK,GAAGA,CAAE;AAAA,EAAK/a,CAAAA,CAAI,OAAO,CAAA,CAAA,CAAKA,CAAAA,CAAI,QAC1D,CACA,IAAA,CAAK,IAAI,KAAA,CAAM,CAAC,EAAIA,CAAAA,CAAI,MAAA,CACxB,KACJ,CACA,QACI,KAAK,MAAA,CAAO,IAAA,CAAK,IAAI4b,EAAAA,CAAekH,EAAAA,CAAY7F,CAAK,CAAA,CAAG,kBAAA,CAAoB,qBAAqBA,CAAAA,CAAM,IAAI,EAAE,CAAC,EACtH,CACJ,CAOA,CAAC,IAAIqG,CAAAA,CAAW,KAAA,CAAOC,EAAY,EAAA,CAAI,CACnC,GAAI,IAAA,CAAK,GAAA,CACL,KAAK,QAAA,CAAS,IAAA,CAAK,IAAK,IAAI,CAAA,CAC5B,MAAM,IAAA,CAAK,GAAA,CACX,KAAK,GAAA,CAAM,IAAA,CAAA,KAAA,GAEND,EAAU,CACf,IAAMV,EAAO,MAAA,CAAO,MAAA,CAAO,CAAEzH,CAAAA,CAAa,IAAA,CAAK,UAAW,CAAA,CAAG,IAAA,CAAK,OAAO,CAAA,CACnErT,CAAAA,CAAM,IAAIkT,EAAAA,CAAS,MAAA,CAAW4H,CAAI,CAAA,CACpC,IAAA,CAAK,cACL,IAAA,CAAK,OAAA,CAAQW,EAAW,cAAA,CAAgB,uCAAuC,EACnFzb,CAAAA,CAAI,KAAA,CAAQ,CAAC,CAAA,CAAGyb,CAAAA,CAAWA,CAAS,CAAA,CACpC,IAAA,CAAK,SAASzb,CAAAA,CAAK,KAAK,EACxB,MAAMA,EACV,CACJ,CACJ,CAAA,CCjNA,IAAM0b,EAAAA,CAAM,SAENC,EAAAA,CAAW,GAAA,CAEXC,GAAW,GAAA,CAEXlf,EAAAA,CAAS,IA0Bf,SAASmf,EAAAA,CAAUlc,EAAQ,CACvB,OAAQA,GACJ,KAAK+b,GACD,OAAO,iBAAA,CACX,KAAKC,EAAAA,CACD,OAAO,WACX,KAAKC,EAAAA,CACD,OAAO,gBAAA,CACX,KAAKlf,GACD,OAAO,QAAA,CACX,KAAK,KAAA,CACD,OAAO,YACX,KAAK,KAAA,CACD,OAAO,SAAA,CACX,KAAK,GACL,KAAK;AAAA,CAAA,CACL,KAAK,CAAA;AAAA,CAAA,CACD,OAAO,UACX,KAAK,GAAA,CACD,OAAO,cAAA,CACX,KAAK,IACD,OAAO,kBAAA,CACX,KAAK,GAAA,CACD,OAAO,gBACX,KAAK,GAAA,CACD,OAAO,gBAAA,CACX,KAAK,IACD,OAAO,cAAA,CACX,KAAK,GAAA,CACD,OAAO,iBACX,KAAK,GAAA,CACD,OAAO,cAAA,CACX,KAAK,IACD,OAAO,OACf,CACA,OAAQiD,CAAAA,CAAO,CAAC,CAAA,EACZ,KAAK,GAAA,CACL,KAAK,GAAA,CACD,OAAO,OAAA,CACX,KAAK,IACD,OAAO,SAAA,CACX,KAAK,GAAA,CACD,OAAO,iBACX,KAAK,GAAA,CACD,OAAO,OAAA,CACX,KAAK,IACD,OAAO,QAAA,CACX,KAAK,GAAA,CACD,OAAO,MACX,KAAK,GAAA,CACD,OAAO,sBAAA,CACX,KAAK,GAAA,CACD,OAAO,sBAAA,CACX,KAAK,IACL,KAAK,GAAA,CACD,OAAO,qBACf,CACA,OAAO,IACX,CC1BA,SAASmc,EAAAA,CAAQld,CAAAA,CAAI,CACjB,OAAQA,CAAAA,EACJ,KAAK,MAAA,CACL,KAAK,GAAA,CACL,KAAK;AAAA,CAAA,CACL,KAAK,IAAA,CACL,KAAK,GAAA,CACD,OAAO,KAAA,CACX,QACI,OAAO,MACf,CACJ,CACA,IAAMmd,EAAAA,CAAY,IAAI,GAAA,CAAI,wBAAwB,CAAA,CAC5CC,EAAAA,CAAW,IAAI,GAAA,CAAI,mFAAmF,CAAA,CACtGC,EAAAA,CAAqB,IAAI,GAAA,CAAI,OAAO,CAAA,CACpCC,EAAAA,CAAqB,IAAI,GAAA,CAAI,CAAA;AAAA,GAAA,CAAc,CAAA,CAC3CC,EAAAA,CAAmBvd,CAAAA,EAAO,CAACA,CAAAA,EAAMsd,EAAAA,CAAmB,GAAA,CAAItd,CAAE,CAAA,CAgB1Dwd,EAAAA,CAAN,KAAY,CACR,WAAA,EAAc,CAKV,IAAA,CAAK,KAAA,CAAQ,KAAA,CAMb,IAAA,CAAK,iBAAA,CAAoB,EAAA,CAMzB,IAAA,CAAK,eAAA,CAAkB,KAAA,CAEvB,IAAA,CAAK,MAAA,CAAS,EAAA,CAKd,IAAA,CAAK,OAAA,CAAU,KAAA,CAEf,IAAA,CAAK,SAAA,CAAY,CAAA,CAKjB,IAAA,CAAK,UAAA,CAAa,CAAA,CAElB,IAAA,CAAK,WAAA,CAAc,CAAA,CAEnB,IAAA,CAAK,UAAA,CAAa,IAAA,CAElB,IAAA,CAAK,IAAA,CAAO,IAAA,CAEZ,IAAA,CAAK,GAAA,CAAM,EACf,CAOA,CAAC,GAAA,CAAIzc,CAAAA,CAAQ0c,CAAAA,CAAa,KAAA,CAAO,CAC7B,GAAI1c,CAAAA,CAAQ,CACR,GAAI,OAAOA,CAAAA,EAAW,SAClB,MAAM,SAAA,CAAU,wBAAwB,CAAA,CAC5C,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,MAAA,CAASA,CAAAA,CAASA,CAAAA,CACnD,IAAA,CAAK,UAAA,CAAa,KACtB,CACA,IAAA,CAAK,KAAA,CAAQ,CAAC0c,CAAAA,CACd,IAAIzW,CAAAA,CAAO,IAAA,CAAK,IAAA,EAAQ,QAAA,CACxB,KAAOA,CAAAA,GAASyW,CAAAA,EAAc,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAA,EACzCzW,EAAO,MAAO,IAAA,CAAK,SAAA,CAAUA,CAAI,EACzC,CACA,SAAA,EAAY,CACR,IAAItN,CAAAA,CAAI,IAAA,CAAK,GAAA,CACTsG,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAOtG,CAAC,CAAA,CACtB,KAAOsG,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,EACxBA,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CACxB,OAAI,CAACsG,CAAAA,EAAMA,CAAAA,GAAO,KAAOA,CAAAA,GAAO;AAAA,CAAA,CACrB,KACPA,CAAAA,GAAO,IAAA,CACA,KAAK,MAAA,CAAOtG,CAAAA,CAAI,CAAC,CAAA,GAAM;AAAA,CAAA,CAC3B,KACX,CACA,MAAA,CAAO+C,CAAAA,CAAG,CACN,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAA,CAAMA,CAAC,CACnC,CACA,cAAA,CAAehD,CAAAA,CAAQ,CACnB,IAAIuG,CAAAA,CAAK,IAAA,CAAK,OAAOvG,CAAM,CAAA,CAC3B,GAAI,IAAA,CAAK,UAAA,CAAa,CAAA,CAAG,CACrB,IAAIiM,CAAAA,CAAS,CAAA,CACb,KAAO1F,CAAAA,GAAO,GAAA,EACVA,EAAK,IAAA,CAAK,MAAA,CAAO,EAAE0F,CAAAA,CAASjM,CAAM,CAAA,CACtC,GAAIuG,CAAAA,GAAO,IAAA,CAAM,CACb,IAAMgH,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAOtB,CAAAA,CAASjM,CAAAA,CAAS,CAAC,CAAA,CAC5C,GAAIuN,CAAAA,GAAS;AAAA,CAAA,EAAS,CAACA,CAAAA,EAAQ,CAAC,IAAA,CAAK,KAAA,CACjC,OAAOvN,CAAAA,CAASiM,CAAAA,CAAS,CACjC,CACA,OAAO1F,CAAAA,GAAO;AAAA,CAAA,EAAQ0F,CAAAA,EAAU,IAAA,CAAK,UAAA,EAAe,CAAC1F,CAAAA,EAAM,CAAC,IAAA,CAAK,KAAA,CAC3DvG,CAAAA,CAASiM,CAAAA,CACT,EACV,CACA,GAAI1F,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,CAAK,CAC1B,IAAM0d,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,MAAA,CAAOjkB,CAAAA,CAAQ,CAAC,CAAA,CACvC,GAAA,CAAKikB,CAAAA,GAAO,OAASA,CAAAA,GAAO,KAAA,GAAUR,EAAAA,CAAQ,IAAA,CAAK,MAAA,CAAOzjB,CAAAA,CAAS,CAAC,CAAC,CAAA,CACjE,OAAO,GACf,CACA,OAAOA,CACX,CACA,OAAA,EAAU,CACN,IAAIH,CAAAA,CAAM,IAAA,CAAK,UAAA,CAKf,OAAA,CAJI,OAAOA,CAAAA,EAAQ,QAAA,EAAaA,CAAAA,GAAQ,EAAA,EAAMA,CAAAA,CAAM,IAAA,CAAK,GAAA,IACrDA,CAAAA,CAAM,IAAA,CAAK,OAAO,OAAA,CAAQ;AAAA,CAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CACxC,IAAA,CAAK,UAAA,CAAaA,GAElBA,CAAAA,GAAQ,EAAA,CACD,IAAA,CAAK,KAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,UAAU,IAAA,CAAK,GAAG,CAAA,CAAI,IAAA,EACtD,IAAA,CAAK,MAAA,CAAOA,EAAM,CAAC,CAAA,GAAM,IAAA,GACzBA,CAAAA,EAAO,CAAA,CAAA,CACJ,IAAA,CAAK,OAAO,SAAA,CAAU,IAAA,CAAK,GAAA,CAAKA,CAAG,CAAA,CAC9C,CACA,SAASmD,CAAAA,CAAG,CACR,OAAO,IAAA,CAAK,GAAA,CAAMA,CAAAA,EAAK,KAAK,MAAA,CAAO,MACvC,CACA,OAAA,CAAQkhB,CAAAA,CAAO,CACX,YAAK,MAAA,CAAS,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,IAAA,CAAK,GAAG,EAC5C,IAAA,CAAK,GAAA,CAAM,CAAA,CACX,IAAA,CAAK,UAAA,CAAa,IAAA,CAClB,KAAK,IAAA,CAAOA,CAAAA,CACL,IACX,CACA,IAAA,CAAKlhB,CAAAA,CAAG,CACJ,OAAO,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAKA,CAAC,CACzC,CACA,CAAC,SAAA,CAAUuK,CAAAA,CAAM,CACb,OAAQA,CAAAA,EACJ,KAAK,QAAA,CACD,OAAO,MAAO,KAAK,WAAA,EAAY,CACnC,KAAK,YAAA,CACD,OAAO,MAAO,KAAK,cAAA,EAAe,CACtC,KAAK,aAAA,CACD,OAAO,MAAO,IAAA,CAAK,eAAA,EAAgB,CACvC,KAAK,KAAA,CACD,OAAO,MAAO,IAAA,CAAK,eAAc,CACrC,KAAK,MAAA,CACD,OAAO,MAAO,IAAA,CAAK,qBAAoB,CAC3C,KAAK,eAAA,CACD,OAAO,MAAO,IAAA,CAAK,mBAAkB,CACzC,KAAK,cAAA,CACD,OAAO,MAAO,IAAA,CAAK,kBAAiB,CACxC,KAAK,cAAA,CACD,OAAO,MAAO,IAAA,CAAK,kBAC3B,CACJ,CACA,CAAC,WAAA,EAAc,CACX,IAAIzG,CAAAA,CAAO,IAAA,CAAK,OAAA,EAAQ,CACxB,GAAIA,CAAAA,GAAS,KACT,OAAO,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,CAKhC,GAJIA,CAAAA,CAAK,CAAC,CAAA,GAAMuc,EAAAA,GACZ,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,EACvBvc,CAAAA,CAAOA,CAAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CAAA,CAEvBA,CAAAA,CAAK,CAAC,CAAA,GAAM,GAAA,CAAK,CACjB,IAAIqd,CAAAA,CAASrd,CAAAA,CAAK,OACdmL,CAAAA,CAAKnL,CAAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,CACzB,KAAOmL,IAAO,EAAA,EAAI,CACd,IAAM1L,CAAAA,CAAKO,CAAAA,CAAKmL,CAAAA,CAAK,CAAC,CAAA,CACtB,GAAI1L,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,CAAM,CAC3B4d,CAAAA,CAASlS,CAAAA,CAAK,CAAA,CACd,KACJ,CAAA,KAEIA,CAAAA,CAAKnL,EAAK,OAAA,CAAQ,GAAA,CAAKmL,CAAAA,CAAK,CAAC,EAErC,CACA,OAAa,CACT,IAAM1L,CAAAA,CAAKO,CAAAA,CAAKqd,CAAAA,CAAS,CAAC,CAAA,CAC1B,GAAI5d,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,CACrB4d,CAAAA,EAAU,CAAA,CAAA,UAGlB,CACA,IAAMnhB,CAAAA,CAAAA,CAAK,MAAO,IAAA,CAAK,SAAA,CAAUmhB,CAAM,CAAA,GAAM,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,CAAA,CACxE,aAAO,IAAA,CAAK,SAAA,CAAUrd,CAAAA,CAAK,MAAA,CAAS9D,CAAC,CAAA,CACrC,KAAK,WAAA,EAAY,CACV,QACX,CACA,GAAI,IAAA,CAAK,WAAU,CAAG,CAClB,IAAMohB,CAAAA,CAAK,MAAO,IAAA,CAAK,WAAW,IAAI,CAAA,CACtC,OAAA,MAAO,IAAA,CAAK,SAAA,CAAUtd,CAAAA,CAAK,MAAA,CAASsd,CAAE,CAAA,CACtC,MAAO,IAAA,CAAK,WAAA,EAAY,CACjB,QACX,CACA,OAAA,MAAMd,EAAAA,CACC,MAAO,IAAA,CAAK,cAAA,EACvB,CACA,CAAC,cAAA,EAAiB,CACd,IAAM/c,CAAAA,CAAK,IAAA,CAAK,OAAO,CAAC,CAAA,CACxB,GAAI,CAACA,CAAAA,EAAM,CAAC,KAAK,KAAA,CACb,OAAO,IAAA,CAAK,OAAA,CAAQ,YAAY,CAAA,CACpC,GAAIA,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,GAAA,CAAK,CAC1B,GAAI,CAAC,IAAA,CAAK,KAAA,EAAS,CAAC,IAAA,CAAK,QAAA,CAAS,CAAC,EAC/B,OAAO,IAAA,CAAK,OAAA,CAAQ,YAAY,CAAA,CACpC,IAAM6Q,CAAAA,CAAI,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,CACrB,GAAA,CAAKA,CAAAA,GAAM,KAAA,EAASA,IAAM,KAAA,GAAUqM,EAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,CAAC,CAAC,EACtD,OAAA,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CACvB,IAAA,CAAK,YAAc,CAAA,CACnB,IAAA,CAAK,UAAA,CAAa,CAAA,CACXrM,CAAAA,GAAM,KAAA,CAAQ,MAAQ,QAErC,CACA,OAAA,IAAA,CAAK,WAAA,CAAc,MAAO,IAAA,CAAK,WAAW,KAAK,CAAA,CAC3C,IAAA,CAAK,UAAA,CAAa,IAAA,CAAK,WAAA,EAAe,CAACqM,EAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,CAAC,CAAC,CAAA,GAC7D,KAAK,UAAA,CAAa,IAAA,CAAK,WAAA,CAAA,CACpB,MAAO,IAAA,CAAK,eAAA,EACvB,CACA,CAAC,eAAA,EAAkB,CACf,GAAM,CAACY,CAAAA,CAAKC,CAAG,CAAA,CAAI,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,CAC9B,GAAI,CAACA,CAAAA,EAAO,CAAC,IAAA,CAAK,KAAA,CACd,OAAO,IAAA,CAAK,QAAQ,aAAa,CAAA,CACrC,GAAA,CAAKD,CAAAA,GAAQ,GAAA,EAAOA,CAAAA,GAAQ,KAAOA,CAAAA,GAAQ,GAAA,GAAQZ,EAAAA,CAAQa,CAAG,CAAA,CAAG,CAC7D,IAAMthB,CAAAA,CAAAA,CAAK,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,GAAM,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,CAAA,CACnE,OAAA,IAAA,CAAK,UAAA,CAAa,KAAK,WAAA,CAAc,CAAA,CACrC,IAAA,CAAK,WAAA,EAAeA,CAAAA,CACb,MAAO,IAAA,CAAK,eAAA,EACvB,CACA,OAAO,KACX,CACA,CAAC,eAAgB,CACb,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,CAC3B,IAAM8D,CAAAA,CAAO,IAAA,CAAK,OAAA,EAAQ,CAC1B,GAAIA,CAAAA,GAAS,KACT,OAAO,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,CAC7B,IAAI9D,EAAI,MAAO,IAAA,CAAK,cAAA,EAAe,CACnC,OAAQ8D,CAAAA,CAAK9D,CAAC,CAAA,EACV,KAAK,GAAA,CACD,MAAO,IAAA,CAAK,UAAU8D,CAAAA,CAAK,MAAA,CAAS9D,CAAC,CAAA,CAEzC,KAAK,MAAA,CACD,aAAO,IAAA,CAAK,WAAA,EAAY,CACjB,MAAO,IAAA,CAAK,cAAA,EAAe,CACtC,KAAK,GAAA,CACL,KAAK,GAAA,CACD,OAAA,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CACvB,IAAA,CAAK,OAAA,CAAU,KAAA,CACf,IAAA,CAAK,SAAA,CAAY,EACV,MAAA,CACX,KAAK,GAAA,CACL,KAAK,GAAA,CAED,OAAA,MAAO,KAAK,SAAA,CAAU,CAAC,CAAA,CAChB,KAAA,CACX,KAAK,GAAA,CACD,aAAO,IAAA,CAAK,SAAA,CAAU8gB,EAAe,CAAA,CAC9B,KAAA,CACX,KAAK,IACL,KAAK,GAAA,CACD,OAAO,MAAO,IAAA,CAAK,iBAAA,GACvB,KAAK,GAAA,CACL,KAAK,GAAA,CACD,OAAA9gB,CAAAA,EAAK,MAAO,IAAA,CAAK,sBAAA,EAAuB,CACxCA,CAAAA,EAAK,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,CAChC,MAAO,IAAA,CAAK,SAAA,CAAU8D,CAAAA,CAAK,MAAA,CAAS9D,CAAC,CAAA,CACrC,MAAO,IAAA,CAAK,WAAA,EAAY,CACjB,MAAO,KAAK,gBAAA,EAAiB,CACxC,QACI,OAAO,MAAO,IAAA,CAAK,kBAC3B,CACJ,CACA,CAAC,mBAAA,EAAsB,CACnB,IAAI2c,CAAAA,CAAIyE,CAAAA,CACJnY,CAAAA,CAAS,EAAA,CACb,GACI0T,CAAAA,CAAK,MAAO,IAAA,CAAK,WAAA,EAAY,CACzBA,CAAAA,CAAK,CAAA,EACLyE,CAAAA,CAAK,MAAO,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,CACjC,IAAA,CAAK,WAAA,CAAcnY,EAASmY,CAAAA,EAG5BA,CAAAA,CAAK,CAAA,CAETA,CAAAA,EAAM,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,CAAA,MAC5BzE,CAAAA,CAAKyE,CAAAA,CAAK,CAAA,EACnB,IAAMtd,CAAAA,CAAO,KAAK,OAAA,EAAQ,CAC1B,GAAIA,CAAAA,GAAS,IAAA,CACT,OAAO,KAAK,OAAA,CAAQ,MAAM,CAAA,CAC9B,GAAA,CAAKmF,CAAAA,GAAW,EAAA,EAAMA,EAAS,IAAA,CAAK,UAAA,EAAcnF,CAAAA,CAAK,CAAC,CAAA,GAAM,GAAA,EACzDmF,IAAW,CAAA,GACPnF,CAAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAKA,CAAAA,CAAK,WAAW,KAAK,CAAA,CAAA,EAChD2c,EAAAA,CAAQ3c,CAAAA,CAAK,CAAC,CAAC,IAOf,EAHoBmF,CAAAA,GAAW,IAAA,CAAK,UAAA,CAAa,CAAA,EACjD,IAAA,CAAK,YAAc,CAAA,GAClBnF,CAAAA,CAAK,CAAC,CAAA,GAAM,GAAA,EAAOA,CAAAA,CAAK,CAAC,CAAA,GAAM,GAAA,CAAA,CAAA,CAGhC,OAAA,IAAA,CAAK,SAAA,CAAY,CAAA,CACjB,MAAMyc,EAAAA,CACC,MAAO,IAAA,CAAK,cAAA,EAAe,CAG1C,IAAIvgB,CAAAA,CAAI,CAAA,CACR,KAAO8D,CAAAA,CAAK9D,CAAC,CAAA,GAAM,GAAA,EACfA,CAAAA,EAAK,MAAO,KAAK,SAAA,CAAU,CAAC,CAAA,CAC5BA,CAAAA,EAAK,MAAO,IAAA,CAAK,WAAW,IAAI,CAAA,CAChC,IAAA,CAAK,OAAA,CAAU,KAAA,CAGnB,OADAA,GAAK,MAAO,IAAA,CAAK,cAAA,EAAe,CACxB8D,CAAAA,CAAK9D,CAAC,GACV,KAAK,MAAA,CACD,OAAO,MAAA,CACX,KAAK,IACD,OAAA,MAAO,IAAA,CAAK,SAAA,CAAU8D,CAAAA,CAAK,MAAA,CAAS9D,CAAC,CAAA,CAC9B,MAAA,CACX,KAAK,GAAA,CACL,KAAK,GAAA,CACD,OAAA,MAAO,IAAA,CAAK,UAAU,CAAC,CAAA,CACvB,IAAA,CAAK,OAAA,CAAU,KAAA,CACf,IAAA,CAAK,WAAa,CAAA,CACX,MAAA,CACX,KAAK,GAAA,CACL,KAAK,GAAA,CACD,aAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CACvB,IAAA,CAAK,OAAA,CAAU,KACf,IAAA,CAAK,SAAA,EAAa,CAAA,CACX,IAAA,CAAK,SAAA,CAAY,MAAA,CAAS,MACrC,KAAK,GAAA,CACD,OAAA,MAAO,IAAA,CAAK,SAAA,CAAU8gB,EAAe,EAC9B,MAAA,CACX,KAAK,GAAA,CACL,KAAK,GAAA,CACD,OAAA,IAAA,CAAK,QAAU,IAAA,CACR,MAAO,IAAA,CAAK,iBAAA,EAAkB,CACzC,KAAK,GAAA,CAAK,CACN,IAAMvW,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,CAC1B,GAAI,IAAA,CAAK,OAAA,EAAWkW,EAAAA,CAAQlW,CAAI,CAAA,EAAKA,CAAAA,GAAS,IAC1C,OAAA,IAAA,CAAK,OAAA,CAAU,KAAA,CACf,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CACvB,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,CAAA,CACpB,MAEf,CAEA,QACI,OAAA,IAAA,CAAK,OAAA,CAAU,KAAA,CACR,MAAO,KAAK,gBAAA,EAC3B,CACJ,CACA,CAAC,iBAAA,EAAoB,CACjB,IAAMgX,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,CACvB1kB,EAAM,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ0kB,CAAAA,CAAO,IAAA,CAAK,GAAA,CAAM,CAAC,CAAA,CACjD,GAAIA,CAAAA,GAAU,GAAA,CACV,KAAO1kB,CAAAA,GAAQ,EAAA,EAAM,KAAK,MAAA,CAAOA,CAAAA,CAAM,CAAC,CAAA,GAAM,GAAA,EAC1CA,CAAAA,CAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAKA,CAAAA,CAAM,CAAC,CAAA,CAAA,UAInCA,CAAAA,GAAQ,EAAA,EAAI,CACf,IAAImD,CAAAA,CAAI,CAAA,CACR,KAAO,IAAA,CAAK,MAAA,CAAOnD,CAAAA,CAAM,CAAA,CAAImD,CAAC,CAAA,GAAM,MAChCA,CAAAA,EAAK,CAAA,CACT,GAAIA,CAAAA,CAAI,CAAA,GAAM,CAAA,CACV,MACJnD,CAAAA,CAAM,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAKA,CAAAA,CAAM,CAAC,EAC1C,CAGJ,IAAM2kB,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,CAAA,CAAG3kB,CAAG,CAAA,CACnC8f,CAAAA,CAAK6E,CAAAA,CAAG,OAAA,CAAQ;AAAA,CAAA,CAAM,IAAA,CAAK,GAAG,CAAA,CAClC,GAAI7E,CAAAA,GAAO,GAAI,CACX,KAAOA,CAAAA,GAAO,EAAA,EAAI,CACd,IAAM1N,EAAK,IAAA,CAAK,cAAA,CAAe0N,CAAAA,CAAK,CAAC,CAAA,CACrC,GAAI1N,IAAO,EAAA,CACP,MACJ0N,CAAAA,CAAK6E,CAAAA,CAAG,OAAA,CAAQ;AAAA,CAAA,CAAMvS,CAAE,EAC5B,CACI0N,CAAAA,GAAO,EAAA,GAEP9f,CAAAA,CAAM8f,CAAAA,EAAM6E,CAAAA,CAAG7E,CAAAA,CAAK,CAAC,CAAA,GAAM,IAAA,CAAO,CAAA,CAAI,CAAA,CAAA,EAE9C,CACA,GAAI9f,CAAAA,GAAQ,EAAA,CAAI,CACZ,GAAI,CAAC,IAAA,CAAK,KAAA,CACN,OAAO,IAAA,CAAK,OAAA,CAAQ,eAAe,CAAA,CACvCA,EAAM,IAAA,CAAK,MAAA,CAAO,OACtB,CACA,OAAA,MAAO,IAAA,CAAK,WAAA,CAAYA,CAAAA,CAAM,CAAA,CAAG,KAAK,CAAA,CAC/B,IAAA,CAAK,SAAA,CAAY,MAAA,CAAS,KACrC,CACA,CAAC,sBAAA,EAAyB,CACtB,IAAA,CAAK,iBAAA,CAAoB,EAAA,CACzB,IAAA,CAAK,eAAA,CAAkB,KAAA,CACvB,IAAII,CAAAA,CAAI,IAAA,CAAK,GAAA,CACb,OAAa,CACT,IAAMsG,CAAAA,CAAK,KAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CAC1B,GAAIsG,CAAAA,GAAO,GAAA,CACP,IAAA,CAAK,eAAA,CAAkB,IAAA,CAAA,KAAA,GAClBA,CAAAA,CAAK,GAAA,EAAOA,CAAAA,EAAM,GAAA,CACvB,IAAA,CAAK,iBAAA,CAAoB,MAAA,CAAOA,CAAE,CAAA,CAAI,CAAA,CAAA,KAAA,GACjCA,CAAAA,GAAO,GAAA,CACZ,KACR,CACA,OAAO,MAAO,IAAA,CAAK,SAAA,CAAUA,CAAAA,EAAMkd,EAAAA,CAAQld,CAAE,CAAA,EAAKA,IAAO,GAAG,CAChE,CACA,CAAC,gBAAA,EAAmB,CAChB,IAAIoZ,CAAAA,CAAK,IAAA,CAAK,GAAA,CAAM,CAAA,CAChB1T,CAAAA,CAAS,CAAA,CACT1F,CAAAA,CACJyY,CAAAA,CAAM,IAAA,IAAS/e,EAAI,IAAA,CAAK,GAAA,CAAMsG,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAOtG,CAAC,CAAA,CAAI,EAAEA,CAAAA,CAClD,OAAQsG,CAAAA,EACJ,KAAK,GAAA,CACD0F,CAAAA,EAAU,CAAA,CACV,MACJ,KAAK;AAAA,CAAA,CACD0T,CAAAA,CAAK1f,CAAAA,CACLgM,CAAAA,CAAS,CAAA,CACT,MACJ,KAAK,IAAA,CAAM,CACP,IAAMsB,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAOtN,CAAAA,CAAI,CAAC,CAAA,CAC9B,GAAI,CAACsN,CAAAA,EAAQ,CAAC,IAAA,CAAK,KAAA,CACf,OAAO,IAAA,CAAK,OAAA,CAAQ,cAAc,CAAA,CACtC,GAAIA,CAAAA,GAAS;AAAA,CAAA,CACT,KACR,CACA,QACI,MAAMyR,CACd,CAEJ,GAAI,CAACzY,CAAAA,EAAM,CAAC,IAAA,CAAK,KAAA,CACb,OAAO,IAAA,CAAK,OAAA,CAAQ,cAAc,CAAA,CACtC,GAAI0F,CAAAA,EAAU,IAAA,CAAK,UAAA,CAAY,CACvB,IAAA,CAAK,iBAAA,GAAsB,EAAA,CAC3B,IAAA,CAAK,UAAA,CAAaA,EAElB,IAAA,CAAK,UAAA,CACD,IAAA,CAAK,iBAAA,EAAqB,IAAA,CAAK,UAAA,GAAe,EAAI,CAAA,CAAI,IAAA,CAAK,UAAA,CAAA,CAEnE,EAAG,CACC,IAAMgG,EAAK,IAAA,CAAK,cAAA,CAAe0N,CAAAA,CAAK,CAAC,CAAA,CACrC,GAAI1N,CAAAA,GAAO,EAAA,CACP,MACJ0N,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ;AAAA,CAAA,CAAM1N,CAAE,EACrC,CAAA,MAAS0N,CAAAA,GAAO,EAAA,EAChB,GAAIA,CAAAA,GAAO,EAAA,CAAI,CACX,GAAI,CAAC,IAAA,CAAK,MACN,OAAO,IAAA,CAAK,OAAA,CAAQ,cAAc,CAAA,CACtCA,CAAAA,CAAK,KAAK,MAAA,CAAO,OACrB,CACJ,CAGA,IAAI1f,CAAAA,CAAI0f,EAAK,CAAA,CAEb,IADApZ,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAOtG,CAAC,EACXsG,CAAAA,GAAO,GAAA,EACVA,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CACxB,GAAIsG,CAAAA,GAAO,GAAA,CAAM,CACb,KAAOA,CAAAA,GAAO,GAAA,EAAQA,CAAAA,GAAO,GAAA,EAAOA,CAAAA,GAAO,IAAA,EAAQA,CAAAA,GAAO;AAAA,CAAA,EACtDA,CAAAA,CAAK,KAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CACxB0f,CAAAA,CAAK1f,EAAI,EACb,CAAA,KAAA,GACS,CAAC,IAAA,CAAK,eAAA,CACX,EAAG,CACC,IAAIA,EAAI0f,CAAAA,CAAK,CAAA,CACTpZ,EAAK,IAAA,CAAK,MAAA,CAAOtG,CAAC,CAAA,CAClBsG,CAAAA,GAAO,OACPA,CAAAA,CAAK,IAAA,CAAK,OAAO,EAAEtG,CAAC,GACxB,IAAMwkB,CAAAA,CAAWxkB,EACjB,KAAOsG,CAAAA,GAAO,KACVA,CAAAA,CAAK,IAAA,CAAK,OAAO,EAAEtG,CAAC,CAAA,CACxB,GAAIsG,CAAAA,GAAO;AAAA,CAAA,EAAQtG,GAAK,IAAA,CAAK,GAAA,EAAOA,EAAI,CAAA,CAAIgM,CAAAA,CAASwY,EACjD9E,CAAAA,CAAK1f,CAAAA,CAAAA,UAGb,CAAA,MAAS,IAAA,EAEb,aAAMoE,EAAAA,CACN,MAAO,KAAK,WAAA,CAAYsb,CAAAA,CAAK,EAAG,IAAI,CAAA,CAC7B,MAAO,IAAA,CAAK,gBACvB,CACA,CAAC,gBAAA,EAAmB,CAChB,IAAM1P,CAAAA,CAAS,IAAA,CAAK,UAAY,CAAA,CAC5BpQ,CAAAA,CAAM,KAAK,GAAA,CAAM,CAAA,CACjB,EAAI,IAAA,CAAK,GAAA,CAAM,EACf0G,CAAAA,CACJ,KAAQA,CAAAA,CAAK,IAAA,CAAK,OAAO,EAAE,CAAC,GACxB,GAAIA,CAAAA,GAAO,IAAK,CACZ,IAAMgH,EAAO,IAAA,CAAK,MAAA,CAAO,EAAI,CAAC,CAAA,CAC9B,GAAIkW,EAAAA,CAAQlW,CAAI,GAAM0C,CAAAA,EAAU2T,EAAAA,CAAmB,GAAA,CAAIrW,CAAI,EACvD,MACJ1N,CAAAA,CAAM,EACV,CAAA,KAAA,GACS4jB,EAAAA,CAAQld,CAAE,CAAA,CAAG,CAClB,IAAIgH,CAAAA,CAAO,IAAA,CAAK,OAAO,CAAA,CAAI,CAAC,EAU5B,GATIhH,CAAAA,GAAO,OACHgH,CAAAA,GAAS;AAAA,CAAA,EACT,CAAA,EAAK,EACLhH,CAAAA,CAAK;AAAA,CAAA,CACLgH,EAAO,IAAA,CAAK,MAAA,CAAO,CAAA,CAAI,CAAC,GAGxB1N,CAAAA,CAAM,CAAA,CAAA,CAEV0N,CAAAA,GAAS,GAAA,EAAQ0C,GAAU2T,EAAAA,CAAmB,GAAA,CAAIrW,CAAI,CAAA,CACtD,MACJ,GAAIhH,CAAAA,GAAO;AAAA,CAAA,CAAM,CACb,IAAM0L,CAAAA,CAAK,IAAA,CAAK,cAAA,CAAe,EAAI,CAAC,CAAA,CACpC,GAAIA,CAAAA,GAAO,GACP,MACJ,CAAA,CAAI,IAAA,CAAK,GAAA,CAAI,EAAGA,CAAAA,CAAK,CAAC,EAC1B,CACJ,MACK,CACD,GAAIhC,CAAAA,EAAU2T,EAAAA,CAAmB,IAAIrd,CAAE,CAAA,CACnC,MACJ1G,CAAAA,CAAM,EACV,CAEJ,OAAI,CAAC0G,CAAAA,EAAM,CAAC,IAAA,CAAK,KAAA,CACN,IAAA,CAAK,OAAA,CAAQ,cAAc,CAAA,EACtC,MAAMlC,EAAAA,CACN,MAAO,KAAK,WAAA,CAAYxE,CAAAA,CAAM,CAAA,CAAG,IAAI,EAC9BoQ,CAAAA,CAAS,MAAA,CAAS,KAAA,CAC7B,CACA,CAAC,SAAA,CAAUjN,CAAAA,CAAG,CACV,OAAIA,EAAI,CAAA,EACJ,MAAM,IAAA,CAAK,MAAA,CAAO,OAAO,IAAA,CAAK,GAAA,CAAKA,CAAC,CAAA,CACpC,KAAK,GAAA,EAAOA,CAAAA,CACLA,CAAAA,EAEJ,CACX,CACA,CAAC,WAAA,CAAY/C,CAAAA,CAAGykB,CAAAA,CAAY,CACxB,IAAMtN,CAAAA,CAAI,IAAA,CAAK,MAAA,CAAO,MAAM,IAAA,CAAK,GAAA,CAAKnX,CAAC,CAAA,CACvC,OAAImX,CAAAA,EACA,MAAMA,CAAAA,CACN,IAAA,CAAK,KAAOA,CAAAA,CAAE,MAAA,CACPA,CAAAA,CAAE,MAAA,GAEJsN,IACL,MAAM,EAAA,CAAA,CACH,CAAA,CACX,CACA,CAAC,cAAA,EAAiB,CACd,OAAQ,IAAA,CAAK,OAAO,CAAC,CAAA,EACjB,KAAK,IACD,OAAA,CAAS,MAAO,IAAA,CAAK,OAAA,KAChB,MAAO,IAAA,CAAK,UAAA,CAAW,IAAI,IAC3B,MAAO,IAAA,CAAK,cAAA,EAAe,CAAA,CACpC,KAAK,GAAA,CACD,OAAA,CAAS,MAAO,IAAA,CAAK,UAAUZ,EAAe,CAAA,GACzC,MAAO,IAAA,CAAK,WAAW,IAAI,CAAA,CAAA,EAC3B,MAAO,IAAA,CAAK,gBAAe,CAAA,CACpC,KAAK,GAAA,CACL,KAAK,IACL,KAAK,GAAA,CAAK,CACN,IAAM7T,CAAAA,CAAS,KAAK,SAAA,CAAY,CAAA,CAC1BqU,CAAAA,CAAM,IAAA,CAAK,OAAO,CAAC,CAAA,CACzB,GAAIb,EAAAA,CAAQa,CAAG,CAAA,EAAMrU,CAAAA,EAAU2T,EAAAA,CAAmB,GAAA,CAAIU,CAAG,CAAA,CACrD,OAAKrU,CAAAA,CAEI,IAAA,CAAK,UACV,IAAA,CAAK,OAAA,CAAU,KAAA,CAAA,CAFf,IAAA,CAAK,WAAa,IAAA,CAAK,WAAA,CAAc,CAAA,CAAA,CAGhC,MAAO,KAAK,SAAA,CAAU,CAAC,CAAA,GAC3B,MAAO,KAAK,UAAA,CAAW,IAAI,CAAA,CAAA,EAC3B,MAAO,KAAK,cAAA,EAAe,CAExC,CACJ,CACA,OAAO,CACX,CACA,CAAC,OAAA,EAAU,CACP,GAAI,IAAA,CAAK,MAAA,CAAO,CAAC,IAAM,GAAA,CAAK,CACxB,IAAIhQ,CAAAA,CAAI,KAAK,GAAA,CAAM,CAAA,CACfsG,CAAAA,CAAK,IAAA,CAAK,OAAOtG,CAAC,CAAA,CACtB,KAAO,CAACwjB,GAAQld,CAAE,CAAA,EAAKA,CAAAA,GAAO,GAAA,EAC1BA,EAAK,IAAA,CAAK,MAAA,CAAO,EAAEtG,CAAC,EACxB,OAAO,MAAO,IAAA,CAAK,WAAA,CAAYsG,IAAO,GAAA,CAAMtG,CAAAA,CAAI,CAAA,CAAIA,CAAAA,CAAG,KAAK,CAChE,CAAA,KACK,CACD,IAAIA,EAAI,IAAA,CAAK,GAAA,CAAM,CAAA,CACfsG,CAAAA,CAAK,KAAK,MAAA,CAAOtG,CAAC,CAAA,CACtB,KAAOsG,GACH,GAAIod,EAAAA,CAAS,GAAA,CAAIpd,CAAE,EACfA,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CAAA,KAAA,GACfsG,CAAAA,GAAO,GAAA,EACZmd,EAAAA,CAAU,IAAI,IAAA,CAAK,MAAA,CAAOzjB,CAAAA,CAAI,CAAC,CAAC,CAAA,EAChCyjB,EAAAA,CAAU,GAAA,CAAI,IAAA,CAAK,OAAOzjB,CAAAA,CAAI,CAAC,CAAC,CAAA,CAChCsG,EAAK,IAAA,CAAK,MAAA,CAAQtG,CAAAA,EAAK,CAAE,OAGzB,MAER,OAAO,MAAO,IAAA,CAAK,YAAYA,CAAAA,CAAG,KAAK,CAC3C,CACJ,CACA,CAAC,WAAA,EAAc,CACX,IAAMsG,EAAK,IAAA,CAAK,MAAA,CAAO,KAAK,GAAG,CAAA,CAC/B,OAAIA,CAAAA,GAAO;AAAA,CAAA,CACA,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CACzBA,IAAO,IAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,GAAM;AAAA,CAAA,CAChC,MAAO,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,CAEvB,CACf,CACA,CAAC,UAAA,CAAWoe,CAAAA,CAAW,CACnB,IAAI1kB,CAAAA,CAAI,IAAA,CAAK,IAAM,CAAA,CACfsG,CAAAA,CACJ,GACIA,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CAAA,MACfsG,CAAAA,GAAO,KAAQoe,CAAAA,EAAape,CAAAA,GAAO,KAC5C,IAAMvD,CAAAA,CAAI/C,CAAAA,CAAI,IAAA,CAAK,IACnB,OAAI+C,CAAAA,CAAI,IACJ,MAAM,IAAA,CAAK,OAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAKA,CAAC,EACpC,IAAA,CAAK,GAAA,CAAM/C,GAER+C,CACX,CACA,CAAC,SAAA,CAAUkN,CAAAA,CAAM,CACb,IAAIjQ,EAAI,IAAA,CAAK,GAAA,CACTsG,EAAK,IAAA,CAAK,MAAA,CAAOtG,CAAC,CAAA,CACtB,KAAO,CAACiQ,CAAAA,CAAK3J,CAAE,CAAA,EACXA,CAAAA,CAAK,KAAK,MAAA,CAAO,EAAEtG,CAAC,CAAA,CACxB,OAAO,MAAO,IAAA,CAAK,WAAA,CAAYA,EAAG,KAAK,CAC3C,CACJ,CAAA,CCrsBA,IAAM2kB,GAAN,KAAkB,CACd,WAAA,EAAc,CACV,KAAK,UAAA,CAAa,GAKlB,IAAA,CAAK,UAAA,CAAc5kB,GAAW,IAAA,CAAK,UAAA,CAAW,IAAA,CAAKA,CAAM,EAMzD,IAAA,CAAK,OAAA,CAAWA,GAAW,CACvB,IAAI6kB,EAAM,CAAA,CACNC,CAAAA,CAAO,IAAA,CAAK,UAAA,CAAW,OAC3B,KAAOD,CAAAA,CAAMC,GAAM,CACf,IAAMC,EAAOF,CAAAA,CAAMC,CAAAA,EAAS,CAAA,CACxB,IAAA,CAAK,WAAWC,CAAG,CAAA,CAAI/kB,EACvB6kB,CAAAA,CAAME,CAAAA,CAAM,EAEZD,CAAAA,CAAOC,EACf,CACA,GAAI,KAAK,UAAA,CAAWF,CAAG,IAAM7kB,CAAAA,CACzB,OAAO,CAAE,IAAA,CAAM6kB,CAAAA,CAAM,CAAA,CAAG,GAAA,CAAK,CAAE,CAAA,CACnC,GAAIA,IAAQ,CAAA,CACR,OAAO,CAAE,IAAA,CAAM,CAAA,CAAG,GAAA,CAAK7kB,CAAO,EAClC,IAAMJ,CAAAA,CAAQ,KAAK,UAAA,CAAWilB,CAAAA,CAAM,CAAC,CAAA,CACrC,OAAO,CAAE,IAAA,CAAMA,CAAAA,CAAK,IAAK7kB,CAAAA,CAASJ,CAAAA,CAAQ,CAAE,CAChD,EACJ,CACJ,CAAA,CCjCA,SAASolB,EAAAA,CAAcC,CAAAA,CAAMvhB,EAAM,CAC/B,IAAA,IAASzD,EAAI,CAAA,CAAGA,CAAAA,CAAIglB,EAAK,MAAA,CAAQ,EAAEhlB,CAAAA,CAC/B,GAAIglB,EAAKhlB,CAAC,CAAA,CAAE,OAASyD,CAAAA,CACjB,OAAO,MACf,OAAO,MACX,CACA,SAASwhB,GAAkBD,CAAAA,CAAM,CAC7B,QAAShlB,CAAAA,CAAI,CAAA,CAAGA,EAAIglB,CAAAA,CAAK,MAAA,CAAQ,EAAEhlB,CAAAA,CAC/B,OAAQglB,CAAAA,CAAKhlB,CAAC,EAAE,IAAA,EACZ,KAAK,OAAA,CACL,KAAK,SAAA,CACL,KAAK,UACD,MACJ,QACI,OAAOA,CACf,CAEJ,OAAO,GACX,CACA,SAASklB,EAAAA,CAAYrI,EAAO,CACxB,OAAQA,GAAO,IAAA,EACX,KAAK,OAAA,CACL,KAAK,QAAA,CACL,KAAK,uBACL,KAAK,sBAAA,CACL,KAAK,iBAAA,CACD,OAAO,MACX,QACI,OAAO,MACf,CACJ,CACA,SAASsI,EAAAA,CAAalf,CAAAA,CAAQ,CAC1B,OAAQA,CAAAA,CAAO,MACX,KAAK,UAAA,CACD,OAAOA,EAAO,KAAA,CAClB,KAAK,YAAa,CACd,IAAMuF,EAAKvF,CAAAA,CAAO,KAAA,CAAMA,CAAAA,CAAO,KAAA,CAAM,OAAS,CAAC,CAAA,CAC/C,OAAOuF,CAAAA,CAAG,GAAA,EAAOA,EAAG,KACxB,CACA,KAAK,WAAA,CACD,OAAOvF,CAAAA,CAAO,KAAA,CAAMA,EAAO,KAAA,CAAM,MAAA,CAAS,CAAC,CAAA,CAAE,KAAA,CAEjD,QACI,OAAO,EACf,CACJ,CAEA,SAASmf,EAAAA,CAAsBnY,EAAM,CACjC,GAAIA,CAAAA,CAAK,MAAA,GAAW,EAChB,OAAO,GACX,IAAIjN,CAAAA,CAAIiN,EAAK,MAAA,CACb8R,CAAAA,CAAM,KAAO,EAAE/e,GAAK,CAAA,EAChB,OAAQiN,EAAKjN,CAAC,CAAA,CAAE,MACZ,KAAK,WAAA,CACL,KAAK,mBACL,KAAK,eAAA,CACL,KAAK,cAAA,CACL,KAAK,UACD,MAAM+e,CACd,CAEJ,KAAO9R,CAAAA,CAAK,EAAEjN,CAAC,CAAA,EAAG,OAAS,OAAA,EAAS,CAGpC,OAAOiN,CAAAA,CAAK,MAAA,CAAOjN,CAAAA,CAAGiN,CAAAA,CAAK,MAAM,CACrC,CACA,SAASoY,EAAAA,CAAgBlI,CAAAA,CAAI,CACzB,GAAIA,CAAAA,CAAG,KAAA,CAAM,IAAA,GAAS,iBAClB,IAAA,IAAW3R,CAAAA,IAAM2R,EAAG,KAAA,CACZ3R,CAAAA,CAAG,KACH,CAACA,CAAAA,CAAG,KAAA,EACJ,CAACuZ,GAAcvZ,CAAAA,CAAG,KAAA,CAAO,kBAAkB,CAAA,EAC3C,CAACuZ,GAAcvZ,CAAAA,CAAG,GAAA,CAAK,eAAe,CAAA,GAClCA,EAAG,GAAA,GACHA,CAAAA,CAAG,MAAQA,CAAAA,CAAG,GAAA,CAAA,CAClB,OAAOA,CAAAA,CAAG,GAAA,CACN0Z,EAAAA,CAAY1Z,CAAAA,CAAG,KAAK,CAAA,CAChBA,CAAAA,CAAG,MAAM,GAAA,CACT,KAAA,CAAM,UAAU,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAG,KAAA,CAAM,IAAKA,CAAAA,CAAG,GAAG,EAE/CA,CAAAA,CAAG,KAAA,CAAM,IAAMA,CAAAA,CAAG,GAAA,CAGtB,KAAA,CAAM,SAAA,CAAU,KAAK,KAAA,CAAMA,CAAAA,CAAG,MAAOA,CAAAA,CAAG,GAAG,EAC/C,OAAOA,CAAAA,CAAG,KAI1B,CA4BA,IAAM8Z,GAAN,KAAa,CAKT,YAAYC,CAAAA,CAAW,CAEnB,KAAK,SAAA,CAAY,IAAA,CAEjB,IAAA,CAAK,QAAA,CAAW,MAEhB,IAAA,CAAK,MAAA,CAAS,EAEd,IAAA,CAAK,MAAA,CAAS,EAEd,IAAA,CAAK,SAAA,CAAY,KAAA,CAEjB,IAAA,CAAK,MAAQ,EAAC,CAEd,KAAK,MAAA,CAAS,EAAA,CAEd,KAAK,IAAA,CAAO,EAAA,CAEZ,IAAA,CAAK,KAAA,CAAQ,IAAIzB,EAAAA,CACjB,IAAA,CAAK,UAAYyB,EACrB,CASA,CAAC,KAAA,CAAMle,CAAAA,CAAQ0c,CAAAA,CAAa,KAAA,CAAO,CAC3B,IAAA,CAAK,SAAA,EAAa,KAAK,MAAA,GAAW,CAAA,EAClC,KAAK,SAAA,CAAU,CAAC,CAAA,CACpB,IAAA,IAAWyB,KAAU,IAAA,CAAK,KAAA,CAAM,IAAIne,CAAAA,CAAQ0c,CAAU,EAClD,MAAO,IAAA,CAAK,IAAA,CAAKyB,CAAM,EACtBzB,CAAAA,GACD,MAAO,KAAK,GAAA,EAAI,EACxB,CAIA,CAAC,IAAA,CAAK1c,CAAAA,CAAQ,CAEV,GADA,IAAA,CAAK,MAAA,CAASA,EACV,IAAA,CAAK,QAAA,CAAU,CACf,IAAA,CAAK,QAAA,CAAW,MAChB,MAAO,IAAA,CAAK,MAAK,CACjB,IAAA,CAAK,QAAUA,CAAAA,CAAO,MAAA,CACtB,MACJ,CACA,IAAM5D,CAAAA,CAAO8f,EAAAA,CAAUlc,CAAM,CAAA,CAC7B,GAAK5D,EAKA,GAAIA,CAAAA,GAAS,SACd,IAAA,CAAK,SAAA,CAAY,KAAA,CACjB,IAAA,CAAK,SAAW,IAAA,CAChB,IAAA,CAAK,KAAO,QAAA,CAAA,KAEX,CAGD,OAFA,IAAA,CAAK,IAAA,CAAOA,CAAAA,CACZ,MAAO,KAAK,IAAA,EAAK,CACTA,GACJ,KAAK,UACD,IAAA,CAAK,SAAA,CAAY,IAAA,CACjB,IAAA,CAAK,OAAS,CAAA,CACV,IAAA,CAAK,WACL,IAAA,CAAK,SAAA,CAAU,KAAK,MAAA,CAAS4D,CAAAA,CAAO,MAAM,CAAA,CAC9C,MACJ,KAAK,OAAA,CACG,KAAK,SAAA,EAAaA,CAAAA,CAAO,CAAC,CAAA,GAAM,GAAA,GAChC,IAAA,CAAK,MAAA,EAAUA,EAAO,MAAA,CAAA,CAC1B,MACJ,KAAK,kBAAA,CACL,KAAK,gBACL,KAAK,cAAA,CACG,IAAA,CAAK,SAAA,GACL,KAAK,MAAA,EAAUA,CAAAA,CAAO,QAC1B,MACJ,KAAK,WACL,KAAK,gBAAA,CACD,OACJ,QACI,IAAA,CAAK,UAAY,MACzB,CACA,KAAK,MAAA,EAAUA,CAAAA,CAAO,OAC1B,CAAA,KArCW,CACP,IAAMhI,CAAAA,CAAU,qBAAqBgI,CAAM,CAAA,CAAA,CAC3C,MAAO,IAAA,CAAK,GAAA,CAAI,CAAE,IAAA,CAAM,OAAA,CAAS,MAAA,CAAQ,IAAA,CAAK,OAAQ,OAAA,CAAAhI,CAAAA,CAAS,OAAAgI,CAAO,CAAC,EACvE,IAAA,CAAK,MAAA,EAAUA,CAAAA,CAAO,OAC1B,CAkCJ,CAEA,CAAC,KAAM,CACH,KAAO,KAAK,KAAA,CAAM,MAAA,CAAS,GACvB,MAAO,IAAA,CAAK,MACpB,CACA,IAAI,WAAA,EAAc,CAOd,OANW,CACP,IAAA,CAAM,IAAA,CAAK,IAAA,CACX,OAAQ,IAAA,CAAK,MAAA,CACb,OAAQ,IAAA,CAAK,MAAA,CACb,OAAQ,IAAA,CAAK,MACjB,CAEJ,CACA,CAAC,IAAA,EAAO,CACJ,IAAMoe,CAAAA,CAAM,IAAA,CAAK,KAAK,CAAC,CAAA,CACvB,GAAI,IAAA,CAAK,OAAS,SAAA,GAAc,CAACA,GAAOA,CAAAA,CAAI,IAAA,GAAS,WAAY,CAC7D,KAAO,KAAK,KAAA,CAAM,MAAA,CAAS,GACvB,MAAO,IAAA,CAAK,KAAI,CACpB,IAAA,CAAK,MAAM,IAAA,CAAK,CACZ,IAAA,CAAM,SAAA,CACN,OAAQ,IAAA,CAAK,MAAA,CACb,OAAQ,IAAA,CAAK,MACjB,CAAC,CAAA,CACD,MACJ,CACA,GAAI,CAACA,CAAAA,CACD,OAAO,MAAO,IAAA,CAAK,MAAA,GACvB,OAAQA,CAAAA,CAAI,IAAA,EACR,KAAK,UAAA,CACD,OAAO,MAAO,IAAA,CAAK,QAAA,CAASA,CAAG,CAAA,CACnC,KAAK,OAAA,CACL,KAAK,SACL,KAAK,sBAAA,CACL,KAAK,sBAAA,CACD,OAAO,MAAO,IAAA,CAAK,MAAA,CAAOA,CAAG,CAAA,CACjC,KAAK,cAAA,CACD,OAAO,MAAO,IAAA,CAAK,WAAA,CAAYA,CAAG,CAAA,CACtC,KAAK,WAAA,CACD,OAAO,MAAO,IAAA,CAAK,QAAA,CAASA,CAAG,CAAA,CACnC,KAAK,YACD,OAAO,MAAO,IAAA,CAAK,aAAA,CAAcA,CAAG,CAAA,CACxC,KAAK,kBACD,OAAO,MAAO,KAAK,cAAA,CAAeA,CAAG,EACzC,KAAK,SAAA,CACD,OAAO,MAAO,IAAA,CAAK,YAAYA,CAAG,CAC1C,CAEA,MAAO,IAAA,CAAK,GAAA,GAChB,CACA,IAAA,CAAK1iB,CAAAA,CAAG,CACJ,OAAO,IAAA,CAAK,MAAM,IAAA,CAAK,KAAA,CAAM,MAAA,CAASA,CAAC,CAC3C,CACA,CAAC,IAAIyE,CAAAA,CAAO,CACR,IAAMqV,CAAAA,CAAQrV,CAAAA,EAAS,IAAA,CAAK,KAAA,CAAM,KAAI,CAEtC,GAAI,CAACqV,CAAAA,CAED,MAAM,CAAE,IAAA,CAAM,OAAA,CAAS,MAAA,CAAQ,IAAA,CAAK,OAAQ,MAAA,CAAQ,EAAA,CAAI,QADxC,6BACgD,CAAA,CAAA,KAAA,GAE3D,KAAK,KAAA,CAAM,MAAA,GAAW,CAAA,CAC3B,MAAMA,OAEL,CACD,IAAM4I,EAAM,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,CAWvB,OAVI5I,CAAAA,CAAM,IAAA,GAAS,eAEfA,CAAAA,CAAM,MAAA,CAAS,WAAY4I,CAAAA,CAAMA,CAAAA,CAAI,OAAS,CAAA,CAEzC5I,CAAAA,CAAM,IAAA,GAAS,iBAAA,EAAqB4I,EAAI,IAAA,GAAS,UAAA,GAEtD5I,EAAM,MAAA,CAAS,CAAA,CAAA,CAEfA,EAAM,IAAA,GAAS,iBAAA,EACfwI,GAAgBxI,CAAK,CAAA,CACjB4I,EAAI,IAAA,EACR,KAAK,UAAA,CACDA,CAAAA,CAAI,MAAQ5I,CAAAA,CACZ,MACJ,KAAK,cAAA,CACD4I,EAAI,KAAA,CAAM,IAAA,CAAK5I,CAAK,CAAA,CACpB,MACJ,KAAK,WAAA,CAAa,CACd,IAAMrR,CAAAA,CAAKia,EAAI,KAAA,CAAMA,CAAAA,CAAI,MAAM,MAAA,CAAS,CAAC,EACzC,GAAIja,CAAAA,CAAG,KAAA,CAAO,CACVia,EAAI,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAO,GAAI,GAAA,CAAK5I,CAAAA,CAAO,GAAA,CAAK,EAAG,CAAC,CAAA,CACjD,KAAK,SAAA,CAAY,IAAA,CACjB,MACJ,CAAA,KAAA,GACSrR,CAAAA,CAAG,GAAA,CACRA,CAAAA,CAAG,MAAQqR,CAAAA,CAAAA,KAEV,CACD,OAAO,MAAA,CAAOrR,CAAAA,CAAI,CAAE,GAAA,CAAKqR,CAAAA,CAAO,GAAA,CAAK,EAAG,CAAC,CAAA,CACzC,KAAK,SAAA,CAAY,CAACrR,EAAG,WAAA,CACrB,MACJ,CACA,KACJ,CACA,KAAK,WAAA,CAAa,CACd,IAAMA,CAAAA,CAAKia,EAAI,KAAA,CAAMA,CAAAA,CAAI,MAAM,MAAA,CAAS,CAAC,EACrCja,CAAAA,CAAG,KAAA,CACHia,EAAI,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAO,EAAC,CAAG,KAAA,CAAO5I,CAAM,CAAC,CAAA,CAE1CrR,EAAG,KAAA,CAAQqR,CAAAA,CACf,KACJ,CACA,KAAK,iBAAA,CAAmB,CACpB,IAAMrR,CAAAA,CAAKia,CAAAA,CAAI,MAAMA,CAAAA,CAAI,KAAA,CAAM,OAAS,CAAC,CAAA,CACrC,CAACja,CAAAA,EAAMA,EAAG,KAAA,CACVia,CAAAA,CAAI,MAAM,IAAA,CAAK,CAAE,MAAO,EAAC,CAAG,IAAK5I,CAAAA,CAAO,GAAA,CAAK,EAAG,CAAC,EAC5CrR,CAAAA,CAAG,GAAA,CACRA,EAAG,KAAA,CAAQqR,CAAAA,CAEX,MAAA,CAAO,MAAA,CAAOrR,EAAI,CAAE,GAAA,CAAKqR,EAAO,GAAA,CAAK,EAAG,CAAC,CAAA,CAC7C,MACJ,CAEA,QACI,MAAO,IAAA,CAAK,KAAI,CAChB,MAAO,KAAK,GAAA,CAAIA,CAAK,EAC7B,CACA,IAAK4I,CAAAA,CAAI,IAAA,GAAS,YACdA,CAAAA,CAAI,IAAA,GAAS,aACbA,CAAAA,CAAI,IAAA,GAAS,eACZ5I,CAAAA,CAAM,IAAA,GAAS,aAAeA,CAAAA,CAAM,IAAA,GAAS,aAAc,CAC5D,IAAME,EAAOF,CAAAA,CAAM,KAAA,CAAMA,CAAAA,CAAM,KAAA,CAAM,OAAS,CAAC,CAAA,CAC3CE,GACA,CAACA,CAAAA,CAAK,KACN,CAACA,CAAAA,CAAK,KAAA,EACNA,CAAAA,CAAK,MAAM,MAAA,CAAS,CAAA,EACpBkI,GAAkBlI,CAAAA,CAAK,KAAK,IAAM,EAAA,GACjCF,CAAAA,CAAM,MAAA,GAAW,CAAA,EACdE,EAAK,KAAA,CAAM,KAAA,CAAME,GAAMA,CAAAA,CAAG,IAAA,GAAS,WAAaA,CAAAA,CAAG,MAAA,CAASJ,CAAAA,CAAM,MAAM,KACxE4I,CAAAA,CAAI,IAAA,GAAS,WACbA,CAAAA,CAAI,GAAA,CAAM1I,EAAK,KAAA,CAEf0I,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAO1I,CAAAA,CAAK,KAAM,CAAC,CAAA,CACxCF,EAAM,KAAA,CAAM,MAAA,CAAO,EAAA,CAAI,CAAC,GAEhC,CACJ,CACJ,CACA,CAAC,MAAA,EAAS,CACN,OAAQ,IAAA,CAAK,IAAA,EACT,KAAK,gBAAA,CACD,MAAM,CAAE,IAAA,CAAM,WAAA,CAAa,OAAQ,IAAA,CAAK,MAAA,CAAQ,OAAQ,IAAA,CAAK,MAAO,EACpE,OACJ,KAAK,kBACL,KAAK,OAAA,CACL,KAAK,SAAA,CACL,KAAK,SAAA,CACD,MAAM,KAAK,WAAA,CACX,OACJ,KAAK,UAAA,CACL,KAAK,YAAa,CACd,IAAMnV,CAAAA,CAAM,CACR,KAAM,UAAA,CACN,MAAA,CAAQ,KAAK,MAAA,CACb,KAAA,CAAO,EACX,CAAA,CACI,IAAA,CAAK,IAAA,GAAS,aACdA,CAAAA,CAAI,KAAA,CAAM,KAAK,IAAA,CAAK,WAAW,EACnC,IAAA,CAAK,KAAA,CAAM,IAAA,CAAKA,CAAG,EACnB,MACJ,CACJ,CACA,MAAM,CACF,KAAM,OAAA,CACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,QAAS,CAAA,WAAA,EAAc,IAAA,CAAK,IAAI,CAAA,qBAAA,CAAA,CAChC,MAAA,CAAQ,KAAK,MACjB,EACJ,CACA,CAAC,SAASA,CAAAA,CAAK,CACX,GAAIA,CAAAA,CAAI,KAAA,CACJ,OAAO,MAAO,IAAA,CAAK,OAAA,CAAQA,CAAG,EAClC,OAAQ,IAAA,CAAK,MACT,KAAK,YAAa,CACVud,EAAAA,CAAkBvd,EAAI,KAAK,CAAA,GAAM,IACjC,MAAO,IAAA,CAAK,KAAI,CAChB,MAAO,KAAK,IAAA,EAAK,EAGjBA,CAAAA,CAAI,KAAA,CAAM,KAAK,IAAA,CAAK,WAAW,EACnC,MACJ,CACA,KAAK,QAAA,CACL,KAAK,KAAA,CACL,KAAK,QACL,KAAK,SAAA,CACL,KAAK,SAAA,CACDA,CAAAA,CAAI,MAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAC/B,MACR,CACA,IAAMge,EAAK,IAAA,CAAK,eAAA,CAAgBhe,CAAG,CAAA,CAC/Bge,CAAAA,CACA,IAAA,CAAK,KAAA,CAAM,KAAKA,CAAE,CAAA,CAElB,MAAM,CACF,IAAA,CAAM,QACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,OAAA,CAAS,cAAc,IAAA,CAAK,IAAI,0BAChC,MAAA,CAAQ,IAAA,CAAK,MACjB,EAER,CACA,CAAC,MAAA,CAAO3F,EAAQ,CACZ,GAAI,KAAK,IAAA,GAAS,eAAA,CAAiB,CAC/B,IAAM9S,CAAAA,CAAOkY,EAAAA,CAAa,IAAA,CAAK,KAAK,CAAC,CAAC,EAChCxlB,CAAAA,CAAQylB,EAAAA,CAAsBnY,CAAI,CAAA,CACpC+Q,CAAAA,CACA+B,EAAO,GAAA,EACP/B,CAAAA,CAAM+B,EAAO,GAAA,CACb/B,CAAAA,CAAI,KAAK,IAAA,CAAK,WAAW,EACzB,OAAO+B,CAAAA,CAAO,GAAA,EAGd/B,CAAAA,CAAM,CAAC,IAAA,CAAK,WAAW,EAC3B,IAAMhT,CAAAA,CAAM,CACR,IAAA,CAAM,WAAA,CACN,MAAA,CAAQ+U,CAAAA,CAAO,OACf,MAAA,CAAQA,CAAAA,CAAO,OACf,KAAA,CAAO,CAAC,CAAE,KAAA,CAAApgB,CAAAA,CAAO,GAAA,CAAKogB,CAAAA,CAAQ,IAAA/B,CAAI,CAAC,CACvC,CAAA,CACA,IAAA,CAAK,UAAY,IAAA,CACjB,IAAA,CAAK,MAAM,IAAA,CAAK,KAAA,CAAM,OAAS,CAAC,CAAA,CAAIhT,EACxC,CAAA,KAEI,MAAO,KAAK,OAAA,CAAQ+U,CAAM,EAClC,CACA,CAAC,WAAA,CAAYA,CAAAA,CAAQ,CACjB,OAAQ,IAAA,CAAK,MACT,KAAK,OAAA,CACL,KAAK,UACL,KAAK,SAAA,CACDA,EAAO,KAAA,CAAM,IAAA,CAAK,KAAK,WAAW,CAAA,CAClC,OACJ,KAAK,SAKD,GAJAA,CAAAA,CAAO,OAAS,IAAA,CAAK,MAAA,CAErB,KAAK,SAAA,CAAY,IAAA,CACjB,KAAK,MAAA,CAAS,CAAA,CACV,KAAK,SAAA,CAAW,CAChB,IAAIL,CAAAA,CAAK,IAAA,CAAK,OAAO,OAAA,CAAQ;AAAA,CAAI,CAAA,CAAI,CAAA,CACrC,KAAOA,CAAAA,GAAO,GACV,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,MAAA,CAASA,CAAE,CAAA,CAC/BA,CAAAA,CAAK,IAAA,CAAK,OAAO,OAAA,CAAQ;AAAA,CAAA,CAAMA,CAAE,CAAA,CAAI,EAE7C,CACA,MAAO,KAAK,GAAA,EAAI,CAChB,MAEJ,QACI,MAAO,IAAA,CAAK,GAAA,GACZ,MAAO,IAAA,CAAK,OACpB,CACJ,CACA,CAAC,SAAS1U,CAAAA,CAAK,CACX,IAAMQ,CAAAA,CAAKR,CAAAA,CAAI,MAAMA,CAAAA,CAAI,KAAA,CAAM,MAAA,CAAS,CAAC,EAEzC,OAAQ,IAAA,CAAK,MACT,KAAK,UAED,GADA,IAAA,CAAK,SAAA,CAAY,KAAA,CACbQ,EAAG,KAAA,CAAO,CACV,IAAM5L,CAAAA,CAAM,QAAS4L,CAAAA,CAAG,KAAA,CAAQA,CAAAA,CAAG,KAAA,CAAM,IAAM,MAAA,CAAA,CAClC,KAAA,CAAM,QAAQ5L,CAAG,CAAA,CAAIA,EAAIA,CAAAA,CAAI,MAAA,CAAS,CAAC,CAAA,CAAI,SAC9C,IAAA,GAAS,SAAA,CACfA,GAAK,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAE1BoL,CAAAA,CAAI,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAO,CAAC,KAAK,WAAW,CAAE,CAAC,EACpD,CAAA,KACSQ,CAAAA,CAAG,GAAA,CACRA,EAAG,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,EAG5BA,CAAAA,CAAG,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAElC,OACJ,KAAK,OAAA,CACL,KAAK,UACD,GAAIA,CAAAA,CAAG,KAAA,CACHR,CAAAA,CAAI,MAAM,IAAA,CAAK,CAAE,MAAO,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAAA,KAAA,GAEvCQ,CAAAA,CAAG,IACRA,CAAAA,CAAG,GAAA,CAAI,KAAK,IAAA,CAAK,WAAW,OAE3B,CACD,GAAI,IAAA,CAAK,iBAAA,CAAkBA,EAAG,KAAA,CAAOR,CAAAA,CAAI,MAAM,CAAA,CAAG,CAE9C,IAAMpL,CAAAA,CADOoL,CAAAA,CAAI,KAAA,CAAMA,EAAI,KAAA,CAAM,MAAA,CAAS,CAAC,CAAA,EACzB,KAAA,EAAO,IACzB,GAAI,KAAA,CAAM,OAAA,CAAQpL,CAAG,EAAG,CACpB,KAAA,CAAM,UAAU,IAAA,CAAK,KAAA,CAAMA,EAAK4L,CAAAA,CAAG,KAAK,CAAA,CACxC5L,CAAAA,CAAI,KAAK,IAAA,CAAK,WAAW,EACzBoL,CAAAA,CAAI,KAAA,CAAM,KAAI,CACd,MACJ,CACJ,CACAQ,EAAG,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,WAAW,EAClC,CACA,MACR,CACA,GAAI,KAAK,MAAA,EAAUR,CAAAA,CAAI,OAAQ,CAC3B,IAAM2a,EAAc,CAAC,IAAA,CAAK,SAAA,EAAa,IAAA,CAAK,SAAW3a,CAAAA,CAAI,MAAA,CACrD4a,EAAaD,CAAAA,GACdna,CAAAA,CAAG,KAAOA,CAAAA,CAAG,WAAA,CAAA,EACd,IAAA,CAAK,IAAA,GAAS,eAEd7L,CAAAA,CAAQ,GACZ,GAAIimB,CAAAA,EAAcpa,EAAG,GAAA,EAAO,CAACA,CAAAA,CAAG,KAAA,CAAO,CACnC,IAAMkU,CAAAA,CAAK,EAAC,CACZ,QAAS1f,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIwL,CAAAA,CAAG,IAAI,MAAA,CAAQ,EAAExL,EAAG,CACpC,IAAMid,EAAKzR,CAAAA,CAAG,GAAA,CAAIxL,CAAC,CAAA,CACnB,OAAQid,CAAAA,CAAG,IAAA,EACP,KAAK,SAAA,CACDyC,EAAG,IAAA,CAAK1f,CAAC,CAAA,CACT,MACJ,KAAK,OAAA,CACD,MACJ,KAAK,SAAA,CACGid,CAAAA,CAAG,OAASjS,CAAAA,CAAI,MAAA,GAChB0U,CAAAA,CAAG,MAAA,CAAS,GAChB,MACJ,QACIA,CAAAA,CAAG,MAAA,CAAS,EACpB,CACJ,CACIA,CAAAA,CAAG,MAAA,EAAU,IACb/f,CAAAA,CAAQ6L,CAAAA,CAAG,IAAI,MAAA,CAAOkU,CAAAA,CAAG,CAAC,CAAC,CAAA,EACnC,CACA,OAAQ,KAAK,IAAA,EACT,KAAK,QAAA,CACL,KAAK,MACGkG,CAAAA,EAAcpa,CAAAA,CAAG,KAAA,EACjB7L,CAAAA,CAAM,KAAK,IAAA,CAAK,WAAW,EAC3BqL,CAAAA,CAAI,KAAA,CAAM,KAAK,CAAE,KAAA,CAAArL,CAAM,CAAC,EACxB,IAAA,CAAK,SAAA,CAAY,MAEZ6L,CAAAA,CAAG,GAAA,CACRA,EAAG,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,EAG5BA,CAAAA,CAAG,KAAA,CAAM,KAAK,IAAA,CAAK,WAAW,EAElC,OACJ,KAAK,kBAAA,CACG,CAACA,EAAG,GAAA,EAAO,CAACA,EAAG,WAAA,EACfA,CAAAA,CAAG,MAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAC9BA,EAAG,WAAA,CAAc,IAAA,EAEZoa,GAAcpa,CAAAA,CAAG,KAAA,EACtB7L,EAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAC3BqL,EAAI,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAArL,EAAO,WAAA,CAAa,IAAK,CAAC,CAAA,EAG3C,KAAK,KAAA,CAAM,IAAA,CAAK,CACZ,IAAA,CAAM,WAAA,CACN,OAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,OACb,KAAA,CAAO,CAAC,CAAE,KAAA,CAAO,CAAC,KAAK,WAAW,CAAA,CAAG,WAAA,CAAa,IAAK,CAAC,CAC5D,CAAC,EAEL,IAAA,CAAK,SAAA,CAAY,KACjB,OACJ,KAAK,eAAA,CACD,GAAI6L,EAAG,WAAA,CACH,GAAKA,CAAAA,CAAG,GAAA,CAcH,GAAIA,CAAAA,CAAG,KAAA,CACRR,CAAAA,CAAI,KAAA,CAAM,KAAK,CAAE,KAAA,CAAO,EAAC,CAAG,GAAA,CAAK,KAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAAA,KAAA,GAE3D+Z,GAAcvZ,CAAAA,CAAG,GAAA,CAAK,eAAe,CAAA,CAC1C,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CACZ,IAAA,CAAM,WAAA,CACN,OAAQ,IAAA,CAAK,MAAA,CACb,OAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,CAAC,CAAE,KAAA,CAAA7L,CAAAA,CAAO,GAAA,CAAK,IAAA,CAAM,IAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CACzD,CAAC,UAEIulB,EAAAA,CAAY1Z,CAAAA,CAAG,GAAG,CAAA,EACvB,CAACuZ,EAAAA,CAAcvZ,CAAAA,CAAG,IAAK,SAAS,CAAA,CAAG,CACnC,IAAM7L,CAAAA,CAAQylB,GAAsB5Z,CAAAA,CAAG,KAAK,CAAA,CACtC/F,CAAAA,CAAM+F,EAAG,GAAA,CACTwS,CAAAA,CAAMxS,EAAG,GAAA,CACfwS,CAAAA,CAAI,KAAK,IAAA,CAAK,WAAW,CAAA,CAEzB,OAAOxS,EAAG,GAAA,CAEV,OAAOA,EAAG,GAAA,CACV,IAAA,CAAK,MAAM,IAAA,CAAK,CACZ,IAAA,CAAM,WAAA,CACN,OAAQ,IAAA,CAAK,MAAA,CACb,OAAQ,IAAA,CAAK,MAAA,CACb,MAAO,CAAC,CAAE,KAAA,CAAA7L,CAAAA,CAAO,IAAA8F,CAAAA,CAAK,GAAA,CAAAuY,CAAI,CAAC,CAC/B,CAAC,EACL,CAAA,KACSre,CAAAA,CAAM,MAAA,CAAS,EAEpB6L,CAAAA,CAAG,GAAA,CAAMA,EAAG,GAAA,CAAI,MAAA,CAAO7L,EAAO,IAAA,CAAK,WAAW,CAAA,CAG9C6L,CAAAA,CAAG,IAAI,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAAA,KAAA,GA9CxBuZ,GAAcvZ,CAAAA,CAAG,KAAA,CAAO,SAAS,CAAA,CACjC,OAAO,MAAA,CAAOA,CAAAA,CAAI,CAAE,GAAA,CAAK,IAAA,CAAM,IAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAAA,KAEvD,CACD,IAAM7L,CAAAA,CAAQylB,EAAAA,CAAsB5Z,EAAG,KAAK,CAAA,CAC5C,IAAA,CAAK,KAAA,CAAM,KAAK,CACZ,IAAA,CAAM,YACN,MAAA,CAAQ,IAAA,CAAK,OACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,CAAC,CAAE,KAAA,CAAA7L,CAAAA,CAAO,GAAA,CAAK,KAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CACzD,CAAC,EACL,CAAA,KAuCC6L,EAAG,GAAA,CAGCA,CAAAA,CAAG,KAAA,EAASoa,CAAAA,CACjB5a,EAAI,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAArL,CAAAA,CAAO,IAAK,IAAA,CAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,EAEvDolB,EAAAA,CAAcvZ,CAAAA,CAAG,IAAK,eAAe,CAAA,CAC1C,IAAA,CAAK,KAAA,CAAM,KAAK,CACZ,IAAA,CAAM,WAAA,CACN,MAAA,CAAQ,KAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAO,CAAC,CAAE,MAAO,EAAC,CAAG,IAAK,IAAA,CAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAC7D,CAAC,CAAA,CAGDA,EAAG,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,EAd5B,MAAA,CAAO,MAAA,CAAOA,EAAI,CAAE,GAAA,CAAK,KAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAiBhE,KAAK,SAAA,CAAY,IAAA,CACjB,OACJ,KAAK,OAAA,CACL,KAAK,QAAA,CACL,KAAK,sBAAA,CACL,KAAK,uBAAwB,CACzB,IAAMqa,EAAK,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAI,EAChCD,CAAAA,EAAcpa,CAAAA,CAAG,OACjBR,CAAAA,CAAI,KAAA,CAAM,KAAK,CAAE,KAAA,CAAArL,CAAAA,CAAO,GAAA,CAAKkmB,EAAI,GAAA,CAAK,EAAG,CAAC,CAAA,CAC1C,KAAK,SAAA,CAAY,IAAA,EAEZra,CAAAA,CAAG,GAAA,CACR,KAAK,KAAA,CAAM,IAAA,CAAKqa,CAAE,CAAA,EAGlB,OAAO,MAAA,CAAOra,CAAAA,CAAI,CAAE,GAAA,CAAKqa,EAAI,GAAA,CAAK,EAAG,CAAC,CAAA,CACtC,KAAK,SAAA,CAAY,IAAA,CAAA,CAErB,MACJ,CACA,QAAS,CACL,IAAMH,EAAK,IAAA,CAAK,eAAA,CAAgB1a,CAAG,CAAA,CACnC,GAAI0a,CAAAA,CAAI,CACJ,GAAIA,CAAAA,CAAG,IAAA,GAAS,aACZ,GAAI,CAACla,EAAG,WAAA,EACJA,CAAAA,CAAG,GAAA,EACH,CAACuZ,GAAcvZ,CAAAA,CAAG,GAAA,CAAK,SAAS,CAAA,CAAG,CACnC,MAAO,IAAA,CAAK,GAAA,CAAI,CACZ,KAAM,OAAA,CACN,MAAA,CAAQ,KAAK,MAAA,CACb,OAAA,CAAS,iDACT,MAAA,CAAQ,IAAA,CAAK,MACjB,CAAC,EACD,MACJ,CAAA,CAAA,KAEKma,GACL3a,CAAAA,CAAI,KAAA,CAAM,KAAK,CAAE,KAAA,CAAArL,CAAM,CAAC,EAE5B,IAAA,CAAK,KAAA,CAAM,KAAK+lB,CAAE,CAAA,CAClB,MACJ,CACJ,CACJ,CACJ,CACA,MAAO,IAAA,CAAK,GAAA,EAAI,CAChB,MAAO,KAAK,IAAA,GAChB,CACA,CAAC,cAAcnQ,CAAAA,CAAK,CAChB,IAAM/J,CAAAA,CAAK+J,CAAAA,CAAI,MAAMA,CAAAA,CAAI,KAAA,CAAM,MAAA,CAAS,CAAC,EACzC,OAAQ,IAAA,CAAK,MACT,KAAK,UACD,GAAI/J,CAAAA,CAAG,KAAA,CAAO,CACV,IAAM5L,CAAAA,CAAM,KAAA,GAAS4L,EAAG,KAAA,CAAQA,CAAAA,CAAG,MAAM,GAAA,CAAM,MAAA,CAAA,CAClC,KAAA,CAAM,OAAA,CAAQ5L,CAAG,CAAA,CAAIA,CAAAA,CAAIA,CAAAA,CAAI,MAAA,CAAS,CAAC,CAAA,CAAI,MAAA,GAC9C,IAAA,GAAS,SAAA,CACfA,GAAK,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAE1B2V,CAAAA,CAAI,MAAM,IAAA,CAAK,CAAE,KAAA,CAAO,CAAC,KAAK,WAAW,CAAE,CAAC,EACpD,CAAA,KAEI/J,EAAG,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,WAAW,EAClC,OACJ,KAAK,QACL,KAAK,SAAA,CACD,GAAIA,CAAAA,CAAG,KAAA,CACH+J,CAAAA,CAAI,KAAA,CAAM,KAAK,CAAE,KAAA,CAAO,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAAA,KAC3C,CACD,GAAI,IAAA,CAAK,iBAAA,CAAkB/J,EAAG,KAAA,CAAO+J,CAAAA,CAAI,MAAM,CAAA,CAAG,CAE9C,IAAM3V,CAAAA,CADO2V,EAAI,KAAA,CAAMA,CAAAA,CAAI,MAAM,MAAA,CAAS,CAAC,GACzB,KAAA,EAAO,GAAA,CACzB,GAAI,KAAA,CAAM,QAAQ3V,CAAG,CAAA,CAAG,CACpB,KAAA,CAAM,SAAA,CAAU,KAAK,KAAA,CAAMA,CAAAA,CAAK4L,CAAAA,CAAG,KAAK,EACxC5L,CAAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,EACzB2V,CAAAA,CAAI,KAAA,CAAM,GAAA,EAAI,CACd,MACJ,CACJ,CACA/J,EAAG,KAAA,CAAM,IAAA,CAAK,KAAK,WAAW,EAClC,CACA,OACJ,KAAK,QAAA,CACL,KAAK,MACD,GAAIA,CAAAA,CAAG,OAAS,IAAA,CAAK,MAAA,EAAU+J,CAAAA,CAAI,MAAA,CAC/B,MACJ/J,CAAAA,CAAG,KAAA,CAAM,KAAK,IAAA,CAAK,WAAW,EAC9B,OACJ,KAAK,cAAA,CACD,GAAI,KAAK,MAAA,GAAW+J,CAAAA,CAAI,MAAA,CACpB,MACA/J,EAAG,KAAA,EAASuZ,EAAAA,CAAcvZ,CAAAA,CAAG,KAAA,CAAO,cAAc,CAAA,CAClD+J,CAAAA,CAAI,MAAM,IAAA,CAAK,CAAE,MAAO,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAE5C/J,CAAAA,CAAG,MAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAClC,MACR,CACA,GAAI,KAAK,MAAA,CAAS+J,CAAAA,CAAI,OAAQ,CAC1B,IAAMmQ,EAAK,IAAA,CAAK,eAAA,CAAgBnQ,CAAG,CAAA,CACnC,GAAImQ,CAAAA,CAAI,CACJ,KAAK,KAAA,CAAM,IAAA,CAAKA,CAAE,CAAA,CAClB,MACJ,CACJ,CACA,MAAO,IAAA,CAAK,GAAA,GACZ,MAAO,IAAA,CAAK,OAChB,CACA,CAAC,cAAA,CAAevI,EAAI,CAChB,IAAM3R,EAAK2R,CAAAA,CAAG,KAAA,CAAMA,EAAG,KAAA,CAAM,MAAA,CAAS,CAAC,CAAA,CACvC,GAAI,IAAA,CAAK,IAAA,GAAS,iBAAkB,CAChC,IAAIsI,EACJ,GACI,MAAO,IAAA,CAAK,GAAA,GACZA,CAAAA,CAAM,IAAA,CAAK,IAAA,CAAK,CAAC,QACZA,CAAAA,EAAOA,CAAAA,CAAI,IAAA,GAAS,iBAAA,CACjC,SACStI,CAAAA,CAAG,GAAA,CAAI,SAAW,CAAA,CAAG,CAC1B,OAAQ,IAAA,CAAK,IAAA,EACT,KAAK,QACL,KAAK,kBAAA,CACG,CAAC3R,CAAAA,EAAMA,CAAAA,CAAG,IACV2R,CAAAA,CAAG,KAAA,CAAM,IAAA,CAAK,CAAE,MAAO,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,EAE3C3R,CAAAA,CAAG,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAClC,OACJ,KAAK,eAAA,CACG,CAACA,CAAAA,EAAMA,CAAAA,CAAG,KAAA,CACV2R,CAAAA,CAAG,MAAM,IAAA,CAAK,CAAE,MAAO,EAAC,CAAG,IAAK,IAAA,CAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,EAC1D3R,CAAAA,CAAG,GAAA,CACRA,EAAG,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,EAE5B,MAAA,CAAO,MAAA,CAAOA,EAAI,CAAE,GAAA,CAAK,KAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CAAA,CAC5D,OACJ,KAAK,QACL,KAAK,SAAA,CACL,KAAK,SAAA,CACL,KAAK,QAAA,CACL,KAAK,MACG,CAACA,CAAAA,EAAMA,EAAG,KAAA,CACV2R,CAAAA,CAAG,KAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAO,CAAC,KAAK,WAAW,CAAE,CAAC,CAAA,CACtC3R,CAAAA,CAAG,GAAA,CACRA,CAAAA,CAAG,IAAI,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAE5BA,CAAAA,CAAG,MAAM,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAClC,OACJ,KAAK,OAAA,CACL,KAAK,QAAA,CACL,KAAK,uBACL,KAAK,sBAAA,CAAwB,CACzB,IAAMqa,EAAK,IAAA,CAAK,UAAA,CAAW,KAAK,IAAI,CAAA,CAChC,CAACra,CAAAA,EAAMA,CAAAA,CAAG,KAAA,CACV2R,CAAAA,CAAG,MAAM,IAAA,CAAK,CAAE,MAAO,EAAC,CAAG,IAAK0I,CAAAA,CAAI,GAAA,CAAK,EAAG,CAAC,CAAA,CACxCra,CAAAA,CAAG,IACR,IAAA,CAAK,KAAA,CAAM,KAAKqa,CAAE,CAAA,CAElB,MAAA,CAAO,MAAA,CAAOra,EAAI,CAAE,GAAA,CAAKqa,CAAAA,CAAI,GAAA,CAAK,EAAG,CAAC,CAAA,CAC1C,MACJ,CACA,KAAK,cAAA,CACL,KAAK,cAAA,CACD1I,CAAAA,CAAG,IAAI,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAC5B,MACR,CACA,IAAMuI,EAAK,IAAA,CAAK,eAAA,CAAgBvI,CAAE,CAAA,CAE9BuI,CAAAA,CACA,IAAA,CAAK,KAAA,CAAM,KAAKA,CAAE,CAAA,EAElB,MAAO,IAAA,CAAK,GAAA,GACZ,MAAO,IAAA,CAAK,IAAA,EAAK,EAEzB,MACK,CACD,IAAMzf,CAAAA,CAAS,IAAA,CAAK,KAAK,CAAC,CAAA,CAC1B,GAAIA,CAAAA,CAAO,OAAS,WAAA,GACd,IAAA,CAAK,OAAS,eAAA,EAAmBA,CAAAA,CAAO,SAAWkX,CAAAA,CAAG,MAAA,EACnD,IAAA,CAAK,IAAA,GAAS,WACX,CAAClX,CAAAA,CAAO,MAAMA,CAAAA,CAAO,KAAA,CAAM,OAAS,CAAC,CAAA,CAAE,GAAA,CAAA,CAC/C,MAAO,KAAK,GAAA,EAAI,CAChB,MAAO,IAAA,CAAK,IAAA,WAEP,IAAA,CAAK,IAAA,GAAS,eAAA,EACnBA,CAAAA,CAAO,OAAS,iBAAA,CAAmB,CACnC,IAAMgH,CAAAA,CAAOkY,GAAalf,CAAM,CAAA,CAC1BtG,CAAAA,CAAQylB,EAAAA,CAAsBnY,CAAI,CAAA,CACxCoY,EAAAA,CAAgBlI,CAAE,CAAA,CAClB,IAAMa,EAAMb,CAAAA,CAAG,GAAA,CAAI,MAAA,CAAO,CAAA,CAAGA,EAAG,GAAA,CAAI,MAAM,EAC1Ca,CAAAA,CAAI,IAAA,CAAK,KAAK,WAAW,CAAA,CACzB,IAAMhT,CAAAA,CAAM,CACR,IAAA,CAAM,WAAA,CACN,OAAQmS,CAAAA,CAAG,MAAA,CACX,OAAQA,CAAAA,CAAG,MAAA,CACX,KAAA,CAAO,CAAC,CAAE,KAAA,CAAAxd,CAAAA,CAAO,IAAKwd,CAAAA,CAAI,GAAA,CAAAa,CAAI,CAAC,CACnC,CAAA,CACA,IAAA,CAAK,UAAY,IAAA,CACjB,IAAA,CAAK,MAAM,IAAA,CAAK,KAAA,CAAM,OAAS,CAAC,CAAA,CAAIhT,EACxC,CAAA,KAEI,MAAO,IAAA,CAAK,OAAA,CAAQmS,CAAE,EAE9B,CACJ,CACA,UAAA,CAAW1Z,CAAAA,CAAM,CACb,GAAI,KAAK,SAAA,CAAW,CAChB,IAAIic,CAAAA,CAAK,IAAA,CAAK,OAAO,OAAA,CAAQ;AAAA,CAAI,CAAA,CAAI,CAAA,CACrC,KAAOA,CAAAA,GAAO,GACV,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,MAAA,CAASA,CAAE,CAAA,CAC/BA,CAAAA,CAAK,IAAA,CAAK,OAAO,OAAA,CAAQ;AAAA,CAAA,CAAMA,CAAE,CAAA,CAAI,EAE7C,CACA,OAAO,CACH,IAAA,CAAAjc,CAAAA,CACA,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MACjB,CACJ,CACA,eAAA,CAAgBwC,CAAAA,CAAQ,CACpB,OAAQ,IAAA,CAAK,IAAA,EACT,KAAK,OAAA,CACL,KAAK,QAAA,CACL,KAAK,sBAAA,CACL,KAAK,sBAAA,CACD,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAI,CAAA,CACpC,KAAK,qBAAA,CACD,OAAO,CACH,IAAA,CAAM,cAAA,CACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,CAAC,IAAA,CAAK,WAAW,CAAA,CACxB,MAAA,CAAQ,EACZ,CAAA,CACJ,KAAK,gBAAA,CACL,KAAK,gBAAA,CACD,OAAO,CACH,IAAA,CAAM,iBAAA,CACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,IAAA,CAAK,WAAA,CACZ,KAAA,CAAO,EAAC,CACR,GAAA,CAAK,EACT,CAAA,CACJ,KAAK,cAAA,CACD,OAAO,CACH,IAAA,CAAM,WAAA,CACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,CAAC,CAAE,KAAA,CAAO,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CACzC,CAAA,CACJ,KAAK,kBAAA,CAAoB,CACrB,IAAA,CAAK,SAAA,CAAY,IAAA,CACjB,IAAMgH,CAAAA,CAAOkY,EAAAA,CAAalf,CAAM,CAAA,CAC1BtG,CAAAA,CAAQylB,EAAAA,CAAsBnY,CAAI,CAAA,CACxC,OAAAtN,CAAAA,CAAM,KAAK,IAAA,CAAK,WAAW,CAAA,CACpB,CACH,IAAA,CAAM,WAAA,CACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,CAAC,CAAE,KAAA,CAAAA,CAAAA,CAAO,WAAA,CAAa,IAAK,CAAC,CACxC,CACJ,CACA,KAAK,eAAA,CAAiB,CAClB,IAAA,CAAK,SAAA,CAAY,IAAA,CACjB,IAAMsN,CAAAA,CAAOkY,EAAAA,CAAalf,CAAM,CAAA,CAC1BtG,CAAAA,CAAQylB,EAAAA,CAAsBnY,CAAI,CAAA,CACxC,OAAO,CACH,IAAA,CAAM,WAAA,CACN,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,KAAA,CAAO,CAAC,CAAE,KAAA,CAAAtN,CAAAA,CAAO,GAAA,CAAK,IAAA,CAAM,GAAA,CAAK,CAAC,IAAA,CAAK,WAAW,CAAE,CAAC,CACzD,CACJ,CACJ,CACA,OAAO,IACX,CACA,iBAAA,CAAkBA,CAAAA,CAAOqM,CAAAA,CAAQ,CAG7B,OAFI,IAAA,CAAK,IAAA,GAAS,SAAA,EAEd,IAAA,CAAK,MAAA,EAAUA,CAAAA,CACR,KAAA,CACJrM,CAAAA,CAAM,KAAA,CAAMsd,CAAAA,EAAMA,CAAAA,CAAG,IAAA,GAAS,SAAA,EAAaA,CAAAA,CAAG,IAAA,GAAS,OAAO,CACzE,CACA,CAAC,WAAA,CAAY6I,CAAAA,CAAQ,CACb,IAAA,CAAK,IAAA,GAAS,UAAA,GACVA,CAAAA,CAAO,GAAA,CACPA,CAAAA,CAAO,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAEhCA,CAAAA,CAAO,GAAA,CAAM,CAAC,IAAA,CAAK,WAAW,CAAA,CAC9B,IAAA,CAAK,IAAA,GAAS,SAAA,GACd,MAAO,IAAA,CAAK,GAAA,EAAI,CAAA,EAE5B,CACA,CAAC,OAAA,CAAQjJ,CAAAA,CAAO,CACZ,OAAQ,IAAA,CAAK,IAAA,EACT,KAAK,OAAA,CACL,KAAK,WAAA,CACL,KAAK,SAAA,CACL,KAAK,cAAA,CACL,KAAK,cAAA,CACL,KAAK,eAAA,CACD,MAAO,IAAA,CAAK,GAAA,EAAI,CAChB,MAAO,IAAA,CAAK,IAAA,EAAK,CACjB,MACJ,KAAK,SAAA,CACD,IAAA,CAAK,SAAA,CAAY,KAAA,CAErB,KAAK,OAAA,CACL,KAAK,SAAA,CACL,QAEQA,CAAAA,CAAM,GAAA,CACNA,CAAAA,CAAM,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,WAAW,CAAA,CAE/BA,CAAAA,CAAM,GAAA,CAAM,CAAC,IAAA,CAAK,WAAW,CAAA,CAC7B,IAAA,CAAK,IAAA,GAAS,SAAA,GACd,MAAO,IAAA,CAAK,GAAA,EAAI,EAC5B,CACJ,CACJ,CAAA,CC57BA,SAASkJ,EAAAA,CAAarV,CAAAA,CAAS,CAC3B,IAAMsV,CAAAA,CAAetV,CAAAA,CAAQ,YAAA,GAAiB,KAAA,CAE9C,OAAO,CAAE,WAAA,CADWA,CAAAA,CAAQ,WAAA,EAAgBsV,CAAAA,EAAgB,IAAIrB,EAAAA,EAAkB,IAAA,CAC5D,YAAA,CAAAqB,CAAa,CACvC,CAyBA,SAASC,EAAAA,CAAc5e,CAAAA,CAAQqJ,CAAAA,CAAU,EAAC,CAAG,CACzC,GAAM,CAAE,WAAA,CAAAwV,CAAAA,CAAa,YAAA,CAAAF,CAAa,CAAA,CAAID,EAAAA,CAAarV,CAAO,CAAA,CACpDyV,CAAAA,CAAS,IAAIb,EAAAA,CAAOY,CAAAA,EAAa,UAAU,CAAA,CAC3CE,CAAAA,CAAW,IAAIrD,EAAAA,CAASrS,CAAO,CAAA,CAEjChJ,CAAAA,CAAM,IAAA,CACV,IAAA,IAAW2e,CAAAA,IAAQD,CAAAA,CAAS,OAAA,CAAQD,CAAAA,CAAO,KAAA,CAAM9e,CAAM,CAAA,CAAG,IAAA,CAAMA,CAAAA,CAAO,MAAM,CAAA,CACzE,GAAI,CAACK,CAAAA,CACDA,CAAAA,CAAM2e,CAAAA,CAAAA,KAAAA,GACD3e,CAAAA,CAAI,OAAA,CAAQ,QAAA,GAAa,QAAA,CAAU,CACxCA,EAAI,MAAA,CAAO,IAAA,CAAK,IAAI8T,EAAAA,CAAe6K,CAAAA,CAAK,KAAA,CAAM,KAAA,CAAM,CAAA,CAAG,CAAC,CAAA,CAAG,eAAA,CAAiB,yEAAyE,CAAC,CAAA,CACtJ,KACJ,CAEJ,OAAIL,CAAAA,EAAgBE,CAAAA,GAChBxe,CAAAA,CAAI,MAAA,CAAO,OAAA,CAAQgU,EAAAA,CAAcrU,CAAAA,CAAQ6e,CAAW,CAAC,CAAA,CACrDxe,CAAAA,CAAI,QAAA,CAAS,OAAA,CAAQgU,EAAAA,CAAcrU,CAAAA,CAAQ6e,CAAW,CAAC,CAAA,CAAA,CAEpDxe,CACX,CACA,SAAS4e,EAAAA,CAAMpc,CAAAA,CAAKtB,CAAAA,CAAS8H,CAAAA,CAAS,CAClC,IAAI6V,CAAAA,CAOJ,IAAM7e,CAAAA,CAAMue,EAAAA,CAAc/b,CAAAA,CAAKwG,CAAO,CAAA,CACtC,GAAI,CAAChJ,CAAAA,CACD,OAAO,IAAA,CAEX,GADAA,CAAAA,CAAI,QAAA,CAAS,OAAA,CAAQsb,CAAAA,GAAgBtb,CAAAA,CAAI,OAAA,CAAQ,QAAA,CAAjB,MAAA,CAAmC,CAAA,CAC/DA,CAAAA,CAAI,MAAA,CAAO,MAAA,CAAS,CAAA,CAAG,CACvB,GAAIA,CAAAA,CAAI,OAAA,CAAQ,QAAA,GAAa,QAAA,CACzB,MAAMA,CAAAA,CAAI,MAAA,CAAO,CAAC,CAAA,CAElBA,CAAAA,CAAI,MAAA,CAAS,GACrB,CACA,OAAOA,CAAAA,CAAI,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,CAAE,OAAA,CAAS6e,CAAS,CAAA,CAAG7V,CAAO,CAAC,CACjE,CC9CO,IAAM8V,EAAAA,CAAN,KAAgB,CAUrB,KAAA,CAAM/f,CAAAA,CAAciK,CAAAA,CAAwB,EAAC,CAAc,CACzD,GAAM,CAAE,QAAA,CAAA+V,CAAAA,CAAW,IAAA,CAAM,MAAA,CAAAjG,EAAS,KAAM,CAAA,CAAI9P,CAAAA,CAGxCgW,CAAAA,CACJ,GAAI,CACFA,CAAAA,CAASJ,EAAAA,CAAU7f,CAAI,EACzB,CAAA,MAASe,CAAAA,CAAO,CACd,MAAM,IAAI/G,CAAAA,CACR,CAAA,sBAAA,EAAyB+G,CAAAA,YAAiB,KAAA,CAAQA,CAAAA,CAAM,OAAA,CAAU,MAAA,CAAOA,CAAK,CAAC,CAAA,CACjF,CACF,CAGA,GAAI,OAAOkf,CAAAA,EAAW,QAAA,EAAYA,CAAAA,GAAW,IAAA,CAC3C,MAAM,IAAIjmB,CAAAA,CAAW,iCAAiC,CAAA,CAGxD,IAAM0K,CAAAA,CAASub,CAAAA,CAGf,GAAID,CAAAA,CAAU,CACZ,IAAMjlB,CAAAA,CAAS,IAAA,CAAK,QAAA,CAAS2J,CAAAA,CAAQ,CAAE,MAAA,CAAAqV,CAAO,CAAC,CAAA,CAC/C,GAAI,CAAChf,CAAAA,CAAO,KAAA,CAAO,CACjB,IAAMmlB,CAAAA,CAAgBnlB,CAAAA,CAAO,MAAA,CAAO,GAAA,CAAKolB,CAAAA,EAAMA,CAAAA,CAAE,OAAO,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,CACnE,MAAM,IAAIrmB,EAAAA,CACR,CAAA,0BAAA,EAA6BomB,CAAa,CAAA,CAC5C,CACF,CAGInlB,CAAAA,CAAO,QAAA,CAAS,MAAA,CAAS,EAM/B,CAEA,OAAO2J,CACT,CASA,QAAA,CACEA,CAAAA,CACAuF,CAAAA,CAA6B,EAAC,CACZ,CAClB,GAAM,CAAE,MAAA,CAAA8P,CAAAA,CAAS,KAAA,CAAO,QAAA,CAAAqG,CAAAA,CAAW,KAAM,CAAA,CAAInW,CAAAA,CACvCoW,CAAAA,CAA4B,EAAC,CAC7BC,CAAAA,CAAgC,EAAC,CAGvC,OAAI,CAAC5b,CAAAA,CAAO,IAAA,EAAQ,CAAC0b,CAAAA,CACnBC,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,iCAAA,CACT,IAAA,CAAM,EAAC,CACP,IAAA,CAAM,cACR,CAAC,CAAA,CACQ3b,CAAAA,CAAO,OAEXA,CAAAA,CAAO,IAAA,CAAK,EAAA,CAMN,OAAOA,CAAAA,CAAO,IAAA,CAAK,EAAA,EAAO,QAAA,CACnC2b,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,4BAAA,CACT,IAAA,CAAM,CAAC,MAAA,CAAQ,IAAI,CAAA,CACnB,IAAA,CAAM,sBACR,CAAC,CAAA,CACS,mBAAA,CAAoB,IAAA,CAAK3b,CAAAA,CAAO,IAAA,CAAK,EAAE,CAAA,EACjD4b,CAAAA,CAAS,IAAA,CAAK,CACZ,OAAA,CAAS,sDAAA,CACT,IAAA,CAAM,CAAC,MAAA,CAAQ,IAAI,CAAA,CACnB,IAAA,CAAM,gBACR,CAAC,CAAA,CAhBDD,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,kCAAA,CACT,IAAA,CAAM,CAAC,MAAM,CAAA,CACb,IAAA,CAAM,iBACR,CAAC,CAAA,CAgBC3b,CAAAA,CAAO,IAAA,CAAK,MAAA,EAEZ,OAAOA,CAAAA,CAAO,IAAA,CAAK,MAAA,EAAW,QAAA,EAC9BA,CAAAA,CAAO,IAAA,CAAK,MAAA,GAAW,IAAA,EACvBA,CAAAA,CAAO,IAAA,CAAK,MAAA,GAAW,IAAA,EAEvB2b,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,oCAAA,CACT,IAAA,CAAM,CAAC,MAAA,CAAQ,QAAQ,CAAA,CACvB,IAAA,CAAM,gBACR,CAAC,CAAA,CAAA,CAMH3b,CAAAA,CAAO,GAAA,GACJ,KAAA,CAAM,OAAA,CAAQA,CAAAA,CAAO,GAAG,CAAA,CAO3BA,CAAAA,CAAO,GAAA,CAAI,OAAA,CAAQ,CAAC6b,CAAAA,CAAMC,CAAAA,GAAU,CAClC,IAAA,CAAK,iBAAA,CACHD,CAAAA,CACA,CAAC,KAAA,CAAO,MAAA,CAAOC,CAAK,CAAC,CAAA,CACrBH,CAAAA,CACAC,CAAAA,CACAvG,CACF,EACF,CAAC,CAAA,CAdDsG,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,wBAAA,CACT,IAAA,CAAM,CAAC,KAAK,CAAA,CACZ,IAAA,CAAM,kBACR,CAAC,CAAA,CAAA,CAeD3b,CAAAA,CAAO,YACL,OAAOA,CAAAA,CAAO,SAAA,EAAc,QAAA,CAC9B2b,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,+BAAA,CACT,IAAA,CAAM,CAAC,WAAW,CAAA,CAClB,IAAA,CAAM,wBACR,CAAC,CAAA,CAED,MAAA,CAAO,OAAA,CAAQ3b,CAAAA,CAAO,SAAS,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC1F,CAAAA,CAAKyhB,CAAQ,CAAA,GAAM,CAC5D,IAAA,CAAK,iBAAA,CACHA,CAAAA,CACA,CAAC,WAAA,CAAazhB,CAAG,CAAA,CACjBqhB,CAAAA,CACAC,CAAAA,CACAvG,CACF,EACF,CAAC,CAAA,CAAA,CAKDrV,CAAAA,CAAO,KAAA,GACL,OAAOA,CAAAA,CAAO,KAAA,EAAU,QAAA,CAC1B2b,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,2BAAA,CACT,IAAA,CAAM,CAAC,OAAO,CAAA,CACd,IAAA,CAAM,oBACR,CAAC,CAAA,CAED,MAAA,CAAO,OAAA,CAAQ3b,CAAAA,CAAO,KAAK,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC1F,CAAAA,CAAKhC,CAAI,CAAA,GAAM,CAEpD,IAAM0jB,CAAAA,CAAa,IAAA,CAAK,QAAA,CAAS1jB,CAAAA,CAAM,CAAE,GAAGiN,CAAAA,CAAS,QAAA,CAAU,IAAK,CAAC,CAAA,CACrEoW,CAAAA,CAAO,IAAA,CACL,GAAGK,CAAAA,CAAW,MAAA,CAAO,GAAA,CAAKP,CAAAA,GAAO,CAC/B,GAAGA,CAAAA,CACH,IAAA,CAAM,CAAC,OAAA,CAASnhB,CAAAA,CAAK,GAAGmhB,CAAAA,CAAE,IAAI,CAChC,CAAA,CAAE,CACJ,CAAA,CACAG,CAAAA,CAAS,IAAA,CACP,GAAGI,CAAAA,CAAW,QAAA,CAAS,GAAA,CAAKC,CAAAA,GAAO,CACjC,GAAGA,CAAAA,CACH,IAAA,CAAM,CAAC,OAAA,CAAS3hB,CAAAA,CAAK,GAAG2hB,CAAAA,CAAE,IAAI,CAChC,CAAA,CAAE,CACJ,EACF,CAAC,GAKDjc,CAAAA,CAAO,KAAA,EACL,OAAOA,CAAAA,CAAO,KAAA,EAAU,QAAA,EAC1B2b,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,2BAAA,CACT,IAAA,CAAM,CAAC,OAAO,CAAA,CACd,IAAA,CAAM,oBACR,CAAC,CAAA,CAIE,CACL,KAAA,CAAOA,CAAAA,CAAO,MAAA,GAAW,CAAA,GAAMtG,CAAAA,CAASuG,CAAAA,CAAS,MAAA,GAAW,CAAA,CAAI,IAAA,CAAA,CAChE,MAAA,CAAAD,CAAAA,CACA,QAAA,CAAAC,CACF,CACF,CAYQ,iBAAA,CACNC,CAAAA,CACAthB,CAAAA,CACAohB,CAAAA,CACAC,CAAAA,CACAM,CAAAA,CACM,CAEFL,CAAAA,CAAK,EAAA,EAAM,OAAOA,CAAAA,CAAK,EAAA,EAAO,QAAA,GAC3B,mBAAA,CAAoB,IAAA,CAAKA,CAAAA,CAAK,EAAE,CAAA,EACnCD,CAAAA,CAAS,IAAA,CAAK,CACZ,OAAA,CAAS,CAAA,OAAA,EAAUC,CAAAA,CAAK,EAAE,CAAA,4CAAA,CAAA,CAC1B,IAAA,CAAM,CAAC,GAAGthB,EAAM,IAAI,CAAA,CACpB,IAAA,CAAM,iBACR,CAAC,CAAA,CAAA,CAKDshB,CAAAA,CAAK,MAAA,GAELA,CAAAA,CAAK,MAAA,GAAW,MAAA,EAChBA,CAAAA,CAAK,MAAA,GAAW,KAAA,EAChBA,CAAAA,CAAK,MAAA,GAAW,OAAA,EAEhBF,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,4CAAA,CACT,IAAA,CAAM,CAAC,GAAGphB,CAAAA,CAAM,QAAQ,CAAA,CACxB,IAAA,CAAM,gBACR,CAAC,CAAA,CAICshB,CAAAA,CAAK,MAAA,GAAW,MAAA,EAAU,CAACA,CAAAA,CAAK,aAAa,CAAA,EAC/CF,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,iDAAA,CACT,IAAA,CAAM,CAAC,GAAGphB,CAAAA,CAAM,aAAa,CAAA,CAC7B,IAAA,CAAM,qBACR,CAAC,CAAA,CAGCshB,CAAAA,CAAK,MAAA,GAAW,OAAA,EAAW,CAACA,CAAAA,CAAK,cAAc,CAAA,EACjDF,CAAAA,CAAO,IAAA,CAAK,CACV,QAAS,mDAAA,CACT,IAAA,CAAM,CAAC,GAAGphB,CAAAA,CAAM,cAAc,CAAA,CAC9B,IAAA,CAAM,sBACR,CAAC,CAAA,CAAA,CAKDshB,CAAAA,CAAK,UAAU,CAAA,EAAKA,CAAAA,CAAK,IAAA,EAC3BD,CAAAA,CAAS,IAAA,CAAK,CACZ,OAAA,CAAS,8CAAA,CACT,IAAA,CAAM,CAAC,GAAGrhB,CAAI,CAAA,CACd,IAAA,CAAM,oBACR,CAAC,CAAA,CAICshB,CAAAA,CAAK,QAAA,EACH,CAAC,KAAA,CAAM,OAAA,CAAQA,CAAAA,CAAK,QAAQ,CAAA,EAAK,OAAOA,CAAAA,CAAK,QAAA,EAAa,QAAA,EAC5DF,CAAAA,CAAO,IAAA,CAAK,CACV,OAAA,CAAS,uCAAA,CACT,IAAA,CAAM,CAAC,GAAGphB,CAAAA,CAAM,UAAU,CAAA,CAC1B,IAAA,CAAM,uBACR,CAAC,EAGP,CAmBA,gBAAA,CACE4hB,CAAAA,CACAC,CAAAA,CACA7W,CAAAA,CAAwB,EAAC,CACd,CAEX,IAAM8W,CAAAA,CAAa,IAAA,CAAK,KAAA,CAAMF,CAAAA,CAAU5W,CAAO,CAAA,CAG/C,GAAI,CAAC8W,CAAAA,CAAW,IAAA,CAAK,OAAA,EAAWA,CAAAA,CAAW,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAW,CAAA,CACjE,OAAOA,CAAAA,CAIT,IAAMC,CAAAA,CAA2C,EAAC,CAElD,IAAA,IAAWC,CAAAA,IAAcF,CAAAA,CAAW,IAAA,CAAK,OAAA,CAAS,CAEhD,GAAI,CAACD,CAAAA,CAAQ,GAAA,CAAIG,CAAU,CAAA,CACzB,MAAM,IAAIjnB,CAAAA,CACR,CAAA,kBAAA,EAAqBinB,CAAU,CAAA,qBAAA,EAAwB,KAAA,CAAM,IAAA,CAAKH,CAAAA,CAAQ,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAC9F,CAAA,CAIF,IAAMI,CAAAA,CAAaJ,CAAAA,CAAQ,GAAA,CAAIG,CAAU,CAAA,CACnCE,CAAAA,CAAiB,IAAA,CAAK,KAAA,CAAMD,CAAAA,CAAY,CAC5C,GAAGjX,CAAAA,CACH,QAAA,CAAU,KACZ,CAAC,CAAA,CAIKmX,CAAAA,CAAY,IAAA,CAAK,gBAAA,CAAiBH,CAAU,CAAA,CAGlD,GAAIE,CAAAA,CAAe,KAAA,CACjB,IAAA,GAAW,CAACE,CAAAA,CAAUC,CAAU,CAAA,GAAK,MAAA,CAAO,OAAA,CAC1CH,CAAAA,CAAe,KACjB,CAAA,CAAG,CACD,IAAMI,CAAAA,CAAgB,CAAA,EAAGH,CAAS,CAAA,EAAA,EAAKC,CAAQ,CAAA,CAAA,CAC/CL,CAAAA,CAAcO,CAAa,CAAA,CAAID,EACjC,CAcF,GATAN,CAAAA,CAAcI,CAAS,CAAA,CAAI,CACzB,IAAA,CAAMD,CAAAA,CAAe,IAAA,CACrB,GAAA,CAAKA,CAAAA,CAAe,GAAA,CACpB,SAAA,CAAWA,CAAAA,CAAe,SAAA,CAC1B,KAAA,CAAOA,CAAAA,CAAe,KAAA,CACtB,KAAA,CAAOA,CAAAA,CAAe,KACxB,CAAA,CAGIA,CAAAA,CAAe,KAAA,CAAO,CACnBJ,CAAAA,CAAW,KAAA,GACdA,CAAAA,CAAW,KAAA,CAAQ,EAAC,CAAA,CAEtB,IAAA,GAAW,CAACS,CAAAA,CAAUC,CAAQ,CAAA,GAAK,MAAA,CAAO,OAAA,CACxCN,CAAAA,CAAe,KACjB,CAAA,CAAG,CACD,IAAMO,CAAAA,CAAoB,CAAA,EAAGN,CAAS,CAAA,EAAA,EAAKI,CAAQ,CAAA,CAAA,CACnDT,CAAAA,CAAW,KAAA,CAAMW,CAAiB,CAAA,CAAID,EACxC,CACF,CACF,CAGA,OAAI,MAAA,CAAO,IAAA,CAAKT,CAAa,CAAA,CAAE,MAAA,CAAS,CAAA,GACtCD,CAAAA,CAAW,KAAA,CAAQ,CACjB,GAAGC,CAAAA,CACH,GAAGD,CAAAA,CAAW,KAChB,CAAA,CAAA,CAGKA,CACT,CAUQ,gBAAA,CAAiBE,CAAAA,CAA4B,CAOnD,IAAMU,CAAAA,CAAAA,CALaV,CAAAA,CAAW,UAAA,CAAW,GAAG,CAAA,CACxCA,CAAAA,CAAW,KAAA,CAAM,CAAC,CAAA,CAClBA,CAAAA,EAGwB,KAAA,CAAM,GAAG,CAAA,CACrC,OAAOU,EAASA,CAAAA,CAAS,MAAA,CAAS,CAAC,CACrC,CACF,ECnZO,IAAMC,EAAAA,CAAN,MAAMC,CAAQ,CAkBnB,WAAA,CACUC,CAAAA,CACAC,CAAAA,CAAiB,IAAA,CACzBC,CAAAA,CAAmB,IAAA,CACnBC,CAAAA,CACA,CAJQ,IAAA,CAAAH,CAAAA,CAAAA,CAAAA,CACA,IAAA,CAAAC,CAAAA,CAAAA,CAAAA,CAlBV,IAAA,CAAQ,WAAA,CAAyB,EAAC,CAGlC,IAAA,CAAQG,CAAAA,CAAoC,EAAC,CAG7C,IAAA,CAAQC,CAAAA,CAAmC,EAAC,CAgBtCH,CAAAA,GAAY,IAAA,EACd,IAAA,CAAK,WAAA,CAAY,IAAA,CAAKA,CAAO,CAAA,CAE3BC,CAAAA,GACF,IAAA,CAAKE,CAAAA,CAASF,CAAAA,EAElB,CAQA,IAAI,EAAA,EAAmB,CACrB,OAAO,IAAA,CAAKH,CACd,CAQA,IAAI,IAAA,EAAgB,CAClB,OAAO,IAAA,CAAKC,CACd,CAQA,IAAI,MAAA,EAAkB,CACpB,OAAO,IAAA,CAAK,WAAA,CAAY,MAAA,CAAS,CAAA,CAC7B,IAAA,CAAK,WAAA,CAAY,IAAA,CAAK,WAAA,CAAY,MAAA,CAAS,CAAC,CAAA,CAC5C,IACN,CAQA,IAAI,OAAA,EAAmC,CACrC,OAAO,IAAA,CAAKG,CACd,CAOA,IAAI,OAAA,CAAQ9f,CAAAA,CAA8B,CACxC,IAAA,CAAK8f,CAAAA,CAAW9f,EAClB,CAQA,UAAA,CAAW5C,CAAAA,CAAuB,CAChC,IAAA,CAAK,WAAA,CAAY,IAAA,CAAKA,CAAM,EAC9B,CAQA,SAAA,EAAqB,CACnB,OAAO,IAAA,CAAK,WAAA,CAAY,GAAA,EAC1B,CASA,OAAA,CAAQe,CAAAA,CAAuB,CAE7B,OAAQA,CAAAA,EACN,KAAK,KAAA,CACH,OAAO,IAAA,CAAKuhB,CAAAA,CACd,KAAK,OAAA,CACH,OAAO,IAAA,CAAKC,CAAAA,CACd,KAAK,SAAA,CACH,OAAO,IAAA,CAAK,MAAA,CACd,KAAK,QAAA,CAEH,OAAQ,IAAA,CAAKG,CAAAA,CAAqC,MAAA,CACpD,QAEE,OAAI3hB,CAAAA,IAAQ,IAAA,CAAK2hB,CAAAA,CACR,IAAA,CAAKA,CAAAA,CAAS3hB,CAAI,CAAA,CAG3B,MACJ,CACF,CAQA,GAAA,CAAIA,CAAAA,CAAc3E,CAAAA,CAAsB,CACtC,IAAA,CAAKsmB,CAAAA,CAAS3hB,CAAI,CAAA,CAAI3E,EACxB,CAUA,YAAA,CAAa4lB,CAAAA,CAAkBY,CAAAA,CAA4B,CACzD,IAAMC,CAAAA,CAAU,IAAA,CAAKF,CAAAA,CAAOX,CAAQ,CAAA,CACpC,GAAKa,CAAAA,CAAAA,CAOL,IAAA,GAAW,CAACrjB,CAAAA,CAAKpD,CAAK,CAAA,GAAK,MAAA,CAAO,OAAA,CAAQymB,CAAO,CAAA,CAC/C,GAAIzmB,CAAAA,GAAUwmB,CAAAA,CAAW,CAEvB,IAAME,CAAAA,CAAS,MAAA,CAAOtjB,CAAG,CAAA,CACzB,OAAO,KAAA,CAAMsjB,CAAM,CAAA,CAAItjB,CAAAA,CAAMsjB,CAC/B,CAAA,CAIJ,CAQA,OAAA,CAAQd,CAAAA,CAA2B,CACjC,OAAOA,CAAAA,IAAY,IAAA,CAAKW,CAC1B,CASA,WAAA,CAAYI,CAAAA,CAAgC,CAO1C,OANqB,IAAIV,CAAAA,CACvBU,CAAAA,EAAU,IAAA,CAAKT,CAAAA,CACf,IAAA,CAAKC,CAAAA,EAAS,IAAA,CAAKG,CAAAA,CACnB,IAAA,CAAKA,CAAAA,CACL,IAAA,CAAKC,CACP,CAEF,CAQA,KAAA,EAAiB,CACf,IAAMK,CAAAA,CAAS,IAAIX,CAAAA,CAAQ,IAAA,CAAKC,CAAAA,CAAK,IAAA,CAAKC,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAQ,IAAA,CAAKI,CAAM,CAAA,CACzE,OAAAK,CAAAA,CAAON,CAAAA,CAAW,CAAE,GAAG,IAAA,CAAKA,CAAS,CAAA,CACrCM,CAAAA,CAAO,WAAA,CAAc,CAAC,GAAG,IAAA,CAAK,WAAW,CAAA,CAClCA,CACT,CACF,ECjJO,SAASC,CAAAA,CACdzlB,CAAAA,CACApB,CAAAA,CAA0C,IAAA,CAC1C/C,CAAAA,CAAmB,CAAA,CACZ,CACP,OAAO,CAAE,IAAA,CAAAmE,CAAAA,CAAM,KAAA,CAAApB,CAAAA,CAAO,QAAA,CAAA/C,CAAS,CACjC,CCxEO,IAAMwkB,EAAAA,CAAN,KAAY,CAUjB,WAAA,CAAYqF,CAAAA,CAAe,CAR3B,IAAA,CAAQ,QAAA,CAAmB,CAAA,CAC3B,IAAA,CAAQ,OAAA,CAAyB,IAAA,CAQ/B,IAAA,CAAK,KAAA,CAAQA,CAAAA,CACb,IAAA,CAAK,OAAA,CAAUA,CAAAA,CAAM,MAAA,CAAS,CAAA,CAAIA,CAAAA,CAAM,CAAC,CAAA,CAAI,KAC/C,CAQA,QAAA,EAAoB,CAClB,IAAMlN,CAAAA,CAAkB,EAAC,CAEzB,KAAO,IAAA,CAAK,OAAA,GAAY,IAAA,EAAM,CAE5B,GAAI,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,CAAG,CACnC,IAAA,CAAK,cAAA,EAAe,CACpB,QACF,CAGA,GAAI,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,CAAG,CAC9BA,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,UAAA,EAAY,CAAA,CAC7B,QACF,CAGA,GAAI,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,OAAO,CAAA,CAAG,CACxCA,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,uBAAA,EAAyB,CAAA,CAC1C,QACF,CAGA,GAAI,IAAA,CAAK,OAAA,GAAY,GAAA,EAAO,IAAA,CAAK,OAAA,GAAY,GAAA,CAAK,CAChDA,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,UAAA,EAAY,CAAA,CAC7B,QACF,CAGA,IAAMY,CAAAA,CAAQ,IAAA,CAAK,YAAA,EAAa,CAChC,GAAIA,CAAAA,CAAO,CACTZ,CAAAA,CAAO,IAAA,CAAKY,CAAK,CAAA,CACjB,QACF,CAEA,MAAM,IAAIpc,EACR,CAAA,sBAAA,EAAyB,IAAA,CAAK,OAAO,CAAA,CAAA,CACrC,IAAA,CAAK,QACP,CACF,CAEA,OAAAwb,CAAAA,CAAO,IAAA,CAAKiN,CAAAA,CAAAA,KAAAA,CAA2B,IAAA,CAAM,IAAA,CAAK,QAAQ,CAAC,CAAA,CACpDjN,CACT,CAMQ,OAAA,EAAgB,CACtB,IAAA,CAAK,QAAA,EAAA,CACL,IAAA,CAAK,OAAA,CACH,IAAA,CAAK,QAAA,CAAW,IAAA,CAAK,KAAA,CAAM,MAAA,CAAS,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,QAAQ,CAAA,CAAI,KACpE,CAMQ,IAAA,CAAKlc,CAAAA,CAAiB,CAAA,CAAkB,CAC9C,IAAMuC,CAAAA,CAAM,IAAA,CAAK,QAAA,CAAWvC,CAAAA,CAC5B,OAAOuC,CAAAA,CAAM,IAAA,CAAK,KAAA,CAAM,MAAA,CAAS,IAAA,CAAK,KAAA,CAAMA,CAAG,CAAA,CAAI,IACrD,CAMQ,YAAA,CAAa8mB,CAAAA,CAAuB,CAC1C,OAAO,IAAA,CAAK,IAAA,CAAKA,CAAI,CACvB,CAMQ,OAAA,CAAQA,CAAAA,CAAuB,CACrC,OAAO,OAAA,CAAQ,IAAA,CAAKA,CAAI,CAC1B,CAMQ,iBAAA,CAAkBA,CAAAA,CAAuB,CAC/C,OAAO,WAAA,CAAY,IAAA,CAAKA,CAAI,CAC9B,CAMQ,gBAAA,CAAiBA,CAAAA,CAAuB,CAC9C,OAAO,cAAA,CAAe,IAAA,CAAKA,CAAI,CACjC,CAMQ,cAAA,EAAuB,CAC7B,KAAO,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,EAC5D,IAAA,CAAK,OAAA,GAET,CAMQ,UAAA,EAAoB,CAC1B,IAAMzpB,CAAAA,CAAQ,IAAA,CAAK,QAAA,CACf0C,CAAAA,CAAQ,EAAA,CAGZ,GAAI,IAAA,CAAK,OAAA,GAAY,GAAA,EAAO,IAAA,CAAK,IAAA,EAAK,GAAM,GAAA,CAAK,CAM/C,IALAA,CAAAA,EAAS,IAAA,CAAK,QACd,IAAA,CAAK,OAAA,EAAQ,CACbA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAEN,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,aAAA,CAAc,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA,EAC7DA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAGf,OAAO6mB,CAAAA,CAAAA,QAAAA,CAA8B,QAAA,CAAS7mB,CAAAA,CAAO,EAAE,CAAA,CAAG1C,CAAK,CACjE,CAGA,GAAI,IAAA,CAAK,OAAA,GAAY,GAAA,EAAO,IAAA,CAAK,IAAA,EAAK,GAAM,GAAA,CAAK,CAM/C,IALA0C,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CACbA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAEN,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA,EACtDA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAGf,OAAO6mB,CAAAA,CAAAA,QAAAA,CAA8B,QAAA,CAAS7mB,CAAAA,CAAO,CAAC,CAAA,CAAG1C,CAAK,CAChE,CAGA,KAAO,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,EACvD0C,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAIf,GAAI,IAAA,CAAK,OAAA,GAAY,GAAA,EAAO,IAAA,CAAK,IAAA,EAAK,EAAK,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,IAAA,EAAO,CAAA,CAAG,CAIrE,IAHAA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAEN,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,EACvDA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAGf,OAAO6mB,WAA8B,UAAA,CAAW7mB,CAAK,CAAA,CAAG1C,CAAK,CAC/D,CAEA,OAAOupB,CAAAA,CAAAA,QAAAA,CAA8B,QAAA,CAAS7mB,CAAAA,CAAO,EAAE,CAAA,CAAG1C,CAAK,CACjE,CAMQ,uBAAA,EAAiC,CACvC,IAAMA,CAAAA,CAAQ,IAAA,CAAK,QAAA,CACf0C,CAAAA,CAAQ,EAAA,CAEZ,KAAO,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,OAAO,CAAA,EAChEA,CAAAA,EAAS,IAAA,CAAK,OAAA,CACd,IAAA,CAAK,OAAA,EAAQ,CAIf,OAAQA,CAAAA,EACN,KAAK,MAAA,CACH,OAAO6mB,CAAAA,CAAAA,SAAAA,CAA+B,IAAA,CAAMvpB,CAAK,CAAA,CACnD,KAAK,OAAA,CACH,OAAOupB,CAAAA,CAAAA,SAAAA,CAA+B,KAAA,CAAOvpB,CAAK,CAAA,CACpD,KAAK,KAAA,CACH,OAAOupB,CAAAA,CAAAA,KAAAA,CAA2B7mB,CAAAA,CAAO1C,CAAK,CAAA,CAChD,KAAK,IAAA,CACH,OAAOupB,CAAAA,CAAAA,IAAAA,CAA0B7mB,CAAAA,CAAO1C,CAAK,CAAA,CAC/C,KAAK,KAAA,CACH,OAAOupB,CAAAA,CAAAA,KAAAA,CAA2B7mB,CAAAA,CAAO1C,CAAK,CAAA,CAChD,QACE,OAAOupB,CAAAA,CAAAA,YAAAA,CAAkC7mB,CAAAA,CAAO1C,CAAK,CACzD,CACF,CAMQ,UAAA,EAAoB,CAC1B,IAAMA,CAAAA,CAAQ,IAAA,CAAK,QAAA,CACb2kB,CAAAA,CAAQ,IAAA,CAAK,OAAA,CACfjiB,CAAAA,CAAQ,EAAA,CAIZ,IAFA,IAAA,CAAK,OAAA,EAAQ,CAEN,IAAA,CAAK,OAAA,GAAY,IAAA,EAAQ,IAAA,CAAK,OAAA,GAAYiiB,CAAAA,EAAO,CACtD,GAAI,IAAA,CAAK,OAAA,GAAY,IAAA,CAAM,CAEzB,GADA,IAAA,CAAK,OAAA,EAAQ,CACT,IAAA,CAAK,OAAA,GAAY,IAAA,CACnB,MAAM,IAAI7jB,CAAAA,CAAW,qBAAA,CAAuBd,CAAK,CAAA,CAGnD,IAAM2G,CAAAA,CAAK,IAAA,CAAK,OAAA,CACZA,CAAAA,GAAO,IACTjE,CAAAA,EAAS;AAAA,CAAA,CACAiE,CAAAA,GAAO,GAAA,CAChBjE,CAAAA,EAAS,GAAA,CACAiE,CAAAA,GAAO,GAAA,CAChBjE,CAAAA,EAAS,IAAA,CACAiE,CAAAA,GAAO,IAAA,CAChBjE,CAAAA,EAAS,IAAA,CACAiE,IAAO,GAAA,CAChBjE,CAAAA,EAAS,GAAA,CACAiE,CAAAA,GAAO,GAAA,CAChBjE,CAAAA,EAAS,GAAA,CAETA,CAAAA,EAASiE,EAEb,CAAA,KACEjE,CAAAA,EAAS,IAAA,CAAK,OAAA,CAEhB,IAAA,CAAK,OAAA,GACP,CAEA,GAAI,IAAA,CAAK,OAAA,GAAY,IAAA,CACnB,MAAM,IAAI5B,CAAAA,CAAW,qBAAA,CAAuBd,CAAK,CAAA,CAGnD,OAAA,IAAA,CAAK,OAAA,EAAQ,CAENupB,CAAAA,CAAAA,QAAAA,CAA8B7mB,CAAAA,CAAO1C,CAAK,CACnD,CAMQ,YAAA,EAA6B,CACnC,IAAMA,CAAAA,CAAQ,IAAA,CAAK,QAAA,CACbypB,CAAAA,CAAO,IAAA,CAAK,QAElB,OAAQA,CAAAA,EACN,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNF,SAA4BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEhD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,OAAAA,CAA6BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEjD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,GACEupB,CAAAA,CAAAA,MAAAA,CAA4BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEhD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,GACEupB,CAAAA,CAAAA,OAAAA,CAA6BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEjD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,GACEupB,CAAAA,CAAAA,SAAAA,CAA+BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEnD,KAAK,GAAA,CAEH,OADA,IAAA,CAAK,SAAQ,CACT,IAAA,CAAK,OAAA,GAAY,GAAA,EACnB,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,IAAAA,CAA0B,KAAMvpB,CAAK,CAAA,EACnC,IAAA,CAAK,OAAA,GAAY,GAAA,EAC1B,IAAA,CAAK,OAAA,EAAQ,CACNupB,WAA8B,IAAA,CAAMvpB,CAAK,CAAA,EAE3CupB,CAAAA,CAAAA,IAAAA,CAA0B,GAAA,CAAKvpB,CAAK,CAAA,CAE7C,KAAK,IAEH,OADA,IAAA,CAAK,OAAA,EAAQ,CACT,IAAA,CAAK,OAAA,GAAY,GAAA,EACnB,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,IAAAA,CAA0B,IAAA,CAAMvpB,CAAK,CAAA,EACnC,IAAA,CAAK,OAAA,GAAY,KAC1B,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,QAAAA,CAA8B,IAAA,CAAMvpB,CAAK,CAAA,EAE3CupB,CAAAA,CAAAA,IAAAA,CAA0B,IAAKvpB,CAAK,CAAA,CAE7C,KAAK,GAAA,CAEH,GADA,IAAA,CAAK,OAAA,EAAQ,CACT,KAAK,OAAA,GAAY,GAAA,CACnB,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,IAAAA,CAA0B,IAAA,CAAMvpB,CAAK,CAAA,CAE9C,MAAM,IAAIc,CAAAA,CAAW,0BAAA,CAA4Bd,CAAK,CAAA,CAExD,KAAK,IAEH,GADA,IAAA,CAAK,OAAA,EAAQ,CACT,IAAA,CAAK,OAAA,GAAY,GAAA,CACnB,OAAA,IAAA,CAAK,SAAQ,CACNupB,CAAAA,CAAAA,IAAAA,CAA0B,IAAA,CAAMvpB,CAAK,CAAA,CAE9C,MAAM,IAAIc,CAAAA,CAAW,6BAA8Bd,CAAK,CAAA,CAE1D,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,WAAAA,CAAiCE,CAAAA,CAAMzpB,CAAK,CAAA,CAErD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,SAA4BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEhD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,UAA6BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEjD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,aAAgCE,CAAAA,CAAMzpB,CAAK,CAAA,CAEpD,KAAK,GAAA,CAEH,OADA,IAAA,CAAK,OAAA,GACD,IAAA,CAAK,OAAA,GAAY,GAAA,EACnB,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,cAAAA,CAAoC,IAAA,CAAMvpB,CAAK,CAAA,EAEjDupB,CAAAA,CAAAA,OAAAA,CAA6BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEjD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,SAAQ,CACNupB,CAAAA,CAAAA,QAAAA,CAA8BE,CAAAA,CAAMzpB,CAAK,CAAA,CAElD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,SAAQ,CACNupB,CAAAA,CAAAA,QAAAA,CAA8BE,CAAAA,CAAMzpB,CAAK,CAAA,CAElD,KAAK,GAAA,CACH,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,UAAAA,CAAgCE,CAAAA,CAAMzpB,CAAK,CAAA,CAEpD,KAAK,GAAA,CACH,YAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,UAAAA,CAAgCE,CAAAA,CAAMzpB,CAAK,CAAA,CAEpD,KAAK,GAAA,CACH,YAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,KAAAA,CAA2BE,CAAAA,CAAMzpB,CAAK,CAAA,CAE/C,KAAK,GAAA,CACH,YAAK,OAAA,EAAQ,CACNupB,CAAAA,CAAAA,OAAAA,CAA6BE,CAAAA,CAAMzpB,CAAK,CAAA,CAEjD,QACE,OAAO,IACX,CACF,CACF,CAAA,CC3RO,SAAS0pB,EAAAA,CAAchnB,CAAAA,CAA+C,CAC3E,OAAO,CAAE,IAAA,CAAM,SAAA,CAAW,KAAA,CAAAA,CAAM,CAClC,CAKO,SAASinB,GAAiBtiB,CAAAA,CAA8B,CAC7D,OAAO,CAAE,IAAA,CAAM,YAAA,CAAc,IAAA,CAAAA,CAAK,CACpC,CAKO,SAASuiB,EAAAA,CACdC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACc,CACd,OAAO,CAAE,IAAA,CAAM,UAAA,CAAY,QAAA,CAAAF,CAAAA,CAAU,IAAA,CAAAC,CAAAA,CAAM,KAAA,CAAAC,CAAM,CACnD,CAKO,SAASC,EAAAA,CAAcH,CAAAA,CAAkBI,CAAAA,CAA+B,CAC7E,OAAO,CAAE,IAAA,CAAM,SAAA,CAAW,QAAA,CAAAJ,CAAAA,CAAU,OAAA,CAAAI,CAAQ,CAC9C,CAKO,SAASC,EAAAA,CACdC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACa,CACb,OAAO,CAAE,IAAA,CAAM,UAAW,SAAA,CAAAF,CAAAA,CAAW,MAAA,CAAAC,CAAAA,CAAQ,OAAA,CAAAC,CAAQ,CACvD,CAKO,SAASC,EAAAA,CACdC,CAAAA,CACAC,CAAAA,CACkB,CAClB,OAAO,CAAE,IAAA,CAAM,cAAA,CAAgB,OAAAD,CAAAA,CAAQ,QAAA,CAAAC,CAAS,CAClD,CAKO,SAASC,EAAAA,CACdF,CAAAA,CACAjD,EACiB,CACjB,OAAO,CAAE,IAAA,CAAM,aAAA,CAAe,MAAA,CAAAiD,CAAAA,CAAQ,KAAA,CAAAjD,CAAM,CAC9C,CAKO,SAASoD,EAAAA,CACdH,CAAAA,CACAI,CAAAA,CACAC,CAAAA,CACgB,CAChB,OAAO,CAAE,IAAA,CAAM,YAAA,CAAc,MAAA,CAAAL,CAAAA,CAAQ,MAAA,CAAAI,CAAAA,CAAQ,KAAAC,CAAK,CACpD,CAKO,SAASC,EAAAA,CACdvC,CAAAA,CACA5lB,CAAAA,CACgB,CAChB,OAAO,CAAE,IAAA,CAAM,YAAA,CAAc,QAAA,CAAA4lB,CAAAA,CAAU,KAAA,CAAA5lB,CAAM,CAC/C,CAKO,SAASooB,EAAAA,CAAmBC,CAAAA,CAAuC,CACxE,OAAO,CAAE,IAAA,CAAM,cAAA,CAAgB,SAAAA,CAAS,CAC1C,CC7KO,IAAMC,EAAAA,CAAN,KAAuB,CAS5B,WAAA,CAAY1O,EAAiB,CAP7B,IAAA,CAAQ,QAAA,CAAmB,CAAA,CAQzB,IAAA,CAAK,MAAA,CAASA,EAChB,CAQA,OAAiB,CACf,IAAM2O,CAAAA,CAAO,IAAA,CAAK,YAAA,EAAa,CAC/B,GAAI,CAAC,IAAA,CAAK,OAAA,EAAQ,CAChB,MAAM,IAAInqB,CAAAA,CACR,CAAA,kBAAA,EAAqB,IAAA,CAAK,SAAQ,CAAE,IAAI,CAAA,CAAA,CACxC,IAAA,CAAK,OAAA,EAAQ,CAAE,QACjB,CAAA,CAEF,OAAOmqB,CACT,CAMQ,OAAA,EAAiB,CACvB,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAQ,CAClC,CAMQ,OAAA,EAAmB,CACzB,OAAO,IAAA,CAAK,OAAA,EAAQ,CAAE,OAAS,KACjC,CAMQ,OAAA,EAAiB,CACvB,OAAK,IAAA,CAAK,OAAA,EAAQ,EAChB,KAAK,QAAA,EAAA,CAEA,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CACtC,CAMQ,SAASC,CAAAA,CAA6B,CAC5C,IAAA,IAAWpnB,CAAAA,IAAQonB,CAAAA,CACjB,GAAI,IAAA,CAAK,OAAA,GAAU,IAAA,GAASpnB,CAAAA,CAC1B,OAAA,IAAA,CAAK,OAAA,EAAQ,CACN,IAAA,CAGX,OAAO,MACT,CAMQ,MAAA,CAAOA,CAAAA,CAAiBpE,CAAAA,CAAwB,CACtD,GAAI,IAAA,CAAK,OAAA,GAAU,IAAA,GAASoE,CAAAA,CAC1B,MAAM,IAAIhD,CAAAA,CAAWpB,CAAAA,CAAS,IAAA,CAAK,OAAA,GAAU,QAAQ,CAAA,CAEvD,OAAO,IAAA,CAAK,OAAA,EACd,CAOQ,YAAA,EAAwB,CAC9B,IAAIurB,CAAAA,CAAO,IAAA,CAAK,cAAA,EAAe,CAE/B,GAAI,IAAA,CAAK,KAAA,CAAA,UAAwB,CAAA,CAAG,CAClC,IAAMb,CAAAA,CAAS,IAAA,CAAK,YAAA,EAAa,CACjC,IAAA,CAAK,eAAwB,kCAAkC,CAAA,CAC/D,IAAMC,CAAAA,CAAU,IAAA,CAAK,YAAA,EAAa,CAClC,OAAOH,GAAce,CAAAA,CAAMb,CAAAA,CAAQC,CAAO,CAC5C,CAEA,OAAOY,CACT,CAMQ,gBAA0B,CAChC,IAAInB,CAAAA,CAAO,IAAA,CAAK,eAAA,EAAgB,CAEhC,KAAO,IAAA,CAAK,KAAA,CAAA,IAAkB,CAAA,EAAG,CAE/B,IAAMC,CAAAA,CAAQ,IAAA,CAAK,eAAA,EAAgB,CACnCD,EAAOF,EAAAA,CAAe,IAAA,CAAUE,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,eAAA,EAA2B,CACjC,IAAIA,CAAAA,CAAO,IAAA,CAAK,cAAA,EAAe,CAE/B,KAAO,KAAK,KAAA,CAAA,KAAmB,CAAA,EAAG,CAEhC,IAAMC,CAAAA,CAAQ,IAAA,CAAK,cAAA,EAAe,CAClCD,EAAOF,EAAAA,CAAe,KAAA,CAAUE,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,cAAA,EAA0B,CAChC,IAAIA,CAAAA,CAAO,IAAA,CAAK,eAAA,EAAgB,CAEhC,KAAO,KAAK,KAAA,CAAA,MAAoB,CAAA,EAAG,CAEjC,IAAMC,CAAAA,CAAQ,IAAA,CAAK,eAAA,EAAgB,CACnCD,EAAOF,EAAAA,CAAe,GAAA,CAAUE,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,eAAA,EAA2B,CACjC,IAAIA,CAAAA,CAAO,IAAA,CAAK,eAAA,EAAgB,CAEhC,KAAO,IAAA,CAAK,KAAA,CAAA,OAAqB,CAAA,EAAG,CAElC,IAAMC,CAAAA,CAAQ,IAAA,CAAK,eAAA,GACnBD,CAAAA,CAAOF,EAAAA,CAAe,GAAA,CAAUE,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,eAAA,EAA2B,CACjC,IAAIA,CAAAA,CAAO,IAAA,CAAK,aAAA,EAAc,CAE9B,KAAO,IAAA,CAAK,KAAA,CAAA,WAAyB,CAAA,EAAG,CAEtC,IAAMC,CAAAA,CAAQ,IAAA,CAAK,eAAc,CACjCD,CAAAA,CAAOF,EAAAA,CAAe,GAAA,CAAUE,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,aAAA,EAAyB,CAC/B,IAAIA,CAAAA,CAAO,IAAA,CAAK,eAAA,GAEhB,KAAO,IAAA,CAAK,KAAA,CAAA,IAAA,CAAA,IAAgC,CAAA,EAAG,CAC7C,IAAMD,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAAE,KAAA,CAC1CE,CAAAA,CAAQ,IAAA,CAAK,iBAAgB,CACnCD,CAAAA,CAAOF,EAAAA,CAAeC,CAAAA,CAAUC,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,eAAA,EAA2B,CACjC,IAAIA,CAAAA,CAAO,IAAA,CAAK,aAAA,GAEhB,KAAO,IAAA,CAAK,KAAA,CAAA,IAAA,CAAA,IAAA,CAAA,IAAA,CAAA,IAA4D,CAAA,EAAG,CACzE,IAAMD,CAAAA,CAAW,IAAA,CAAK,OAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAAE,KAAA,CAC1CE,CAAAA,CAAQ,IAAA,CAAK,aAAA,GACnBD,CAAAA,CAAOF,EAAAA,CAAeC,CAAAA,CAAUC,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,aAAA,EAAyB,CAC/B,IAAIA,CAAAA,CAAO,IAAA,CAAK,aAAA,EAAc,CAE9B,KAAO,IAAA,CAAK,KAAA,CAAA,QAAA,CAAA,QAAwC,CAAA,EAAG,CACrD,IAAMD,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAAE,KAAA,CAC1CE,CAAAA,CAAQ,IAAA,CAAK,aAAA,GACnBD,CAAAA,CAAOF,EAAAA,CAAeC,CAAAA,CAAUC,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,aAAA,EAAyB,CAC/B,IAAIA,CAAAA,CAAO,IAAA,CAAK,mBAAA,EAAoB,CAEpC,KAAO,IAAA,CAAK,KAAA,CAAA,MAAA,CAAA,OAAqC,CAAA,EAAG,CAClD,IAAMD,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAAE,KAAA,CAC1CE,CAAAA,CAAQ,IAAA,CAAK,mBAAA,GACnBD,CAAAA,CAAOF,EAAAA,CAAeC,CAAAA,CAAUC,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,mBAAA,EAA+B,CACrC,IAAIA,CAAAA,CAAO,IAAA,CAAK,UAAA,EAAW,CAE3B,KAAO,IAAA,CAAK,KAAA,CAAA,MAAA,CAAA,OAAA,CAAA,SAAwD,CAAA,EAAG,CACrE,IAAMD,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAAE,KAAA,CAC1CE,CAAAA,CAAQ,IAAA,CAAK,UAAA,GACnBD,CAAAA,CAAOF,EAAAA,CAAeC,CAAAA,CAAUC,CAAAA,CAAMC,CAAK,EAC7C,CAEA,OAAOD,CACT,CAMQ,UAAA,EAAsB,CAC5B,GAAI,IAAA,CAAK,KAAA,CAAA,OAAA,CAAA,KAAoC,CAAA,CAAG,CAC9C,IAAMD,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAAE,KAAA,CAC1CI,EAAU,IAAA,CAAK,UAAA,EAAW,CAChC,OAAOD,EAAAA,CAAcH,CAAAA,CAAUI,CAAO,CACxC,CAEA,OAAO,IAAA,CAAK,YAAA,EACd,CAMQ,YAAA,EAAwB,CAC9B,IAAIgB,EAAO,IAAA,CAAK,YAAA,EAAa,CAE7B,OACE,GAAI,IAAA,CAAK,KAAA,CAAA,KAAmB,CAAA,CAAG,CAC7B,IAAMT,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAA,YAAA,CAEpB,gCACF,CAAA,CACAS,CAAAA,CAAOX,EAAAA,CAAmBW,CAAAA,CAAMT,CAAAA,CAAS,KAAe,EAC1D,CAAA,KAAA,GAAW,IAAA,CAAK,KAAA,CAAA,UAAwB,CAAA,CAAG,CACzC,IAAMlD,CAAAA,CAAQ,IAAA,CAAK,YAAA,EAAa,CAChC,IAAA,CAAK,MAAA,CAAA,UAAA,CAA2B,8BAA8B,EAC9D2D,CAAAA,CAAOR,EAAAA,CAAkBQ,CAAAA,CAAM3D,CAAK,EACtC,CAAA,KAAA,GAAW,IAAA,CAAK,OAAA,GAAU,IAAA,GAAS,QAAA,CAEjC,GAAI2D,CAAAA,CAAK,IAAA,GAAS,cAAA,CAAgB,CAChC,IAAA,CAAK,SAAQ,CACb,IAAML,CAAAA,CAAkB,EAAC,CAEzB,GAAI,IAAA,CAAK,OAAA,GAAU,IAAA,GAAS,QAAA,CAE1B,IADAA,CAAAA,CAAK,IAAA,CAAK,IAAA,CAAK,YAAA,EAAc,EACtB,IAAA,CAAK,KAAA,CAAA,OAAqB,CAAA,EAC/BA,CAAAA,CAAK,IAAA,CAAK,IAAA,CAAK,YAAA,EAAc,EAIjC,IAAA,CAAK,MAAA,CAAA,QAAA,CAAyB,4BAA4B,CAAA,CAE1D,IAAMO,CAAAA,CAAaF,CAAAA,CACnBA,CAAAA,CAAOP,EAAAA,CAAiBS,CAAAA,CAAW,MAAA,CAAQA,CAAAA,CAAW,QAAA,CAAUP,CAAI,EACtE,CAAA,gBAIA,MAIJ,OAAOK,CACT,CAMQ,YAAA,EAAwB,CAE9B,GAAI,IAAA,CAAK,iCAA2D,CAAA,CAAG,CACrE,IAAM/N,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAAW,CAAC,CAAA,CAC3C,OAAOwM,EAAAA,CAAcxM,CAAAA,CAAM,KAAkC,CAC/D,CAGA,GAAI,KAAK,KAAA,CAAA,YAA0B,CAAA,CAAG,CACpC,IAAM7V,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,SAAW,CAAC,CAAA,CAAE,KAAA,CAG5C,GAAI,IAAA,CAAK,KAAA,CAAA,cAA4B,CAAA,CAAG,CACtC,IAAM3E,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAA,YAAA,CAEjB,8BACF,CAAA,CACA,OAAOmoB,EAAAA,CAAiBxjB,CAAAA,CAAM3E,EAAM,KAAe,CACrD,CAEA,OAAOinB,EAAAA,CAAiBtiB,CAAI,CAC9B,CAGA,GAAI,IAAA,CAAK,KAAA,CAAA,QAAsB,CAAA,CAAG,CAChC,IAAM4jB,CAAAA,CAAO,IAAA,CAAK,cAAa,CAC/B,OAAA,IAAA,CAAK,MAAA,CAAA,QAAA,CAAyB,6BAA6B,CAAA,CACpDA,CACT,CAGA,GAAI,KAAK,KAAA,CAAA,UAAwB,CAAA,CAAG,CAClC,IAAMF,CAAAA,CAAsB,EAAC,CAC7B,GAAI,KAAK,OAAA,EAAQ,CAAE,IAAA,GAAS,UAAA,CAE1B,IADAA,CAAAA,CAAS,IAAA,CAAK,IAAA,CAAK,YAAA,EAAc,CAAA,CAC1B,IAAA,CAAK,KAAA,CAAA,OAAqB,CAAA,EAC/BA,CAAAA,CAAS,IAAA,CAAK,KAAK,YAAA,EAAc,CAAA,CAGrC,OAAA,IAAA,CAAK,MAAA,CAAA,UAAA,CAA2B,gCAAgC,CAAA,CACzDD,EAAAA,CAAmBC,CAAQ,CACpC,CAEA,MAAM,IAAIjqB,CAAAA,CACR,CAAA,kBAAA,EAAqB,IAAA,CAAK,OAAA,GAAU,IAAI,CAAA,CAAA,CACxC,IAAA,CAAK,OAAA,EAAQ,CAAE,QACjB,CACF,CACF,CAAA,CClYO,IAAMsqB,EAAAA,CAAN,KAAgB,CASrB,QAAA,CAASvmB,CAAAA,CAAejF,CAAAA,CAA2B,CAEjD,IAAMwD,CAAAA,CAAIyB,CAAAA,CACV,OAAQA,CAAAA,CAAK,IAAA,EACX,KAAK,UACH,OAAOzB,CAAAA,CAAE,KAAA,CAEX,KAAK,YAAA,CACH,OAAO,IAAA,CAAK,kBAAA,CAAmBA,EAAE,IAAA,CAAMxD,CAAO,CAAA,CAEhD,KAAK,UAAA,CACH,OAAO,IAAA,CAAK,gBAAA,CAAiBwD,EAAE,QAAA,CAAUA,CAAAA,CAAE,IAAA,CAAMA,CAAAA,CAAE,KAAA,CAAOxD,CAAO,CAAA,CAEnE,KAAK,UACH,OAAO,IAAA,CAAK,eAAA,CAAgBwD,CAAAA,CAAE,QAAA,CAAUA,CAAAA,CAAE,OAAA,CAASxD,CAAO,EAE5D,KAAK,SAAA,CACH,OAAO,IAAA,CAAK,eAAA,CAAgBwD,CAAAA,CAAE,SAAA,CAAWA,CAAAA,CAAE,OAAQA,CAAAA,CAAE,OAAA,CAASxD,CAAO,CAAA,CAEvE,KAAK,cAAA,CACH,OAAO,IAAA,CAAK,oBAAA,CAAqBwD,CAAAA,CAAE,MAAA,CAAQA,CAAAA,CAAE,QAAA,CAAUxD,CAAO,CAAA,CAEhE,KAAK,cACH,OAAO,IAAA,CAAK,mBAAA,CAAoBwD,CAAAA,CAAE,MAAA,CAAQA,CAAAA,CAAE,KAAA,CAAOxD,CAAO,EAE5D,KAAK,YAAA,CACH,OAAO,IAAA,CAAK,kBAAA,CAAmBwD,CAAAA,CAAE,MAAA,CAAQA,CAAAA,CAAE,OAAQA,CAAAA,CAAE,IAAA,CAAMxD,CAAO,CAAA,CAEpE,KAAK,YAAA,CACH,OAAO,IAAA,CAAK,kBAAA,CAAmBwD,CAAAA,CAAE,QAAA,CAAUA,CAAAA,CAAE,KAAA,CAAOxD,CAAO,CAAA,CAE7D,KAAK,eACH,OAAO,IAAA,CAAK,oBAAA,CAAqBwD,CAAAA,CAAE,QAAA,CAAUxD,CAAO,CAAA,CAEtD,QAEE,MAAM,IAAIkB,CAAAA,CAAW,CAAA,uBAAA,EAA2B+D,CAAAA,CAAa,IAAI,CAAA,CAAE,CACvE,CACF,CAMQ,kBAAA,CAAmBwC,CAAAA,CAAczH,CAAAA,CAA2B,CAClE,OAAOA,CAAAA,CAAQ,OAAA,CAAQyH,CAAI,CAC7B,CAMQ,gBAAA,CACNwiB,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAnqB,CAAAA,CACS,CACT,IAAMyrB,CAAAA,CAAU,IAAA,CAAK,QAAA,CAASvB,CAAAA,CAAMlqB,CAAO,CAAA,CACrC0rB,CAAAA,CAAW,IAAA,CAAK,SAASvB,CAAAA,CAAOnqB,CAAO,CAAA,CAE7C,OAAQiqB,CAAAA,EAEN,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,GAAA,CAAIwB,CAAAA,CAASC,CAAQ,CAAA,CACnC,KAAK,GAAA,CACH,OAAO,KAAK,QAAA,CAASD,CAAO,CAAA,CAAI,IAAA,CAAK,QAAA,CAASC,CAAQ,CAAA,CACxD,KAAK,IACH,OAAO,IAAA,CAAK,QAAA,CAASD,CAAO,CAAA,CAAI,IAAA,CAAK,QAAA,CAASC,CAAQ,EACxD,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,QAAA,CAASD,CAAO,CAAA,CAAI,IAAA,CAAK,SAASC,CAAQ,CAAA,CACxD,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,QAAA,CAASD,CAAO,CAAA,CAAG,IAAA,CAAK,QAAA,CAASC,CAAQ,CAAC,CAAA,CAGpE,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,OAAA,CAAQD,CAAAA,CAASC,CAAQ,CAAA,CAAI,CAAA,CAC3C,KAAK,IAAA,CACH,OAAO,IAAA,CAAK,OAAA,CAAQD,CAAAA,CAASC,CAAQ,CAAA,EAAK,CAAA,CAC5C,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,OAAA,CAAQD,CAAAA,CAASC,CAAQ,CAAA,CAAI,CAAA,CAC3C,KAAK,IAAA,CACH,OAAO,IAAA,CAAK,OAAA,CAAQD,CAAAA,CAASC,CAAQ,CAAA,EAAK,EAC5C,KAAK,IAAA,CACH,OAAO,IAAA,CAAK,MAAA,CAAOD,CAAAA,CAASC,CAAQ,CAAA,CACtC,KAAK,IAAA,CACH,OAAO,CAAC,IAAA,CAAK,MAAA,CAAOD,CAAAA,CAASC,CAAQ,CAAA,CAGvC,KAAK,IAAA,CACH,OAAO,IAAA,CAAK,SAAA,CAAUD,CAAAA,CAASC,CAAAA,CAAU,CAAC,CAAA,CAAG9qB,CAAAA,GAAM,CAAA,EAAKA,CAAC,CAAA,CAC3D,KAAK,IAAA,CACH,OAAO,IAAA,CAAK,UAAU6qB,CAAAA,CAASC,CAAAA,CAAU,CAAC,CAAA,CAAG9qB,CAAAA,GAAM,CAAA,EAAKA,CAAC,CAAA,CAC3D,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,SAAA,CAAU6qB,CAAAA,CAASC,CAAAA,CAAU,CAAC,CAAA,CAAG9qB,IAAM,CAAA,CAAIA,CAAC,CAAA,CAC1D,KAAK,GAAA,CACH,OAAO,IAAA,CAAK,SAAA,CAAU6qB,EAASC,CAAAA,CAAU,CAAC,CAAA,CAAG9qB,CAAAA,GAAM,CAAA,CAAIA,CAAC,CAAA,CAC1D,KAAK,IACH,OAAO,IAAA,CAAK,SAAA,CAAU6qB,CAAAA,CAASC,CAAAA,CAAU,CAAC,CAAA,CAAG9qB,CAAAA,GAAM,EAAIA,CAAC,CAAA,CAG1D,KAAK,KAAA,CACH,OAAO,IAAA,CAAK,SAAA,CAAU6qB,CAAO,GAAK,IAAA,CAAK,SAAA,CAAUC,CAAQ,CAAA,CAC3D,KAAK,IAAA,CACH,OAAO,IAAA,CAAK,SAAA,CAAUD,CAAO,CAAA,EAAK,IAAA,CAAK,SAAA,CAAUC,CAAQ,CAAA,CAE3D,QACE,MAAM,IAAIxqB,CAAAA,CAAW,CAAA,yBAAA,EAA4B+oB,CAAQ,CAAA,CAAE,CAC/D,CACF,CAMQ,gBACNA,CAAAA,CACAI,CAAAA,CACArqB,CAAAA,CACS,CACT,IAAM8C,CAAAA,CAAQ,IAAA,CAAK,QAAA,CAASunB,EAASrqB,CAAO,CAAA,CAE5C,OAAQiqB,CAAAA,EACN,KAAK,GAAA,CACH,OAAO,CAAC,IAAA,CAAK,QAAA,CAASnnB,CAAK,CAAA,CAC7B,KAAK,KAAA,CACH,OAAO,CAAC,KAAK,SAAA,CAAUA,CAAK,CAAA,CAC9B,QACE,MAAM,IAAI5B,CAAAA,CAAW,CAAA,wBAAA,EAA2B+oB,CAAQ,CAAA,CAAE,CAC9D,CACF,CAMQ,eAAA,CACNM,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAzqB,EACS,CACT,IAAM2rB,CAAAA,CAAY,IAAA,CAAK,QAAA,CAASpB,CAAAA,CAAWvqB,CAAO,CAAA,CAClD,OAAO,IAAA,CAAK,SAAA,CAAU2rB,CAAS,CAAA,CAC3B,IAAA,CAAK,QAAA,CAASnB,CAAAA,CAAQxqB,CAAO,CAAA,CAC7B,IAAA,CAAK,QAAA,CAASyqB,CAAAA,CAASzqB,CAAO,CACpC,CAMQ,oBAAA,CACN2qB,EACAC,CAAAA,CACA5qB,CAAAA,CACS,CACT,IAAMsJ,CAAAA,CAAM,IAAA,CAAK,QAAA,CAASqhB,CAAAA,CAAQ3qB,CAAO,CAAA,CAEzC,GAAIsJ,CAAAA,EAAQ,IAAA,CACV,MAAM,IAAIpI,CAAAA,CACR,CAAA,uBAAA,EAA0B0pB,CAAQ,CAAA,kBAAA,CACpC,CAAA,CAIF,GAAIA,CAAAA,GAAa,MAAA,CAEf,OAAI,OAAOthB,CAAAA,EAAQ,SAAiB,IAAA,CAAK,KAAA,CAAMA,CAAG,CAAA,CAC9C,OAAOA,CAAAA,EAAQ,QAAA,CAAiB,MAAA,CAAOA,CAAG,CAAA,CAC1C,OAAOA,CAAAA,EAAQ,QAAA,CAAiB,QAAA,CAASA,CAAAA,CAAK,EAAE,CAAA,CAChD,OAAOA,CAAAA,EAAQ,SAAA,CAAkBA,CAAAA,CAAM,CAAA,CAAI,CAAA,CACxC,IAAA,CAAK,KAAA,CAAMA,CAAG,CAAA,CAGvB,GAAIshB,CAAAA,GAAa,MAAA,CACf,OAAO,MAAA,CAAOthB,CAAG,CAAA,CAGnB,GAAI,OAAOA,CAAAA,EAAQ,QAAA,CACjB,OAAQA,CAAAA,CAAgCshB,CAAQ,CAAA,CAGlD,MAAM,IAAI1pB,CAAAA,CAAW,CAAA,uBAAA,EAA0B0pB,CAAQ,CAAA,cAAA,CAAgB,CACzE,CAMQ,mBAAA,CACND,CAAAA,CACAjD,EACA1nB,CAAAA,CACS,CACT,IAAMsJ,CAAAA,CAAM,IAAA,CAAK,QAAA,CAASqhB,CAAAA,CAAQ3qB,CAAO,CAAA,CACnC8V,CAAAA,CAAM,IAAA,CAAK,QAAA,CAAS4R,CAAAA,CAAO1nB,CAAO,CAAA,CAExC,GAAI,MAAM,OAAA,CAAQsJ,CAAG,CAAA,CAAG,CACtB,IAAMsiB,CAAAA,CAAS,IAAA,CAAK,KAAA,CAAM9V,CAAG,CAAA,CAC7B,OAAOxM,CAAAA,CAAIsiB,CAAM,CACnB,CAEA,GAAItiB,CAAAA,YAAe,WAAY,CAC7B,IAAMsiB,CAAAA,CAAS,IAAA,CAAK,KAAA,CAAM9V,CAAG,CAAA,CAC7B,OAAOxM,CAAAA,CAAIsiB,CAAM,CACnB,CAEA,MAAM,IAAI1qB,CAAAA,CAAW,gCAAgC,CACvD,CAMQ,kBAAA,CACNypB,CAAAA,CACAI,CAAAA,CACAC,CAAAA,CACAhrB,CAAAA,CACS,CACT,IAAMsJ,EAAM,IAAA,CAAK,QAAA,CAASqhB,CAAAA,CAAQ3qB,CAAO,CAAA,CACnC6rB,CAAAA,CAAWb,CAAAA,CAAK,GAAA,CAAKnhB,GAAQ,IAAA,CAAK,QAAA,CAASA,CAAAA,CAAK7J,CAAO,CAAC,CAAA,CAG9D,GAAI+qB,CAAAA,GAAW,UAAYA,CAAAA,GAAW,MAAA,CAAQ,CAG5C,GAFI,KAAA,CAAM,OAAA,CAAQzhB,CAAG,CAAA,EACjBA,aAAe,UAAA,EACf,OAAOA,CAAAA,EAAQ,QAAA,CAAU,OAAOA,CAAAA,CAAI,MAAA,CACxC,MAAM,IAAIpI,CAAAA,CAAW,CAAA,uBAAA,EAA0B6pB,CAAM,CAAA,SAAA,CAAW,CAClE,CAGA,GAAIA,CAAAA,GAAW,OAAQ,CACrB,IAAMzmB,CAAAA,CAAOunB,CAAAA,CAAS,MAAA,CAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAS,CAAC,CAAC,CAAA,CAAI,EAAA,CAC7D,OAAI,OAAOviB,CAAAA,EAAQ,SACV,QAAA,CAASA,CAAAA,CAAKhF,CAAI,CAAA,CAEpB,IAAA,CAAK,KAAA,CAAMgF,CAAG,CACvB,CAEA,GAAIyhB,CAAAA,GAAW,MAAA,CACb,OAAO,MAAA,CAAOzhB,CAAG,CAAA,CAInB,GAAI,OAAOA,CAAAA,EAAQ,QAAA,CACjB,OAAO,IAAA,CAAK,oBAAA,CAAqBA,CAAAA,CAAKyhB,CAAAA,CAAQc,CAAQ,CAAA,CAIxD,GAAI,KAAA,CAAM,OAAA,CAAQviB,CAAG,CAAA,EAAKA,CAAAA,YAAe,UAAA,CACvC,OAAO,IAAA,CAAK,mBAAA,CAAoBA,CAAAA,CAAKyhB,CAAAA,CAAQc,CAAQ,CAAA,CAGvD,MAAM,IAAI3qB,EAAW,CAAA,gBAAA,EAAmB6pB,CAAM,CAAA,CAAE,CAClD,CAMQ,oBAAA,CACNze,CAAAA,CACAye,CAAAA,CACAC,EACS,CACT,OAAQD,CAAAA,EACN,KAAK,WAAA,CAAa,CAChB,IAAM3qB,CAAAA,CAAQ4qB,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,CAAC,CAAC,CAAA,CAAI,CAAA,CAChD3qB,CAAAA,CAAM2qB,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,EAAK,CAAC,CAAC,CAAA,CAAI,MAAA,CACpD,OAAO1e,CAAAA,CAAI,SAAA,CAAUlM,CAAAA,CAAOC,CAAG,CACjC,CAEA,KAAK,QAAA,CAAU,CACb,IAAMD,CAAAA,CAAQ4qB,CAAAA,CAAK,OAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,CAAC,CAAC,CAAA,CAAI,CAAA,CAChD/nB,EAAS+nB,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,CAAC,CAAC,EAAI,MAAA,CACvD,OAAO1e,CAAAA,CAAI,MAAA,CAAOlM,CAAAA,CAAO6C,CAAM,CACjC,CAEA,KAAK,SAAA,CACH,OAAOqJ,CAAAA,CAAI,KAAA,CAAM,EAAE,CAAA,CAAE,OAAA,EAAQ,CAAE,IAAA,CAAK,EAAE,CAAA,CAExC,KAAK,MAAA,CAAQ,CACX,IAAMhI,CAAAA,CAAO0mB,EAAK,MAAA,CAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,CAAC,CAAC,CAAA,CAAI,GACrD,OAAO,QAAA,CAAS1e,CAAAA,CAAKhI,CAAI,CAC3B,CAEA,KAAK,QAAA,CACL,KAAK,MAAA,CACH,OAAOgI,CAAAA,CAAI,MAAA,CAGb,KAAK,QAAA,CACL,KAAK,UAAA,CACH,OAAOA,CAAAA,CAAI,WAAA,EAAY,CAEzB,KAAK,UAAA,CACL,KAAK,UAAA,CACH,OAAOA,CAAAA,CAAI,WAAA,EAAY,CAEzB,KAAK,YAAA,CACH,OAAOA,CAAAA,CAAI,MAAA,CAAO,CAAC,CAAA,CAAE,WAAA,EAAY,CAAIA,CAAAA,CAAI,KAAA,CAAM,CAAC,CAAA,CAAE,WAAA,GAEpD,KAAK,OAAA,CACL,KAAK,MAAA,CACH,OAAOA,CAAAA,CAAI,IAAA,EAAK,CAElB,KAAK,QAAA,CACL,KAAK,YAAA,CACH,OAAOA,CAAAA,CAAI,SAAA,EAAU,CAEvB,KAAK,QAAA,CACL,KAAK,UAAA,CACH,OAAOA,CAAAA,CAAI,OAAA,EAAQ,CAErB,KAAK,cACL,KAAK,YAAA,CAAc,CACjB,GAAI0e,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,iCAAiC,CAAA,CAExD,OAAOoL,CAAAA,CAAI,UAAA,CAAW,MAAA,CAAO0e,CAAAA,CAAK,CAAC,CAAC,CAAC,CACvC,CAEA,KAAK,WAAA,CACL,KAAK,UAAA,CAAY,CACf,GAAIA,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,+BAA+B,EAEtD,OAAOoL,CAAAA,CAAI,QAAA,CAAS,MAAA,CAAO0e,CAAAA,CAAK,CAAC,CAAC,CAAC,CACrC,CAEA,KAAK,UAAA,CACL,KAAK,UAAA,CAAY,CACf,GAAIA,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,8BAA8B,CAAA,CAErD,OAAOoL,EAAI,QAAA,CAAS,MAAA,CAAO0e,CAAAA,CAAK,CAAC,CAAC,CAAC,CACrC,CAEA,KAAK,UAAA,CACL,KAAK,SAAA,CAAW,CACd,GAAIA,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,8BAA8B,CAAA,CAErD,OAAOoL,CAAAA,CAAI,OAAA,CAAQ,MAAA,CAAO0e,EAAK,CAAC,CAAC,CAAC,CACpC,CAEA,KAAK,OAAA,CAAS,CACZ,GAAIA,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,2BAA2B,CAAA,CAElD,OAAOoL,CAAAA,CAAI,KAAA,CAAM,MAAA,CAAO0e,CAAAA,CAAK,CAAC,CAAC,CAAC,CAClC,CAEA,KAAK,SAAA,CAAW,CACd,GAAIA,CAAAA,CAAK,MAAA,CAAS,CAAA,CAChB,MAAM,IAAI9pB,CAAAA,CAAW,8BAA8B,CAAA,CAErD,OAAOoL,CAAAA,CAAI,OAAA,CAAQ,MAAA,CAAO0e,EAAK,CAAC,CAAC,CAAA,CAAG,MAAA,CAAOA,CAAAA,CAAK,CAAC,CAAC,CAAC,CACrD,CAEA,KAAK,aAAA,CACL,KAAK,YAAA,CAAc,CACjB,GAAIA,CAAAA,CAAK,OAAS,CAAA,CAChB,MAAM,IAAI9pB,CAAAA,CAAW,kCAAkC,CAAA,CAEzD,IAAM4c,CAAAA,CAAS,OAAOkN,CAAAA,CAAK,CAAC,CAAC,CAAA,CACvBc,CAAAA,CAAU,MAAA,CAAOd,CAAAA,CAAK,CAAC,CAAC,CAAA,CAE9B,OAAO1e,CAAAA,CAAI,KAAA,CAAMwR,CAAM,CAAA,CAAE,IAAA,CAAKgO,CAAO,CACvC,CAEA,KAAK,UAAA,CACL,KAAK,UAAA,CAAY,CACf,GAAId,CAAAA,CAAK,SAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,uCAAuC,CAAA,CAE9D,IAAM+B,CAAAA,CAAS,IAAA,CAAK,KAAA,CAAM+nB,CAAAA,CAAK,CAAC,CAAC,CAAA,CAC3Be,CAAAA,CAAaf,CAAAA,CAAK,OAAS,CAAA,CAAI,MAAA,CAAOA,CAAAA,CAAK,CAAC,CAAC,CAAA,CAAI,GAAA,CACvD,OAAO1e,EAAI,QAAA,CAASrJ,CAAAA,CAAQ8oB,CAAU,CACxC,CAEA,KAAK,WAAA,CACL,KAAK,SAAU,CACb,GAAIf,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,wCAAwC,CAAA,CAE/D,IAAM+B,CAAAA,CAAS,IAAA,CAAK,KAAA,CAAM+nB,CAAAA,CAAK,CAAC,CAAC,CAAA,CAC3Be,CAAAA,CAAaf,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAI,MAAA,CAAOA,CAAAA,CAAK,CAAC,CAAC,CAAA,CAAI,GAAA,CACvD,OAAO1e,CAAAA,CAAI,MAAA,CAAOrJ,CAAAA,CAAQ8oB,CAAU,CACtC,CAEA,QACE,MAAM,IAAI7qB,CAAAA,CAAW,CAAA,uBAAA,EAA0B6pB,CAAM,CAAA,CAAE,CAC3D,CACF,CAMQ,mBAAA,CACNiB,CAAAA,CACAjB,CAAAA,CACAC,CAAAA,CACS,CACT,IAAMiB,EAAQ,KAAA,CAAM,OAAA,CAAQD,CAAG,CAAA,CAAIA,CAAAA,CAAM,KAAA,CAAM,IAAA,CAAKA,CAAG,EAEvD,OAAQjB,CAAAA,EACN,KAAK,QAAA,CACL,KAAK,MAAA,CACH,OAAOkB,EAAM,MAAA,CAEf,KAAK,OAAA,CACH,OAAOA,CAAAA,CAAM,CAAC,CAAA,CAEhB,KAAK,OACH,OAAOA,CAAAA,CAAMA,CAAAA,CAAM,MAAA,CAAS,CAAC,CAAA,CAE/B,KAAK,KAAA,CACH,OAAO,IAAA,CAAK,GAAA,CAAI,GAAGA,CAAAA,CAAM,GAAA,CAAKliB,CAAAA,EAAM,IAAA,CAAK,QAAA,CAASA,CAAC,CAAC,CAAC,CAAA,CAEvD,KAAK,KAAA,CACH,OAAO,IAAA,CAAK,GAAA,CAAI,GAAGkiB,CAAAA,CAAM,GAAA,CAAKliB,CAAAA,EAAM,IAAA,CAAK,QAAA,CAASA,CAAC,CAAC,CAAC,CAAA,CAEvD,KAAK,SAAA,CACH,OAAO,CAAC,GAAGkiB,CAAK,CAAA,CAAE,SAAQ,CAE5B,KAAK,MAAA,CACH,OAAO,CAAC,GAAGA,CAAK,CAAA,CAAE,KAAK,CAACngB,CAAAA,CAAGlL,CAAAA,GAAM,IAAA,CAAK,OAAA,CAAQkL,CAAAA,CAAGlL,CAAC,CAAC,EAErD,KAAK,UAAA,CACL,KAAK,UAAA,CAAY,CACf,GAAIoqB,CAAAA,CAAK,MAAA,GAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,8BAA8B,CAAA,CAErD,OAAO+qB,CAAAA,CAAM,KAAMrhB,CAAAA,EAAS,IAAA,CAAK,MAAA,CAAOA,CAAAA,CAAMogB,CAAAA,CAAK,CAAC,CAAC,CAAC,CACxD,CAEA,KAAK,UAAA,CACL,KAAK,SAAA,CAAW,CACd,GAAIA,CAAAA,CAAK,SAAW,CAAA,CAClB,MAAM,IAAI9pB,CAAAA,CAAW,8BAA8B,CAAA,CAErD,OAAO+qB,CAAAA,CAAM,SAAA,CAAWrhB,CAAAA,EAAS,IAAA,CAAK,MAAA,CAAOA,CAAAA,CAAMogB,CAAAA,CAAK,CAAC,CAAC,CAAC,CAC7D,CAEA,KAAK,OAAA,CAAS,CACZ,IAAM5qB,CAAAA,CAAQ4qB,CAAAA,CAAK,OAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,CAAC,CAAC,CAAA,CAAI,CAAA,CAChD3qB,EAAM2qB,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAI,IAAA,CAAK,KAAA,CAAMA,CAAAA,CAAK,CAAC,CAAC,EAAI,MAAA,CACpD,OAAOiB,CAAAA,CAAM,KAAA,CAAM7rB,CAAAA,CAAOC,CAAG,CAC/B,CAEA,QACE,MAAM,IAAIa,CAAAA,CAAW,CAAA,sBAAA,EAAyB6pB,CAAM,CAAA,CAAE,CAC1D,CACF,CAMQ,kBAAA,CACNrC,CAAAA,CACAY,CAAAA,CACAtpB,CAAAA,CACS,CACT,IAAM8C,CAAAA,CAAQ9C,CAAAA,CAAQ,aAAa0oB,CAAAA,CAAUY,CAAS,CAAA,CACtD,GAAIxmB,CAAAA,GAAU,MAAA,CACZ,MAAM,IAAI5B,CAAAA,CAAW,CAAA,YAAA,EAAewnB,CAAQ,CAAA,EAAA,EAAKY,CAAS,CAAA,WAAA,CAAa,CAAA,CAEzE,OAAOxmB,CACT,CAMQ,GAAA,CAAIonB,CAAAA,CAAeC,CAAAA,CAAyB,CAClD,OAAI,OAAOD,CAAAA,EAAS,UAAY,OAAOC,CAAAA,EAAU,QAAA,CACxC,MAAA,CAAOD,CAAI,CAAA,CAAI,MAAA,CAAOC,CAAK,EAE7B,IAAA,CAAK,QAAA,CAASD,CAAI,CAAA,CAAI,IAAA,CAAK,QAAA,CAASC,CAAK,CAClD,CAMQ,MAAA,CAAOre,CAAAA,CAAWlL,CAAAA,CAAmB,CAC3C,IAAMqB,CAAAA,CAAS6J,CAAAA,CAAIlL,EACnB,OAAOqB,CAAAA,CAAS,CAAA,CAAIA,CAAAA,CAASrB,CAAAA,CAAIqB,CACnC,CASQ,SAAA,CACNioB,EACAC,CAAAA,CACA+B,CAAAA,CACiB,CAEjB,GAAI,OAAOhC,CAAAA,EAAS,QAAA,EAAY,OAAOC,GAAU,QAAA,CAAU,CAEzD,IAAMgC,CAAAA,CAAU,OAAOjC,CAAAA,EAAS,QAAA,CAAWA,CAAAA,CAAO,MAAA,CAAOA,CAAc,CAAA,CACjEkC,CAAAA,CACJ,OAAOjC,CAAAA,EAAU,QAAA,CAAWA,CAAAA,CAAQ,OAAOA,CAAe,CAAA,CAI5D,GAAI+B,CAAAA,CAAG,QAAA,EAAS,CAAE,QAAA,CAAS,IAAI,EAC7B,OAAOC,CAAAA,EAAW,MAAA,CAAO,MAAA,CAAOC,CAAQ,CAAC,CAAA,CAE3C,GAAIF,EAAG,QAAA,EAAS,CAAE,QAAA,CAAS,IAAI,CAAA,CAC7B,OAAOC,CAAAA,EAAW,MAAA,CAAO,OAAOC,CAAQ,CAAC,CAAA,CAE3C,GAAIF,CAAAA,CAAG,QAAA,EAAS,CAAE,QAAA,CAAS,GAAG,CAAA,CAC5B,OAAOC,CAAAA,CAAUC,CAAAA,CAEnB,GAAIF,CAAAA,CAAG,QAAA,EAAS,CAAE,SAAS,GAAG,CAAA,CAC5B,OAAOC,CAAAA,CAAUC,CAAAA,CAEnB,GAAIF,CAAAA,CAAG,QAAA,GAAW,QAAA,CAAS,GAAG,CAAA,CAC5B,OAAOC,CAAAA,CAAUC,CAErB,CAGA,GAEElC,CAAAA,EAAS,IAAA,EACTC,CAAAA,GAAU,MAAA,EACVA,CAAAA,GAAU,IAAA,CAEV,MAAM,IAAIjpB,EAAW,oDAAoD,CAAA,CAI3E,OAAOgrB,CAAAA,CAAG,IAAA,CAAK,KAAA,CAAMhC,CAAI,CAAA,CAAG,KAAK,KAAA,CAAMC,CAAK,CAAC,CAC/C,CAMQ,OAAA,CAAQD,CAAAA,CAAeC,CAAAA,CAAwB,CACrD,GAAI,OAAOD,CAAAA,EAAS,QAAA,EAAY,OAAOC,CAAAA,EAAU,QAAA,CAC/C,OAAOD,EAAOC,CAAAA,CAAQ,EAAA,CAAKD,CAAAA,CAAOC,CAAAA,CAAQ,CAAA,CAAI,CAAA,CAEhD,IAAMkC,CAAAA,CAAU,KAAK,QAAA,CAASnC,CAAI,CAAA,CAC5BoC,CAAAA,CAAW,IAAA,CAAK,QAAA,CAASnC,CAAK,CAAA,CACpC,OAAOkC,CAAAA,CAAUC,CAAAA,CAAW,EAAA,CAAKD,CAAAA,CAAUC,CAAAA,CAAW,CAAA,CAAI,CAC5D,CAMQ,OAAOpC,CAAAA,CAAeC,CAAAA,CAAyB,CAErD,GAAI,OAAOD,CAAAA,EAAS,QAAA,EAAY,OAAOC,CAAAA,EAAU,QAAA,CAC/C,OAAO,MAAA,CAAOD,CAAc,CAAA,GAAM,MAAA,CAAOC,CAAe,EAI1D,IAAMoC,CAAAA,CAAWxiB,CAAAA,EACX,KAAA,CAAM,OAAA,CAAQA,CAAC,CAAA,CACVA,CAAAA,CAAE,IAAKyiB,CAAAA,EAAO,OAAOA,CAAAA,EAAM,QAAA,CAAW,MAAA,CAAOA,CAAC,CAAA,CAAKA,CAAa,EACrEziB,CAAAA,YAAa,UAAA,CAAmB,KAAA,CAAM,IAAA,CAAKA,CAAC,CAAA,CACzC,IAAA,CAGH0iB,CAAAA,CAAUF,EAAQrC,CAAI,CAAA,CACtBwC,CAAAA,CAAWH,CAAAA,CAAQpC,CAAK,CAAA,CAC9B,GAAIsC,CAAAA,EAAWC,EAAU,CACvB,GAAID,CAAAA,CAAQ,MAAA,GAAWC,CAAAA,CAAS,MAAA,CAAQ,OAAO,MAAA,CAC/C,QAASjsB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIgsB,CAAAA,CAAQ,MAAA,CAAQhsB,CAAAA,EAAAA,CAClC,GAAIgsB,CAAAA,CAAQhsB,CAAC,CAAA,GAAMisB,CAAAA,CAASjsB,CAAC,CAAA,CAAG,OAAO,MAAA,CAEzC,OAAO,KACT,CAEA,OAAOypB,CAAAA,GAASC,CAClB,CAMQ,oBAAA,CACNgB,CAAAA,CACAnrB,CAAAA,CACW,CACX,OAAOmrB,CAAAA,CAAS,GAAA,CAAK9D,CAAAA,EAAM,IAAA,CAAK,QAAA,CAASA,CAAAA,CAAGrnB,CAAO,CAAC,CACtD,CAMQ,QAAA,CAAS8C,CAAAA,CAAwB,CACvC,GAAI,OAAOA,CAAAA,EAAU,SAAU,OAAOA,CAAAA,CACtC,GAAI,OAAOA,CAAAA,EAAU,QAAA,CAAU,OAAO,MAAA,CAAOA,CAAK,CAAA,CAClD,GAAI,OAAOA,CAAAA,EAAU,SAAA,CAAW,OAAOA,CAAAA,CAAQ,EAAI,CAAA,CACnD,GAAI,OAAOA,CAAAA,EAAU,QAAA,CAAU,OAAO,UAAA,CAAWA,CAAK,EACtD,MAAM,IAAI5B,CAAAA,CAAW,CAAA,eAAA,EAAkB,OAAO4B,CAAK,CAAA,UAAA,CAAY,CACjE,CAMQ,KAAA,CAAMA,CAAAA,CAAwB,CACpC,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,QAAA,CAASA,CAAK,CAAC,CACxC,CAMQ,SAAA,CAAUA,CAAAA,CAAyB,CACzC,OAAI,OAAOA,CAAAA,EAAU,SAAA,CAAkBA,CAAAA,CACnC,OAAOA,CAAAA,EAAU,QAAA,CAAiBA,CAAAA,GAAU,CAAA,CAC5C,OAAOA,CAAAA,EAAU,QAAA,CAAiBA,CAAAA,GAAU,EAAA,CAC5C,OAAOA,CAAAA,EAAU,QAAA,CAAiBA,CAAAA,CAAM,OAAS,CAAA,CACjDA,CAAAA,EAAU,IAEhB,CACF,CAAA,CCznBO,SAAS6pB,EAAAA,CACdC,CAAAA,CACA5sB,EACS,CAGT,IAAM6sB,CAAAA,CAAeD,CAAAA,CAAW,OAAA,CAAQ,cAAA,CAAgB,EAAE,CAAA,CAGpDlQ,EADQ,IAAI6H,EAAAA,CAAMsI,CAAY,CAAA,CACf,QAAA,EAAS,CAIxBC,CAAAA,CADS,IAAI1B,GAAiB1O,CAAM,CAAA,CACvB,KAAA,EAAM,CAIzB,OADkB,IAAI8O,EAAAA,EAAU,CACf,SAASsB,CAAAA,CAAK9sB,CAAO,CACxC,CCRA,SAAS+sB,EAAAA,CAAOpV,CAAAA,CAAK,CAAE,IAAInO,CAAAA,CAAMmO,CAAAA,CAAI,MAAA,CAAQ,KAAO,EAAEnO,CAAAA,EAAO,CAAA,EAAKmO,EAAInO,CAAG,CAAA,CAAI,EAAK,CAIlF,IAKMwjB,EAAAA,CAAiB,CAAA,CACjBC,EAAAA,CAAiB,GAAA,CAQjBC,EAAAA,CAAkB,EAAA,CAGlBC,GAAkB,GAAA,CAGlBC,EAAAA,CAAkBD,EAAAA,CAAa,CAAA,CAAID,EAAAA,CAGnCG,EAAAA,CAAkB,EAAA,CA2DlBC,EAAAA,CAAgB,GAAA,CAGhBC,EAAAA,CAAgB,IAAI,KAAA,CAAA,CAAOH,EAAAA,CAAY,CAAA,EAAK,CAAC,EACnDL,GAAOQ,EAAY,CAAA,CAOnB,IAAMC,EAAAA,CAAgB,IAAI,KAAA,CAAMH,EAAAA,CAAY,CAAC,EAC7CN,EAAAA,CAAOS,EAAY,CAAA,CAKnB,IAAMC,EAAAA,CAAgB,IAAI,KAAA,CAAMH,EAAa,EAC7CP,EAAAA,CAAOU,EAAU,CAAA,CAMjB,IAAMC,EAAAA,CAAgB,IAAI,KAAA,CAAMT,EAAAA,CAAcD,EAAAA,CAAc,CAAC,CAAA,CAC7DD,EAAAA,CAAOW,EAAY,CAAA,CAGnB,IAAMC,EAAAA,CAAgB,IAAI,KAAA,CAAMT,EAAc,CAAA,CAC9CH,EAAAA,CAAOY,EAAW,CAAA,CAGlB,IAAMC,EAAAA,CAAgB,IAAI,KAAA,CAAMP,EAAS,CAAA,CACzCN,EAAAA,CAAOa,EAAS,CAAA,CA8BhB,IA4/BMC,EAAAA,CAAU,CAACC,CAAAA,CAAOnW,CAAAA,CAAKnO,CAAAA,CAAKzG,IAAQ,CACxC,IAAIgrB,CAAAA,CAAMD,CAAAA,CAAQ,KAAA,CAAS,CAAA,CACvBE,CAAAA,CAAOF,CAAAA,GAAU,GAAM,KAAA,CAAS,CAAA,CAChCtqB,CAAAA,CAAI,CAAA,CAER,KAAOgG,CAAAA,GAAQ,CAAA,EAAG,CAIhBhG,EAAIgG,CAAAA,CAAM,GAAA,CAAO,GAAA,CAAOA,CAAAA,CACxBA,CAAAA,EAAOhG,CAAAA,CAEP,GACEuqB,CAAAA,CAAMA,EAAKpW,CAAAA,CAAI5U,CAAAA,EAAK,CAAA,CAAI,CAAA,CACxBirB,CAAAA,CAAMA,CAAAA,CAAKD,CAAAA,CAAK,CAAA,CAAA,MACT,EAAEvqB,CAAAA,EAEXuqB,CAAAA,EAAM,KAAA,CACNC,CAAAA,EAAM,MACR,CAEA,OAAQD,CAAAA,CAAMC,GAAM,EAAA,CAAM,CAC5B,CAAA,CAGIC,EAAAA,CAAYJ,EAAAA,CA0BVK,EAAAA,CAAY,IAAM,CACtB,IAAIrjB,CAAAA,CAAGsjB,CAAAA,CAAQ,EAAC,CAEhB,IAAA,IAAS3qB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI,GAAA,CAAKA,CAAAA,EAAAA,CAAK,CAC5BqH,CAAAA,CAAIrH,CAAAA,CACJ,IAAA,IAASmG,CAAAA,CAAI,CAAA,CAAGA,EAAI,CAAA,CAAGA,CAAAA,EAAAA,CACrBkB,CAAAA,CAAMA,CAAAA,CAAI,CAAA,CAAM,UAAA,CAAcA,CAAAA,GAAM,CAAA,CAAOA,IAAM,CAAA,CAEnDsjB,CAAAA,CAAM3qB,CAAC,CAAA,CAAIqH,EACb,CAEA,OAAOsjB,CACT,EAGMC,EAAAA,CAAW,IAAI,WAAA,CAAYF,EAAAA,EAAW,CAAA,CAGtCG,EAAAA,CAAQ,CAACC,CAAAA,CAAK3W,CAAAA,CAAKnO,CAAAA,CAAKzG,CAAAA,GAAQ,CACpC,IAAMuI,CAAAA,CAAI8iB,EAAAA,CACJ/tB,EAAM0C,CAAAA,CAAMyG,CAAAA,CAElB8kB,CAAAA,EAAO,EAAA,CAEP,IAAA,IAAS7tB,CAAAA,CAAIsC,CAAAA,CAAKtC,CAAAA,CAAIJ,EAAKI,CAAAA,EAAAA,CACzB6tB,CAAAA,CAAOA,CAAAA,GAAQ,CAAA,CAAKhjB,CAAAA,CAAAA,CAAGgjB,CAAAA,CAAM3W,CAAAA,CAAIlX,CAAC,GAAK,GAAI,CAAA,CAG7C,OAAQ6tB,CAAAA,CAAO,EACjB,CAAA,CAGIC,CAAAA,CAAUF,EAAAA,CAqBVG,EAAAA,CAAW,CACb,CAAA,CAAQ,iBAAA,CACR,CAAA,CAAQ,YAAA,CACR,CAAA,CAAQ,EAAA,CACR,KAAQ,YAAA,CACR,IAAA,CAAQ,cAAA,CACR,IAAA,CAAQ,YAAA,CACR,IAAA,CAAQ,qBAAA,CACR,IAAA,CAAQ,eACR,IAAA,CAAQ,sBACV,CAAA,CAqBIC,EAAAA,CAAc,CAGhB,UAAA,CAAoB,CAAA,CAIpB,QAAA,CAAoB,CAAA,CACpB,OAAA,CAAoB,CAAA,CACpB,QAAoB,CAAA,CAKpB,IAAA,CAAoB,CAAA,CACpB,YAAA,CAAoB,CAAA,CACpB,WAAA,CAAoB,CAAA,CAEpB,cAAA,CAAmB,EAAA,CACnB,YAAA,CAAmB,EAAA,CACnB,WAAA,CAAmB,EAAA,CACnB,WAAA,CAAmB,EAAA,CAuBnB,UAAA,CAA0B,CAE5B,EAm2CA,IA0qBMC,EAAAA,CAAO,CAACplB,CAAAA,CAAKpD,CAAAA,GACV,MAAA,CAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAKoD,CAAAA,CAAKpD,CAAG,CAAA,CAGlDyoB,EAAAA,CAAS,SAAUrlB,CAAAA,CAAkC,CACvD,IAAMslB,CAAAA,CAAU,KAAA,CAAM,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,UAAW,CAAC,CAAA,CACvD,KAAOA,CAAAA,CAAQ,MAAA,EAAQ,CACrB,IAAM9mB,CAAAA,CAAS8mB,EAAQ,KAAA,EAAM,CAC7B,GAAK9mB,CAAAA,CAEL,CAAA,GAAI,OAAOA,CAAAA,EAAW,QAAA,CACpB,MAAM,IAAI,SAAA,CAAUA,CAAAA,CAAS,oBAAoB,CAAA,CAGnD,IAAA,IAAWqR,CAAAA,IAAKrR,CAAAA,CACV4mB,GAAK5mB,CAAAA,CAAQqR,CAAC,CAAA,GAChB7P,CAAAA,CAAI6P,CAAC,CAAA,CAAIrR,CAAAA,CAAOqR,CAAC,IAGvB,CAEA,OAAO7P,CACT,CAAA,CAIIulB,EAAAA,CAAiBC,CAAAA,EAAW,CAE9B,IAAItlB,EAAM,CAAA,CAEV,IAAA,IAAS,CAAA,CAAI,CAAA,CAAGulB,CAAAA,CAAID,CAAAA,CAAO,MAAA,CAAQ,CAAA,CAAIC,CAAAA,CAAG,CAAA,EAAA,CACxCvlB,CAAAA,EAAOslB,CAAAA,CAAO,CAAC,CAAA,CAAE,MAAA,CAInB,IAAM7sB,EAAS,IAAI,UAAA,CAAWuH,CAAG,CAAA,CAEjC,IAAA,IAAS,CAAA,CAAI,CAAA,CAAGzG,CAAAA,CAAM,EAAGgsB,CAAAA,CAAID,CAAAA,CAAO,MAAA,CAAQ,CAAA,CAAIC,CAAAA,CAAG,CAAA,EAAA,CAAK,CACtD,IAAIzuB,EAAQwuB,CAAAA,CAAO,CAAC,CAAA,CACpB7sB,CAAAA,CAAO,GAAA,CAAI3B,CAAAA,CAAOyC,CAAG,CAAA,CACrBA,CAAAA,EAAOzC,CAAAA,CAAM,OACf,CAEA,OAAO2B,CACT,CAAA,CAEI+sB,EAAAA,CAAS,CACZ,MAAA,CAAQL,EAAAA,CACR,aAAA,CAAeE,EAChB,CAAA,CAUII,EAAAA,CAAmB,KAEvB,GAAI,CAAE,MAAA,CAAO,YAAA,CAAa,KAAA,CAAM,IAAA,CAAM,IAAI,UAAA,CAAW,CAAC,CAAC,EAAG,CAAA,KAAa,CAAEA,EAAAA,CAAmB,MAAO,CAMnG,IAAMC,EAAAA,CAAW,IAAI,UAAA,CAAW,GAAG,CAAA,CACnC,IAAA,IAASC,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI,GAAA,CAAKA,IACvBD,EAAAA,CAASC,CAAC,CAAA,CAAKA,CAAAA,EAAK,GAAA,CAAM,CAAA,CAAIA,CAAAA,EAAK,GAAA,CAAM,EAAIA,CAAAA,EAAK,GAAA,CAAM,CAAA,CAAIA,CAAAA,EAAK,GAAA,CAAM,CAAA,CAAIA,CAAAA,EAAK,GAAA,CAAM,EAAI,CAAA,CAE5FD,EAAAA,CAAS,GAAG,CAAA,CAAIA,EAAAA,CAAS,GAAG,CAAA,CAAI,CAAA,CAIhC,IAAIE,EAAAA,CAAc9iB,CAAAA,EAAQ,CACxB,GAAI,OAAO,WAAA,EAAgB,UAAA,EAAc,WAAA,CAAY,UAAU,MAAA,CAC7D,OAAO,IAAI,WAAA,EAAY,CAAE,MAAA,CAAOA,CAAG,CAAA,CAGrC,IAAIqL,CAAAA,CAAK9M,CAAAA,CAAGwkB,CAAAA,CAAIC,CAAAA,CAAO7uB,CAAAA,CAAG8uB,CAAAA,CAAUjjB,CAAAA,CAAI,MAAA,CAAQkjB,EAAU,CAAA,CAG1D,IAAKF,CAAAA,CAAQ,CAAA,CAAGA,CAAAA,CAAQC,CAAAA,CAASD,CAAAA,EAAAA,CAC/BzkB,CAAAA,CAAIyB,CAAAA,CAAI,UAAA,CAAWgjB,CAAK,CAAA,CAAA,CACnBzkB,CAAAA,CAAI,KAAA,IAAY,KAAA,EAAWykB,CAAAA,CAAQ,EAAIC,CAAAA,GAC1CF,CAAAA,CAAK/iB,CAAAA,CAAI,UAAA,CAAWgjB,CAAAA,CAAQ,CAAC,CAAA,CAAA,CACxBD,CAAAA,CAAK,SAAY,KAAA,GACpBxkB,CAAAA,CAAI,KAAA,EAAYA,CAAAA,CAAI,KAAA,EAAW,EAAA,CAAA,EAAOwkB,CAAAA,CAAK,KAAA,CAAA,CAC3CC,MAGJE,CAAAA,EAAW3kB,CAAAA,CAAI,GAAA,CAAO,CAAA,CAAIA,CAAAA,CAAI,IAAA,CAAQ,CAAA,CAAIA,CAAAA,CAAI,KAAA,CAAU,CAAA,CAAI,CAAA,CAO9D,IAHA8M,CAAAA,CAAM,IAAI,UAAA,CAAW6X,CAAO,EAGvB/uB,CAAAA,CAAI,CAAA,CAAG6uB,CAAAA,CAAQ,CAAA,CAAG7uB,CAAAA,CAAI+uB,CAAAA,CAASF,CAAAA,EAAAA,CAClCzkB,CAAAA,CAAIyB,EAAI,UAAA,CAAWgjB,CAAK,CAAA,CAAA,CACnBzkB,CAAAA,CAAI,KAAA,IAAY,KAAA,EAAWykB,CAAAA,CAAQ,CAAA,CAAIC,IAC1CF,CAAAA,CAAK/iB,CAAAA,CAAI,UAAA,CAAWgjB,CAAAA,CAAQ,CAAC,CAAA,CAAA,CACxBD,CAAAA,CAAK,KAAA,IAAY,KAAA,GACpBxkB,CAAAA,CAAI,KAAA,EAAYA,CAAAA,CAAI,KAAA,EAAW,EAAA,CAAA,EAAOwkB,CAAAA,CAAK,KAAA,CAAA,CAC3CC,MAGAzkB,CAAAA,CAAI,GAAA,CAEN8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAIoK,CAAAA,CACFA,CAAAA,CAAI,IAAA,EAEb8M,EAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,CAAAA,GAAM,CAAA,CACzB8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,IAAQoK,CAAAA,CAAI,EAAA,EACdA,CAAAA,CAAI,KAAA,EAEb8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,IAAM,EAAA,CACzB8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,CAAAA,GAAM,CAAA,CAAI,EAAA,CAC7B8M,EAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,CAAAA,CAAI,EAAA,GAGvB8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,IAAQoK,CAAAA,GAAM,EAAA,CACzB8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,CAAAA,GAAM,EAAA,CAAK,GAC9B8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,CAAAA,GAAM,CAAA,CAAI,EAAA,CAC7B8M,CAAAA,CAAIlX,CAAAA,EAAG,CAAA,CAAI,GAAA,CAAQoK,CAAAA,CAAI,EAAA,CAAA,CAI3B,OAAO8M,CACT,CAAA,CAGM8X,GAAgB,CAAC9X,CAAAA,CAAKnO,CAAAA,GAAQ,CAIlC,GAAIA,CAAAA,CAAM,KAAA,EACJmO,CAAAA,CAAI,UAAYsX,EAAAA,CAClB,OAAO,MAAA,CAAO,YAAA,CAAa,KAAA,CAAM,IAAA,CAAMtX,CAAAA,CAAI,MAAA,GAAWnO,EAAMmO,CAAAA,CAAMA,CAAAA,CAAI,QAAA,CAAS,CAAA,CAAGnO,CAAG,CAAC,CAAA,CAI1F,IAAIvH,CAAAA,CAAS,EAAA,CACb,IAAA,IAAS,CAAA,CAAI,CAAA,CAAG,CAAA,CAAIuH,CAAAA,CAAK,CAAA,EAAA,CACvBvH,GAAU,MAAA,CAAO,YAAA,CAAa0V,CAAAA,CAAI,CAAC,CAAC,CAAA,CAEtC,OAAO1V,CACT,EAIIytB,EAAAA,CAAa,CAAC/X,CAAAA,CAAKgY,CAAAA,GAAQ,CAC7B,IAAMnmB,CAAAA,CAAMmmB,CAAAA,EAAOhY,EAAI,MAAA,CAEvB,GAAI,OAAO,WAAA,EAAgB,UAAA,EAAc,WAAA,CAAY,SAAA,CAAU,MAAA,CAC7D,OAAO,IAAI,WAAA,EAAY,CAAE,MAAA,CAAOA,CAAAA,CAAI,QAAA,CAAS,CAAA,CAAGgY,CAAG,CAAC,CAAA,CAGtD,IAAI,CAAA,CAAGC,CAAAA,CAKDC,CAAAA,CAAW,IAAI,KAAA,CAAMrmB,EAAM,CAAC,CAAA,CAElC,IAAKomB,CAAAA,CAAM,CAAA,CAAG,CAAA,CAAI,CAAA,CAAG,CAAA,CAAIpmB,GAAM,CAC7B,IAAIqB,CAAAA,CAAI8M,CAAAA,CAAI,CAAA,EAAG,CAAA,CAEf,GAAI9M,CAAAA,CAAI,IAAM,CAAEglB,CAAAA,CAASD,CAAAA,EAAK,CAAA,CAAI/kB,CAAAA,CAAG,QAAU,CAE/C,IAAIilB,EAAQZ,EAAAA,CAASrkB,CAAC,CAAA,CAEtB,GAAIilB,CAAAA,CAAQ,CAAA,CAAG,CAAED,CAAAA,CAASD,GAAK,CAAA,CAAI,KAAA,CAAQ,CAAA,EAAKE,CAAAA,CAAQ,CAAA,CAAG,QAAU,CAKrE,IAFAjlB,GAAKilB,CAAAA,GAAU,CAAA,CAAI,EAAA,CAAOA,CAAAA,GAAU,CAAA,CAAI,EAAA,CAAO,CAAA,CAExCA,CAAAA,CAAQ,CAAA,EAAK,CAAA,CAAItmB,CAAAA,EACtBqB,CAAAA,CAAKA,CAAAA,EAAK,CAAA,CAAM8M,CAAAA,CAAI,CAAA,EAAG,EAAI,EAAA,CAC3BmY,CAAAA,EAAAA,CAIF,GAAIA,CAAAA,CAAQ,CAAA,CAAG,CAAED,CAAAA,CAASD,CAAAA,EAAK,EAAI,KAAA,CAAQ,QAAU,CAEjD/kB,CAAAA,CAAI,KAAA,CACNglB,CAAAA,CAASD,CAAAA,EAAK,CAAA,CAAI/kB,GAElBA,CAAAA,EAAK,KAAA,CACLglB,CAAAA,CAASD,CAAAA,EAAK,CAAA,CAAI,KAAA,CAAW/kB,CAAAA,EAAK,EAAA,CAAM,KACxCglB,CAAAA,CAASD,CAAAA,EAAK,CAAA,CAAI,KAAA,CAAU/kB,CAAAA,CAAI,IAAA,EAEpC,CAEA,OAAO4kB,GAAcI,CAAAA,CAAUD,CAAG,CACpC,CAAA,CASIG,EAAAA,CAAa,CAACpY,CAAAA,CAAKgY,CAAAA,GAAQ,CAE7BA,CAAAA,CAAMA,CAAAA,EAAOhY,CAAAA,CAAI,MAAA,CACbgY,CAAAA,CAAMhY,CAAAA,CAAI,MAAA,GAAUgY,CAAAA,CAAMhY,EAAI,MAAA,CAAA,CAGlC,IAAI5U,CAAAA,CAAM4sB,CAAAA,CAAM,CAAA,CAChB,KAAO5sB,CAAAA,EAAO,CAAA,EAAA,CAAM4U,CAAAA,CAAI5U,CAAG,CAAA,CAAI,GAAA,IAAU,GAAA,EAAQA,CAAAA,EAAAA,CAQjD,OAJIA,CAAAA,CAAM,GAINA,CAAAA,GAAQ,CAAA,CAAY4sB,CAAAA,CAEhB5sB,CAAAA,CAAMmsB,EAAAA,CAASvX,CAAAA,CAAI5U,CAAG,CAAC,EAAI4sB,CAAAA,CAAO5sB,CAAAA,CAAM4sB,CAClD,CAAA,CAEIK,EAAAA,CAAU,CACb,UAAA,CAAYZ,EAAAA,CACZ,WAAYM,EAAAA,CACZ,UAAA,CAAYK,EACb,CAAA,CAqBA,SAASE,EAAAA,EAAU,CAEjB,IAAA,CAAK,MAAQ,IAAA,CACb,IAAA,CAAK,OAAA,CAAU,CAAA,CAEf,IAAA,CAAK,QAAA,CAAW,CAAA,CAEhB,IAAA,CAAK,SAAW,CAAA,CAEhB,IAAA,CAAK,MAAA,CAAS,IAAA,CACd,IAAA,CAAK,QAAA,CAAW,CAAA,CAEhB,IAAA,CAAK,UAAY,CAAA,CAEjB,IAAA,CAAK,SAAA,CAAY,CAAA,CAEjB,IAAA,CAAK,GAAA,CAAM,EAAA,CAEX,IAAA,CAAK,MAAQ,IAAA,CAEb,IAAA,CAAK,SAAA,CAAY,CAAA,CAEjB,IAAA,CAAK,KAAA,CAAQ,EACf,CAEA,IAAIC,EAAAA,CAAUD,EAAAA,CAgXd,IAkCME,EAAAA,CAAQ,KAAA,CACRC,EAAAA,CAAS,KAAA,CAqCXC,EAAAA,CAAU,SAAsBC,EAAMlwB,CAAAA,CAAO,CAC/C,IAAImwB,CAAAA,CACA/S,CAAAA,CACAgT,CAAAA,CACAC,CAAAA,CACApwB,CAAAA,CAEAqwB,EAEAC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CAEAC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAC,EACAC,CAAAA,CACAC,CAAAA,CACAnF,CAAAA,CAEA1iB,CAAAA,CACA8nB,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CAGA5H,CAAAA,CAAO6H,EAGL/M,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CAEnBC,CAAAA,CAAMD,CAAAA,CAAK,OAAA,CACX1G,CAAAA,CAAQ0G,CAAAA,CAAK,MACb9S,CAAAA,CAAO+S,CAAAA,EAAOD,CAAAA,CAAK,QAAA,CAAW,CAAA,CAAA,CAC9BE,CAAAA,CAAOF,CAAAA,CAAK,QAAA,CACZmB,EAASnB,CAAAA,CAAK,MAAA,CACdG,CAAAA,CAAMD,CAAAA,EAAQpwB,CAAAA,CAAQkwB,CAAAA,CAAK,SAAA,CAAA,CAC3BjwB,CAAAA,CAAMmwB,CAAAA,EAAQF,CAAAA,CAAK,SAAA,CAAY,GAAA,CAAA,CAE/BI,CAAAA,CAAOhM,CAAAA,CAAM,IAAA,CAEbiM,CAAAA,CAAQjM,EAAM,KAAA,CACdkM,CAAAA,CAAQlM,CAAAA,CAAM,KAAA,CACdmM,CAAAA,CAAQnM,CAAAA,CAAM,KAAA,CACdoM,CAAAA,CAAWpM,EAAM,MAAA,CACjBqM,CAAAA,CAAOrM,CAAAA,CAAM,IAAA,CACbsM,CAAAA,CAAOtM,CAAAA,CAAM,IAAA,CACbuM,CAAAA,CAAQvM,EAAM,OAAA,CACdwM,CAAAA,CAAQxM,CAAAA,CAAM,QAAA,CACdyM,CAAAA,CAAAA,CAAS,CAAA,EAAKzM,CAAAA,CAAM,OAAA,EAAW,CAAA,CAC/B0M,CAAAA,CAAAA,CAAS,CAAA,EAAK1M,CAAAA,CAAM,QAAA,EAAY,CAAA,CAMhCwB,CAAAA,CACA,EAAG,CACG8K,CAAAA,CAAO,EAAA,GACTD,CAAAA,EAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,EACRD,CAAAA,EAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,CAAA,CAAA,CAGVK,CAAAA,CAAOJ,EAAMF,CAAAA,CAAOI,CAAK,CAAA,CAEzBO,CAAAA,CACA,OAAS,CAKP,GAJAxF,CAAAA,CAAKmF,CAAAA,GAAS,EAAA,CACdN,CAAAA,IAAU7E,CAAAA,CACV8E,CAAAA,EAAQ9E,CAAAA,CACRA,CAAAA,CAAMmF,CAAAA,GAAS,GAAM,GAAA,CACjBnF,CAAAA,GAAO,CAAA,CAITuF,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIa,CAAAA,CAAO,KAAA,CAAA,KAAA,GAEjBnF,EAAK,EAAA,CAAI,CAChB1iB,CAAAA,CAAM6nB,CAAAA,CAAO,KAAA,CACbnF,CAAAA,EAAM,EAAA,CACFA,CAAAA,GACE8E,EAAO9E,CAAAA,GACT6E,CAAAA,EAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,CAAA,CAAA,CAEVxnB,GAAOunB,CAAAA,CAAAA,CAAS,CAAA,EAAK7E,CAAAA,EAAM,CAAA,CAC3B6E,CAAAA,IAAU7E,CAAAA,CACV8E,CAAAA,EAAQ9E,CAAAA,CAAAA,CAGN8E,EAAO,EAAA,GACTD,CAAAA,EAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,CAAA,CACRD,GAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,CAAA,CAAA,CAEVK,CAAAA,CAAOH,CAAAA,CAAMH,EAAOK,CAAK,CAAA,CAEzBO,CAAAA,CACA,OAAS,CAMP,GALAzF,CAAAA,CAAKmF,CAAAA,GAAS,EAAA,CACdN,CAAAA,IAAU7E,CAAAA,CACV8E,CAAAA,EAAQ9E,CAAAA,CACRA,CAAAA,CAAMmF,CAAAA,GAAS,EAAA,CAAM,IAEjBnF,CAAAA,CAAK,EAAA,CAAI,CAaX,GAZAoF,CAAAA,CAAOD,CAAAA,CAAO,KAAA,CACdnF,CAAAA,EAAM,GACF8E,CAAAA,CAAO9E,CAAAA,GACT6E,CAAAA,EAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,EACJA,CAAAA,CAAO9E,CAAAA,GACT6E,CAAAA,EAAQnH,CAAAA,CAAM2G,CAAAA,EAAK,CAAA,EAAKS,CAAAA,CACxBA,CAAAA,EAAQ,CAAA,CAAA,CAAA,CAGZM,CAAAA,EAAQP,CAAAA,CAAAA,CAAS,CAAA,EAAK7E,CAAAA,EAAM,CAAA,CAExBoF,CAAAA,CAAOZ,CAAAA,CAAM,CACfJ,CAAAA,CAAK,GAAA,CAAM,+BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAOyL,EAAAA,CACb,MAAMjK,CACR,CAMA,GAJA6K,CAAAA,IAAU7E,CAAAA,CACV8E,CAAAA,EAAQ9E,CAAAA,CAERA,CAAAA,CAAKsE,CAAAA,CAAOC,CAAAA,CACRa,EAAOpF,CAAAA,CAAI,CAEb,GADAA,CAAAA,CAAKoF,CAAAA,CAAOpF,CAAAA,CACRA,CAAAA,CAAK0E,CAAAA,EACHlM,CAAAA,CAAM,IAAA,CAAM,CACd4L,CAAAA,CAAK,GAAA,CAAM,+BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAOyL,GACb,MAAMjK,CACR,CA0BF,GAFAqL,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAcV,CAAAA,CACVD,IAAU,CAAA,CAAA,CAEZ,GADAU,CAAAA,EAAQZ,CAAAA,CAAQzE,CAAAA,CACZA,CAAAA,CAAK1iB,CAAAA,CAAK,CACZA,GAAO0iB,CAAAA,CACP,GACEuF,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIM,CAAAA,CAASS,CAAAA,EAAM,CAAA,CAAA,MACzB,EAAErF,CAAAA,EACXqF,CAAAA,CAAOf,CAAAA,CAAOc,CAAAA,CACdE,CAAAA,CAAcC,EAChB,CAAA,CAAA,KAAA,GAEOZ,CAAAA,CAAQ3E,GAGf,GAFAqF,CAAAA,EAAQZ,CAAAA,CAAQE,CAAAA,CAAQ3E,CAAAA,CACxBA,CAAAA,EAAM2E,CAAAA,CACF3E,CAAAA,CAAK1iB,EAAK,CACZA,CAAAA,EAAO0iB,CAAAA,CACP,GACEuF,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIM,CAAAA,CAASS,GAAM,CAAA,CAAA,MACzB,EAAErF,CAAAA,EAEX,GADAqF,CAAAA,CAAO,CAAA,CACHV,CAAAA,CAAQrnB,CAAAA,CAAK,CACf0iB,CAAAA,CAAK2E,CAAAA,CACLrnB,CAAAA,EAAO0iB,CAAAA,CACP,GACEuF,CAAAA,CAAOjB,CAAAA,EAAM,EAAIM,CAAAA,CAASS,CAAAA,EAAM,CAAA,CAAA,MACzB,EAAErF,CAAAA,EACXqF,CAAAA,CAAOf,CAAAA,CAAOc,CAAAA,CACdE,EAAcC,EAChB,CACF,CAAA,CAAA,KAAA,GAGAF,CAAAA,EAAQV,CAAAA,CAAQ3E,CAAAA,CACZA,CAAAA,CAAK1iB,CAAAA,CAAK,CACZA,CAAAA,EAAO0iB,CAAAA,CACP,GACEuF,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIM,CAAAA,CAASS,CAAAA,EAAM,CAAA,CAAA,MACzB,EAAErF,CAAAA,EACXqF,CAAAA,CAAOf,CAAAA,CAAOc,CAAAA,CACdE,CAAAA,CAAcC,EAChB,CAEF,KAAOjoB,CAAAA,CAAM,CAAA,EACXioB,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIgB,CAAAA,CAAYD,CAAAA,EAAM,EACnCE,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIgB,CAAAA,CAAYD,CAAAA,EAAM,CAAA,CACnCE,CAAAA,CAAOjB,CAAAA,EAAM,EAAIgB,CAAAA,CAAYD,CAAAA,EAAM,CAAA,CACnC/nB,CAAAA,EAAO,CAAA,CAELA,CAAAA,GACFioB,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIgB,CAAAA,CAAYD,CAAAA,EAAM,CAAA,CAC/B/nB,CAAAA,CAAM,CAAA,GACRioB,CAAAA,CAAOjB,CAAAA,EAAM,EAAIgB,CAAAA,CAAYD,CAAAA,EAAM,CAAA,CAAA,EAGzC,CAAA,KACK,CACHA,CAAAA,CAAOf,CAAAA,CAAOc,CAAAA,CACd,GACEG,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIiB,CAAAA,CAAOF,CAAAA,EAAM,CAAA,CAC9BE,CAAAA,CAAOjB,CAAAA,EAAM,EAAIiB,CAAAA,CAAOF,CAAAA,EAAM,CAAA,CAC9BE,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIiB,CAAAA,CAAOF,CAAAA,EAAM,EAC9B/nB,CAAAA,EAAO,CAAA,CAAA,MACAA,CAAAA,CAAM,CAAA,EACXA,CAAAA,GACFioB,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIiB,EAAOF,CAAAA,EAAM,CAAA,CAC1B/nB,CAAAA,CAAM,CAAA,GACRioB,CAAAA,CAAOjB,CAAAA,EAAM,CAAA,CAAIiB,CAAAA,CAAOF,GAAM,CAAA,CAAA,EAGpC,CACF,CAAA,KAAA,GAAA,CACUrF,CAAAA,CAAK,EAAA,IAAQ,CAAA,CAAG,CACxBmF,CAAAA,CAAOH,GAAOG,CAAAA,CAAO,KAAA,GAAuBN,CAAAA,CAAAA,CAAS,CAAA,EAAK7E,CAAAA,EAAM,CAAA,CAAG,CAAA,CACnE,SAASyF,CACX,CAAA,KACK,CACHrB,CAAAA,CAAK,GAAA,CAAM,uBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAOyL,GACb,MAAMjK,CACR,CAEA,KACF,CACF,CAAA,KAAA,GAAA,CACUgG,CAAAA,CAAK,EAAA,IAAQ,EAAG,CACxBmF,CAAAA,CAAOJ,CAAAA,CAAAA,CAAOI,CAAAA,CAAO,KAAA,GAAuBN,CAAAA,CAAAA,CAAS,CAAA,EAAK7E,CAAAA,EAAM,EAAG,CAAA,CACnE,SAASwF,CACX,CAAA,KAAA,GACSxF,CAAAA,CAAK,EAAA,CAAI,CAEhBxH,CAAAA,CAAM,KAAO0L,EAAAA,CACb,MAAMlK,CACR,CAAA,KACK,CACHoK,CAAAA,CAAK,GAAA,CAAM,6BAAA,CACX5L,EAAM,IAAA,CAAOyL,EAAAA,CACb,MAAMjK,CACR,CAEA,KACF,CACF,CAAA,MAASqK,EAAM/S,CAAAA,EAAQgT,CAAAA,CAAOnwB,CAAAA,EAG9BmJ,CAAAA,CAAMwnB,CAAAA,EAAQ,CAAA,CACdT,CAAAA,EAAO/mB,CAAAA,CACPwnB,GAAQxnB,CAAAA,EAAO,CAAA,CACfunB,CAAAA,EAAAA,CAAS,CAAA,EAAKC,CAAAA,EAAQ,CAAA,CAGtBV,CAAAA,CAAK,OAAA,CAAUC,CAAAA,CACfD,CAAAA,CAAK,QAAA,CAAWE,CAAAA,CAChBF,CAAAA,CAAK,QAAA,CAAYC,CAAAA,CAAM/S,CAAAA,CAAO,GAAKA,CAAAA,CAAO+S,CAAAA,CAAAA,CAAO,CAAA,EAAKA,CAAAA,CAAM/S,CAAAA,CAAAA,CAC5D8S,CAAAA,CAAK,SAAA,CAAaE,CAAAA,CAAOnwB,EAAM,GAAA,EAAOA,CAAAA,CAAMmwB,CAAAA,CAAAA,CAAQ,GAAA,EAAOA,CAAAA,CAAOnwB,CAAAA,CAAAA,CAClEqkB,CAAAA,CAAM,IAAA,CAAOqM,EACbrM,CAAAA,CAAM,IAAA,CAAOsM,EAEf,CAAA,CAqBMY,EAAAA,CAAU,EAAA,CACVC,EAAAA,CAAgB,GAAA,CAChBC,GAAiB,GAAA,CAGjBC,EAAAA,CAAU,CAAA,CACVC,EAAAA,CAAS,CAAA,CACTC,EAAAA,CAAU,CAAA,CAEVC,EAAAA,CAAQ,IAAI,WAAA,CAAY,CAC5B,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,EAAG,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,GACrD,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,CAAA,CAAG,CAC/D,CAAC,EAEKC,EAAAA,CAAO,IAAI,UAAA,CAAW,CAC1B,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,GAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,GAAI,EAAA,CAAI,EAAA,CAC5D,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAC1D,CAAC,CAAA,CAEKC,EAAAA,CAAQ,IAAI,WAAA,CAAY,CAC5B,CAAA,CAAG,CAAA,CAAG,EAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,GAAI,EAAA,CAAI,EAAA,CAAI,GAAA,CAAK,GAAA,CACtD,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,IAAA,CAAM,IAAA,CAAM,IAAA,CAAM,IAAA,CAAM,IAAA,CAAM,IAAA,CAClD,IAAA,CAAM,KAAA,CAAO,MAAO,KAAA,CAAO,CAAA,CAAG,CAChC,CAAC,CAAA,CAEKC,EAAAA,CAAO,IAAI,UAAA,CAAW,CAC1B,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,GAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAC5D,EAAA,CAAI,GAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CACpC,GAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,EACtB,CAAC,CAAA,CAEKC,EAAAA,CAAgB,CAACpuB,CAAAA,CAAMquB,CAAAA,CAAMC,CAAAA,CAAYC,CAAAA,CAAOtE,CAAAA,CAAOuE,CAAAA,CAAaC,CAAAA,CAAM1P,CAAAA,GAChF,CACE,IAAM+N,CAAAA,CAAO/N,CAAAA,CAAK,IAAA,CAGdzZ,CAAAA,CAAM,CAAA,CACNopB,CAAAA,CAAM,CAAA,CACNC,CAAAA,CAAM,CAAA,CAAGlD,CAAAA,CAAM,CAAA,CACfhnB,CAAAA,CAAO,CAAA,CACPmqB,CAAAA,CAAO,CAAA,CACPC,EAAO,CAAA,CACP7I,CAAAA,CAAO,CAAA,CACP8I,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CACPC,CAAAA,CACAC,EACA9N,CAAAA,CACA1hB,CAAAA,CACAoK,CAAAA,CACAzJ,CAAAA,CAAO,IAAA,CAEP+G,CAAAA,CACErI,CAAAA,CAAQ,IAAI,YAAY4uB,EAAAA,CAAU,CAAC,CAAA,CACnCwB,CAAAA,CAAO,IAAI,WAAA,CAAYxB,EAAAA,CAAU,CAAC,CAAA,CACpCyB,CAAAA,CAAQ,IAAA,CAERC,EAAAA,CAAWC,EAAAA,CAASC,EAAAA,CAkCxB,IAAKhqB,CAAAA,CAAM,EAAGA,CAAAA,EAAOooB,EAAAA,CAASpoB,CAAAA,EAAAA,CAC5BxG,CAAAA,CAAMwG,CAAG,CAAA,CAAI,CAAA,CAEf,IAAKopB,EAAM,CAAA,CAAGA,CAAAA,CAAMH,CAAAA,CAAOG,CAAAA,EAAAA,CACzB5vB,CAAAA,CAAMuvB,CAAAA,CAAKC,CAAAA,CAAaI,CAAG,CAAC,CAAA,EAAA,CAK9B,IADAjqB,CAAAA,CAAOqoB,CAAAA,CACFrB,CAAAA,CAAMiC,EAAAA,CAASjC,CAAAA,EAAO,CAAA,EACrB3sB,CAAAA,CAAM2sB,CAAG,CAAA,GAAM,CAAA,CADSA,CAAAA,EAAAA,CAC5B,CAKF,GAHIhnB,CAAAA,CAAOgnB,IACThnB,CAAAA,CAAOgnB,CAAAA,CAAAA,CAELA,CAAAA,GAAQ,CAAA,CAIV,OAAAxB,CAAAA,CAAMuE,CAAAA,EAAa,CAAA,CAAK,GAAK,EAAA,CAAO,EAAA,EAAM,EAAA,CAAM,CAAA,CAMhDvE,CAAAA,CAAMuE,CAAAA,EAAa,CAAA,CAAK,CAAA,EAAK,GAAO,EAAA,EAAM,EAAA,CAAM,CAAA,CAEhDzP,CAAAA,CAAK,IAAA,CAAO,CAAA,CACL,CAAA,CAET,IAAK4P,EAAM,CAAA,CAAGA,CAAAA,CAAMlD,CAAAA,EACd3sB,CAAAA,CAAM6vB,CAAG,CAAA,GAAM,CAAA,CADIA,CAAAA,EAAAA,CACvB,CAQF,IANIlqB,CAAAA,CAAOkqB,CAAAA,GACTlqB,CAAAA,CAAOkqB,CAAAA,CAAAA,CAIT3I,CAAAA,CAAO,CAAA,CACF1gB,CAAAA,CAAM,EAAGA,CAAAA,EAAOooB,EAAAA,CAASpoB,CAAAA,EAAAA,CAG5B,GAFA0gB,CAAAA,GAAS,CAAA,CACTA,CAAAA,EAAQlnB,CAAAA,CAAMwG,CAAG,CAAA,CACb0gB,CAAAA,CAAO,CAAA,CACT,OAAO,GAAA,CAGX,GAAIA,CAAAA,CAAO,CAAA,GAAMhmB,CAAAA,GAAS6tB,EAAAA,EAAWpC,CAAAA,GAAQ,CAAA,CAAA,CAC3C,OAAO,GAAA,CAKT,IADAyD,CAAAA,CAAK,CAAC,CAAA,CAAI,CAAA,CACL5pB,CAAAA,CAAM,CAAA,CAAGA,CAAAA,CAAMooB,EAAAA,CAASpoB,CAAAA,EAAAA,CAC3B4pB,CAAAA,CAAK5pB,EAAM,CAAC,CAAA,CAAI4pB,CAAAA,CAAK5pB,CAAG,CAAA,CAAIxG,CAAAA,CAAMwG,CAAG,CAAA,CAIvC,IAAKopB,CAAAA,CAAM,CAAA,CAAGA,CAAAA,CAAMH,CAAAA,CAAOG,CAAAA,EAAAA,CACrBL,CAAAA,CAAKC,CAAAA,CAAaI,CAAG,CAAA,GAAM,CAAA,GAC7BD,CAAAA,CAAKS,CAAAA,CAAKb,CAAAA,CAAKC,CAAAA,CAAaI,CAAG,CAAC,GAAG,CAAA,CAAIA,CAAAA,CAAAA,CAiE3C,GA3BI1uB,CAAAA,GAAS6tB,EAAAA,EACXztB,CAAAA,CAAO+uB,CAAAA,CAAQV,CAAAA,CACftnB,EAAQ,EAAA,EAECnH,CAAAA,GAAS8tB,EAAAA,EAClB1tB,CAAAA,CAAO4tB,EAAAA,CACPmB,CAAAA,CAAQlB,EAAAA,CACR9mB,CAAAA,CAAQ,MAGR/G,CAAAA,CAAO8tB,EAAAA,CACPiB,CAAAA,CAAQhB,EAAAA,CACRhnB,CAAAA,CAAQ,CAAA,CAAA,CAIV4nB,CAAAA,CAAO,CAAA,CACPL,CAAAA,CAAM,CAAA,CACNppB,CAAAA,CAAMqpB,CAAAA,CACN9kB,CAAAA,CAAO2kB,CAAAA,CACPI,CAAAA,CAAOnqB,CAAAA,CACPoqB,EAAO,CAAA,CACP1N,CAAAA,CAAM,EAAA,CACN2N,CAAAA,CAAO,CAAA,EAAKrqB,CAAAA,CACZhF,CAAAA,CAAOqvB,CAAAA,CAAO,EAGT9uB,CAAAA,GAAS8tB,EAAAA,EAAUgB,CAAAA,CAAOnB,EAAAA,EAC5B3tB,CAAAA,GAAS+tB,EAAAA,EAAWe,CAAAA,CAAOlB,EAAAA,CAC5B,OAAO,CAAA,CAIT,OAAS,CAEPwB,EAAAA,CAAY9pB,CAAAA,CAAMupB,CAAAA,CACdJ,CAAAA,CAAKC,CAAG,EAAI,CAAA,CAAIvnB,CAAAA,EAClBkoB,EAAAA,CAAU,CAAA,CACVC,EAAAA,CAAWb,CAAAA,CAAKC,CAAG,CAAA,EAEZD,EAAKC,CAAG,CAAA,EAAKvnB,CAAAA,EACpBkoB,EAAAA,CAAUF,CAAAA,CAAMV,CAAAA,CAAKC,CAAG,CAAA,CAAIvnB,CAAK,CAAA,CACjCmoB,EAAAA,CAAWlvB,CAAAA,CAAKquB,CAAAA,CAAKC,CAAG,CAAA,CAAIvnB,CAAK,CAAA,GAGjCkoB,GAAU,EAAA,CACVC,EAAAA,CAAW,CAAA,CAAA,CAIbN,CAAAA,CAAO,CAAA,EAAM1pB,CAAAA,CAAMupB,CAAAA,CACnBI,CAAAA,CAAO,CAAA,EAAKL,CAAAA,CACZD,CAAAA,CAAMM,CAAAA,CACN,GACEA,CAAAA,EAAQD,CAAAA,CACR/E,CAAAA,CAAMpgB,GAAQklB,CAAAA,EAAQF,CAAAA,CAAAA,CAAQI,CAAI,CAAA,CAAKG,EAAAA,EAAa,EAAA,CAAOC,EAAAA,EAAW,EAAA,CAAMC,GAAU,CAAA,CAAA,MAC/EL,CAAAA,GAAS,CAAA,EAIlB,IADAD,CAAAA,CAAO,CAAA,EAAM1pB,CAAAA,CAAM,CAAA,CACZypB,EAAOC,CAAAA,EACZA,CAAAA,GAAS,CAAA,CAWX,GATIA,CAAAA,GAAS,CAAA,EACXD,CAAAA,EAAQC,CAAAA,CAAO,EACfD,CAAAA,EAAQC,CAAAA,EAERD,CAAAA,CAAO,CAAA,CAITL,CAAAA,EAAAA,CACI,EAAE5vB,CAAAA,CAAMwG,CAAG,IAAM,CAAA,CAAG,CACtB,GAAIA,CAAAA,GAAQmmB,CAAAA,CAAO,MACnBnmB,CAAAA,CAAM+oB,CAAAA,CAAKC,EAAaG,CAAAA,CAAKC,CAAG,CAAC,EACnC,CAGA,GAAIppB,CAAAA,CAAMb,CAAAA,EAAAA,CAASsqB,EAAOtvB,CAAAA,IAAU0hB,CAAAA,CAAK,CAYvC,IAVI0N,CAAAA,GAAS,CAAA,GACXA,CAAAA,CAAOpqB,CAAAA,CAAAA,CAIToF,CAAAA,EAAQ8kB,CAAAA,CAGRC,CAAAA,CAAOtpB,CAAAA,CAAMupB,CAAAA,CACb7I,CAAAA,CAAO,CAAA,EAAK4I,CAAAA,CACLA,EAAOC,CAAAA,CAAOpD,CAAAA,GACnBzF,CAAAA,EAAQlnB,CAAAA,CAAM8vB,CAAAA,CAAOC,CAAI,CAAA,CACrB,EAAA7I,GAAQ,CAAA,CAAA,CAAA,EACZ4I,CAAAA,EAAAA,CACA5I,CAAAA,GAAS,CAAA,CAKX,GADA8I,CAAAA,EAAQ,CAAA,EAAKF,CAAAA,CACR5uB,IAAS8tB,EAAAA,EAAUgB,CAAAA,CAAOnB,EAAAA,EAC5B3tB,CAAAA,GAAS+tB,EAAAA,EAAWe,CAAAA,CAAOlB,EAAAA,CAC5B,SAIFzM,CAAAA,CAAM4N,CAAAA,CAAOtvB,CAAAA,CAIbwqB,CAAAA,CAAM9I,CAAG,CAAA,CAAK1c,CAAAA,EAAQ,EAAA,CAAOmqB,GAAQ,EAAA,CAAO/kB,CAAAA,CAAO2kB,CAAAA,CAAc,EACnE,CACF,CAKA,OAAIO,CAAAA,GAAS,IAIX9E,CAAAA,CAAMpgB,CAAAA,CAAOklB,CAAI,CAAA,CAAMzpB,CAAAA,CAAMupB,CAAAA,EAAS,EAAA,CAAO,EAAA,EAAM,GAAK,CAAA,CAAA,CAK1D9P,CAAAA,CAAK,IAAA,CAAOta,CAAAA,CACL,CACT,CAAA,CAGI8qB,EAAAA,CAAWnB,EAAAA,CA0BToB,EAAAA,CAAQ,CAAA,CACRC,EAAAA,CAAO,CAAA,CACPC,EAAAA,CAAQ,CAAA,CAKR,CACJ,QAAA,CAAUC,GAAY,OAAA,CAAAC,EAAAA,CAAS,OAAA,CAAAC,EAAAA,CAC/B,IAAA,CAAMC,EAAAA,CAAQ,YAAA,CAAcC,EAAAA,CAAgB,YAAaC,EAAAA,CAAe,cAAA,CAAgBC,EAAAA,CAAkB,YAAA,CAAcC,EAAAA,CAAgB,WAAA,CAAaC,EAAAA,CAAe,WAAA,CAAAC,GACpK,UAAA,CAAAC,EACF,CAAA,CAAI9F,EAAAA,CAOK+F,EAAAA,CAAO,KAAA,CACPC,EAAAA,CAAQ,KAAA,CACRC,EAAAA,CAAO,KAAA,CACPC,EAAAA,CAAK,KAAA,CACLC,EAAAA,CAAQ,KAAA,CACRC,EAAAA,CAAQ,KAAA,CACRC,GAAO,KAAA,CACPC,EAAAA,CAAU,KAAA,CACVC,EAAAA,CAAO,KAAA,CACPC,EAAAA,CAAS,KAAA,CACTC,EAAAA,CAAO,MACHC,EAAAA,CAAO,KAAA,CACPC,EAAAA,CAAS,KAAA,CACTC,EAAAA,CAAS,KAAA,CACTC,EAAAA,CAAQ,KAAA,CACRC,GAAO,KAAA,CACPC,EAAAA,CAAQ,KAAA,CACRC,EAAAA,CAAU,KAAA,CACVC,EAAAA,CAAW,KAAA,CACPC,EAAAA,CAAO,KAAA,CACPC,EAAAA,CAAM,KAAA,CACNC,EAAAA,CAAS,KAAA,CACTC,EAAAA,CAAO,KAAA,CACPC,EAAAA,CAAU,MACVC,EAAAA,CAAQ,KAAA,CACRC,EAAAA,CAAM,KAAA,CACdC,EAAAA,CAAQ,KAAA,CACRC,EAAAA,CAAS,KAAA,CACTC,GAAO,KAAA,CACPC,CAAAA,CAAM,KAAA,CACNC,EAAAA,CAAM,KAAA,CACNC,EAAAA,CAAO,KAAA,CAMVC,EAAAA,CAAc,IACdC,EAAAA,CAAe,GAAA,CAGfC,EAAAA,CAAY,EAAA,CAEZC,EAAAA,CAAYD,EAAAA,CAGZE,EAAAA,CAAWzH,CAAAA,EAAAA,CAEJA,IAAM,EAAA,CAAM,GAAA,GACbA,CAAAA,GAAM,CAAA,CAAK,KAAA,CAAA,EAAA,CACXA,CAAAA,CAAI,KAAA,GAAW,CAAA,CAAA,EAAA,CACfA,EAAI,GAAA,GAAS,EAAA,EAIzB,SAAS0H,EAAAA,EAAe,CACtB,IAAA,CAAK,IAAA,CAAO,IAAA,CACZ,KAAK,IAAA,CAAO,CAAA,CACZ,IAAA,CAAK,IAAA,CAAO,KAAA,CACZ,IAAA,CAAK,IAAA,CAAO,CAAA,CAEZ,KAAK,QAAA,CAAW,KAAA,CAChB,IAAA,CAAK,KAAA,CAAQ,CAAA,CAEb,IAAA,CAAK,IAAA,CAAO,CAAA,CACZ,IAAA,CAAK,KAAA,CAAQ,CAAA,CACb,IAAA,CAAK,KAAA,CAAQ,CAAA,CAEb,IAAA,CAAK,IAAA,CAAO,KAGZ,IAAA,CAAK,KAAA,CAAQ,CAAA,CACb,IAAA,CAAK,KAAA,CAAQ,CAAA,CACb,IAAA,CAAK,KAAA,CAAQ,EACb,IAAA,CAAK,KAAA,CAAQ,CAAA,CACb,IAAA,CAAK,MAAA,CAAS,IAAA,CAGd,IAAA,CAAK,IAAA,CAAO,EACZ,IAAA,CAAK,IAAA,CAAO,CAAA,CAGZ,IAAA,CAAK,MAAA,CAAS,CAAA,CACd,IAAA,CAAK,MAAA,CAAS,CAAA,CAGd,IAAA,CAAK,KAAA,CAAQ,CAAA,CAGb,IAAA,CAAK,OAAA,CAAU,IAAA,CACf,IAAA,CAAK,SAAW,IAAA,CAChB,IAAA,CAAK,OAAA,CAAU,CAAA,CACf,IAAA,CAAK,QAAA,CAAW,CAAA,CAGhB,IAAA,CAAK,MAAQ,CAAA,CACb,IAAA,CAAK,IAAA,CAAO,CAAA,CACZ,IAAA,CAAK,KAAA,CAAQ,CAAA,CACb,IAAA,CAAK,KAAO,CAAA,CACZ,IAAA,CAAK,IAAA,CAAO,IAAA,CAEZ,IAAA,CAAK,IAAA,CAAO,IAAI,WAAA,CAAY,GAAG,CAAA,CAC/B,IAAA,CAAK,IAAA,CAAO,IAAI,WAAA,CAAY,GAAG,CAAA,CAO/B,KAAK,MAAA,CAAS,IAAA,CACd,IAAA,CAAK,OAAA,CAAU,IAAA,CACf,IAAA,CAAK,IAAA,CAAO,CAAA,CACZ,KAAK,IAAA,CAAO,CAAA,CACZ,IAAA,CAAK,GAAA,CAAM,EACb,CAGA,IAAMC,EAAAA,CAAqBxG,GAAS,CAElC,GAAI,CAACA,CAAAA,CACH,OAAO,CAAA,CAET,IAAM5L,CAAAA,CAAQ4L,EAAK,KAAA,CACnB,OAAI,CAAC5L,CAAAA,EAASA,CAAAA,CAAM,IAAA,GAAS4L,CAAAA,EAC3B5L,CAAAA,CAAM,KAAO8P,EAAAA,EAAQ9P,CAAAA,CAAM,IAAA,CAAO6R,EAAAA,CAC3B,CAAA,CAEF,CACT,CAAA,CAGMQ,EAAAA,CAAoBzG,GAAS,CAEjC,GAAIwG,EAAAA,CAAkBxG,CAAI,CAAA,CAAK,OAAO6D,EAAAA,CACtC,IAAMzP,EAAQ4L,CAAAA,CAAK,KAAA,CACnB,OAAAA,CAAAA,CAAK,QAAA,CAAWA,CAAAA,CAAK,SAAA,CAAY5L,CAAAA,CAAM,KAAA,CAAQ,CAAA,CAC/C4L,CAAAA,CAAK,GAAA,CAAM,EAAA,CACP5L,CAAAA,CAAM,IAAA,GACR4L,CAAAA,CAAK,MAAQ5L,CAAAA,CAAM,IAAA,CAAO,CAAA,CAAA,CAE5BA,CAAAA,CAAM,IAAA,CAAO8P,EAAAA,CACb9P,CAAAA,CAAM,IAAA,CAAO,EACbA,CAAAA,CAAM,QAAA,CAAW,CAAA,CACjBA,CAAAA,CAAM,KAAA,CAAQ,EAAA,CACdA,CAAAA,CAAM,IAAA,CAAO,MACbA,CAAAA,CAAM,IAAA,CAAO,IAAA,CACbA,CAAAA,CAAM,IAAA,CAAO,CAAA,CACbA,CAAAA,CAAM,IAAA,CAAO,CAAA,CAEbA,CAAAA,CAAM,OAAA,CAAUA,CAAAA,CAAM,MAAA,CAAS,IAAI,UAAA,CAAW8R,EAAW,EACzD9R,CAAAA,CAAM,QAAA,CAAWA,CAAAA,CAAM,OAAA,CAAU,IAAI,UAAA,CAAW+R,EAAY,CAAA,CAE5D/R,EAAM,IAAA,CAAO,CAAA,CACbA,CAAAA,CAAM,IAAA,CAAO,EAAA,CAENsP,EACT,CAAA,CAGMgD,EAAAA,CAAgB1G,GAAS,CAE7B,GAAIwG,EAAAA,CAAkBxG,CAAI,CAAA,CAAK,OAAO6D,EAAAA,CACtC,IAAMzP,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CACnB,OAAA5L,CAAAA,CAAM,KAAA,CAAQ,CAAA,CACdA,CAAAA,CAAM,MAAQ,CAAA,CACdA,CAAAA,CAAM,KAAA,CAAQ,CAAA,CACPqS,EAAAA,CAAiBzG,CAAI,CAE9B,CAAA,CAGM2G,GAAgB,CAAC3G,CAAAA,CAAM4G,CAAAA,GAAe,CAC1C,IAAIC,CAAAA,CAGJ,GAAIL,EAAAA,CAAkBxG,CAAI,CAAA,CAAK,OAAO6D,EAAAA,CACtC,IAAMzP,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CAenB,OAZI4G,EAAa,CAAA,EACfC,CAAAA,CAAO,CAAA,CACPD,CAAAA,CAAa,CAACA,CAAAA,GAGdC,CAAAA,CAAAA,CAAQD,CAAAA,EAAc,GAAK,CAAA,CACvBA,CAAAA,CAAa,EAAA,GACfA,CAAAA,EAAc,EAAA,CAAA,CAAA,CAKdA,CAAAA,GAAeA,CAAAA,CAAa,CAAA,EAAKA,EAAa,EAAA,CAAA,CACzC/C,EAAAA,EAELzP,CAAAA,CAAM,MAAA,GAAW,IAAA,EAAQA,CAAAA,CAAM,KAAA,GAAUwS,CAAAA,GAC3CxS,EAAM,MAAA,CAAS,IAAA,CAAA,CAIjBA,CAAAA,CAAM,IAAA,CAAOyS,CAAAA,CACbzS,CAAAA,CAAM,KAAA,CAAQwS,CAAAA,CACPF,EAAAA,CAAa1G,CAAI,CAAA,CAC1B,CAAA,CAGM8G,EAAAA,CAAe,CAAC9G,CAAAA,CAAM4G,CAAAA,GAAe,CAEzC,GAAI,CAAC5G,CAAAA,CAAQ,OAAO6D,EAAAA,CAGpB,IAAMzP,CAAAA,CAAQ,IAAImS,GAIlBvG,CAAAA,CAAK,KAAA,CAAQ5L,CAAAA,CACbA,CAAAA,CAAM,IAAA,CAAO4L,CAAAA,CACb5L,CAAAA,CAAM,MAAA,CAAS,KACfA,CAAAA,CAAM,IAAA,CAAO8P,EAAAA,CACb,IAAM6C,CAAAA,CAAMJ,EAAAA,CAAc3G,CAAAA,CAAM4G,CAAU,EAC1C,OAAIG,CAAAA,GAAQrD,EAAAA,GACV1D,CAAAA,CAAK,KAAA,CAAQ,IAAA,CAAA,CAER+G,CACT,CAAA,CAGMC,GAAehH,CAAAA,EAEZ8G,EAAAA,CAAa9G,CAAAA,CAAMqG,EAAS,CAAA,CAcjCY,EAAAA,CAAS,IAAA,CAETC,EAAAA,CAAQC,GAGNC,EAAAA,CAAehT,CAAAA,EAAU,CAG7B,GAAI6S,EAAAA,CAAQ,CACVC,EAAAA,CAAS,IAAI,WAAW,GAAG,CAAA,CAC3BC,EAAAA,CAAU,IAAI,UAAA,CAAW,EAAE,CAAA,CAG3B,IAAI7E,CAAAA,CAAM,CAAA,CACV,KAAOA,CAAAA,CAAM,GAAA,EAAOlO,CAAAA,CAAM,IAAA,CAAKkO,CAAAA,EAAK,EAAI,CAAA,CACxC,KAAOA,CAAAA,CAAM,GAAA,EAAOlO,CAAAA,CAAM,IAAA,CAAKkO,CAAAA,EAAK,CAAA,CAAI,EACxC,KAAOA,CAAAA,CAAM,GAAA,EAAOlO,CAAAA,CAAM,IAAA,CAAKkO,CAAAA,EAAK,CAAA,CAAI,CAAA,CACxC,KAAOA,CAAAA,CAAM,GAAA,EAAOlO,CAAAA,CAAM,IAAA,CAAKkO,CAAAA,EAAK,CAAA,CAAI,CAAA,CAMxC,IAJAa,GAASE,EAAAA,CAAOjP,CAAAA,CAAM,IAAA,CAAM,CAAA,CAAG,GAAA,CAAK8S,EAAAA,CAAU,CAAA,CAAG9S,CAAAA,CAAM,KAAM,CAAE,IAAA,CAAM,CAAE,CAAC,CAAA,CAGxEkO,CAAAA,CAAM,CAAA,CACCA,CAAAA,CAAM,IAAMlO,CAAAA,CAAM,IAAA,CAAKkO,CAAAA,EAAK,CAAA,CAAI,CAAA,CAEvCa,EAAAA,CAASG,EAAAA,CAAOlP,CAAAA,CAAM,KAAM,CAAA,CAAG,EAAA,CAAM+S,EAAAA,CAAS,CAAA,CAAG/S,CAAAA,CAAM,IAAA,CAAM,CAAE,IAAA,CAAM,CAAE,CAAC,CAAA,CAGxE6S,EAAAA,CAAS,MACX,CAEA7S,CAAAA,CAAM,OAAA,CAAU8S,GAChB9S,CAAAA,CAAM,OAAA,CAAU,CAAA,CAChBA,CAAAA,CAAM,QAAA,CAAW+S,EAAAA,CACjB/S,CAAAA,CAAM,QAAA,CAAW,EACnB,CAAA,CAiBMiT,EAAAA,CAAe,CAACrH,CAAAA,CAAM3lB,CAAAA,CAAKtK,CAAAA,CAAK+G,CAAAA,GAAS,CAE7C,IAAIkqB,CAAAA,CACE5M,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CAGnB,OAAI5L,CAAAA,CAAM,MAAA,GAAW,IAAA,GACnBA,CAAAA,CAAM,KAAA,CAAQ,CAAA,EAAKA,CAAAA,CAAM,KAAA,CACzBA,CAAAA,CAAM,KAAA,CAAQ,CAAA,CACdA,EAAM,KAAA,CAAQ,CAAA,CAEdA,CAAAA,CAAM,MAAA,CAAS,IAAI,UAAA,CAAWA,CAAAA,CAAM,KAAK,GAIvCtd,CAAAA,EAAQsd,CAAAA,CAAM,KAAA,EAChBA,CAAAA,CAAM,MAAA,CAAO,GAAA,CAAI/Z,CAAAA,CAAI,QAAA,CAAStK,EAAMqkB,CAAAA,CAAM,KAAA,CAAOrkB,CAAG,CAAA,CAAG,CAAC,CAAA,CACxDqkB,CAAAA,CAAM,KAAA,CAAQ,CAAA,CACdA,CAAAA,CAAM,KAAA,CAAQA,CAAAA,CAAM,KAAA,GAGpB4M,CAAAA,CAAO5M,CAAAA,CAAM,KAAA,CAAQA,EAAM,KAAA,CACvB4M,CAAAA,CAAOlqB,CAAAA,GACTkqB,CAAAA,CAAOlqB,CAAAA,CAAAA,CAGTsd,CAAAA,CAAM,MAAA,CAAO,GAAA,CAAI/Z,EAAI,QAAA,CAAStK,CAAAA,CAAM+G,CAAAA,CAAM/G,CAAAA,CAAM+G,CAAAA,CAAOkqB,CAAI,CAAA,CAAG5M,CAAAA,CAAM,KAAK,CAAA,CACzEtd,CAAAA,EAAQkqB,CAAAA,CACJlqB,CAAAA,EAEFsd,CAAAA,CAAM,MAAA,CAAO,GAAA,CAAI/Z,CAAAA,CAAI,SAAStK,CAAAA,CAAM+G,CAAAA,CAAM/G,CAAG,CAAA,CAAG,CAAC,CAAA,CACjDqkB,CAAAA,CAAM,KAAA,CAAQtd,EACdsd,CAAAA,CAAM,KAAA,CAAQA,CAAAA,CAAM,KAAA,GAGpBA,CAAAA,CAAM,KAAA,EAAS4M,CAAAA,CACX5M,CAAAA,CAAM,QAAUA,CAAAA,CAAM,KAAA,GAASA,CAAAA,CAAM,KAAA,CAAQ,CAAA,CAAA,CAC7CA,CAAAA,CAAM,KAAA,CAAQA,CAAAA,CAAM,QAASA,CAAAA,CAAM,KAAA,EAAS4M,CAAAA,CAAAA,CAAAA,CAAAA,CAG7C,CACT,CAAA,CAGMsG,EAAAA,CAAY,CAACtH,CAAAA,CAAMuH,CAAAA,GAAU,CAEjC,IAAInT,CAAAA,CACAkF,CAAAA,CAAO6H,CAAAA,CACP1jB,CAAAA,CACA+pB,CAAAA,CACAC,EAAM7N,CAAAA,CACN6G,CAAAA,CACAC,CAAAA,CACAT,CAAAA,CAAKC,CAAAA,CACLppB,CAAAA,CACAmqB,CAAAA,CACAC,CAAAA,CACAH,EAAO,CAAA,CACPiC,CAAAA,CAAWC,CAAAA,CAASC,CAAAA,CAEpBwE,CAAAA,CAAWC,CAAAA,CAASC,CAAAA,CACpB1uB,CAAAA,CACA6tB,EACEc,CAAAA,CAAO,IAAI,UAAA,CAAW,CAAC,CAAA,CACzBlV,CAAAA,CAEAzf,CAAAA,CAEE40B,CAAAA,CACJ,IAAI,UAAA,CAAW,CAAE,EAAA,CAAI,EAAA,CAAI,EAAA,CAAI,CAAA,CAAG,CAAA,CAAG,EAAG,CAAA,CAAG,CAAA,CAAG,EAAA,CAAI,CAAA,CAAG,EAAA,CAAI,CAAA,CAAG,EAAA,CAAI,CAAA,CAAG,GAAI,CAAA,CAAG,EAAA,CAAI,CAAA,CAAG,EAAG,CAAC,CAAA,CAGrF,GAAItB,EAAAA,CAAkBxG,CAAI,CAAA,EAAK,CAACA,CAAAA,CAAK,MAAA,EAChC,CAACA,CAAAA,CAAK,KAAA,EAASA,CAAAA,CAAK,QAAA,GAAa,CAAA,CACpC,OAAO6D,EAAAA,CAGTzP,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CACT5L,CAAAA,CAAM,OAASyQ,EAAAA,GAAQzQ,CAAAA,CAAM,IAAA,CAAO0Q,EAAAA,CAAAA,CAIxC0C,CAAAA,CAAMxH,CAAAA,CAAK,QAAA,CACXmB,CAAAA,CAASnB,EAAK,MAAA,CACdpG,CAAAA,CAAOoG,CAAAA,CAAK,SAAA,CACZviB,CAAAA,CAAOuiB,CAAAA,CAAK,OAAA,CACZ1G,CAAAA,CAAQ0G,EAAK,KAAA,CACbyH,CAAAA,CAAOzH,CAAAA,CAAK,QAAA,CACZS,CAAAA,CAAOrM,CAAAA,CAAM,IAAA,CACbsM,CAAAA,CAAOtM,EAAM,IAAA,CAGb6L,CAAAA,CAAMwH,CAAAA,CACNvH,CAAAA,CAAOtG,CAAAA,CACPmN,CAAAA,CAAMrD,EAAAA,CAENqE,CAAAA,CACA,OACE,OAAQ3T,CAAAA,CAAM,IAAA,EACZ,KAAK8P,EAAAA,CACH,GAAI9P,CAAAA,CAAM,OAAS,CAAA,CAAG,CACpBA,CAAAA,CAAM,IAAA,CAAO0Q,EAAAA,CACb,KACF,CAEA,KAAOpE,EAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEA,GAAKtM,CAAAA,CAAM,IAAA,CAAO,CAAA,EAAMqM,CAAAA,GAAS,KAAA,CAAQ,CACnCrM,CAAAA,CAAM,KAAA,GAAU,IAClBA,CAAAA,CAAM,KAAA,CAAQ,EAAA,CAAA,CAEhBA,CAAAA,CAAM,KAAA,CAAQ,CAAA,CAEdyT,CAAAA,CAAK,CAAC,EAAIpH,CAAAA,CAAO,GAAA,CACjBoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,CAAA,CAAK,GAAA,CACzBrM,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAOyT,CAAAA,CAAM,CAAA,CAAG,CAAC,EAI7CpH,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CAEPtM,CAAAA,CAAM,IAAA,CAAO+P,EAAAA,CACb,KACF,CAIA,GAHI/P,CAAAA,CAAM,IAAA,GACRA,CAAAA,CAAM,IAAA,CAAK,IAAA,CAAO,KAAA,CAAA,CAEhB,EAAEA,EAAM,IAAA,CAAO,CAAA,CAAA,EAAA,CAAA,CAAA,CACdqM,CAAAA,CAAO,GAAA,GAAoB,CAAA,GAAMA,CAAAA,EAAQ,CAAA,CAAA,EAAM,EAAA,CAAI,CACtDT,CAAAA,CAAK,GAAA,CAAM,wBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACA,GAAA,CAAKtF,CAAAA,CAAO,EAAA,IAAqBwD,EAAAA,CAAY,CAC3CjE,CAAAA,CAAK,GAAA,CAAM,4BAAA,CACX5L,EAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CASA,GAPAtF,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,EAERxnB,CAAAA,CAAAA,CAAOunB,CAAAA,CAAO,EAAA,EAAmB,CAAA,CAC7BrM,CAAAA,CAAM,KAAA,GAAU,CAAA,GAClBA,CAAAA,CAAM,MAAQlb,CAAAA,CAAAA,CAEZA,CAAAA,CAAM,EAAA,EAAMA,CAAAA,CAAMkb,CAAAA,CAAM,KAAA,CAAO,CACjC4L,CAAAA,CAAK,IAAM,qBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAIA3R,CAAAA,CAAM,IAAA,CAAO,GAAKA,CAAAA,CAAM,KAAA,CAGxBA,CAAAA,CAAM,KAAA,CAAQ,CAAA,CAEd4L,CAAAA,CAAK,KAAA,CAAQ5L,CAAAA,CAAM,MAAQ,CAAA,CAC3BA,CAAAA,CAAM,IAAA,CAAOqM,CAAAA,CAAO,GAAA,CAAQkE,EAAAA,CAASE,EAAAA,CAErCpE,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CAEP,MACF,KAAKyD,EAAAA,CAEH,KAAOzD,CAAAA,CAAO,IAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,EAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAGA,GADAtM,CAAAA,CAAM,MAAQqM,CAAAA,CAAAA,CACTrM,CAAAA,CAAM,KAAA,CAAQ,GAAA,IAAU6P,EAAAA,CAAY,CACvCjE,CAAAA,CAAK,GAAA,CAAM,6BACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACA,GAAI3R,CAAAA,CAAM,KAAA,CAAQ,MAAQ,CACxB4L,CAAAA,CAAK,GAAA,CAAM,0BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACI3R,CAAAA,CAAM,IAAA,GACRA,CAAAA,CAAM,IAAA,CAAK,IAAA,CAASqM,CAAAA,EAAQ,CAAA,CAAK,CAAA,CAAA,CAE9BrM,EAAM,KAAA,CAAQ,GAAA,EAAYA,CAAAA,CAAM,IAAA,CAAO,CAAA,GAE1CyT,CAAAA,CAAK,CAAC,CAAA,CAAIpH,CAAAA,CAAO,GAAA,CACjBoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,CAAA,CAAK,GAAA,CACzBrM,EAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAOyT,CAAAA,CAAM,CAAA,CAAG,CAAC,CAAA,CAAA,CAI/CpH,EAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CAEPtM,CAAAA,CAAM,IAAA,CAAOgQ,EAAAA,CAEf,KAAKA,EAAAA,CAEH,KAAO1D,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,IACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEItM,EAAM,IAAA,GACRA,CAAAA,CAAM,IAAA,CAAK,IAAA,CAAOqM,CAAAA,CAAAA,CAEfrM,CAAAA,CAAM,KAAA,CAAQ,GAAA,EAAYA,EAAM,IAAA,CAAO,CAAA,GAE1CyT,CAAAA,CAAK,CAAC,CAAA,CAAIpH,CAAAA,CAAO,GAAA,CACjBoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,CAAA,CAAK,GAAA,CACzBoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,EAAA,CAAM,GAAA,CAC1BoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,EAAA,CAAM,GAAA,CAC1BrM,EAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAOyT,CAAAA,CAAM,CAAA,CAAG,CAAC,CAAA,CAAA,CAI/CpH,EAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CAEPtM,CAAAA,CAAM,IAAA,CAAOiQ,EAAAA,CAEf,KAAKA,EAAAA,CAEH,KAAO3D,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEItM,CAAAA,CAAM,IAAA,GACRA,CAAAA,CAAM,IAAA,CAAK,MAAA,CAAUqM,CAAAA,CAAO,GAAA,CAC5BrM,CAAAA,CAAM,KAAK,EAAA,CAAMqM,CAAAA,EAAQ,CAAA,CAAA,CAEtBrM,CAAAA,CAAM,KAAA,CAAQ,GAAA,EAAYA,CAAAA,CAAM,IAAA,CAAO,IAE1CyT,CAAAA,CAAK,CAAC,CAAA,CAAIpH,CAAAA,CAAO,GAAA,CACjBoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,CAAA,CAAK,GAAA,CACzBrM,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAOyT,EAAM,CAAA,CAAG,CAAC,CAAA,CAAA,CAI/CpH,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CAEPtM,CAAAA,CAAM,KAAOkQ,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAIlQ,CAAAA,CAAM,KAAA,CAAQ,IAAA,CAAQ,CAExB,KAAOsM,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,IACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEAtM,EAAM,MAAA,CAASqM,CAAAA,CACXrM,CAAAA,CAAM,IAAA,GACRA,CAAAA,CAAM,IAAA,CAAK,SAAA,CAAYqM,CAAAA,CAAAA,CAEpBrM,EAAM,KAAA,CAAQ,GAAA,EAAYA,CAAAA,CAAM,IAAA,CAAO,CAAA,GAE1CyT,CAAAA,CAAK,CAAC,CAAA,CAAIpH,EAAO,GAAA,CACjBoH,CAAAA,CAAK,CAAC,CAAA,CAAKpH,CAAAA,GAAS,CAAA,CAAK,GAAA,CACzBrM,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAOyT,CAAAA,CAAM,CAAA,CAAG,CAAC,CAAA,CAAA,CAI/CpH,EAAO,CAAA,CACPC,CAAAA,CAAO,EAET,CAAA,KACStM,CAAAA,CAAM,IAAA,GACbA,CAAAA,CAAM,IAAA,CAAK,MAAQ,IAAA,CAAA,CAErBA,CAAAA,CAAM,IAAA,CAAOmQ,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAInQ,CAAAA,CAAM,MAAQ,IAAA,GAChBtd,CAAAA,CAAOsd,CAAAA,CAAM,MAAA,CACTtd,CAAAA,CAAO2wB,CAAAA,GAAQ3wB,CAAAA,CAAO2wB,CAAAA,CAAAA,CACtB3wB,CAAAA,GACEsd,CAAAA,CAAM,IAAA,GACRlb,CAAAA,CAAMkb,CAAAA,CAAM,IAAA,CAAK,SAAA,CAAYA,CAAAA,CAAM,OAC9BA,CAAAA,CAAM,IAAA,CAAK,KAAA,GAEdA,CAAAA,CAAM,IAAA,CAAK,KAAA,CAAQ,IAAI,UAAA,CAAWA,EAAM,IAAA,CAAK,SAAS,CAAA,CAAA,CAExDA,CAAAA,CAAM,IAAA,CAAK,KAAA,CAAM,GAAA,CACfkF,CAAAA,CAAM,SACJ7b,CAAAA,CAGAA,CAAAA,CAAO3G,CACT,CAAA,CAEAoC,CACF,CAAA,CAAA,CAKGkb,CAAAA,CAAM,KAAA,CAAQ,GAAA,EAAYA,CAAAA,CAAM,IAAA,CAAO,CAAA,GAC1CA,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,MAAOkF,CAAAA,CAAOxiB,CAAAA,CAAM2G,CAAI,CAAA,CAAA,CAEtDgqB,CAAAA,EAAQ3wB,CAAAA,CACR2G,CAAAA,EAAQ3G,CAAAA,CACRsd,EAAM,MAAA,EAAUtd,CAAAA,CAAAA,CAEdsd,CAAAA,CAAM,MAAA,CAAA,CAAU,MAAM2T,CAAAA,CAE5B3T,CAAAA,CAAM,MAAA,CAAS,EACfA,CAAAA,CAAM,IAAA,CAAOoQ,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAIpQ,CAAAA,CAAM,KAAA,CAAQ,KAAQ,CACxB,GAAIqT,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBjxB,CAAAA,CAAO,CAAA,CACP,GAEEoC,CAAAA,CAAMogB,CAAAA,CAAM7b,CAAAA,CAAO3G,CAAAA,EAAM,CAAA,CAErBsd,CAAAA,CAAM,IAAA,EAAQlb,CAAAA,EACbkb,EAAM,MAAA,CAAS,KAAA,GAClBA,CAAAA,CAAM,IAAA,CAAK,IAAA,EAAQ,MAAA,CAAO,YAAA,CAAalb,CAAG,SAErCA,CAAAA,EAAOpC,CAAAA,CAAO2wB,CAAAA,EAOvB,GALKrT,CAAAA,CAAM,KAAA,CAAQ,GAAA,EAAYA,CAAAA,CAAM,IAAA,CAAO,CAAA,GAC1CA,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAOkF,CAAAA,CAAOxiB,EAAM2G,CAAI,CAAA,CAAA,CAEtDgqB,CAAAA,EAAQ3wB,CAAAA,CACR2G,CAAAA,EAAQ3G,CAAAA,CACJoC,CAAAA,CAAO,MAAM6uB,CACnB,CAAA,KACS3T,CAAAA,CAAM,IAAA,GACbA,CAAAA,CAAM,IAAA,CAAK,IAAA,CAAO,IAAA,CAAA,CAEpBA,CAAAA,CAAM,OAAS,CAAA,CACfA,CAAAA,CAAM,IAAA,CAAOqQ,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAIrQ,CAAAA,CAAM,KAAA,CAAQ,IAAA,CAAQ,CACxB,GAAIqT,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBjxB,EAAO,CAAA,CACP,GACEoC,CAAAA,CAAMogB,CAAAA,CAAM7b,CAAAA,CAAO3G,CAAAA,EAAM,CAAA,CAErBsd,CAAAA,CAAM,MAAQlb,CAAAA,EACbkb,CAAAA,CAAM,MAAA,CAAS,KAAA,GAClBA,CAAAA,CAAM,IAAA,CAAK,OAAA,EAAW,MAAA,CAAO,aAAalb,CAAG,CAAA,CAAA,CAAA,MAExCA,CAAAA,EAAOpC,CAAAA,CAAO2wB,CAAAA,EAMvB,GALKrT,CAAAA,CAAM,KAAA,CAAQ,GAAA,EAAYA,CAAAA,CAAM,IAAA,CAAO,CAAA,GAC1CA,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,MAAOkF,CAAAA,CAAOxiB,CAAAA,CAAM2G,CAAI,CAAA,CAAA,CAEtDgqB,CAAAA,EAAQ3wB,CAAAA,CACR2G,CAAAA,EAAQ3G,CAAAA,CACJoC,EAAO,MAAM6uB,CACnB,CAAA,KACS3T,CAAAA,CAAM,IAAA,GACbA,CAAAA,CAAM,IAAA,CAAK,OAAA,CAAU,MAEvBA,CAAAA,CAAM,IAAA,CAAOsQ,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAItQ,CAAAA,CAAM,KAAA,CAAQ,IAAQ,CAExB,KAAOsM,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEA,GAAKtM,CAAAA,CAAM,IAAA,CAAO,CAAA,EAAMqM,CAAAA,IAAUrM,CAAAA,CAAM,KAAA,CAAQ,OAAS,CACvD4L,CAAAA,CAAK,GAAA,CAAM,qBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAEAtF,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,EAET,CACItM,CAAAA,CAAM,IAAA,GACRA,EAAM,IAAA,CAAK,IAAA,CAASA,CAAAA,CAAM,KAAA,EAAS,CAAA,CAAK,CAAA,CACxCA,CAAAA,CAAM,IAAA,CAAK,KAAO,IAAA,CAAA,CAEpB4L,CAAAA,CAAK,KAAA,CAAQ5L,CAAAA,CAAM,KAAA,CAAQ,CAAA,CAC3BA,CAAAA,CAAM,IAAA,CAAOyQ,GACb,MACF,KAAKF,EAAAA,CAEH,KAAOjE,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,IAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,EACzBA,CAAAA,EAAQ,EACV,CAEAV,CAAAA,CAAK,KAAA,CAAQ5L,CAAAA,CAAM,KAAA,CAAQkS,EAAAA,CAAQ7F,CAAI,CAAA,CAEvCA,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,CAAA,CAEPtM,CAAAA,CAAM,IAAA,CAAOwQ,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAIxQ,CAAAA,CAAM,QAAA,GAAa,CAAA,CAErB,OAAA4L,CAAAA,CAAK,QAAA,CAAWwH,CAAAA,CAChBxH,CAAAA,CAAK,SAAA,CAAYpG,CAAAA,CACjBoG,CAAAA,CAAK,OAAA,CAAUviB,CAAAA,CACfuiB,CAAAA,CAAK,SAAWyH,CAAAA,CAChBrT,CAAAA,CAAM,IAAA,CAAOqM,CAAAA,CACbrM,CAAAA,CAAM,IAAA,CAAOsM,CAAAA,CAENkD,EAAAA,CAET5D,EAAK,KAAA,CAAQ5L,CAAAA,CAAM,KAAA,CAAQ,CAAA,CAC3BA,CAAAA,CAAM,IAAA,CAAOyQ,EAAAA,CAEf,KAAKA,GACH,GAAI0C,CAAAA,GAAU/D,EAAAA,EAAW+D,CAAAA,GAAU9D,EAAAA,CAAW,MAAMsE,CAAAA,CAEtD,KAAKjD,GACH,GAAI1Q,CAAAA,CAAM,IAAA,CAAM,CAEdqM,CAAAA,IAAUC,CAAAA,CAAO,CAAA,CACjBA,CAAAA,EAAQA,EAAO,CAAA,CAEftM,CAAAA,CAAM,IAAA,CAAOwR,EAAAA,CACb,KACF,CAEA,KAAOlF,CAAAA,CAAO,GAAG,CACf,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,EAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAQA,OANAtM,CAAAA,CAAM,IAAA,CAAQqM,CAAAA,CAAO,CAAA,CAErBA,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,CAAA,CAGCD,CAAAA,CAAO,GACd,KAAK,CAAA,CAGHrM,CAAAA,CAAM,IAAA,CAAO2Q,EAAAA,CACb,MACF,OAKE,GAJAqC,EAAAA,CAAYhT,CAAK,CAAA,CAGjBA,CAAAA,CAAM,IAAA,CAAOiR,EAAAA,CACTkC,CAAAA,GAAU9D,GAAS,CAErBhD,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,CAAA,CAER,MAAMqH,CACR,CACA,MACF,KAAK,CAAA,CAGH3T,CAAAA,CAAM,IAAA,CAAO8Q,EAAAA,CACb,MACF,OACElF,CAAAA,CAAK,GAAA,CAAM,oBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,EACjB,CAEAtF,CAAAA,IAAU,EACVC,CAAAA,EAAQ,CAAA,CAER,MACF,KAAKqE,EAAAA,CAMH,IAJAtE,CAAAA,IAAUC,CAAAA,CAAO,EACjBA,CAAAA,EAAQA,CAAAA,CAAO,CAAA,CAGRA,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,EACzBA,CAAAA,EAAQ,EACV,CAEA,GAAA,CAAKD,CAAAA,CAAO,KAAA,KAAcA,CAAAA,GAAS,EAAA,CAAM,OAAS,CAChDT,CAAAA,CAAK,GAAA,CAAM,8BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CASA,GARA3R,CAAAA,CAAM,MAAA,CAASqM,CAAAA,CAAO,KAAA,CAItBA,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,EAEPtM,CAAAA,CAAM,IAAA,CAAO4Q,EAAAA,CACTuC,CAAAA,GAAU9D,EAAAA,CAAW,MAAMsE,CAAAA,CAEjC,KAAK/C,GACH5Q,CAAAA,CAAM,IAAA,CAAO6Q,EAAAA,CAEf,KAAKA,EAAAA,CAEH,GADAnuB,CAAAA,CAAOsd,CAAAA,CAAM,OACTtd,CAAAA,CAAM,CAGR,GAFIA,CAAAA,CAAO2wB,CAAAA,GAAQ3wB,CAAAA,CAAO2wB,CAAAA,CAAAA,CACtB3wB,CAAAA,CAAO8iB,IAAQ9iB,CAAAA,CAAO8iB,CAAAA,CAAAA,CACtB9iB,CAAAA,GAAS,CAAA,CAAK,MAAMixB,CAAAA,CAExB5G,CAAAA,CAAO,GAAA,CAAI7H,CAAAA,CAAM,QAAA,CAAS7b,CAAAA,CAAMA,CAAAA,CAAO3G,CAAI,CAAA,CAAG0wB,CAAG,CAAA,CAEjDC,GAAQ3wB,CAAAA,CACR2G,CAAAA,EAAQ3G,CAAAA,CACR8iB,CAAAA,EAAQ9iB,CAAAA,CACR0wB,CAAAA,EAAO1wB,CAAAA,CACPsd,CAAAA,CAAM,QAAUtd,CAAAA,CAChB,KACF,CAEAsd,CAAAA,CAAM,IAAA,CAAOyQ,EAAAA,CACb,MACF,KAAKK,GAEH,KAAOxE,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAkBA,GAhBAtM,CAAAA,CAAM,IAAA,CAAA,CAAQqM,CAAAA,CAAO,EAAA,EAAmB,GAAA,CAExCA,CAAAA,IAAU,EACVC,CAAAA,EAAQ,CAAA,CAERtM,CAAAA,CAAM,KAAA,CAAA,CAASqM,CAAAA,CAAO,EAAA,EAAmB,CAAA,CAEzCA,CAAAA,IAAU,EACVC,CAAAA,EAAQ,CAAA,CAERtM,CAAAA,CAAM,KAAA,CAAA,CAASqM,CAAAA,CAAO,EAAA,EAAmB,CAAA,CAEzCA,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,CAAA,CAGJtM,CAAAA,CAAM,IAAA,CAAO,GAAA,EAAOA,CAAAA,CAAM,KAAA,CAAQ,GAAI,CACxC4L,CAAAA,CAAK,GAAA,CAAM,qCAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAGA3R,CAAAA,CAAM,IAAA,CAAO,CAAA,CACbA,CAAAA,CAAM,IAAA,CAAO+Q,EAAAA,CAEf,KAAKA,EAAAA,CACH,KAAO/Q,CAAAA,CAAM,IAAA,CAAOA,CAAAA,CAAM,KAAA,EAAO,CAE/B,KAAOsM,CAAAA,CAAO,CAAA,EAAG,CACf,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,GAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEAtM,CAAAA,CAAM,IAAA,CAAK0T,CAAAA,CAAM1T,EAAM,IAAA,EAAM,CAAC,CAAA,CAAKqM,CAAAA,CAAO,CAAA,CAE1CA,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,EAEV,CACA,KAAOtM,CAAAA,CAAM,IAAA,CAAO,EAAA,EAClBA,CAAAA,CAAM,IAAA,CAAK0T,CAAAA,CAAM1T,CAAAA,CAAM,IAAA,EAAM,CAAC,CAAA,CAAI,CAAA,CAapC,GAPAA,CAAAA,CAAM,OAAA,CAAUA,EAAM,MAAA,CACtBA,CAAAA,CAAM,OAAA,CAAU,CAAA,CAEhBzB,CAAAA,CAAO,CAAE,IAAA,CAAMyB,CAAAA,CAAM,OAAQ,CAAA,CAC7B2S,CAAAA,CAAM5D,EAAAA,CAASC,EAAAA,CAAOhP,CAAAA,CAAM,IAAA,CAAM,CAAA,CAAG,EAAA,CAAIA,EAAM,OAAA,CAAS,CAAA,CAAGA,CAAAA,CAAM,IAAA,CAAMzB,CAAI,CAAA,CAC3EyB,CAAAA,CAAM,OAAA,CAAUzB,CAAAA,CAAK,IAAA,CAEjBoU,CAAAA,CAAK,CACP/G,CAAAA,CAAK,GAAA,CAAM,0BAAA,CACX5L,CAAAA,CAAM,KAAO2R,CAAAA,CACb,KACF,CAEA3R,CAAAA,CAAM,IAAA,CAAO,CAAA,CACbA,CAAAA,CAAM,IAAA,CAAOgR,GAEf,KAAKA,EAAAA,CACH,KAAOhR,CAAAA,CAAM,IAAA,CAAOA,CAAAA,CAAM,IAAA,CAAOA,CAAAA,CAAM,OAAO,CAC5C,KACE2M,CAAAA,CAAO3M,CAAAA,CAAM,OAAA,CAAQqM,CAAAA,CAAAA,CAAS,CAAA,EAAKrM,CAAAA,CAAM,OAAA,EAAW,CAAE,CAAA,CACtD4O,CAAAA,CAAYjC,CAAAA,GAAS,EAAA,CACrBkC,CAAAA,CAAWlC,CAAAA,GAAS,GAAM,GAAA,CAC1BmC,CAAAA,CAAWnC,CAAAA,CAAO,KAAA,CAEb,EAAAiC,CAAAA,EAActC,CAAAA,CAAAA,EANZ,CAQP,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,GAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EAEV,CACA,GAAIwC,CAAAA,CAAW,EAAA,CAEbzC,CAAAA,IAAUuC,EACVtC,CAAAA,EAAQsC,CAAAA,CAER5O,CAAAA,CAAM,IAAA,CAAKA,CAAAA,CAAM,IAAA,EAAM,CAAA,CAAI8O,CAAAA,CAAAA,KAExB,CACH,GAAIA,CAAAA,GAAa,EAAA,CAAI,CAGnB,IADAhwB,CAAAA,CAAI8vB,CAAAA,CAAY,CAAA,CACTtC,EAAOxtB,CAAAA,EAAG,CACf,GAAIu0B,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,GAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAMA,GAHAD,CAAAA,IAAUuC,CAAAA,CACVtC,CAAAA,EAAQsC,CAAAA,CAEJ5O,CAAAA,CAAM,IAAA,GAAS,CAAA,CAAG,CACpB4L,EAAK,GAAA,CAAM,2BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACA7sB,CAAAA,CAAMkb,EAAM,IAAA,CAAKA,CAAAA,CAAM,IAAA,CAAO,CAAC,CAAA,CAC/Btd,CAAAA,CAAO,CAAA,EAAK2pB,CAAAA,CAAO,GAEnBA,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,EAEV,CAAA,KAAA,GACSwC,CAAAA,GAAa,EAAA,CAAI,CAGxB,IADAhwB,CAAAA,CAAI8vB,CAAAA,CAAY,CAAA,CACTtC,CAAAA,CAAOxtB,CAAAA,EAAG,CACf,GAAIu0B,CAAAA,GAAS,EAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,GAAQ,EACV,CAGAD,CAAAA,IAAUuC,CAAAA,CACVtC,CAAAA,EAAQsC,CAAAA,CAER9pB,CAAAA,CAAM,CAAA,CACNpC,EAAO,CAAA,EAAK2pB,CAAAA,CAAO,CAAA,CAAA,CAEnBA,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,EAEV,CAAA,KACK,CAGH,IADAxtB,CAAAA,CAAI8vB,CAAAA,CAAY,CAAA,CACTtC,CAAAA,CAAOxtB,CAAAA,EAAG,CACf,GAAIu0B,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,GAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAGAD,CAAAA,IAAUuC,CAAAA,CACVtC,CAAAA,EAAQsC,CAAAA,CAER9pB,EAAM,CAAA,CACNpC,CAAAA,CAAO,EAAA,EAAM2pB,CAAAA,CAAO,GAAA,CAAA,CAEpBA,CAAAA,IAAU,CAAA,CACVC,CAAAA,EAAQ,EAEV,CACA,GAAItM,CAAAA,CAAM,IAAA,CAAOtd,CAAAA,CAAOsd,CAAAA,CAAM,IAAA,CAAOA,CAAAA,CAAM,MAAO,CAChD4L,CAAAA,CAAK,GAAA,CAAM,2BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACA,KAAOjvB,CAAAA,EAAAA,EACLsd,CAAAA,CAAM,IAAA,CAAKA,CAAAA,CAAM,IAAA,EAAM,CAAA,CAAIlb,EAE/B,CACF,CAGA,GAAIkb,CAAAA,CAAM,IAAA,GAAS2R,CAAAA,CAAO,MAG1B,GAAI3R,CAAAA,CAAM,IAAA,CAAK,GAAG,CAAA,GAAM,CAAA,CAAG,CACzB4L,CAAAA,CAAK,GAAA,CAAM,sCAAA,CACX5L,EAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAcA,GATA3R,CAAAA,CAAM,OAAA,CAAU,CAAA,CAEhBzB,EAAO,CAAE,IAAA,CAAMyB,CAAAA,CAAM,OAAQ,CAAA,CAC7B2S,CAAAA,CAAM5D,EAAAA,CAASE,EAAAA,CAAMjP,EAAM,IAAA,CAAM,CAAA,CAAGA,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,OAAA,CAAS,CAAA,CAAGA,CAAAA,CAAM,IAAA,CAAMzB,CAAI,CAAA,CAGlFyB,CAAAA,CAAM,OAAA,CAAUzB,CAAAA,CAAK,IAAA,CAGjBoU,CAAAA,CAAK,CACP/G,CAAAA,CAAK,GAAA,CAAM,6BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAaA,GAXA3R,CAAAA,CAAM,QAAA,CAAW,CAAA,CAGjBA,CAAAA,CAAM,QAAA,CAAWA,CAAAA,CAAM,OAAA,CACvBzB,CAAAA,CAAO,CAAE,IAAA,CAAMyB,CAAAA,CAAM,QAAS,CAAA,CAC9B2S,CAAAA,CAAM5D,EAAAA,CAASG,EAAAA,CAAOlP,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,KAAA,CAAOA,CAAAA,CAAM,QAAA,CAAU,CAAA,CAAGA,EAAM,IAAA,CAAMzB,CAAI,CAAA,CAG9FyB,CAAAA,CAAM,QAAA,CAAWzB,CAAAA,CAAK,IAAA,CAGlBoU,CAAAA,CAAK,CACP/G,CAAAA,CAAK,GAAA,CAAM,uBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAGA,GADA3R,CAAAA,CAAM,IAAA,CAAOiR,EAAAA,CACTkC,CAAAA,GAAU9D,EAAAA,CAAW,MAAMsE,CAAAA,CAEjC,KAAK1C,GACHjR,CAAAA,CAAM,IAAA,CAAOkR,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAImC,CAAAA,EAAQ,CAAA,EAAK7N,GAAQ,GAAA,CAAK,CAE5BoG,CAAAA,CAAK,QAAA,CAAWwH,CAAAA,CAChBxH,CAAAA,CAAK,SAAA,CAAYpG,CAAAA,CACjBoG,EAAK,OAAA,CAAUviB,CAAAA,CACfuiB,CAAAA,CAAK,QAAA,CAAWyH,CAAAA,CAChBrT,CAAAA,CAAM,IAAA,CAAOqM,CAAAA,CACbrM,EAAM,IAAA,CAAOsM,CAAAA,CAEbX,EAAAA,CAAQC,CAAAA,CAAME,CAAI,CAAA,CAElBsH,CAAAA,CAAMxH,CAAAA,CAAK,QAAA,CACXmB,CAAAA,CAASnB,CAAAA,CAAK,MAAA,CACdpG,CAAAA,CAAOoG,CAAAA,CAAK,SAAA,CACZviB,CAAAA,CAAOuiB,EAAK,OAAA,CACZ1G,CAAAA,CAAQ0G,CAAAA,CAAK,KAAA,CACbyH,CAAAA,CAAOzH,CAAAA,CAAK,QAAA,CACZS,CAAAA,CAAOrM,EAAM,IAAA,CACbsM,CAAAA,CAAOtM,CAAAA,CAAM,IAAA,CAGTA,CAAAA,CAAM,IAAA,GAASyQ,EAAAA,GACjBzQ,CAAAA,CAAM,KAAO,EAAA,CAAA,CAEf,KACF,CAEA,IADAA,CAAAA,CAAM,IAAA,CAAO,CAAA,CAEX2M,CAAAA,CAAO3M,CAAAA,CAAM,OAAA,CAAQqM,CAAAA,CAAAA,CAAS,CAAA,EAAKrM,CAAAA,CAAM,OAAA,EAAW,CAAE,CAAA,CACtD4O,EAAYjC,CAAAA,GAAS,EAAA,CACrBkC,CAAAA,CAAWlC,CAAAA,GAAS,EAAA,CAAM,GAAA,CAC1BmC,CAAAA,CAAWnC,CAAAA,CAAO,MAEd,EAAAiC,CAAAA,EAAatC,CAAAA,CAAAA,EANV,CAQP,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,EACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EAEV,CACA,GAAIuC,CAAAA,EAAAA,CAAYA,CAAAA,CAAU,GAAA,IAAU,CAAA,CAAG,CAIrC,IAHAyE,EAAY1E,CAAAA,CACZ2E,CAAAA,CAAU1E,CAAAA,CACV2E,CAAAA,CAAW1E,CAAAA,CAETnC,CAAAA,CAAO3M,CAAAA,CAAM,OAAA,CAAQwT,IACXnH,CAAAA,CAAAA,CAAS,CAAA,EAAMiH,CAAAA,CAAYC,CAAAA,EAAY,CAAA,GAAoCD,CAAAA,CAAU,CAAA,CAC/F1E,CAAAA,CAAYjC,IAAS,EAAA,CACrBkC,CAAAA,CAAWlC,CAAAA,GAAS,EAAA,CAAM,GAAA,CAC1BmC,CAAAA,CAAWnC,CAAAA,CAAO,KAAA,CAEb,EAAA2G,CAAAA,CAAY1E,CAAAA,EAActC,CAAAA,CAAAA,EAPxB,CASP,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,EACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EAEV,CAEAD,CAAAA,IAAUiH,CAAAA,CACVhH,CAAAA,EAAQgH,CAAAA,CAERtT,CAAAA,CAAM,IAAA,EAAQsT,EAChB,CAOA,GALAjH,CAAAA,IAAUuC,CAAAA,CACVtC,CAAAA,EAAQsC,CAAAA,CAER5O,CAAAA,CAAM,IAAA,EAAQ4O,CAAAA,CACd5O,CAAAA,CAAM,MAAA,CAAS8O,CAAAA,CACXD,CAAAA,GAAY,CAAA,CAAG,CAIjB7O,CAAAA,CAAM,IAAA,CAAOuR,EAAAA,CACb,KACF,CACA,GAAI1C,CAAAA,CAAU,EAAA,CAAI,CAEhB7O,CAAAA,CAAM,IAAA,CAAO,EAAA,CACbA,EAAM,IAAA,CAAOyQ,EAAAA,CACb,KACF,CACA,GAAI5B,CAAAA,CAAU,EAAA,CAAI,CAChBjD,EAAK,GAAA,CAAM,6BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACA3R,CAAAA,CAAM,KAAA,CAAQ6O,CAAAA,CAAU,EAAA,CACxB7O,CAAAA,CAAM,IAAA,CAAOmR,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAInR,CAAAA,CAAM,KAAA,CAAO,CAGf,IADAlhB,CAAAA,CAAIkhB,CAAAA,CAAM,KAAA,CACHsM,CAAAA,CAAOxtB,GAAG,CACf,GAAIu0B,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,EAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEAtM,CAAAA,CAAM,MAAA,EAAUqM,CAAAA,CAAAA,CAAS,CAAA,EAAKrM,CAAAA,CAAM,KAAA,EAAS,CAAA,CAE7CqM,CAAAA,IAAUrM,CAAAA,CAAM,KAAA,CAChBsM,GAAQtM,CAAAA,CAAM,KAAA,CAEdA,CAAAA,CAAM,IAAA,EAAQA,CAAAA,CAAM,MACtB,CAEAA,CAAAA,CAAM,IAAMA,CAAAA,CAAM,MAAA,CAClBA,CAAAA,CAAM,IAAA,CAAOoR,EAAAA,CAEf,KAAKA,EAAAA,CACH,KACEzE,EAAO3M,CAAAA,CAAM,QAAA,CAASqM,CAAAA,CAAAA,CAAS,CAAA,EAAKrM,CAAAA,CAAM,QAAA,EAAY,CAAE,CAAA,CACxD4O,EAAYjC,CAAAA,GAAS,EAAA,CACrBkC,CAAAA,CAAWlC,CAAAA,GAAS,EAAA,CAAM,GAAA,CAC1BmC,CAAAA,CAAWnC,CAAAA,CAAO,MAEb,EAAAiC,CAAAA,EAActC,CAAAA,CAAAA,EANZ,CAQP,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,EACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EAEV,CACA,GAAA,CAAKuC,CAAAA,CAAU,GAAA,IAAU,CAAA,CAAG,CAI1B,IAHAyE,CAAAA,CAAY1E,CAAAA,CACZ2E,CAAAA,CAAU1E,CAAAA,CACV2E,CAAAA,CAAW1E,CAAAA,CAETnC,CAAAA,CAAO3M,CAAAA,CAAM,QAAA,CAASwT,CAAAA,EAAAA,CACZnH,GAAS,CAAA,EAAMiH,CAAAA,CAAYC,CAAAA,EAAY,CAAA,GAAoCD,CAAAA,CAAU,CAAA,CAC/F1E,CAAAA,CAAYjC,CAAAA,GAAS,GACrBkC,CAAAA,CAAWlC,CAAAA,GAAS,EAAA,CAAM,GAAA,CAC1BmC,CAAAA,CAAWnC,CAAAA,CAAO,KAAA,CAEb,EAAA2G,EAAY1E,CAAAA,EAActC,CAAAA,CAAAA,EAPxB,CASP,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,IACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EAEV,CAEAD,KAAUiH,CAAAA,CACVhH,CAAAA,EAAQgH,CAAAA,CAERtT,CAAAA,CAAM,IAAA,EAAQsT,EAChB,CAMA,GAJAjH,KAAUuC,CAAAA,CACVtC,CAAAA,EAAQsC,CAAAA,CAER5O,CAAAA,CAAM,IAAA,EAAQ4O,CAAAA,CACVC,CAAAA,CAAU,EAAA,CAAI,CAChBjD,CAAAA,CAAK,GAAA,CAAM,uBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CACA3R,CAAAA,CAAM,MAAA,CAAS8O,CAAAA,CACf9O,CAAAA,CAAM,KAAA,CAAS6O,CAAAA,CAAW,EAAA,CAC1B7O,CAAAA,CAAM,KAAOqR,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAIrR,CAAAA,CAAM,KAAA,CAAO,CAGf,IADAlhB,EAAIkhB,CAAAA,CAAM,KAAA,CACHsM,CAAAA,CAAOxtB,CAAAA,EAAG,CACf,GAAIu0B,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEAtM,CAAAA,CAAM,MAAA,EAAUqM,CAAAA,CAAAA,CAAS,CAAA,EAAKrM,CAAAA,CAAM,KAAA,EAAS,CAAA,CAE7CqM,KAAUrM,CAAAA,CAAM,KAAA,CAChBsM,CAAAA,EAAQtM,CAAAA,CAAM,KAAA,CAEdA,CAAAA,CAAM,IAAA,EAAQA,CAAAA,CAAM,MACtB,CAEA,GAAIA,CAAAA,CAAM,MAAA,CAASA,CAAAA,CAAM,IAAA,CAAM,CAC7B4L,CAAAA,CAAK,IAAM,+BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAGA3R,CAAAA,CAAM,IAAA,CAAOsR,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAI9L,CAAAA,GAAS,CAAA,CAAK,MAAMmO,CAAAA,CAExB,GADAjxB,CAAAA,CAAOopB,CAAAA,CAAOtG,CAAAA,CACVxF,CAAAA,CAAM,MAAA,CAAStd,CAAAA,CAAM,CAEvB,GADAA,EAAOsd,CAAAA,CAAM,MAAA,CAAStd,CAAAA,CAClBA,CAAAA,CAAOsd,CAAAA,CAAM,KAAA,EACXA,CAAAA,CAAM,IAAA,CAAM,CACd4L,CAAAA,CAAK,GAAA,CAAM,+BAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAiBEjvB,CAAAA,CAAOsd,CAAAA,CAAM,KAAA,EACftd,CAAAA,EAAQsd,CAAAA,CAAM,KAAA,CACd6M,CAAAA,CAAO7M,CAAAA,CAAM,MAAQtd,CAAAA,EAGrBmqB,CAAAA,CAAO7M,CAAAA,CAAM,KAAA,CAAQtd,CAAAA,CAEnBA,CAAAA,CAAOsd,CAAAA,CAAM,MAAA,GAAUtd,EAAOsd,CAAAA,CAAM,MAAA,CAAA,CACxC8M,CAAAA,CAAc9M,CAAAA,CAAM,OACtB,CAAA,KAEE8M,CAAAA,CAAcC,CAAAA,CACdF,EAAOuG,CAAAA,CAAMpT,CAAAA,CAAM,MAAA,CACnBtd,CAAAA,CAAOsd,CAAAA,CAAM,MAAA,CAEXtd,CAAAA,CAAO8iB,CAAAA,GAAQ9iB,CAAAA,CAAO8iB,CAAAA,CAAAA,CAC1BA,CAAAA,EAAQ9iB,CAAAA,CACRsd,CAAAA,CAAM,MAAA,EAAUtd,CAAAA,CAChB,GACEqqB,EAAOqG,CAAAA,EAAK,CAAA,CAAItG,CAAAA,CAAYD,CAAAA,EAAM,CAAA,CAAA,MAC3B,EAAEnqB,CAAAA,EACPsd,CAAAA,CAAM,SAAW,CAAA,GAAKA,CAAAA,CAAM,IAAA,CAAOkR,EAAAA,CAAAA,CACvC,MACF,KAAKK,EAAAA,CACH,GAAI/L,IAAS,CAAA,CAAK,MAAMmO,CAAAA,CACxB5G,CAAAA,CAAOqG,CAAAA,EAAK,CAAA,CAAIpT,CAAAA,CAAM,MAAA,CACtBwF,IACAxF,CAAAA,CAAM,IAAA,CAAOkR,EAAAA,CACb,MACF,KAAKM,EAAAA,CACH,GAAIxR,CAAAA,CAAM,KAAM,CAEd,KAAOsM,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CAEAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,CAAAA,EAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAaA,GAXAR,CAAAA,EAAQtG,CAAAA,CACRoG,CAAAA,CAAK,SAAA,EAAaE,CAAAA,CAClB9L,CAAAA,CAAM,KAAA,EAAS8L,CAAAA,CACV9L,CAAAA,CAAM,IAAA,CAAO,CAAA,EAAM8L,CAAAA,GACtBF,CAAAA,CAAK,KAAA,CAAQ5L,EAAM,KAAA,CAEdA,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAO+M,CAAAA,CAAQjB,CAAAA,CAAMsH,EAAMtH,CAAI,CAAA,CAAIvC,EAAAA,CAAUvJ,CAAAA,CAAM,KAAA,CAAO+M,CAAAA,CAAQjB,CAAAA,CAAMsH,CAAAA,CAAMtH,CAAI,CAAA,CAAA,CAGrHA,CAAAA,CAAOtG,CAAAA,CAEFxF,CAAAA,CAAM,IAAA,CAAO,CAAA,EAAA,CAAOA,CAAAA,CAAM,KAAA,CAAQqM,CAAAA,CAAO6F,EAAAA,CAAQ7F,CAAI,CAAA,IAAOrM,CAAAA,CAAM,KAAA,CAAO,CAC5E4L,CAAAA,CAAK,IAAM,sBAAA,CACX5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAEAtF,CAAAA,CAAO,CAAA,CACPC,EAAO,EAGT,CACAtM,CAAAA,CAAM,IAAA,CAAOyR,EAAAA,CAEf,KAAKA,EAAAA,CACH,GAAIzR,EAAM,IAAA,EAAQA,CAAAA,CAAM,KAAA,CAAO,CAE7B,KAAOsM,CAAAA,CAAO,EAAA,EAAI,CAChB,GAAI+G,CAAAA,GAAS,CAAA,CAAK,MAAMM,CAAAA,CACxBN,CAAAA,EAAAA,CACAhH,CAAAA,EAAQnH,CAAAA,CAAM7b,GAAM,CAAA,EAAKijB,CAAAA,CACzBA,CAAAA,EAAQ,EACV,CAEA,GAAKtM,CAAAA,CAAM,IAAA,CAAO,GAAMqM,CAAAA,IAAUrM,CAAAA,CAAM,KAAA,CAAQ,UAAA,CAAA,CAAa,CAC3D4L,CAAAA,CAAK,GAAA,CAAM,wBAAA,CACX5L,EAAM,IAAA,CAAO2R,CAAAA,CACb,KACF,CAEAtF,CAAAA,CAAO,CAAA,CACPC,CAAAA,CAAO,EAGT,CACAtM,CAAAA,CAAM,IAAA,CAAO0R,EAAAA,CAEf,KAAKA,EAAAA,CACHiB,CAAAA,CAAMpD,EAAAA,CACN,MAAMoE,EACR,KAAKhC,CAAAA,CACHgB,CAAAA,CAAMjD,EAAAA,CACN,MAAMiE,CAAAA,CACR,KAAK/B,EAAAA,CACH,OAAOjC,EAAAA,CACT,KAAKkC,EAAAA,CAEL,QACE,OAAOpC,EACX,CAaF,OAAA7D,EAAK,QAAA,CAAWwH,CAAAA,CAChBxH,CAAAA,CAAK,SAAA,CAAYpG,CAAAA,CACjBoG,CAAAA,CAAK,OAAA,CAAUviB,CAAAA,CACfuiB,CAAAA,CAAK,QAAA,CAAWyH,CAAAA,CAChBrT,CAAAA,CAAM,IAAA,CAAOqM,CAAAA,CACbrM,CAAAA,CAAM,IAAA,CAAOsM,GAGTtM,CAAAA,CAAM,KAAA,EAAU8L,CAAAA,GAASF,CAAAA,CAAK,SAAA,EAAa5L,CAAAA,CAAM,IAAA,CAAO2R,CAAAA,GACvC3R,EAAM,IAAA,CAAOwR,EAAAA,EAAS2B,CAAAA,GAAUhE,EAAAA,CAAAA,GAC/C8D,EAAAA,CAAarH,CAAAA,CAAMA,CAAAA,CAAK,MAAA,CAAQA,EAAK,QAAA,CAAUE,CAAAA,CAAOF,CAAAA,CAAK,SAAS,CAAA,CAE1EC,CAAAA,EAAOD,CAAAA,CAAK,QAAA,CACZE,CAAAA,EAAQF,CAAAA,CAAK,SAAA,CACbA,CAAAA,CAAK,QAAA,EAAYC,CAAAA,CACjBD,CAAAA,CAAK,SAAA,EAAaE,EAClB9L,CAAAA,CAAM,KAAA,EAAS8L,CAAAA,CACV9L,CAAAA,CAAM,IAAA,CAAO,CAAA,EAAM8L,CAAAA,GACtBF,CAAAA,CAAK,MAAQ5L,CAAAA,CAAM,KAAA,CAChBA,CAAAA,CAAM,KAAA,CAAQ6J,CAAAA,CAAQ7J,CAAAA,CAAM,KAAA,CAAO+M,CAAAA,CAAQjB,EAAMF,CAAAA,CAAK,QAAA,CAAWE,CAAI,CAAA,CAAIvC,EAAAA,CAAUvJ,CAAAA,CAAM,KAAA,CAAO+M,CAAAA,CAAQjB,CAAAA,CAAMF,CAAAA,CAAK,QAAA,CAAWE,CAAI,CAAA,CAAA,CAEvIF,CAAAA,CAAK,SAAA,CAAY5L,CAAAA,CAAM,MAAQA,CAAAA,CAAM,IAAA,CAAO,EAAA,CAAK,CAAA,CAAA,EAC9BA,CAAAA,CAAM,IAAA,GAASyQ,EAAAA,CAAO,GAAA,CAAM,IAC5BzQ,CAAAA,CAAM,IAAA,GAASiR,EAAAA,EAAQjR,CAAAA,CAAM,IAAA,GAAS4Q,EAAAA,CAAQ,GAAA,CAAM,CAAA,CAAA,CAAA,CACjE/E,IAAQ,CAAA,EAAKC,CAAAA,GAAS,CAAA,EAAMqH,CAAAA,GAAUhE,EAAAA,GAAewD,CAAAA,GAAQrD,EAAAA,GACjEqD,CAAAA,CAAM/C,IAED+C,CACT,CAAA,CAGMiB,EAAAA,CAAchI,CAAAA,EAAS,CAE3B,GAAIwG,EAAAA,CAAkBxG,CAAI,EACxB,OAAO6D,EAAAA,CAGT,IAAIzP,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CACjB,OAAI5L,CAAAA,CAAM,SACRA,CAAAA,CAAM,MAAA,CAAS,IAAA,CAAA,CAEjB4L,CAAAA,CAAK,KAAA,CAAQ,IAAA,CACN0D,EACT,CAAA,CAGMuE,GAAmB,CAACjI,CAAAA,CAAMkI,CAAAA,GAAS,CAGvC,GAAI1B,EAAAA,CAAkBxG,CAAI,CAAA,CAAK,OAAO6D,EAAAA,CACtC,IAAMzP,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CACnB,OAAA,CAAK5L,CAAAA,CAAM,KAAO,CAAA,IAAO,CAAA,CAAYyP,EAAAA,EAGrCzP,CAAAA,CAAM,IAAA,CAAO8T,CAAAA,CACbA,CAAAA,CAAK,IAAA,CAAO,MACLxE,EAAAA,CACT,CAAA,CAGMyE,EAAAA,CAAuB,CAACnI,CAAAA,CAAMoI,CAAAA,GAAe,CACjD,IAAMC,EAAaD,CAAAA,CAAW,MAAA,CAE1BhU,CAAAA,CACAkU,CAAAA,CACAvB,CAAAA,CAMJ,OAHIP,EAAAA,CAAkBxG,CAAI,IAC1B5L,CAAAA,CAAQ4L,CAAAA,CAAK,KAAA,CAET5L,CAAAA,CAAM,IAAA,GAAS,CAAA,EAAKA,CAAAA,CAAM,IAAA,GAASwQ,IAC9Bf,EAAAA,CAILzP,CAAAA,CAAM,IAAA,GAASwQ,EAAAA,GACjB0D,CAAAA,CAAS,CAAA,CAETA,CAAAA,CAAS3K,EAAAA,CAAU2K,EAAQF,CAAAA,CAAYC,CAAAA,CAAY,CAAC,CAAA,CAChDC,CAAAA,GAAWlU,CAAAA,CAAM,KAAA,CAAA,CACZ0P,EAAAA,EAKXiD,EAAMM,EAAAA,CAAarH,CAAAA,CAAMoI,CAAAA,CAAYC,CAAAA,CAAYA,CAAU,CAAA,CACvDtB,CAAAA,EACF3S,CAAAA,CAAM,IAAA,CAAO4R,EAAAA,CACNjC,EAAAA,GAET3P,CAAAA,CAAM,QAAA,CAAW,CAAA,CAEVsP,EAAAA,CAAAA,CACT,CAAA,CAGI6E,GAAiB7B,EAAAA,CACjB8B,EAAAA,CAAkB7B,EAAAA,CAClB8B,EAAAA,CAAqBhC,EAAAA,CACrBiC,EAAAA,CAAgB1B,EAAAA,CAChB2B,EAAAA,CAAiB7B,GACjB8B,EAAAA,CAActB,EAAAA,CACduB,EAAAA,CAAeb,EAAAA,CACfc,EAAAA,CAAqBb,EAAAA,CACrBc,EAAAA,CAAyBZ,EAAAA,CACzBa,GAAc,oCAAA,CAcdC,EAAAA,CAAc,CACjB,YAAA,CAAcV,EAAAA,CACd,aAAA,CAAeC,EAAAA,CACf,gBAAA,CAAkBC,GAClB,WAAA,CAAaC,EAAAA,CACb,YAAA,CAAcC,EAAAA,CACd,OAAA,CAASC,EAAAA,CACT,UAAA,CAAYC,EAAAA,CACZ,iBAAkBC,EAAAA,CAClB,oBAAA,CAAsBC,EAAAA,CACtB,WAAA,CAAaC,EACd,CAAA,CAqBA,SAASE,EAAAA,EAAW,CAElB,IAAA,CAAK,IAAA,CAAa,CAAA,CAElB,IAAA,CAAK,IAAA,CAAa,CAAA,CAElB,IAAA,CAAK,MAAA,CAAa,EAElB,IAAA,CAAK,EAAA,CAAa,CAAA,CAElB,IAAA,CAAK,KAAA,CAAa,IAAA,CAElB,IAAA,CAAK,SAAA,CAAa,CAAA,CAWlB,IAAA,CAAK,IAAA,CAAa,EAAA,CAIlB,IAAA,CAAK,OAAA,CAAa,EAAA,CAIlB,IAAA,CAAK,KAAa,CAAA,CAElB,IAAA,CAAK,IAAA,CAAa,MACpB,CAEA,IAAIC,EAAAA,CAAWD,EAAAA,CAETE,GAAW,MAAA,CAAO,SAAA,CAAU,QAAA,CAK5B,CACJ,UAAA,CAAAC,EAAAA,CAAY,QAAA,CAAAC,EAAAA,CACZ,KAAAC,EAAAA,CAAM,YAAA,CAAAC,EAAAA,CAAc,WAAA,CAAAC,EAAAA,CAAa,cAAA,CAAAC,EAAAA,CAAgB,YAAA,CAAAC,EAAAA,CAAc,WAAA,CAAAC,EACjE,CAAA,CAAIzL,EAAAA,CAkFJ,SAAS0L,EAAAA,CAAUhpB,CAAAA,CAAS,CAC1B,IAAA,CAAK,OAAA,CAAU6d,EAAAA,CAAO,MAAA,CAAO,CAC3B,SAAA,CAAW,IAAA,CAAO,EAAA,CAClB,WAAY,EAAA,CACZ,EAAA,CAAI,EACN,CAAA,CAAG7d,CAAAA,EAAW,EAAE,CAAA,CAEhB,IAAMC,CAAAA,CAAM,IAAA,CAAK,OAAA,CAIbA,CAAAA,CAAI,GAAA,EAAQA,CAAAA,CAAI,UAAA,EAAc,CAAA,EAAOA,CAAAA,CAAI,UAAA,CAAa,EAAA,GACxDA,CAAAA,CAAI,UAAA,CAAa,CAACA,CAAAA,CAAI,UAAA,CAClBA,EAAI,UAAA,GAAe,CAAA,GAAKA,CAAAA,CAAI,UAAA,CAAa,GAAA,CAAA,CAAA,CAI1CA,CAAAA,CAAI,UAAA,EAAc,CAAA,EAAOA,EAAI,UAAA,CAAa,EAAA,EAC3C,EAAED,CAAAA,EAAWA,CAAAA,CAAQ,UAAA,CAAA,GACvBC,CAAAA,CAAI,UAAA,EAAc,IAKfA,CAAAA,CAAI,UAAA,CAAa,EAAA,EAAQA,CAAAA,CAAI,UAAA,CAAa,EAAA,EAAA,CAGxCA,CAAAA,CAAI,UAAA,CAAa,MAAQ,CAAA,GAC5BA,CAAAA,CAAI,UAAA,EAAc,EAAA,CAAA,CAItB,IAAA,CAAK,GAAA,CAAS,CAAA,CACd,IAAA,CAAK,IAAS,EAAA,CACd,IAAA,CAAK,KAAA,CAAS,KAAA,CACd,IAAA,CAAK,MAAA,CAAS,EAAC,CAEf,KAAK,IAAA,CAAS,IAAI8e,EAAAA,CAClB,IAAA,CAAK,IAAA,CAAK,SAAA,CAAY,CAAA,CAEtB,IAAIkK,EAAUb,EAAAA,CAAY,YAAA,CACxB,IAAA,CAAK,IAAA,CACLnoB,CAAAA,CAAI,UACN,CAAA,CAEA,GAAIgpB,CAAAA,GAAWP,EAAAA,CACb,MAAM,IAAI,KAAA,CAAMrL,EAAAA,CAAS4L,CAAM,CAAC,EAQlC,GALA,IAAA,CAAK,MAAA,CAAS,IAAIX,EAAAA,CAElBF,EAAAA,CAAY,gBAAA,CAAiB,IAAA,CAAK,KAAM,IAAA,CAAK,MAAM,CAAA,CAG/CnoB,CAAAA,CAAI,UAAA,GAEF,OAAOA,CAAAA,CAAI,UAAA,EAAe,SAC5BA,CAAAA,CAAI,UAAA,CAAa4e,EAAAA,CAAQ,UAAA,CAAW5e,CAAAA,CAAI,UAAU,CAAA,CACzCsoB,EAAAA,CAAS,IAAA,CAAKtoB,CAAAA,CAAI,UAAU,CAAA,GAAM,sBAAA,GAC3CA,CAAAA,CAAI,UAAA,CAAa,IAAI,WAAWA,CAAAA,CAAI,UAAU,CAAA,CAAA,CAE5CA,CAAAA,CAAI,GAAA,GACNgpB,CAAAA,CAASb,EAAAA,CAAY,oBAAA,CAAqB,KAAK,IAAA,CAAMnoB,CAAAA,CAAI,UAAU,CAAA,CAC/DgpB,CAAAA,GAAWP,EAAAA,CAAAA,CAAAA,CACb,MAAM,IAAI,MAAMrL,EAAAA,CAAS4L,CAAM,CAAC,CAIxC,CA2BAD,EAAAA,CAAU,SAAA,CAAU,IAAA,CAAO,SAAUh6B,CAAAA,CAAMk6B,CAAAA,CAAY,CACrD,IAAM/J,CAAAA,CAAO,IAAA,CAAK,IAAA,CACZgK,EAAY,IAAA,CAAK,OAAA,CAAQ,SAAA,CACzB5B,CAAAA,CAAa,IAAA,CAAK,OAAA,CAAQ,UAAA,CAC5B0B,CAAAA,CAAQG,EAAaC,CAAAA,CAEzB,GAAI,IAAA,CAAK,KAAA,CAAO,OAAO,MAAA,CAevB,IAbIH,CAAAA,GAAe,CAAC,CAACA,CAAAA,CAAYE,CAAAA,CAAcF,CAAAA,CAC1CE,CAAAA,CAAcF,CAAAA,GAAe,IAAA,CAAOT,EAAAA,CAAWD,GAGhDD,EAAAA,CAAS,IAAA,CAAKv5B,CAAI,CAAA,GAAM,sBAAA,CAC1BmwB,CAAAA,CAAK,KAAA,CAAQ,IAAI,WAAWnwB,CAAI,CAAA,CAEhCmwB,CAAAA,CAAK,KAAA,CAAQnwB,CAAAA,CAGfmwB,CAAAA,CAAK,OAAA,CAAU,CAAA,CACfA,EAAK,QAAA,CAAWA,CAAAA,CAAK,KAAA,CAAM,MAAA,GAElB,CAqBP,IApBIA,CAAAA,CAAK,SAAA,GAAc,IACrBA,CAAAA,CAAK,MAAA,CAAS,IAAI,UAAA,CAAWgK,CAAS,CAAA,CACtChK,CAAAA,CAAK,QAAA,CAAW,CAAA,CAChBA,CAAAA,CAAK,SAAA,CAAYgK,CAAAA,CAAAA,CAGnBF,CAAAA,CAASb,EAAAA,CAAY,OAAA,CAAQjJ,CAAAA,CAAMiK,CAAW,CAAA,CAE1CH,CAAAA,GAAWL,EAAAA,EAAerB,CAAAA,GAC5B0B,CAAAA,CAASb,EAAAA,CAAY,oBAAA,CAAqBjJ,CAAAA,CAAMoI,CAAU,CAAA,CAEtD0B,CAAAA,GAAWP,EAAAA,CACbO,CAAAA,CAASb,EAAAA,CAAY,OAAA,CAAQjJ,CAAAA,CAAMiK,CAAW,EACrCH,CAAAA,GAAWH,EAAAA,GAEpBG,CAAAA,CAASL,EAAAA,CAAAA,CAAAA,CAKNzJ,CAAAA,CAAK,QAAA,CAAW,CAAA,EAChB8J,CAAAA,GAAWN,EAAAA,EACXxJ,CAAAA,CAAK,KAAA,CAAM,IAAA,CAAO,CAAA,EAClBnwB,CAAAA,CAAKmwB,CAAAA,CAAK,OAAO,IAAM,CAAA,EAE5BiJ,EAAAA,CAAY,YAAA,CAAajJ,CAAI,CAAA,CAC7B8J,CAAAA,CAASb,EAAAA,CAAY,OAAA,CAAQjJ,EAAMiK,CAAW,CAAA,CAGhD,OAAQH,CAAAA,EACN,KAAKJ,EAAAA,CACL,KAAKC,GACL,KAAKF,EAAAA,CACL,KAAKG,EAAAA,CACH,OAAA,IAAA,CAAK,KAAA,CAAME,CAAM,CAAA,CACjB,IAAA,CAAK,KAAA,CAAQ,IAAA,CACN,KACX,CAMA,GAFAI,CAAAA,CAAiBlK,CAAAA,CAAK,UAElBA,CAAAA,CAAK,QAAA,GACHA,CAAAA,CAAK,SAAA,GAAc,CAAA,EAAK8J,CAAAA,GAAWN,EAAAA,CAAAA,CAErC,GAAI,KAAK,OAAA,CAAQ,EAAA,GAAO,QAAA,CAAU,CAEhC,IAAIW,CAAAA,CAAgBzK,EAAAA,CAAQ,UAAA,CAAWM,EAAK,MAAA,CAAQA,CAAAA,CAAK,QAAQ,CAAA,CAE7DoK,CAAAA,CAAOpK,CAAAA,CAAK,QAAA,CAAWmK,CAAAA,CACvBE,EAAU3K,EAAAA,CAAQ,UAAA,CAAWM,CAAAA,CAAK,MAAA,CAAQmK,CAAa,CAAA,CAG3DnK,CAAAA,CAAK,QAAA,CAAWoK,EAChBpK,CAAAA,CAAK,SAAA,CAAYgK,CAAAA,CAAYI,CAAAA,CACzBA,CAAAA,EAAMpK,CAAAA,CAAK,MAAA,CAAO,GAAA,CAAIA,EAAK,MAAA,CAAO,QAAA,CAASmK,CAAAA,CAAeA,CAAAA,CAAgBC,CAAI,CAAA,CAAG,CAAC,CAAA,CAEtF,KAAK,MAAA,CAAOC,CAAO,EAErB,CAAA,KACE,IAAA,CAAK,MAAA,CAAOrK,CAAAA,CAAK,MAAA,CAAO,MAAA,GAAWA,CAAAA,CAAK,QAAA,CAAWA,CAAAA,CAAK,MAAA,CAASA,CAAAA,CAAK,MAAA,CAAO,QAAA,CAAS,EAAGA,CAAAA,CAAK,QAAQ,CAAC,CAAA,CAM7G,GAAI,EAAA8J,CAAAA,GAAWP,EAAAA,EAAQW,IAAmB,CAAA,CAAA,CAG1C,CAAA,GAAIJ,CAAAA,GAAWN,EAAAA,CACb,OAAAM,CAAAA,CAASb,EAAAA,CAAY,UAAA,CAAW,KAAK,IAAI,CAAA,CACzC,IAAA,CAAK,KAAA,CAAMa,CAAM,CAAA,CACjB,IAAA,CAAK,KAAA,CAAQ,KACN,IAAA,CAGT,GAAI9J,CAAAA,CAAK,QAAA,GAAa,CAAA,CAAG,KAAA,CAC3B,CAEA,OAAO,KACT,CAAA,CAWA6J,EAAAA,CAAU,SAAA,CAAU,MAAA,CAAS,SAAU75B,CAAAA,CAAO,CAC5C,IAAA,CAAK,OAAO,IAAA,CAAKA,CAAK,EACxB,CAAA,CAYA65B,EAAAA,CAAU,SAAA,CAAU,KAAA,CAAQ,SAAUC,EAAQ,CAExCA,CAAAA,GAAWP,EAAAA,GACT,IAAA,CAAK,OAAA,CAAQ,EAAA,GAAO,QAAA,CACtB,IAAA,CAAK,MAAA,CAAS,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,EAAE,CAAA,CAEjC,IAAA,CAAK,MAAA,CAAS7K,GAAO,aAAA,CAAc,IAAA,CAAK,MAAM,CAAA,CAAA,CAGlD,IAAA,CAAK,MAAA,CAAS,EAAC,CACf,KAAK,GAAA,CAAMoL,CAAAA,CACX,IAAA,CAAK,GAAA,CAAM,IAAA,CAAK,IAAA,CAAK,IACvB,CAAA,CA0CA,SAASQ,EAAAA,CAAUhR,CAAAA,CAAOzY,CAAAA,CAAS,CACjC,IAAM0pB,CAAAA,CAAW,IAAIV,EAAAA,CAAUhpB,CAAO,CAAA,CAKtC,GAHA0pB,CAAAA,CAAS,IAAA,CAAKjR,CAAK,CAAA,CAGfiR,CAAAA,CAAS,GAAA,CAAK,MAAMA,CAAAA,CAAS,GAAA,EAAOrM,EAAAA,CAASqM,CAAAA,CAAS,GAAG,CAAA,CAE7D,OAAOA,CAAAA,CAAS,MAClB,CA4BA,IACIC,EAAAA,CAAYF,EAAAA,CAKZG,EAAAA,CAAc,CAEjB,QAASD,EAIV,CAAA,CAIM,CAAW,OAAA,CAAAE,EAA4B,CAAA,CAAID,GASjD,IAAIE,EAAAA,CAAYD,EAAAA,CCjpNT,SAASE,GACd/6B,CAAAA,CACAg7B,CAAAA,CACY,CAEZ,IAAMC,CAAAA,CACJ,OAAOD,CAAAA,EAAY,QAAA,CAAW,CAAE,SAAA,CAAWA,CAAQ,CAAA,CAAIA,CAAAA,CAEnDE,CAAAA,CAAYD,CAAAA,CAAK,SAAA,CAEvB,GAAI,CAACC,CAAAA,CACH,MAAM,IAAIn6B,CAAAA,CAAW,yCAAyC,CAAA,CAGhE,OAAQm6B,GACN,KAAK,MAAA,CACH,OAAOC,EAAAA,CAAYn7B,CAAI,CAAA,CAEzB,KAAK,MACH,OAAOo7B,EAAAA,CAAWp7B,CAAAA,CAAMi7B,CAAAA,CAAK,GAAG,CAAA,CAElC,KAAK,KAAA,CACH,OAAOI,EAAAA,CAAWr7B,CAAAA,CAAMi7B,CAAAA,CAAK,MAAA,CAAQA,CAAAA,CAAK,KAAK,CAAA,CAEjD,KAAK,MACH,OAAOK,EAAAA,CAAWt7B,CAAAA,CAAMi7B,CAAAA,CAAK,MAAA,CAAQA,CAAAA,CAAK,KAAK,CAAA,CAEjD,KAAK,QAAA,CACH,OAAOM,EAAAA,CAAgBv7B,CAAAA,CAAM,CAAC,CAAA,CAEhC,KAAK,QAAA,CACH,OAAOu7B,EAAAA,CAAgBv7B,CAAAA,CAAM,CAAC,CAAA,CAEhC,KAAK,QAAA,CACH,OAAOu7B,EAAAA,CAAgBv7B,EAAM,CAAC,CAAA,CAEhC,KAAK,SAAA,CACH,OAAOu7B,EAAAA,CAAgBv7B,CAAAA,CAAM,EAAE,CAAA,CAEjC,QACE,MAAM,IAAIe,CAAAA,CACR,CAAA,2BAAA,EAA8Bm6B,CAAS,CAAA,iEAAA,CAEzC,CACJ,CACF,CAUA,SAASC,EAAAA,CAAYn7B,CAAAA,CAA8B,CACjD,GAAI,CACF,OAAO86B,EAAAA,CAAQ96B,CAAI,CACrB,CAAA,MAAS8H,CAAAA,CAAO,CACd,MAAM,IAAI/G,EACR,CAAA,2BAAA,EAA8B+G,CAAAA,YAAiB,KAAA,CAAQA,CAAAA,CAAM,OAAA,CAAU,MAAA,CAAOA,CAAK,CAAC,CAAA,CACtF,CACF,CACF,CAYA,SAASszB,EAAAA,CACPp7B,CAAAA,CACA+F,CAAAA,CACY,CACZ,GAAIA,CAAAA,GAAQ,MAAA,CACV,MAAM,IAAIhF,CAAAA,CAAW,sCAAsC,CAAA,CAG7D,IAAMe,CAAAA,CAAS,IAAI,UAAA,CAAW9B,CAAAA,CAAK,MAAM,CAAA,CACnCw7B,CAAAA,CAAW,KAAA,CAAM,QAAQz1B,CAAG,CAAA,CAAIA,CAAAA,CAAM,CAACA,CAAG,CAAA,CAEhD,GAAIy1B,CAAAA,CAAS,MAAA,GAAW,CAAA,CACtB,MAAM,IAAIz6B,CAAAA,CAAW,yBAAyB,CAAA,CAGhD,IAAA,IAAST,EAAI,CAAA,CAAGA,CAAAA,CAAIN,CAAAA,CAAK,MAAA,CAAQM,CAAAA,EAAAA,CAC/BwB,CAAAA,CAAOxB,CAAC,CAAA,CAAIN,EAAKM,CAAC,CAAA,CAAIk7B,CAAAA,CAASl7B,CAAAA,CAAIk7B,CAAAA,CAAS,MAAM,CAAA,CAGpD,OAAO15B,CACT,CAaA,SAASu5B,EAAAA,CACPr7B,CAAAA,CACAy7B,CAAAA,CACAC,CAAAA,CACY,CACZ,IAAM7K,EAAO4K,CAAAA,EAAU,CAAA,CACjBE,CAAAA,CAAYD,CAAAA,EAAS,CAAA,CAE3B,GAAI7K,CAAAA,CAAO,CAAA,EAAKA,EAAO,CAAA,CACrB,MAAM,IAAI9vB,CAAAA,CAAW,oCAAoC,CAAA,CAG3D,GAAI46B,CAAAA,GAAc,EAChB,MAAM,IAAI56B,CAAAA,CAAW,2CAA2C,CAAA,CAGlE,IAAMe,CAAAA,CAAS,IAAI,WAAW9B,CAAAA,CAAK,MAAM,CAAA,CAEzC,IAAA,IAASM,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIN,CAAAA,CAAK,MAAA,CAAQM,CAAAA,EAAAA,CAAK,CACpC,IAAMs7B,CAAAA,CAAO57B,CAAAA,CAAKM,CAAC,CAAA,CACnBwB,EAAOxB,CAAC,CAAA,CAAA,CAAMs7B,CAAAA,EAAQ/K,CAAAA,CAAS+K,CAAAA,EAAS,CAAA,CAAI/K,CAAAA,EAAU,IACxD,CAEA,OAAO/uB,CACT,CAaA,SAASw5B,EAAAA,CACPt7B,CAAAA,CACAy7B,CAAAA,CACAC,CAAAA,CACY,CACZ,IAAM7K,CAAAA,CAAO4K,CAAAA,EAAU,CAAA,CACjBE,CAAAA,CAAYD,CAAAA,EAAS,CAAA,CAE3B,GAAI7K,CAAAA,CAAO,CAAA,EAAKA,CAAAA,CAAO,CAAA,CACrB,MAAM,IAAI9vB,CAAAA,CAAW,oCAAoC,EAG3D,GAAI46B,CAAAA,GAAc,CAAA,CAChB,MAAM,IAAI56B,CAAAA,CAAW,2CAA2C,CAAA,CAGlE,IAAMe,CAAAA,CAAS,IAAI,UAAA,CAAW9B,CAAAA,CAAK,MAAM,CAAA,CAEzC,IAAA,IAASM,CAAAA,CAAI,EAAGA,CAAAA,CAAIN,CAAAA,CAAK,MAAA,CAAQM,CAAAA,EAAAA,CAAK,CACpC,IAAMs7B,CAAAA,CAAO57B,CAAAA,CAAKM,CAAC,CAAA,CACnBwB,CAAAA,CAAOxB,CAAC,CAAA,CAAA,CAAMs7B,CAAAA,EAAQ/K,CAAAA,CAAS+K,CAAAA,EAAS,EAAI/K,CAAAA,EAAU,IACxD,CAEA,OAAO/uB,CACT,CAYA,SAASy5B,EAAAA,CAAgBv7B,EAAkB27B,CAAAA,CAA+B,CACxE,GAAI,CAAC,CAAC,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,EAAE,CAAA,CAAE,QAAA,CAASA,CAAS,CAAA,CACnC,MAAM,IAAI56B,CAAAA,CACR,CAAA,6BAAA,EAAgC46B,CAAS,CAAA,wBAAA,CAC3C,CAAA,CAGF,GAAI37B,CAAAA,CAAK,MAAA,CAAS27B,CAAAA,GAAc,CAAA,CAC9B,MAAM,IAAI56B,CAAAA,CACR,CAAA,YAAA,EAAef,CAAAA,CAAK,MAAM,CAAA,8BAAA,EAAiC27B,CAAS,CAAA,CACtE,CAAA,CAGF,IAAM75B,CAAAA,CAAS,IAAI,UAAA,CAAW9B,CAAAA,CAAK,MAAM,CAAA,CAEzC,IAAA,IAAS,CAAA,CAAI,EAAG,CAAA,CAAIA,CAAAA,CAAK,MAAA,CAAQ,CAAA,EAAK27B,CAAAA,CACpC,IAAA,IAAS9tB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI8tB,CAAAA,CAAW9tB,CAAAA,EAAAA,CAC7B/L,CAAAA,CAAO,CAAA,CAAI+L,CAAC,CAAA,CAAI7N,CAAAA,CAAK,EAAI27B,CAAAA,CAAY,CAAA,CAAI9tB,CAAC,CAAA,CAI9C,OAAO/L,CACT,CChOO,IAAM+5B,GAAN,MAAMC,CAAgB,CAO3B,WAAA,CACUrwB,CAAAA,CACAswB,CAAAA,CAKR,CANQ,IAAA,CAAA,MAAA,CAAAtwB,EACA,IAAA,CAAA,UAAA,CAAAswB,CAAAA,CAQR,GAAI,CAACtwB,CAAAA,CAAO,IAAA,EAAQ,CAACswB,CAAAA,CACnB,MAAM,IAAIh7B,CAAAA,CAAW,+BAA+B,CAAA,CAEtD,GAAI0K,CAAAA,CAAO,IAAA,EAAQ,CAACA,EAAO,IAAA,CAAK,EAAA,EAAM,CAACswB,CAAAA,CACrC,MAAM,IAAIh7B,CAAAA,CAAW,+BAA+B,CAExD,CAMA,OAAe,WAAA,CAAYqI,CAAAA,CAAmC,CAC5D,GAAIA,CAAAA,EAAO,OAAOA,GAAQ,QAAA,CAAU,CAElC,IAAM4yB,CAAAA,CADM5yB,CAAAA,CACM,GAAA,CAClB,GAAI4yB,CAAAA,YAAiB35B,EAAAA,CAAc,OAAO25B,CAC5C,CACA,OAAO,IACT,CAWA,KAAA,CACE1S,EACA/iB,CAAAA,CACA01B,CAAAA,CACAzzB,CAAAA,CACyB,CACzB,IAAM1G,CAAAA,CAAkC,EAAC,CAGnCo6B,EAAa1zB,CAAAA,EAAQ1G,CAAAA,CACrBjC,CAAAA,CAAU,IAAI8oB,EAAAA,CAAQW,CAAAA,CAAQ4S,CAAAA,CAAY31B,CAAAA,CAAQ,KAAK,MAAA,CAAO,KAAK,CAAA,CACzE1G,CAAAA,CAAQ,OAAA,CAAUiC,CAAAA,CAGlB,IAAMq6B,CAAAA,CAAW7S,EAAO,GAAA,CAWxB,GARExnB,CAAAA,CAAmC,GAAA,CAASwnB,CAAAA,CAG1C9gB,CAAAA,GACA1G,CAAAA,CAAmC,KAAA,CAAW0G,GAI9CyzB,CAAAA,EAAY,IAAA,CAAK,MAAA,CAAO,MAAA,CAC1B,IAAA,IACM37B,CAAAA,CAAI,CAAA,CACRA,CAAAA,CAAI,KAAK,MAAA,CAAO,MAAA,CAAO,MAAA,EAAUA,CAAAA,CAAI27B,CAAAA,CAAS,MAAA,CAC9C37B,CAAAA,EAAAA,CACA,CACA,IAAM87B,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO97B,CAAC,CAAA,CAC5B+7B,CAAAA,CAAWJ,CAAAA,CAAS37B,CAAC,CAAA,CAErBg8B,CAAAA,CACJ,OAAOD,CAAAA,EAAa,QAAA,CAChB,IAAA,CAAK,aAAA,CAAcA,EAAUx8B,CAAO,CAAA,CACpCw8B,CAAAA,CACNx8B,CAAAA,CAAQ,GAAA,CAAIu8B,CAAAA,CAAM,EAAA,CAAIE,CAAY,EACpC,CAUF,GALI,IAAA,CAAK,MAAA,CAAO,SAAA,EACd,IAAA,CAAK,cAAA,CAAex6B,CAAAA,CAAQwnB,EAAQzpB,CAAO,CAAA,CAIzC,IAAA,CAAK,MAAA,CAAO,GAAA,CACd,IAAA,IAAWynB,CAAAA,IAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAK,CAClC,IAAM3kB,CAAAA,CAAQ,IAAA,CAAK,cAAA,CAAe2kB,CAAAA,CAAMznB,CAAO,CAAA,CAC3CynB,CAAAA,CAAK,EAAA,GACPxlB,CAAAA,CAAOwlB,CAAAA,CAAK,EAAE,CAAA,CAAI3kB,CAAAA,EAEtB,CAIF,IAAM45B,CAAAA,CAASjT,CAAAA,CAAO,GAAA,CACrB,OAACxnB,CAAAA,CAAmC,OAAA,CAAay6B,CAAAA,CAASJ,EAEpDr6B,CACT,CAWQ,cAAA,CACNA,CAAAA,CACAwnB,CAAAA,CACAzpB,CAAAA,CACM,CACN,GAAK,IAAA,CAAK,MAAA,CAAO,SAAA,CAEjB,IAAA,GAAW,CAACyH,CAAAA,CAAMkgB,CAAQ,CAAA,GAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,SAAS,CAAA,CAAG,CAEpE,IAAIgV,CAAAA,CACAC,EAAY,KAAA,CAEhB,MAAA,CAAO,cAAA,CAAe36B,CAAAA,CAAQwF,CAAAA,CAAM,CAClC,GAAA,CAAK,KACEm1B,IACHD,CAAAA,CAAS,IAAA,CAAK,aAAA,CACZhV,CAAAA,CACA8B,CAAAA,CACAzpB,CACF,CAAA,CACA48B,CAAAA,CAAY,MAEPD,CAAAA,CAAAA,CAET,UAAA,CAAY,IAAA,CACZ,YAAA,CAAc,IAChB,CAAC,EACH,CACF,CAWQ,aAAA,CACNhV,CAAAA,CACA8B,CAAAA,CACAzpB,CAAAA,CACS,CAET,GAAI,OAAA,GAAW2nB,CAAAA,CACb,OAAO,IAAA,CAAK,aAAA,CACVA,CAAAA,CAAS,KAAA,CACT3nB,CACF,CAAA,CAIF,IAAM68B,CAAAA,CAAWpT,EAAO,GAAA,CAExB,GAAI,CAEF,GAAI9B,CAAAA,CAAS,GAAA,GAAQ,KAAA,CAAA,CAAW,CAC9B,IAAM5kB,CAAAA,CAAM,IAAA,CAAK,aAAA,CACf4kB,CAAAA,CAAS,GAAA,CACT3nB,CACF,CAAA,CACA,GAAI,OAAO+C,CAAAA,EAAQ,QAAA,CACjB0mB,CAAAA,CAAO,IAAA,CAAK1mB,CAAG,CAAA,CAAA,KAAA,GACN,OAAOA,GAAQ,QAAA,CACxB0mB,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAO1mB,CAAG,CAAC,CAAA,CAAA,KAEvB,MAAM,IAAI7B,CAAAA,CACR,CAAA,mCAAA,EAAsC,OAAO6B,CAAG,CAAA,CAClD,CAEJ,CAIA,OADc,IAAA,CAAK,cAAA,CAAe4kB,CAAAA,CAAU3nB,CAAO,CAErD,CAAA,OAAE,CAEI2nB,CAAAA,CAAS,MAAQ,MAAA,EACnB8B,CAAAA,CAAO,IAAA,CAAKoT,CAAQ,EAExB,CACF,CAUQ,cAAA,CAAepV,EAAqBznB,CAAAA,CAA2B,CAErE,IAAIypB,CAAAA,CAAuBzpB,CAAAA,CAAQ,EAAA,CACnC,GAAIynB,CAAAA,CAAK,KAAO,MAAA,CAAW,CACzB,IAAMqV,CAAAA,CAAQ,IAAA,CAAK,aAAA,CAAcrV,CAAAA,CAAK,EAAA,CAAIznB,CAAO,CAAA,CACjD,GAAI88B,CAAAA,YAAiBt6B,EAAAA,CACnBinB,CAAAA,CAASqT,CAAAA,CAAAA,KACJ,CACL,IAAMC,CAAAA,CAAMd,CAAAA,CAAgB,WAAA,CAAYa,CAAK,CAAA,CAC7C,GAAIC,CAAAA,CACFtT,CAAAA,CAASsT,OAET,MAAM,IAAI77B,CAAAA,CACR,0DACF,CAEJ,CACF,CAGA,GAAIumB,EAAK,EAAA,EAGH,CAFc,IAAA,CAAK,aAAA,CAAcA,CAAAA,CAAK,EAAA,CAAIznB,CAAO,CAAA,CAGnD,OAKJ,GAAIynB,CAAAA,CAAK,GAAA,GAAQ,MAAA,CAAW,CAC1B,IAAM1kB,CAAAA,CAAM,IAAA,CAAK,cAAc0kB,CAAAA,CAAK,GAAA,CAAKznB,CAAO,CAAA,CAChD,GAAI,OAAO+C,CAAAA,EAAQ,QAAA,CACjB0mB,EAAO,IAAA,CAAK1mB,CAAG,CAAA,CAAA,KAAA,GACN,OAAOA,CAAAA,EAAQ,QAAA,CACxB0mB,CAAAA,CAAO,IAAA,CAAK,OAAO1mB,CAAG,CAAC,CAAA,CAAA,KAEvB,MAAM,IAAI7B,CAAAA,CAAW,CAAA,mCAAA,EAAsC,OAAO6B,CAAG,CAAA,CAAE,CAE3E,CAKA,OAAI0kB,CAAAA,CAAK,MAAA,CACA,IAAA,CAAK,cAAcA,CAAAA,CAAMznB,CAAO,CAAA,CAIrCynB,CAAAA,CAAK,QAAA,CACA,IAAA,CAAK,aAAA,CAAcA,CAAAA,CAAMznB,CAAO,CAAA,CAI3B,IAAA,CAAK,UAAA,CAAWynB,CAAAA,CAAMznB,CAAO,CAO7C,CAUQ,aAAA,CAAcynB,EAAqBznB,CAAAA,CAA6B,CACtE,IAAMypB,CAAAA,CAASzpB,CAAAA,CAAQ,EAAA,CACjBiC,CAAAA,CAAoB,EAAC,CAE3B,OAAQwlB,CAAAA,CAAK,MAAA,EACX,KAAK,MAAA,CAAQ,CAEX,IAAMuV,CAAAA,CAAa,IAAA,CAAK,aAAA,CAAcvV,CAAAA,CAAK,aAAa,CAAA,CAAGznB,CAAO,CAAA,CAC5DgD,EACJ,OAAOg6B,CAAAA,EAAe,QAAA,CAClBA,CAAAA,CACA,OAAOA,CAAAA,EAAe,QAAA,CACpB,MAAA,CAAOA,CAAU,CAAA,CACjB,CAAA,CAER,GAAIh6B,CAAAA,CAAQ,CAAA,CACV,MAAM,IAAI9B,CAAAA,CAAW,CAAA,sCAAA,EAAyC8B,CAAK,CAAA,CAAE,CAAA,CAGvE,IAAA,IAASvC,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIuC,EAAOvC,CAAAA,EAAAA,CAAK,CAE9BT,CAAAA,CAAQ,GAAA,CAAI,QAAA,CAAUS,CAAC,CAAA,CACvB,IAAMqC,EAAQ,IAAA,CAAK,cAAA,CACjB,CAAE,GAAG2kB,CAAAA,CAAM,MAAA,CAAQ,MAAA,CAAW,aAAA,CAAe,MAAU,CAAA,CACvDznB,CACF,CAAA,CACAiC,CAAAA,CAAO,IAAA,CAAKa,CAAK,EACnB,CACA,KACF,CAEA,KAAK,KAAA,CAAO,CAEV,KAAO,CAAC2mB,CAAAA,CAAO,KAAA,IACbzpB,CAAAA,CAAQ,GAAA,CAAI,QAAA,CAAUiC,CAAAA,CAAO,MAAM,CAAA,CACnCA,CAAAA,CAAO,IAAA,CAAK,KAAK,UAAA,CAAWwlB,CAAAA,CAAMznB,CAAO,CAAC,CAAA,CAE5C,KACF,CAEA,KAAK,QAAS,CAEZ,GAAI,CAACynB,CAAAA,CAAK,cAAc,CAAA,CACtB,MAAM,IAAIvmB,CAAAA,CAAW,qCAAqC,CAAA,CAG5D,IAAIwmB,CAAAA,CAAQ,CAAA,CACZ,OAAa,CACX1nB,EAAQ,GAAA,CAAI,QAAA,CAAU0nB,CAAK,CAAA,CAG3B,IAAM5kB,CAAAA,CAAQ,IAAA,CAAK,cAAA,CACjB,CAAE,GAAG2kB,CAAAA,CAAM,MAAA,CAAQ,MAAA,CAAW,cAAA,CAAgB,MAAU,CAAA,CACxDznB,CACF,EAeA,GAdAiC,CAAAA,CAAO,IAAA,CAAKa,CAAK,CAAA,CAGjB9C,CAAAA,CAAQ,GAAA,CAAI,GAAA,CAAK8C,CAAK,CAAA,CAGJ,IAAA,CAAK,aAAA,CAAc2kB,CAAAA,CAAK,cAAc,CAAA,CAAGznB,CAAO,CAAA,EAQ9DypB,EAAO,KAAA,EAAM,CACf,MAGF/B,CAAAA,GACF,CACA,KACF,CAEA,QACE,MAAM,IAAIxmB,CAAAA,CAAW,CAAA,qBAAA,EAAwBumB,CAAAA,CAAK,MAAM,CAAA,CAAE,CAC9D,CAEA,OAAOxlB,CACT,CAUQ,aAAA,CACNwlB,CAAAA,CACAznB,CAAAA,CACqB,CACrB,IAAMypB,CAAAA,CAASzpB,CAAAA,CAAQ,EAAA,CACjBi9B,CAAAA,CAAWxV,CAAAA,CAAK,QAAA,CAEtB,GAAI,KAAA,CAAM,OAAA,CAAQwV,CAAQ,CAAA,CAAG,CAE3B,IAAMv7B,CAAAA,CAAQ+nB,CAAAA,CAAO,SAAA,CAAUwT,CAAAA,CAAS,MAAM,EAC9C,IAAA,IAASx8B,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIw8B,CAAAA,CAAS,MAAA,CAAQx8B,CAAAA,EAAAA,CACnC,GAAIiB,EAAMjB,CAAC,CAAA,GAAMw8B,CAAAA,CAASx8B,CAAC,CAAA,CACzB,MAAM,IAAIO,EAAAA,CACR,6BAA6BP,CAAC,CAAA,WAAA,EAAcw8B,CAAAA,CAASx8B,CAAC,CAAC,CAAA,MAAA,EAASiB,CAAAA,CAAMjB,CAAC,CAAC,CAAA,CAAA,CACxEgpB,CAAAA,CAAO,GAAA,CAAMwT,CAAAA,CAAS,MAAA,CAASx8B,CACjC,CAAA,CAGJ,OAAOiB,CACT,CAAA,KAAO,CAEL,IAAMC,CAAAA,CACJ8lB,CAAAA,CAAK,QAAA,EACL,IAAA,CAAK,MAAA,CAAO,MAAM,QAAA,EAClB,IAAA,CAAK,UAAA,EAAY,QAAA,EACjB,OAAA,CACInb,CAAAA,CAAMmd,CAAAA,CAAO,OAAA,CAAQwT,CAAAA,CAAS,MAAA,CAAQt7B,CAAQ,CAAA,CACpD,GAAI2K,CAAAA,GAAQ2wB,CAAAA,CACV,MAAM,IAAIj8B,EAAAA,CACR,CAAA,6BAAA,EAAgCi8B,CAAQ,CAAA,QAAA,EAAW3wB,CAAG,CAAA,CAAA,CAAA,CACtDmd,CAAAA,CAAO,GAAA,CAAMwT,EAAS,MACxB,CAAA,CAEF,OAAO3wB,CACT,CACF,CAUQ,UAAA,CAAWmb,CAAAA,CAAqBznB,EAA2B,CACjE,IAAMypB,CAAAA,CAASzpB,CAAAA,CAAQ,EAAA,CACjBkE,CAAAA,CAAOujB,CAAAA,CAAK,IAAA,CAGlB,GAAIA,CAAAA,CAAK,IAAA,GAAS,MAAA,CAAW,CAC3B,IAAMyV,CAAAA,CAAY,IAAA,CAAK,cAAczV,CAAAA,CAAK,IAAA,CAAMznB,CAAO,CAAA,CACjD8D,CAAAA,CACJ,OAAOo5B,CAAAA,EAAc,QAAA,CACjBA,EACA,OAAOA,CAAAA,EAAc,QAAA,CACnB,MAAA,CAAOA,CAAS,CAAA,CAChB,CAAA,CAER,GAAIp5B,EAAO,CAAA,CACT,MAAM,IAAI5C,CAAAA,CAAW,CAAA,+BAAA,EAAkC4C,CAAI,CAAA,CAAE,CAAA,CAG/D,GAAII,CAAAA,GAAS,KAAA,EAAS,CAACA,CAAAA,CAAM,CAE3B,IAAMvC,CAAAA,CACJ8lB,EAAK,QAAA,EACL,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAClB,IAAA,CAAK,UAAA,EAAY,QAAA,EACjB,QACEtnB,CAAAA,CACJ,OAAI+D,CAAAA,GAAS,KAAA,EACX/D,CAAAA,CAAOspB,CAAAA,CAAO,SAAA,CAAU3lB,CAAI,EAExB2jB,CAAAA,CAAK,OAAA,GACPtnB,CAAAA,CAAO,IAAA,CAAK,eAAA,CAAgBA,CAAAA,CAAMsnB,CAAAA,CAAK,OAAO,GAGzC,IAAI,WAAA,CAAY9lB,CAAQ,CAAA,CAAE,MAAA,CAAOxB,CAAI,CAAA,GAE5CA,CAAAA,CAAOspB,EAAO,SAAA,CAAU3lB,CAAI,CAAA,CAExB2jB,CAAAA,CAAK,OAAA,GACPtnB,CAAAA,CAAO,IAAA,CAAK,eAAA,CAAgBA,EAAMsnB,CAAAA,CAAK,OAAO,CAAA,CAAA,CAEzCtnB,CAAAA,CAEX,CAAA,KAAO,CAEL,IAAIA,CAAAA,CAAOspB,EAAO,SAAA,CAAU3lB,CAAI,CAAA,CAE5B2jB,CAAAA,CAAK,OAAA,GACPtnB,CAAAA,CAAO,IAAA,CAAK,eAAA,CAAgBA,CAAAA,CAAMsnB,CAAAA,CAAK,OAAO,CAAA,CAAA,CAEhD,IAAM0V,CAAAA,CAAY,IAAI36B,EAAAA,CAAarC,CAAI,CAAA,CACvC,OAAO,IAAA,CAAK,SAAA,CAAU+D,CAAAA,CAAMi5B,CAAAA,CAAWn9B,CAAAA,CAASynB,CAAAA,CAAK,WAAW,CAAC,CACnE,CACF,CAGA,GAAIA,CAAAA,CAAK,UAAU,CAAA,CACjB,GAAIvjB,CAAAA,GAAS,KAAA,CAAO,CAClB,IAAMvC,CAAAA,CACJ8lB,CAAAA,CAAK,QAAA,EACL,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAClB,IAAA,CAAK,UAAA,EAAY,QAAA,EACjB,OAAA,CACI/lB,CAAAA,CAAQ+nB,EAAO,aAAA,EAAc,CAEnC,OAAO,IAAI,WAAA,CAAY9nB,CAAQ,CAAA,CAAE,MAAA,CAAOD,CAAK,CAC/C,CAAA,KAAO,CACL,IAAIA,CAAAA,CAAQ+nB,CAAAA,CAAO,aAAA,EAAc,CAKjC,GAHIhC,CAAAA,CAAK,OAAA,GACP/lB,CAAAA,CAAQ,IAAA,CAAK,eAAA,CAAgBA,CAAAA,CAAO+lB,CAAAA,CAAK,OAAO,CAAA,CAAA,CAE9CvjB,CAAAA,CAAM,CACR,IAAMk5B,CAAAA,CAAM,IAAI56B,EAAAA,CAAad,CAAK,EAClC,OAAO,IAAA,CAAK,SAAA,CAAUwC,CAAAA,CAAMk5B,CAAAA,CAAKp9B,CAAAA,CAASynB,CAAAA,CAAK,WAAW,CAAC,CAC7D,CACA,OAAO/lB,CACT,CAIF,GAAI,CAACwC,CAAAA,CACH,MAAM,IAAIhD,CAAAA,CAAW,oDAAoD,CAAA,CAG3E,OAAO,IAAA,CAAK,SAAA,CAAUgD,CAAAA,CAAMulB,EAAQzpB,CAAAA,CAASynB,CAAAA,CAAK,WAAW,CAAC,CAChE,CAYQ,SAAA,CACNvjB,CAAAA,CACAulB,EACAzpB,CAAAA,CACAo8B,CAAAA,CACS,CAET,GAAI,OAAOl4B,CAAAA,EAAS,QAAA,CAClB,OAAO,KAAK,eAAA,CACVA,CAAAA,CACAulB,CAAAA,CACAzpB,CACF,CAAA,CAIF,GAAM,CAAE,QAAA,CAAAuoB,EAAU,IAAA,CAAAyC,CAAK,CAAA,CAAI,IAAA,CAAK,sBAAA,CAAuB9mB,CAAAA,CAAMlE,CAAO,CAAA,CAC9Dq9B,CAAAA,CAAgBrS,CAAAA,CAAK,MAAA,CAAS,CAAA,CAAIA,CAAAA,CAAOoR,CAAAA,CAG/C,GAAIn4B,EAAAA,CAAcskB,CAAQ,CAAA,CACxB,OAAO,IAAA,CAAK,gBAAA,CAAiBA,CAAAA,CAAUkB,CAAAA,CAAQzpB,CAAO,CAAA,CAIxD,GAAI,IAAA,CAAK,MAAA,CAAO,KAAA,EAASuoB,CAAAA,IAAY,IAAA,CAAK,MAAA,CAAO,KAAA,CAAO,CACtD,IAAMC,CAAAA,CAAa,IAAA,CAAK,MAAA,CAAO,KAAA,CAAMD,CAAQ,CAAA,CAEvC+U,CAAAA,CAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAQ,IAAA,CAAK,UAAA,CAGtC,OAAI,IAAA,CAAK,MAAA,CAAO,KAAA,EAAS,CAAC9U,CAAAA,CAAW,KAAA,GACnCA,CAAAA,CAAW,KAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,KAAA,CAAA,CAI7B,IAAA,CAAK,OAAO,KAAA,EAAS,CAACA,CAAAA,CAAW,KAAA,GACnCA,CAAAA,CAAW,KAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,OAGb,IAAIyT,CAAAA,CAAgBzT,CAAAA,CAAY8U,CAAI,CAAA,CACrC,KAAA,CACjB7T,CAAAA,CACAzpB,CAAAA,CAAQ,OAAA,CACRq9B,CAAAA,CACAr9B,CAAAA,CAAQ,IACV,CACF,CAEA,MAAM,IAAIkB,EAAW,CAAA,cAAA,EAAiBqnB,CAAQ,CAAA,CAAE,CAClD,CAWQ,sBAAA,CACNgV,CAAAA,CACAv9B,CAAAA,CAC8D,CAE9D,IAAMqL,CAAAA,CAAQkyB,CAAAA,CAAS,KAAA,CAAM,+BAA+B,CAAA,CAE5D,GAAI,CAAClyB,EAEH,OAAO,CAAE,QAAA,CAAUkyB,CAAAA,CAAU,IAAA,CAAM,EAAG,CAAA,CAGxC,IAAMhV,CAAAA,CAAWld,CAAAA,CAAM,CAAC,CAAA,CAClBmyB,CAAAA,CAAanyB,CAAAA,CAAM,CAAC,CAAA,CAAE,MAAK,CAEjC,GAAI,CAACmyB,CAAAA,CAEH,OAAO,CAAE,QAAA,CAAAjV,CAAAA,CAAU,KAAM,EAAG,CAAA,CAI9B,IAAMyC,CAAAA,CAAyC,EAAC,CAC5CyS,CAAAA,CAAU,GACVC,CAAAA,CAAW,KAAA,CACXC,CAAAA,CAAa,EAAA,CACbC,CAAAA,CAAa,CAAA,CAEjB,IAAA,IAASn9B,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAI+8B,CAAAA,CAAW,MAAA,CAAQ/8B,CAAAA,EAAAA,CAAK,CAC1C,IAAMopB,CAAAA,CAAO2T,EAAW/8B,CAAC,CAAA,CAErBi9B,CAAAA,EACFD,CAAAA,EAAW5T,CAAAA,CACPA,CAAAA,GAAS8T,CAAAA,EAAcH,CAAAA,CAAW/8B,EAAI,CAAC,CAAA,GAAM,IAAA,GAC/Ci9B,CAAAA,CAAW,KAAA,CAAA,EAEJ7T,CAAAA,GAAS,GAAA,EAAOA,CAAAA,GAAS,KAClC6T,CAAAA,CAAW,IAAA,CACXC,CAAAA,CAAa9T,CAAAA,CACb4T,CAAAA,EAAW5T,CAAAA,EACFA,CAAAA,GAAS,GAAA,EAClB+T,IACAH,CAAAA,EAAW5T,CAAAA,EACFA,CAAAA,GAAS,GAAA,EAClB+T,CAAAA,EAAAA,CACAH,CAAAA,EAAW5T,CAAAA,EACFA,CAAAA,GAAS,KAAO+T,CAAAA,GAAe,CAAA,EAExC5S,CAAAA,CAAK,IAAA,CAAK,IAAA,CAAK,aAAA,CAAcyS,CAAAA,CAAQ,IAAA,GAAQz9B,CAAO,CAAC,CAAA,CACrDy9B,CAAAA,CAAU,EAAA,EAEVA,CAAAA,EAAW5T,EAEf,CAGA,OAAI4T,CAAAA,CAAQ,IAAA,EAAK,EACfzS,CAAAA,CAAK,IAAA,CAAK,IAAA,CAAK,aAAA,CAAcyS,CAAAA,CAAQ,IAAA,EAAK,CAAGz9B,CAAO,CAAC,CAAA,CAGhD,CAAE,QAAA,CAAAuoB,CAAAA,CAAU,KAAAyC,CAAK,CAC1B,CAUQ,aAAA,CACNnhB,CAAAA,CACA7J,CAAAA,CAC2B,CAE3B,GAAI6J,IAAQ,MAAA,CAAQ,OAAO,KAAA,CAC3B,GAAIA,CAAAA,GAAQ,OAAA,CAAS,OAAO,MAAA,CAG5B,GACGA,CAAAA,CAAI,UAAA,CAAW,GAAG,CAAA,EAAKA,CAAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EACvCA,EAAI,UAAA,CAAW,GAAG,CAAA,EAAKA,CAAAA,CAAI,QAAA,CAAS,GAAG,CAAA,CAExC,OAAOA,EAAI,KAAA,CAAM,CAAA,CAAG,EAAE,CAAA,CAIxB,GAAI,SAAA,CAAU,IAAA,CAAKA,CAAG,EACpB,OAAO,QAAA,CAASA,CAAAA,CAAK,EAAE,CAAA,CAEzB,GAAI,cAAA,CAAe,IAAA,CAAKA,CAAG,CAAA,CACzB,OAAO,UAAA,CAAWA,CAAG,CAAA,CAEvB,GAAI,gBAAA,CAAiB,IAAA,CAAKA,CAAG,CAAA,CAC3B,OAAO,QAAA,CAASA,CAAAA,CAAK,EAAE,CAAA,CAIzB,GAAI,CACF,IAAM5H,CAAAA,CAAS,IAAA,CAAK,aAAA,CAAc4H,CAAAA,CAAK7J,CAAO,CAAA,CAE9C,OACE,OAAOiC,CAAAA,EAAW,QAAA,EAClB,OAAOA,CAAAA,EAAW,QAAA,EAClB,OAAOA,CAAAA,EAAW,SAAA,CAEXA,EAGF,MAAA,CAAOA,CAAM,CACtB,CAAA,KAAQ,CAEN,OAAO4H,CACT,CACF,CAWQ,eAAA,CACNg0B,CAAAA,CACApU,CAAAA,CACAzpB,CAAAA,CACS,CACT,IAAM89B,CAAAA,CAAWD,EAAW,WAAW,CAAA,CACjCE,CAAAA,CAAQF,CAAAA,CAAW,KAAA,CACnBG,CAAAA,CAAcH,CAAAA,CAAW,OAAA,CAE/B,GAAI,CAACC,CAAAA,EAAY,OAAOA,CAAAA,EAAa,QAAA,CACnC,MAAM,IAAI58B,CAAAA,CAAW,mDAAmD,CAAA,CAG1E,GAAI,CAAC68B,CAAAA,CACH,MAAM,IAAI78B,CAAAA,CAAW,qCAAqC,CAAA,CAI5D,IAAM+8B,CAAAA,CAAc,IAAA,CAAK,aAAA,CAAcH,CAAAA,CAAU99B,CAAO,CAAA,CAGlDk+B,EAAY,MAAA,CAAOD,CAAW,CAAA,CAGhCE,CAAAA,CAAmCJ,CAAAA,CAAMG,CAAS,CAAA,CAOtD,GAJIC,IAAiB,MAAA,EAAaH,CAAAA,GAChCG,CAAAA,CAAeH,CAAAA,CAAAA,CAGbG,CAAAA,GAAiB,MAAA,CACnB,MAAM,IAAIj9B,EACR,CAAA,mCAAA,EAAsCg9B,CAAS,CAAA,+BAAA,CACjD,CAAA,CAIF,OAAO,IAAA,CAAK,SAAA,CAAUC,CAAAA,CAAc1U,EAAQzpB,CAAO,CACrD,CAWQ,gBAAA,CACNkE,CAAAA,CACAulB,CAAAA,CACAzpB,CAAAA,CACS,CACT,IAAMsE,CAAAA,CAAOF,EAAAA,CAAYF,CAAI,CAAA,CACvBk6B,CAAAA,CAAaj6B,EAAAA,CAAkBD,CAAI,CAAA,CAGnCm6B,GADO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAQ,IAAA,CAAK,UAAA,GACb,MAAA,CAGrBC,CAAAA,CAgBJ,GAfIF,EAEFE,CAAAA,CAASF,CAAAA,CACA,OAAOC,CAAAA,EAAe,QAAA,CAE/BC,CAAAA,CAASD,CAAAA,CACAA,CAAAA,EAAc,OAAOA,CAAAA,EAAe,QAAA,CAE7CC,CAAAA,CAAS,IAAA,CAAK,wBAAA,CAAyBD,CAAAA,CAAYr+B,CAAO,EAG1Ds+B,CAAAA,CAAS,IAAA,CAIPj6B,EAAAA,CAAcH,CAAI,CAAA,CACpB,OAAO,IAAA,CAAK,WAAA,CAAYI,EAAMg6B,CAAAA,CAAQ7U,CAAM,CAAA,CAI9C,GAAIllB,EAAAA,CAAYL,CAAI,CAAA,CAClB,OAAO,KAAK,SAAA,CAAUI,CAAAA,CAAMg6B,CAAAA,CAAQ7U,CAAM,CAAA,CAI5C,GAAI,QAAA,CAAS,IAAA,CAAKvlB,CAAI,CAAA,CAAG,CACvB,IAAMV,CAAAA,CAAI,QAAA,CAASU,CAAAA,CAAK,KAAA,CAAM,CAAC,EAAG,EAAE,CAAA,CAC9BqF,CAAAA,CAAMkgB,CAAAA,CAAO,aAAA,CAAcjmB,CAAC,CAAA,CAE5B+6B,CAAAA,CAAU,OAAO,MAAA,CAAO,gBAAgB,CAAA,CAC9C,OAAOh1B,CAAAA,EAAOg1B,CAAAA,CAAU,MAAA,CAAOh1B,CAAG,EAAIA,CACxC,CAGA,GAAI/E,EAAAA,CAAaN,CAAI,CAAA,CAAG,CACtB,IAAMvC,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAAY,OAAA,CAE/C,GAAIuC,CAAAA,GAAS,OAEX,OAAOulB,CAAAA,CAAO,QAAA,CAAS9nB,CAAAA,CAAU,CAAA,CAAG,KAAA,CAAO,IAAA,CAAM,IAAI,EAChD,GAAIuC,CAAAA,GAAS,KAAA,CAElB,MAAM,IAAIhD,CAAAA,CACR,2DACF,CAEJ,CAEA,MAAM,IAAIA,CAAAA,CAAW,CAAA,uBAAA,EAA0BgD,CAAI,CAAA,CAAE,CACvD,CAWQ,YACNA,CAAAA,CACAo6B,CAAAA,CACA7U,CAAAA,CACiB,CACjB,OAAQvlB,CAAAA,EACN,KAAK,KACH,OAAOulB,CAAAA,CAAO,MAAA,EAAO,CACvB,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,KAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,CAAAA,CAAO,QAAA,EAAS,CAC/D,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,IAAA,CAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,CAAAA,CAAO,QAAA,EAAS,CAC/D,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,IAAA,CAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,EAAO,QAAA,EAAS,CAC/D,KAAK,IAAA,CACH,OAAOA,CAAAA,CAAO,MAAA,EAAO,CACvB,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,IAAA,CAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,CAAAA,CAAO,UAAS,CAC/D,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,IAAA,CAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,CAAAA,CAAO,QAAA,EAAS,CAC/D,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,KAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,CAAAA,CAAO,QAAA,EAAS,CAC/D,QACE,MAAM,IAAIvoB,CAAAA,CAAW,CAAA,sBAAA,EAAyBgD,CAAI,CAAA,CAAE,CACxD,CACF,CAWQ,SAAA,CACNA,EACAo6B,CAAAA,CACA7U,CAAAA,CACQ,CACR,OAAQvlB,CAAAA,EACN,KAAK,IAAA,CACH,OAAOo6B,CAAAA,GAAW,IAAA,CAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,CAAAA,CAAO,QAAA,GACtD,KAAK,IAAA,CACH,OAAO6U,CAAAA,GAAW,IAAA,CAAO7U,CAAAA,CAAO,QAAA,EAAS,CAAIA,EAAO,QAAA,EAAS,CAC/D,QACE,MAAM,IAAIvoB,CAAAA,CAAW,CAAA,oBAAA,EAAuBgD,CAAI,EAAE,CACtD,CACF,CAWQ,eAAA,CACN/D,CAAAA,CACAg7B,CAAAA,CACY,CACZ,OAAOD,GAAa/6B,CAAAA,CAAMg7B,CAAO,CACnC,CAUQ,wBAAA,CACNqD,CAAAA,CACAx+B,CAAAA,CACY,CACZ,IAAM89B,CAAAA,CAAWU,CAAAA,CAAW,WAAW,CAAA,CACjCT,CAAAA,CAAQS,CAAAA,CAAW,KAAA,CAEzB,GAAI,CAACV,CAAAA,EAAY,OAAOA,CAAAA,EAAa,QAAA,CACnC,MAAM,IAAI58B,CAAAA,CAAW,6CAA6C,EAGpE,GAAI,CAAC68B,CAAAA,EAAS,OAAOA,CAAAA,EAAU,QAAA,CAC7B,MAAM,IAAI78B,CAAAA,CAAW,yCAAyC,CAAA,CAIhE,IAAM+8B,CAAAA,CAAc,IAAA,CAAK,aAAA,CAAcH,CAAAA,CAAU99B,CAAO,CAAA,CAGlDkG,CAAAA,CAAM,MAAA,CAAO+3B,CAAW,CAAA,CAG9B,GAAI/3B,CAAAA,IAAO63B,CAAAA,CAAO,CAChB,IAAMO,CAAAA,CAASP,CAAAA,CAAM73B,CAAG,CAAA,CACxB,GAAIo4B,CAAAA,GAAW,IAAA,EAAQA,IAAW,IAAA,CAChC,MAAM,IAAIp9B,CAAAA,CAAW,CAAA,0BAAA,EAA6Bo9B,CAAM,CAAA,CAAE,CAAA,CAE5D,OAAOA,CACT,CAGA,OAAO,IACT,CAUQ,aAAA,CACNx7B,CAAAA,CACA9C,CAAAA,CACS,CACT,GAAI8C,CAAAA,GAAU,MAAA,CAKd,CAAA,GAAI,OAAOA,CAAAA,EAAU,QAAA,EAAY,OAAOA,GAAU,SAAA,CAChD,OAAOA,CAAAA,CAIT,GAAI,OAAOA,CAAAA,EAAU,QAAA,CACnB,GAAI,CACF,OAAO6pB,EAAAA,CAAmB7pB,CAAAA,CAAO9C,CAAO,CAC1C,CAAA,MAASiI,CAAAA,CAAO,CACd,MAAM,IAAI/G,CAAAA,CACR,CAAA,+BAAA,EAAkC4B,CAAK,CAAA,GAAA,EAAMmF,CAAAA,YAAiB,KAAA,CAAQA,EAAM,OAAA,CAAU,MAAA,CAAOA,CAAK,CAAC,CAAA,CACrG,CACF,CAGF,OAAOnF,EACT,CACF,ECn5BO,SAASikB,EAAAA,CACd0X,CAAAA,CACA/7B,CAAAA,CACAyO,CAAAA,CAAwB,GACC,CACzB,GAAM,CAAE,QAAA,CAAA+V,CAAAA,CAAW,IAAA,CAAM,MAAA,CAAAjG,CAAAA,CAAS,KAAM,CAAA,CAAI9P,CAAAA,CAItCvF,CAAAA,CADS,IAAIqb,EAAAA,EAAU,CACP,KAAA,CAAMwX,CAAAA,CAAS,CAAE,QAAA,CAAAvX,CAAAA,CAAU,MAAA,CAAAjG,CAAO,CAAC,CAAA,CAGnDwI,CAAAA,CAAS,IAAIjnB,GAAaE,CAAM,CAAA,CAItC,OADoB,IAAIs5B,EAAAA,CAAgBpwB,CAAM,CAAA,CAC3B,KAAA,CAAM6d,CAAM,CACjC","file":"index.mjs","sourcesContent":["/**\n * @fileoverview Custom error classes for Kaitai Struct parsing and validation\n * @module utils/errors\n * @author Fabiano Pinto\n * @license MIT\n */\n\n/**\n * Base error class for all Kaitai Struct errors.\n * All custom errors in this library extend from this class.\n *\n * @class KaitaiError\n * @extends Error\n * @example\n * ```typescript\n * throw new KaitaiError('Something went wrong', 42)\n * ```\n */\nexport class KaitaiError extends Error {\n constructor(\n message: string,\n public position?: number,\n public context?: Uint8Array\n ) {\n super(KaitaiError.formatMessage(message, position, context))\n this.name = 'KaitaiError'\n Object.setPrototypeOf(this, KaitaiError.prototype)\n }\n\n /**\n * Format error message with position and context.\n * @private\n */\n private static formatMessage(\n message: string,\n position?: number,\n context?: Uint8Array\n ): string {\n let formatted = message\n\n if (position !== undefined) {\n formatted += ` (at byte offset 0x${position.toString(16).toUpperCase()})`\n }\n\n if (context && context.length > 0) {\n const hexContext = KaitaiError.formatHexContext(context, position)\n formatted += `\\n${hexContext}`\n }\n\n return formatted\n }\n\n /**\n * Format hex dump context around error position.\n * @private\n */\n private static formatHexContext(data: Uint8Array, position?: number): string {\n const contextSize = 16 // Show 16 bytes before and after\n const start = Math.max(0, (position ?? 0) - contextSize)\n const end = Math.min(data.length, (position ?? 0) + contextSize)\n const chunk = data.slice(start, end)\n\n const lines: string[] = ['Context:']\n let offset = start\n\n for (let i = 0; i < chunk.length; i += 16) {\n const lineBytes = chunk.slice(i, i + 16)\n const hex = Array.from(lineBytes)\n .map((b) => b.toString(16).padStart(2, '0'))\n .join(' ')\n const ascii = Array.from(lineBytes)\n .map((b) => (b >= 32 && b <= 126 ? String.fromCharCode(b) : '.'))\n .join('')\n\n const offsetStr = ` ${(offset + i).toString(16).padStart(8, '0')}`\n const marker =\n position !== undefined &&\n position >= offset + i &&\n position < offset + i + lineBytes.length\n ? ' <--'\n : ''\n\n lines.push(`${offsetStr}: ${hex.padEnd(48, ' ')} | ${ascii}${marker}`)\n }\n\n return lines.join('\\n')\n }\n}\n\n/**\n * Error thrown when validation fails.\n * Used when parsed data doesn't match expected constraints.\n *\n * @class ValidationError\n * @extends KaitaiError\n * @example\n * ```typescript\n * throw new ValidationError('Magic bytes mismatch', 0)\n * ```\n */\nexport class ValidationError extends KaitaiError {\n constructor(message: string, position?: number, context?: Uint8Array) {\n super(message, position, context)\n this.name = 'ValidationError'\n Object.setPrototypeOf(this, ValidationError.prototype)\n }\n}\n\n/**\n * Error thrown when parsing fails.\n * Used for general parsing errors that don't fit other categories.\n *\n * @class ParseError\n * @extends KaitaiError\n * @example\n * ```typescript\n * throw new ParseError('Invalid format structure', 100)\n * ```\n */\nexport class ParseError extends KaitaiError {\n constructor(message: string, position?: number, context?: Uint8Array) {\n super(message, position, context)\n this.name = 'ParseError'\n Object.setPrototypeOf(this, ParseError.prototype)\n }\n}\n\n/**\n * Error thrown when end of stream is reached unexpectedly.\n * Indicates an attempt to read beyond available data.\n *\n * @class EOFError\n * @extends KaitaiError\n * @example\n * ```typescript\n * throw new EOFError('Unexpected end of stream', 1024)\n * ```\n */\nexport class EOFError extends KaitaiError {\n constructor(\n message: string = 'Unexpected end of stream',\n position?: number,\n context?: Uint8Array\n ) {\n super(message, position, context)\n this.name = 'EOFError'\n Object.setPrototypeOf(this, EOFError.prototype)\n }\n}\n\n/**\n * Error thrown when a required feature is not yet implemented.\n * Used during development to mark incomplete functionality.\n *\n * @class NotImplementedError\n * @extends KaitaiError\n * @example\n * ```typescript\n * throw new NotImplementedError('Custom processing')\n * ```\n */\nexport class NotImplementedError extends KaitaiError {\n constructor(feature: string) {\n super(`Feature not yet implemented: ${feature}`)\n this.name = 'NotImplementedError'\n Object.setPrototypeOf(this, NotImplementedError.prototype)\n }\n}\n","/**\n * @fileoverview String encoding and decoding utilities for binary data\n * @module utils/encoding\n * @author Fabiano Pinto\n * @license MIT\n */\n\n/**\n * Decode bytes to string using specified encoding.\n * Supports UTF-8, ASCII, Latin-1, UTF-16LE, and UTF-16BE.\n * Falls back to TextDecoder for other encodings if available.\n *\n * @param bytes - Byte array to decode\n * @param encoding - Character encoding name (e.g., 'UTF-8', 'ASCII')\n * @returns Decoded string\n * @throws {Error} If encoding is not supported\n * @example\n * ```typescript\n * const bytes = new Uint8Array([0x48, 0x65, 0x6c, 0x6c, 0x6f])\n * const str = decodeString(bytes, 'UTF-8') // \"Hello\"\n * ```\n */\nexport function decodeString(bytes: Uint8Array, encoding: string): string {\n // Normalize encoding name\n const normalizedEncoding = encoding.toLowerCase().replace(/[-_]/g, '')\n\n // Handle common encodings\n switch (normalizedEncoding) {\n case 'utf8':\n case 'utf-8':\n return decodeUtf8(bytes)\n\n case 'ascii':\n case 'usascii':\n return decodeAscii(bytes)\n\n case 'utf16':\n case 'utf16le':\n case 'utf-16le':\n return decodeUtf16Le(bytes)\n\n case 'utf16be':\n case 'utf-16be':\n return decodeUtf16Be(bytes)\n\n case 'latin1':\n case 'iso88591':\n case 'iso-8859-1':\n return decodeLatin1(bytes)\n\n default:\n // Try using TextDecoder if available (browser/modern Node.js)\n if (typeof TextDecoder !== 'undefined') {\n try {\n // eslint-disable-next-line no-undef\n return new TextDecoder(encoding).decode(bytes)\n } catch {\n throw new Error(`Unsupported encoding: ${encoding}`)\n }\n }\n throw new Error(`Unsupported encoding: ${encoding}`)\n }\n}\n\n/**\n * Decode UTF-8 bytes to string.\n * Handles 1-4 byte UTF-8 sequences including surrogate pairs.\n *\n * @param bytes - UTF-8 encoded byte array\n * @returns Decoded string\n * @private\n */\nfunction decodeUtf8(bytes: Uint8Array): string {\n if (typeof TextDecoder !== 'undefined') {\n // eslint-disable-next-line no-undef\n return new TextDecoder('utf-8').decode(bytes)\n }\n\n // Fallback implementation\n let result = ''\n let i = 0\n\n while (i < bytes.length) {\n const byte1 = bytes[i++]\n\n if (byte1 < 0x80) {\n // 1-byte character (ASCII)\n result += String.fromCharCode(byte1)\n } else if (byte1 < 0xe0) {\n // 2-byte character\n const byte2 = bytes[i++]\n result += String.fromCharCode(((byte1 & 0x1f) << 6) | (byte2 & 0x3f))\n } else if (byte1 < 0xf0) {\n // 3-byte character\n const byte2 = bytes[i++]\n const byte3 = bytes[i++]\n result += String.fromCharCode(\n ((byte1 & 0x0f) << 12) | ((byte2 & 0x3f) << 6) | (byte3 & 0x3f)\n )\n } else {\n // 4-byte character (surrogate pair)\n const byte2 = bytes[i++]\n const byte3 = bytes[i++]\n const byte4 = bytes[i++]\n let codePoint =\n ((byte1 & 0x07) << 18) |\n ((byte2 & 0x3f) << 12) |\n ((byte3 & 0x3f) << 6) |\n (byte4 & 0x3f)\n codePoint -= 0x10000\n result += String.fromCharCode(\n 0xd800 + (codePoint >> 10),\n 0xdc00 + (codePoint & 0x3ff)\n )\n }\n }\n\n return result\n}\n\n/**\n * Decode ASCII bytes to string.\n * Only uses the lower 7 bits of each byte.\n *\n * @param bytes - ASCII encoded byte array\n * @returns Decoded string\n * @private\n */\nfunction decodeAscii(bytes: Uint8Array): string {\n let result = ''\n for (let i = 0; i < bytes.length; i++) {\n result += String.fromCharCode(bytes[i] & 0x7f)\n }\n return result\n}\n\n/**\n * Decode Latin-1 (ISO-8859-1) bytes to string.\n * Each byte directly maps to a Unicode code point.\n *\n * @param bytes - Latin-1 encoded byte array\n * @returns Decoded string\n * @private\n */\nfunction decodeLatin1(bytes: Uint8Array): string {\n let result = ''\n for (let i = 0; i < bytes.length; i++) {\n result += String.fromCharCode(bytes[i])\n }\n return result\n}\n\n/**\n * Decode UTF-16 Little Endian bytes to string.\n * Reads 2 bytes per character in little-endian order.\n *\n * @param bytes - UTF-16LE encoded byte array\n * @returns Decoded string\n * @private\n */\nfunction decodeUtf16Le(bytes: Uint8Array): string {\n if (typeof TextDecoder !== 'undefined') {\n // eslint-disable-next-line no-undef\n return new TextDecoder('utf-16le').decode(bytes)\n }\n\n let result = ''\n for (let i = 0; i < bytes.length; i += 2) {\n const charCode = bytes[i] | (bytes[i + 1] << 8)\n result += String.fromCharCode(charCode)\n }\n return result\n}\n\n/**\n * Decode UTF-16 Big Endian bytes to string.\n * Reads 2 bytes per character in big-endian order.\n *\n * @param bytes - UTF-16BE encoded byte array\n * @returns Decoded string\n * @private\n */\nfunction decodeUtf16Be(bytes: Uint8Array): string {\n if (typeof TextDecoder !== 'undefined') {\n // eslint-disable-next-line no-undef\n return new TextDecoder('utf-16be').decode(bytes)\n }\n\n let result = ''\n for (let i = 0; i < bytes.length; i += 2) {\n const charCode = (bytes[i] << 8) | bytes[i + 1]\n result += String.fromCharCode(charCode)\n }\n return result\n}\n","/**\n * @fileoverview Binary stream reader for Kaitai Struct\n * @module stream/KaitaiStream\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { EOFError } from '../utils/errors'\nimport { decodeString } from '../utils/encoding'\n\n/**\n * KaitaiStream provides methods for reading binary data with proper type handling\n * and endianness support. It's the core class for parsing binary formats.\n *\n * Supports reading:\n * - Unsigned integers (u1, u2, u4, u8) in both little and big endian\n * - Signed integers (s1, s2, s4, s8) in both little and big endian\n * - Floating point numbers (f4, f8) in both little and big endian\n * - Byte arrays (fixed length, until terminator, or all remaining)\n * - Strings with various encodings\n * - Bit-level data\n *\n * @class KaitaiStream\n * @example\n * ```typescript\n * const buffer = new Uint8Array([0x01, 0x02, 0x03, 0x04])\n * const stream = new KaitaiStream(buffer)\n *\n * const byte = stream.readU1() // Read 1 byte\n * const word = stream.readU2le() // Read 2 bytes little-endian\n * const str = stream.readStr(5, 'UTF-8') // Read 5-byte string\n * ```\n */\nexport class KaitaiStream {\n private buffer: Uint8Array\n private view: DataView\n private _pos: number = 0\n private _bits: number = 0\n private _bitsLeft: number = 0\n\n /**\n * Create a new KaitaiStream from a buffer\n * @param buffer - ArrayBuffer or Uint8Array containing the binary data\n */\n constructor(buffer: ArrayBuffer | Uint8Array) {\n if (buffer instanceof ArrayBuffer) {\n this.buffer = new Uint8Array(buffer)\n this.view = new DataView(buffer)\n } else {\n this.buffer = buffer\n this.view = new DataView(\n buffer.buffer,\n buffer.byteOffset,\n buffer.byteLength\n )\n }\n }\n\n /**\n * Current position in the stream\n */\n get pos(): number {\n return this._pos\n }\n\n set pos(value: number) {\n this._pos = value\n this._bitsLeft = 0 // Reset bit reading when seeking\n }\n\n /**\n * Total size of the stream in bytes\n */\n get size(): number {\n return this.buffer.length\n }\n\n /**\n * Check if we've reached the end of the stream\n */\n isEof(): boolean {\n return this._pos >= this.buffer.length\n }\n\n /**\n * Seek to a specific position in the stream\n * @param pos - Position to seek to\n */\n seek(pos: number): void {\n if (pos < 0 || pos > this.buffer.length) {\n throw new Error(`Invalid seek position: ${pos}`)\n }\n this.pos = pos\n }\n\n /**\n * Ensure we have enough bytes available\n * @param count - Number of bytes needed\n */\n private ensureBytes(count: number): void {\n if (this._pos + count > this.buffer.length) {\n throw new EOFError(\n `Requested ${count} bytes at position ${this._pos}, but only ${\n this.buffer.length - this._pos\n } bytes available`,\n this._pos\n )\n }\n }\n\n // ==================== Unsigned Integers ====================\n\n /**\n * Read 1-byte unsigned integer (0 to 255)\n */\n readU1(): number {\n this.ensureBytes(1)\n return this.buffer[this._pos++]\n }\n\n /**\n * Read 2-byte unsigned integer, little-endian\n */\n readU2le(): number {\n this.ensureBytes(2)\n const value = this.view.getUint16(this._pos, true)\n this._pos += 2\n return value\n }\n\n /**\n * Read 2-byte unsigned integer, big-endian\n */\n readU2be(): number {\n this.ensureBytes(2)\n const value = this.view.getUint16(this._pos, false)\n this._pos += 2\n return value\n }\n\n /**\n * Read 4-byte unsigned integer, little-endian\n */\n readU4le(): number {\n this.ensureBytes(4)\n const value = this.view.getUint32(this._pos, true)\n this._pos += 4\n return value\n }\n\n /**\n * Read 4-byte unsigned integer, big-endian\n */\n readU4be(): number {\n this.ensureBytes(4)\n const value = this.view.getUint32(this._pos, false)\n this._pos += 4\n return value\n }\n\n /**\n * Read 8-byte unsigned integer, little-endian\n * Returns BigInt for values > Number.MAX_SAFE_INTEGER\n */\n readU8le(): bigint {\n this.ensureBytes(8)\n const value = this.view.getBigUint64(this._pos, true)\n this._pos += 8\n return value\n }\n\n /**\n * Read 8-byte unsigned integer, big-endian\n * Returns BigInt for values > Number.MAX_SAFE_INTEGER\n */\n readU8be(): bigint {\n this.ensureBytes(8)\n const value = this.view.getBigUint64(this._pos, false)\n this._pos += 8\n return value\n }\n\n // ==================== Signed Integers ====================\n\n /**\n * Read 1-byte signed integer (-128 to 127)\n */\n readS1(): number {\n this.ensureBytes(1)\n return this.view.getInt8(this._pos++)\n }\n\n /**\n * Read 2-byte signed integer, little-endian\n */\n readS2le(): number {\n this.ensureBytes(2)\n const value = this.view.getInt16(this._pos, true)\n this._pos += 2\n return value\n }\n\n /**\n * Read 2-byte signed integer, big-endian\n */\n readS2be(): number {\n this.ensureBytes(2)\n const value = this.view.getInt16(this._pos, false)\n this._pos += 2\n return value\n }\n\n /**\n * Read 4-byte signed integer, little-endian\n */\n readS4le(): number {\n this.ensureBytes(4)\n const value = this.view.getInt32(this._pos, true)\n this._pos += 4\n return value\n }\n\n /**\n * Read 4-byte signed integer, big-endian\n */\n readS4be(): number {\n this.ensureBytes(4)\n const value = this.view.getInt32(this._pos, false)\n this._pos += 4\n return value\n }\n\n /**\n * Read 8-byte signed integer, little-endian\n * Returns BigInt for values outside Number.MAX_SAFE_INTEGER range\n */\n readS8le(): bigint {\n this.ensureBytes(8)\n const value = this.view.getBigInt64(this._pos, true)\n this._pos += 8\n return value\n }\n\n /**\n * Read 8-byte signed integer, big-endian\n * Returns BigInt for values outside Number.MAX_SAFE_INTEGER range\n */\n readS8be(): bigint {\n this.ensureBytes(8)\n const value = this.view.getBigInt64(this._pos, false)\n this._pos += 8\n return value\n }\n\n // ==================== Floating Point ====================\n\n /**\n * Read 4-byte IEEE 754 single-precision float, little-endian\n */\n readF4le(): number {\n this.ensureBytes(4)\n const value = this.view.getFloat32(this._pos, true)\n this._pos += 4\n return value\n }\n\n /**\n * Read 4-byte IEEE 754 single-precision float, big-endian\n */\n readF4be(): number {\n this.ensureBytes(4)\n const value = this.view.getFloat32(this._pos, false)\n this._pos += 4\n return value\n }\n\n /**\n * Read 8-byte IEEE 754 double-precision float, little-endian\n */\n readF8le(): number {\n this.ensureBytes(8)\n const value = this.view.getFloat64(this._pos, true)\n this._pos += 8\n return value\n }\n\n /**\n * Read 8-byte IEEE 754 double-precision float, big-endian\n */\n readF8be(): number {\n this.ensureBytes(8)\n const value = this.view.getFloat64(this._pos, false)\n this._pos += 8\n return value\n }\n\n // ==================== Byte Arrays ====================\n\n /**\n * Read a fixed number of bytes\n * @param length - Number of bytes to read\n */\n readBytes(length: number): Uint8Array {\n this.ensureBytes(length)\n const bytes = this.buffer.slice(this._pos, this._pos + length)\n this._pos += length\n return bytes\n }\n\n /**\n * Read all remaining bytes until end of stream\n */\n readBytesFull(): Uint8Array {\n const bytes = this.buffer.slice(this._pos)\n this._pos = this.buffer.length\n return bytes\n }\n\n /**\n * Read bytes until a terminator byte is found\n * @param term - Terminator byte value\n * @param include - Include terminator in result\n * @param consume - Consume terminator from stream\n * @param eosError - Throw error if EOS reached before terminator\n */\n readBytesterm(\n term: number,\n include: boolean = false,\n consume: boolean = true,\n eosError: boolean = true\n ): Uint8Array {\n const start = this._pos\n let end = start\n\n // Find terminator\n while (end < this.buffer.length && this.buffer[end] !== term) {\n end++\n }\n\n // Check if we found the terminator\n const foundTerm = end < this.buffer.length\n\n if (!foundTerm && eosError) {\n throw new EOFError(\n `Terminator byte ${term} not found before end of stream`,\n this._pos\n )\n }\n\n // Extract bytes\n const includeEnd = include && foundTerm ? end + 1 : end\n const bytes = this.buffer.slice(start, includeEnd)\n\n // Update position\n if (foundTerm && consume) {\n this._pos = end + 1\n } else {\n this._pos = end\n }\n\n return bytes\n }\n\n // ==================== Strings ====================\n\n /**\n * Read a fixed-length string\n * @param length - Number of bytes to read\n * @param encoding - Character encoding (default: UTF-8)\n */\n readStr(length: number, encoding: string = 'UTF-8'): string {\n const bytes = this.readBytes(length)\n return decodeString(bytes, encoding)\n }\n\n /**\n * Read a null-terminated string\n * @param encoding - Character encoding (default: UTF-8)\n * @param term - Terminator byte (default: 0)\n * @param include - Include terminator in result\n * @param consume - Consume terminator from stream\n * @param eosError - Throw error if EOS reached before terminator\n */\n readStrz(\n encoding: string = 'UTF-8',\n term: number = 0,\n include: boolean = false,\n consume: boolean = true,\n eosError: boolean = true\n ): string {\n const bytes = this.readBytesterm(term, include, consume, eosError)\n return decodeString(bytes, encoding)\n }\n\n // ==================== Bit-level Reading ====================\n\n /**\n * Align bit reading to byte boundary\n */\n alignToByte(): void {\n this._bitsLeft = 0\n }\n\n /**\n * Read specified number of bits as unsigned integer (big-endian)\n * @param n - Number of bits to read (1-64)\n */\n readBitsIntBe(n: number): bigint {\n if (n < 1 || n > 64) {\n throw new Error(`Invalid bit count: ${n}. Must be between 1 and 64`)\n }\n\n let result = 0n\n\n for (let bitsNeeded = n; bitsNeeded > 0; ) {\n if (this._bitsLeft === 0) {\n this._bits = this.readU1()\n this._bitsLeft = 8\n }\n\n const bitsToRead = Math.min(bitsNeeded, this._bitsLeft)\n const mask = (1 << bitsToRead) - 1\n const shift = this._bitsLeft - bitsToRead\n\n result =\n (result << BigInt(bitsToRead)) | BigInt((this._bits >> shift) & mask)\n\n this._bitsLeft -= bitsToRead\n bitsNeeded -= bitsToRead\n }\n\n return result\n }\n\n /**\n * Read specified number of bits as unsigned integer (little-endian)\n * @param n - Number of bits to read (1-64)\n */\n readBitsIntLe(n: number): bigint {\n if (n < 1 || n > 64) {\n throw new Error(`Invalid bit count: ${n}. Must be between 1 and 64`)\n }\n\n let result = 0n\n let bitPos = 0\n\n for (let bitsNeeded = n; bitsNeeded > 0; ) {\n if (this._bitsLeft === 0) {\n this._bits = this.readU1()\n this._bitsLeft = 8\n }\n\n const bitsToRead = Math.min(bitsNeeded, this._bitsLeft)\n const mask = (1 << bitsToRead) - 1\n\n result |= BigInt(this._bits & mask) << BigInt(bitPos)\n\n this._bits >>= bitsToRead\n this._bitsLeft -= bitsToRead\n bitsNeeded -= bitsToRead\n bitPos += bitsToRead\n }\n\n return result\n }\n\n // ==================== Utility Methods ====================\n\n /**\n * Get the underlying buffer\n */\n getBuffer(): Uint8Array {\n return this.buffer\n }\n\n /**\n * Create a substream from current position with specified size\n * @param size - Size of the substream in bytes\n */\n substream(size: number): KaitaiStream {\n this.ensureBytes(size)\n const subBuffer = this.buffer.slice(this._pos, this._pos + size)\n this._pos += size\n return new KaitaiStream(subBuffer)\n }\n}\n","/**\n * @fileoverview Type definitions for Kaitai Struct YAML schema (.ksy files)\n * @module parser/schema\n * @author Fabiano Pinto\n * @license MIT\n */\n\n/**\n * Root schema definition for a Kaitai Struct format.\n * Represents a complete .ksy file structure.\n *\n * @interface KsySchema\n * @example\n * ```typescript\n * const schema: KsySchema = {\n * meta: {\n * id: 'my_format',\n * endian: 'le'\n * },\n * seq: [\n * { id: 'magic', contents: [0x4D, 0x5A] },\n * { id: 'version', type: 'u2' }\n * ]\n * }\n * ```\n */\nexport interface KsySchema {\n /** Metadata about the format */\n meta: MetaSpec\n\n /** Sequential attributes (fields read in order) */\n seq?: AttributeSpec[]\n\n /** Named instances (lazy-evaluated fields) */\n instances?: Record<string, InstanceSpec>\n\n /** Nested type definitions */\n types?: Record<string, KsySchema>\n\n /** Enum definitions (named integer constants) */\n enums?: Record<string, EnumSpec>\n\n /** Documentation for this type */\n doc?: string\n\n /** Reference to documentation */\n 'doc-ref'?: string | string[]\n\n /** Parameters for parametric types */\n params?: ParamSpec[]\n}\n\n/**\n * Metadata section of a Kaitai Struct schema.\n * Contains information about the format itself.\n *\n * @interface MetaSpec\n */\nexport interface MetaSpec {\n /** Identifier for this format (required) */\n id: string\n\n /** Title/name of the format */\n title?: string\n\n /** Application that uses this format */\n application?: string | string[]\n\n /** File extension(s) for this format */\n 'file-extension'?: string | string[]\n\n /** MIME type(s) for this format */\n xref?: Record<string, string | string[]>\n\n /** License for the format specification */\n license?: string\n\n /** KS compatibility version */\n 'ks-version'?: string | number\n\n /** Debug mode flag */\n 'ks-debug'?: boolean\n\n /** Opaque types flag */\n 'ks-opaque-types'?: boolean\n\n /** Default endianness for the format */\n endian?: Endianness | EndianExpression\n\n /** Default encoding for strings */\n encoding?: string\n\n /** Imported type definitions */\n imports?: string[]\n\n /** Documentation */\n doc?: string\n\n /** Reference to documentation */\n 'doc-ref'?: string | string[]\n}\n\n/**\n * Endianness specification.\n */\nexport type Endianness = 'le' | 'be'\n\n/**\n * Expression-based endianness (switch on expression).\n *\n * @interface EndianExpression\n */\nexport interface EndianExpression {\n /** Expression to evaluate */\n 'switch-on': string\n\n /** Cases mapping values to endianness */\n cases: Record<string, Endianness>\n}\n\n/**\n * Attribute specification for sequential fields.\n * Describes how to read a single field from the stream.\n *\n * @interface AttributeSpec\n */\nexport interface AttributeSpec {\n /** Field identifier (name) */\n id?: string\n\n /** Data type to read */\n type?: string | SwitchType\n\n /** Arguments for parametric types */\n 'type-args'?: Array<string | number | boolean>\n\n /** Size of the field (in bytes or expression) */\n size?: number | string\n\n /** Size until specific byte value */\n 'size-eos'?: boolean\n\n /** Repeat specification */\n repeat?: RepeatSpec\n\n /** Number of repetitions (for repeat: expr) */\n 'repeat-expr'?: string | number\n\n /** Condition for repetition (for repeat: until) */\n 'repeat-until'?: string\n\n /** Conditional parsing */\n if?: string\n\n /** Expected contents (validation) */\n contents?: number[] | string\n\n /** String encoding */\n encoding?: string\n\n /** Pad right to alignment */\n 'pad-right'?: number\n\n /** Terminator byte for strings/arrays */\n terminator?: number\n\n /** Include terminator in result */\n include?: boolean\n\n /** Consume terminator from stream */\n consume?: boolean\n\n /** Throw error if terminator not found */\n 'eos-error'?: boolean\n\n /** Enum type name */\n enum?: string\n\n /** Absolute position to seek to */\n pos?: number | string\n\n /** Custom I/O stream */\n io?: string\n\n /** Processing directive (compression, encryption, etc.) */\n process?: string | ProcessSpec\n\n /** Documentation */\n doc?: string\n\n /** Reference to documentation */\n 'doc-ref'?: string | string[]\n\n /** Original field ID (for reference) */\n '-orig-id'?: string\n}\n\n/**\n * Instance specification for lazy-evaluated fields.\n * Similar to AttributeSpec but for instances section.\n *\n * @interface InstanceSpec\n */\nexport interface InstanceSpec extends Omit<AttributeSpec, 'id'> {\n /** Value instance (calculated field) */\n value?: string | number | boolean\n\n /** Position in stream (for pos instances) */\n pos?: number | string\n\n /** Custom I/O stream */\n io?: string\n}\n\n/**\n * Repeat specification types.\n */\nexport type RepeatSpec = 'expr' | 'eos' | 'until'\n\n/**\n * Switch-based type selection.\n * Allows different types based on an expression value.\n *\n * @interface SwitchType\n */\nexport interface SwitchType {\n /** Expression to evaluate for switching */\n 'switch-on': string\n\n /** Cases mapping values to types */\n cases: Record<string, string>\n\n /** Default type if no case matches */\n default?: string\n}\n\n/**\n * Processing specification for data transformation.\n *\n * @type ProcessSpec\n */\nexport type ProcessSpec = string | ProcessObject\n\n/**\n * Processing object with algorithm and parameters.\n *\n * @interface ProcessObject\n */\nexport interface ProcessObject {\n /** Processing algorithm */\n algorithm: string\n\n /** Algorithm parameters */\n [key: string]: unknown\n}\n\n/**\n * Enum specification (named integer constants).\n *\n * @type EnumSpec\n */\nexport type EnumSpec = Record<string | number, string | number>\n\n/**\n * Parameter specification for parametric types.\n *\n * @interface ParamSpec\n */\nexport interface ParamSpec {\n /** Parameter identifier */\n id: string\n\n /** Parameter type */\n type?: string\n\n /** Documentation */\n doc?: string\n\n /** Reference to documentation */\n 'doc-ref'?: string | string[]\n}\n\n/**\n * Validation result for schema validation.\n *\n * @interface ValidationResult\n */\nexport interface ValidationResult {\n /** Whether the schema is valid */\n valid: boolean\n\n /** Validation errors */\n errors: ValidationError[]\n\n /** Validation warnings */\n warnings: ValidationWarning[]\n}\n\n/**\n * Validation error.\n *\n * @interface ValidationError\n */\nexport interface ValidationError {\n /** Error message */\n message: string\n\n /** Path to the error in the schema */\n path: string[]\n\n /** Error code */\n code: string\n}\n\n/**\n * Validation warning.\n *\n * @interface ValidationWarning\n */\nexport interface ValidationWarning {\n /** Warning message */\n message: string\n\n /** Path to the warning in the schema */\n path: string[]\n\n /** Warning code */\n code: string\n}\n\n/**\n * Built-in Kaitai Struct types.\n */\nexport const BUILTIN_TYPES = [\n // Unsigned integers\n 'u1',\n 'u2',\n 'u2le',\n 'u2be',\n 'u4',\n 'u4le',\n 'u4be',\n 'u8',\n 'u8le',\n 'u8be',\n // Signed integers\n 's1',\n 's2',\n 's2le',\n 's2be',\n 's4',\n 's4le',\n 's4be',\n 's8',\n 's8le',\n 's8be',\n // Floating point\n 'f4',\n 'f4le',\n 'f4be',\n 'f8',\n 'f8le',\n 'f8be',\n // String\n 'str',\n 'strz',\n] as const\n\n/**\n * Type guard to check if a type is a built-in type.\n *\n * @param type - Type name to check\n * @returns True if the type is built-in\n */\nexport function isBuiltinType(type: string): boolean {\n if ((BUILTIN_TYPES as readonly string[]).includes(type)) return true\n // Bit field types: b1, b2, ..., b64\n if (/^b\\d+$/.test(type)) return true\n return false\n}\n\n/**\n * Get the default endianness for a type.\n * Returns the endianness suffix if present, otherwise undefined.\n *\n * @param type - Type name\n * @returns Endianness ('le', 'be', or undefined for default)\n */\nexport function getTypeEndianness(type: string): Endianness | undefined {\n if (type.endsWith('le')) return 'le'\n if (type.endsWith('be')) return 'be'\n return undefined\n}\n\n/**\n * Get the base type without endianness suffix.\n *\n * @param type - Type name\n * @returns Base type name\n * @example\n * ```typescript\n * getBaseType('u4le') // returns 'u4'\n * getBaseType('s2be') // returns 's2'\n * getBaseType('str') // returns 'str'\n * ```\n */\nexport function getBaseType(type: string): string {\n if (type.endsWith('le') || type.endsWith('be')) {\n return type.slice(0, -2)\n }\n return type\n}\n\n/**\n * Check if a type is an integer type.\n *\n * @param type - Type name\n * @returns True if the type is an integer\n */\nexport function isIntegerType(type: string): boolean {\n const base = getBaseType(type)\n return /^[us][1248]$/.test(base)\n}\n\n/**\n * Check if a type is a floating point type.\n *\n * @param type - Type name\n * @returns True if the type is a float\n */\nexport function isFloatType(type: string): boolean {\n const base = getBaseType(type)\n return /^f[48]$/.test(base)\n}\n\n/**\n * Check if a type is a string type.\n *\n * @param type - Type name\n * @returns True if the type is a string\n */\nexport function isStringType(type: string): boolean {\n return type === 'str' || type === 'strz'\n}\n","const ALIAS = Symbol.for('yaml.alias');\nconst DOC = Symbol.for('yaml.document');\nconst MAP = Symbol.for('yaml.map');\nconst PAIR = Symbol.for('yaml.pair');\nconst SCALAR = Symbol.for('yaml.scalar');\nconst SEQ = Symbol.for('yaml.seq');\nconst NODE_TYPE = Symbol.for('yaml.node.type');\nconst isAlias = (node) => !!node && typeof node === 'object' && node[NODE_TYPE] === ALIAS;\nconst isDocument = (node) => !!node && typeof node === 'object' && node[NODE_TYPE] === DOC;\nconst isMap = (node) => !!node && typeof node === 'object' && node[NODE_TYPE] === MAP;\nconst isPair = (node) => !!node && typeof node === 'object' && node[NODE_TYPE] === PAIR;\nconst isScalar = (node) => !!node && typeof node === 'object' && node[NODE_TYPE] === SCALAR;\nconst isSeq = (node) => !!node && typeof node === 'object' && node[NODE_TYPE] === SEQ;\nfunction isCollection(node) {\n if (node && typeof node === 'object')\n switch (node[NODE_TYPE]) {\n case MAP:\n case SEQ:\n return true;\n }\n return false;\n}\nfunction isNode(node) {\n if (node && typeof node === 'object')\n switch (node[NODE_TYPE]) {\n case ALIAS:\n case MAP:\n case SCALAR:\n case SEQ:\n return true;\n }\n return false;\n}\nconst hasAnchor = (node) => (isScalar(node) || isCollection(node)) && !!node.anchor;\n\nexport { ALIAS, DOC, MAP, NODE_TYPE, PAIR, SCALAR, SEQ, hasAnchor, isAlias, isCollection, isDocument, isMap, isNode, isPair, isScalar, isSeq };\n","import { isDocument, isNode, isPair, isCollection, isMap, isSeq, isScalar, isAlias } from './nodes/identity.js';\n\nconst BREAK = Symbol('break visit');\nconst SKIP = Symbol('skip children');\nconst REMOVE = Symbol('remove node');\n/**\n * Apply a visitor to an AST node or document.\n *\n * Walks through the tree (depth-first) starting from `node`, calling a\n * `visitor` function with three arguments:\n * - `key`: For sequence values and map `Pair`, the node's index in the\n * collection. Within a `Pair`, `'key'` or `'value'`, correspondingly.\n * `null` for the root node.\n * - `node`: The current node.\n * - `path`: The ancestry of the current node.\n *\n * The return value of the visitor may be used to control the traversal:\n * - `undefined` (default): Do nothing and continue\n * - `visit.SKIP`: Do not visit the children of this node, continue with next\n * sibling\n * - `visit.BREAK`: Terminate traversal completely\n * - `visit.REMOVE`: Remove the current node, then continue with the next one\n * - `Node`: Replace the current node, then continue by visiting it\n * - `number`: While iterating the items of a sequence or map, set the index\n * of the next step. This is useful especially if the index of the current\n * node has changed.\n *\n * If `visitor` is a single function, it will be called with all values\n * encountered in the tree, including e.g. `null` values. Alternatively,\n * separate visitor functions may be defined for each `Map`, `Pair`, `Seq`,\n * `Alias` and `Scalar` node. To define the same visitor function for more than\n * one node type, use the `Collection` (map and seq), `Value` (map, seq & scalar)\n * and `Node` (alias, map, seq & scalar) targets. Of all these, only the most\n * specific defined one will be used for each node.\n */\nfunction visit(node, visitor) {\n const visitor_ = initVisitor(visitor);\n if (isDocument(node)) {\n const cd = visit_(null, node.contents, visitor_, Object.freeze([node]));\n if (cd === REMOVE)\n node.contents = null;\n }\n else\n visit_(null, node, visitor_, Object.freeze([]));\n}\n// Without the `as symbol` casts, TS declares these in the `visit`\n// namespace using `var`, but then complains about that because\n// `unique symbol` must be `const`.\n/** Terminate visit traversal completely */\nvisit.BREAK = BREAK;\n/** Do not visit the children of the current node */\nvisit.SKIP = SKIP;\n/** Remove the current node */\nvisit.REMOVE = REMOVE;\nfunction visit_(key, node, visitor, path) {\n const ctrl = callVisitor(key, node, visitor, path);\n if (isNode(ctrl) || isPair(ctrl)) {\n replaceNode(key, path, ctrl);\n return visit_(key, ctrl, visitor, path);\n }\n if (typeof ctrl !== 'symbol') {\n if (isCollection(node)) {\n path = Object.freeze(path.concat(node));\n for (let i = 0; i < node.items.length; ++i) {\n const ci = visit_(i, node.items[i], visitor, path);\n if (typeof ci === 'number')\n i = ci - 1;\n else if (ci === BREAK)\n return BREAK;\n else if (ci === REMOVE) {\n node.items.splice(i, 1);\n i -= 1;\n }\n }\n }\n else if (isPair(node)) {\n path = Object.freeze(path.concat(node));\n const ck = visit_('key', node.key, visitor, path);\n if (ck === BREAK)\n return BREAK;\n else if (ck === REMOVE)\n node.key = null;\n const cv = visit_('value', node.value, visitor, path);\n if (cv === BREAK)\n return BREAK;\n else if (cv === REMOVE)\n node.value = null;\n }\n }\n return ctrl;\n}\n/**\n * Apply an async visitor to an AST node or document.\n *\n * Walks through the tree (depth-first) starting from `node`, calling a\n * `visitor` function with three arguments:\n * - `key`: For sequence values and map `Pair`, the node's index in the\n * collection. Within a `Pair`, `'key'` or `'value'`, correspondingly.\n * `null` for the root node.\n * - `node`: The current node.\n * - `path`: The ancestry of the current node.\n *\n * The return value of the visitor may be used to control the traversal:\n * - `Promise`: Must resolve to one of the following values\n * - `undefined` (default): Do nothing and continue\n * - `visit.SKIP`: Do not visit the children of this node, continue with next\n * sibling\n * - `visit.BREAK`: Terminate traversal completely\n * - `visit.REMOVE`: Remove the current node, then continue with the next one\n * - `Node`: Replace the current node, then continue by visiting it\n * - `number`: While iterating the items of a sequence or map, set the index\n * of the next step. This is useful especially if the index of the current\n * node has changed.\n *\n * If `visitor` is a single function, it will be called with all values\n * encountered in the tree, including e.g. `null` values. Alternatively,\n * separate visitor functions may be defined for each `Map`, `Pair`, `Seq`,\n * `Alias` and `Scalar` node. To define the same visitor function for more than\n * one node type, use the `Collection` (map and seq), `Value` (map, seq & scalar)\n * and `Node` (alias, map, seq & scalar) targets. Of all these, only the most\n * specific defined one will be used for each node.\n */\nasync function visitAsync(node, visitor) {\n const visitor_ = initVisitor(visitor);\n if (isDocument(node)) {\n const cd = await visitAsync_(null, node.contents, visitor_, Object.freeze([node]));\n if (cd === REMOVE)\n node.contents = null;\n }\n else\n await visitAsync_(null, node, visitor_, Object.freeze([]));\n}\n// Without the `as symbol` casts, TS declares these in the `visit`\n// namespace using `var`, but then complains about that because\n// `unique symbol` must be `const`.\n/** Terminate visit traversal completely */\nvisitAsync.BREAK = BREAK;\n/** Do not visit the children of the current node */\nvisitAsync.SKIP = SKIP;\n/** Remove the current node */\nvisitAsync.REMOVE = REMOVE;\nasync function visitAsync_(key, node, visitor, path) {\n const ctrl = await callVisitor(key, node, visitor, path);\n if (isNode(ctrl) || isPair(ctrl)) {\n replaceNode(key, path, ctrl);\n return visitAsync_(key, ctrl, visitor, path);\n }\n if (typeof ctrl !== 'symbol') {\n if (isCollection(node)) {\n path = Object.freeze(path.concat(node));\n for (let i = 0; i < node.items.length; ++i) {\n const ci = await visitAsync_(i, node.items[i], visitor, path);\n if (typeof ci === 'number')\n i = ci - 1;\n else if (ci === BREAK)\n return BREAK;\n else if (ci === REMOVE) {\n node.items.splice(i, 1);\n i -= 1;\n }\n }\n }\n else if (isPair(node)) {\n path = Object.freeze(path.concat(node));\n const ck = await visitAsync_('key', node.key, visitor, path);\n if (ck === BREAK)\n return BREAK;\n else if (ck === REMOVE)\n node.key = null;\n const cv = await visitAsync_('value', node.value, visitor, path);\n if (cv === BREAK)\n return BREAK;\n else if (cv === REMOVE)\n node.value = null;\n }\n }\n return ctrl;\n}\nfunction initVisitor(visitor) {\n if (typeof visitor === 'object' &&\n (visitor.Collection || visitor.Node || visitor.Value)) {\n return Object.assign({\n Alias: visitor.Node,\n Map: visitor.Node,\n Scalar: visitor.Node,\n Seq: visitor.Node\n }, visitor.Value && {\n Map: visitor.Value,\n Scalar: visitor.Value,\n Seq: visitor.Value\n }, visitor.Collection && {\n Map: visitor.Collection,\n Seq: visitor.Collection\n }, visitor);\n }\n return visitor;\n}\nfunction callVisitor(key, node, visitor, path) {\n if (typeof visitor === 'function')\n return visitor(key, node, path);\n if (isMap(node))\n return visitor.Map?.(key, node, path);\n if (isSeq(node))\n return visitor.Seq?.(key, node, path);\n if (isPair(node))\n return visitor.Pair?.(key, node, path);\n if (isScalar(node))\n return visitor.Scalar?.(key, node, path);\n if (isAlias(node))\n return visitor.Alias?.(key, node, path);\n return undefined;\n}\nfunction replaceNode(key, path, node) {\n const parent = path[path.length - 1];\n if (isCollection(parent)) {\n parent.items[key] = node;\n }\n else if (isPair(parent)) {\n if (key === 'key')\n parent.key = node;\n else\n parent.value = node;\n }\n else if (isDocument(parent)) {\n parent.contents = node;\n }\n else {\n const pt = isAlias(parent) ? 'alias' : 'scalar';\n throw new Error(`Cannot replace node with ${pt} parent`);\n }\n}\n\nexport { visit, visitAsync };\n","import { isNode } from '../nodes/identity.js';\nimport { visit } from '../visit.js';\n\nconst escapeChars = {\n '!': '%21',\n ',': '%2C',\n '[': '%5B',\n ']': '%5D',\n '{': '%7B',\n '}': '%7D'\n};\nconst escapeTagName = (tn) => tn.replace(/[!,[\\]{}]/g, ch => escapeChars[ch]);\nclass Directives {\n constructor(yaml, tags) {\n /**\n * The directives-end/doc-start marker `---`. If `null`, a marker may still be\n * included in the document's stringified representation.\n */\n this.docStart = null;\n /** The doc-end marker `...`. */\n this.docEnd = false;\n this.yaml = Object.assign({}, Directives.defaultYaml, yaml);\n this.tags = Object.assign({}, Directives.defaultTags, tags);\n }\n clone() {\n const copy = new Directives(this.yaml, this.tags);\n copy.docStart = this.docStart;\n return copy;\n }\n /**\n * During parsing, get a Directives instance for the current document and\n * update the stream state according to the current version's spec.\n */\n atDocument() {\n const res = new Directives(this.yaml, this.tags);\n switch (this.yaml.version) {\n case '1.1':\n this.atNextDocument = true;\n break;\n case '1.2':\n this.atNextDocument = false;\n this.yaml = {\n explicit: Directives.defaultYaml.explicit,\n version: '1.2'\n };\n this.tags = Object.assign({}, Directives.defaultTags);\n break;\n }\n return res;\n }\n /**\n * @param onError - May be called even if the action was successful\n * @returns `true` on success\n */\n add(line, onError) {\n if (this.atNextDocument) {\n this.yaml = { explicit: Directives.defaultYaml.explicit, version: '1.1' };\n this.tags = Object.assign({}, Directives.defaultTags);\n this.atNextDocument = false;\n }\n const parts = line.trim().split(/[ \\t]+/);\n const name = parts.shift();\n switch (name) {\n case '%TAG': {\n if (parts.length !== 2) {\n onError(0, '%TAG directive should contain exactly two parts');\n if (parts.length < 2)\n return false;\n }\n const [handle, prefix] = parts;\n this.tags[handle] = prefix;\n return true;\n }\n case '%YAML': {\n this.yaml.explicit = true;\n if (parts.length !== 1) {\n onError(0, '%YAML directive should contain exactly one part');\n return false;\n }\n const [version] = parts;\n if (version === '1.1' || version === '1.2') {\n this.yaml.version = version;\n return true;\n }\n else {\n const isValid = /^\\d+\\.\\d+$/.test(version);\n onError(6, `Unsupported YAML version ${version}`, isValid);\n return false;\n }\n }\n default:\n onError(0, `Unknown directive ${name}`, true);\n return false;\n }\n }\n /**\n * Resolves a tag, matching handles to those defined in %TAG directives.\n *\n * @returns Resolved tag, which may also be the non-specific tag `'!'` or a\n * `'!local'` tag, or `null` if unresolvable.\n */\n tagName(source, onError) {\n if (source === '!')\n return '!'; // non-specific tag\n if (source[0] !== '!') {\n onError(`Not a valid tag: ${source}`);\n return null;\n }\n if (source[1] === '<') {\n const verbatim = source.slice(2, -1);\n if (verbatim === '!' || verbatim === '!!') {\n onError(`Verbatim tags aren't resolved, so ${source} is invalid.`);\n return null;\n }\n if (source[source.length - 1] !== '>')\n onError('Verbatim tags must end with a >');\n return verbatim;\n }\n const [, handle, suffix] = source.match(/^(.*!)([^!]*)$/s);\n if (!suffix)\n onError(`The ${source} tag has no suffix`);\n const prefix = this.tags[handle];\n if (prefix) {\n try {\n return prefix + decodeURIComponent(suffix);\n }\n catch (error) {\n onError(String(error));\n return null;\n }\n }\n if (handle === '!')\n return source; // local tag\n onError(`Could not resolve tag: ${source}`);\n return null;\n }\n /**\n * Given a fully resolved tag, returns its printable string form,\n * taking into account current tag prefixes and defaults.\n */\n tagString(tag) {\n for (const [handle, prefix] of Object.entries(this.tags)) {\n if (tag.startsWith(prefix))\n return handle + escapeTagName(tag.substring(prefix.length));\n }\n return tag[0] === '!' ? tag : `!<${tag}>`;\n }\n toString(doc) {\n const lines = this.yaml.explicit\n ? [`%YAML ${this.yaml.version || '1.2'}`]\n : [];\n const tagEntries = Object.entries(this.tags);\n let tagNames;\n if (doc && tagEntries.length > 0 && isNode(doc.contents)) {\n const tags = {};\n visit(doc.contents, (_key, node) => {\n if (isNode(node) && node.tag)\n tags[node.tag] = true;\n });\n tagNames = Object.keys(tags);\n }\n else\n tagNames = [];\n for (const [handle, prefix] of tagEntries) {\n if (handle === '!!' && prefix === 'tag:yaml.org,2002:')\n continue;\n if (!doc || tagNames.some(tn => tn.startsWith(prefix)))\n lines.push(`%TAG ${handle} ${prefix}`);\n }\n return lines.join('\\n');\n }\n}\nDirectives.defaultYaml = { explicit: false, version: '1.2' };\nDirectives.defaultTags = { '!!': 'tag:yaml.org,2002:' };\n\nexport { Directives };\n","import { isScalar, isCollection } from '../nodes/identity.js';\nimport { visit } from '../visit.js';\n\n/**\n * Verify that the input string is a valid anchor.\n *\n * Will throw on errors.\n */\nfunction anchorIsValid(anchor) {\n if (/[\\x00-\\x19\\s,[\\]{}]/.test(anchor)) {\n const sa = JSON.stringify(anchor);\n const msg = `Anchor must not contain whitespace or control characters: ${sa}`;\n throw new Error(msg);\n }\n return true;\n}\nfunction anchorNames(root) {\n const anchors = new Set();\n visit(root, {\n Value(_key, node) {\n if (node.anchor)\n anchors.add(node.anchor);\n }\n });\n return anchors;\n}\n/** Find a new anchor name with the given `prefix` and a one-indexed suffix. */\nfunction findNewAnchor(prefix, exclude) {\n for (let i = 1; true; ++i) {\n const name = `${prefix}${i}`;\n if (!exclude.has(name))\n return name;\n }\n}\nfunction createNodeAnchors(doc, prefix) {\n const aliasObjects = [];\n const sourceObjects = new Map();\n let prevAnchors = null;\n return {\n onAnchor: (source) => {\n aliasObjects.push(source);\n prevAnchors ?? (prevAnchors = anchorNames(doc));\n const anchor = findNewAnchor(prefix, prevAnchors);\n prevAnchors.add(anchor);\n return anchor;\n },\n /**\n * With circular references, the source node is only resolved after all\n * of its child nodes are. This is why anchors are set only after all of\n * the nodes have been created.\n */\n setAnchors: () => {\n for (const source of aliasObjects) {\n const ref = sourceObjects.get(source);\n if (typeof ref === 'object' &&\n ref.anchor &&\n (isScalar(ref.node) || isCollection(ref.node))) {\n ref.node.anchor = ref.anchor;\n }\n else {\n const error = new Error('Failed to resolve repeated object (this should not happen)');\n error.source = source;\n throw error;\n }\n }\n },\n sourceObjects\n };\n}\n\nexport { anchorIsValid, anchorNames, createNodeAnchors, findNewAnchor };\n","/**\n * Applies the JSON.parse reviver algorithm as defined in the ECMA-262 spec,\n * in section 24.5.1.1 \"Runtime Semantics: InternalizeJSONProperty\" of the\n * 2021 edition: https://tc39.es/ecma262/#sec-json.parse\n *\n * Includes extensions for handling Map and Set objects.\n */\nfunction applyReviver(reviver, obj, key, val) {\n if (val && typeof val === 'object') {\n if (Array.isArray(val)) {\n for (let i = 0, len = val.length; i < len; ++i) {\n const v0 = val[i];\n const v1 = applyReviver(reviver, val, String(i), v0);\n // eslint-disable-next-line @typescript-eslint/no-array-delete\n if (v1 === undefined)\n delete val[i];\n else if (v1 !== v0)\n val[i] = v1;\n }\n }\n else if (val instanceof Map) {\n for (const k of Array.from(val.keys())) {\n const v0 = val.get(k);\n const v1 = applyReviver(reviver, val, k, v0);\n if (v1 === undefined)\n val.delete(k);\n else if (v1 !== v0)\n val.set(k, v1);\n }\n }\n else if (val instanceof Set) {\n for (const v0 of Array.from(val)) {\n const v1 = applyReviver(reviver, val, v0, v0);\n if (v1 === undefined)\n val.delete(v0);\n else if (v1 !== v0) {\n val.delete(v0);\n val.add(v1);\n }\n }\n }\n else {\n for (const [k, v0] of Object.entries(val)) {\n const v1 = applyReviver(reviver, val, k, v0);\n if (v1 === undefined)\n delete val[k];\n else if (v1 !== v0)\n val[k] = v1;\n }\n }\n }\n return reviver.call(obj, key, val);\n}\n\nexport { applyReviver };\n","import { hasAnchor } from './identity.js';\n\n/**\n * Recursively convert any node or its contents to native JavaScript\n *\n * @param value - The input value\n * @param arg - If `value` defines a `toJSON()` method, use this\n * as its first argument\n * @param ctx - Conversion context, originally set in Document#toJS(). If\n * `{ keep: true }` is not set, output should be suitable for JSON\n * stringification.\n */\nfunction toJS(value, arg, ctx) {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n if (Array.isArray(value))\n return value.map((v, i) => toJS(v, String(i), ctx));\n if (value && typeof value.toJSON === 'function') {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n if (!ctx || !hasAnchor(value))\n return value.toJSON(arg, ctx);\n const data = { aliasCount: 0, count: 1, res: undefined };\n ctx.anchors.set(value, data);\n ctx.onCreate = res => {\n data.res = res;\n delete ctx.onCreate;\n };\n const res = value.toJSON(arg, ctx);\n if (ctx.onCreate)\n ctx.onCreate(res);\n return res;\n }\n if (typeof value === 'bigint' && !ctx?.keep)\n return Number(value);\n return value;\n}\n\nexport { toJS };\n","import { applyReviver } from '../doc/applyReviver.js';\nimport { NODE_TYPE, isDocument } from './identity.js';\nimport { toJS } from './toJS.js';\n\nclass NodeBase {\n constructor(type) {\n Object.defineProperty(this, NODE_TYPE, { value: type });\n }\n /** Create a copy of this node. */\n clone() {\n const copy = Object.create(Object.getPrototypeOf(this), Object.getOwnPropertyDescriptors(this));\n if (this.range)\n copy.range = this.range.slice();\n return copy;\n }\n /** A plain JavaScript representation of this node. */\n toJS(doc, { mapAsMap, maxAliasCount, onAnchor, reviver } = {}) {\n if (!isDocument(doc))\n throw new TypeError('A document argument is required');\n const ctx = {\n anchors: new Map(),\n doc,\n keep: true,\n mapAsMap: mapAsMap === true,\n mapKeyWarned: false,\n maxAliasCount: typeof maxAliasCount === 'number' ? maxAliasCount : 100\n };\n const res = toJS(this, '', ctx);\n if (typeof onAnchor === 'function')\n for (const { count, res } of ctx.anchors.values())\n onAnchor(res, count);\n return typeof reviver === 'function'\n ? applyReviver(reviver, { '': res }, '', res)\n : res;\n }\n}\n\nexport { NodeBase };\n","import { anchorIsValid } from '../doc/anchors.js';\nimport { visit } from '../visit.js';\nimport { ALIAS, isAlias, isCollection, isPair, hasAnchor } from './identity.js';\nimport { NodeBase } from './Node.js';\nimport { toJS } from './toJS.js';\n\nclass Alias extends NodeBase {\n constructor(source) {\n super(ALIAS);\n this.source = source;\n Object.defineProperty(this, 'tag', {\n set() {\n throw new Error('Alias nodes cannot have tags');\n }\n });\n }\n /**\n * Resolve the value of this alias within `doc`, finding the last\n * instance of the `source` anchor before this node.\n */\n resolve(doc, ctx) {\n let nodes;\n if (ctx?.aliasResolveCache) {\n nodes = ctx.aliasResolveCache;\n }\n else {\n nodes = [];\n visit(doc, {\n Node: (_key, node) => {\n if (isAlias(node) || hasAnchor(node))\n nodes.push(node);\n }\n });\n if (ctx)\n ctx.aliasResolveCache = nodes;\n }\n let found = undefined;\n for (const node of nodes) {\n if (node === this)\n break;\n if (node.anchor === this.source)\n found = node;\n }\n return found;\n }\n toJSON(_arg, ctx) {\n if (!ctx)\n return { source: this.source };\n const { anchors, doc, maxAliasCount } = ctx;\n const source = this.resolve(doc, ctx);\n if (!source) {\n const msg = `Unresolved alias (the anchor must be set before the alias): ${this.source}`;\n throw new ReferenceError(msg);\n }\n let data = anchors.get(source);\n if (!data) {\n // Resolve anchors for Node.prototype.toJS()\n toJS(source, null, ctx);\n data = anchors.get(source);\n }\n /* istanbul ignore if */\n if (!data || data.res === undefined) {\n const msg = 'This should not happen: Alias anchor was not resolved?';\n throw new ReferenceError(msg);\n }\n if (maxAliasCount >= 0) {\n data.count += 1;\n if (data.aliasCount === 0)\n data.aliasCount = getAliasCount(doc, source, anchors);\n if (data.count * data.aliasCount > maxAliasCount) {\n const msg = 'Excessive alias count indicates a resource exhaustion attack';\n throw new ReferenceError(msg);\n }\n }\n return data.res;\n }\n toString(ctx, _onComment, _onChompKeep) {\n const src = `*${this.source}`;\n if (ctx) {\n anchorIsValid(this.source);\n if (ctx.options.verifyAliasOrder && !ctx.anchors.has(this.source)) {\n const msg = `Unresolved alias (the anchor must be set before the alias): ${this.source}`;\n throw new Error(msg);\n }\n if (ctx.implicitKey)\n return `${src} `;\n }\n return src;\n }\n}\nfunction getAliasCount(doc, node, anchors) {\n if (isAlias(node)) {\n const source = node.resolve(doc);\n const anchor = anchors && source && anchors.get(source);\n return anchor ? anchor.count * anchor.aliasCount : 0;\n }\n else if (isCollection(node)) {\n let count = 0;\n for (const item of node.items) {\n const c = getAliasCount(doc, item, anchors);\n if (c > count)\n count = c;\n }\n return count;\n }\n else if (isPair(node)) {\n const kc = getAliasCount(doc, node.key, anchors);\n const vc = getAliasCount(doc, node.value, anchors);\n return Math.max(kc, vc);\n }\n return 1;\n}\n\nexport { Alias };\n","import { SCALAR } from './identity.js';\nimport { NodeBase } from './Node.js';\nimport { toJS } from './toJS.js';\n\nconst isScalarValue = (value) => !value || (typeof value !== 'function' && typeof value !== 'object');\nclass Scalar extends NodeBase {\n constructor(value) {\n super(SCALAR);\n this.value = value;\n }\n toJSON(arg, ctx) {\n return ctx?.keep ? this.value : toJS(this.value, arg, ctx);\n }\n toString() {\n return String(this.value);\n }\n}\nScalar.BLOCK_FOLDED = 'BLOCK_FOLDED';\nScalar.BLOCK_LITERAL = 'BLOCK_LITERAL';\nScalar.PLAIN = 'PLAIN';\nScalar.QUOTE_DOUBLE = 'QUOTE_DOUBLE';\nScalar.QUOTE_SINGLE = 'QUOTE_SINGLE';\n\nexport { Scalar, isScalarValue };\n","import { Alias } from '../nodes/Alias.js';\nimport { isNode, isPair, MAP, SEQ, isDocument } from '../nodes/identity.js';\nimport { Scalar } from '../nodes/Scalar.js';\n\nconst defaultTagPrefix = 'tag:yaml.org,2002:';\nfunction findTagObject(value, tagName, tags) {\n if (tagName) {\n const match = tags.filter(t => t.tag === tagName);\n const tagObj = match.find(t => !t.format) ?? match[0];\n if (!tagObj)\n throw new Error(`Tag ${tagName} not found`);\n return tagObj;\n }\n return tags.find(t => t.identify?.(value) && !t.format);\n}\nfunction createNode(value, tagName, ctx) {\n if (isDocument(value))\n value = value.contents;\n if (isNode(value))\n return value;\n if (isPair(value)) {\n const map = ctx.schema[MAP].createNode?.(ctx.schema, null, ctx);\n map.items.push(value);\n return map;\n }\n if (value instanceof String ||\n value instanceof Number ||\n value instanceof Boolean ||\n (typeof BigInt !== 'undefined' && value instanceof BigInt) // not supported everywhere\n ) {\n // https://tc39.es/ecma262/#sec-serializejsonproperty\n value = value.valueOf();\n }\n const { aliasDuplicateObjects, onAnchor, onTagObj, schema, sourceObjects } = ctx;\n // Detect duplicate references to the same object & use Alias nodes for all\n // after first. The `ref` wrapper allows for circular references to resolve.\n let ref = undefined;\n if (aliasDuplicateObjects && value && typeof value === 'object') {\n ref = sourceObjects.get(value);\n if (ref) {\n ref.anchor ?? (ref.anchor = onAnchor(value));\n return new Alias(ref.anchor);\n }\n else {\n ref = { anchor: null, node: null };\n sourceObjects.set(value, ref);\n }\n }\n if (tagName?.startsWith('!!'))\n tagName = defaultTagPrefix + tagName.slice(2);\n let tagObj = findTagObject(value, tagName, schema.tags);\n if (!tagObj) {\n if (value && typeof value.toJSON === 'function') {\n // eslint-disable-next-line @typescript-eslint/no-unsafe-call\n value = value.toJSON();\n }\n if (!value || typeof value !== 'object') {\n const node = new Scalar(value);\n if (ref)\n ref.node = node;\n return node;\n }\n tagObj =\n value instanceof Map\n ? schema[MAP]\n : Symbol.iterator in Object(value)\n ? schema[SEQ]\n : schema[MAP];\n }\n if (onTagObj) {\n onTagObj(tagObj);\n delete ctx.onTagObj;\n }\n const node = tagObj?.createNode\n ? tagObj.createNode(ctx.schema, value, ctx)\n : typeof tagObj?.nodeClass?.from === 'function'\n ? tagObj.nodeClass.from(ctx.schema, value, ctx)\n : new Scalar(value);\n if (tagName)\n node.tag = tagName;\n else if (!tagObj.default)\n node.tag = tagObj.tag;\n if (ref)\n ref.node = node;\n return node;\n}\n\nexport { createNode };\n","import { createNode } from '../doc/createNode.js';\nimport { isNode, isPair, isCollection, isScalar } from './identity.js';\nimport { NodeBase } from './Node.js';\n\nfunction collectionFromPath(schema, path, value) {\n let v = value;\n for (let i = path.length - 1; i >= 0; --i) {\n const k = path[i];\n if (typeof k === 'number' && Number.isInteger(k) && k >= 0) {\n const a = [];\n a[k] = v;\n v = a;\n }\n else {\n v = new Map([[k, v]]);\n }\n }\n return createNode(v, undefined, {\n aliasDuplicateObjects: false,\n keepUndefined: false,\n onAnchor: () => {\n throw new Error('This should not happen, please report a bug.');\n },\n schema,\n sourceObjects: new Map()\n });\n}\n// Type guard is intentionally a little wrong so as to be more useful,\n// as it does not cover untypable empty non-string iterables (e.g. []).\nconst isEmptyPath = (path) => path == null ||\n (typeof path === 'object' && !!path[Symbol.iterator]().next().done);\nclass Collection extends NodeBase {\n constructor(type, schema) {\n super(type);\n Object.defineProperty(this, 'schema', {\n value: schema,\n configurable: true,\n enumerable: false,\n writable: true\n });\n }\n /**\n * Create a copy of this collection.\n *\n * @param schema - If defined, overwrites the original's schema\n */\n clone(schema) {\n const copy = Object.create(Object.getPrototypeOf(this), Object.getOwnPropertyDescriptors(this));\n if (schema)\n copy.schema = schema;\n copy.items = copy.items.map(it => isNode(it) || isPair(it) ? it.clone(schema) : it);\n if (this.range)\n copy.range = this.range.slice();\n return copy;\n }\n /**\n * Adds a value to the collection. For `!!map` and `!!omap` the value must\n * be a Pair instance or a `{ key, value }` object, which may not have a key\n * that already exists in the map.\n */\n addIn(path, value) {\n if (isEmptyPath(path))\n this.add(value);\n else {\n const [key, ...rest] = path;\n const node = this.get(key, true);\n if (isCollection(node))\n node.addIn(rest, value);\n else if (node === undefined && this.schema)\n this.set(key, collectionFromPath(this.schema, rest, value));\n else\n throw new Error(`Expected YAML collection at ${key}. Remaining path: ${rest}`);\n }\n }\n /**\n * Removes a value from the collection.\n * @returns `true` if the item was found and removed.\n */\n deleteIn(path) {\n const [key, ...rest] = path;\n if (rest.length === 0)\n return this.delete(key);\n const node = this.get(key, true);\n if (isCollection(node))\n return node.deleteIn(rest);\n else\n throw new Error(`Expected YAML collection at ${key}. Remaining path: ${rest}`);\n }\n /**\n * Returns item at `key`, or `undefined` if not found. By default unwraps\n * scalar values from their surrounding node; to disable set `keepScalar` to\n * `true` (collections are always returned intact).\n */\n getIn(path, keepScalar) {\n const [key, ...rest] = path;\n const node = this.get(key, true);\n if (rest.length === 0)\n return !keepScalar && isScalar(node) ? node.value : node;\n else\n return isCollection(node) ? node.getIn(rest, keepScalar) : undefined;\n }\n hasAllNullValues(allowScalar) {\n return this.items.every(node => {\n if (!isPair(node))\n return false;\n const n = node.value;\n return (n == null ||\n (allowScalar &&\n isScalar(n) &&\n n.value == null &&\n !n.commentBefore &&\n !n.comment &&\n !n.tag));\n });\n }\n /**\n * Checks if the collection includes a value with the key `key`.\n */\n hasIn(path) {\n const [key, ...rest] = path;\n if (rest.length === 0)\n return this.has(key);\n const node = this.get(key, true);\n return isCollection(node) ? node.hasIn(rest) : false;\n }\n /**\n * Sets a value in this collection. For `!!set`, `value` needs to be a\n * boolean to add/remove the item from the set.\n */\n setIn(path, value) {\n const [key, ...rest] = path;\n if (rest.length === 0) {\n this.set(key, value);\n }\n else {\n const node = this.get(key, true);\n if (isCollection(node))\n node.setIn(rest, value);\n else if (node === undefined && this.schema)\n this.set(key, collectionFromPath(this.schema, rest, value));\n else\n throw new Error(`Expected YAML collection at ${key}. Remaining path: ${rest}`);\n }\n }\n}\n\nexport { Collection, collectionFromPath, isEmptyPath };\n","/**\n * Stringifies a comment.\n *\n * Empty comment lines are left empty,\n * lines consisting of a single space are replaced by `#`,\n * and all other lines are prefixed with a `#`.\n */\nconst stringifyComment = (str) => str.replace(/^(?!$)(?: $)?/gm, '#');\nfunction indentComment(comment, indent) {\n if (/^\\n+$/.test(comment))\n return comment.substring(1);\n return indent ? comment.replace(/^(?! *$)/gm, indent) : comment;\n}\nconst lineComment = (str, indent, comment) => str.endsWith('\\n')\n ? indentComment(comment, indent)\n : comment.includes('\\n')\n ? '\\n' + indentComment(comment, indent)\n : (str.endsWith(' ') ? '' : ' ') + comment;\n\nexport { indentComment, lineComment, stringifyComment };\n","const FOLD_FLOW = 'flow';\nconst FOLD_BLOCK = 'block';\nconst FOLD_QUOTED = 'quoted';\n/**\n * Tries to keep input at up to `lineWidth` characters, splitting only on spaces\n * not followed by newlines or spaces unless `mode` is `'quoted'`. Lines are\n * terminated with `\\n` and started with `indent`.\n */\nfunction foldFlowLines(text, indent, mode = 'flow', { indentAtStart, lineWidth = 80, minContentWidth = 20, onFold, onOverflow } = {}) {\n if (!lineWidth || lineWidth < 0)\n return text;\n if (lineWidth < minContentWidth)\n minContentWidth = 0;\n const endStep = Math.max(1 + minContentWidth, 1 + lineWidth - indent.length);\n if (text.length <= endStep)\n return text;\n const folds = [];\n const escapedFolds = {};\n let end = lineWidth - indent.length;\n if (typeof indentAtStart === 'number') {\n if (indentAtStart > lineWidth - Math.max(2, minContentWidth))\n folds.push(0);\n else\n end = lineWidth - indentAtStart;\n }\n let split = undefined;\n let prev = undefined;\n let overflow = false;\n let i = -1;\n let escStart = -1;\n let escEnd = -1;\n if (mode === FOLD_BLOCK) {\n i = consumeMoreIndentedLines(text, i, indent.length);\n if (i !== -1)\n end = i + endStep;\n }\n for (let ch; (ch = text[(i += 1)]);) {\n if (mode === FOLD_QUOTED && ch === '\\\\') {\n escStart = i;\n switch (text[i + 1]) {\n case 'x':\n i += 3;\n break;\n case 'u':\n i += 5;\n break;\n case 'U':\n i += 9;\n break;\n default:\n i += 1;\n }\n escEnd = i;\n }\n if (ch === '\\n') {\n if (mode === FOLD_BLOCK)\n i = consumeMoreIndentedLines(text, i, indent.length);\n end = i + indent.length + endStep;\n split = undefined;\n }\n else {\n if (ch === ' ' &&\n prev &&\n prev !== ' ' &&\n prev !== '\\n' &&\n prev !== '\\t') {\n // space surrounded by non-space can be replaced with newline + indent\n const next = text[i + 1];\n if (next && next !== ' ' && next !== '\\n' && next !== '\\t')\n split = i;\n }\n if (i >= end) {\n if (split) {\n folds.push(split);\n end = split + endStep;\n split = undefined;\n }\n else if (mode === FOLD_QUOTED) {\n // white-space collected at end may stretch past lineWidth\n while (prev === ' ' || prev === '\\t') {\n prev = ch;\n ch = text[(i += 1)];\n overflow = true;\n }\n // Account for newline escape, but don't break preceding escape\n const j = i > escEnd + 1 ? i - 2 : escStart - 1;\n // Bail out if lineWidth & minContentWidth are shorter than an escape string\n if (escapedFolds[j])\n return text;\n folds.push(j);\n escapedFolds[j] = true;\n end = j + endStep;\n split = undefined;\n }\n else {\n overflow = true;\n }\n }\n }\n prev = ch;\n }\n if (overflow && onOverflow)\n onOverflow();\n if (folds.length === 0)\n return text;\n if (onFold)\n onFold();\n let res = text.slice(0, folds[0]);\n for (let i = 0; i < folds.length; ++i) {\n const fold = folds[i];\n const end = folds[i + 1] || text.length;\n if (fold === 0)\n res = `\\n${indent}${text.slice(0, end)}`;\n else {\n if (mode === FOLD_QUOTED && escapedFolds[fold])\n res += `${text[fold]}\\\\`;\n res += `\\n${indent}${text.slice(fold + 1, end)}`;\n }\n }\n return res;\n}\n/**\n * Presumes `i + 1` is at the start of a line\n * @returns index of last newline in more-indented block\n */\nfunction consumeMoreIndentedLines(text, i, indent) {\n let end = i;\n let start = i + 1;\n let ch = text[start];\n while (ch === ' ' || ch === '\\t') {\n if (i < start + indent) {\n ch = text[++i];\n }\n else {\n do {\n ch = text[++i];\n } while (ch && ch !== '\\n');\n end = i;\n start = i + 1;\n ch = text[start];\n }\n }\n return end;\n}\n\nexport { FOLD_BLOCK, FOLD_FLOW, FOLD_QUOTED, foldFlowLines };\n","import { Scalar } from '../nodes/Scalar.js';\nimport { foldFlowLines, FOLD_FLOW, FOLD_QUOTED, FOLD_BLOCK } from './foldFlowLines.js';\n\nconst getFoldOptions = (ctx, isBlock) => ({\n indentAtStart: isBlock ? ctx.indent.length : ctx.indentAtStart,\n lineWidth: ctx.options.lineWidth,\n minContentWidth: ctx.options.minContentWidth\n});\n// Also checks for lines starting with %, as parsing the output as YAML 1.1 will\n// presume that's starting a new document.\nconst containsDocumentMarker = (str) => /^(%|---|\\.\\.\\.)/m.test(str);\nfunction lineLengthOverLimit(str, lineWidth, indentLength) {\n if (!lineWidth || lineWidth < 0)\n return false;\n const limit = lineWidth - indentLength;\n const strLen = str.length;\n if (strLen <= limit)\n return false;\n for (let i = 0, start = 0; i < strLen; ++i) {\n if (str[i] === '\\n') {\n if (i - start > limit)\n return true;\n start = i + 1;\n if (strLen - start <= limit)\n return false;\n }\n }\n return true;\n}\nfunction doubleQuotedString(value, ctx) {\n const json = JSON.stringify(value);\n if (ctx.options.doubleQuotedAsJSON)\n return json;\n const { implicitKey } = ctx;\n const minMultiLineLength = ctx.options.doubleQuotedMinMultiLineLength;\n const indent = ctx.indent || (containsDocumentMarker(value) ? ' ' : '');\n let str = '';\n let start = 0;\n for (let i = 0, ch = json[i]; ch; ch = json[++i]) {\n if (ch === ' ' && json[i + 1] === '\\\\' && json[i + 2] === 'n') {\n // space before newline needs to be escaped to not be folded\n str += json.slice(start, i) + '\\\\ ';\n i += 1;\n start = i;\n ch = '\\\\';\n }\n if (ch === '\\\\')\n switch (json[i + 1]) {\n case 'u':\n {\n str += json.slice(start, i);\n const code = json.substr(i + 2, 4);\n switch (code) {\n case '0000':\n str += '\\\\0';\n break;\n case '0007':\n str += '\\\\a';\n break;\n case '000b':\n str += '\\\\v';\n break;\n case '001b':\n str += '\\\\e';\n break;\n case '0085':\n str += '\\\\N';\n break;\n case '00a0':\n str += '\\\\_';\n break;\n case '2028':\n str += '\\\\L';\n break;\n case '2029':\n str += '\\\\P';\n break;\n default:\n if (code.substr(0, 2) === '00')\n str += '\\\\x' + code.substr(2);\n else\n str += json.substr(i, 6);\n }\n i += 5;\n start = i + 1;\n }\n break;\n case 'n':\n if (implicitKey ||\n json[i + 2] === '\"' ||\n json.length < minMultiLineLength) {\n i += 1;\n }\n else {\n // folding will eat first newline\n str += json.slice(start, i) + '\\n\\n';\n while (json[i + 2] === '\\\\' &&\n json[i + 3] === 'n' &&\n json[i + 4] !== '\"') {\n str += '\\n';\n i += 2;\n }\n str += indent;\n // space after newline needs to be escaped to not be folded\n if (json[i + 2] === ' ')\n str += '\\\\';\n i += 1;\n start = i + 1;\n }\n break;\n default:\n i += 1;\n }\n }\n str = start ? str + json.slice(start) : json;\n return implicitKey\n ? str\n : foldFlowLines(str, indent, FOLD_QUOTED, getFoldOptions(ctx, false));\n}\nfunction singleQuotedString(value, ctx) {\n if (ctx.options.singleQuote === false ||\n (ctx.implicitKey && value.includes('\\n')) ||\n /[ \\t]\\n|\\n[ \\t]/.test(value) // single quoted string can't have leading or trailing whitespace around newline\n )\n return doubleQuotedString(value, ctx);\n const indent = ctx.indent || (containsDocumentMarker(value) ? ' ' : '');\n const res = \"'\" + value.replace(/'/g, \"''\").replace(/\\n+/g, `$&\\n${indent}`) + \"'\";\n return ctx.implicitKey\n ? res\n : foldFlowLines(res, indent, FOLD_FLOW, getFoldOptions(ctx, false));\n}\nfunction quotedString(value, ctx) {\n const { singleQuote } = ctx.options;\n let qs;\n if (singleQuote === false)\n qs = doubleQuotedString;\n else {\n const hasDouble = value.includes('\"');\n const hasSingle = value.includes(\"'\");\n if (hasDouble && !hasSingle)\n qs = singleQuotedString;\n else if (hasSingle && !hasDouble)\n qs = doubleQuotedString;\n else\n qs = singleQuote ? singleQuotedString : doubleQuotedString;\n }\n return qs(value, ctx);\n}\n// The negative lookbehind avoids a polynomial search,\n// but isn't supported yet on Safari: https://caniuse.com/js-regexp-lookbehind\nlet blockEndNewlines;\ntry {\n blockEndNewlines = new RegExp('(^|(?<!\\n))\\n+(?!\\n|$)', 'g');\n}\ncatch {\n blockEndNewlines = /\\n+(?!\\n|$)/g;\n}\nfunction blockString({ comment, type, value }, ctx, onComment, onChompKeep) {\n const { blockQuote, commentString, lineWidth } = ctx.options;\n // 1. Block can't end in whitespace unless the last line is non-empty.\n // 2. Strings consisting of only whitespace are best rendered explicitly.\n if (!blockQuote || /\\n[\\t ]+$/.test(value)) {\n return quotedString(value, ctx);\n }\n const indent = ctx.indent ||\n (ctx.forceBlockIndent || containsDocumentMarker(value) ? ' ' : '');\n const literal = blockQuote === 'literal'\n ? true\n : blockQuote === 'folded' || type === Scalar.BLOCK_FOLDED\n ? false\n : type === Scalar.BLOCK_LITERAL\n ? true\n : !lineLengthOverLimit(value, lineWidth, indent.length);\n if (!value)\n return literal ? '|\\n' : '>\\n';\n // determine chomping from whitespace at value end\n let chomp;\n let endStart;\n for (endStart = value.length; endStart > 0; --endStart) {\n const ch = value[endStart - 1];\n if (ch !== '\\n' && ch !== '\\t' && ch !== ' ')\n break;\n }\n let end = value.substring(endStart);\n const endNlPos = end.indexOf('\\n');\n if (endNlPos === -1) {\n chomp = '-'; // strip\n }\n else if (value === end || endNlPos !== end.length - 1) {\n chomp = '+'; // keep\n if (onChompKeep)\n onChompKeep();\n }\n else {\n chomp = ''; // clip\n }\n if (end) {\n value = value.slice(0, -end.length);\n if (end[end.length - 1] === '\\n')\n end = end.slice(0, -1);\n end = end.replace(blockEndNewlines, `$&${indent}`);\n }\n // determine indent indicator from whitespace at value start\n let startWithSpace = false;\n let startEnd;\n let startNlPos = -1;\n for (startEnd = 0; startEnd < value.length; ++startEnd) {\n const ch = value[startEnd];\n if (ch === ' ')\n startWithSpace = true;\n else if (ch === '\\n')\n startNlPos = startEnd;\n else\n break;\n }\n let start = value.substring(0, startNlPos < startEnd ? startNlPos + 1 : startEnd);\n if (start) {\n value = value.substring(start.length);\n start = start.replace(/\\n+/g, `$&${indent}`);\n }\n const indentSize = indent ? '2' : '1'; // root is at -1\n // Leading | or > is added later\n let header = (startWithSpace ? indentSize : '') + chomp;\n if (comment) {\n header += ' ' + commentString(comment.replace(/ ?[\\r\\n]+/g, ' '));\n if (onComment)\n onComment();\n }\n if (!literal) {\n const foldedValue = value\n .replace(/\\n+/g, '\\n$&')\n .replace(/(?:^|\\n)([\\t ].*)(?:([\\n\\t ]*)\\n(?![\\n\\t ]))?/g, '$1$2') // more-indented lines aren't folded\n // ^ more-ind. ^ empty ^ capture next empty lines only at end of indent\n .replace(/\\n+/g, `$&${indent}`);\n let literalFallback = false;\n const foldOptions = getFoldOptions(ctx, true);\n if (blockQuote !== 'folded' && type !== Scalar.BLOCK_FOLDED) {\n foldOptions.onOverflow = () => {\n literalFallback = true;\n };\n }\n const body = foldFlowLines(`${start}${foldedValue}${end}`, indent, FOLD_BLOCK, foldOptions);\n if (!literalFallback)\n return `>${header}\\n${indent}${body}`;\n }\n value = value.replace(/\\n+/g, `$&${indent}`);\n return `|${header}\\n${indent}${start}${value}${end}`;\n}\nfunction plainString(item, ctx, onComment, onChompKeep) {\n const { type, value } = item;\n const { actualString, implicitKey, indent, indentStep, inFlow } = ctx;\n if ((implicitKey && value.includes('\\n')) ||\n (inFlow && /[[\\]{},]/.test(value))) {\n return quotedString(value, ctx);\n }\n if (/^[\\n\\t ,[\\]{}#&*!|>'\"%@`]|^[?-]$|^[?-][ \\t]|[\\n:][ \\t]|[ \\t]\\n|[\\n\\t ]#|[\\n\\t :]$/.test(value)) {\n // not allowed:\n // - '-' or '?'\n // - start with an indicator character (except [?:-]) or /[?-] /\n // - '\\n ', ': ' or ' \\n' anywhere\n // - '#' not preceded by a non-space char\n // - end with ' ' or ':'\n return implicitKey || inFlow || !value.includes('\\n')\n ? quotedString(value, ctx)\n : blockString(item, ctx, onComment, onChompKeep);\n }\n if (!implicitKey &&\n !inFlow &&\n type !== Scalar.PLAIN &&\n value.includes('\\n')) {\n // Where allowed & type not set explicitly, prefer block style for multiline strings\n return blockString(item, ctx, onComment, onChompKeep);\n }\n if (containsDocumentMarker(value)) {\n if (indent === '') {\n ctx.forceBlockIndent = true;\n return blockString(item, ctx, onComment, onChompKeep);\n }\n else if (implicitKey && indent === indentStep) {\n return quotedString(value, ctx);\n }\n }\n const str = value.replace(/\\n+/g, `$&\\n${indent}`);\n // Verify that output will be parsed as a string, as e.g. plain numbers and\n // booleans get parsed with those types in v1.2 (e.g. '42', 'true' & '0.9e-3'),\n // and others in v1.1.\n if (actualString) {\n const test = (tag) => tag.default && tag.tag !== 'tag:yaml.org,2002:str' && tag.test?.test(str);\n const { compat, tags } = ctx.doc.schema;\n if (tags.some(test) || compat?.some(test))\n return quotedString(value, ctx);\n }\n return implicitKey\n ? str\n : foldFlowLines(str, indent, FOLD_FLOW, getFoldOptions(ctx, false));\n}\nfunction stringifyString(item, ctx, onComment, onChompKeep) {\n const { implicitKey, inFlow } = ctx;\n const ss = typeof item.value === 'string'\n ? item\n : Object.assign({}, item, { value: String(item.value) });\n let { type } = item;\n if (type !== Scalar.QUOTE_DOUBLE) {\n // force double quotes on control characters & unpaired surrogates\n if (/[\\x00-\\x08\\x0b-\\x1f\\x7f-\\x9f\\u{D800}-\\u{DFFF}]/u.test(ss.value))\n type = Scalar.QUOTE_DOUBLE;\n }\n const _stringify = (_type) => {\n switch (_type) {\n case Scalar.BLOCK_FOLDED:\n case Scalar.BLOCK_LITERAL:\n return implicitKey || inFlow\n ? quotedString(ss.value, ctx) // blocks are not valid inside flow containers\n : blockString(ss, ctx, onComment, onChompKeep);\n case Scalar.QUOTE_DOUBLE:\n return doubleQuotedString(ss.value, ctx);\n case Scalar.QUOTE_SINGLE:\n return singleQuotedString(ss.value, ctx);\n case Scalar.PLAIN:\n return plainString(ss, ctx, onComment, onChompKeep);\n default:\n return null;\n }\n };\n let res = _stringify(type);\n if (res === null) {\n const { defaultKeyType, defaultStringType } = ctx.options;\n const t = (implicitKey && defaultKeyType) || defaultStringType;\n res = _stringify(t);\n if (res === null)\n throw new Error(`Unsupported default string type ${t}`);\n }\n return res;\n}\n\nexport { stringifyString };\n","import { anchorIsValid } from '../doc/anchors.js';\nimport { isPair, isAlias, isNode, isScalar, isCollection } from '../nodes/identity.js';\nimport { stringifyComment } from './stringifyComment.js';\nimport { stringifyString } from './stringifyString.js';\n\nfunction createStringifyContext(doc, options) {\n const opt = Object.assign({\n blockQuote: true,\n commentString: stringifyComment,\n defaultKeyType: null,\n defaultStringType: 'PLAIN',\n directives: null,\n doubleQuotedAsJSON: false,\n doubleQuotedMinMultiLineLength: 40,\n falseStr: 'false',\n flowCollectionPadding: true,\n indentSeq: true,\n lineWidth: 80,\n minContentWidth: 20,\n nullStr: 'null',\n simpleKeys: false,\n singleQuote: null,\n trueStr: 'true',\n verifyAliasOrder: true\n }, doc.schema.toStringOptions, options);\n let inFlow;\n switch (opt.collectionStyle) {\n case 'block':\n inFlow = false;\n break;\n case 'flow':\n inFlow = true;\n break;\n default:\n inFlow = null;\n }\n return {\n anchors: new Set(),\n doc,\n flowCollectionPadding: opt.flowCollectionPadding ? ' ' : '',\n indent: '',\n indentStep: typeof opt.indent === 'number' ? ' '.repeat(opt.indent) : ' ',\n inFlow,\n options: opt\n };\n}\nfunction getTagObject(tags, item) {\n if (item.tag) {\n const match = tags.filter(t => t.tag === item.tag);\n if (match.length > 0)\n return match.find(t => t.format === item.format) ?? match[0];\n }\n let tagObj = undefined;\n let obj;\n if (isScalar(item)) {\n obj = item.value;\n let match = tags.filter(t => t.identify?.(obj));\n if (match.length > 1) {\n const testMatch = match.filter(t => t.test);\n if (testMatch.length > 0)\n match = testMatch;\n }\n tagObj =\n match.find(t => t.format === item.format) ?? match.find(t => !t.format);\n }\n else {\n obj = item;\n tagObj = tags.find(t => t.nodeClass && obj instanceof t.nodeClass);\n }\n if (!tagObj) {\n const name = obj?.constructor?.name ?? (obj === null ? 'null' : typeof obj);\n throw new Error(`Tag not resolved for ${name} value`);\n }\n return tagObj;\n}\n// needs to be called before value stringifier to allow for circular anchor refs\nfunction stringifyProps(node, tagObj, { anchors, doc }) {\n if (!doc.directives)\n return '';\n const props = [];\n const anchor = (isScalar(node) || isCollection(node)) && node.anchor;\n if (anchor && anchorIsValid(anchor)) {\n anchors.add(anchor);\n props.push(`&${anchor}`);\n }\n const tag = node.tag ?? (tagObj.default ? null : tagObj.tag);\n if (tag)\n props.push(doc.directives.tagString(tag));\n return props.join(' ');\n}\nfunction stringify(item, ctx, onComment, onChompKeep) {\n if (isPair(item))\n return item.toString(ctx, onComment, onChompKeep);\n if (isAlias(item)) {\n if (ctx.doc.directives)\n return item.toString(ctx);\n if (ctx.resolvedAliases?.has(item)) {\n throw new TypeError(`Cannot stringify circular structure without alias nodes`);\n }\n else {\n if (ctx.resolvedAliases)\n ctx.resolvedAliases.add(item);\n else\n ctx.resolvedAliases = new Set([item]);\n item = item.resolve(ctx.doc);\n }\n }\n let tagObj = undefined;\n const node = isNode(item)\n ? item\n : ctx.doc.createNode(item, { onTagObj: o => (tagObj = o) });\n tagObj ?? (tagObj = getTagObject(ctx.doc.schema.tags, node));\n const props = stringifyProps(node, tagObj, ctx);\n if (props.length > 0)\n ctx.indentAtStart = (ctx.indentAtStart ?? 0) + props.length + 1;\n const str = typeof tagObj.stringify === 'function'\n ? tagObj.stringify(node, ctx, onComment, onChompKeep)\n : isScalar(node)\n ? stringifyString(node, ctx, onComment, onChompKeep)\n : node.toString(ctx, onComment, onChompKeep);\n if (!props)\n return str;\n return isScalar(node) || str[0] === '{' || str[0] === '['\n ? `${props} ${str}`\n : `${props}\\n${ctx.indent}${str}`;\n}\n\nexport { createStringifyContext, stringify };\n","import { isCollection, isNode, isScalar, isSeq } from '../nodes/identity.js';\nimport { Scalar } from '../nodes/Scalar.js';\nimport { stringify } from './stringify.js';\nimport { lineComment, indentComment } from './stringifyComment.js';\n\nfunction stringifyPair({ key, value }, ctx, onComment, onChompKeep) {\n const { allNullValues, doc, indent, indentStep, options: { commentString, indentSeq, simpleKeys } } = ctx;\n let keyComment = (isNode(key) && key.comment) || null;\n if (simpleKeys) {\n if (keyComment) {\n throw new Error('With simple keys, key nodes cannot have comments');\n }\n if (isCollection(key) || (!isNode(key) && typeof key === 'object')) {\n const msg = 'With simple keys, collection cannot be used as a key value';\n throw new Error(msg);\n }\n }\n let explicitKey = !simpleKeys &&\n (!key ||\n (keyComment && value == null && !ctx.inFlow) ||\n isCollection(key) ||\n (isScalar(key)\n ? key.type === Scalar.BLOCK_FOLDED || key.type === Scalar.BLOCK_LITERAL\n : typeof key === 'object'));\n ctx = Object.assign({}, ctx, {\n allNullValues: false,\n implicitKey: !explicitKey && (simpleKeys || !allNullValues),\n indent: indent + indentStep\n });\n let keyCommentDone = false;\n let chompKeep = false;\n let str = stringify(key, ctx, () => (keyCommentDone = true), () => (chompKeep = true));\n if (!explicitKey && !ctx.inFlow && str.length > 1024) {\n if (simpleKeys)\n throw new Error('With simple keys, single line scalar must not span more than 1024 characters');\n explicitKey = true;\n }\n if (ctx.inFlow) {\n if (allNullValues || value == null) {\n if (keyCommentDone && onComment)\n onComment();\n return str === '' ? '?' : explicitKey ? `? ${str}` : str;\n }\n }\n else if ((allNullValues && !simpleKeys) || (value == null && explicitKey)) {\n str = `? ${str}`;\n if (keyComment && !keyCommentDone) {\n str += lineComment(str, ctx.indent, commentString(keyComment));\n }\n else if (chompKeep && onChompKeep)\n onChompKeep();\n return str;\n }\n if (keyCommentDone)\n keyComment = null;\n if (explicitKey) {\n if (keyComment)\n str += lineComment(str, ctx.indent, commentString(keyComment));\n str = `? ${str}\\n${indent}:`;\n }\n else {\n str = `${str}:`;\n if (keyComment)\n str += lineComment(str, ctx.indent, commentString(keyComment));\n }\n let vsb, vcb, valueComment;\n if (isNode(value)) {\n vsb = !!value.spaceBefore;\n vcb = value.commentBefore;\n valueComment = value.comment;\n }\n else {\n vsb = false;\n vcb = null;\n valueComment = null;\n if (value && typeof value === 'object')\n value = doc.createNode(value);\n }\n ctx.implicitKey = false;\n if (!explicitKey && !keyComment && isScalar(value))\n ctx.indentAtStart = str.length + 1;\n chompKeep = false;\n if (!indentSeq &&\n indentStep.length >= 2 &&\n !ctx.inFlow &&\n !explicitKey &&\n isSeq(value) &&\n !value.flow &&\n !value.tag &&\n !value.anchor) {\n // If indentSeq === false, consider '- ' as part of indentation where possible\n ctx.indent = ctx.indent.substring(2);\n }\n let valueCommentDone = false;\n const valueStr = stringify(value, ctx, () => (valueCommentDone = true), () => (chompKeep = true));\n let ws = ' ';\n if (keyComment || vsb || vcb) {\n ws = vsb ? '\\n' : '';\n if (vcb) {\n const cs = commentString(vcb);\n ws += `\\n${indentComment(cs, ctx.indent)}`;\n }\n if (valueStr === '' && !ctx.inFlow) {\n if (ws === '\\n')\n ws = '\\n\\n';\n }\n else {\n ws += `\\n${ctx.indent}`;\n }\n }\n else if (!explicitKey && isCollection(value)) {\n const vs0 = valueStr[0];\n const nl0 = valueStr.indexOf('\\n');\n const hasNewline = nl0 !== -1;\n const flow = ctx.inFlow ?? value.flow ?? value.items.length === 0;\n if (hasNewline || !flow) {\n let hasPropsLine = false;\n if (hasNewline && (vs0 === '&' || vs0 === '!')) {\n let sp0 = valueStr.indexOf(' ');\n if (vs0 === '&' &&\n sp0 !== -1 &&\n sp0 < nl0 &&\n valueStr[sp0 + 1] === '!') {\n sp0 = valueStr.indexOf(' ', sp0 + 1);\n }\n if (sp0 === -1 || nl0 < sp0)\n hasPropsLine = true;\n }\n if (!hasPropsLine)\n ws = `\\n${ctx.indent}`;\n }\n }\n else if (valueStr === '' || valueStr[0] === '\\n') {\n ws = '';\n }\n str += ws + valueStr;\n if (ctx.inFlow) {\n if (valueCommentDone && onComment)\n onComment();\n }\n else if (valueComment && !valueCommentDone) {\n str += lineComment(str, ctx.indent, commentString(valueComment));\n }\n else if (chompKeep && onChompKeep) {\n onChompKeep();\n }\n return str;\n}\n\nexport { stringifyPair };\n","import { isScalar, isAlias, isSeq, isMap } from '../../nodes/identity.js';\nimport { Scalar } from '../../nodes/Scalar.js';\n\n// If the value associated with a merge key is a single mapping node, each of\n// its key/value pairs is inserted into the current mapping, unless the key\n// already exists in it. If the value associated with the merge key is a\n// sequence, then this sequence is expected to contain mapping nodes and each\n// of these nodes is merged in turn according to its order in the sequence.\n// Keys in mapping nodes earlier in the sequence override keys specified in\n// later mapping nodes. -- http://yaml.org/type/merge.html\nconst MERGE_KEY = '<<';\nconst merge = {\n identify: value => value === MERGE_KEY ||\n (typeof value === 'symbol' && value.description === MERGE_KEY),\n default: 'key',\n tag: 'tag:yaml.org,2002:merge',\n test: /^<<$/,\n resolve: () => Object.assign(new Scalar(Symbol(MERGE_KEY)), {\n addToJSMap: addMergeToJSMap\n }),\n stringify: () => MERGE_KEY\n};\nconst isMergeKey = (ctx, key) => (merge.identify(key) ||\n (isScalar(key) &&\n (!key.type || key.type === Scalar.PLAIN) &&\n merge.identify(key.value))) &&\n ctx?.doc.schema.tags.some(tag => tag.tag === merge.tag && tag.default);\nfunction addMergeToJSMap(ctx, map, value) {\n value = ctx && isAlias(value) ? value.resolve(ctx.doc) : value;\n if (isSeq(value))\n for (const it of value.items)\n mergeValue(ctx, map, it);\n else if (Array.isArray(value))\n for (const it of value)\n mergeValue(ctx, map, it);\n else\n mergeValue(ctx, map, value);\n}\nfunction mergeValue(ctx, map, value) {\n const source = ctx && isAlias(value) ? value.resolve(ctx.doc) : value;\n if (!isMap(source))\n throw new Error('Merge sources must be maps or map aliases');\n const srcMap = source.toJSON(null, ctx, Map);\n for (const [key, value] of srcMap) {\n if (map instanceof Map) {\n if (!map.has(key))\n map.set(key, value);\n }\n else if (map instanceof Set) {\n map.add(key);\n }\n else if (!Object.prototype.hasOwnProperty.call(map, key)) {\n Object.defineProperty(map, key, {\n value,\n writable: true,\n enumerable: true,\n configurable: true\n });\n }\n }\n return map;\n}\n\nexport { addMergeToJSMap, isMergeKey, merge };\n","import { warn } from '../log.js';\nimport { isMergeKey, addMergeToJSMap } from '../schema/yaml-1.1/merge.js';\nimport { createStringifyContext } from '../stringify/stringify.js';\nimport { isNode } from './identity.js';\nimport { toJS } from './toJS.js';\n\nfunction addPairToJSMap(ctx, map, { key, value }) {\n if (isNode(key) && key.addToJSMap)\n key.addToJSMap(ctx, map, value);\n // TODO: Should drop this special case for bare << handling\n else if (isMergeKey(ctx, key))\n addMergeToJSMap(ctx, map, value);\n else {\n const jsKey = toJS(key, '', ctx);\n if (map instanceof Map) {\n map.set(jsKey, toJS(value, jsKey, ctx));\n }\n else if (map instanceof Set) {\n map.add(jsKey);\n }\n else {\n const stringKey = stringifyKey(key, jsKey, ctx);\n const jsValue = toJS(value, stringKey, ctx);\n if (stringKey in map)\n Object.defineProperty(map, stringKey, {\n value: jsValue,\n writable: true,\n enumerable: true,\n configurable: true\n });\n else\n map[stringKey] = jsValue;\n }\n }\n return map;\n}\nfunction stringifyKey(key, jsKey, ctx) {\n if (jsKey === null)\n return '';\n // eslint-disable-next-line @typescript-eslint/no-base-to-string\n if (typeof jsKey !== 'object')\n return String(jsKey);\n if (isNode(key) && ctx?.doc) {\n const strCtx = createStringifyContext(ctx.doc, {});\n strCtx.anchors = new Set();\n for (const node of ctx.anchors.keys())\n strCtx.anchors.add(node.anchor);\n strCtx.inFlow = true;\n strCtx.inStringifyKey = true;\n const strKey = key.toString(strCtx);\n if (!ctx.mapKeyWarned) {\n let jsonStr = JSON.stringify(strKey);\n if (jsonStr.length > 40)\n jsonStr = jsonStr.substring(0, 36) + '...\"';\n warn(ctx.doc.options.logLevel, `Keys with collection values will be stringified due to JS Object restrictions: ${jsonStr}. Set mapAsMap: true to use object keys.`);\n ctx.mapKeyWarned = true;\n }\n return strKey;\n }\n return JSON.stringify(jsKey);\n}\n\nexport { addPairToJSMap };\n","import { createNode } from '../doc/createNode.js';\nimport { stringifyPair } from '../stringify/stringifyPair.js';\nimport { addPairToJSMap } from './addPairToJSMap.js';\nimport { NODE_TYPE, PAIR, isNode } from './identity.js';\n\nfunction createPair(key, value, ctx) {\n const k = createNode(key, undefined, ctx);\n const v = createNode(value, undefined, ctx);\n return new Pair(k, v);\n}\nclass Pair {\n constructor(key, value = null) {\n Object.defineProperty(this, NODE_TYPE, { value: PAIR });\n this.key = key;\n this.value = value;\n }\n clone(schema) {\n let { key, value } = this;\n if (isNode(key))\n key = key.clone(schema);\n if (isNode(value))\n value = value.clone(schema);\n return new Pair(key, value);\n }\n toJSON(_, ctx) {\n const pair = ctx?.mapAsMap ? new Map() : {};\n return addPairToJSMap(ctx, pair, this);\n }\n toString(ctx, onComment, onChompKeep) {\n return ctx?.doc\n ? stringifyPair(this, ctx, onComment, onChompKeep)\n : JSON.stringify(this);\n }\n}\n\nexport { Pair, createPair };\n","import { isNode, isPair } from '../nodes/identity.js';\nimport { stringify } from './stringify.js';\nimport { lineComment, indentComment } from './stringifyComment.js';\n\nfunction stringifyCollection(collection, ctx, options) {\n const flow = ctx.inFlow ?? collection.flow;\n const stringify = flow ? stringifyFlowCollection : stringifyBlockCollection;\n return stringify(collection, ctx, options);\n}\nfunction stringifyBlockCollection({ comment, items }, ctx, { blockItemPrefix, flowChars, itemIndent, onChompKeep, onComment }) {\n const { indent, options: { commentString } } = ctx;\n const itemCtx = Object.assign({}, ctx, { indent: itemIndent, type: null });\n let chompKeep = false; // flag for the preceding node's status\n const lines = [];\n for (let i = 0; i < items.length; ++i) {\n const item = items[i];\n let comment = null;\n if (isNode(item)) {\n if (!chompKeep && item.spaceBefore)\n lines.push('');\n addCommentBefore(ctx, lines, item.commentBefore, chompKeep);\n if (item.comment)\n comment = item.comment;\n }\n else if (isPair(item)) {\n const ik = isNode(item.key) ? item.key : null;\n if (ik) {\n if (!chompKeep && ik.spaceBefore)\n lines.push('');\n addCommentBefore(ctx, lines, ik.commentBefore, chompKeep);\n }\n }\n chompKeep = false;\n let str = stringify(item, itemCtx, () => (comment = null), () => (chompKeep = true));\n if (comment)\n str += lineComment(str, itemIndent, commentString(comment));\n if (chompKeep && comment)\n chompKeep = false;\n lines.push(blockItemPrefix + str);\n }\n let str;\n if (lines.length === 0) {\n str = flowChars.start + flowChars.end;\n }\n else {\n str = lines[0];\n for (let i = 1; i < lines.length; ++i) {\n const line = lines[i];\n str += line ? `\\n${indent}${line}` : '\\n';\n }\n }\n if (comment) {\n str += '\\n' + indentComment(commentString(comment), indent);\n if (onComment)\n onComment();\n }\n else if (chompKeep && onChompKeep)\n onChompKeep();\n return str;\n}\nfunction stringifyFlowCollection({ items }, ctx, { flowChars, itemIndent }) {\n const { indent, indentStep, flowCollectionPadding: fcPadding, options: { commentString } } = ctx;\n itemIndent += indentStep;\n const itemCtx = Object.assign({}, ctx, {\n indent: itemIndent,\n inFlow: true,\n type: null\n });\n let reqNewline = false;\n let linesAtValue = 0;\n const lines = [];\n for (let i = 0; i < items.length; ++i) {\n const item = items[i];\n let comment = null;\n if (isNode(item)) {\n if (item.spaceBefore)\n lines.push('');\n addCommentBefore(ctx, lines, item.commentBefore, false);\n if (item.comment)\n comment = item.comment;\n }\n else if (isPair(item)) {\n const ik = isNode(item.key) ? item.key : null;\n if (ik) {\n if (ik.spaceBefore)\n lines.push('');\n addCommentBefore(ctx, lines, ik.commentBefore, false);\n if (ik.comment)\n reqNewline = true;\n }\n const iv = isNode(item.value) ? item.value : null;\n if (iv) {\n if (iv.comment)\n comment = iv.comment;\n if (iv.commentBefore)\n reqNewline = true;\n }\n else if (item.value == null && ik?.comment) {\n comment = ik.comment;\n }\n }\n if (comment)\n reqNewline = true;\n let str = stringify(item, itemCtx, () => (comment = null));\n if (i < items.length - 1)\n str += ',';\n if (comment)\n str += lineComment(str, itemIndent, commentString(comment));\n if (!reqNewline && (lines.length > linesAtValue || str.includes('\\n')))\n reqNewline = true;\n lines.push(str);\n linesAtValue = lines.length;\n }\n const { start, end } = flowChars;\n if (lines.length === 0) {\n return start + end;\n }\n else {\n if (!reqNewline) {\n const len = lines.reduce((sum, line) => sum + line.length + 2, 2);\n reqNewline = ctx.options.lineWidth > 0 && len > ctx.options.lineWidth;\n }\n if (reqNewline) {\n let str = start;\n for (const line of lines)\n str += line ? `\\n${indentStep}${indent}${line}` : '\\n';\n return `${str}\\n${indent}${end}`;\n }\n else {\n return `${start}${fcPadding}${lines.join(' ')}${fcPadding}${end}`;\n }\n }\n}\nfunction addCommentBefore({ indent, options: { commentString } }, lines, comment, chompKeep) {\n if (comment && chompKeep)\n comment = comment.replace(/^\\n+/, '');\n if (comment) {\n const ic = indentComment(commentString(comment), indent);\n lines.push(ic.trimStart()); // Avoid double indent on first line\n }\n}\n\nexport { stringifyCollection };\n","import { stringifyCollection } from '../stringify/stringifyCollection.js';\nimport { addPairToJSMap } from './addPairToJSMap.js';\nimport { Collection } from './Collection.js';\nimport { MAP, isPair, isScalar } from './identity.js';\nimport { Pair, createPair } from './Pair.js';\nimport { isScalarValue } from './Scalar.js';\n\nfunction findPair(items, key) {\n const k = isScalar(key) ? key.value : key;\n for (const it of items) {\n if (isPair(it)) {\n if (it.key === key || it.key === k)\n return it;\n if (isScalar(it.key) && it.key.value === k)\n return it;\n }\n }\n return undefined;\n}\nclass YAMLMap extends Collection {\n static get tagName() {\n return 'tag:yaml.org,2002:map';\n }\n constructor(schema) {\n super(MAP, schema);\n this.items = [];\n }\n /**\n * A generic collection parsing method that can be extended\n * to other node classes that inherit from YAMLMap\n */\n static from(schema, obj, ctx) {\n const { keepUndefined, replacer } = ctx;\n const map = new this(schema);\n const add = (key, value) => {\n if (typeof replacer === 'function')\n value = replacer.call(obj, key, value);\n else if (Array.isArray(replacer) && !replacer.includes(key))\n return;\n if (value !== undefined || keepUndefined)\n map.items.push(createPair(key, value, ctx));\n };\n if (obj instanceof Map) {\n for (const [key, value] of obj)\n add(key, value);\n }\n else if (obj && typeof obj === 'object') {\n for (const key of Object.keys(obj))\n add(key, obj[key]);\n }\n if (typeof schema.sortMapEntries === 'function') {\n map.items.sort(schema.sortMapEntries);\n }\n return map;\n }\n /**\n * Adds a value to the collection.\n *\n * @param overwrite - If not set `true`, using a key that is already in the\n * collection will throw. Otherwise, overwrites the previous value.\n */\n add(pair, overwrite) {\n let _pair;\n if (isPair(pair))\n _pair = pair;\n else if (!pair || typeof pair !== 'object' || !('key' in pair)) {\n // In TypeScript, this never happens.\n _pair = new Pair(pair, pair?.value);\n }\n else\n _pair = new Pair(pair.key, pair.value);\n const prev = findPair(this.items, _pair.key);\n const sortEntries = this.schema?.sortMapEntries;\n if (prev) {\n if (!overwrite)\n throw new Error(`Key ${_pair.key} already set`);\n // For scalars, keep the old node & its comments and anchors\n if (isScalar(prev.value) && isScalarValue(_pair.value))\n prev.value.value = _pair.value;\n else\n prev.value = _pair.value;\n }\n else if (sortEntries) {\n const i = this.items.findIndex(item => sortEntries(_pair, item) < 0);\n if (i === -1)\n this.items.push(_pair);\n else\n this.items.splice(i, 0, _pair);\n }\n else {\n this.items.push(_pair);\n }\n }\n delete(key) {\n const it = findPair(this.items, key);\n if (!it)\n return false;\n const del = this.items.splice(this.items.indexOf(it), 1);\n return del.length > 0;\n }\n get(key, keepScalar) {\n const it = findPair(this.items, key);\n const node = it?.value;\n return (!keepScalar && isScalar(node) ? node.value : node) ?? undefined;\n }\n has(key) {\n return !!findPair(this.items, key);\n }\n set(key, value) {\n this.add(new Pair(key, value), true);\n }\n /**\n * @param ctx - Conversion context, originally set in Document#toJS()\n * @param {Class} Type - If set, forces the returned collection type\n * @returns Instance of Type, Map, or Object\n */\n toJSON(_, ctx, Type) {\n const map = Type ? new Type() : ctx?.mapAsMap ? new Map() : {};\n if (ctx?.onCreate)\n ctx.onCreate(map);\n for (const item of this.items)\n addPairToJSMap(ctx, map, item);\n return map;\n }\n toString(ctx, onComment, onChompKeep) {\n if (!ctx)\n return JSON.stringify(this);\n for (const item of this.items) {\n if (!isPair(item))\n throw new Error(`Map items must all be pairs; found ${JSON.stringify(item)} instead`);\n }\n if (!ctx.allNullValues && this.hasAllNullValues(false))\n ctx = Object.assign({}, ctx, { allNullValues: true });\n return stringifyCollection(this, ctx, {\n blockItemPrefix: '',\n flowChars: { start: '{', end: '}' },\n itemIndent: ctx.indent || '',\n onChompKeep,\n onComment\n });\n }\n}\n\nexport { YAMLMap, findPair };\n","import { isMap } from '../../nodes/identity.js';\nimport { YAMLMap } from '../../nodes/YAMLMap.js';\n\nconst map = {\n collection: 'map',\n default: true,\n nodeClass: YAMLMap,\n tag: 'tag:yaml.org,2002:map',\n resolve(map, onError) {\n if (!isMap(map))\n onError('Expected a mapping for this tag');\n return map;\n },\n createNode: (schema, obj, ctx) => YAMLMap.from(schema, obj, ctx)\n};\n\nexport { map };\n","import { createNode } from '../doc/createNode.js';\nimport { stringifyCollection } from '../stringify/stringifyCollection.js';\nimport { Collection } from './Collection.js';\nimport { SEQ, isScalar } from './identity.js';\nimport { isScalarValue } from './Scalar.js';\nimport { toJS } from './toJS.js';\n\nclass YAMLSeq extends Collection {\n static get tagName() {\n return 'tag:yaml.org,2002:seq';\n }\n constructor(schema) {\n super(SEQ, schema);\n this.items = [];\n }\n add(value) {\n this.items.push(value);\n }\n /**\n * Removes a value from the collection.\n *\n * `key` must contain a representation of an integer for this to succeed.\n * It may be wrapped in a `Scalar`.\n *\n * @returns `true` if the item was found and removed.\n */\n delete(key) {\n const idx = asItemIndex(key);\n if (typeof idx !== 'number')\n return false;\n const del = this.items.splice(idx, 1);\n return del.length > 0;\n }\n get(key, keepScalar) {\n const idx = asItemIndex(key);\n if (typeof idx !== 'number')\n return undefined;\n const it = this.items[idx];\n return !keepScalar && isScalar(it) ? it.value : it;\n }\n /**\n * Checks if the collection includes a value with the key `key`.\n *\n * `key` must contain a representation of an integer for this to succeed.\n * It may be wrapped in a `Scalar`.\n */\n has(key) {\n const idx = asItemIndex(key);\n return typeof idx === 'number' && idx < this.items.length;\n }\n /**\n * Sets a value in this collection. For `!!set`, `value` needs to be a\n * boolean to add/remove the item from the set.\n *\n * If `key` does not contain a representation of an integer, this will throw.\n * It may be wrapped in a `Scalar`.\n */\n set(key, value) {\n const idx = asItemIndex(key);\n if (typeof idx !== 'number')\n throw new Error(`Expected a valid index, not ${key}.`);\n const prev = this.items[idx];\n if (isScalar(prev) && isScalarValue(value))\n prev.value = value;\n else\n this.items[idx] = value;\n }\n toJSON(_, ctx) {\n const seq = [];\n if (ctx?.onCreate)\n ctx.onCreate(seq);\n let i = 0;\n for (const item of this.items)\n seq.push(toJS(item, String(i++), ctx));\n return seq;\n }\n toString(ctx, onComment, onChompKeep) {\n if (!ctx)\n return JSON.stringify(this);\n return stringifyCollection(this, ctx, {\n blockItemPrefix: '- ',\n flowChars: { start: '[', end: ']' },\n itemIndent: (ctx.indent || '') + ' ',\n onChompKeep,\n onComment\n });\n }\n static from(schema, obj, ctx) {\n const { replacer } = ctx;\n const seq = new this(schema);\n if (obj && Symbol.iterator in Object(obj)) {\n let i = 0;\n for (let it of obj) {\n if (typeof replacer === 'function') {\n const key = obj instanceof Set ? it : String(i++);\n it = replacer.call(obj, key, it);\n }\n seq.items.push(createNode(it, undefined, ctx));\n }\n }\n return seq;\n }\n}\nfunction asItemIndex(key) {\n let idx = isScalar(key) ? key.value : key;\n if (idx && typeof idx === 'string')\n idx = Number(idx);\n return typeof idx === 'number' && Number.isInteger(idx) && idx >= 0\n ? idx\n : null;\n}\n\nexport { YAMLSeq };\n","import { isSeq } from '../../nodes/identity.js';\nimport { YAMLSeq } from '../../nodes/YAMLSeq.js';\n\nconst seq = {\n collection: 'seq',\n default: true,\n nodeClass: YAMLSeq,\n tag: 'tag:yaml.org,2002:seq',\n resolve(seq, onError) {\n if (!isSeq(seq))\n onError('Expected a sequence for this tag');\n return seq;\n },\n createNode: (schema, obj, ctx) => YAMLSeq.from(schema, obj, ctx)\n};\n\nexport { seq };\n","import { stringifyString } from '../../stringify/stringifyString.js';\n\nconst string = {\n identify: value => typeof value === 'string',\n default: true,\n tag: 'tag:yaml.org,2002:str',\n resolve: str => str,\n stringify(item, ctx, onComment, onChompKeep) {\n ctx = Object.assign({ actualString: true }, ctx);\n return stringifyString(item, ctx, onComment, onChompKeep);\n }\n};\n\nexport { string };\n","import { Scalar } from '../../nodes/Scalar.js';\n\nconst nullTag = {\n identify: value => value == null,\n createNode: () => new Scalar(null),\n default: true,\n tag: 'tag:yaml.org,2002:null',\n test: /^(?:~|[Nn]ull|NULL)?$/,\n resolve: () => new Scalar(null),\n stringify: ({ source }, ctx) => typeof source === 'string' && nullTag.test.test(source)\n ? source\n : ctx.options.nullStr\n};\n\nexport { nullTag };\n","import { Scalar } from '../../nodes/Scalar.js';\n\nconst boolTag = {\n identify: value => typeof value === 'boolean',\n default: true,\n tag: 'tag:yaml.org,2002:bool',\n test: /^(?:[Tt]rue|TRUE|[Ff]alse|FALSE)$/,\n resolve: str => new Scalar(str[0] === 't' || str[0] === 'T'),\n stringify({ source, value }, ctx) {\n if (source && boolTag.test.test(source)) {\n const sv = source[0] === 't' || source[0] === 'T';\n if (value === sv)\n return source;\n }\n return value ? ctx.options.trueStr : ctx.options.falseStr;\n }\n};\n\nexport { boolTag };\n","function stringifyNumber({ format, minFractionDigits, tag, value }) {\n if (typeof value === 'bigint')\n return String(value);\n const num = typeof value === 'number' ? value : Number(value);\n if (!isFinite(num))\n return isNaN(num) ? '.nan' : num < 0 ? '-.inf' : '.inf';\n let n = JSON.stringify(value);\n if (!format &&\n minFractionDigits &&\n (!tag || tag === 'tag:yaml.org,2002:float') &&\n /^\\d/.test(n)) {\n let i = n.indexOf('.');\n if (i < 0) {\n i = n.length;\n n += '.';\n }\n let d = minFractionDigits - (n.length - i - 1);\n while (d-- > 0)\n n += '0';\n }\n return n;\n}\n\nexport { stringifyNumber };\n","import { Scalar } from '../../nodes/Scalar.js';\nimport { stringifyNumber } from '../../stringify/stringifyNumber.js';\n\nconst floatNaN = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n test: /^(?:[-+]?\\.(?:inf|Inf|INF)|\\.nan|\\.NaN|\\.NAN)$/,\n resolve: str => str.slice(-3).toLowerCase() === 'nan'\n ? NaN\n : str[0] === '-'\n ? Number.NEGATIVE_INFINITY\n : Number.POSITIVE_INFINITY,\n stringify: stringifyNumber\n};\nconst floatExp = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n format: 'EXP',\n test: /^[-+]?(?:\\.[0-9]+|[0-9]+(?:\\.[0-9]*)?)[eE][-+]?[0-9]+$/,\n resolve: str => parseFloat(str),\n stringify(node) {\n const num = Number(node.value);\n return isFinite(num) ? num.toExponential() : stringifyNumber(node);\n }\n};\nconst float = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n test: /^[-+]?(?:\\.[0-9]+|[0-9]+\\.[0-9]*)$/,\n resolve(str) {\n const node = new Scalar(parseFloat(str));\n const dot = str.indexOf('.');\n if (dot !== -1 && str[str.length - 1] === '0')\n node.minFractionDigits = str.length - dot - 1;\n return node;\n },\n stringify: stringifyNumber\n};\n\nexport { float, floatExp, floatNaN };\n","import { stringifyNumber } from '../../stringify/stringifyNumber.js';\n\nconst intIdentify = (value) => typeof value === 'bigint' || Number.isInteger(value);\nconst intResolve = (str, offset, radix, { intAsBigInt }) => (intAsBigInt ? BigInt(str) : parseInt(str.substring(offset), radix));\nfunction intStringify(node, radix, prefix) {\n const { value } = node;\n if (intIdentify(value) && value >= 0)\n return prefix + value.toString(radix);\n return stringifyNumber(node);\n}\nconst intOct = {\n identify: value => intIdentify(value) && value >= 0,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n format: 'OCT',\n test: /^0o[0-7]+$/,\n resolve: (str, _onError, opt) => intResolve(str, 2, 8, opt),\n stringify: node => intStringify(node, 8, '0o')\n};\nconst int = {\n identify: intIdentify,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n test: /^[-+]?[0-9]+$/,\n resolve: (str, _onError, opt) => intResolve(str, 0, 10, opt),\n stringify: stringifyNumber\n};\nconst intHex = {\n identify: value => intIdentify(value) && value >= 0,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n format: 'HEX',\n test: /^0x[0-9a-fA-F]+$/,\n resolve: (str, _onError, opt) => intResolve(str, 2, 16, opt),\n stringify: node => intStringify(node, 16, '0x')\n};\n\nexport { int, intHex, intOct };\n","import { map } from '../common/map.js';\nimport { nullTag } from '../common/null.js';\nimport { seq } from '../common/seq.js';\nimport { string } from '../common/string.js';\nimport { boolTag } from './bool.js';\nimport { floatNaN, floatExp, float } from './float.js';\nimport { intOct, int, intHex } from './int.js';\n\nconst schema = [\n map,\n seq,\n string,\n nullTag,\n boolTag,\n intOct,\n int,\n intHex,\n floatNaN,\n floatExp,\n float\n];\n\nexport { schema };\n","import { Scalar } from '../../nodes/Scalar.js';\nimport { map } from '../common/map.js';\nimport { seq } from '../common/seq.js';\n\nfunction intIdentify(value) {\n return typeof value === 'bigint' || Number.isInteger(value);\n}\nconst stringifyJSON = ({ value }) => JSON.stringify(value);\nconst jsonScalars = [\n {\n identify: value => typeof value === 'string',\n default: true,\n tag: 'tag:yaml.org,2002:str',\n resolve: str => str,\n stringify: stringifyJSON\n },\n {\n identify: value => value == null,\n createNode: () => new Scalar(null),\n default: true,\n tag: 'tag:yaml.org,2002:null',\n test: /^null$/,\n resolve: () => null,\n stringify: stringifyJSON\n },\n {\n identify: value => typeof value === 'boolean',\n default: true,\n tag: 'tag:yaml.org,2002:bool',\n test: /^true$|^false$/,\n resolve: str => str === 'true',\n stringify: stringifyJSON\n },\n {\n identify: intIdentify,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n test: /^-?(?:0|[1-9][0-9]*)$/,\n resolve: (str, _onError, { intAsBigInt }) => intAsBigInt ? BigInt(str) : parseInt(str, 10),\n stringify: ({ value }) => intIdentify(value) ? value.toString() : JSON.stringify(value)\n },\n {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n test: /^-?(?:0|[1-9][0-9]*)(?:\\.[0-9]*)?(?:[eE][-+]?[0-9]+)?$/,\n resolve: str => parseFloat(str),\n stringify: stringifyJSON\n }\n];\nconst jsonError = {\n default: true,\n tag: '',\n test: /^/,\n resolve(str, onError) {\n onError(`Unresolved plain scalar ${JSON.stringify(str)}`);\n return str;\n }\n};\nconst schema = [map, seq].concat(jsonScalars, jsonError);\n\nexport { schema };\n","import { Scalar } from '../../nodes/Scalar.js';\nimport { stringifyString } from '../../stringify/stringifyString.js';\n\nconst binary = {\n identify: value => value instanceof Uint8Array, // Buffer inherits from Uint8Array\n default: false,\n tag: 'tag:yaml.org,2002:binary',\n /**\n * Returns a Buffer in node and an Uint8Array in browsers\n *\n * To use the resulting buffer as an image, you'll want to do something like:\n *\n * const blob = new Blob([buffer], { type: 'image/jpeg' })\n * document.querySelector('#photo').src = URL.createObjectURL(blob)\n */\n resolve(src, onError) {\n if (typeof atob === 'function') {\n // On IE 11, atob() can't handle newlines\n const str = atob(src.replace(/[\\n\\r]/g, ''));\n const buffer = new Uint8Array(str.length);\n for (let i = 0; i < str.length; ++i)\n buffer[i] = str.charCodeAt(i);\n return buffer;\n }\n else {\n onError('This environment does not support reading binary tags; either Buffer or atob is required');\n return src;\n }\n },\n stringify({ comment, type, value }, ctx, onComment, onChompKeep) {\n if (!value)\n return '';\n const buf = value; // checked earlier by binary.identify()\n let str;\n if (typeof btoa === 'function') {\n let s = '';\n for (let i = 0; i < buf.length; ++i)\n s += String.fromCharCode(buf[i]);\n str = btoa(s);\n }\n else {\n throw new Error('This environment does not support writing binary tags; either Buffer or btoa is required');\n }\n type ?? (type = Scalar.BLOCK_LITERAL);\n if (type !== Scalar.QUOTE_DOUBLE) {\n const lineWidth = Math.max(ctx.options.lineWidth - ctx.indent.length, ctx.options.minContentWidth);\n const n = Math.ceil(str.length / lineWidth);\n const lines = new Array(n);\n for (let i = 0, o = 0; i < n; ++i, o += lineWidth) {\n lines[i] = str.substr(o, lineWidth);\n }\n str = lines.join(type === Scalar.BLOCK_LITERAL ? '\\n' : ' ');\n }\n return stringifyString({ comment, type, value: str }, ctx, onComment, onChompKeep);\n }\n};\n\nexport { binary };\n","import { isSeq, isPair, isMap } from '../../nodes/identity.js';\nimport { createPair, Pair } from '../../nodes/Pair.js';\nimport { Scalar } from '../../nodes/Scalar.js';\nimport { YAMLSeq } from '../../nodes/YAMLSeq.js';\n\nfunction resolvePairs(seq, onError) {\n if (isSeq(seq)) {\n for (let i = 0; i < seq.items.length; ++i) {\n let item = seq.items[i];\n if (isPair(item))\n continue;\n else if (isMap(item)) {\n if (item.items.length > 1)\n onError('Each pair must have its own sequence indicator');\n const pair = item.items[0] || new Pair(new Scalar(null));\n if (item.commentBefore)\n pair.key.commentBefore = pair.key.commentBefore\n ? `${item.commentBefore}\\n${pair.key.commentBefore}`\n : item.commentBefore;\n if (item.comment) {\n const cn = pair.value ?? pair.key;\n cn.comment = cn.comment\n ? `${item.comment}\\n${cn.comment}`\n : item.comment;\n }\n item = pair;\n }\n seq.items[i] = isPair(item) ? item : new Pair(item);\n }\n }\n else\n onError('Expected a sequence for this tag');\n return seq;\n}\nfunction createPairs(schema, iterable, ctx) {\n const { replacer } = ctx;\n const pairs = new YAMLSeq(schema);\n pairs.tag = 'tag:yaml.org,2002:pairs';\n let i = 0;\n if (iterable && Symbol.iterator in Object(iterable))\n for (let it of iterable) {\n if (typeof replacer === 'function')\n it = replacer.call(iterable, String(i++), it);\n let key, value;\n if (Array.isArray(it)) {\n if (it.length === 2) {\n key = it[0];\n value = it[1];\n }\n else\n throw new TypeError(`Expected [key, value] tuple: ${it}`);\n }\n else if (it && it instanceof Object) {\n const keys = Object.keys(it);\n if (keys.length === 1) {\n key = keys[0];\n value = it[key];\n }\n else {\n throw new TypeError(`Expected tuple with one key, not ${keys.length} keys`);\n }\n }\n else {\n key = it;\n }\n pairs.items.push(createPair(key, value, ctx));\n }\n return pairs;\n}\nconst pairs = {\n collection: 'seq',\n default: false,\n tag: 'tag:yaml.org,2002:pairs',\n resolve: resolvePairs,\n createNode: createPairs\n};\n\nexport { createPairs, pairs, resolvePairs };\n","import { isScalar, isPair } from '../../nodes/identity.js';\nimport { toJS } from '../../nodes/toJS.js';\nimport { YAMLMap } from '../../nodes/YAMLMap.js';\nimport { YAMLSeq } from '../../nodes/YAMLSeq.js';\nimport { resolvePairs, createPairs } from './pairs.js';\n\nclass YAMLOMap extends YAMLSeq {\n constructor() {\n super();\n this.add = YAMLMap.prototype.add.bind(this);\n this.delete = YAMLMap.prototype.delete.bind(this);\n this.get = YAMLMap.prototype.get.bind(this);\n this.has = YAMLMap.prototype.has.bind(this);\n this.set = YAMLMap.prototype.set.bind(this);\n this.tag = YAMLOMap.tag;\n }\n /**\n * If `ctx` is given, the return type is actually `Map<unknown, unknown>`,\n * but TypeScript won't allow widening the signature of a child method.\n */\n toJSON(_, ctx) {\n if (!ctx)\n return super.toJSON(_);\n const map = new Map();\n if (ctx?.onCreate)\n ctx.onCreate(map);\n for (const pair of this.items) {\n let key, value;\n if (isPair(pair)) {\n key = toJS(pair.key, '', ctx);\n value = toJS(pair.value, key, ctx);\n }\n else {\n key = toJS(pair, '', ctx);\n }\n if (map.has(key))\n throw new Error('Ordered maps must not include duplicate keys');\n map.set(key, value);\n }\n return map;\n }\n static from(schema, iterable, ctx) {\n const pairs = createPairs(schema, iterable, ctx);\n const omap = new this();\n omap.items = pairs.items;\n return omap;\n }\n}\nYAMLOMap.tag = 'tag:yaml.org,2002:omap';\nconst omap = {\n collection: 'seq',\n identify: value => value instanceof Map,\n nodeClass: YAMLOMap,\n default: false,\n tag: 'tag:yaml.org,2002:omap',\n resolve(seq, onError) {\n const pairs = resolvePairs(seq, onError);\n const seenKeys = [];\n for (const { key } of pairs.items) {\n if (isScalar(key)) {\n if (seenKeys.includes(key.value)) {\n onError(`Ordered maps must not include duplicate keys: ${key.value}`);\n }\n else {\n seenKeys.push(key.value);\n }\n }\n }\n return Object.assign(new YAMLOMap(), pairs);\n },\n createNode: (schema, iterable, ctx) => YAMLOMap.from(schema, iterable, ctx)\n};\n\nexport { YAMLOMap, omap };\n","import { Scalar } from '../../nodes/Scalar.js';\n\nfunction boolStringify({ value, source }, ctx) {\n const boolObj = value ? trueTag : falseTag;\n if (source && boolObj.test.test(source))\n return source;\n return value ? ctx.options.trueStr : ctx.options.falseStr;\n}\nconst trueTag = {\n identify: value => value === true,\n default: true,\n tag: 'tag:yaml.org,2002:bool',\n test: /^(?:Y|y|[Yy]es|YES|[Tt]rue|TRUE|[Oo]n|ON)$/,\n resolve: () => new Scalar(true),\n stringify: boolStringify\n};\nconst falseTag = {\n identify: value => value === false,\n default: true,\n tag: 'tag:yaml.org,2002:bool',\n test: /^(?:N|n|[Nn]o|NO|[Ff]alse|FALSE|[Oo]ff|OFF)$/,\n resolve: () => new Scalar(false),\n stringify: boolStringify\n};\n\nexport { falseTag, trueTag };\n","import { Scalar } from '../../nodes/Scalar.js';\nimport { stringifyNumber } from '../../stringify/stringifyNumber.js';\n\nconst floatNaN = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n test: /^(?:[-+]?\\.(?:inf|Inf|INF)|\\.nan|\\.NaN|\\.NAN)$/,\n resolve: (str) => str.slice(-3).toLowerCase() === 'nan'\n ? NaN\n : str[0] === '-'\n ? Number.NEGATIVE_INFINITY\n : Number.POSITIVE_INFINITY,\n stringify: stringifyNumber\n};\nconst floatExp = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n format: 'EXP',\n test: /^[-+]?(?:[0-9][0-9_]*)?(?:\\.[0-9_]*)?[eE][-+]?[0-9]+$/,\n resolve: (str) => parseFloat(str.replace(/_/g, '')),\n stringify(node) {\n const num = Number(node.value);\n return isFinite(num) ? num.toExponential() : stringifyNumber(node);\n }\n};\nconst float = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n test: /^[-+]?(?:[0-9][0-9_]*)?\\.[0-9_]*$/,\n resolve(str) {\n const node = new Scalar(parseFloat(str.replace(/_/g, '')));\n const dot = str.indexOf('.');\n if (dot !== -1) {\n const f = str.substring(dot + 1).replace(/_/g, '');\n if (f[f.length - 1] === '0')\n node.minFractionDigits = f.length;\n }\n return node;\n },\n stringify: stringifyNumber\n};\n\nexport { float, floatExp, floatNaN };\n","import { stringifyNumber } from '../../stringify/stringifyNumber.js';\n\nconst intIdentify = (value) => typeof value === 'bigint' || Number.isInteger(value);\nfunction intResolve(str, offset, radix, { intAsBigInt }) {\n const sign = str[0];\n if (sign === '-' || sign === '+')\n offset += 1;\n str = str.substring(offset).replace(/_/g, '');\n if (intAsBigInt) {\n switch (radix) {\n case 2:\n str = `0b${str}`;\n break;\n case 8:\n str = `0o${str}`;\n break;\n case 16:\n str = `0x${str}`;\n break;\n }\n const n = BigInt(str);\n return sign === '-' ? BigInt(-1) * n : n;\n }\n const n = parseInt(str, radix);\n return sign === '-' ? -1 * n : n;\n}\nfunction intStringify(node, radix, prefix) {\n const { value } = node;\n if (intIdentify(value)) {\n const str = value.toString(radix);\n return value < 0 ? '-' + prefix + str.substr(1) : prefix + str;\n }\n return stringifyNumber(node);\n}\nconst intBin = {\n identify: intIdentify,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n format: 'BIN',\n test: /^[-+]?0b[0-1_]+$/,\n resolve: (str, _onError, opt) => intResolve(str, 2, 2, opt),\n stringify: node => intStringify(node, 2, '0b')\n};\nconst intOct = {\n identify: intIdentify,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n format: 'OCT',\n test: /^[-+]?0[0-7_]+$/,\n resolve: (str, _onError, opt) => intResolve(str, 1, 8, opt),\n stringify: node => intStringify(node, 8, '0')\n};\nconst int = {\n identify: intIdentify,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n test: /^[-+]?[0-9][0-9_]*$/,\n resolve: (str, _onError, opt) => intResolve(str, 0, 10, opt),\n stringify: stringifyNumber\n};\nconst intHex = {\n identify: intIdentify,\n default: true,\n tag: 'tag:yaml.org,2002:int',\n format: 'HEX',\n test: /^[-+]?0x[0-9a-fA-F_]+$/,\n resolve: (str, _onError, opt) => intResolve(str, 2, 16, opt),\n stringify: node => intStringify(node, 16, '0x')\n};\n\nexport { int, intBin, intHex, intOct };\n","import { isMap, isPair, isScalar } from '../../nodes/identity.js';\nimport { Pair, createPair } from '../../nodes/Pair.js';\nimport { YAMLMap, findPair } from '../../nodes/YAMLMap.js';\n\nclass YAMLSet extends YAMLMap {\n constructor(schema) {\n super(schema);\n this.tag = YAMLSet.tag;\n }\n add(key) {\n let pair;\n if (isPair(key))\n pair = key;\n else if (key &&\n typeof key === 'object' &&\n 'key' in key &&\n 'value' in key &&\n key.value === null)\n pair = new Pair(key.key, null);\n else\n pair = new Pair(key, null);\n const prev = findPair(this.items, pair.key);\n if (!prev)\n this.items.push(pair);\n }\n /**\n * If `keepPair` is `true`, returns the Pair matching `key`.\n * Otherwise, returns the value of that Pair's key.\n */\n get(key, keepPair) {\n const pair = findPair(this.items, key);\n return !keepPair && isPair(pair)\n ? isScalar(pair.key)\n ? pair.key.value\n : pair.key\n : pair;\n }\n set(key, value) {\n if (typeof value !== 'boolean')\n throw new Error(`Expected boolean value for set(key, value) in a YAML set, not ${typeof value}`);\n const prev = findPair(this.items, key);\n if (prev && !value) {\n this.items.splice(this.items.indexOf(prev), 1);\n }\n else if (!prev && value) {\n this.items.push(new Pair(key));\n }\n }\n toJSON(_, ctx) {\n return super.toJSON(_, ctx, Set);\n }\n toString(ctx, onComment, onChompKeep) {\n if (!ctx)\n return JSON.stringify(this);\n if (this.hasAllNullValues(true))\n return super.toString(Object.assign({}, ctx, { allNullValues: true }), onComment, onChompKeep);\n else\n throw new Error('Set items must all have null values');\n }\n static from(schema, iterable, ctx) {\n const { replacer } = ctx;\n const set = new this(schema);\n if (iterable && Symbol.iterator in Object(iterable))\n for (let value of iterable) {\n if (typeof replacer === 'function')\n value = replacer.call(iterable, value, value);\n set.items.push(createPair(value, null, ctx));\n }\n return set;\n }\n}\nYAMLSet.tag = 'tag:yaml.org,2002:set';\nconst set = {\n collection: 'map',\n identify: value => value instanceof Set,\n nodeClass: YAMLSet,\n default: false,\n tag: 'tag:yaml.org,2002:set',\n createNode: (schema, iterable, ctx) => YAMLSet.from(schema, iterable, ctx),\n resolve(map, onError) {\n if (isMap(map)) {\n if (map.hasAllNullValues(true))\n return Object.assign(new YAMLSet(), map);\n else\n onError('Set items must all have null values');\n }\n else\n onError('Expected a mapping for this tag');\n return map;\n }\n};\n\nexport { YAMLSet, set };\n","import { stringifyNumber } from '../../stringify/stringifyNumber.js';\n\n/** Internal types handle bigint as number, because TS can't figure it out. */\nfunction parseSexagesimal(str, asBigInt) {\n const sign = str[0];\n const parts = sign === '-' || sign === '+' ? str.substring(1) : str;\n const num = (n) => asBigInt ? BigInt(n) : Number(n);\n const res = parts\n .replace(/_/g, '')\n .split(':')\n .reduce((res, p) => res * num(60) + num(p), num(0));\n return (sign === '-' ? num(-1) * res : res);\n}\n/**\n * hhhh:mm:ss.sss\n *\n * Internal types handle bigint as number, because TS can't figure it out.\n */\nfunction stringifySexagesimal(node) {\n let { value } = node;\n let num = (n) => n;\n if (typeof value === 'bigint')\n num = n => BigInt(n);\n else if (isNaN(value) || !isFinite(value))\n return stringifyNumber(node);\n let sign = '';\n if (value < 0) {\n sign = '-';\n value *= num(-1);\n }\n const _60 = num(60);\n const parts = [value % _60]; // seconds, including ms\n if (value < 60) {\n parts.unshift(0); // at least one : is required\n }\n else {\n value = (value - parts[0]) / _60;\n parts.unshift(value % _60); // minutes\n if (value >= 60) {\n value = (value - parts[0]) / _60;\n parts.unshift(value); // hours\n }\n }\n return (sign +\n parts\n .map(n => String(n).padStart(2, '0'))\n .join(':')\n .replace(/000000\\d*$/, '') // % 60 may introduce error\n );\n}\nconst intTime = {\n identify: value => typeof value === 'bigint' || Number.isInteger(value),\n default: true,\n tag: 'tag:yaml.org,2002:int',\n format: 'TIME',\n test: /^[-+]?[0-9][0-9_]*(?::[0-5]?[0-9])+$/,\n resolve: (str, _onError, { intAsBigInt }) => parseSexagesimal(str, intAsBigInt),\n stringify: stringifySexagesimal\n};\nconst floatTime = {\n identify: value => typeof value === 'number',\n default: true,\n tag: 'tag:yaml.org,2002:float',\n format: 'TIME',\n test: /^[-+]?[0-9][0-9_]*(?::[0-5]?[0-9])+\\.[0-9_]*$/,\n resolve: str => parseSexagesimal(str, false),\n stringify: stringifySexagesimal\n};\nconst timestamp = {\n identify: value => value instanceof Date,\n default: true,\n tag: 'tag:yaml.org,2002:timestamp',\n // If the time zone is omitted, the timestamp is assumed to be specified in UTC. The time part\n // may be omitted altogether, resulting in a date format. In such a case, the time part is\n // assumed to be 00:00:00Z (start of day, UTC).\n test: RegExp('^([0-9]{4})-([0-9]{1,2})-([0-9]{1,2})' + // YYYY-Mm-Dd\n '(?:' + // time is optional\n '(?:t|T|[ \\\\t]+)' + // t | T | whitespace\n '([0-9]{1,2}):([0-9]{1,2}):([0-9]{1,2}(\\\\.[0-9]+)?)' + // Hh:Mm:Ss(.ss)?\n '(?:[ \\\\t]*(Z|[-+][012]?[0-9](?::[0-9]{2})?))?' + // Z | +5 | -03:30\n ')?$'),\n resolve(str) {\n const match = str.match(timestamp.test);\n if (!match)\n throw new Error('!!timestamp expects a date, starting with yyyy-mm-dd');\n const [, year, month, day, hour, minute, second] = match.map(Number);\n const millisec = match[7] ? Number((match[7] + '00').substr(1, 3)) : 0;\n let date = Date.UTC(year, month - 1, day, hour || 0, minute || 0, second || 0, millisec);\n const tz = match[8];\n if (tz && tz !== 'Z') {\n let d = parseSexagesimal(tz, false);\n if (Math.abs(d) < 30)\n d *= 60;\n date -= 60000 * d;\n }\n return new Date(date);\n },\n stringify: ({ value }) => value?.toISOString().replace(/(T00:00:00)?\\.000Z$/, '') ?? ''\n};\n\nexport { floatTime, intTime, timestamp };\n","import { map } from '../common/map.js';\nimport { nullTag } from '../common/null.js';\nimport { seq } from '../common/seq.js';\nimport { string } from '../common/string.js';\nimport { binary } from './binary.js';\nimport { trueTag, falseTag } from './bool.js';\nimport { floatNaN, floatExp, float } from './float.js';\nimport { intBin, intOct, int, intHex } from './int.js';\nimport { merge } from './merge.js';\nimport { omap } from './omap.js';\nimport { pairs } from './pairs.js';\nimport { set } from './set.js';\nimport { intTime, floatTime, timestamp } from './timestamp.js';\n\nconst schema = [\n map,\n seq,\n string,\n nullTag,\n trueTag,\n falseTag,\n intBin,\n intOct,\n int,\n intHex,\n floatNaN,\n floatExp,\n float,\n binary,\n merge,\n omap,\n pairs,\n set,\n intTime,\n floatTime,\n timestamp\n];\n\nexport { schema };\n","import { map } from './common/map.js';\nimport { nullTag } from './common/null.js';\nimport { seq } from './common/seq.js';\nimport { string } from './common/string.js';\nimport { boolTag } from './core/bool.js';\nimport { floatNaN, floatExp, float } from './core/float.js';\nimport { intOct, intHex, int } from './core/int.js';\nimport { schema } from './core/schema.js';\nimport { schema as schema$1 } from './json/schema.js';\nimport { binary } from './yaml-1.1/binary.js';\nimport { merge } from './yaml-1.1/merge.js';\nimport { omap } from './yaml-1.1/omap.js';\nimport { pairs } from './yaml-1.1/pairs.js';\nimport { schema as schema$2 } from './yaml-1.1/schema.js';\nimport { set } from './yaml-1.1/set.js';\nimport { timestamp, intTime, floatTime } from './yaml-1.1/timestamp.js';\n\nconst schemas = new Map([\n ['core', schema],\n ['failsafe', [map, seq, string]],\n ['json', schema$1],\n ['yaml11', schema$2],\n ['yaml-1.1', schema$2]\n]);\nconst tagsByName = {\n binary,\n bool: boolTag,\n float,\n floatExp,\n floatNaN,\n floatTime,\n int,\n intHex,\n intOct,\n intTime,\n map,\n merge,\n null: nullTag,\n omap,\n pairs,\n seq,\n set,\n timestamp\n};\nconst coreKnownTags = {\n 'tag:yaml.org,2002:binary': binary,\n 'tag:yaml.org,2002:merge': merge,\n 'tag:yaml.org,2002:omap': omap,\n 'tag:yaml.org,2002:pairs': pairs,\n 'tag:yaml.org,2002:set': set,\n 'tag:yaml.org,2002:timestamp': timestamp\n};\nfunction getTags(customTags, schemaName, addMergeTag) {\n const schemaTags = schemas.get(schemaName);\n if (schemaTags && !customTags) {\n return addMergeTag && !schemaTags.includes(merge)\n ? schemaTags.concat(merge)\n : schemaTags.slice();\n }\n let tags = schemaTags;\n if (!tags) {\n if (Array.isArray(customTags))\n tags = [];\n else {\n const keys = Array.from(schemas.keys())\n .filter(key => key !== 'yaml11')\n .map(key => JSON.stringify(key))\n .join(', ');\n throw new Error(`Unknown schema \"${schemaName}\"; use one of ${keys} or define customTags array`);\n }\n }\n if (Array.isArray(customTags)) {\n for (const tag of customTags)\n tags = tags.concat(tag);\n }\n else if (typeof customTags === 'function') {\n tags = customTags(tags.slice());\n }\n if (addMergeTag)\n tags = tags.concat(merge);\n return tags.reduce((tags, tag) => {\n const tagObj = typeof tag === 'string' ? tagsByName[tag] : tag;\n if (!tagObj) {\n const tagName = JSON.stringify(tag);\n const keys = Object.keys(tagsByName)\n .map(key => JSON.stringify(key))\n .join(', ');\n throw new Error(`Unknown custom tag ${tagName}; use one of ${keys}`);\n }\n if (!tags.includes(tagObj))\n tags.push(tagObj);\n return tags;\n }, []);\n}\n\nexport { coreKnownTags, getTags };\n","import { MAP, SCALAR, SEQ } from '../nodes/identity.js';\nimport { map } from './common/map.js';\nimport { seq } from './common/seq.js';\nimport { string } from './common/string.js';\nimport { getTags, coreKnownTags } from './tags.js';\n\nconst sortMapEntriesByKey = (a, b) => a.key < b.key ? -1 : a.key > b.key ? 1 : 0;\nclass Schema {\n constructor({ compat, customTags, merge, resolveKnownTags, schema, sortMapEntries, toStringDefaults }) {\n this.compat = Array.isArray(compat)\n ? getTags(compat, 'compat')\n : compat\n ? getTags(null, compat)\n : null;\n this.name = (typeof schema === 'string' && schema) || 'core';\n this.knownTags = resolveKnownTags ? coreKnownTags : {};\n this.tags = getTags(customTags, this.name, merge);\n this.toStringOptions = toStringDefaults ?? null;\n Object.defineProperty(this, MAP, { value: map });\n Object.defineProperty(this, SCALAR, { value: string });\n Object.defineProperty(this, SEQ, { value: seq });\n // Used by createMap()\n this.sortMapEntries =\n typeof sortMapEntries === 'function'\n ? sortMapEntries\n : sortMapEntries === true\n ? sortMapEntriesByKey\n : null;\n }\n clone() {\n const copy = Object.create(Schema.prototype, Object.getOwnPropertyDescriptors(this));\n copy.tags = this.tags.slice();\n return copy;\n }\n}\n\nexport { Schema };\n","import { isNode } from '../nodes/identity.js';\nimport { createStringifyContext, stringify } from './stringify.js';\nimport { indentComment, lineComment } from './stringifyComment.js';\n\nfunction stringifyDocument(doc, options) {\n const lines = [];\n let hasDirectives = options.directives === true;\n if (options.directives !== false && doc.directives) {\n const dir = doc.directives.toString(doc);\n if (dir) {\n lines.push(dir);\n hasDirectives = true;\n }\n else if (doc.directives.docStart)\n hasDirectives = true;\n }\n if (hasDirectives)\n lines.push('---');\n const ctx = createStringifyContext(doc, options);\n const { commentString } = ctx.options;\n if (doc.commentBefore) {\n if (lines.length !== 1)\n lines.unshift('');\n const cs = commentString(doc.commentBefore);\n lines.unshift(indentComment(cs, ''));\n }\n let chompKeep = false;\n let contentComment = null;\n if (doc.contents) {\n if (isNode(doc.contents)) {\n if (doc.contents.spaceBefore && hasDirectives)\n lines.push('');\n if (doc.contents.commentBefore) {\n const cs = commentString(doc.contents.commentBefore);\n lines.push(indentComment(cs, ''));\n }\n // top-level block scalars need to be indented if followed by a comment\n ctx.forceBlockIndent = !!doc.comment;\n contentComment = doc.contents.comment;\n }\n const onChompKeep = contentComment ? undefined : () => (chompKeep = true);\n let body = stringify(doc.contents, ctx, () => (contentComment = null), onChompKeep);\n if (contentComment)\n body += lineComment(body, '', commentString(contentComment));\n if ((body[0] === '|' || body[0] === '>') &&\n lines[lines.length - 1] === '---') {\n // Top-level block scalars with a preceding doc marker ought to use the\n // same line for their header.\n lines[lines.length - 1] = `--- ${body}`;\n }\n else\n lines.push(body);\n }\n else {\n lines.push(stringify(doc.contents, ctx));\n }\n if (doc.directives?.docEnd) {\n if (doc.comment) {\n const cs = commentString(doc.comment);\n if (cs.includes('\\n')) {\n lines.push('...');\n lines.push(indentComment(cs, ''));\n }\n else {\n lines.push(`... ${cs}`);\n }\n }\n else {\n lines.push('...');\n }\n }\n else {\n let dc = doc.comment;\n if (dc && chompKeep)\n dc = dc.replace(/^\\n+/, '');\n if (dc) {\n if ((!chompKeep || contentComment) && lines[lines.length - 1] !== '')\n lines.push('');\n lines.push(indentComment(commentString(dc), ''));\n }\n }\n return lines.join('\\n') + '\\n';\n}\n\nexport { stringifyDocument };\n","import { Alias } from '../nodes/Alias.js';\nimport { isEmptyPath, collectionFromPath } from '../nodes/Collection.js';\nimport { NODE_TYPE, DOC, isNode, isCollection, isScalar } from '../nodes/identity.js';\nimport { Pair } from '../nodes/Pair.js';\nimport { toJS } from '../nodes/toJS.js';\nimport { Schema } from '../schema/Schema.js';\nimport { stringifyDocument } from '../stringify/stringifyDocument.js';\nimport { anchorNames, findNewAnchor, createNodeAnchors } from './anchors.js';\nimport { applyReviver } from './applyReviver.js';\nimport { createNode } from './createNode.js';\nimport { Directives } from './directives.js';\n\nclass Document {\n constructor(value, replacer, options) {\n /** A comment before this Document */\n this.commentBefore = null;\n /** A comment immediately after this Document */\n this.comment = null;\n /** Errors encountered during parsing. */\n this.errors = [];\n /** Warnings encountered during parsing. */\n this.warnings = [];\n Object.defineProperty(this, NODE_TYPE, { value: DOC });\n let _replacer = null;\n if (typeof replacer === 'function' || Array.isArray(replacer)) {\n _replacer = replacer;\n }\n else if (options === undefined && replacer) {\n options = replacer;\n replacer = undefined;\n }\n const opt = Object.assign({\n intAsBigInt: false,\n keepSourceTokens: false,\n logLevel: 'warn',\n prettyErrors: true,\n strict: true,\n stringKeys: false,\n uniqueKeys: true,\n version: '1.2'\n }, options);\n this.options = opt;\n let { version } = opt;\n if (options?._directives) {\n this.directives = options._directives.atDocument();\n if (this.directives.yaml.explicit)\n version = this.directives.yaml.version;\n }\n else\n this.directives = new Directives({ version });\n this.setSchema(version, options);\n // @ts-expect-error We can't really know that this matches Contents.\n this.contents =\n value === undefined ? null : this.createNode(value, _replacer, options);\n }\n /**\n * Create a deep copy of this Document and its contents.\n *\n * Custom Node values that inherit from `Object` still refer to their original instances.\n */\n clone() {\n const copy = Object.create(Document.prototype, {\n [NODE_TYPE]: { value: DOC }\n });\n copy.commentBefore = this.commentBefore;\n copy.comment = this.comment;\n copy.errors = this.errors.slice();\n copy.warnings = this.warnings.slice();\n copy.options = Object.assign({}, this.options);\n if (this.directives)\n copy.directives = this.directives.clone();\n copy.schema = this.schema.clone();\n // @ts-expect-error We can't really know that this matches Contents.\n copy.contents = isNode(this.contents)\n ? this.contents.clone(copy.schema)\n : this.contents;\n if (this.range)\n copy.range = this.range.slice();\n return copy;\n }\n /** Adds a value to the document. */\n add(value) {\n if (assertCollection(this.contents))\n this.contents.add(value);\n }\n /** Adds a value to the document. */\n addIn(path, value) {\n if (assertCollection(this.contents))\n this.contents.addIn(path, value);\n }\n /**\n * Create a new `Alias` node, ensuring that the target `node` has the required anchor.\n *\n * If `node` already has an anchor, `name` is ignored.\n * Otherwise, the `node.anchor` value will be set to `name`,\n * or if an anchor with that name is already present in the document,\n * `name` will be used as a prefix for a new unique anchor.\n * If `name` is undefined, the generated anchor will use 'a' as a prefix.\n */\n createAlias(node, name) {\n if (!node.anchor) {\n const prev = anchorNames(this);\n node.anchor =\n // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing\n !name || prev.has(name) ? findNewAnchor(name || 'a', prev) : name;\n }\n return new Alias(node.anchor);\n }\n createNode(value, replacer, options) {\n let _replacer = undefined;\n if (typeof replacer === 'function') {\n value = replacer.call({ '': value }, '', value);\n _replacer = replacer;\n }\n else if (Array.isArray(replacer)) {\n const keyToStr = (v) => typeof v === 'number' || v instanceof String || v instanceof Number;\n const asStr = replacer.filter(keyToStr).map(String);\n if (asStr.length > 0)\n replacer = replacer.concat(asStr);\n _replacer = replacer;\n }\n else if (options === undefined && replacer) {\n options = replacer;\n replacer = undefined;\n }\n const { aliasDuplicateObjects, anchorPrefix, flow, keepUndefined, onTagObj, tag } = options ?? {};\n const { onAnchor, setAnchors, sourceObjects } = createNodeAnchors(this, \n // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing\n anchorPrefix || 'a');\n const ctx = {\n aliasDuplicateObjects: aliasDuplicateObjects ?? true,\n keepUndefined: keepUndefined ?? false,\n onAnchor,\n onTagObj,\n replacer: _replacer,\n schema: this.schema,\n sourceObjects\n };\n const node = createNode(value, tag, ctx);\n if (flow && isCollection(node))\n node.flow = true;\n setAnchors();\n return node;\n }\n /**\n * Convert a key and a value into a `Pair` using the current schema,\n * recursively wrapping all values as `Scalar` or `Collection` nodes.\n */\n createPair(key, value, options = {}) {\n const k = this.createNode(key, null, options);\n const v = this.createNode(value, null, options);\n return new Pair(k, v);\n }\n /**\n * Removes a value from the document.\n * @returns `true` if the item was found and removed.\n */\n delete(key) {\n return assertCollection(this.contents) ? this.contents.delete(key) : false;\n }\n /**\n * Removes a value from the document.\n * @returns `true` if the item was found and removed.\n */\n deleteIn(path) {\n if (isEmptyPath(path)) {\n if (this.contents == null)\n return false;\n // @ts-expect-error Presumed impossible if Strict extends false\n this.contents = null;\n return true;\n }\n return assertCollection(this.contents)\n ? this.contents.deleteIn(path)\n : false;\n }\n /**\n * Returns item at `key`, or `undefined` if not found. By default unwraps\n * scalar values from their surrounding node; to disable set `keepScalar` to\n * `true` (collections are always returned intact).\n */\n get(key, keepScalar) {\n return isCollection(this.contents)\n ? this.contents.get(key, keepScalar)\n : undefined;\n }\n /**\n * Returns item at `path`, or `undefined` if not found. By default unwraps\n * scalar values from their surrounding node; to disable set `keepScalar` to\n * `true` (collections are always returned intact).\n */\n getIn(path, keepScalar) {\n if (isEmptyPath(path))\n return !keepScalar && isScalar(this.contents)\n ? this.contents.value\n : this.contents;\n return isCollection(this.contents)\n ? this.contents.getIn(path, keepScalar)\n : undefined;\n }\n /**\n * Checks if the document includes a value with the key `key`.\n */\n has(key) {\n return isCollection(this.contents) ? this.contents.has(key) : false;\n }\n /**\n * Checks if the document includes a value at `path`.\n */\n hasIn(path) {\n if (isEmptyPath(path))\n return this.contents !== undefined;\n return isCollection(this.contents) ? this.contents.hasIn(path) : false;\n }\n /**\n * Sets a value in this document. For `!!set`, `value` needs to be a\n * boolean to add/remove the item from the set.\n */\n set(key, value) {\n if (this.contents == null) {\n // @ts-expect-error We can't really know that this matches Contents.\n this.contents = collectionFromPath(this.schema, [key], value);\n }\n else if (assertCollection(this.contents)) {\n this.contents.set(key, value);\n }\n }\n /**\n * Sets a value in this document. For `!!set`, `value` needs to be a\n * boolean to add/remove the item from the set.\n */\n setIn(path, value) {\n if (isEmptyPath(path)) {\n // @ts-expect-error We can't really know that this matches Contents.\n this.contents = value;\n }\n else if (this.contents == null) {\n // @ts-expect-error We can't really know that this matches Contents.\n this.contents = collectionFromPath(this.schema, Array.from(path), value);\n }\n else if (assertCollection(this.contents)) {\n this.contents.setIn(path, value);\n }\n }\n /**\n * Change the YAML version and schema used by the document.\n * A `null` version disables support for directives, explicit tags, anchors, and aliases.\n * It also requires the `schema` option to be given as a `Schema` instance value.\n *\n * Overrides all previously set schema options.\n */\n setSchema(version, options = {}) {\n if (typeof version === 'number')\n version = String(version);\n let opt;\n switch (version) {\n case '1.1':\n if (this.directives)\n this.directives.yaml.version = '1.1';\n else\n this.directives = new Directives({ version: '1.1' });\n opt = { resolveKnownTags: false, schema: 'yaml-1.1' };\n break;\n case '1.2':\n case 'next':\n if (this.directives)\n this.directives.yaml.version = version;\n else\n this.directives = new Directives({ version });\n opt = { resolveKnownTags: true, schema: 'core' };\n break;\n case null:\n if (this.directives)\n delete this.directives;\n opt = null;\n break;\n default: {\n const sv = JSON.stringify(version);\n throw new Error(`Expected '1.1', '1.2' or null as first argument, but found: ${sv}`);\n }\n }\n // Not using `instanceof Schema` to allow for duck typing\n if (options.schema instanceof Object)\n this.schema = options.schema;\n else if (opt)\n this.schema = new Schema(Object.assign(opt, options));\n else\n throw new Error(`With a null YAML version, the { schema: Schema } option is required`);\n }\n // json & jsonArg are only used from toJSON()\n toJS({ json, jsonArg, mapAsMap, maxAliasCount, onAnchor, reviver } = {}) {\n const ctx = {\n anchors: new Map(),\n doc: this,\n keep: !json,\n mapAsMap: mapAsMap === true,\n mapKeyWarned: false,\n maxAliasCount: typeof maxAliasCount === 'number' ? maxAliasCount : 100\n };\n const res = toJS(this.contents, jsonArg ?? '', ctx);\n if (typeof onAnchor === 'function')\n for (const { count, res } of ctx.anchors.values())\n onAnchor(res, count);\n return typeof reviver === 'function'\n ? applyReviver(reviver, { '': res }, '', res)\n : res;\n }\n /**\n * A JSON representation of the document `contents`.\n *\n * @param jsonArg Used by `JSON.stringify` to indicate the array index or\n * property name.\n */\n toJSON(jsonArg, onAnchor) {\n return this.toJS({ json: true, jsonArg, mapAsMap: false, onAnchor });\n }\n /** A YAML representation of the document. */\n toString(options = {}) {\n if (this.errors.length > 0)\n throw new Error('Document with errors cannot be stringified');\n if ('indent' in options &&\n (!Number.isInteger(options.indent) || Number(options.indent) <= 0)) {\n const s = JSON.stringify(options.indent);\n throw new Error(`\"indent\" option must be a positive integer, not ${s}`);\n }\n return stringifyDocument(this, options);\n }\n}\nfunction assertCollection(contents) {\n if (isCollection(contents))\n return true;\n throw new Error('Expected a YAML collection as document contents');\n}\n\nexport { Document };\n","class YAMLError extends Error {\n constructor(name, pos, code, message) {\n super();\n this.name = name;\n this.code = code;\n this.message = message;\n this.pos = pos;\n }\n}\nclass YAMLParseError extends YAMLError {\n constructor(pos, code, message) {\n super('YAMLParseError', pos, code, message);\n }\n}\nclass YAMLWarning extends YAMLError {\n constructor(pos, code, message) {\n super('YAMLWarning', pos, code, message);\n }\n}\nconst prettifyError = (src, lc) => (error) => {\n if (error.pos[0] === -1)\n return;\n error.linePos = error.pos.map(pos => lc.linePos(pos));\n const { line, col } = error.linePos[0];\n error.message += ` at line ${line}, column ${col}`;\n let ci = col - 1;\n let lineStr = src\n .substring(lc.lineStarts[line - 1], lc.lineStarts[line])\n .replace(/[\\n\\r]+$/, '');\n // Trim to max 80 chars, keeping col position near the middle\n if (ci >= 60 && lineStr.length > 80) {\n const trimStart = Math.min(ci - 39, lineStr.length - 79);\n lineStr = '…' + lineStr.substring(trimStart);\n ci -= trimStart - 1;\n }\n if (lineStr.length > 80)\n lineStr = lineStr.substring(0, 79) + '…';\n // Include previous line in context if pointing at line start\n if (line > 1 && /^ *$/.test(lineStr.substring(0, ci))) {\n // Regexp won't match if start is trimmed\n let prev = src.substring(lc.lineStarts[line - 2], lc.lineStarts[line - 1]);\n if (prev.length > 80)\n prev = prev.substring(0, 79) + '…\\n';\n lineStr = prev + lineStr;\n }\n if (/[^ ]/.test(lineStr)) {\n let count = 1;\n const end = error.linePos[1];\n if (end && end.line === line && end.col > col) {\n count = Math.max(1, Math.min(end.col - col, 80 - ci));\n }\n const pointer = ' '.repeat(ci) + '^'.repeat(count);\n error.message += `:\\n\\n${lineStr}\\n${pointer}\\n`;\n }\n};\n\nexport { YAMLError, YAMLParseError, YAMLWarning, prettifyError };\n","function resolveProps(tokens, { flow, indicator, next, offset, onError, parentIndent, startOnNewline }) {\n let spaceBefore = false;\n let atNewline = startOnNewline;\n let hasSpace = startOnNewline;\n let comment = '';\n let commentSep = '';\n let hasNewline = false;\n let reqSpace = false;\n let tab = null;\n let anchor = null;\n let tag = null;\n let newlineAfterProp = null;\n let comma = null;\n let found = null;\n let start = null;\n for (const token of tokens) {\n if (reqSpace) {\n if (token.type !== 'space' &&\n token.type !== 'newline' &&\n token.type !== 'comma')\n onError(token.offset, 'MISSING_CHAR', 'Tags and anchors must be separated from the next token by white space');\n reqSpace = false;\n }\n if (tab) {\n if (atNewline && token.type !== 'comment' && token.type !== 'newline') {\n onError(tab, 'TAB_AS_INDENT', 'Tabs are not allowed as indentation');\n }\n tab = null;\n }\n switch (token.type) {\n case 'space':\n // At the doc level, tabs at line start may be parsed\n // as leading white space rather than indentation.\n // In a flow collection, only the parser handles indent.\n if (!flow &&\n (indicator !== 'doc-start' || next?.type !== 'flow-collection') &&\n token.source.includes('\\t')) {\n tab = token;\n }\n hasSpace = true;\n break;\n case 'comment': {\n if (!hasSpace)\n onError(token, 'MISSING_CHAR', 'Comments must be separated from other tokens by white space characters');\n const cb = token.source.substring(1) || ' ';\n if (!comment)\n comment = cb;\n else\n comment += commentSep + cb;\n commentSep = '';\n atNewline = false;\n break;\n }\n case 'newline':\n if (atNewline) {\n if (comment)\n comment += token.source;\n else if (!found || indicator !== 'seq-item-ind')\n spaceBefore = true;\n }\n else\n commentSep += token.source;\n atNewline = true;\n hasNewline = true;\n if (anchor || tag)\n newlineAfterProp = token;\n hasSpace = true;\n break;\n case 'anchor':\n if (anchor)\n onError(token, 'MULTIPLE_ANCHORS', 'A node can have at most one anchor');\n if (token.source.endsWith(':'))\n onError(token.offset + token.source.length - 1, 'BAD_ALIAS', 'Anchor ending in : is ambiguous', true);\n anchor = token;\n start ?? (start = token.offset);\n atNewline = false;\n hasSpace = false;\n reqSpace = true;\n break;\n case 'tag': {\n if (tag)\n onError(token, 'MULTIPLE_TAGS', 'A node can have at most one tag');\n tag = token;\n start ?? (start = token.offset);\n atNewline = false;\n hasSpace = false;\n reqSpace = true;\n break;\n }\n case indicator:\n // Could here handle preceding comments differently\n if (anchor || tag)\n onError(token, 'BAD_PROP_ORDER', `Anchors and tags must be after the ${token.source} indicator`);\n if (found)\n onError(token, 'UNEXPECTED_TOKEN', `Unexpected ${token.source} in ${flow ?? 'collection'}`);\n found = token;\n atNewline =\n indicator === 'seq-item-ind' || indicator === 'explicit-key-ind';\n hasSpace = false;\n break;\n case 'comma':\n if (flow) {\n if (comma)\n onError(token, 'UNEXPECTED_TOKEN', `Unexpected , in ${flow}`);\n comma = token;\n atNewline = false;\n hasSpace = false;\n break;\n }\n // else fallthrough\n default:\n onError(token, 'UNEXPECTED_TOKEN', `Unexpected ${token.type} token`);\n atNewline = false;\n hasSpace = false;\n }\n }\n const last = tokens[tokens.length - 1];\n const end = last ? last.offset + last.source.length : offset;\n if (reqSpace &&\n next &&\n next.type !== 'space' &&\n next.type !== 'newline' &&\n next.type !== 'comma' &&\n (next.type !== 'scalar' || next.source !== '')) {\n onError(next.offset, 'MISSING_CHAR', 'Tags and anchors must be separated from the next token by white space');\n }\n if (tab &&\n ((atNewline && tab.indent <= parentIndent) ||\n next?.type === 'block-map' ||\n next?.type === 'block-seq'))\n onError(tab, 'TAB_AS_INDENT', 'Tabs are not allowed as indentation');\n return {\n comma,\n found,\n spaceBefore,\n comment,\n hasNewline,\n anchor,\n tag,\n newlineAfterProp,\n end,\n start: start ?? end\n };\n}\n\nexport { resolveProps };\n","function containsNewline(key) {\n if (!key)\n return null;\n switch (key.type) {\n case 'alias':\n case 'scalar':\n case 'double-quoted-scalar':\n case 'single-quoted-scalar':\n if (key.source.includes('\\n'))\n return true;\n if (key.end)\n for (const st of key.end)\n if (st.type === 'newline')\n return true;\n return false;\n case 'flow-collection':\n for (const it of key.items) {\n for (const st of it.start)\n if (st.type === 'newline')\n return true;\n if (it.sep)\n for (const st of it.sep)\n if (st.type === 'newline')\n return true;\n if (containsNewline(it.key) || containsNewline(it.value))\n return true;\n }\n return false;\n default:\n return true;\n }\n}\n\nexport { containsNewline };\n","import { containsNewline } from './util-contains-newline.js';\n\nfunction flowIndentCheck(indent, fc, onError) {\n if (fc?.type === 'flow-collection') {\n const end = fc.end[0];\n if (end.indent === indent &&\n (end.source === ']' || end.source === '}') &&\n containsNewline(fc)) {\n const msg = 'Flow end indicator should be more indented than parent';\n onError(end, 'BAD_INDENT', msg, true);\n }\n }\n}\n\nexport { flowIndentCheck };\n","import { isScalar } from '../nodes/identity.js';\n\nfunction mapIncludes(ctx, items, search) {\n const { uniqueKeys } = ctx.options;\n if (uniqueKeys === false)\n return false;\n const isEqual = typeof uniqueKeys === 'function'\n ? uniqueKeys\n : (a, b) => a === b || (isScalar(a) && isScalar(b) && a.value === b.value);\n return items.some(pair => isEqual(pair.key, search));\n}\n\nexport { mapIncludes };\n","import { Pair } from '../nodes/Pair.js';\nimport { YAMLMap } from '../nodes/YAMLMap.js';\nimport { resolveProps } from './resolve-props.js';\nimport { containsNewline } from './util-contains-newline.js';\nimport { flowIndentCheck } from './util-flow-indent-check.js';\nimport { mapIncludes } from './util-map-includes.js';\n\nconst startColMsg = 'All mapping items must start at the same column';\nfunction resolveBlockMap({ composeNode, composeEmptyNode }, ctx, bm, onError, tag) {\n const NodeClass = tag?.nodeClass ?? YAMLMap;\n const map = new NodeClass(ctx.schema);\n if (ctx.atRoot)\n ctx.atRoot = false;\n let offset = bm.offset;\n let commentEnd = null;\n for (const collItem of bm.items) {\n const { start, key, sep, value } = collItem;\n // key properties\n const keyProps = resolveProps(start, {\n indicator: 'explicit-key-ind',\n next: key ?? sep?.[0],\n offset,\n onError,\n parentIndent: bm.indent,\n startOnNewline: true\n });\n const implicitKey = !keyProps.found;\n if (implicitKey) {\n if (key) {\n if (key.type === 'block-seq')\n onError(offset, 'BLOCK_AS_IMPLICIT_KEY', 'A block sequence may not be used as an implicit map key');\n else if ('indent' in key && key.indent !== bm.indent)\n onError(offset, 'BAD_INDENT', startColMsg);\n }\n if (!keyProps.anchor && !keyProps.tag && !sep) {\n commentEnd = keyProps.end;\n if (keyProps.comment) {\n if (map.comment)\n map.comment += '\\n' + keyProps.comment;\n else\n map.comment = keyProps.comment;\n }\n continue;\n }\n if (keyProps.newlineAfterProp || containsNewline(key)) {\n onError(key ?? start[start.length - 1], 'MULTILINE_IMPLICIT_KEY', 'Implicit keys need to be on a single line');\n }\n }\n else if (keyProps.found?.indent !== bm.indent) {\n onError(offset, 'BAD_INDENT', startColMsg);\n }\n // key value\n ctx.atKey = true;\n const keyStart = keyProps.end;\n const keyNode = key\n ? composeNode(ctx, key, keyProps, onError)\n : composeEmptyNode(ctx, keyStart, start, null, keyProps, onError);\n if (ctx.schema.compat)\n flowIndentCheck(bm.indent, key, onError);\n ctx.atKey = false;\n if (mapIncludes(ctx, map.items, keyNode))\n onError(keyStart, 'DUPLICATE_KEY', 'Map keys must be unique');\n // value properties\n const valueProps = resolveProps(sep ?? [], {\n indicator: 'map-value-ind',\n next: value,\n offset: keyNode.range[2],\n onError,\n parentIndent: bm.indent,\n startOnNewline: !key || key.type === 'block-scalar'\n });\n offset = valueProps.end;\n if (valueProps.found) {\n if (implicitKey) {\n if (value?.type === 'block-map' && !valueProps.hasNewline)\n onError(offset, 'BLOCK_AS_IMPLICIT_KEY', 'Nested mappings are not allowed in compact mappings');\n if (ctx.options.strict &&\n keyProps.start < valueProps.found.offset - 1024)\n onError(keyNode.range, 'KEY_OVER_1024_CHARS', 'The : indicator must be at most 1024 chars after the start of an implicit block mapping key');\n }\n // value value\n const valueNode = value\n ? composeNode(ctx, value, valueProps, onError)\n : composeEmptyNode(ctx, offset, sep, null, valueProps, onError);\n if (ctx.schema.compat)\n flowIndentCheck(bm.indent, value, onError);\n offset = valueNode.range[2];\n const pair = new Pair(keyNode, valueNode);\n if (ctx.options.keepSourceTokens)\n pair.srcToken = collItem;\n map.items.push(pair);\n }\n else {\n // key with no value\n if (implicitKey)\n onError(keyNode.range, 'MISSING_CHAR', 'Implicit map keys need to be followed by map values');\n if (valueProps.comment) {\n if (keyNode.comment)\n keyNode.comment += '\\n' + valueProps.comment;\n else\n keyNode.comment = valueProps.comment;\n }\n const pair = new Pair(keyNode);\n if (ctx.options.keepSourceTokens)\n pair.srcToken = collItem;\n map.items.push(pair);\n }\n }\n if (commentEnd && commentEnd < offset)\n onError(commentEnd, 'IMPOSSIBLE', 'Map comment with trailing content');\n map.range = [bm.offset, offset, commentEnd ?? offset];\n return map;\n}\n\nexport { resolveBlockMap };\n","import { YAMLSeq } from '../nodes/YAMLSeq.js';\nimport { resolveProps } from './resolve-props.js';\nimport { flowIndentCheck } from './util-flow-indent-check.js';\n\nfunction resolveBlockSeq({ composeNode, composeEmptyNode }, ctx, bs, onError, tag) {\n const NodeClass = tag?.nodeClass ?? YAMLSeq;\n const seq = new NodeClass(ctx.schema);\n if (ctx.atRoot)\n ctx.atRoot = false;\n if (ctx.atKey)\n ctx.atKey = false;\n let offset = bs.offset;\n let commentEnd = null;\n for (const { start, value } of bs.items) {\n const props = resolveProps(start, {\n indicator: 'seq-item-ind',\n next: value,\n offset,\n onError,\n parentIndent: bs.indent,\n startOnNewline: true\n });\n if (!props.found) {\n if (props.anchor || props.tag || value) {\n if (value && value.type === 'block-seq')\n onError(props.end, 'BAD_INDENT', 'All sequence items must start at the same column');\n else\n onError(offset, 'MISSING_CHAR', 'Sequence item without - indicator');\n }\n else {\n commentEnd = props.end;\n if (props.comment)\n seq.comment = props.comment;\n continue;\n }\n }\n const node = value\n ? composeNode(ctx, value, props, onError)\n : composeEmptyNode(ctx, props.end, start, null, props, onError);\n if (ctx.schema.compat)\n flowIndentCheck(bs.indent, value, onError);\n offset = node.range[2];\n seq.items.push(node);\n }\n seq.range = [bs.offset, offset, commentEnd ?? offset];\n return seq;\n}\n\nexport { resolveBlockSeq };\n","function resolveEnd(end, offset, reqSpace, onError) {\n let comment = '';\n if (end) {\n let hasSpace = false;\n let sep = '';\n for (const token of end) {\n const { source, type } = token;\n switch (type) {\n case 'space':\n hasSpace = true;\n break;\n case 'comment': {\n if (reqSpace && !hasSpace)\n onError(token, 'MISSING_CHAR', 'Comments must be separated from other tokens by white space characters');\n const cb = source.substring(1) || ' ';\n if (!comment)\n comment = cb;\n else\n comment += sep + cb;\n sep = '';\n break;\n }\n case 'newline':\n if (comment)\n sep += source;\n hasSpace = true;\n break;\n default:\n onError(token, 'UNEXPECTED_TOKEN', `Unexpected ${type} at node end`);\n }\n offset += source.length;\n }\n }\n return { comment, offset };\n}\n\nexport { resolveEnd };\n","import { isPair } from '../nodes/identity.js';\nimport { Pair } from '../nodes/Pair.js';\nimport { YAMLMap } from '../nodes/YAMLMap.js';\nimport { YAMLSeq } from '../nodes/YAMLSeq.js';\nimport { resolveEnd } from './resolve-end.js';\nimport { resolveProps } from './resolve-props.js';\nimport { containsNewline } from './util-contains-newline.js';\nimport { mapIncludes } from './util-map-includes.js';\n\nconst blockMsg = 'Block collections are not allowed within flow collections';\nconst isBlock = (token) => token && (token.type === 'block-map' || token.type === 'block-seq');\nfunction resolveFlowCollection({ composeNode, composeEmptyNode }, ctx, fc, onError, tag) {\n const isMap = fc.start.source === '{';\n const fcName = isMap ? 'flow map' : 'flow sequence';\n const NodeClass = (tag?.nodeClass ?? (isMap ? YAMLMap : YAMLSeq));\n const coll = new NodeClass(ctx.schema);\n coll.flow = true;\n const atRoot = ctx.atRoot;\n if (atRoot)\n ctx.atRoot = false;\n if (ctx.atKey)\n ctx.atKey = false;\n let offset = fc.offset + fc.start.source.length;\n for (let i = 0; i < fc.items.length; ++i) {\n const collItem = fc.items[i];\n const { start, key, sep, value } = collItem;\n const props = resolveProps(start, {\n flow: fcName,\n indicator: 'explicit-key-ind',\n next: key ?? sep?.[0],\n offset,\n onError,\n parentIndent: fc.indent,\n startOnNewline: false\n });\n if (!props.found) {\n if (!props.anchor && !props.tag && !sep && !value) {\n if (i === 0 && props.comma)\n onError(props.comma, 'UNEXPECTED_TOKEN', `Unexpected , in ${fcName}`);\n else if (i < fc.items.length - 1)\n onError(props.start, 'UNEXPECTED_TOKEN', `Unexpected empty item in ${fcName}`);\n if (props.comment) {\n if (coll.comment)\n coll.comment += '\\n' + props.comment;\n else\n coll.comment = props.comment;\n }\n offset = props.end;\n continue;\n }\n if (!isMap && ctx.options.strict && containsNewline(key))\n onError(key, // checked by containsNewline()\n 'MULTILINE_IMPLICIT_KEY', 'Implicit keys of flow sequence pairs need to be on a single line');\n }\n if (i === 0) {\n if (props.comma)\n onError(props.comma, 'UNEXPECTED_TOKEN', `Unexpected , in ${fcName}`);\n }\n else {\n if (!props.comma)\n onError(props.start, 'MISSING_CHAR', `Missing , between ${fcName} items`);\n if (props.comment) {\n let prevItemComment = '';\n loop: for (const st of start) {\n switch (st.type) {\n case 'comma':\n case 'space':\n break;\n case 'comment':\n prevItemComment = st.source.substring(1);\n break loop;\n default:\n break loop;\n }\n }\n if (prevItemComment) {\n let prev = coll.items[coll.items.length - 1];\n if (isPair(prev))\n prev = prev.value ?? prev.key;\n if (prev.comment)\n prev.comment += '\\n' + prevItemComment;\n else\n prev.comment = prevItemComment;\n props.comment = props.comment.substring(prevItemComment.length + 1);\n }\n }\n }\n if (!isMap && !sep && !props.found) {\n // item is a value in a seq\n // → key & sep are empty, start does not include ? or :\n const valueNode = value\n ? composeNode(ctx, value, props, onError)\n : composeEmptyNode(ctx, props.end, sep, null, props, onError);\n coll.items.push(valueNode);\n offset = valueNode.range[2];\n if (isBlock(value))\n onError(valueNode.range, 'BLOCK_IN_FLOW', blockMsg);\n }\n else {\n // item is a key+value pair\n // key value\n ctx.atKey = true;\n const keyStart = props.end;\n const keyNode = key\n ? composeNode(ctx, key, props, onError)\n : composeEmptyNode(ctx, keyStart, start, null, props, onError);\n if (isBlock(key))\n onError(keyNode.range, 'BLOCK_IN_FLOW', blockMsg);\n ctx.atKey = false;\n // value properties\n const valueProps = resolveProps(sep ?? [], {\n flow: fcName,\n indicator: 'map-value-ind',\n next: value,\n offset: keyNode.range[2],\n onError,\n parentIndent: fc.indent,\n startOnNewline: false\n });\n if (valueProps.found) {\n if (!isMap && !props.found && ctx.options.strict) {\n if (sep)\n for (const st of sep) {\n if (st === valueProps.found)\n break;\n if (st.type === 'newline') {\n onError(st, 'MULTILINE_IMPLICIT_KEY', 'Implicit keys of flow sequence pairs need to be on a single line');\n break;\n }\n }\n if (props.start < valueProps.found.offset - 1024)\n onError(valueProps.found, 'KEY_OVER_1024_CHARS', 'The : indicator must be at most 1024 chars after the start of an implicit flow sequence key');\n }\n }\n else if (value) {\n if ('source' in value && value.source && value.source[0] === ':')\n onError(value, 'MISSING_CHAR', `Missing space after : in ${fcName}`);\n else\n onError(valueProps.start, 'MISSING_CHAR', `Missing , or : between ${fcName} items`);\n }\n // value value\n const valueNode = value\n ? composeNode(ctx, value, valueProps, onError)\n : valueProps.found\n ? composeEmptyNode(ctx, valueProps.end, sep, null, valueProps, onError)\n : null;\n if (valueNode) {\n if (isBlock(value))\n onError(valueNode.range, 'BLOCK_IN_FLOW', blockMsg);\n }\n else if (valueProps.comment) {\n if (keyNode.comment)\n keyNode.comment += '\\n' + valueProps.comment;\n else\n keyNode.comment = valueProps.comment;\n }\n const pair = new Pair(keyNode, valueNode);\n if (ctx.options.keepSourceTokens)\n pair.srcToken = collItem;\n if (isMap) {\n const map = coll;\n if (mapIncludes(ctx, map.items, keyNode))\n onError(keyStart, 'DUPLICATE_KEY', 'Map keys must be unique');\n map.items.push(pair);\n }\n else {\n const map = new YAMLMap(ctx.schema);\n map.flow = true;\n map.items.push(pair);\n const endRange = (valueNode ?? keyNode).range;\n map.range = [keyNode.range[0], endRange[1], endRange[2]];\n coll.items.push(map);\n }\n offset = valueNode ? valueNode.range[2] : valueProps.end;\n }\n }\n const expectedEnd = isMap ? '}' : ']';\n const [ce, ...ee] = fc.end;\n let cePos = offset;\n if (ce && ce.source === expectedEnd)\n cePos = ce.offset + ce.source.length;\n else {\n const name = fcName[0].toUpperCase() + fcName.substring(1);\n const msg = atRoot\n ? `${name} must end with a ${expectedEnd}`\n : `${name} in block collection must be sufficiently indented and end with a ${expectedEnd}`;\n onError(offset, atRoot ? 'MISSING_CHAR' : 'BAD_INDENT', msg);\n if (ce && ce.source.length !== 1)\n ee.unshift(ce);\n }\n if (ee.length > 0) {\n const end = resolveEnd(ee, cePos, ctx.options.strict, onError);\n if (end.comment) {\n if (coll.comment)\n coll.comment += '\\n' + end.comment;\n else\n coll.comment = end.comment;\n }\n coll.range = [fc.offset, cePos, end.offset];\n }\n else {\n coll.range = [fc.offset, cePos, cePos];\n }\n return coll;\n}\n\nexport { resolveFlowCollection };\n","import { isNode } from '../nodes/identity.js';\nimport { Scalar } from '../nodes/Scalar.js';\nimport { YAMLMap } from '../nodes/YAMLMap.js';\nimport { YAMLSeq } from '../nodes/YAMLSeq.js';\nimport { resolveBlockMap } from './resolve-block-map.js';\nimport { resolveBlockSeq } from './resolve-block-seq.js';\nimport { resolveFlowCollection } from './resolve-flow-collection.js';\n\nfunction resolveCollection(CN, ctx, token, onError, tagName, tag) {\n const coll = token.type === 'block-map'\n ? resolveBlockMap(CN, ctx, token, onError, tag)\n : token.type === 'block-seq'\n ? resolveBlockSeq(CN, ctx, token, onError, tag)\n : resolveFlowCollection(CN, ctx, token, onError, tag);\n const Coll = coll.constructor;\n // If we got a tagName matching the class, or the tag name is '!',\n // then use the tagName from the node class used to create it.\n if (tagName === '!' || tagName === Coll.tagName) {\n coll.tag = Coll.tagName;\n return coll;\n }\n if (tagName)\n coll.tag = tagName;\n return coll;\n}\nfunction composeCollection(CN, ctx, token, props, onError) {\n const tagToken = props.tag;\n const tagName = !tagToken\n ? null\n : ctx.directives.tagName(tagToken.source, msg => onError(tagToken, 'TAG_RESOLVE_FAILED', msg));\n if (token.type === 'block-seq') {\n const { anchor, newlineAfterProp: nl } = props;\n const lastProp = anchor && tagToken\n ? anchor.offset > tagToken.offset\n ? anchor\n : tagToken\n : (anchor ?? tagToken);\n if (lastProp && (!nl || nl.offset < lastProp.offset)) {\n const message = 'Missing newline after block sequence props';\n onError(lastProp, 'MISSING_CHAR', message);\n }\n }\n const expType = token.type === 'block-map'\n ? 'map'\n : token.type === 'block-seq'\n ? 'seq'\n : token.start.source === '{'\n ? 'map'\n : 'seq';\n // shortcut: check if it's a generic YAMLMap or YAMLSeq\n // before jumping into the custom tag logic.\n if (!tagToken ||\n !tagName ||\n tagName === '!' ||\n (tagName === YAMLMap.tagName && expType === 'map') ||\n (tagName === YAMLSeq.tagName && expType === 'seq')) {\n return resolveCollection(CN, ctx, token, onError, tagName);\n }\n let tag = ctx.schema.tags.find(t => t.tag === tagName && t.collection === expType);\n if (!tag) {\n const kt = ctx.schema.knownTags[tagName];\n if (kt && kt.collection === expType) {\n ctx.schema.tags.push(Object.assign({}, kt, { default: false }));\n tag = kt;\n }\n else {\n if (kt) {\n onError(tagToken, 'BAD_COLLECTION_TYPE', `${kt.tag} used for ${expType} collection, but expects ${kt.collection ?? 'scalar'}`, true);\n }\n else {\n onError(tagToken, 'TAG_RESOLVE_FAILED', `Unresolved tag: ${tagName}`, true);\n }\n return resolveCollection(CN, ctx, token, onError, tagName);\n }\n }\n const coll = resolveCollection(CN, ctx, token, onError, tagName, tag);\n const res = tag.resolve?.(coll, msg => onError(tagToken, 'TAG_RESOLVE_FAILED', msg), ctx.options) ?? coll;\n const node = isNode(res)\n ? res\n : new Scalar(res);\n node.range = coll.range;\n node.tag = tagName;\n if (tag?.format)\n node.format = tag.format;\n return node;\n}\n\nexport { composeCollection };\n","import { Scalar } from '../nodes/Scalar.js';\n\nfunction resolveBlockScalar(ctx, scalar, onError) {\n const start = scalar.offset;\n const header = parseBlockScalarHeader(scalar, ctx.options.strict, onError);\n if (!header)\n return { value: '', type: null, comment: '', range: [start, start, start] };\n const type = header.mode === '>' ? Scalar.BLOCK_FOLDED : Scalar.BLOCK_LITERAL;\n const lines = scalar.source ? splitLines(scalar.source) : [];\n // determine the end of content & start of chomping\n let chompStart = lines.length;\n for (let i = lines.length - 1; i >= 0; --i) {\n const content = lines[i][1];\n if (content === '' || content === '\\r')\n chompStart = i;\n else\n break;\n }\n // shortcut for empty contents\n if (chompStart === 0) {\n const value = header.chomp === '+' && lines.length > 0\n ? '\\n'.repeat(Math.max(1, lines.length - 1))\n : '';\n let end = start + header.length;\n if (scalar.source)\n end += scalar.source.length;\n return { value, type, comment: header.comment, range: [start, end, end] };\n }\n // find the indentation level to trim from start\n let trimIndent = scalar.indent + header.indent;\n let offset = scalar.offset + header.length;\n let contentStart = 0;\n for (let i = 0; i < chompStart; ++i) {\n const [indent, content] = lines[i];\n if (content === '' || content === '\\r') {\n if (header.indent === 0 && indent.length > trimIndent)\n trimIndent = indent.length;\n }\n else {\n if (indent.length < trimIndent) {\n const message = 'Block scalars with more-indented leading empty lines must use an explicit indentation indicator';\n onError(offset + indent.length, 'MISSING_CHAR', message);\n }\n if (header.indent === 0)\n trimIndent = indent.length;\n contentStart = i;\n if (trimIndent === 0 && !ctx.atRoot) {\n const message = 'Block scalar values in collections must be indented';\n onError(offset, 'BAD_INDENT', message);\n }\n break;\n }\n offset += indent.length + content.length + 1;\n }\n // include trailing more-indented empty lines in content\n for (let i = lines.length - 1; i >= chompStart; --i) {\n if (lines[i][0].length > trimIndent)\n chompStart = i + 1;\n }\n let value = '';\n let sep = '';\n let prevMoreIndented = false;\n // leading whitespace is kept intact\n for (let i = 0; i < contentStart; ++i)\n value += lines[i][0].slice(trimIndent) + '\\n';\n for (let i = contentStart; i < chompStart; ++i) {\n let [indent, content] = lines[i];\n offset += indent.length + content.length + 1;\n const crlf = content[content.length - 1] === '\\r';\n if (crlf)\n content = content.slice(0, -1);\n /* istanbul ignore if already caught in lexer */\n if (content && indent.length < trimIndent) {\n const src = header.indent\n ? 'explicit indentation indicator'\n : 'first line';\n const message = `Block scalar lines must not be less indented than their ${src}`;\n onError(offset - content.length - (crlf ? 2 : 1), 'BAD_INDENT', message);\n indent = '';\n }\n if (type === Scalar.BLOCK_LITERAL) {\n value += sep + indent.slice(trimIndent) + content;\n sep = '\\n';\n }\n else if (indent.length > trimIndent || content[0] === '\\t') {\n // more-indented content within a folded block\n if (sep === ' ')\n sep = '\\n';\n else if (!prevMoreIndented && sep === '\\n')\n sep = '\\n\\n';\n value += sep + indent.slice(trimIndent) + content;\n sep = '\\n';\n prevMoreIndented = true;\n }\n else if (content === '') {\n // empty line\n if (sep === '\\n')\n value += '\\n';\n else\n sep = '\\n';\n }\n else {\n value += sep + content;\n sep = ' ';\n prevMoreIndented = false;\n }\n }\n switch (header.chomp) {\n case '-':\n break;\n case '+':\n for (let i = chompStart; i < lines.length; ++i)\n value += '\\n' + lines[i][0].slice(trimIndent);\n if (value[value.length - 1] !== '\\n')\n value += '\\n';\n break;\n default:\n value += '\\n';\n }\n const end = start + header.length + scalar.source.length;\n return { value, type, comment: header.comment, range: [start, end, end] };\n}\nfunction parseBlockScalarHeader({ offset, props }, strict, onError) {\n /* istanbul ignore if should not happen */\n if (props[0].type !== 'block-scalar-header') {\n onError(props[0], 'IMPOSSIBLE', 'Block scalar header not found');\n return null;\n }\n const { source } = props[0];\n const mode = source[0];\n let indent = 0;\n let chomp = '';\n let error = -1;\n for (let i = 1; i < source.length; ++i) {\n const ch = source[i];\n if (!chomp && (ch === '-' || ch === '+'))\n chomp = ch;\n else {\n const n = Number(ch);\n if (!indent && n)\n indent = n;\n else if (error === -1)\n error = offset + i;\n }\n }\n if (error !== -1)\n onError(error, 'UNEXPECTED_TOKEN', `Block scalar header includes extra characters: ${source}`);\n let hasSpace = false;\n let comment = '';\n let length = source.length;\n for (let i = 1; i < props.length; ++i) {\n const token = props[i];\n switch (token.type) {\n case 'space':\n hasSpace = true;\n // fallthrough\n case 'newline':\n length += token.source.length;\n break;\n case 'comment':\n if (strict && !hasSpace) {\n const message = 'Comments must be separated from other tokens by white space characters';\n onError(token, 'MISSING_CHAR', message);\n }\n length += token.source.length;\n comment = token.source.substring(1);\n break;\n case 'error':\n onError(token, 'UNEXPECTED_TOKEN', token.message);\n length += token.source.length;\n break;\n /* istanbul ignore next should not happen */\n default: {\n const message = `Unexpected token in block scalar header: ${token.type}`;\n onError(token, 'UNEXPECTED_TOKEN', message);\n const ts = token.source;\n if (ts && typeof ts === 'string')\n length += ts.length;\n }\n }\n }\n return { mode, indent, chomp, comment, length };\n}\n/** @returns Array of lines split up as `[indent, content]` */\nfunction splitLines(source) {\n const split = source.split(/\\n( *)/);\n const first = split[0];\n const m = first.match(/^( *)/);\n const line0 = m?.[1]\n ? [m[1], first.slice(m[1].length)]\n : ['', first];\n const lines = [line0];\n for (let i = 1; i < split.length; i += 2)\n lines.push([split[i], split[i + 1]]);\n return lines;\n}\n\nexport { resolveBlockScalar };\n","import { Scalar } from '../nodes/Scalar.js';\nimport { resolveEnd } from './resolve-end.js';\n\nfunction resolveFlowScalar(scalar, strict, onError) {\n const { offset, type, source, end } = scalar;\n let _type;\n let value;\n const _onError = (rel, code, msg) => onError(offset + rel, code, msg);\n switch (type) {\n case 'scalar':\n _type = Scalar.PLAIN;\n value = plainValue(source, _onError);\n break;\n case 'single-quoted-scalar':\n _type = Scalar.QUOTE_SINGLE;\n value = singleQuotedValue(source, _onError);\n break;\n case 'double-quoted-scalar':\n _type = Scalar.QUOTE_DOUBLE;\n value = doubleQuotedValue(source, _onError);\n break;\n /* istanbul ignore next should not happen */\n default:\n onError(scalar, 'UNEXPECTED_TOKEN', `Expected a flow scalar value, but found: ${type}`);\n return {\n value: '',\n type: null,\n comment: '',\n range: [offset, offset + source.length, offset + source.length]\n };\n }\n const valueEnd = offset + source.length;\n const re = resolveEnd(end, valueEnd, strict, onError);\n return {\n value,\n type: _type,\n comment: re.comment,\n range: [offset, valueEnd, re.offset]\n };\n}\nfunction plainValue(source, onError) {\n let badChar = '';\n switch (source[0]) {\n /* istanbul ignore next should not happen */\n case '\\t':\n badChar = 'a tab character';\n break;\n case ',':\n badChar = 'flow indicator character ,';\n break;\n case '%':\n badChar = 'directive indicator character %';\n break;\n case '|':\n case '>': {\n badChar = `block scalar indicator ${source[0]}`;\n break;\n }\n case '@':\n case '`': {\n badChar = `reserved character ${source[0]}`;\n break;\n }\n }\n if (badChar)\n onError(0, 'BAD_SCALAR_START', `Plain value cannot start with ${badChar}`);\n return foldLines(source);\n}\nfunction singleQuotedValue(source, onError) {\n if (source[source.length - 1] !== \"'\" || source.length === 1)\n onError(source.length, 'MISSING_CHAR', \"Missing closing 'quote\");\n return foldLines(source.slice(1, -1)).replace(/''/g, \"'\");\n}\nfunction foldLines(source) {\n /**\n * The negative lookbehind here and in the `re` RegExp is to\n * prevent causing a polynomial search time in certain cases.\n *\n * The try-catch is for Safari, which doesn't support this yet:\n * https://caniuse.com/js-regexp-lookbehind\n */\n let first, line;\n try {\n first = new RegExp('(.*?)(?<![ \\t])[ \\t]*\\r?\\n', 'sy');\n line = new RegExp('[ \\t]*(.*?)(?:(?<![ \\t])[ \\t]*)?\\r?\\n', 'sy');\n }\n catch {\n first = /(.*?)[ \\t]*\\r?\\n/sy;\n line = /[ \\t]*(.*?)[ \\t]*\\r?\\n/sy;\n }\n let match = first.exec(source);\n if (!match)\n return source;\n let res = match[1];\n let sep = ' ';\n let pos = first.lastIndex;\n line.lastIndex = pos;\n while ((match = line.exec(source))) {\n if (match[1] === '') {\n if (sep === '\\n')\n res += sep;\n else\n sep = '\\n';\n }\n else {\n res += sep + match[1];\n sep = ' ';\n }\n pos = line.lastIndex;\n }\n const last = /[ \\t]*(.*)/sy;\n last.lastIndex = pos;\n match = last.exec(source);\n return res + sep + (match?.[1] ?? '');\n}\nfunction doubleQuotedValue(source, onError) {\n let res = '';\n for (let i = 1; i < source.length - 1; ++i) {\n const ch = source[i];\n if (ch === '\\r' && source[i + 1] === '\\n')\n continue;\n if (ch === '\\n') {\n const { fold, offset } = foldNewline(source, i);\n res += fold;\n i = offset;\n }\n else if (ch === '\\\\') {\n let next = source[++i];\n const cc = escapeCodes[next];\n if (cc)\n res += cc;\n else if (next === '\\n') {\n // skip escaped newlines, but still trim the following line\n next = source[i + 1];\n while (next === ' ' || next === '\\t')\n next = source[++i + 1];\n }\n else if (next === '\\r' && source[i + 1] === '\\n') {\n // skip escaped CRLF newlines, but still trim the following line\n next = source[++i + 1];\n while (next === ' ' || next === '\\t')\n next = source[++i + 1];\n }\n else if (next === 'x' || next === 'u' || next === 'U') {\n const length = { x: 2, u: 4, U: 8 }[next];\n res += parseCharCode(source, i + 1, length, onError);\n i += length;\n }\n else {\n const raw = source.substr(i - 1, 2);\n onError(i - 1, 'BAD_DQ_ESCAPE', `Invalid escape sequence ${raw}`);\n res += raw;\n }\n }\n else if (ch === ' ' || ch === '\\t') {\n // trim trailing whitespace\n const wsStart = i;\n let next = source[i + 1];\n while (next === ' ' || next === '\\t')\n next = source[++i + 1];\n if (next !== '\\n' && !(next === '\\r' && source[i + 2] === '\\n'))\n res += i > wsStart ? source.slice(wsStart, i + 1) : ch;\n }\n else {\n res += ch;\n }\n }\n if (source[source.length - 1] !== '\"' || source.length === 1)\n onError(source.length, 'MISSING_CHAR', 'Missing closing \"quote');\n return res;\n}\n/**\n * Fold a single newline into a space, multiple newlines to N - 1 newlines.\n * Presumes `source[offset] === '\\n'`\n */\nfunction foldNewline(source, offset) {\n let fold = '';\n let ch = source[offset + 1];\n while (ch === ' ' || ch === '\\t' || ch === '\\n' || ch === '\\r') {\n if (ch === '\\r' && source[offset + 2] !== '\\n')\n break;\n if (ch === '\\n')\n fold += '\\n';\n offset += 1;\n ch = source[offset + 1];\n }\n if (!fold)\n fold = ' ';\n return { fold, offset };\n}\nconst escapeCodes = {\n '0': '\\0', // null character\n a: '\\x07', // bell character\n b: '\\b', // backspace\n e: '\\x1b', // escape character\n f: '\\f', // form feed\n n: '\\n', // line feed\n r: '\\r', // carriage return\n t: '\\t', // horizontal tab\n v: '\\v', // vertical tab\n N: '\\u0085', // Unicode next line\n _: '\\u00a0', // Unicode non-breaking space\n L: '\\u2028', // Unicode line separator\n P: '\\u2029', // Unicode paragraph separator\n ' ': ' ',\n '\"': '\"',\n '/': '/',\n '\\\\': '\\\\',\n '\\t': '\\t'\n};\nfunction parseCharCode(source, offset, length, onError) {\n const cc = source.substr(offset, length);\n const ok = cc.length === length && /^[0-9a-fA-F]+$/.test(cc);\n const code = ok ? parseInt(cc, 16) : NaN;\n if (isNaN(code)) {\n const raw = source.substr(offset - 2, length + 2);\n onError(offset - 2, 'BAD_DQ_ESCAPE', `Invalid escape sequence ${raw}`);\n return raw;\n }\n return String.fromCodePoint(code);\n}\n\nexport { resolveFlowScalar };\n","import { isScalar, SCALAR } from '../nodes/identity.js';\nimport { Scalar } from '../nodes/Scalar.js';\nimport { resolveBlockScalar } from './resolve-block-scalar.js';\nimport { resolveFlowScalar } from './resolve-flow-scalar.js';\n\nfunction composeScalar(ctx, token, tagToken, onError) {\n const { value, type, comment, range } = token.type === 'block-scalar'\n ? resolveBlockScalar(ctx, token, onError)\n : resolveFlowScalar(token, ctx.options.strict, onError);\n const tagName = tagToken\n ? ctx.directives.tagName(tagToken.source, msg => onError(tagToken, 'TAG_RESOLVE_FAILED', msg))\n : null;\n let tag;\n if (ctx.options.stringKeys && ctx.atKey) {\n tag = ctx.schema[SCALAR];\n }\n else if (tagName)\n tag = findScalarTagByName(ctx.schema, value, tagName, tagToken, onError);\n else if (token.type === 'scalar')\n tag = findScalarTagByTest(ctx, value, token, onError);\n else\n tag = ctx.schema[SCALAR];\n let scalar;\n try {\n const res = tag.resolve(value, msg => onError(tagToken ?? token, 'TAG_RESOLVE_FAILED', msg), ctx.options);\n scalar = isScalar(res) ? res : new Scalar(res);\n }\n catch (error) {\n const msg = error instanceof Error ? error.message : String(error);\n onError(tagToken ?? token, 'TAG_RESOLVE_FAILED', msg);\n scalar = new Scalar(value);\n }\n scalar.range = range;\n scalar.source = value;\n if (type)\n scalar.type = type;\n if (tagName)\n scalar.tag = tagName;\n if (tag.format)\n scalar.format = tag.format;\n if (comment)\n scalar.comment = comment;\n return scalar;\n}\nfunction findScalarTagByName(schema, value, tagName, tagToken, onError) {\n if (tagName === '!')\n return schema[SCALAR]; // non-specific tag\n const matchWithTest = [];\n for (const tag of schema.tags) {\n if (!tag.collection && tag.tag === tagName) {\n if (tag.default && tag.test)\n matchWithTest.push(tag);\n else\n return tag;\n }\n }\n for (const tag of matchWithTest)\n if (tag.test?.test(value))\n return tag;\n const kt = schema.knownTags[tagName];\n if (kt && !kt.collection) {\n // Ensure that the known tag is available for stringifying,\n // but does not get used by default.\n schema.tags.push(Object.assign({}, kt, { default: false, test: undefined }));\n return kt;\n }\n onError(tagToken, 'TAG_RESOLVE_FAILED', `Unresolved tag: ${tagName}`, tagName !== 'tag:yaml.org,2002:str');\n return schema[SCALAR];\n}\nfunction findScalarTagByTest({ atKey, directives, schema }, value, token, onError) {\n const tag = schema.tags.find(tag => (tag.default === true || (atKey && tag.default === 'key')) &&\n tag.test?.test(value)) || schema[SCALAR];\n if (schema.compat) {\n const compat = schema.compat.find(tag => tag.default && tag.test?.test(value)) ??\n schema[SCALAR];\n if (tag.tag !== compat.tag) {\n const ts = directives.tagString(tag.tag);\n const cs = directives.tagString(compat.tag);\n const msg = `Value may be parsed as either ${ts} or ${cs}`;\n onError(token, 'TAG_RESOLVE_FAILED', msg, true);\n }\n }\n return tag;\n}\n\nexport { composeScalar };\n","function emptyScalarPosition(offset, before, pos) {\n if (before) {\n pos ?? (pos = before.length);\n for (let i = pos - 1; i >= 0; --i) {\n let st = before[i];\n switch (st.type) {\n case 'space':\n case 'comment':\n case 'newline':\n offset -= st.source.length;\n continue;\n }\n // Technically, an empty scalar is immediately after the last non-empty\n // node, but it's more useful to place it after any whitespace.\n st = before[++i];\n while (st?.type === 'space') {\n offset += st.source.length;\n st = before[++i];\n }\n break;\n }\n }\n return offset;\n}\n\nexport { emptyScalarPosition };\n","import { Alias } from '../nodes/Alias.js';\nimport { isScalar } from '../nodes/identity.js';\nimport { composeCollection } from './compose-collection.js';\nimport { composeScalar } from './compose-scalar.js';\nimport { resolveEnd } from './resolve-end.js';\nimport { emptyScalarPosition } from './util-empty-scalar-position.js';\n\nconst CN = { composeNode, composeEmptyNode };\nfunction composeNode(ctx, token, props, onError) {\n const atKey = ctx.atKey;\n const { spaceBefore, comment, anchor, tag } = props;\n let node;\n let isSrcToken = true;\n switch (token.type) {\n case 'alias':\n node = composeAlias(ctx, token, onError);\n if (anchor || tag)\n onError(token, 'ALIAS_PROPS', 'An alias node must not specify any properties');\n break;\n case 'scalar':\n case 'single-quoted-scalar':\n case 'double-quoted-scalar':\n case 'block-scalar':\n node = composeScalar(ctx, token, tag, onError);\n if (anchor)\n node.anchor = anchor.source.substring(1);\n break;\n case 'block-map':\n case 'block-seq':\n case 'flow-collection':\n node = composeCollection(CN, ctx, token, props, onError);\n if (anchor)\n node.anchor = anchor.source.substring(1);\n break;\n default: {\n const message = token.type === 'error'\n ? token.message\n : `Unsupported token (type: ${token.type})`;\n onError(token, 'UNEXPECTED_TOKEN', message);\n node = composeEmptyNode(ctx, token.offset, undefined, null, props, onError);\n isSrcToken = false;\n }\n }\n if (anchor && node.anchor === '')\n onError(anchor, 'BAD_ALIAS', 'Anchor cannot be an empty string');\n if (atKey &&\n ctx.options.stringKeys &&\n (!isScalar(node) ||\n typeof node.value !== 'string' ||\n (node.tag && node.tag !== 'tag:yaml.org,2002:str'))) {\n const msg = 'With stringKeys, all keys must be strings';\n onError(tag ?? token, 'NON_STRING_KEY', msg);\n }\n if (spaceBefore)\n node.spaceBefore = true;\n if (comment) {\n if (token.type === 'scalar' && token.source === '')\n node.comment = comment;\n else\n node.commentBefore = comment;\n }\n // @ts-expect-error Type checking misses meaning of isSrcToken\n if (ctx.options.keepSourceTokens && isSrcToken)\n node.srcToken = token;\n return node;\n}\nfunction composeEmptyNode(ctx, offset, before, pos, { spaceBefore, comment, anchor, tag, end }, onError) {\n const token = {\n type: 'scalar',\n offset: emptyScalarPosition(offset, before, pos),\n indent: -1,\n source: ''\n };\n const node = composeScalar(ctx, token, tag, onError);\n if (anchor) {\n node.anchor = anchor.source.substring(1);\n if (node.anchor === '')\n onError(anchor, 'BAD_ALIAS', 'Anchor cannot be an empty string');\n }\n if (spaceBefore)\n node.spaceBefore = true;\n if (comment) {\n node.comment = comment;\n node.range[2] = end;\n }\n return node;\n}\nfunction composeAlias({ options }, { offset, source, end }, onError) {\n const alias = new Alias(source.substring(1));\n if (alias.source === '')\n onError(offset, 'BAD_ALIAS', 'Alias cannot be an empty string');\n if (alias.source.endsWith(':'))\n onError(offset + source.length - 1, 'BAD_ALIAS', 'Alias ending in : is ambiguous', true);\n const valueEnd = offset + source.length;\n const re = resolveEnd(end, valueEnd, options.strict, onError);\n alias.range = [offset, valueEnd, re.offset];\n if (re.comment)\n alias.comment = re.comment;\n return alias;\n}\n\nexport { composeEmptyNode, composeNode };\n","import { Document } from '../doc/Document.js';\nimport { composeNode, composeEmptyNode } from './compose-node.js';\nimport { resolveEnd } from './resolve-end.js';\nimport { resolveProps } from './resolve-props.js';\n\nfunction composeDoc(options, directives, { offset, start, value, end }, onError) {\n const opts = Object.assign({ _directives: directives }, options);\n const doc = new Document(undefined, opts);\n const ctx = {\n atKey: false,\n atRoot: true,\n directives: doc.directives,\n options: doc.options,\n schema: doc.schema\n };\n const props = resolveProps(start, {\n indicator: 'doc-start',\n next: value ?? end?.[0],\n offset,\n onError,\n parentIndent: 0,\n startOnNewline: true\n });\n if (props.found) {\n doc.directives.docStart = true;\n if (value &&\n (value.type === 'block-map' || value.type === 'block-seq') &&\n !props.hasNewline)\n onError(props.end, 'MISSING_CHAR', 'Block collection cannot start on same line with directives-end marker');\n }\n // @ts-expect-error If Contents is set, let's trust the user\n doc.contents = value\n ? composeNode(ctx, value, props, onError)\n : composeEmptyNode(ctx, props.end, start, null, props, onError);\n const contentEnd = doc.contents.range[2];\n const re = resolveEnd(end, contentEnd, false, onError);\n if (re.comment)\n doc.comment = re.comment;\n doc.range = [offset, contentEnd, re.offset];\n return doc;\n}\n\nexport { composeDoc };\n","import { Directives } from '../doc/directives.js';\nimport { Document } from '../doc/Document.js';\nimport { YAMLWarning, YAMLParseError } from '../errors.js';\nimport { isCollection, isPair } from '../nodes/identity.js';\nimport { composeDoc } from './compose-doc.js';\nimport { resolveEnd } from './resolve-end.js';\n\nfunction getErrorPos(src) {\n if (typeof src === 'number')\n return [src, src + 1];\n if (Array.isArray(src))\n return src.length === 2 ? src : [src[0], src[1]];\n const { offset, source } = src;\n return [offset, offset + (typeof source === 'string' ? source.length : 1)];\n}\nfunction parsePrelude(prelude) {\n let comment = '';\n let atComment = false;\n let afterEmptyLine = false;\n for (let i = 0; i < prelude.length; ++i) {\n const source = prelude[i];\n switch (source[0]) {\n case '#':\n comment +=\n (comment === '' ? '' : afterEmptyLine ? '\\n\\n' : '\\n') +\n (source.substring(1) || ' ');\n atComment = true;\n afterEmptyLine = false;\n break;\n case '%':\n if (prelude[i + 1]?.[0] !== '#')\n i += 1;\n atComment = false;\n break;\n default:\n // This may be wrong after doc-end, but in that case it doesn't matter\n if (!atComment)\n afterEmptyLine = true;\n atComment = false;\n }\n }\n return { comment, afterEmptyLine };\n}\n/**\n * Compose a stream of CST nodes into a stream of YAML Documents.\n *\n * ```ts\n * import { Composer, Parser } from 'yaml'\n *\n * const src: string = ...\n * const tokens = new Parser().parse(src)\n * const docs = new Composer().compose(tokens)\n * ```\n */\nclass Composer {\n constructor(options = {}) {\n this.doc = null;\n this.atDirectives = false;\n this.prelude = [];\n this.errors = [];\n this.warnings = [];\n this.onError = (source, code, message, warning) => {\n const pos = getErrorPos(source);\n if (warning)\n this.warnings.push(new YAMLWarning(pos, code, message));\n else\n this.errors.push(new YAMLParseError(pos, code, message));\n };\n // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing\n this.directives = new Directives({ version: options.version || '1.2' });\n this.options = options;\n }\n decorate(doc, afterDoc) {\n const { comment, afterEmptyLine } = parsePrelude(this.prelude);\n //console.log({ dc: doc.comment, prelude, comment })\n if (comment) {\n const dc = doc.contents;\n if (afterDoc) {\n doc.comment = doc.comment ? `${doc.comment}\\n${comment}` : comment;\n }\n else if (afterEmptyLine || doc.directives.docStart || !dc) {\n doc.commentBefore = comment;\n }\n else if (isCollection(dc) && !dc.flow && dc.items.length > 0) {\n let it = dc.items[0];\n if (isPair(it))\n it = it.key;\n const cb = it.commentBefore;\n it.commentBefore = cb ? `${comment}\\n${cb}` : comment;\n }\n else {\n const cb = dc.commentBefore;\n dc.commentBefore = cb ? `${comment}\\n${cb}` : comment;\n }\n }\n if (afterDoc) {\n Array.prototype.push.apply(doc.errors, this.errors);\n Array.prototype.push.apply(doc.warnings, this.warnings);\n }\n else {\n doc.errors = this.errors;\n doc.warnings = this.warnings;\n }\n this.prelude = [];\n this.errors = [];\n this.warnings = [];\n }\n /**\n * Current stream status information.\n *\n * Mostly useful at the end of input for an empty stream.\n */\n streamInfo() {\n return {\n comment: parsePrelude(this.prelude).comment,\n directives: this.directives,\n errors: this.errors,\n warnings: this.warnings\n };\n }\n /**\n * Compose tokens into documents.\n *\n * @param forceDoc - If the stream contains no document, still emit a final document including any comments and directives that would be applied to a subsequent document.\n * @param endOffset - Should be set if `forceDoc` is also set, to set the document range end and to indicate errors correctly.\n */\n *compose(tokens, forceDoc = false, endOffset = -1) {\n for (const token of tokens)\n yield* this.next(token);\n yield* this.end(forceDoc, endOffset);\n }\n /** Advance the composer by one CST token. */\n *next(token) {\n switch (token.type) {\n case 'directive':\n this.directives.add(token.source, (offset, message, warning) => {\n const pos = getErrorPos(token);\n pos[0] += offset;\n this.onError(pos, 'BAD_DIRECTIVE', message, warning);\n });\n this.prelude.push(token.source);\n this.atDirectives = true;\n break;\n case 'document': {\n const doc = composeDoc(this.options, this.directives, token, this.onError);\n if (this.atDirectives && !doc.directives.docStart)\n this.onError(token, 'MISSING_CHAR', 'Missing directives-end/doc-start indicator line');\n this.decorate(doc, false);\n if (this.doc)\n yield this.doc;\n this.doc = doc;\n this.atDirectives = false;\n break;\n }\n case 'byte-order-mark':\n case 'space':\n break;\n case 'comment':\n case 'newline':\n this.prelude.push(token.source);\n break;\n case 'error': {\n const msg = token.source\n ? `${token.message}: ${JSON.stringify(token.source)}`\n : token.message;\n const error = new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', msg);\n if (this.atDirectives || !this.doc)\n this.errors.push(error);\n else\n this.doc.errors.push(error);\n break;\n }\n case 'doc-end': {\n if (!this.doc) {\n const msg = 'Unexpected doc-end without preceding document';\n this.errors.push(new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', msg));\n break;\n }\n this.doc.directives.docEnd = true;\n const end = resolveEnd(token.end, token.offset + token.source.length, this.doc.options.strict, this.onError);\n this.decorate(this.doc, true);\n if (end.comment) {\n const dc = this.doc.comment;\n this.doc.comment = dc ? `${dc}\\n${end.comment}` : end.comment;\n }\n this.doc.range[2] = end.offset;\n break;\n }\n default:\n this.errors.push(new YAMLParseError(getErrorPos(token), 'UNEXPECTED_TOKEN', `Unsupported token ${token.type}`));\n }\n }\n /**\n * Call at end of input to yield any remaining document.\n *\n * @param forceDoc - If the stream contains no document, still emit a final document including any comments and directives that would be applied to a subsequent document.\n * @param endOffset - Should be set if `forceDoc` is also set, to set the document range end and to indicate errors correctly.\n */\n *end(forceDoc = false, endOffset = -1) {\n if (this.doc) {\n this.decorate(this.doc, true);\n yield this.doc;\n this.doc = null;\n }\n else if (forceDoc) {\n const opts = Object.assign({ _directives: this.directives }, this.options);\n const doc = new Document(undefined, opts);\n if (this.atDirectives)\n this.onError(endOffset, 'MISSING_CHAR', 'Missing directives-end indicator line');\n doc.range = [0, endOffset, endOffset];\n this.decorate(doc, false);\n yield doc;\n }\n }\n}\n\nexport { Composer };\n","export { createScalarToken, resolveAsScalar, setScalarValue } from './cst-scalar.js';\nexport { stringify } from './cst-stringify.js';\nexport { visit } from './cst-visit.js';\n\n/** The byte order mark */\nconst BOM = '\\u{FEFF}';\n/** Start of doc-mode */\nconst DOCUMENT = '\\x02'; // C0: Start of Text\n/** Unexpected end of flow-mode */\nconst FLOW_END = '\\x18'; // C0: Cancel\n/** Next token is a scalar value */\nconst SCALAR = '\\x1f'; // C0: Unit Separator\n/** @returns `true` if `token` is a flow or block collection */\nconst isCollection = (token) => !!token && 'items' in token;\n/** @returns `true` if `token` is a flow or block scalar; not an alias */\nconst isScalar = (token) => !!token &&\n (token.type === 'scalar' ||\n token.type === 'single-quoted-scalar' ||\n token.type === 'double-quoted-scalar' ||\n token.type === 'block-scalar');\n/* istanbul ignore next */\n/** Get a printable representation of a lexer token */\nfunction prettyToken(token) {\n switch (token) {\n case BOM:\n return '<BOM>';\n case DOCUMENT:\n return '<DOC>';\n case FLOW_END:\n return '<FLOW_END>';\n case SCALAR:\n return '<SCALAR>';\n default:\n return JSON.stringify(token);\n }\n}\n/** Identify the type of a lexer token. May return `null` for unknown tokens. */\nfunction tokenType(source) {\n switch (source) {\n case BOM:\n return 'byte-order-mark';\n case DOCUMENT:\n return 'doc-mode';\n case FLOW_END:\n return 'flow-error-end';\n case SCALAR:\n return 'scalar';\n case '---':\n return 'doc-start';\n case '...':\n return 'doc-end';\n case '':\n case '\\n':\n case '\\r\\n':\n return 'newline';\n case '-':\n return 'seq-item-ind';\n case '?':\n return 'explicit-key-ind';\n case ':':\n return 'map-value-ind';\n case '{':\n return 'flow-map-start';\n case '}':\n return 'flow-map-end';\n case '[':\n return 'flow-seq-start';\n case ']':\n return 'flow-seq-end';\n case ',':\n return 'comma';\n }\n switch (source[0]) {\n case ' ':\n case '\\t':\n return 'space';\n case '#':\n return 'comment';\n case '%':\n return 'directive-line';\n case '*':\n return 'alias';\n case '&':\n return 'anchor';\n case '!':\n return 'tag';\n case \"'\":\n return 'single-quoted-scalar';\n case '\"':\n return 'double-quoted-scalar';\n case '|':\n case '>':\n return 'block-scalar-header';\n }\n return null;\n}\n\nexport { BOM, DOCUMENT, FLOW_END, SCALAR, isCollection, isScalar, prettyToken, tokenType };\n","import { BOM, DOCUMENT, FLOW_END, SCALAR } from './cst.js';\n\n/*\nSTART -> stream\n\nstream\n directive -> line-end -> stream\n indent + line-end -> stream\n [else] -> line-start\n\nline-end\n comment -> line-end\n newline -> .\n input-end -> END\n\nline-start\n doc-start -> doc\n doc-end -> stream\n [else] -> indent -> block-start\n\nblock-start\n seq-item-start -> block-start\n explicit-key-start -> block-start\n map-value-start -> block-start\n [else] -> doc\n\ndoc\n line-end -> line-start\n spaces -> doc\n anchor -> doc\n tag -> doc\n flow-start -> flow -> doc\n flow-end -> error -> doc\n seq-item-start -> error -> doc\n explicit-key-start -> error -> doc\n map-value-start -> doc\n alias -> doc\n quote-start -> quoted-scalar -> doc\n block-scalar-header -> line-end -> block-scalar(min) -> line-start\n [else] -> plain-scalar(false, min) -> doc\n\nflow\n line-end -> flow\n spaces -> flow\n anchor -> flow\n tag -> flow\n flow-start -> flow -> flow\n flow-end -> .\n seq-item-start -> error -> flow\n explicit-key-start -> flow\n map-value-start -> flow\n alias -> flow\n quote-start -> quoted-scalar -> flow\n comma -> flow\n [else] -> plain-scalar(true, 0) -> flow\n\nquoted-scalar\n quote-end -> .\n [else] -> quoted-scalar\n\nblock-scalar(min)\n newline + peek(indent < min) -> .\n [else] -> block-scalar(min)\n\nplain-scalar(is-flow, min)\n scalar-end(is-flow) -> .\n peek(newline + (indent < min)) -> .\n [else] -> plain-scalar(min)\n*/\nfunction isEmpty(ch) {\n switch (ch) {\n case undefined:\n case ' ':\n case '\\n':\n case '\\r':\n case '\\t':\n return true;\n default:\n return false;\n }\n}\nconst hexDigits = new Set('0123456789ABCDEFabcdef');\nconst tagChars = new Set(\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-#;/?:@&=+$_.!~*'()\");\nconst flowIndicatorChars = new Set(',[]{}');\nconst invalidAnchorChars = new Set(' ,[]{}\\n\\r\\t');\nconst isNotAnchorChar = (ch) => !ch || invalidAnchorChars.has(ch);\n/**\n * Splits an input string into lexical tokens, i.e. smaller strings that are\n * easily identifiable by `tokens.tokenType()`.\n *\n * Lexing starts always in a \"stream\" context. Incomplete input may be buffered\n * until a complete token can be emitted.\n *\n * In addition to slices of the original input, the following control characters\n * may also be emitted:\n *\n * - `\\x02` (Start of Text): A document starts with the next token\n * - `\\x18` (Cancel): Unexpected end of flow-mode (indicates an error)\n * - `\\x1f` (Unit Separator): Next token is a scalar value\n * - `\\u{FEFF}` (Byte order mark): Emitted separately outside documents\n */\nclass Lexer {\n constructor() {\n /**\n * Flag indicating whether the end of the current buffer marks the end of\n * all input\n */\n this.atEnd = false;\n /**\n * Explicit indent set in block scalar header, as an offset from the current\n * minimum indent, so e.g. set to 1 from a header `|2+`. Set to -1 if not\n * explicitly set.\n */\n this.blockScalarIndent = -1;\n /**\n * Block scalars that include a + (keep) chomping indicator in their header\n * include trailing empty lines, which are otherwise excluded from the\n * scalar's contents.\n */\n this.blockScalarKeep = false;\n /** Current input */\n this.buffer = '';\n /**\n * Flag noting whether the map value indicator : can immediately follow this\n * node within a flow context.\n */\n this.flowKey = false;\n /** Count of surrounding flow collection levels. */\n this.flowLevel = 0;\n /**\n * Minimum level of indentation required for next lines to be parsed as a\n * part of the current scalar value.\n */\n this.indentNext = 0;\n /** Indentation level of the current line. */\n this.indentValue = 0;\n /** Position of the next \\n character. */\n this.lineEndPos = null;\n /** Stores the state of the lexer if reaching the end of incpomplete input */\n this.next = null;\n /** A pointer to `buffer`; the current position of the lexer. */\n this.pos = 0;\n }\n /**\n * Generate YAML tokens from the `source` string. If `incomplete`,\n * a part of the last line may be left as a buffer for the next call.\n *\n * @returns A generator of lexical tokens\n */\n *lex(source, incomplete = false) {\n if (source) {\n if (typeof source !== 'string')\n throw TypeError('source is not a string');\n this.buffer = this.buffer ? this.buffer + source : source;\n this.lineEndPos = null;\n }\n this.atEnd = !incomplete;\n let next = this.next ?? 'stream';\n while (next && (incomplete || this.hasChars(1)))\n next = yield* this.parseNext(next);\n }\n atLineEnd() {\n let i = this.pos;\n let ch = this.buffer[i];\n while (ch === ' ' || ch === '\\t')\n ch = this.buffer[++i];\n if (!ch || ch === '#' || ch === '\\n')\n return true;\n if (ch === '\\r')\n return this.buffer[i + 1] === '\\n';\n return false;\n }\n charAt(n) {\n return this.buffer[this.pos + n];\n }\n continueScalar(offset) {\n let ch = this.buffer[offset];\n if (this.indentNext > 0) {\n let indent = 0;\n while (ch === ' ')\n ch = this.buffer[++indent + offset];\n if (ch === '\\r') {\n const next = this.buffer[indent + offset + 1];\n if (next === '\\n' || (!next && !this.atEnd))\n return offset + indent + 1;\n }\n return ch === '\\n' || indent >= this.indentNext || (!ch && !this.atEnd)\n ? offset + indent\n : -1;\n }\n if (ch === '-' || ch === '.') {\n const dt = this.buffer.substr(offset, 3);\n if ((dt === '---' || dt === '...') && isEmpty(this.buffer[offset + 3]))\n return -1;\n }\n return offset;\n }\n getLine() {\n let end = this.lineEndPos;\n if (typeof end !== 'number' || (end !== -1 && end < this.pos)) {\n end = this.buffer.indexOf('\\n', this.pos);\n this.lineEndPos = end;\n }\n if (end === -1)\n return this.atEnd ? this.buffer.substring(this.pos) : null;\n if (this.buffer[end - 1] === '\\r')\n end -= 1;\n return this.buffer.substring(this.pos, end);\n }\n hasChars(n) {\n return this.pos + n <= this.buffer.length;\n }\n setNext(state) {\n this.buffer = this.buffer.substring(this.pos);\n this.pos = 0;\n this.lineEndPos = null;\n this.next = state;\n return null;\n }\n peek(n) {\n return this.buffer.substr(this.pos, n);\n }\n *parseNext(next) {\n switch (next) {\n case 'stream':\n return yield* this.parseStream();\n case 'line-start':\n return yield* this.parseLineStart();\n case 'block-start':\n return yield* this.parseBlockStart();\n case 'doc':\n return yield* this.parseDocument();\n case 'flow':\n return yield* this.parseFlowCollection();\n case 'quoted-scalar':\n return yield* this.parseQuotedScalar();\n case 'block-scalar':\n return yield* this.parseBlockScalar();\n case 'plain-scalar':\n return yield* this.parsePlainScalar();\n }\n }\n *parseStream() {\n let line = this.getLine();\n if (line === null)\n return this.setNext('stream');\n if (line[0] === BOM) {\n yield* this.pushCount(1);\n line = line.substring(1);\n }\n if (line[0] === '%') {\n let dirEnd = line.length;\n let cs = line.indexOf('#');\n while (cs !== -1) {\n const ch = line[cs - 1];\n if (ch === ' ' || ch === '\\t') {\n dirEnd = cs - 1;\n break;\n }\n else {\n cs = line.indexOf('#', cs + 1);\n }\n }\n while (true) {\n const ch = line[dirEnd - 1];\n if (ch === ' ' || ch === '\\t')\n dirEnd -= 1;\n else\n break;\n }\n const n = (yield* this.pushCount(dirEnd)) + (yield* this.pushSpaces(true));\n yield* this.pushCount(line.length - n); // possible comment\n this.pushNewline();\n return 'stream';\n }\n if (this.atLineEnd()) {\n const sp = yield* this.pushSpaces(true);\n yield* this.pushCount(line.length - sp);\n yield* this.pushNewline();\n return 'stream';\n }\n yield DOCUMENT;\n return yield* this.parseLineStart();\n }\n *parseLineStart() {\n const ch = this.charAt(0);\n if (!ch && !this.atEnd)\n return this.setNext('line-start');\n if (ch === '-' || ch === '.') {\n if (!this.atEnd && !this.hasChars(4))\n return this.setNext('line-start');\n const s = this.peek(3);\n if ((s === '---' || s === '...') && isEmpty(this.charAt(3))) {\n yield* this.pushCount(3);\n this.indentValue = 0;\n this.indentNext = 0;\n return s === '---' ? 'doc' : 'stream';\n }\n }\n this.indentValue = yield* this.pushSpaces(false);\n if (this.indentNext > this.indentValue && !isEmpty(this.charAt(1)))\n this.indentNext = this.indentValue;\n return yield* this.parseBlockStart();\n }\n *parseBlockStart() {\n const [ch0, ch1] = this.peek(2);\n if (!ch1 && !this.atEnd)\n return this.setNext('block-start');\n if ((ch0 === '-' || ch0 === '?' || ch0 === ':') && isEmpty(ch1)) {\n const n = (yield* this.pushCount(1)) + (yield* this.pushSpaces(true));\n this.indentNext = this.indentValue + 1;\n this.indentValue += n;\n return yield* this.parseBlockStart();\n }\n return 'doc';\n }\n *parseDocument() {\n yield* this.pushSpaces(true);\n const line = this.getLine();\n if (line === null)\n return this.setNext('doc');\n let n = yield* this.pushIndicators();\n switch (line[n]) {\n case '#':\n yield* this.pushCount(line.length - n);\n // fallthrough\n case undefined:\n yield* this.pushNewline();\n return yield* this.parseLineStart();\n case '{':\n case '[':\n yield* this.pushCount(1);\n this.flowKey = false;\n this.flowLevel = 1;\n return 'flow';\n case '}':\n case ']':\n // this is an error\n yield* this.pushCount(1);\n return 'doc';\n case '*':\n yield* this.pushUntil(isNotAnchorChar);\n return 'doc';\n case '\"':\n case \"'\":\n return yield* this.parseQuotedScalar();\n case '|':\n case '>':\n n += yield* this.parseBlockScalarHeader();\n n += yield* this.pushSpaces(true);\n yield* this.pushCount(line.length - n);\n yield* this.pushNewline();\n return yield* this.parseBlockScalar();\n default:\n return yield* this.parsePlainScalar();\n }\n }\n *parseFlowCollection() {\n let nl, sp;\n let indent = -1;\n do {\n nl = yield* this.pushNewline();\n if (nl > 0) {\n sp = yield* this.pushSpaces(false);\n this.indentValue = indent = sp;\n }\n else {\n sp = 0;\n }\n sp += yield* this.pushSpaces(true);\n } while (nl + sp > 0);\n const line = this.getLine();\n if (line === null)\n return this.setNext('flow');\n if ((indent !== -1 && indent < this.indentNext && line[0] !== '#') ||\n (indent === 0 &&\n (line.startsWith('---') || line.startsWith('...')) &&\n isEmpty(line[3]))) {\n // Allowing for the terminal ] or } at the same (rather than greater)\n // indent level as the initial [ or { is technically invalid, but\n // failing here would be surprising to users.\n const atFlowEndMarker = indent === this.indentNext - 1 &&\n this.flowLevel === 1 &&\n (line[0] === ']' || line[0] === '}');\n if (!atFlowEndMarker) {\n // this is an error\n this.flowLevel = 0;\n yield FLOW_END;\n return yield* this.parseLineStart();\n }\n }\n let n = 0;\n while (line[n] === ',') {\n n += yield* this.pushCount(1);\n n += yield* this.pushSpaces(true);\n this.flowKey = false;\n }\n n += yield* this.pushIndicators();\n switch (line[n]) {\n case undefined:\n return 'flow';\n case '#':\n yield* this.pushCount(line.length - n);\n return 'flow';\n case '{':\n case '[':\n yield* this.pushCount(1);\n this.flowKey = false;\n this.flowLevel += 1;\n return 'flow';\n case '}':\n case ']':\n yield* this.pushCount(1);\n this.flowKey = true;\n this.flowLevel -= 1;\n return this.flowLevel ? 'flow' : 'doc';\n case '*':\n yield* this.pushUntil(isNotAnchorChar);\n return 'flow';\n case '\"':\n case \"'\":\n this.flowKey = true;\n return yield* this.parseQuotedScalar();\n case ':': {\n const next = this.charAt(1);\n if (this.flowKey || isEmpty(next) || next === ',') {\n this.flowKey = false;\n yield* this.pushCount(1);\n yield* this.pushSpaces(true);\n return 'flow';\n }\n }\n // fallthrough\n default:\n this.flowKey = false;\n return yield* this.parsePlainScalar();\n }\n }\n *parseQuotedScalar() {\n const quote = this.charAt(0);\n let end = this.buffer.indexOf(quote, this.pos + 1);\n if (quote === \"'\") {\n while (end !== -1 && this.buffer[end + 1] === \"'\")\n end = this.buffer.indexOf(\"'\", end + 2);\n }\n else {\n // double-quote\n while (end !== -1) {\n let n = 0;\n while (this.buffer[end - 1 - n] === '\\\\')\n n += 1;\n if (n % 2 === 0)\n break;\n end = this.buffer.indexOf('\"', end + 1);\n }\n }\n // Only looking for newlines within the quotes\n const qb = this.buffer.substring(0, end);\n let nl = qb.indexOf('\\n', this.pos);\n if (nl !== -1) {\n while (nl !== -1) {\n const cs = this.continueScalar(nl + 1);\n if (cs === -1)\n break;\n nl = qb.indexOf('\\n', cs);\n }\n if (nl !== -1) {\n // this is an error caused by an unexpected unindent\n end = nl - (qb[nl - 1] === '\\r' ? 2 : 1);\n }\n }\n if (end === -1) {\n if (!this.atEnd)\n return this.setNext('quoted-scalar');\n end = this.buffer.length;\n }\n yield* this.pushToIndex(end + 1, false);\n return this.flowLevel ? 'flow' : 'doc';\n }\n *parseBlockScalarHeader() {\n this.blockScalarIndent = -1;\n this.blockScalarKeep = false;\n let i = this.pos;\n while (true) {\n const ch = this.buffer[++i];\n if (ch === '+')\n this.blockScalarKeep = true;\n else if (ch > '0' && ch <= '9')\n this.blockScalarIndent = Number(ch) - 1;\n else if (ch !== '-')\n break;\n }\n return yield* this.pushUntil(ch => isEmpty(ch) || ch === '#');\n }\n *parseBlockScalar() {\n let nl = this.pos - 1; // may be -1 if this.pos === 0\n let indent = 0;\n let ch;\n loop: for (let i = this.pos; (ch = this.buffer[i]); ++i) {\n switch (ch) {\n case ' ':\n indent += 1;\n break;\n case '\\n':\n nl = i;\n indent = 0;\n break;\n case '\\r': {\n const next = this.buffer[i + 1];\n if (!next && !this.atEnd)\n return this.setNext('block-scalar');\n if (next === '\\n')\n break;\n } // fallthrough\n default:\n break loop;\n }\n }\n if (!ch && !this.atEnd)\n return this.setNext('block-scalar');\n if (indent >= this.indentNext) {\n if (this.blockScalarIndent === -1)\n this.indentNext = indent;\n else {\n this.indentNext =\n this.blockScalarIndent + (this.indentNext === 0 ? 1 : this.indentNext);\n }\n do {\n const cs = this.continueScalar(nl + 1);\n if (cs === -1)\n break;\n nl = this.buffer.indexOf('\\n', cs);\n } while (nl !== -1);\n if (nl === -1) {\n if (!this.atEnd)\n return this.setNext('block-scalar');\n nl = this.buffer.length;\n }\n }\n // Trailing insufficiently indented tabs are invalid.\n // To catch that during parsing, we include them in the block scalar value.\n let i = nl + 1;\n ch = this.buffer[i];\n while (ch === ' ')\n ch = this.buffer[++i];\n if (ch === '\\t') {\n while (ch === '\\t' || ch === ' ' || ch === '\\r' || ch === '\\n')\n ch = this.buffer[++i];\n nl = i - 1;\n }\n else if (!this.blockScalarKeep) {\n do {\n let i = nl - 1;\n let ch = this.buffer[i];\n if (ch === '\\r')\n ch = this.buffer[--i];\n const lastChar = i; // Drop the line if last char not more indented\n while (ch === ' ')\n ch = this.buffer[--i];\n if (ch === '\\n' && i >= this.pos && i + 1 + indent > lastChar)\n nl = i;\n else\n break;\n } while (true);\n }\n yield SCALAR;\n yield* this.pushToIndex(nl + 1, true);\n return yield* this.parseLineStart();\n }\n *parsePlainScalar() {\n const inFlow = this.flowLevel > 0;\n let end = this.pos - 1;\n let i = this.pos - 1;\n let ch;\n while ((ch = this.buffer[++i])) {\n if (ch === ':') {\n const next = this.buffer[i + 1];\n if (isEmpty(next) || (inFlow && flowIndicatorChars.has(next)))\n break;\n end = i;\n }\n else if (isEmpty(ch)) {\n let next = this.buffer[i + 1];\n if (ch === '\\r') {\n if (next === '\\n') {\n i += 1;\n ch = '\\n';\n next = this.buffer[i + 1];\n }\n else\n end = i;\n }\n if (next === '#' || (inFlow && flowIndicatorChars.has(next)))\n break;\n if (ch === '\\n') {\n const cs = this.continueScalar(i + 1);\n if (cs === -1)\n break;\n i = Math.max(i, cs - 2); // to advance, but still account for ' #'\n }\n }\n else {\n if (inFlow && flowIndicatorChars.has(ch))\n break;\n end = i;\n }\n }\n if (!ch && !this.atEnd)\n return this.setNext('plain-scalar');\n yield SCALAR;\n yield* this.pushToIndex(end + 1, true);\n return inFlow ? 'flow' : 'doc';\n }\n *pushCount(n) {\n if (n > 0) {\n yield this.buffer.substr(this.pos, n);\n this.pos += n;\n return n;\n }\n return 0;\n }\n *pushToIndex(i, allowEmpty) {\n const s = this.buffer.slice(this.pos, i);\n if (s) {\n yield s;\n this.pos += s.length;\n return s.length;\n }\n else if (allowEmpty)\n yield '';\n return 0;\n }\n *pushIndicators() {\n switch (this.charAt(0)) {\n case '!':\n return ((yield* this.pushTag()) +\n (yield* this.pushSpaces(true)) +\n (yield* this.pushIndicators()));\n case '&':\n return ((yield* this.pushUntil(isNotAnchorChar)) +\n (yield* this.pushSpaces(true)) +\n (yield* this.pushIndicators()));\n case '-': // this is an error\n case '?': // this is an error outside flow collections\n case ':': {\n const inFlow = this.flowLevel > 0;\n const ch1 = this.charAt(1);\n if (isEmpty(ch1) || (inFlow && flowIndicatorChars.has(ch1))) {\n if (!inFlow)\n this.indentNext = this.indentValue + 1;\n else if (this.flowKey)\n this.flowKey = false;\n return ((yield* this.pushCount(1)) +\n (yield* this.pushSpaces(true)) +\n (yield* this.pushIndicators()));\n }\n }\n }\n return 0;\n }\n *pushTag() {\n if (this.charAt(1) === '<') {\n let i = this.pos + 2;\n let ch = this.buffer[i];\n while (!isEmpty(ch) && ch !== '>')\n ch = this.buffer[++i];\n return yield* this.pushToIndex(ch === '>' ? i + 1 : i, false);\n }\n else {\n let i = this.pos + 1;\n let ch = this.buffer[i];\n while (ch) {\n if (tagChars.has(ch))\n ch = this.buffer[++i];\n else if (ch === '%' &&\n hexDigits.has(this.buffer[i + 1]) &&\n hexDigits.has(this.buffer[i + 2])) {\n ch = this.buffer[(i += 3)];\n }\n else\n break;\n }\n return yield* this.pushToIndex(i, false);\n }\n }\n *pushNewline() {\n const ch = this.buffer[this.pos];\n if (ch === '\\n')\n return yield* this.pushCount(1);\n else if (ch === '\\r' && this.charAt(1) === '\\n')\n return yield* this.pushCount(2);\n else\n return 0;\n }\n *pushSpaces(allowTabs) {\n let i = this.pos - 1;\n let ch;\n do {\n ch = this.buffer[++i];\n } while (ch === ' ' || (allowTabs && ch === '\\t'));\n const n = i - this.pos;\n if (n > 0) {\n yield this.buffer.substr(this.pos, n);\n this.pos = i;\n }\n return n;\n }\n *pushUntil(test) {\n let i = this.pos;\n let ch = this.buffer[i];\n while (!test(ch))\n ch = this.buffer[++i];\n return yield* this.pushToIndex(i, false);\n }\n}\n\nexport { Lexer };\n","/**\n * Tracks newlines during parsing in order to provide an efficient API for\n * determining the one-indexed `{ line, col }` position for any offset\n * within the input.\n */\nclass LineCounter {\n constructor() {\n this.lineStarts = [];\n /**\n * Should be called in ascending order. Otherwise, call\n * `lineCounter.lineStarts.sort()` before calling `linePos()`.\n */\n this.addNewLine = (offset) => this.lineStarts.push(offset);\n /**\n * Performs a binary search and returns the 1-indexed { line, col }\n * position of `offset`. If `line === 0`, `addNewLine` has never been\n * called or `offset` is before the first known newline.\n */\n this.linePos = (offset) => {\n let low = 0;\n let high = this.lineStarts.length;\n while (low < high) {\n const mid = (low + high) >> 1; // Math.floor((low + high) / 2)\n if (this.lineStarts[mid] < offset)\n low = mid + 1;\n else\n high = mid;\n }\n if (this.lineStarts[low] === offset)\n return { line: low + 1, col: 1 };\n if (low === 0)\n return { line: 0, col: offset };\n const start = this.lineStarts[low - 1];\n return { line: low, col: offset - start + 1 };\n };\n }\n}\n\nexport { LineCounter };\n","import { tokenType } from './cst.js';\nimport { Lexer } from './lexer.js';\n\nfunction includesToken(list, type) {\n for (let i = 0; i < list.length; ++i)\n if (list[i].type === type)\n return true;\n return false;\n}\nfunction findNonEmptyIndex(list) {\n for (let i = 0; i < list.length; ++i) {\n switch (list[i].type) {\n case 'space':\n case 'comment':\n case 'newline':\n break;\n default:\n return i;\n }\n }\n return -1;\n}\nfunction isFlowToken(token) {\n switch (token?.type) {\n case 'alias':\n case 'scalar':\n case 'single-quoted-scalar':\n case 'double-quoted-scalar':\n case 'flow-collection':\n return true;\n default:\n return false;\n }\n}\nfunction getPrevProps(parent) {\n switch (parent.type) {\n case 'document':\n return parent.start;\n case 'block-map': {\n const it = parent.items[parent.items.length - 1];\n return it.sep ?? it.start;\n }\n case 'block-seq':\n return parent.items[parent.items.length - 1].start;\n /* istanbul ignore next should not happen */\n default:\n return [];\n }\n}\n/** Note: May modify input array */\nfunction getFirstKeyStartProps(prev) {\n if (prev.length === 0)\n return [];\n let i = prev.length;\n loop: while (--i >= 0) {\n switch (prev[i].type) {\n case 'doc-start':\n case 'explicit-key-ind':\n case 'map-value-ind':\n case 'seq-item-ind':\n case 'newline':\n break loop;\n }\n }\n while (prev[++i]?.type === 'space') {\n /* loop */\n }\n return prev.splice(i, prev.length);\n}\nfunction fixFlowSeqItems(fc) {\n if (fc.start.type === 'flow-seq-start') {\n for (const it of fc.items) {\n if (it.sep &&\n !it.value &&\n !includesToken(it.start, 'explicit-key-ind') &&\n !includesToken(it.sep, 'map-value-ind')) {\n if (it.key)\n it.value = it.key;\n delete it.key;\n if (isFlowToken(it.value)) {\n if (it.value.end)\n Array.prototype.push.apply(it.value.end, it.sep);\n else\n it.value.end = it.sep;\n }\n else\n Array.prototype.push.apply(it.start, it.sep);\n delete it.sep;\n }\n }\n }\n}\n/**\n * A YAML concrete syntax tree (CST) parser\n *\n * ```ts\n * const src: string = ...\n * for (const token of new Parser().parse(src)) {\n * // token: Token\n * }\n * ```\n *\n * To use the parser with a user-provided lexer:\n *\n * ```ts\n * function* parse(source: string, lexer: Lexer) {\n * const parser = new Parser()\n * for (const lexeme of lexer.lex(source))\n * yield* parser.next(lexeme)\n * yield* parser.end()\n * }\n *\n * const src: string = ...\n * const lexer = new Lexer()\n * for (const token of parse(src, lexer)) {\n * // token: Token\n * }\n * ```\n */\nclass Parser {\n /**\n * @param onNewLine - If defined, called separately with the start position of\n * each new line (in `parse()`, including the start of input).\n */\n constructor(onNewLine) {\n /** If true, space and sequence indicators count as indentation */\n this.atNewLine = true;\n /** If true, next token is a scalar value */\n this.atScalar = false;\n /** Current indentation level */\n this.indent = 0;\n /** Current offset since the start of parsing */\n this.offset = 0;\n /** On the same line with a block map key */\n this.onKeyLine = false;\n /** Top indicates the node that's currently being built */\n this.stack = [];\n /** The source of the current token, set in parse() */\n this.source = '';\n /** The type of the current token, set in parse() */\n this.type = '';\n // Must be defined after `next()`\n this.lexer = new Lexer();\n this.onNewLine = onNewLine;\n }\n /**\n * Parse `source` as a YAML stream.\n * If `incomplete`, a part of the last line may be left as a buffer for the next call.\n *\n * Errors are not thrown, but yielded as `{ type: 'error', message }` tokens.\n *\n * @returns A generator of tokens representing each directive, document, and other structure.\n */\n *parse(source, incomplete = false) {\n if (this.onNewLine && this.offset === 0)\n this.onNewLine(0);\n for (const lexeme of this.lexer.lex(source, incomplete))\n yield* this.next(lexeme);\n if (!incomplete)\n yield* this.end();\n }\n /**\n * Advance the parser by the `source` of one lexical token.\n */\n *next(source) {\n this.source = source;\n if (this.atScalar) {\n this.atScalar = false;\n yield* this.step();\n this.offset += source.length;\n return;\n }\n const type = tokenType(source);\n if (!type) {\n const message = `Not a YAML token: ${source}`;\n yield* this.pop({ type: 'error', offset: this.offset, message, source });\n this.offset += source.length;\n }\n else if (type === 'scalar') {\n this.atNewLine = false;\n this.atScalar = true;\n this.type = 'scalar';\n }\n else {\n this.type = type;\n yield* this.step();\n switch (type) {\n case 'newline':\n this.atNewLine = true;\n this.indent = 0;\n if (this.onNewLine)\n this.onNewLine(this.offset + source.length);\n break;\n case 'space':\n if (this.atNewLine && source[0] === ' ')\n this.indent += source.length;\n break;\n case 'explicit-key-ind':\n case 'map-value-ind':\n case 'seq-item-ind':\n if (this.atNewLine)\n this.indent += source.length;\n break;\n case 'doc-mode':\n case 'flow-error-end':\n return;\n default:\n this.atNewLine = false;\n }\n this.offset += source.length;\n }\n }\n /** Call at end of input to push out any remaining constructions */\n *end() {\n while (this.stack.length > 0)\n yield* this.pop();\n }\n get sourceToken() {\n const st = {\n type: this.type,\n offset: this.offset,\n indent: this.indent,\n source: this.source\n };\n return st;\n }\n *step() {\n const top = this.peek(1);\n if (this.type === 'doc-end' && (!top || top.type !== 'doc-end')) {\n while (this.stack.length > 0)\n yield* this.pop();\n this.stack.push({\n type: 'doc-end',\n offset: this.offset,\n source: this.source\n });\n return;\n }\n if (!top)\n return yield* this.stream();\n switch (top.type) {\n case 'document':\n return yield* this.document(top);\n case 'alias':\n case 'scalar':\n case 'single-quoted-scalar':\n case 'double-quoted-scalar':\n return yield* this.scalar(top);\n case 'block-scalar':\n return yield* this.blockScalar(top);\n case 'block-map':\n return yield* this.blockMap(top);\n case 'block-seq':\n return yield* this.blockSequence(top);\n case 'flow-collection':\n return yield* this.flowCollection(top);\n case 'doc-end':\n return yield* this.documentEnd(top);\n }\n /* istanbul ignore next should not happen */\n yield* this.pop();\n }\n peek(n) {\n return this.stack[this.stack.length - n];\n }\n *pop(error) {\n const token = error ?? this.stack.pop();\n /* istanbul ignore if should not happen */\n if (!token) {\n const message = 'Tried to pop an empty stack';\n yield { type: 'error', offset: this.offset, source: '', message };\n }\n else if (this.stack.length === 0) {\n yield token;\n }\n else {\n const top = this.peek(1);\n if (token.type === 'block-scalar') {\n // Block scalars use their parent rather than header indent\n token.indent = 'indent' in top ? top.indent : 0;\n }\n else if (token.type === 'flow-collection' && top.type === 'document') {\n // Ignore all indent for top-level flow collections\n token.indent = 0;\n }\n if (token.type === 'flow-collection')\n fixFlowSeqItems(token);\n switch (top.type) {\n case 'document':\n top.value = token;\n break;\n case 'block-scalar':\n top.props.push(token); // error\n break;\n case 'block-map': {\n const it = top.items[top.items.length - 1];\n if (it.value) {\n top.items.push({ start: [], key: token, sep: [] });\n this.onKeyLine = true;\n return;\n }\n else if (it.sep) {\n it.value = token;\n }\n else {\n Object.assign(it, { key: token, sep: [] });\n this.onKeyLine = !it.explicitKey;\n return;\n }\n break;\n }\n case 'block-seq': {\n const it = top.items[top.items.length - 1];\n if (it.value)\n top.items.push({ start: [], value: token });\n else\n it.value = token;\n break;\n }\n case 'flow-collection': {\n const it = top.items[top.items.length - 1];\n if (!it || it.value)\n top.items.push({ start: [], key: token, sep: [] });\n else if (it.sep)\n it.value = token;\n else\n Object.assign(it, { key: token, sep: [] });\n return;\n }\n /* istanbul ignore next should not happen */\n default:\n yield* this.pop();\n yield* this.pop(token);\n }\n if ((top.type === 'document' ||\n top.type === 'block-map' ||\n top.type === 'block-seq') &&\n (token.type === 'block-map' || token.type === 'block-seq')) {\n const last = token.items[token.items.length - 1];\n if (last &&\n !last.sep &&\n !last.value &&\n last.start.length > 0 &&\n findNonEmptyIndex(last.start) === -1 &&\n (token.indent === 0 ||\n last.start.every(st => st.type !== 'comment' || st.indent < token.indent))) {\n if (top.type === 'document')\n top.end = last.start;\n else\n top.items.push({ start: last.start });\n token.items.splice(-1, 1);\n }\n }\n }\n }\n *stream() {\n switch (this.type) {\n case 'directive-line':\n yield { type: 'directive', offset: this.offset, source: this.source };\n return;\n case 'byte-order-mark':\n case 'space':\n case 'comment':\n case 'newline':\n yield this.sourceToken;\n return;\n case 'doc-mode':\n case 'doc-start': {\n const doc = {\n type: 'document',\n offset: this.offset,\n start: []\n };\n if (this.type === 'doc-start')\n doc.start.push(this.sourceToken);\n this.stack.push(doc);\n return;\n }\n }\n yield {\n type: 'error',\n offset: this.offset,\n message: `Unexpected ${this.type} token in YAML stream`,\n source: this.source\n };\n }\n *document(doc) {\n if (doc.value)\n return yield* this.lineEnd(doc);\n switch (this.type) {\n case 'doc-start': {\n if (findNonEmptyIndex(doc.start) !== -1) {\n yield* this.pop();\n yield* this.step();\n }\n else\n doc.start.push(this.sourceToken);\n return;\n }\n case 'anchor':\n case 'tag':\n case 'space':\n case 'comment':\n case 'newline':\n doc.start.push(this.sourceToken);\n return;\n }\n const bv = this.startBlockValue(doc);\n if (bv)\n this.stack.push(bv);\n else {\n yield {\n type: 'error',\n offset: this.offset,\n message: `Unexpected ${this.type} token in YAML document`,\n source: this.source\n };\n }\n }\n *scalar(scalar) {\n if (this.type === 'map-value-ind') {\n const prev = getPrevProps(this.peek(2));\n const start = getFirstKeyStartProps(prev);\n let sep;\n if (scalar.end) {\n sep = scalar.end;\n sep.push(this.sourceToken);\n delete scalar.end;\n }\n else\n sep = [this.sourceToken];\n const map = {\n type: 'block-map',\n offset: scalar.offset,\n indent: scalar.indent,\n items: [{ start, key: scalar, sep }]\n };\n this.onKeyLine = true;\n this.stack[this.stack.length - 1] = map;\n }\n else\n yield* this.lineEnd(scalar);\n }\n *blockScalar(scalar) {\n switch (this.type) {\n case 'space':\n case 'comment':\n case 'newline':\n scalar.props.push(this.sourceToken);\n return;\n case 'scalar':\n scalar.source = this.source;\n // block-scalar source includes trailing newline\n this.atNewLine = true;\n this.indent = 0;\n if (this.onNewLine) {\n let nl = this.source.indexOf('\\n') + 1;\n while (nl !== 0) {\n this.onNewLine(this.offset + nl);\n nl = this.source.indexOf('\\n', nl) + 1;\n }\n }\n yield* this.pop();\n break;\n /* istanbul ignore next should not happen */\n default:\n yield* this.pop();\n yield* this.step();\n }\n }\n *blockMap(map) {\n const it = map.items[map.items.length - 1];\n // it.sep is true-ish if pair already has key or : separator\n switch (this.type) {\n case 'newline':\n this.onKeyLine = false;\n if (it.value) {\n const end = 'end' in it.value ? it.value.end : undefined;\n const last = Array.isArray(end) ? end[end.length - 1] : undefined;\n if (last?.type === 'comment')\n end?.push(this.sourceToken);\n else\n map.items.push({ start: [this.sourceToken] });\n }\n else if (it.sep) {\n it.sep.push(this.sourceToken);\n }\n else {\n it.start.push(this.sourceToken);\n }\n return;\n case 'space':\n case 'comment':\n if (it.value) {\n map.items.push({ start: [this.sourceToken] });\n }\n else if (it.sep) {\n it.sep.push(this.sourceToken);\n }\n else {\n if (this.atIndentedComment(it.start, map.indent)) {\n const prev = map.items[map.items.length - 2];\n const end = prev?.value?.end;\n if (Array.isArray(end)) {\n Array.prototype.push.apply(end, it.start);\n end.push(this.sourceToken);\n map.items.pop();\n return;\n }\n }\n it.start.push(this.sourceToken);\n }\n return;\n }\n if (this.indent >= map.indent) {\n const atMapIndent = !this.onKeyLine && this.indent === map.indent;\n const atNextItem = atMapIndent &&\n (it.sep || it.explicitKey) &&\n this.type !== 'seq-item-ind';\n // For empty nodes, assign newline-separated not indented empty tokens to following node\n let start = [];\n if (atNextItem && it.sep && !it.value) {\n const nl = [];\n for (let i = 0; i < it.sep.length; ++i) {\n const st = it.sep[i];\n switch (st.type) {\n case 'newline':\n nl.push(i);\n break;\n case 'space':\n break;\n case 'comment':\n if (st.indent > map.indent)\n nl.length = 0;\n break;\n default:\n nl.length = 0;\n }\n }\n if (nl.length >= 2)\n start = it.sep.splice(nl[1]);\n }\n switch (this.type) {\n case 'anchor':\n case 'tag':\n if (atNextItem || it.value) {\n start.push(this.sourceToken);\n map.items.push({ start });\n this.onKeyLine = true;\n }\n else if (it.sep) {\n it.sep.push(this.sourceToken);\n }\n else {\n it.start.push(this.sourceToken);\n }\n return;\n case 'explicit-key-ind':\n if (!it.sep && !it.explicitKey) {\n it.start.push(this.sourceToken);\n it.explicitKey = true;\n }\n else if (atNextItem || it.value) {\n start.push(this.sourceToken);\n map.items.push({ start, explicitKey: true });\n }\n else {\n this.stack.push({\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start: [this.sourceToken], explicitKey: true }]\n });\n }\n this.onKeyLine = true;\n return;\n case 'map-value-ind':\n if (it.explicitKey) {\n if (!it.sep) {\n if (includesToken(it.start, 'newline')) {\n Object.assign(it, { key: null, sep: [this.sourceToken] });\n }\n else {\n const start = getFirstKeyStartProps(it.start);\n this.stack.push({\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start, key: null, sep: [this.sourceToken] }]\n });\n }\n }\n else if (it.value) {\n map.items.push({ start: [], key: null, sep: [this.sourceToken] });\n }\n else if (includesToken(it.sep, 'map-value-ind')) {\n this.stack.push({\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start, key: null, sep: [this.sourceToken] }]\n });\n }\n else if (isFlowToken(it.key) &&\n !includesToken(it.sep, 'newline')) {\n const start = getFirstKeyStartProps(it.start);\n const key = it.key;\n const sep = it.sep;\n sep.push(this.sourceToken);\n // @ts-expect-error type guard is wrong here\n delete it.key;\n // @ts-expect-error type guard is wrong here\n delete it.sep;\n this.stack.push({\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start, key, sep }]\n });\n }\n else if (start.length > 0) {\n // Not actually at next item\n it.sep = it.sep.concat(start, this.sourceToken);\n }\n else {\n it.sep.push(this.sourceToken);\n }\n }\n else {\n if (!it.sep) {\n Object.assign(it, { key: null, sep: [this.sourceToken] });\n }\n else if (it.value || atNextItem) {\n map.items.push({ start, key: null, sep: [this.sourceToken] });\n }\n else if (includesToken(it.sep, 'map-value-ind')) {\n this.stack.push({\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start: [], key: null, sep: [this.sourceToken] }]\n });\n }\n else {\n it.sep.push(this.sourceToken);\n }\n }\n this.onKeyLine = true;\n return;\n case 'alias':\n case 'scalar':\n case 'single-quoted-scalar':\n case 'double-quoted-scalar': {\n const fs = this.flowScalar(this.type);\n if (atNextItem || it.value) {\n map.items.push({ start, key: fs, sep: [] });\n this.onKeyLine = true;\n }\n else if (it.sep) {\n this.stack.push(fs);\n }\n else {\n Object.assign(it, { key: fs, sep: [] });\n this.onKeyLine = true;\n }\n return;\n }\n default: {\n const bv = this.startBlockValue(map);\n if (bv) {\n if (bv.type === 'block-seq') {\n if (!it.explicitKey &&\n it.sep &&\n !includesToken(it.sep, 'newline')) {\n yield* this.pop({\n type: 'error',\n offset: this.offset,\n message: 'Unexpected block-seq-ind on same line with key',\n source: this.source\n });\n return;\n }\n }\n else if (atMapIndent) {\n map.items.push({ start });\n }\n this.stack.push(bv);\n return;\n }\n }\n }\n }\n yield* this.pop();\n yield* this.step();\n }\n *blockSequence(seq) {\n const it = seq.items[seq.items.length - 1];\n switch (this.type) {\n case 'newline':\n if (it.value) {\n const end = 'end' in it.value ? it.value.end : undefined;\n const last = Array.isArray(end) ? end[end.length - 1] : undefined;\n if (last?.type === 'comment')\n end?.push(this.sourceToken);\n else\n seq.items.push({ start: [this.sourceToken] });\n }\n else\n it.start.push(this.sourceToken);\n return;\n case 'space':\n case 'comment':\n if (it.value)\n seq.items.push({ start: [this.sourceToken] });\n else {\n if (this.atIndentedComment(it.start, seq.indent)) {\n const prev = seq.items[seq.items.length - 2];\n const end = prev?.value?.end;\n if (Array.isArray(end)) {\n Array.prototype.push.apply(end, it.start);\n end.push(this.sourceToken);\n seq.items.pop();\n return;\n }\n }\n it.start.push(this.sourceToken);\n }\n return;\n case 'anchor':\n case 'tag':\n if (it.value || this.indent <= seq.indent)\n break;\n it.start.push(this.sourceToken);\n return;\n case 'seq-item-ind':\n if (this.indent !== seq.indent)\n break;\n if (it.value || includesToken(it.start, 'seq-item-ind'))\n seq.items.push({ start: [this.sourceToken] });\n else\n it.start.push(this.sourceToken);\n return;\n }\n if (this.indent > seq.indent) {\n const bv = this.startBlockValue(seq);\n if (bv) {\n this.stack.push(bv);\n return;\n }\n }\n yield* this.pop();\n yield* this.step();\n }\n *flowCollection(fc) {\n const it = fc.items[fc.items.length - 1];\n if (this.type === 'flow-error-end') {\n let top;\n do {\n yield* this.pop();\n top = this.peek(1);\n } while (top && top.type === 'flow-collection');\n }\n else if (fc.end.length === 0) {\n switch (this.type) {\n case 'comma':\n case 'explicit-key-ind':\n if (!it || it.sep)\n fc.items.push({ start: [this.sourceToken] });\n else\n it.start.push(this.sourceToken);\n return;\n case 'map-value-ind':\n if (!it || it.value)\n fc.items.push({ start: [], key: null, sep: [this.sourceToken] });\n else if (it.sep)\n it.sep.push(this.sourceToken);\n else\n Object.assign(it, { key: null, sep: [this.sourceToken] });\n return;\n case 'space':\n case 'comment':\n case 'newline':\n case 'anchor':\n case 'tag':\n if (!it || it.value)\n fc.items.push({ start: [this.sourceToken] });\n else if (it.sep)\n it.sep.push(this.sourceToken);\n else\n it.start.push(this.sourceToken);\n return;\n case 'alias':\n case 'scalar':\n case 'single-quoted-scalar':\n case 'double-quoted-scalar': {\n const fs = this.flowScalar(this.type);\n if (!it || it.value)\n fc.items.push({ start: [], key: fs, sep: [] });\n else if (it.sep)\n this.stack.push(fs);\n else\n Object.assign(it, { key: fs, sep: [] });\n return;\n }\n case 'flow-map-end':\n case 'flow-seq-end':\n fc.end.push(this.sourceToken);\n return;\n }\n const bv = this.startBlockValue(fc);\n /* istanbul ignore else should not happen */\n if (bv)\n this.stack.push(bv);\n else {\n yield* this.pop();\n yield* this.step();\n }\n }\n else {\n const parent = this.peek(2);\n if (parent.type === 'block-map' &&\n ((this.type === 'map-value-ind' && parent.indent === fc.indent) ||\n (this.type === 'newline' &&\n !parent.items[parent.items.length - 1].sep))) {\n yield* this.pop();\n yield* this.step();\n }\n else if (this.type === 'map-value-ind' &&\n parent.type !== 'flow-collection') {\n const prev = getPrevProps(parent);\n const start = getFirstKeyStartProps(prev);\n fixFlowSeqItems(fc);\n const sep = fc.end.splice(1, fc.end.length);\n sep.push(this.sourceToken);\n const map = {\n type: 'block-map',\n offset: fc.offset,\n indent: fc.indent,\n items: [{ start, key: fc, sep }]\n };\n this.onKeyLine = true;\n this.stack[this.stack.length - 1] = map;\n }\n else {\n yield* this.lineEnd(fc);\n }\n }\n }\n flowScalar(type) {\n if (this.onNewLine) {\n let nl = this.source.indexOf('\\n') + 1;\n while (nl !== 0) {\n this.onNewLine(this.offset + nl);\n nl = this.source.indexOf('\\n', nl) + 1;\n }\n }\n return {\n type,\n offset: this.offset,\n indent: this.indent,\n source: this.source\n };\n }\n startBlockValue(parent) {\n switch (this.type) {\n case 'alias':\n case 'scalar':\n case 'single-quoted-scalar':\n case 'double-quoted-scalar':\n return this.flowScalar(this.type);\n case 'block-scalar-header':\n return {\n type: 'block-scalar',\n offset: this.offset,\n indent: this.indent,\n props: [this.sourceToken],\n source: ''\n };\n case 'flow-map-start':\n case 'flow-seq-start':\n return {\n type: 'flow-collection',\n offset: this.offset,\n indent: this.indent,\n start: this.sourceToken,\n items: [],\n end: []\n };\n case 'seq-item-ind':\n return {\n type: 'block-seq',\n offset: this.offset,\n indent: this.indent,\n items: [{ start: [this.sourceToken] }]\n };\n case 'explicit-key-ind': {\n this.onKeyLine = true;\n const prev = getPrevProps(parent);\n const start = getFirstKeyStartProps(prev);\n start.push(this.sourceToken);\n return {\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start, explicitKey: true }]\n };\n }\n case 'map-value-ind': {\n this.onKeyLine = true;\n const prev = getPrevProps(parent);\n const start = getFirstKeyStartProps(prev);\n return {\n type: 'block-map',\n offset: this.offset,\n indent: this.indent,\n items: [{ start, key: null, sep: [this.sourceToken] }]\n };\n }\n }\n return null;\n }\n atIndentedComment(start, indent) {\n if (this.type !== 'comment')\n return false;\n if (this.indent <= indent)\n return false;\n return start.every(st => st.type === 'newline' || st.type === 'space');\n }\n *documentEnd(docEnd) {\n if (this.type !== 'doc-mode') {\n if (docEnd.end)\n docEnd.end.push(this.sourceToken);\n else\n docEnd.end = [this.sourceToken];\n if (this.type === 'newline')\n yield* this.pop();\n }\n }\n *lineEnd(token) {\n switch (this.type) {\n case 'comma':\n case 'doc-start':\n case 'doc-end':\n case 'flow-seq-end':\n case 'flow-map-end':\n case 'map-value-ind':\n yield* this.pop();\n yield* this.step();\n break;\n case 'newline':\n this.onKeyLine = false;\n // fallthrough\n case 'space':\n case 'comment':\n default:\n // all other values are errors\n if (token.end)\n token.end.push(this.sourceToken);\n else\n token.end = [this.sourceToken];\n if (this.type === 'newline')\n yield* this.pop();\n }\n }\n}\n\nexport { Parser };\n","import { Composer } from './compose/composer.js';\nimport { Document } from './doc/Document.js';\nimport { prettifyError, YAMLParseError } from './errors.js';\nimport { warn } from './log.js';\nimport { isDocument } from './nodes/identity.js';\nimport { LineCounter } from './parse/line-counter.js';\nimport { Parser } from './parse/parser.js';\n\nfunction parseOptions(options) {\n const prettyErrors = options.prettyErrors !== false;\n const lineCounter = options.lineCounter || (prettyErrors && new LineCounter()) || null;\n return { lineCounter, prettyErrors };\n}\n/**\n * Parse the input as a stream of YAML documents.\n *\n * Documents should be separated from each other by `...` or `---` marker lines.\n *\n * @returns If an empty `docs` array is returned, it will be of type\n * EmptyStream and contain additional stream information. In\n * TypeScript, you should use `'empty' in docs` as a type guard for it.\n */\nfunction parseAllDocuments(source, options = {}) {\n const { lineCounter, prettyErrors } = parseOptions(options);\n const parser = new Parser(lineCounter?.addNewLine);\n const composer = new Composer(options);\n const docs = Array.from(composer.compose(parser.parse(source)));\n if (prettyErrors && lineCounter)\n for (const doc of docs) {\n doc.errors.forEach(prettifyError(source, lineCounter));\n doc.warnings.forEach(prettifyError(source, lineCounter));\n }\n if (docs.length > 0)\n return docs;\n return Object.assign([], { empty: true }, composer.streamInfo());\n}\n/** Parse an input string into a single YAML.Document */\nfunction parseDocument(source, options = {}) {\n const { lineCounter, prettyErrors } = parseOptions(options);\n const parser = new Parser(lineCounter?.addNewLine);\n const composer = new Composer(options);\n // `doc` is always set by compose.end(true) at the very latest\n let doc = null;\n for (const _doc of composer.compose(parser.parse(source), true, source.length)) {\n if (!doc)\n doc = _doc;\n else if (doc.options.logLevel !== 'silent') {\n doc.errors.push(new YAMLParseError(_doc.range.slice(0, 2), 'MULTIPLE_DOCS', 'Source contains multiple documents; please use YAML.parseAllDocuments()'));\n break;\n }\n }\n if (prettyErrors && lineCounter) {\n doc.errors.forEach(prettifyError(source, lineCounter));\n doc.warnings.forEach(prettifyError(source, lineCounter));\n }\n return doc;\n}\nfunction parse(src, reviver, options) {\n let _reviver = undefined;\n if (typeof reviver === 'function') {\n _reviver = reviver;\n }\n else if (options === undefined && reviver && typeof reviver === 'object') {\n options = reviver;\n }\n const doc = parseDocument(src, options);\n if (!doc)\n return null;\n doc.warnings.forEach(warning => warn(doc.options.logLevel, warning));\n if (doc.errors.length > 0) {\n if (doc.options.logLevel !== 'silent')\n throw doc.errors[0];\n else\n doc.errors = [];\n }\n return doc.toJS(Object.assign({ reviver: _reviver }, options));\n}\nfunction stringify(value, replacer, options) {\n let _replacer = null;\n if (typeof replacer === 'function' || Array.isArray(replacer)) {\n _replacer = replacer;\n }\n else if (options === undefined && replacer) {\n options = replacer;\n }\n if (typeof options === 'string')\n options = options.length;\n if (typeof options === 'number') {\n const indent = Math.round(options);\n options = indent < 1 ? undefined : indent > 8 ? { indent: 8 } : { indent };\n }\n if (value === undefined) {\n const { keepUndefined } = options ?? replacer ?? {};\n if (!keepUndefined)\n return undefined;\n }\n if (isDocument(value) && !_replacer)\n return value.toString(options);\n return new Document(value, _replacer, options).toString(options);\n}\n\nexport { parse, parseAllDocuments, parseDocument, stringify };\n","/**\n * @fileoverview Parser for Kaitai Struct YAML (.ksy) files\n * @module parser/KsyParser\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { parse as parseYaml } from 'yaml'\nimport {\n ParseError,\n ValidationError as KaitaiValidationError,\n} from '../utils/errors'\nimport type {\n KsySchema,\n ValidationResult,\n ValidationError,\n ValidationWarning,\n} from './schema'\n\n/**\n * Parser for Kaitai Struct YAML (.ksy) format definitions.\n * Converts YAML text into typed schema objects and validates them.\n *\n * @class KsyParser\n * @example\n * ```typescript\n * const parser = new KsyParser()\n * const schema = parser.parse(ksyYamlString)\n * ```\n */\nexport class KsyParser {\n /**\n * Parse a .ksy YAML string into a typed schema object.\n *\n * @param yaml - YAML string containing the .ksy definition\n * @param options - Parsing options\n * @returns Parsed and validated schema\n * @throws {ParseError} If YAML parsing fails\n * @throws {ValidationError} If schema validation fails\n */\n parse(yaml: string, options: ParseOptions = {}): KsySchema {\n const { validate = true, strict = false } = options\n\n // Parse YAML\n let parsed: unknown\n try {\n parsed = parseYaml(yaml)\n } catch (error) {\n throw new ParseError(\n `Failed to parse YAML: ${error instanceof Error ? error.message : String(error)}`\n )\n }\n\n // Ensure we have an object\n if (typeof parsed !== 'object' || parsed === null) {\n throw new ParseError('KSY file must contain an object')\n }\n\n const schema = parsed as KsySchema\n\n // Validate if requested\n if (validate) {\n const result = this.validate(schema, { strict })\n if (!result.valid) {\n const errorMessages = result.errors.map((e) => e.message).join('; ')\n throw new KaitaiValidationError(\n `Schema validation failed: ${errorMessages}`\n )\n }\n\n // Log warnings if any\n if (result.warnings.length > 0 && !strict) {\n console.warn(\n 'Schema validation warnings:',\n result.warnings.map((w) => w.message)\n )\n }\n }\n\n return schema\n }\n\n /**\n * Validate a schema object.\n *\n * @param schema - Schema to validate\n * @param options - Validation options\n * @returns Validation result with errors and warnings\n */\n validate(\n schema: KsySchema,\n options: ValidationOptions = {}\n ): ValidationResult {\n const { strict = false, isNested = false } = options\n const errors: ValidationError[] = []\n const warnings: ValidationWarning[] = []\n\n // Validate meta section (required for root schemas, optional for nested)\n if (!schema.meta && !isNested) {\n errors.push({\n message: 'Missing required \"meta\" section',\n path: [],\n code: 'MISSING_META',\n })\n } else if (schema.meta) {\n // Validate meta.id (required)\n if (!schema.meta.id) {\n errors.push({\n message: 'Missing required \"meta.id\" field',\n path: ['meta'],\n code: 'MISSING_META_ID',\n })\n } else if (typeof schema.meta.id !== 'string') {\n errors.push({\n message: '\"meta.id\" must be a string',\n path: ['meta', 'id'],\n code: 'INVALID_META_ID_TYPE',\n })\n } else if (!/^[a-z][a-z0-9_]*$/.test(schema.meta.id)) {\n warnings.push({\n message: '\"meta.id\" should follow snake_case naming convention',\n path: ['meta', 'id'],\n code: 'META_ID_NAMING',\n })\n }\n\n // Validate endianness\n if (schema.meta.endian) {\n if (\n typeof schema.meta.endian === 'string' &&\n schema.meta.endian !== 'le' &&\n schema.meta.endian !== 'be'\n ) {\n errors.push({\n message: '\"meta.endian\" must be \"le\" or \"be\"',\n path: ['meta', 'endian'],\n code: 'INVALID_ENDIAN',\n })\n }\n }\n }\n\n // Validate seq section\n if (schema.seq) {\n if (!Array.isArray(schema.seq)) {\n errors.push({\n message: '\"seq\" must be an array',\n path: ['seq'],\n code: 'INVALID_SEQ_TYPE',\n })\n } else {\n schema.seq.forEach((attr, index) => {\n this.validateAttribute(\n attr as Record<string, unknown>,\n ['seq', String(index)],\n errors,\n warnings,\n strict\n )\n })\n }\n }\n\n // Validate instances section\n if (schema.instances) {\n if (typeof schema.instances !== 'object') {\n errors.push({\n message: '\"instances\" must be an object',\n path: ['instances'],\n code: 'INVALID_INSTANCES_TYPE',\n })\n } else {\n Object.entries(schema.instances).forEach(([key, instance]) => {\n this.validateAttribute(\n instance as Record<string, unknown>,\n ['instances', key],\n errors,\n warnings,\n strict\n )\n })\n }\n }\n\n // Validate types section\n if (schema.types) {\n if (typeof schema.types !== 'object') {\n errors.push({\n message: '\"types\" must be an object',\n path: ['types'],\n code: 'INVALID_TYPES_TYPE',\n })\n } else {\n Object.entries(schema.types).forEach(([key, type]) => {\n // Nested types don't require meta section\n const typeResult = this.validate(type, { ...options, isNested: true })\n errors.push(\n ...typeResult.errors.map((e) => ({\n ...e,\n path: ['types', key, ...e.path],\n }))\n )\n warnings.push(\n ...typeResult.warnings.map((w) => ({\n ...w,\n path: ['types', key, ...w.path],\n }))\n )\n })\n }\n }\n\n // Validate enums section\n if (schema.enums) {\n if (typeof schema.enums !== 'object') {\n errors.push({\n message: '\"enums\" must be an object',\n path: ['enums'],\n code: 'INVALID_ENUMS_TYPE',\n })\n }\n }\n\n return {\n valid: errors.length === 0 && (strict ? warnings.length === 0 : true),\n errors,\n warnings,\n }\n }\n\n /**\n * Validate an attribute specification.\n *\n * @param attr - Attribute to validate\n * @param path - Path to this attribute in the schema\n * @param errors - Array to collect errors\n * @param warnings - Array to collect warnings\n * @param strict - Whether to be strict about warnings\n * @private\n */\n private validateAttribute(\n attr: Record<string, unknown>,\n path: string[],\n errors: ValidationError[],\n warnings: ValidationWarning[],\n _strict: boolean\n ): void {\n // Validate id naming\n if (attr.id && typeof attr.id === 'string') {\n if (!/^[a-z][a-z0-9_]*$/.test(attr.id)) {\n warnings.push({\n message: `Field \"${attr.id}\" should follow snake_case naming convention`,\n path: [...path, 'id'],\n code: 'FIELD_ID_NAMING',\n })\n }\n }\n\n // Validate repeat\n if (attr.repeat) {\n if (\n attr.repeat !== 'expr' &&\n attr.repeat !== 'eos' &&\n attr.repeat !== 'until'\n ) {\n errors.push({\n message: '\"repeat\" must be \"expr\", \"eos\", or \"until\"',\n path: [...path, 'repeat'],\n code: 'INVALID_REPEAT',\n })\n }\n\n // Check for required fields based on repeat type\n if (attr.repeat === 'expr' && !attr['repeat-expr']) {\n errors.push({\n message: '\"repeat-expr\" is required when repeat is \"expr\"',\n path: [...path, 'repeat-expr'],\n code: 'MISSING_REPEAT_EXPR',\n })\n }\n\n if (attr.repeat === 'until' && !attr['repeat-until']) {\n errors.push({\n message: '\"repeat-until\" is required when repeat is \"until\"',\n path: [...path, 'repeat-until'],\n code: 'MISSING_REPEAT_UNTIL',\n })\n }\n }\n\n // Validate size-eos\n if (attr['size-eos'] && attr.size) {\n warnings.push({\n message: '\"size-eos\" and \"size\" are mutually exclusive',\n path: [...path],\n code: 'SIZE_EOS_WITH_SIZE',\n })\n }\n\n // Validate contents\n if (attr.contents) {\n if (!Array.isArray(attr.contents) && typeof attr.contents !== 'string') {\n errors.push({\n message: '\"contents\" must be an array or string',\n path: [...path, 'contents'],\n code: 'INVALID_CONTENTS_TYPE',\n })\n }\n }\n }\n\n /**\n * Parse multiple .ksy files and resolve imports.\n *\n * @param mainYaml - Main .ksy file content\n * @param imports - Map of import names to their YAML content\n * @param options - Parsing options\n * @returns Parsed schema with resolved imports\n * @throws {ParseError} If import resolution fails\n * @example\n * ```typescript\n * const parser = new KsyParser()\n * const imports = new Map([\n * ['/common/riff', riffYamlContent]\n * ])\n * const schema = parser.parseWithImports(wavYaml, imports)\n * ```\n */\n parseWithImports(\n mainYaml: string,\n imports: Map<string, string>,\n options: ParseOptions = {}\n ): KsySchema {\n // Parse main schema\n const mainSchema = this.parse(mainYaml, options)\n\n // If no imports declared, return as-is\n if (!mainSchema.meta.imports || mainSchema.meta.imports.length === 0) {\n return mainSchema\n }\n\n // Resolve imports\n const resolvedTypes: Record<string, KsySchema> = {}\n\n for (const importPath of mainSchema.meta.imports) {\n // Check if import is provided\n if (!imports.has(importPath)) {\n throw new ParseError(\n `Import not found: ${importPath}. Available imports: ${Array.from(imports.keys()).join(', ')}`\n )\n }\n\n // Parse the imported schema\n const importYaml = imports.get(importPath)!\n const importedSchema = this.parse(importYaml, {\n ...options,\n validate: false, // Skip validation for imported schemas\n })\n\n // Extract the namespace from the import path\n // e.g., '/common/riff' -> 'riff'\n const namespace = this.extractNamespace(importPath)\n\n // Add imported types to the resolved types with namespace prefix\n if (importedSchema.types) {\n for (const [typeName, typeSchema] of Object.entries(\n importedSchema.types\n )) {\n const qualifiedName = `${namespace}::${typeName}`\n resolvedTypes[qualifiedName] = typeSchema\n }\n }\n\n // Add the root imported schema as a type\n // This allows referencing the imported schema directly\n resolvedTypes[namespace] = {\n meta: importedSchema.meta,\n seq: importedSchema.seq,\n instances: importedSchema.instances,\n types: importedSchema.types,\n enums: importedSchema.enums,\n }\n\n // Merge enums from imported schema\n if (importedSchema.enums) {\n if (!mainSchema.enums) {\n mainSchema.enums = {}\n }\n for (const [enumName, enumSpec] of Object.entries(\n importedSchema.enums\n )) {\n const qualifiedEnumName = `${namespace}::${enumName}`\n mainSchema.enums[qualifiedEnumName] = enumSpec\n }\n }\n }\n\n // Merge resolved types into main schema\n if (Object.keys(resolvedTypes).length > 0) {\n mainSchema.types = {\n ...resolvedTypes,\n ...mainSchema.types,\n }\n }\n\n return mainSchema\n }\n\n /**\n * Extract namespace from import path.\n * Converts paths like '/common/riff' or 'common/riff' to 'riff'.\n *\n * @param importPath - Import path from meta.imports\n * @returns Namespace identifier\n * @private\n */\n private extractNamespace(importPath: string): string {\n // Remove leading slash if present\n const normalized = importPath.startsWith('/')\n ? importPath.slice(1)\n : importPath\n\n // Get the last segment of the path\n const segments = normalized.split('/')\n return segments[segments.length - 1]\n }\n}\n\n/**\n * Options for parsing .ksy files.\n *\n * @interface ParseOptions\n */\nexport interface ParseOptions {\n /** Whether to validate the schema (default: true) */\n validate?: boolean\n\n /** Whether to treat warnings as errors (default: false) */\n strict?: boolean\n}\n\n/**\n * Options for schema validation.\n *\n * @interface ValidationOptions\n */\nexport interface ValidationOptions {\n /** Whether to treat warnings as errors (default: false) */\n strict?: boolean\n\n /** Whether this is a nested type (meta section optional) (default: false) */\n isNested?: boolean\n}\n","/**\n * @fileoverview Execution context for Kaitai Struct parsing\n * @module interpreter/Context\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport type { KaitaiStream } from '../stream'\nimport type { EnumSpec } from '../parser/schema'\n\n/**\n * Execution context for parsing operations.\n * Provides access to the current object, parent, root, and stream.\n *\n * @class Context\n * @example\n * ```typescript\n * const context = new Context(stream, root)\n * context.pushParent(currentObject)\n * const value = evaluator.evaluate(expression, context)\n * context.popParent()\n * ```\n */\nexport class Context {\n /** Stack of parent objects */\n private parentStack: unknown[] = []\n\n /** Current object being parsed */\n private _current: Record<string, unknown> = {}\n\n /** Enum definitions from schema */\n private _enums: Record<string, EnumSpec> = {}\n\n /**\n * Create a new execution context.\n *\n * @param _io - Binary stream being read\n * @param _root - Root object of the parse tree\n * @param _parent - Parent object (optional)\n * @param enums - Enum definitions from schema (optional)\n */\n constructor(\n private _io: KaitaiStream,\n private _root: unknown = null,\n _parent: unknown = null,\n enums?: Record<string, EnumSpec>\n ) {\n if (_parent !== null) {\n this.parentStack.push(_parent)\n }\n if (enums) {\n this._enums = enums\n }\n }\n\n /**\n * Get the current I/O stream.\n * Accessible in expressions as `_io`.\n *\n * @returns Current stream\n */\n get io(): KaitaiStream {\n return this._io\n }\n\n /**\n * Get the root object.\n * Accessible in expressions as `_root`.\n *\n * @returns Root object\n */\n get root(): unknown {\n return this._root\n }\n\n /**\n * Get the parent object.\n * Accessible in expressions as `_parent`.\n *\n * @returns Parent object or null if at root\n */\n get parent(): unknown {\n return this.parentStack.length > 0\n ? this.parentStack[this.parentStack.length - 1]\n : null\n }\n\n /**\n * Get the current object being parsed.\n * Used to access fields defined earlier in the sequence.\n *\n * @returns Current object\n */\n get current(): Record<string, unknown> {\n return this._current\n }\n\n /**\n * Set the current object.\n *\n * @param obj - Object to set as current\n */\n set current(obj: Record<string, unknown>) {\n this._current = obj\n }\n\n /**\n * Push a new parent onto the stack.\n * Used when entering a nested type.\n *\n * @param parent - Parent object to push\n */\n pushParent(parent: unknown): void {\n this.parentStack.push(parent)\n }\n\n /**\n * Pop the current parent from the stack.\n * Used when exiting a nested type.\n *\n * @returns The popped parent object\n */\n popParent(): unknown {\n return this.parentStack.pop()\n }\n\n /**\n * Get a value from the context by path.\n * Supports special names: _io, _root, _parent, _index.\n *\n * @param name - Name or path to resolve\n * @returns Resolved value\n */\n resolve(name: string): unknown {\n // Handle special names\n switch (name) {\n case '_io':\n return this._io\n case '_root':\n return this._root\n case '_parent':\n return this.parent\n case '_index':\n // Index is set externally during repetition\n return (this._current as Record<string, unknown>)['_index']\n default:\n // Look in current object\n if (name in this._current) {\n return this._current[name]\n }\n // Not found\n return undefined\n }\n }\n\n /**\n * Set a value in the current object.\n *\n * @param name - Field name\n * @param value - Value to set\n */\n set(name: string, value: unknown): void {\n this._current[name] = value\n }\n\n /**\n * Get enum value by name.\n * Used for enum access in expressions (EnumName::value).\n *\n * @param enumName - Name of the enum\n * @param valueName - Name of the enum value\n * @returns Enum value (number) or undefined\n */\n getEnumValue(enumName: string, valueName: string): unknown {\n const enumDef = this._enums[enumName]\n if (!enumDef) {\n return undefined\n }\n\n // Enum definitions map integer values to string names\n // e.g., { 0: \"unknown\", 1: \"text\" }\n // We need to reverse-lookup: given \"text\", return 1\n for (const [key, value] of Object.entries(enumDef)) {\n if (value === valueName) {\n // Convert key to number\n const numKey = Number(key)\n return isNaN(numKey) ? key : numKey\n }\n }\n\n return undefined\n }\n\n /**\n * Check if an enum exists.\n *\n * @param enumName - Name of the enum\n * @returns True if enum exists\n */\n hasEnum(enumName: string): boolean {\n return enumName in this._enums\n }\n\n /**\n * Create a child context for nested parsing.\n * The current object becomes the parent in the child context.\n *\n * @param stream - Stream for the child context (defaults to current stream)\n * @returns New child context\n */\n createChild(stream?: KaitaiStream): Context {\n const childContext = new Context(\n stream || this._io,\n this._root || this._current,\n this._current,\n this._enums\n )\n return childContext\n }\n\n /**\n * Clone this context.\n * Creates a shallow copy with the same stream, root, and parent.\n *\n * @returns Cloned context\n */\n clone(): Context {\n const cloned = new Context(this._io, this._root, this.parent, this._enums)\n cloned._current = { ...this._current }\n cloned.parentStack = [...this.parentStack]\n return cloned\n }\n}\n","/**\n * @fileoverview Token types for Kaitai Struct expression language\n * @module expression/Token\n * @author Fabiano Pinto\n * @license MIT\n */\n\n/**\n * Token types in the expression language.\n */\nexport enum TokenType {\n // Literals\n NUMBER = 'NUMBER',\n STRING = 'STRING',\n BOOLEAN = 'BOOLEAN',\n IDENTIFIER = 'IDENTIFIER',\n\n // Operators\n PLUS = 'PLUS', // +\n MINUS = 'MINUS', // -\n STAR = 'STAR', // *\n SLASH = 'SLASH', // /\n PERCENT = 'PERCENT', // %\n\n // Comparison\n LT = 'LT', // <\n LE = 'LE', // <=\n GT = 'GT', // >\n GE = 'GE', // >=\n EQ = 'EQ', // ==\n NE = 'NE', // !=\n\n // Bitwise\n LSHIFT = 'LSHIFT', // <<\n RSHIFT = 'RSHIFT', // >>\n AMPERSAND = 'AMPERSAND', // &\n PIPE = 'PIPE', // |\n CARET = 'CARET', // ^\n\n // Logical\n AND = 'AND', // and\n OR = 'OR', // or\n NOT = 'NOT', // not\n\n // Ternary\n QUESTION = 'QUESTION', // ?\n COLON = 'COLON', // :\n\n // Grouping\n LPAREN = 'LPAREN', // (\n RPAREN = 'RPAREN', // )\n LBRACKET = 'LBRACKET', // [\n RBRACKET = 'RBRACKET', // ]\n\n // Access\n DOT = 'DOT', // .\n DOUBLE_COLON = 'DOUBLE_COLON', // ::\n COMMA = 'COMMA', // ,\n\n // Special\n EOF = 'EOF',\n}\n\n/**\n * Token in the expression language.\n *\n * @interface Token\n */\nexport interface Token {\n /** Token type */\n type: TokenType\n\n /** Token value (for literals and identifiers) */\n value: string | number | boolean | null\n\n /** Position in the source string */\n position: number\n}\n\n/**\n * Create a token.\n *\n * @param type - Token type\n * @param value - Token value\n * @param position - Position in source\n * @returns Token object\n */\nexport function createToken(\n type: TokenType,\n value: string | number | boolean | null = null,\n position: number = 0\n): Token {\n return { type, value, position }\n}\n","/**\n * @fileoverview Lexer for Kaitai Struct expression language\n * @module expression/Lexer\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { ParseError } from '../utils/errors'\nimport { Token, TokenType, createToken } from './Token'\n\n/**\n * Lexer for tokenizing Kaitai Struct expressions.\n * Converts expression strings into a stream of tokens.\n *\n * @class Lexer\n * @example\n * ```typescript\n * const lexer = new Lexer('field1 + field2 * 2')\n * const tokens = lexer.tokenize()\n * ```\n */\nexport class Lexer {\n private input: string\n private position: number = 0\n private current: string | null = null\n\n /**\n * Create a new lexer.\n *\n * @param input - Expression string to tokenize\n */\n constructor(input: string) {\n this.input = input\n this.current = input.length > 0 ? input[0] : null\n }\n\n /**\n * Tokenize the entire input string.\n *\n * @returns Array of tokens\n * @throws {ParseError} If invalid syntax is encountered\n */\n tokenize(): Token[] {\n const tokens: Token[] = []\n\n while (this.current !== null) {\n // Skip whitespace\n if (this.isWhitespace(this.current)) {\n this.skipWhitespace()\n continue\n }\n\n // Numbers\n if (this.isDigit(this.current)) {\n tokens.push(this.readNumber())\n continue\n }\n\n // Identifiers and keywords\n if (this.isIdentifierStart(this.current)) {\n tokens.push(this.readIdentifierOrKeyword())\n continue\n }\n\n // Strings\n if (this.current === '\"' || this.current === \"'\") {\n tokens.push(this.readString())\n continue\n }\n\n // Operators and punctuation\n const token = this.readOperator()\n if (token) {\n tokens.push(token)\n continue\n }\n\n throw new ParseError(\n `Unexpected character: ${this.current}`,\n this.position\n )\n }\n\n tokens.push(createToken(TokenType.EOF, null, this.position))\n return tokens\n }\n\n /**\n * Advance to the next character.\n * @private\n */\n private advance(): void {\n this.position++\n this.current =\n this.position < this.input.length ? this.input[this.position] : null\n }\n\n /**\n * Peek at the next character without advancing.\n * @private\n */\n private peek(offset: number = 1): string | null {\n const pos = this.position + offset\n return pos < this.input.length ? this.input[pos] : null\n }\n\n /**\n * Check if character is whitespace.\n * @private\n */\n private isWhitespace(char: string): boolean {\n return /\\s/.test(char)\n }\n\n /**\n * Check if character is a digit.\n * @private\n */\n private isDigit(char: string): boolean {\n return /[0-9]/.test(char)\n }\n\n /**\n * Check if character can start an identifier.\n * @private\n */\n private isIdentifierStart(char: string): boolean {\n return /[a-zA-Z_]/.test(char)\n }\n\n /**\n * Check if character can be part of an identifier.\n * @private\n */\n private isIdentifierPart(char: string): boolean {\n return /[a-zA-Z0-9_]/.test(char)\n }\n\n /**\n * Skip whitespace characters.\n * @private\n */\n private skipWhitespace(): void {\n while (this.current !== null && this.isWhitespace(this.current)) {\n this.advance()\n }\n }\n\n /**\n * Read a number token.\n * @private\n */\n private readNumber(): Token {\n const start = this.position\n let value = ''\n\n // Handle hex numbers (0x...)\n if (this.current === '0' && this.peek() === 'x') {\n value += this.current\n this.advance()\n value += this.current\n this.advance()\n\n while (this.current !== null && /[0-9a-fA-F]/.test(this.current)) {\n value += this.current\n this.advance()\n }\n\n return createToken(TokenType.NUMBER, parseInt(value, 16), start)\n }\n\n // Handle binary numbers (0b...)\n if (this.current === '0' && this.peek() === 'b') {\n value += this.current\n this.advance()\n value += this.current\n this.advance()\n\n while (this.current !== null && /[01]/.test(this.current)) {\n value += this.current\n this.advance()\n }\n\n return createToken(TokenType.NUMBER, parseInt(value, 2), start)\n }\n\n // Regular decimal number\n while (this.current !== null && this.isDigit(this.current)) {\n value += this.current\n this.advance()\n }\n\n // Handle decimal point\n if (this.current === '.' && this.peek() && this.isDigit(this.peek()!)) {\n value += this.current\n this.advance()\n\n while (this.current !== null && this.isDigit(this.current)) {\n value += this.current\n this.advance()\n }\n\n return createToken(TokenType.NUMBER, parseFloat(value), start)\n }\n\n return createToken(TokenType.NUMBER, parseInt(value, 10), start)\n }\n\n /**\n * Read an identifier or keyword token.\n * @private\n */\n private readIdentifierOrKeyword(): Token {\n const start = this.position\n let value = ''\n\n while (this.current !== null && this.isIdentifierPart(this.current)) {\n value += this.current\n this.advance()\n }\n\n // Check for keywords\n switch (value) {\n case 'true':\n return createToken(TokenType.BOOLEAN, true, start)\n case 'false':\n return createToken(TokenType.BOOLEAN, false, start)\n case 'and':\n return createToken(TokenType.AND, value, start)\n case 'or':\n return createToken(TokenType.OR, value, start)\n case 'not':\n return createToken(TokenType.NOT, value, start)\n default:\n return createToken(TokenType.IDENTIFIER, value, start)\n }\n }\n\n /**\n * Read a string token.\n * @private\n */\n private readString(): Token {\n const start = this.position\n const quote = this.current\n let value = ''\n\n this.advance() // Skip opening quote\n\n while (this.current !== null && this.current !== quote) {\n if (this.current === '\\\\') {\n this.advance()\n if (this.current === null) {\n throw new ParseError('Unterminated string', start)\n }\n // Handle escape sequences\n const ch = this.current as string\n if (ch === 'n') {\n value += '\\n'\n } else if (ch === 't') {\n value += '\\t'\n } else if (ch === 'r') {\n value += '\\r'\n } else if (ch === '\\\\') {\n value += '\\\\'\n } else if (ch === '\"') {\n value += '\"'\n } else if (ch === \"'\") {\n value += \"'\"\n } else {\n value += ch\n }\n } else {\n value += this.current\n }\n this.advance()\n }\n\n if (this.current === null) {\n throw new ParseError('Unterminated string', start)\n }\n\n this.advance() // Skip closing quote\n\n return createToken(TokenType.STRING, value, start)\n }\n\n /**\n * Read an operator or punctuation token.\n * @private\n */\n private readOperator(): Token | null {\n const start = this.position\n const char = this.current!\n\n switch (char) {\n case '+':\n this.advance()\n return createToken(TokenType.PLUS, char, start)\n\n case '-':\n this.advance()\n return createToken(TokenType.MINUS, char, start)\n\n case '*':\n this.advance()\n return createToken(TokenType.STAR, char, start)\n\n case '/':\n this.advance()\n return createToken(TokenType.SLASH, char, start)\n\n case '%':\n this.advance()\n return createToken(TokenType.PERCENT, char, start)\n\n case '<':\n this.advance()\n if (this.current === '=') {\n this.advance()\n return createToken(TokenType.LE, '<=', start)\n } else if (this.current === '<') {\n this.advance()\n return createToken(TokenType.LSHIFT, '<<', start)\n }\n return createToken(TokenType.LT, '<', start)\n\n case '>':\n this.advance()\n if (this.current === '=') {\n this.advance()\n return createToken(TokenType.GE, '>=', start)\n } else if (this.current === '>') {\n this.advance()\n return createToken(TokenType.RSHIFT, '>>', start)\n }\n return createToken(TokenType.GT, '>', start)\n\n case '=':\n this.advance()\n if (this.current === '=') {\n this.advance()\n return createToken(TokenType.EQ, '==', start)\n }\n throw new ParseError('Expected == for equality', start)\n\n case '!':\n this.advance()\n if (this.current === '=') {\n this.advance()\n return createToken(TokenType.NE, '!=', start)\n }\n throw new ParseError('Expected != for inequality', start)\n\n case '&':\n this.advance()\n return createToken(TokenType.AMPERSAND, char, start)\n\n case '|':\n this.advance()\n return createToken(TokenType.PIPE, char, start)\n\n case '^':\n this.advance()\n return createToken(TokenType.CARET, char, start)\n\n case '?':\n this.advance()\n return createToken(TokenType.QUESTION, char, start)\n\n case ':':\n this.advance()\n if (this.current === ':') {\n this.advance()\n return createToken(TokenType.DOUBLE_COLON, '::', start)\n }\n return createToken(TokenType.COLON, char, start)\n\n case '(':\n this.advance()\n return createToken(TokenType.LPAREN, char, start)\n\n case ')':\n this.advance()\n return createToken(TokenType.RPAREN, char, start)\n\n case '[':\n this.advance()\n return createToken(TokenType.LBRACKET, char, start)\n\n case ']':\n this.advance()\n return createToken(TokenType.RBRACKET, char, start)\n\n case '.':\n this.advance()\n return createToken(TokenType.DOT, char, start)\n\n case ',':\n this.advance()\n return createToken(TokenType.COMMA, char, start)\n\n default:\n return null\n }\n }\n}\n","/**\n * @fileoverview Abstract Syntax Tree nodes for expression language\n * @module expression/AST\n * @author Fabiano Pinto\n * @license MIT\n */\n\n/**\n * Base interface for all AST nodes.\n */\nexport interface ASTNode {\n /** Node type discriminator */\n kind: string\n}\n\n/**\n * Literal value node (number, string, boolean).\n */\nexport interface LiteralNode extends ASTNode {\n kind: 'Literal'\n value: number | string | boolean\n}\n\n/**\n * Identifier node (variable reference).\n */\nexport interface IdentifierNode extends ASTNode {\n kind: 'Identifier'\n name: string\n}\n\n/**\n * Binary operation node (e.g., a + b).\n */\nexport interface BinaryOpNode extends ASTNode {\n kind: 'BinaryOp'\n operator: string\n left: ASTNode\n right: ASTNode\n}\n\n/**\n * Unary operation node (e.g., -a, not b).\n */\nexport interface UnaryOpNode extends ASTNode {\n kind: 'UnaryOp'\n operator: string\n operand: ASTNode\n}\n\n/**\n * Ternary conditional node (condition ? ifTrue : ifFalse).\n */\nexport interface TernaryNode extends ASTNode {\n kind: 'Ternary'\n condition: ASTNode\n ifTrue: ASTNode\n ifFalse: ASTNode\n}\n\n/**\n * Member access node (object.property).\n */\nexport interface MemberAccessNode extends ASTNode {\n kind: 'MemberAccess'\n object: ASTNode\n property: string\n}\n\n/**\n * Array/index access node (array[index]).\n */\nexport interface IndexAccessNode extends ASTNode {\n kind: 'IndexAccess'\n object: ASTNode\n index: ASTNode\n}\n\n/**\n * Method call node (object.method()).\n */\nexport interface MethodCallNode extends ASTNode {\n kind: 'MethodCall'\n object: ASTNode\n method: string\n args: ASTNode[]\n}\n\n/**\n * Enum access node (EnumName::value).\n */\nexport interface EnumAccessNode extends ASTNode {\n kind: 'EnumAccess'\n enumName: string\n value: string\n}\n\n/**\n * Array literal node ([a, b, c]).\n */\nexport interface ArrayLiteralNode extends ASTNode {\n kind: 'ArrayLiteral'\n elements: ASTNode[]\n}\n\n/**\n * Type union for all AST nodes.\n */\nexport type Expression =\n | LiteralNode\n | IdentifierNode\n | BinaryOpNode\n | UnaryOpNode\n | TernaryNode\n | MemberAccessNode\n | IndexAccessNode\n | MethodCallNode\n | EnumAccessNode\n | ArrayLiteralNode\n\n/**\n * Create a literal node.\n */\nexport function createLiteral(value: number | string | boolean): LiteralNode {\n return { kind: 'Literal', value }\n}\n\n/**\n * Create an identifier node.\n */\nexport function createIdentifier(name: string): IdentifierNode {\n return { kind: 'Identifier', name }\n}\n\n/**\n * Create a binary operation node.\n */\nexport function createBinaryOp(\n operator: string,\n left: ASTNode,\n right: ASTNode\n): BinaryOpNode {\n return { kind: 'BinaryOp', operator, left, right }\n}\n\n/**\n * Create a unary operation node.\n */\nexport function createUnaryOp(operator: string, operand: ASTNode): UnaryOpNode {\n return { kind: 'UnaryOp', operator, operand }\n}\n\n/**\n * Create a ternary conditional node.\n */\nexport function createTernary(\n condition: ASTNode,\n ifTrue: ASTNode,\n ifFalse: ASTNode\n): TernaryNode {\n return { kind: 'Ternary', condition, ifTrue, ifFalse }\n}\n\n/**\n * Create a member access node.\n */\nexport function createMemberAccess(\n object: ASTNode,\n property: string\n): MemberAccessNode {\n return { kind: 'MemberAccess', object, property }\n}\n\n/**\n * Create an index access node.\n */\nexport function createIndexAccess(\n object: ASTNode,\n index: ASTNode\n): IndexAccessNode {\n return { kind: 'IndexAccess', object, index }\n}\n\n/**\n * Create a method call node.\n */\nexport function createMethodCall(\n object: ASTNode,\n method: string,\n args: ASTNode[]\n): MethodCallNode {\n return { kind: 'MethodCall', object, method, args }\n}\n\n/**\n * Create an enum access node.\n */\nexport function createEnumAccess(\n enumName: string,\n value: string\n): EnumAccessNode {\n return { kind: 'EnumAccess', enumName, value }\n}\n\n/**\n * Create an array literal node.\n */\nexport function createArrayLiteral(elements: ASTNode[]): ArrayLiteralNode {\n return { kind: 'ArrayLiteral', elements }\n}\n","/**\n * @fileoverview Parser for Kaitai Struct expression language\n * @module expression/Parser\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { ParseError } from '../utils/errors'\nimport { Token, TokenType } from './Token'\nimport type { ASTNode } from './AST'\nimport {\n createLiteral,\n createIdentifier,\n createBinaryOp,\n createUnaryOp,\n createTernary,\n createMemberAccess,\n createIndexAccess,\n createMethodCall,\n createEnumAccess,\n createArrayLiteral,\n} from './AST'\n\n/**\n * Parser for Kaitai Struct expressions.\n * Converts tokens into an Abstract Syntax Tree (AST).\n *\n * @class ExpressionParser\n * @example\n * ```typescript\n * const lexer = new Lexer('field1 + field2 * 2')\n * const tokens = lexer.tokenize()\n * const parser = new ExpressionParser(tokens)\n * const ast = parser.parse()\n * ```\n */\nexport class ExpressionParser {\n private tokens: Token[]\n private position: number = 0\n\n /**\n * Create a new expression parser.\n *\n * @param tokens - Array of tokens to parse\n */\n constructor(tokens: Token[]) {\n this.tokens = tokens\n }\n\n /**\n * Parse the tokens into an AST.\n *\n * @returns Root AST node\n * @throws {ParseError} If invalid syntax is encountered\n */\n parse(): ASTNode {\n const expr = this.parseTernary()\n if (!this.isAtEnd()) {\n throw new ParseError(\n `Unexpected token: ${this.current().type}`,\n this.current().position\n )\n }\n return expr\n }\n\n /**\n * Get the current token.\n * @private\n */\n private current(): Token {\n return this.tokens[this.position]\n }\n\n /**\n * Check if we're at the end of tokens.\n * @private\n */\n private isAtEnd(): boolean {\n return this.current().type === TokenType.EOF\n }\n\n /**\n * Advance to the next token.\n * @private\n */\n private advance(): Token {\n if (!this.isAtEnd()) {\n this.position++\n }\n return this.tokens[this.position - 1]\n }\n\n /**\n * Check if current token matches any of the given types.\n * @private\n */\n private match(...types: TokenType[]): boolean {\n for (const type of types) {\n if (this.current().type === type) {\n this.advance()\n return true\n }\n }\n return false\n }\n\n /**\n * Expect a specific token type and advance.\n * @private\n */\n private expect(type: TokenType, message: string): Token {\n if (this.current().type !== type) {\n throw new ParseError(message, this.current().position)\n }\n return this.advance()\n }\n\n /**\n * Parse ternary conditional (lowest precedence).\n * condition ? ifTrue : ifFalse\n * @private\n */\n private parseTernary(): ASTNode {\n let expr = this.parseLogicalOr()\n\n if (this.match(TokenType.QUESTION)) {\n const ifTrue = this.parseTernary()\n this.expect(TokenType.COLON, 'Expected : in ternary expression')\n const ifFalse = this.parseTernary()\n return createTernary(expr, ifTrue, ifFalse)\n }\n\n return expr\n }\n\n /**\n * Parse logical OR.\n * @private\n */\n private parseLogicalOr(): ASTNode {\n let left = this.parseLogicalAnd()\n\n while (this.match(TokenType.OR)) {\n const operator = 'or'\n const right = this.parseLogicalAnd()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse logical AND.\n * @private\n */\n private parseLogicalAnd(): ASTNode {\n let left = this.parseBitwiseOr()\n\n while (this.match(TokenType.AND)) {\n const operator = 'and'\n const right = this.parseBitwiseOr()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse bitwise OR.\n * @private\n */\n private parseBitwiseOr(): ASTNode {\n let left = this.parseBitwiseXor()\n\n while (this.match(TokenType.PIPE)) {\n const operator = '|'\n const right = this.parseBitwiseXor()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse bitwise XOR.\n * @private\n */\n private parseBitwiseXor(): ASTNode {\n let left = this.parseBitwiseAnd()\n\n while (this.match(TokenType.CARET)) {\n const operator = '^'\n const right = this.parseBitwiseAnd()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse bitwise AND.\n * @private\n */\n private parseBitwiseAnd(): ASTNode {\n let left = this.parseEquality()\n\n while (this.match(TokenType.AMPERSAND)) {\n const operator = '&'\n const right = this.parseEquality()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse equality operators (==, !=).\n * @private\n */\n private parseEquality(): ASTNode {\n let left = this.parseRelational()\n\n while (this.match(TokenType.EQ, TokenType.NE)) {\n const operator = this.tokens[this.position - 1].value as string\n const right = this.parseRelational()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse relational operators (<, <=, >, >=).\n * @private\n */\n private parseRelational(): ASTNode {\n let left = this.parseBitShift()\n\n while (this.match(TokenType.LT, TokenType.LE, TokenType.GT, TokenType.GE)) {\n const operator = this.tokens[this.position - 1].value as string\n const right = this.parseBitShift()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse bit shift operators (<<, >>).\n * @private\n */\n private parseBitShift(): ASTNode {\n let left = this.parseAdditive()\n\n while (this.match(TokenType.LSHIFT, TokenType.RSHIFT)) {\n const operator = this.tokens[this.position - 1].value as string\n const right = this.parseAdditive()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse additive operators (+, -).\n * @private\n */\n private parseAdditive(): ASTNode {\n let left = this.parseMultiplicative()\n\n while (this.match(TokenType.PLUS, TokenType.MINUS)) {\n const operator = this.tokens[this.position - 1].value as string\n const right = this.parseMultiplicative()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse multiplicative operators (*, /, %).\n * @private\n */\n private parseMultiplicative(): ASTNode {\n let left = this.parseUnary()\n\n while (this.match(TokenType.STAR, TokenType.SLASH, TokenType.PERCENT)) {\n const operator = this.tokens[this.position - 1].value as string\n const right = this.parseUnary()\n left = createBinaryOp(operator, left, right)\n }\n\n return left\n }\n\n /**\n * Parse unary operators (-, not).\n * @private\n */\n private parseUnary(): ASTNode {\n if (this.match(TokenType.MINUS, TokenType.NOT)) {\n const operator = this.tokens[this.position - 1].value as string\n const operand = this.parseUnary()\n return createUnaryOp(operator, operand)\n }\n\n return this.parsePostfix()\n }\n\n /**\n * Parse postfix operators (., [], ()).\n * @private\n */\n private parsePostfix(): ASTNode {\n let expr = this.parsePrimary()\n\n while (true) {\n if (this.match(TokenType.DOT)) {\n const property = this.expect(\n TokenType.IDENTIFIER,\n 'Expected property name after .'\n )\n expr = createMemberAccess(expr, property.value as string)\n } else if (this.match(TokenType.LBRACKET)) {\n const index = this.parseTernary()\n this.expect(TokenType.RBRACKET, 'Expected ] after array index')\n expr = createIndexAccess(expr, index)\n } else if (this.current().type === TokenType.LPAREN) {\n // Method call (only if expr is a member access)\n if (expr.kind === 'MemberAccess') {\n this.advance() // consume (\n const args: ASTNode[] = []\n\n if (this.current().type !== TokenType.RPAREN) {\n args.push(this.parseTernary())\n while (this.match(TokenType.COMMA)) {\n args.push(this.parseTernary())\n }\n }\n\n this.expect(TokenType.RPAREN, 'Expected ) after arguments')\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const memberExpr = expr as any\n expr = createMethodCall(memberExpr.object, memberExpr.property, args)\n } else {\n break\n }\n } else {\n break\n }\n }\n\n return expr\n }\n\n /**\n * Parse primary expressions (literals, identifiers, grouping).\n * @private\n */\n private parsePrimary(): ASTNode {\n // Literals\n if (this.match(TokenType.NUMBER, TokenType.STRING, TokenType.BOOLEAN)) {\n const token = this.tokens[this.position - 1]\n return createLiteral(token.value as number | string | boolean)\n }\n\n // Identifiers and enum access\n if (this.match(TokenType.IDENTIFIER)) {\n const name = this.tokens[this.position - 1].value as string\n\n // Check for enum access (EnumName::value)\n if (this.match(TokenType.DOUBLE_COLON)) {\n const value = this.expect(\n TokenType.IDENTIFIER,\n 'Expected enum value after ::'\n )\n return createEnumAccess(name, value.value as string)\n }\n\n return createIdentifier(name)\n }\n\n // Grouping\n if (this.match(TokenType.LPAREN)) {\n const expr = this.parseTernary()\n this.expect(TokenType.RPAREN, 'Expected ) after expression')\n return expr\n }\n\n // Array literal\n if (this.match(TokenType.LBRACKET)) {\n const elements: ASTNode[] = []\n if (this.current().type !== TokenType.RBRACKET) {\n elements.push(this.parseTernary())\n while (this.match(TokenType.COMMA)) {\n elements.push(this.parseTernary())\n }\n }\n this.expect(TokenType.RBRACKET, 'Expected ] after array literal')\n return createArrayLiteral(elements)\n }\n\n throw new ParseError(\n `Unexpected token: ${this.current().type}`,\n this.current().position\n )\n }\n}\n","/**\n * @fileoverview Evaluator for Kaitai Struct expression AST\n * @module expression/Evaluator\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { ParseError } from '../utils/errors'\nimport type { Context } from '../interpreter/Context'\nimport type { ASTNode } from './AST'\n\n/**\n * Evaluator for expression AST nodes.\n * Executes expressions in the context of parsed data.\n *\n * @class Evaluator\n * @example\n * ```typescript\n * const evaluator = new Evaluator()\n * const result = evaluator.evaluate(ast, context)\n * ```\n */\nexport class Evaluator {\n /**\n * Evaluate an AST node in the given context.\n *\n * @param node - AST node to evaluate\n * @param context - Execution context\n * @returns Evaluated value\n * @throws {ParseError} If evaluation fails\n */\n evaluate(node: ASTNode, context: Context): unknown {\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const n = node as any\n switch (node.kind) {\n case 'Literal':\n return n.value\n\n case 'Identifier':\n return this.evaluateIdentifier(n.name, context)\n\n case 'BinaryOp':\n return this.evaluateBinaryOp(n.operator, n.left, n.right, context)\n\n case 'UnaryOp':\n return this.evaluateUnaryOp(n.operator, n.operand, context)\n\n case 'Ternary':\n return this.evaluateTernary(n.condition, n.ifTrue, n.ifFalse, context)\n\n case 'MemberAccess':\n return this.evaluateMemberAccess(n.object, n.property, context)\n\n case 'IndexAccess':\n return this.evaluateIndexAccess(n.object, n.index, context)\n\n case 'MethodCall':\n return this.evaluateMethodCall(n.object, n.method, n.args, context)\n\n case 'EnumAccess':\n return this.evaluateEnumAccess(n.enumName, n.value, context)\n\n case 'ArrayLiteral':\n return this.evaluateArrayLiteral(n.elements, context)\n\n default:\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n throw new ParseError(`Unknown AST node kind: ${(node as any).kind}`)\n }\n }\n\n /**\n * Evaluate an identifier.\n * @private\n */\n private evaluateIdentifier(name: string, context: Context): unknown {\n return context.resolve(name)\n }\n\n /**\n * Evaluate a binary operation.\n * @private\n */\n private evaluateBinaryOp(\n operator: string,\n left: ASTNode,\n right: ASTNode,\n context: Context\n ): unknown {\n const leftVal = this.evaluate(left, context)\n const rightVal = this.evaluate(right, context)\n\n switch (operator) {\n // Arithmetic\n case '+':\n return this.add(leftVal, rightVal)\n case '-':\n return this.toNumber(leftVal) - this.toNumber(rightVal)\n case '*':\n return this.toNumber(leftVal) * this.toNumber(rightVal)\n case '/':\n return this.toNumber(leftVal) / this.toNumber(rightVal)\n case '%':\n return this.modulo(this.toNumber(leftVal), this.toNumber(rightVal))\n\n // Comparison\n case '<':\n return this.compare(leftVal, rightVal) < 0\n case '<=':\n return this.compare(leftVal, rightVal) <= 0\n case '>':\n return this.compare(leftVal, rightVal) > 0\n case '>=':\n return this.compare(leftVal, rightVal) >= 0\n case '==':\n return this.equals(leftVal, rightVal)\n case '!=':\n return !this.equals(leftVal, rightVal)\n\n // Bitwise\n case '<<':\n return this.bitwiseOp(leftVal, rightVal, (a, b) => a << b)\n case '>>':\n return this.bitwiseOp(leftVal, rightVal, (a, b) => a >> b)\n case '&':\n return this.bitwiseOp(leftVal, rightVal, (a, b) => a & b)\n case '|':\n return this.bitwiseOp(leftVal, rightVal, (a, b) => a | b)\n case '^':\n return this.bitwiseOp(leftVal, rightVal, (a, b) => a ^ b)\n\n // Logical\n case 'and':\n return this.toBoolean(leftVal) && this.toBoolean(rightVal)\n case 'or':\n return this.toBoolean(leftVal) || this.toBoolean(rightVal)\n\n default:\n throw new ParseError(`Unknown binary operator: ${operator}`)\n }\n }\n\n /**\n * Evaluate a unary operation.\n * @private\n */\n private evaluateUnaryOp(\n operator: string,\n operand: ASTNode,\n context: Context\n ): unknown {\n const value = this.evaluate(operand, context)\n\n switch (operator) {\n case '-':\n return -this.toNumber(value)\n case 'not':\n return !this.toBoolean(value)\n default:\n throw new ParseError(`Unknown unary operator: ${operator}`)\n }\n }\n\n /**\n * Evaluate a ternary conditional.\n * @private\n */\n private evaluateTernary(\n condition: ASTNode,\n ifTrue: ASTNode,\n ifFalse: ASTNode,\n context: Context\n ): unknown {\n const condValue = this.evaluate(condition, context)\n return this.toBoolean(condValue)\n ? this.evaluate(ifTrue, context)\n : this.evaluate(ifFalse, context)\n }\n\n /**\n * Evaluate member access (object.property).\n * @private\n */\n private evaluateMemberAccess(\n object: ASTNode,\n property: string,\n context: Context\n ): unknown {\n const obj = this.evaluate(object, context)\n\n if (obj === null || obj === undefined) {\n throw new ParseError(\n `Cannot access property ${property} of null/undefined`\n )\n }\n\n // Handle special Kaitai Struct pseudo-properties that act like methods\n if (property === 'to_i') {\n // Convert to integer (works for numbers, strings, etc.)\n if (typeof obj === 'number') return Math.floor(obj)\n if (typeof obj === 'bigint') return Number(obj)\n if (typeof obj === 'string') return parseInt(obj, 10)\n if (typeof obj === 'boolean') return obj ? 1 : 0\n return this.toInt(obj)\n }\n\n if (property === 'to_s') {\n return String(obj)\n }\n\n if (typeof obj === 'object') {\n return (obj as Record<string, unknown>)[property]\n }\n\n throw new ParseError(`Cannot access property ${property} of non-object`)\n }\n\n /**\n * Evaluate index access (array[index]).\n * @private\n */\n private evaluateIndexAccess(\n object: ASTNode,\n index: ASTNode,\n context: Context\n ): unknown {\n const obj = this.evaluate(object, context)\n const idx = this.evaluate(index, context)\n\n if (Array.isArray(obj)) {\n const numIdx = this.toInt(idx)\n return obj[numIdx]\n }\n\n if (obj instanceof Uint8Array) {\n const numIdx = this.toInt(idx)\n return obj[numIdx]\n }\n\n throw new ParseError('Index access requires an array')\n }\n\n /**\n * Evaluate method call (object.method()).\n * @private\n */\n private evaluateMethodCall(\n object: ASTNode,\n method: string,\n args: ASTNode[],\n context: Context\n ): unknown {\n const obj = this.evaluate(object, context)\n const evalArgs = args.map((arg) => this.evaluate(arg, context))\n\n // Array/String length\n if (method === 'length' || method === 'size') {\n if (Array.isArray(obj)) return obj.length\n if (obj instanceof Uint8Array) return obj.length\n if (typeof obj === 'string') return obj.length\n throw new ParseError(`Object does not have a ${method} property`)\n }\n\n // Type conversions\n if (method === 'to_i') {\n const base = evalArgs.length > 0 ? this.toInt(evalArgs[0]) : 10\n if (typeof obj === 'string') {\n return parseInt(obj, base)\n }\n return this.toInt(obj)\n }\n\n if (method === 'to_s') {\n return String(obj)\n }\n\n // String methods\n if (typeof obj === 'string') {\n return this.evaluateStringMethod(obj, method, evalArgs)\n }\n\n // Array methods\n if (Array.isArray(obj) || obj instanceof Uint8Array) {\n return this.evaluateArrayMethod(obj, method, evalArgs)\n }\n\n throw new ParseError(`Unknown method: ${method}`)\n }\n\n /**\n * Evaluate string methods.\n * @private\n */\n private evaluateStringMethod(\n str: string,\n method: string,\n args: unknown[]\n ): unknown {\n switch (method) {\n case 'substring': {\n const start = args.length > 0 ? this.toInt(args[0]) : 0\n const end = args.length > 1 ? this.toInt(args[1]) : undefined\n return str.substring(start, end)\n }\n\n case 'substr': {\n const start = args.length > 0 ? this.toInt(args[0]) : 0\n const length = args.length > 1 ? this.toInt(args[1]) : undefined\n return str.substr(start, length)\n }\n\n case 'reverse':\n return str.split('').reverse().join('')\n\n case 'to_i': {\n const base = args.length > 0 ? this.toInt(args[0]) : 10\n return parseInt(str, base)\n }\n\n case 'length':\n case 'size':\n return str.length\n\n // Ruby-style string methods used in Kaitai\n case 'upcase':\n case 'to_upper':\n return str.toUpperCase()\n\n case 'downcase':\n case 'to_lower':\n return str.toLowerCase()\n\n case 'capitalize':\n return str.charAt(0).toUpperCase() + str.slice(1).toLowerCase()\n\n case 'strip':\n case 'trim':\n return str.trim()\n\n case 'lstrip':\n case 'trim_start':\n return str.trimStart()\n\n case 'rstrip':\n case 'trim_end':\n return str.trimEnd()\n\n case 'starts_with':\n case 'startsWith': {\n if (args.length === 0) {\n throw new ParseError('starts_with requires 1 argument')\n }\n return str.startsWith(String(args[0]))\n }\n\n case 'ends_with':\n case 'endsWith': {\n if (args.length === 0) {\n throw new ParseError('ends_with requires 1 argument')\n }\n return str.endsWith(String(args[0]))\n }\n\n case 'includes':\n case 'contains': {\n if (args.length === 0) {\n throw new ParseError('includes requires 1 argument')\n }\n return str.includes(String(args[0]))\n }\n\n case 'index_of':\n case 'indexOf': {\n if (args.length === 0) {\n throw new ParseError('index_of requires 1 argument')\n }\n return str.indexOf(String(args[0]))\n }\n\n case 'split': {\n if (args.length === 0) {\n throw new ParseError('split requires 1 argument')\n }\n return str.split(String(args[0]))\n }\n\n case 'replace': {\n if (args.length < 2) {\n throw new ParseError('replace requires 2 arguments')\n }\n return str.replace(String(args[0]), String(args[1]))\n }\n\n case 'replace_all':\n case 'replaceAll': {\n if (args.length < 2) {\n throw new ParseError('replace_all requires 2 arguments')\n }\n const search = String(args[0])\n const replace = String(args[1])\n // Use split/join for compatibility with older targets\n return str.split(search).join(replace)\n }\n\n case 'pad_left':\n case 'padStart': {\n if (args.length === 0) {\n throw new ParseError('pad_left requires at least 1 argument')\n }\n const length = this.toInt(args[0])\n const fillString = args.length > 1 ? String(args[1]) : ' '\n return str.padStart(length, fillString)\n }\n\n case 'pad_right':\n case 'padEnd': {\n if (args.length === 0) {\n throw new ParseError('pad_right requires at least 1 argument')\n }\n const length = this.toInt(args[0])\n const fillString = args.length > 1 ? String(args[1]) : ' '\n return str.padEnd(length, fillString)\n }\n\n default:\n throw new ParseError(`Unknown string method: ${method}`)\n }\n }\n\n /**\n * Evaluate array methods.\n * @private\n */\n private evaluateArrayMethod(\n arr: unknown[] | Uint8Array,\n method: string,\n args: unknown[]\n ): unknown {\n const array = Array.isArray(arr) ? arr : Array.from(arr)\n\n switch (method) {\n case 'length':\n case 'size':\n return array.length\n\n case 'first':\n return array[0]\n\n case 'last':\n return array[array.length - 1]\n\n case 'min':\n return Math.min(...array.map((v) => this.toNumber(v)))\n\n case 'max':\n return Math.max(...array.map((v) => this.toNumber(v)))\n\n case 'reverse':\n return [...array].reverse()\n\n case 'sort':\n return [...array].sort((a, b) => this.compare(a, b))\n\n case 'includes':\n case 'contains': {\n if (args.length === 0) {\n throw new ParseError('includes requires 1 argument')\n }\n return array.some((item) => this.equals(item, args[0]))\n }\n\n case 'index_of':\n case 'indexOf': {\n if (args.length === 0) {\n throw new ParseError('index_of requires 1 argument')\n }\n return array.findIndex((item) => this.equals(item, args[0]))\n }\n\n case 'slice': {\n const start = args.length > 0 ? this.toInt(args[0]) : 0\n const end = args.length > 1 ? this.toInt(args[1]) : undefined\n return array.slice(start, end)\n }\n\n default:\n throw new ParseError(`Unknown array method: ${method}`)\n }\n }\n\n /**\n * Evaluate enum access (EnumName::value).\n * @private\n */\n private evaluateEnumAccess(\n enumName: string,\n valueName: string,\n context: Context\n ): unknown {\n const value = context.getEnumValue(enumName, valueName)\n if (value === undefined) {\n throw new ParseError(`Enum value \"${enumName}::${valueName}\" not found`)\n }\n return value\n }\n\n /**\n * Helper: Add two values (handles strings and numbers).\n * @private\n */\n private add(left: unknown, right: unknown): unknown {\n if (typeof left === 'string' || typeof right === 'string') {\n return String(left) + String(right)\n }\n return this.toNumber(left) + this.toNumber(right)\n }\n\n /**\n * Helper: Modulo operation (Kaitai-style, not remainder).\n * @private\n */\n private modulo(a: number, b: number): number {\n const result = a % b\n return result < 0 ? result + b : result\n }\n\n /**\n * Helper: Bitwise operation with BigInt support.\n * JavaScript bitwise operators work on 32-bit integers, but Kaitai\n * may use 64-bit values. For values that fit in 32 bits, use native ops.\n * For larger values, convert to BigInt (with limitations).\n * @private\n */\n private bitwiseOp(\n left: unknown,\n right: unknown,\n op: (a: number, b: number) => number\n ): number | bigint {\n // Check if we're dealing with BigInt values\n if (typeof left === 'bigint' || typeof right === 'bigint') {\n // Convert to BigInt and perform operation\n const leftBig = typeof left === 'bigint' ? left : BigInt(left as number)\n const rightBig =\n typeof right === 'bigint' ? right : BigInt(right as number)\n\n // BigInt bitwise operations\n // Note: Shift operations require the right operand to be a regular number\n if (op.toString().includes('<<')) {\n return leftBig << BigInt(Number(rightBig))\n }\n if (op.toString().includes('>>')) {\n return leftBig >> BigInt(Number(rightBig))\n }\n if (op.toString().includes('&')) {\n return leftBig & rightBig\n }\n if (op.toString().includes('|')) {\n return leftBig | rightBig\n }\n if (op.toString().includes('^')) {\n return leftBig ^ rightBig\n }\n }\n\n // Handle undefined/null values\n if (\n left === undefined ||\n left === null ||\n right === undefined ||\n right === null\n ) {\n throw new ParseError('Cannot perform bitwise operation on null/undefined')\n }\n\n // For regular numbers, use 32-bit operations\n return op(this.toInt(left), this.toInt(right))\n }\n\n /**\n * Helper: Compare two values.\n * @private\n */\n private compare(left: unknown, right: unknown): number {\n if (typeof left === 'string' && typeof right === 'string') {\n return left < right ? -1 : left > right ? 1 : 0\n }\n const leftNum = this.toNumber(left)\n const rightNum = this.toNumber(right)\n return leftNum < rightNum ? -1 : leftNum > rightNum ? 1 : 0\n }\n\n /**\n * Helper: Check equality.\n * @private\n */\n private equals(left: unknown, right: unknown): boolean {\n // Handle bigint comparison\n if (typeof left === 'bigint' || typeof right === 'bigint') {\n return BigInt(left as number) === BigInt(right as number)\n }\n\n // Sequence equality: support number[] and Uint8Array\n const toArray = (v: unknown): number[] | null => {\n if (Array.isArray(v))\n return v.map((x) => (typeof x === 'bigint' ? Number(x) : (x as number)))\n if (v instanceof Uint8Array) return Array.from(v)\n return null\n }\n\n const leftArr = toArray(left)\n const rightArr = toArray(right)\n if (leftArr && rightArr) {\n if (leftArr.length !== rightArr.length) return false\n for (let i = 0; i < leftArr.length; i++) {\n if (leftArr[i] !== rightArr[i]) return false\n }\n return true\n }\n\n return left === right\n }\n\n /**\n * Evaluate an array literal.\n * @private\n */\n private evaluateArrayLiteral(\n elements: ASTNode[],\n context: Context\n ): unknown[] {\n return elements.map((e) => this.evaluate(e, context))\n }\n\n /**\n * Helper: Convert to number.\n * @private\n */\n private toNumber(value: unknown): number {\n if (typeof value === 'number') return value\n if (typeof value === 'bigint') return Number(value)\n if (typeof value === 'boolean') return value ? 1 : 0\n if (typeof value === 'string') return parseFloat(value)\n throw new ParseError(`Cannot convert ${typeof value} to number`)\n }\n\n /**\n * Helper: Convert to integer.\n * @private\n */\n private toInt(value: unknown): number {\n return Math.floor(this.toNumber(value))\n }\n\n /**\n * Helper: Convert to boolean.\n * @private\n */\n private toBoolean(value: unknown): boolean {\n if (typeof value === 'boolean') return value\n if (typeof value === 'number') return value !== 0\n if (typeof value === 'bigint') return value !== 0n\n if (typeof value === 'string') return value.length > 0\n if (value === null || value === undefined) return false\n return true\n }\n}\n","/**\n * @fileoverview Expression evaluation module\n * @module expression\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { Lexer } from './Lexer'\nimport { ExpressionParser } from './Parser'\nimport { Evaluator } from './Evaluator'\nimport type { Context } from '../interpreter/Context'\n\nexport * from './Token'\nexport * from './AST'\nexport * from './Lexer'\nexport * from './Parser'\nexport * from './Evaluator'\n\n/**\n * Evaluate a Kaitai Struct expression string.\n * Convenience function that combines lexing, parsing, and evaluation.\n *\n * @param expression - Expression string to evaluate\n * @param context - Execution context\n * @returns Evaluated value\n * @throws {ParseError} If parsing or evaluation fails\n *\n * @example\n * ```typescript\n * const result = evaluateExpression('field1 + field2 * 2', context)\n * ```\n */\nexport function evaluateExpression(\n expression: string,\n context: Context\n): unknown {\n // Strip unsupported generic cast syntax like .as<bytes>\n // This is a no-op for our evaluator since we infer types dynamically.\n const preprocessed = expression.replace(/\\.as<[^>]+>/g, '')\n // Lexical analysis\n const lexer = new Lexer(preprocessed)\n const tokens = lexer.tokenize()\n\n // Parsing\n const parser = new ExpressionParser(tokens)\n const ast = parser.parse()\n\n // Evaluation\n const evaluator = new Evaluator()\n return evaluator.evaluate(ast, context)\n}\n","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\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/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED = 1;\n//const Z_HUFFMAN_ONLY = 2;\n//const Z_RLE = 3;\nconst Z_FIXED$1 = 4;\n//const Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY = 0;\nconst Z_TEXT = 1;\n//const Z_ASCII = 1; // = Z_TEXT\nconst Z_UNKNOWN$1 = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1 = 3;\nconst MAX_MATCH$1 = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1 = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1 = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1 = 30;\n/* number of distance codes */\n\nconst BL_CODES$1 = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1 = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1 = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK = 256;\n/* end of block literal code */\n\nconst REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nconst 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 */\nconst extra_lbits = /* extra bits for each length code */\n new Uint8Array([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\nconst extra_dbits = /* extra bits for each distance code */\n new Uint8Array([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\nconst extra_blbits = /* extra bits for each bit length code */\n new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n new Uint8Array([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\nconst 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\nconst static_ltree = new Array((L_CODES$1 + 2) * 2);\nzero$1(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\nconst static_dtree = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code = new Array(DIST_CODE_LEN);\nzero$1(_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\nconst _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist = new Array(D_CODES$1);\nzero$1(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\nlet static_l_desc;\nlet static_d_desc;\nlet 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\nconst d_code = (dist) => {\n\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 */\nconst 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 */\nconst send_bits = (s, value, length) => {\n\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\nconst send_code = (s, c, tree) => {\n\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 */\nconst bi_reverse = (code, len) => {\n\n let 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 */\nconst bi_flush = (s) => {\n\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 */\nconst gen_bitlen = (s, desc) => {\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n\n const tree = desc.dyn_tree;\n const max_code = desc.max_code;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const extra = desc.stat_desc.extra_bits;\n const base = desc.stat_desc.extra_base;\n const max_length = desc.stat_desc.max_length;\n let h; /* heap index */\n let n, m; /* iterate over the tree elements */\n let bits; /* bit length */\n let xbits; /* extra bits */\n let f; /* frequency */\n let overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS$1; 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$1; 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 // Tracev((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 // Tracev((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 */\nconst 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 const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n let code = 0; /* running code value */\n let bits; /* bit index */\n let 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$1; bits++) {\n code = (code + bl_count[bits - 1]) << 1;\n next_code[bits] = code;\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 let 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 */\nconst tr_static_init = () => {\n\n let n; /* iterates over tree elements */\n let bits; /* bit counter */\n let length; /* length value */\n let code; /* code value */\n let dist; /* distance index */\n const bl_count = new Array(MAX_BITS$1 + 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 - 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$1; 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$1; 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 + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES$1; 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 + 1, L_CODES$1, MAX_BITS$1);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS);\n\n //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n let n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES$1; 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.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst 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 * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n const _n2 = n * 2;\n const _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 */\nconst 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 const v = s.heap[k];\n let 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// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst 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 let dist; /* distance of matched string */\n let lc; /* match length or unmatched char (if dist == 0) */\n let sx = 0; /* running index in sym_buf */\n let code; /* the code to send */\n let extra; /* number of extra bits to send */\n\n if (s.sym_next !== 0) {\n do {\n dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n lc = s.pending_buf[s.sym_buf + sx++];\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 + 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 sym_buf is ok: */\n //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n } while (sx < s.sym_next);\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 */\nconst build_tree = (s, desc) => {\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n\n const tree = desc.dyn_tree;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const elems = desc.stat_desc.elems;\n let n, m; /* iterate over heap elements */\n let max_code = -1; /* largest code with non zero frequency */\n let 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$1;\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 */\nconst 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 let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let 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 */\nconst 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 let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let 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 */\nconst build_bl_tree = (s) => {\n\n let 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 - 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 */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n let 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 * \"block list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"allow 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 */\nconst detect_data_type = (s) => {\n /* block_mask is the bit mask of block-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n let block_mask = 0xf3ffc07f;\n let n;\n\n /* Check for non-textual (\"block-listed\") bytes. */\n for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"allow-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$1; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"block-listed\" or \"allow-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (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 */\nconst _tr_stored_block$1 = (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 bi_windup(s); /* align on byte boundary */\n put_short(s, stored_len);\n put_short(s, ~stored_len);\n if (stored_len) {\n s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n }\n s.pending += stored_len;\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 */\nconst _tr_align$1 = (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 write out the encoded block.\n */\nconst _tr_flush_block$1 = (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 let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n let 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$1) {\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->sym_next / 3));\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$1(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 || 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 */\nconst _tr_tally$1 = (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 s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n s.pending_buf[s.sym_buf + s.sym_next++] = lc;\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 + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1 = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1 = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\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\nconst adler32 = (adler, buf, len, pos) => {\n let 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\nvar adler32_1 = adler32;\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\nconst makeTable = () => {\n let 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.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n const t = crcTable;\n const end = pos + len;\n\n crc ^= -1;\n\n for (let i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\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 messages = {\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\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 constants$2 = {\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\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\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n Z_UNKNOWN,\n Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES = 30;\n/* number of distance codes */\nconst BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42; /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */\nconst NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE = 113; /* deflate -> FINISH_STATE */\nconst FINISH_STATE = 666; /* stream complete */\n\nconst BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n strm.msg = messages[errorCode];\n return errorCode;\n};\n\nconst rank = (f) => {\n return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n let n, m;\n let p;\n let wsize = s.w_size;\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= wsize ? m - wsize : 0);\n } while (--n);\n n = wsize;\n//#ifndef FASTEST\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= wsize ? m - wsize : 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//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n const s = strm.state;\n\n //_tr_flush_bits(s);\n let len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n strm.output.set(s.pending_buf.subarray(s.pending_out, 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\nconst flush_block_only = (s, last) => {\n _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\nconst 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 */\nconst putShortMSB = (s, b) => {\n\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 */\nconst read_buf = (strm, buf, start, size) => {\n\n let 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 buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32_1(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32_1(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 */\nconst longest_match = (s, cur_match) => {\n\n let chain_length = s.max_chain_length; /* max hash chain length */\n let scan = s.strstart; /* current string */\n let match; /* matched string */\n let len; /* length of current match */\n let best_len = s.prev_length; /* best match length so far */\n let nice_match = s.nice_match; /* stop if match long enough */\n const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n const _win = s.window; // shortcut\n\n const wmask = s.w_mask;\n const 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 const strend = s.strstart + MAX_MATCH;\n let scan_end1 = _win[scan + best_len - 1];\n let 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 */\nconst fill_window = (s) => {\n\n const _w_size = s.w_size;\n let n, 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 s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 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 if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n slide_hash(s);\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 = HASH(s, s.ins_h, s.window[str + 1]);\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 = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\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// const curr = s.strstart + s.lookahead;\n// let 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 *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n /* Smallest worthy block size when not flushing or finishing. By default\n * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n * large input and output buffers, the stored block size will be larger.\n */\n let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n /* Copy as many min_block or larger stored blocks directly to next_out as\n * possible. If flushing, copy the remaining available input to next_out as\n * stored blocks, if there is enough space.\n */\n let len, left, have, last = 0;\n let used = s.strm.avail_in;\n do {\n /* Set len to the maximum size block that we can copy directly with the\n * available input data and output space. Set left to how much of that\n * would be copied from what's left in the window.\n */\n len = 65535/* MAX_STORED */; /* maximum deflate stored block length */\n have = (s.bi_valid + 42) >> 3; /* number of header bytes */\n if (s.strm.avail_out < have) { /* need room for header */\n break;\n }\n /* maximum stored block length that will fit in avail_out: */\n have = s.strm.avail_out - have;\n left = s.strstart - s.block_start; /* bytes left in window */\n if (len > left + s.strm.avail_in) {\n len = left + s.strm.avail_in; /* limit len to the input */\n }\n if (len > have) {\n len = have; /* limit len to the output */\n }\n\n /* If the stored block would be less than min_block in length, or if\n * unable to copy all of the available input when flushing, then try\n * copying to the window and the pending buffer instead. Also don't\n * write an empty block when flushing -- deflate() does that.\n */\n if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n flush === Z_NO_FLUSH$2 ||\n len !== left + s.strm.avail_in)) {\n break;\n }\n\n /* Make a dummy stored block in pending to get the header bytes,\n * including any pending bits. This also updates the debugging counts.\n */\n last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n _tr_stored_block(s, 0, 0, last);\n\n /* Replace the lengths in the dummy stored block with len. */\n s.pending_buf[s.pending - 4] = len;\n s.pending_buf[s.pending - 3] = len >> 8;\n s.pending_buf[s.pending - 2] = ~len;\n s.pending_buf[s.pending - 1] = ~len >> 8;\n\n /* Write the stored block header bytes. */\n flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n// /* Update debugging counts for the data about to be copied. */\n// s->compressed_len += len << 3;\n// s->bits_sent += len << 3;\n//#endif\n\n /* Copy uncompressed bytes from the window to next_out. */\n if (left) {\n if (left > len) {\n left = len;\n }\n //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n s.strm.next_out += left;\n s.strm.avail_out -= left;\n s.strm.total_out += left;\n s.block_start += left;\n len -= left;\n }\n\n /* Copy uncompressed bytes directly from next_in to next_out, updating\n * the check value.\n */\n if (len) {\n read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n s.strm.next_out += len;\n s.strm.avail_out -= len;\n s.strm.total_out += len;\n }\n } while (last === 0);\n\n /* Update the sliding window with the last s->w_size bytes of the copied\n * data, or append all of the copied data to the existing window if less\n * than s->w_size bytes were copied. Also update the number of bytes to\n * insert in the hash tables, in the event that deflateParams() switches to\n * a non-zero compression level.\n */\n used -= s.strm.avail_in; /* number of input bytes directly copied */\n if (used) {\n /* If any input was used, then no unused input remains in the window,\n * therefore s->block_start == s->strstart.\n */\n if (used >= s.w_size) { /* supplant the previous history */\n s.matches = 2; /* clear hash */\n //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n s.strstart = s.w_size;\n s.insert = s.strstart;\n }\n else {\n if (s.window_size - s.strstart <= used) {\n /* Slide the window down. */\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; /* add a pending slide_hash() */\n }\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n s.strstart += used;\n s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n }\n s.block_start = s.strstart;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n /* If the last block was written to next_out, then done. */\n if (last) {\n return BS_FINISH_DONE;\n }\n\n /* If flushing and all input has been consumed, then done. */\n if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n s.strm.avail_in === 0 && s.strstart === s.block_start) {\n return BS_BLOCK_DONE;\n }\n\n /* Fill the window with any remaining input. */\n have = s.window_size - s.strstart;\n if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n /* Slide the window down. */\n s.block_start -= s.w_size;\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; /* add a pending slide_hash() */\n }\n have += s.w_size; /* more space now */\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n if (have > s.strm.avail_in) {\n have = s.strm.avail_in;\n }\n if (have) {\n read_buf(s.strm, s.window, s.strstart, have);\n s.strstart += have;\n s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n /* There was not enough avail_out to write a complete worthy or flushed\n * stored block to next_out. Write a stored block to pending instead, if we\n * have enough input for a worthy block, or if flushing and there is enough\n * room for the remaining input as a stored block in the pending buffer.\n */\n have = (s.bi_valid + 42) >> 3; /* number of header bytes */\n /* maximum stored block length that will fit in pending: */\n have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n min_block = have > s.w_size ? s.w_size : have;\n left = s.strstart - s.block_start;\n if (left >= min_block ||\n ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n s.strm.avail_in === 0 && left <= have)) {\n len = left > have ? have : left;\n last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n len === left ? 1 : 0;\n _tr_stored_block(s, s.block_start, len, last);\n s.block_start += len;\n flush_pending(s.strm);\n }\n\n /* We've done all we can with the available input and output. */\n return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\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 */\nconst deflate_fast = (s, flush) => {\n\n let hash_head; /* head of the hash chain */\n let 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$2) {\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 = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\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 = _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 = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\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 = HASH(s, s.ins_h, s.window[s.strstart + 1]);\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 = _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$3) {\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.sym_next) {\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 */\nconst deflate_slow = (s, flush) => {\n\n let hash_head; /* head of hash chain */\n let bflush; /* set if current block must be flushed */\n\n let 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$2) {\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 = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\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 = _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 = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\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 = _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 = _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$3) {\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.sym_next) {\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 */\nconst deflate_rle = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n let prev; /* byte at distance one to match */\n let scan, strend; /* scan goes up to strend for length of run */\n\n const _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$2) {\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 = _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 = _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$3) {\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.sym_next) {\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 */\nconst deflate_huff = (s, flush) => {\n\n let 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$2) {\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 = _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$3) {\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.sym_next) {\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\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\nconst configuration_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 */\nconst lm_init = (s) => {\n\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$2; /* 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 Uint16Array(HEAP_SIZE * 2);\n this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2);\n this.bl_tree = new Uint16Array((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 Uint16Array(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 Uint16Array(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 Uint16Array(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.sym_buf = 0; /* buffer for distances and literals/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.sym_next = 0; /* running index in sym_buf */\n this.sym_end = 0; /* symbol table full when sym_next reaches this */\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\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const s = strm.state;\n if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n s.status !== GZIP_STATE &&\n//#endif\n s.status !== EXTRA_STATE &&\n s.status !== NAME_STATE &&\n s.status !== COMMENT_STATE &&\n s.status !== HCRC_STATE &&\n s.status !== BUSY_STATE &&\n s.status !== FINISH_STATE)) {\n return 1;\n }\n return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n const 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 =\n//#ifdef GZIP\n s.wrap === 2 ? GZIP_STATE :\n//#endif\n 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 = -2;\n _tr_init(s);\n return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n const ret = deflateResetKeep(strm);\n if (ret === Z_OK$3) {\n lm_init(strm.state);\n }\n return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n return Z_STREAM_ERROR$2;\n }\n strm.state.gzhead = head;\n return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR$2;\n }\n let wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION$1) {\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$2 ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n const s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n s.status = INIT_STATE; /* to pass state test in deflateReset() */\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 Uint8Array(s.w_size * 2);\n s.head = new Uint16Array(s.hash_size);\n s.prev = new Uint16Array(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 /* We overlay pending_buf and sym_buf. This works since the average size\n * for length/distance pairs over any compressed block is assured to be 31\n * bits or less.\n *\n * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n * possible fixed-codes length/distance pair is then 31 bits total.\n *\n * sym_buf starts one-fourth of the way into pending_buf. So there are\n * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n * in sym_buf is three bytes -- two for the distance and one for the\n * literal/length. As each symbol is consumed, the pointer to the next\n * sym_buf value to read moves forward three bytes. From that symbol, up to\n * 31 bits are written to pending_buf. The closest the written pending_buf\n * bits gets to the next sym_buf symbol to read is just before the last\n * code is written. At that time, 31*(n-2) bits have been written, just\n * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n * symbols are written.) The closest the writing gets to what is unread is\n * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n * can range from 128 to 32768.\n *\n * Therefore, at a minimum, there are 142 bits of space between what is\n * written and what is read in the overlain buffers, so the symbols cannot\n * be overwritten by the compressed data. That space is actually 139 bits,\n * due to the three-bit fixed-code block header.\n *\n * That covers the case where either Z_FIXED is specified, forcing fixed\n * codes, or when the use of fixed codes is chosen, because that choice\n * results in a smaller compressed block than dynamic codes. That latter\n * condition then assures that the above analysis also covers all dynamic\n * blocks. A dynamic-code block will only be chosen to be emitted if it has\n * fewer bits than a fixed-code block would for the same set of symbols.\n * Therefore its average symbol length is assured to be less than 31. So\n * the compressed data for a dynamic block also cannot overwrite the\n * symbols from which it is being constructed.\n */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->sym_buf = s->pending_buf + s->lit_bufsize;\n s.sym_buf = s.lit_bufsize;\n\n //s->sym_end = (s->lit_bufsize - 1) * 3;\n s.sym_end = (s.lit_bufsize - 1) * 3;\n /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n\n if (!strm.output ||\n (strm.avail_in !== 0 && !strm.input) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n }\n\n const old_flush = s.last_flush;\n s.last_flush = flush;\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$3;\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$3) {\n return err(strm, Z_BUF_ERROR$1);\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$1);\n }\n\n /* Write the header */\n if (s.status === INIT_STATE && s.wrap === 0) {\n s.status = BUSY_STATE;\n }\n if (s.status === INIT_STATE) {\n /* zlib header */\n let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n let 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 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 s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#ifdef GZIP\n if (s.status === GZIP_STATE) {\n /* 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 /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\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_1(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n while (s.pending + left > s.pending_buf_size) {\n let copy = s.pending_buf_size - s.pending;\n // zmemcpy(s.pending_buf + s.pending,\n // s.gzhead.extra + s.gzindex, copy);\n s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n s.pending = s.pending_buf_size;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex += copy;\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n left -= copy;\n }\n // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n // TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n let gzhead_extra = new Uint8Array(s.gzhead.extra);\n // zmemcpy(s->pending_buf + s->pending,\n // s->gzhead->extra + s->gzindex, left);\n s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n s.pending += left;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = NAME_STATE;\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\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 //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = COMMENT_STATE;\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\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 //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n }\n s.status = HCRC_STATE;\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 if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\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 }\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#endif\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$2 && s.status !== FINISH_STATE)) {\n let bstate = s.level === 0 ? deflate_stored(s, flush) :\n 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$3;\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 _tr_align(s);\n }\n else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n _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$1) {\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$3;\n }\n }\n }\n\n if (flush !== Z_FINISH$3) { return Z_OK$3; }\n if (s.wrap <= 0) { return Z_STREAM_END$3; }\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$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const status = strm.state.status;\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n let dictLength = dictionary.length;\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n const wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR$2;\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_1(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 let tmpDict = new Uint8Array(s.w_size);\n tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n const avail = strm.avail_in;\n const next = strm.next_in;\n const 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 let str = s.strstart;\n let 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 = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\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$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n const sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n const 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 (const p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n // calculate data length\n let len = 0;\n\n for (let i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n const result = new Uint8Array(len);\n\n for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n let chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\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//\nlet STR_APPLY_UIA_OK = true;\n\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\nconst _utf8len = new Uint8Array(256);\nfor (let 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)\nvar string2buf = (str) => {\n if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n return new TextEncoder().encode(str);\n }\n\n let 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 Uint8Array(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\nconst buf2binstring = (buf, len) => {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if (buf.subarray && STR_APPLY_UIA_OK) {\n return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n }\n }\n\n let result = '';\n for (let i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n const len = max || buf.length;\n\n if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n return new TextDecoder().decode(buf.subarray(0, max));\n }\n\n let i, out;\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 const utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n let c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n let 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);\nvar utf8border = (buf, max) => {\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 let 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\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\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\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n Z_DEFAULT_COMPRESSION,\n Z_DEFAULT_STRATEGY,\n Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\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\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).\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 * - `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 * const pako = require('pako')\n * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const 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$1(options) {\n this.options = common.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED$1,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY\n }, options || {});\n\n let 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 let status = deflate_1$2.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$2) {\n throw new Error(messages[status]);\n }\n\n if (opt.header) {\n deflate_1$2.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n let 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$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - flush_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\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\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$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n let status, _flush_mode;\n\n if (this.ended) { return false; }\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\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$1.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 for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n // Make sure avail_out > 6 to avoid repeating markers\n if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n status = deflate_1$2.deflate(strm, _flush_mode);\n\n // Ended => flush and finish\n if (status === Z_STREAM_END$2) {\n if (strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n }\n status = deflate_1$2.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK$2;\n }\n\n // Flush if out buffer full\n if (strm.avail_out === 0) {\n this.onData(strm.output);\n continue;\n }\n\n // Flush if requested and has data\n if (_flush_mode > 0 && strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\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$1.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). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK$2) {\n this.result = common.flattenChunks(this.chunks);\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|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 *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n const deflator = new Deflate$1(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 || messages[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|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$1(input, options) {\n options = options || {};\n options.raw = true;\n return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|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$1(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\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\nconst BAD$1 = 16209; /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191; /* 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 */\nvar inffast = function inflate_fast(strm, start) {\n let _in; /* local strm.input */\n let last; /* have enough input while in < last */\n let _out; /* local strm.output */\n let beg; /* inflate()'s initial strm.output */\n let end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n let dmax; /* maximum distance from zlib header */\n//#endif\n let wsize; /* window size or zero if not using window */\n let whave; /* valid bytes in the window */\n let wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n let s_window; /* allocated sliding window, if wsize != 0 */\n let hold; /* local strm.hold */\n let bits; /* local strm.bits */\n let lcode; /* local strm.lencode */\n let dcode; /* local strm.distcode */\n let lmask; /* mask for first level of length codes */\n let dmask; /* mask for first level of distance codes */\n let here; /* retrieved table entry */\n let op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n let len; /* match length, unused bytes */\n let dist; /* match distance */\n let from; /* where to copy match from */\n let from_source;\n\n\n let input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n const 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$1;\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$1;\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$1;\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$1;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD$1;\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\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\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* 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\nconst lext = new Uint8Array([ /* 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\nconst dbase = new Uint16Array([ /* 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\nconst dext = new Uint8Array([ /* 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\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n const bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n let len = 0; /* a code's length in bits */\n let sym = 0; /* index of code symbols */\n let min = 0, max = 0; /* minimum and maximum code lengths */\n let root = 0; /* number of index bits for root table */\n let curr = 0; /* number of index bits for current table */\n let drop = 0; /* code bits to drop for sub-table */\n let left = 0; /* number of prefix codes available */\n let used = 0; /* code entries in table used */\n let huff = 0; /* Huffman code */\n let incr; /* for incrementing code, index */\n let fill; /* index for replicating entries */\n let low; /* low bits for current root entry */\n let mask; /* mask for low root bits */\n let next; /* next available space in table */\n let base = null; /* base value table to use */\n// let shoextra; /* extra bits table to use */\n let match; /* use base and extra for symbol >= match */\n const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n let extra = null;\n\n let 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$1 || 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$1) {\n base = extra = work; /* dummy value--not used */\n match = 20;\n\n } else if (type === LENS$1) {\n base = lbase;\n extra = lext;\n match = 257;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n match = 0;\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$1 && used > ENOUGH_LENS$1) ||\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\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] + 1 < match) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] >= match) {\n here_op = extra[work[sym] - match];\n here_val = base[work[sym] - match];\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$1 && used > ENOUGH_LENS$1) ||\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\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\n\nvar inftrees = inflate_table;\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\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst HEAD = 16180; /* i: waiting for magic header */\nconst FLAGS = 16181; /* i: waiting for method and flags (gzip) */\nconst TIME = 16182; /* i: waiting for modification time (gzip) */\nconst OS = 16183; /* i: waiting for extra flags and operating system (gzip) */\nconst EXLEN = 16184; /* i: waiting for extra length (gzip) */\nconst EXTRA = 16185; /* i: waiting for extra bytes (gzip) */\nconst NAME = 16186; /* i: waiting for end of file name (gzip) */\nconst COMMENT = 16187; /* i: waiting for end of comment (gzip) */\nconst HCRC = 16188; /* i: waiting for header crc (gzip) */\nconst DICTID = 16189; /* i: waiting for dictionary check value */\nconst DICT = 16190; /* waiting for inflateSetDictionary() call */\nconst TYPE = 16191; /* i: waiting for type bits, including last-flag bit */\nconst TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */\nconst STORED = 16193; /* i: waiting for stored size (length and complement) */\nconst COPY_ = 16194; /* i/o: same as COPY below, but only first time in */\nconst COPY = 16195; /* i/o: waiting for input or output to copy stored block */\nconst TABLE = 16196; /* i: waiting for dynamic block table lengths */\nconst LENLENS = 16197; /* i: waiting for code length code lengths */\nconst CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */\nconst LEN_ = 16199; /* i: same as LEN below, but only first time in */\nconst LEN = 16200; /* i: waiting for length/lit/eob code */\nconst LENEXT = 16201; /* i: waiting for length extra bits */\nconst DIST = 16202; /* i: waiting for distance code */\nconst DISTEXT = 16203; /* i: waiting for distance extra bits */\nconst MATCH = 16204; /* o: waiting for output space to copy string */\nconst LIT = 16205; /* o: waiting for output space to write literal */\nconst CHECK = 16206; /* i: waiting for 32-bit check value */\nconst LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */\nconst DONE = 16208; /* finished check, done -- remain here until reset */\nconst BAD = 16209; /* got a data error -- remain here until reset */\nconst MEM = 16210; /* got an inflate() memory error -- remain here until reset */\nconst SYNC = 16211; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n this.strm = null; /* pointer back to this zlib stream */\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 bit 2 true to validate check value */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib), or\n -1 if raw or no header yet */\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 Uint16Array(320); /* temporary storage for code lengths */\n this.work = new Uint16Array(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 Int32Array(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\n\nconst inflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const state = strm.state;\n if (!state || state.strm !== strm ||\n state.mode < HEAD || state.mode > SYNC) {\n return 1;\n }\n return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const 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.flags = -1;\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 Int32Array(ENOUGH_LENS);\n state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n let wrap;\n\n /* get the state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const 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) + 5;\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$1;\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\n\nconst inflateInit2 = (strm, windowBits) => {\n\n if (!strm) { return Z_STREAM_ERROR$1; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n const 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.strm = strm;\n state.window = null/*Z_NULL*/;\n state.mode = HEAD; /* to pass state test in inflateReset2() */\n const ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK$1) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\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 */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n lenfix = new Int32Array(512);\n distfix = new Int32Array(32);\n\n /* literal/length table */\n let 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 inftrees(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 inftrees(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 */\nconst updatewindow = (strm, src, end, copy) => {\n\n let dist;\n const 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 Uint8Array(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n state.window.set(src.subarray(end - state.wsize, end), 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 state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n state.window.set(src.subarray(end - copy, end), 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\n\nconst inflate$2 = (strm, flush) => {\n\n let state;\n let input, output; // input/output buffers\n let next; /* next input INDEX */\n let put; /* next output INDEX */\n let have, left; /* available input and output */\n let hold; /* bit buffer */\n let bits; /* bits in bit buffer */\n let _in, _out; /* save starting available input and output */\n let copy; /* number of stored or match bytes to copy */\n let from; /* where to copy match bytes from */\n let from_source;\n let here = 0; /* current decoding table entry */\n let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //let last; /* parent table entry */\n let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n let len; /* length to copy for repeats, bits to drop */\n let ret; /* return code */\n const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */\n let opts;\n\n let n; // temporary variable for NEED_BITS\n\n const order = /* permutation of code lengths */\n new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n if (inflateStateCheck(strm) || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR$1;\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$1;\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 if (state.wbits === 0) {\n state.wbits = 15;\n }\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_1(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\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 if (len > 15 || len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n // !!! pako patch. Force use `options.windowBits` if passed.\n // Required to always use max window size by default.\n state.dmax = 1 << state.wbits;\n //state.dmax = 1 << len;\n\n state.flags = 0; /* indicate zlib header */\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) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(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) && (state.wrap & 4)) {\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_1(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) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(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) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(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 Uint8Array(state.head.extra_len);\n }\n state.head.extra.set(\n input.subarray(\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n next + copy\n ),\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) && (state.wrap & 4)) {\n state.check = crc32_1(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) && (state.wrap & 4)) {\n state.check = crc32_1(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) && (state.wrap & 4)) {\n state.check = crc32_1(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 ((state.wrap & 4) && 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$1;\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 output.set(input.subarray(next, 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 = inftrees(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 = inftrees(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 = inftrees(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 inffast(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 ((state.wrap & 4) && _out) {\n strm.adler = state.check =\n /*UPDATE_CHECK(state.check, put - _out, _out);*/\n (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(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.wrap & 4) && (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 ((state.wrap & 4) && 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$1;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR$1;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR$1;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR$1;\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$1))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\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 & 4) && _out) {\n strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(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$1) && ret === Z_OK$1) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n if (inflateStateCheck(strm)) {\n return Z_STREAM_ERROR$1;\n }\n\n let state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n /* check state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n const dictLength = dictionary.length;\n\n let state;\n let dictid;\n let ret;\n\n /* check state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR$1;\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_1(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR$1;\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$1;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\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\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\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|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).\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 * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const 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$1(options) {\n this.options = common.assign({\n chunkSize: 1024 * 64,\n windowBits: 15,\n to: ''\n }, options || {});\n\n const 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 let status = inflate_1$2.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n\n this.header = new gzheader();\n\n inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n * `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. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\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$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n const dictionary = this.options.dictionary;\n let status, _flush_mode, last_avail_out;\n\n if (this.ended) return false;\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n 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 for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = inflate_1$2.inflate(strm, _flush_mode);\n\n if (status === Z_NEED_DICT && dictionary) {\n status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n if (status === Z_OK) {\n status = inflate_1$2.inflate(strm, _flush_mode);\n } else if (status === Z_DATA_ERROR) {\n // Replace code with more verbose\n status = Z_NEED_DICT;\n }\n }\n\n // Skip snyc markers if more data follows and not raw mode\n while (strm.avail_in > 0 &&\n status === Z_STREAM_END &&\n strm.state.wrap > 0 &&\n data[strm.next_in] !== 0)\n {\n inflate_1$2.inflateReset(strm);\n status = inflate_1$2.inflate(strm, _flush_mode);\n }\n\n switch (status) {\n case Z_STREAM_ERROR:\n case Z_DATA_ERROR:\n case Z_NEED_DICT:\n case Z_MEM_ERROR:\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n // Remember real `avail_out` value, because we may patch out buffer content\n // to align utf8 strings boundaries.\n last_avail_out = strm.avail_out;\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n if (this.options.to === 'string') {\n\n let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n let tail = strm.next_out - next_out_utf8;\n let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail & realign counters\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n this.onData(utf8str);\n\n } else {\n this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n }\n }\n }\n\n // Must repeat iteration if out buffer is full\n if (status === Z_OK && last_avail_out === 0) continue;\n\n // Finalize if end of stream reached.\n if (status === Z_STREAM_END) {\n status = inflate_1$2.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return true;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n * each chunk 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$1.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). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.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 = common.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|String\n * - data (Uint8Array|ArrayBuffer): 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 * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err) {\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n const inflator = new Inflate$1(options);\n\n inflator.push(input);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): 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$1(input, options) {\n options = options || {};\n options.raw = true;\n return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): 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\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","/**\n * @fileoverview Data processing utilities for Kaitai Struct\n * @module utils/process\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { ParseError } from './errors'\nimport { inflate } from 'pako'\n\n/**\n * Process algorithms supported by Kaitai Struct.\n * These transform data before parsing (decompression, decryption, etc.)\n */\nexport type ProcessAlgorithm =\n | 'zlib'\n | 'xor'\n | 'rol'\n | 'ror'\n | 'bswap2'\n | 'bswap4'\n | 'bswap8'\n | 'bswap16'\n\n/**\n * Process specification - can be a string or object with parameters.\n */\nexport interface ProcessSpec {\n /** Algorithm name */\n algorithm?: string\n /** XOR key (for xor algorithm) */\n key?: number | number[]\n /** Rotation amount (for rol/ror algorithms) */\n amount?: number\n /** Group size (for rol/ror algorithms) */\n group?: number\n}\n\n/**\n * Apply processing transformation to data.\n *\n * @param data - Input data to process\n * @param process - Processing specification (string or object)\n * @returns Processed data\n * @throws {ParseError} If processing fails or algorithm is unknown\n *\n * @example\n * ```typescript\n * // XOR with single byte key\n * const decrypted = applyProcess(encrypted, { algorithm: 'xor', key: 0xFF })\n *\n * // Zlib decompression\n * const decompressed = applyProcess(compressed, 'zlib')\n *\n * // Rotate left by 3 bits\n * const rotated = applyProcess(data, { algorithm: 'rol', amount: 3 })\n * ```\n */\nexport function applyProcess(\n data: Uint8Array,\n process: string | ProcessSpec\n): Uint8Array {\n // Parse process specification\n const spec: ProcessSpec =\n typeof process === 'string' ? { algorithm: process } : process\n\n const algorithm = spec.algorithm\n\n if (!algorithm) {\n throw new ParseError('Process specification missing algorithm')\n }\n\n switch (algorithm) {\n case 'zlib':\n return processZlib(data)\n\n case 'xor':\n return processXor(data, spec.key)\n\n case 'rol':\n return processRol(data, spec.amount, spec.group)\n\n case 'ror':\n return processRor(data, spec.amount, spec.group)\n\n case 'bswap2':\n return processByteswap(data, 2)\n\n case 'bswap4':\n return processByteswap(data, 4)\n\n case 'bswap8':\n return processByteswap(data, 8)\n\n case 'bswap16':\n return processByteswap(data, 16)\n\n default:\n throw new ParseError(\n `Unknown process algorithm: ${algorithm}. ` +\n `Supported: zlib, xor, rol, ror, bswap2, bswap4, bswap8, bswap16`\n )\n }\n}\n\n/**\n * Decompress data using zlib/deflate algorithm.\n *\n * @param data - Compressed data\n * @returns Decompressed data\n * @throws {ParseError} If decompression fails\n * @private\n */\nfunction processZlib(data: Uint8Array): Uint8Array {\n try {\n return inflate(data)\n } catch (error) {\n throw new ParseError(\n `Zlib decompression failed: ${error instanceof Error ? error.message : String(error)}`\n )\n }\n}\n\n/**\n * XOR data with a key.\n * Supports single-byte key or multi-byte key (repeated cyclically).\n *\n * @param data - Input data\n * @param key - XOR key (number or array of numbers)\n * @returns XORed data\n * @throws {ParseError} If key is invalid\n * @private\n */\nfunction processXor(\n data: Uint8Array,\n key: number | number[] | undefined\n): Uint8Array {\n if (key === undefined) {\n throw new ParseError('XOR process requires a key parameter')\n }\n\n const result = new Uint8Array(data.length)\n const keyBytes = Array.isArray(key) ? key : [key]\n\n if (keyBytes.length === 0) {\n throw new ParseError('XOR key cannot be empty')\n }\n\n for (let i = 0; i < data.length; i++) {\n result[i] = data[i] ^ keyBytes[i % keyBytes.length]\n }\n\n return result\n}\n\n/**\n * Rotate bits left (ROL).\n * Rotates each byte or group of bytes left by the specified amount.\n *\n * @param data - Input data\n * @param amount - Number of bits to rotate (default: 1)\n * @param group - Group size in bytes (default: 1)\n * @returns Rotated data\n * @throws {ParseError} If parameters are invalid\n * @private\n */\nfunction processRol(\n data: Uint8Array,\n amount: number | undefined,\n group: number | undefined\n): Uint8Array {\n const bits = amount ?? 1\n const groupSize = group ?? 1\n\n if (bits < 0 || bits > 7) {\n throw new ParseError('ROL amount must be between 0 and 7')\n }\n\n if (groupSize !== 1) {\n throw new ParseError('ROL with group size > 1 not yet supported')\n }\n\n const result = new Uint8Array(data.length)\n\n for (let i = 0; i < data.length; i++) {\n const byte = data[i]\n result[i] = ((byte << bits) | (byte >> (8 - bits))) & 0xff\n }\n\n return result\n}\n\n/**\n * Rotate bits right (ROR).\n * Rotates each byte or group of bytes right by the specified amount.\n *\n * @param data - Input data\n * @param amount - Number of bits to rotate (default: 1)\n * @param group - Group size in bytes (default: 1)\n * @returns Rotated data\n * @throws {ParseError} If parameters are invalid\n * @private\n */\nfunction processRor(\n data: Uint8Array,\n amount: number | undefined,\n group: number | undefined\n): Uint8Array {\n const bits = amount ?? 1\n const groupSize = group ?? 1\n\n if (bits < 0 || bits > 7) {\n throw new ParseError('ROR amount must be between 0 and 7')\n }\n\n if (groupSize !== 1) {\n throw new ParseError('ROR with group size > 1 not yet supported')\n }\n\n const result = new Uint8Array(data.length)\n\n for (let i = 0; i < data.length; i++) {\n const byte = data[i]\n result[i] = ((byte >> bits) | (byte << (8 - bits))) & 0xff\n }\n\n return result\n}\n\n/**\n * Byte swap (reverse byte order in groups).\n * Swaps bytes within groups of the specified size.\n *\n * @param data - Input data\n * @param groupSize - Size of groups to swap (2, 4, 8, or 16 bytes)\n * @returns Byte-swapped data\n * @throws {ParseError} If group size is invalid or data length is not aligned\n * @private\n */\nfunction processByteswap(data: Uint8Array, groupSize: number): Uint8Array {\n if (![2, 4, 8, 16].includes(groupSize)) {\n throw new ParseError(\n `Invalid byteswap group size: ${groupSize}. Must be 2, 4, 8, or 16`\n )\n }\n\n if (data.length % groupSize !== 0) {\n throw new ParseError(\n `Data length ${data.length} is not aligned to group size ${groupSize}`\n )\n }\n\n const result = new Uint8Array(data.length)\n\n for (let i = 0; i < data.length; i += groupSize) {\n for (let j = 0; j < groupSize; j++) {\n result[i + j] = data[i + groupSize - 1 - j]\n }\n }\n\n return result\n}\n","/**\n * @fileoverview Type interpreter for executing Kaitai Struct schemas\n * @module interpreter/TypeInterpreter\n * @author Fabiano Pinto\n * @license MIT\n */\n\nimport { KaitaiStream } from '../stream/KaitaiStream'\nimport {\n KsySchema,\n AttributeSpec,\n Endianness,\n EndianExpression,\n isBuiltinType,\n getBaseType,\n getTypeEndianness,\n isIntegerType,\n isFloatType,\n isStringType,\n} from '../parser/schema'\nimport { Context } from './Context'\nimport { evaluateExpression } from '../expression'\nimport { ParseError, ValidationError } from '../utils/errors'\nimport { applyProcess } from '../utils/process'\n\n/**\n * Interprets Kaitai Struct schemas and parses binary data.\n * Executes schema definitions against binary streams to produce structured objects.\n *\n * @class TypeInterpreter\n * @example\n * ```typescript\n * const interpreter = new TypeInterpreter(schema)\n * const stream = new KaitaiStream(buffer)\n * const result = interpreter.parse(stream)\n * ```\n */\nexport class TypeInterpreter {\n /**\n * Create a new type interpreter.\n *\n * @param schema - Kaitai Struct schema to interpret\n * @param parentMeta - Parent schema's meta (for nested types)\n */\n constructor(\n private schema: KsySchema,\n private parentMeta?: {\n id: string\n endian?: Endianness | object\n encoding?: string\n }\n ) {\n // For root schemas, meta.id is required\n // For nested types, we can inherit from parent\n if (!schema.meta && !parentMeta) {\n throw new ParseError('Schema must have meta section')\n }\n if (schema.meta && !schema.meta.id && !parentMeta) {\n throw new ParseError('Root schema must have meta.id')\n }\n }\n\n /**\n * Safely extract a KaitaiStream from an object that may expose `_io`.\n * Avoids using `any` casts to satisfy linting.\n */\n private static getKaitaiIO(val: unknown): KaitaiStream | null {\n if (val && typeof val === 'object') {\n const rec = val as Record<string, unknown>\n const maybe = rec['_io']\n if (maybe instanceof KaitaiStream) return maybe\n }\n return null\n }\n\n /**\n * Parse binary data according to the schema.\n *\n * @param stream - Binary stream to parse\n * @param parent - Parent object (for nested types)\n * @param typeArgs - Arguments for parametric types\n * @param root - Root object of the parse tree (for nested types)\n * @returns Parsed object\n */\n parse(\n stream: KaitaiStream,\n parent?: unknown,\n typeArgs?: Array<string | number | boolean>,\n root?: unknown\n ): Record<string, unknown> {\n const result: Record<string, unknown> = {}\n\n // For top-level parse, result is the root; for nested, use provided root\n const actualRoot = root || result\n const context = new Context(stream, actualRoot, parent, this.schema.enums)\n context.current = result\n\n // Track starting position for _sizeof calculation\n const startPos = stream.pos\n\n // Expose current stream for use in expressions (e.g., slot._io)\n ;(result as Record<string, unknown>)['_io'] = stream\n\n // Expose root for nested types\n if (root) {\n ;(result as Record<string, unknown>)['_root'] = root\n }\n\n // Set parameters in context if this is a parametric type\n if (typeArgs && this.schema.params) {\n for (\n let i = 0;\n i < this.schema.params.length && i < typeArgs.length;\n i++\n ) {\n const param = this.schema.params[i]\n const argValue = typeArgs[i]\n // Evaluate the argument if it's a string expression\n const evaluatedArg =\n typeof argValue === 'string'\n ? this.evaluateValue(argValue, context)\n : argValue\n context.set(param.id, evaluatedArg)\n }\n }\n\n // Set up lazy-evaluated instances BEFORE parsing seq fields\n // This allows seq fields to reference instances in their expressions\n if (this.schema.instances) {\n this.setupInstances(result, stream, context)\n }\n\n // Parse sequential fields\n if (this.schema.seq) {\n for (const attr of this.schema.seq) {\n const value = this.parseAttribute(attr, context)\n if (attr.id) {\n result[attr.id] = value\n }\n }\n }\n\n // Calculate and store _sizeof (number of bytes consumed)\n const endPos = stream.pos\n ;(result as Record<string, unknown>)['_sizeof'] = endPos - startPos\n\n return result\n }\n\n /**\n * Set up lazy-evaluated instance getters.\n * Instances are computed on first access and cached.\n *\n * @param result - Result object to add getters to\n * @param stream - Stream for parsing\n * @param context - Execution context\n * @private\n */\n private setupInstances(\n result: Record<string, unknown>,\n stream: KaitaiStream,\n context: Context\n ): void {\n if (!this.schema.instances) return\n\n for (const [name, instance] of Object.entries(this.schema.instances)) {\n // Cache for lazy evaluation\n let cached: unknown = undefined\n let evaluated = false\n\n Object.defineProperty(result, name, {\n get: () => {\n if (!evaluated) {\n cached = this.parseInstance(\n instance as Record<string, unknown>,\n stream,\n context\n )\n evaluated = true\n }\n return cached\n },\n enumerable: true,\n configurable: true,\n })\n }\n }\n\n /**\n * Parse an instance (lazy-evaluated field).\n *\n * @param instance - Instance specification\n * @param stream - Stream to read from\n * @param context - Execution context\n * @returns Parsed or calculated value\n * @private\n */\n private parseInstance(\n instance: AttributeSpec & { value?: string | number | boolean },\n stream: KaitaiStream,\n context: Context\n ): unknown {\n // Handle value instances (calculated fields)\n if ('value' in instance) {\n return this.evaluateValue(\n instance.value as string | number | boolean | undefined,\n context\n )\n }\n\n // Save current position\n const savedPos = stream.pos\n\n try {\n // Handle pos attribute for positioned reads\n if (instance.pos !== undefined) {\n const pos = this.evaluateValue(\n instance.pos as string | number | boolean | undefined,\n context\n )\n if (typeof pos === 'number') {\n stream.seek(pos)\n } else if (typeof pos === 'bigint') {\n stream.seek(Number(pos))\n } else {\n throw new ParseError(\n `pos must evaluate to a number, got ${typeof pos}`\n )\n }\n }\n\n // Parse as a regular attribute\n const value = this.parseAttribute(instance, context)\n return value\n } finally {\n // Restore position if pos was used\n if (instance.pos !== undefined) {\n stream.seek(savedPos)\n }\n }\n }\n\n /**\n * Parse a single attribute according to its specification.\n *\n * @param attr - Attribute specification\n * @param context - Execution context\n * @returns Parsed value\n * @private\n */\n private parseAttribute(attr: AttributeSpec, context: Context): unknown {\n // Determine the stream to use (support custom I/O via attr.io)\n let stream: KaitaiStream = context.io\n if (attr.io !== undefined) {\n const ioVal = this.evaluateValue(attr.io, context)\n if (ioVal instanceof KaitaiStream) {\n stream = ioVal\n } else {\n const kio = TypeInterpreter.getKaitaiIO(ioVal)\n if (kio) {\n stream = kio\n } else {\n throw new ParseError(\n 'io must evaluate to a KaitaiStream or an object with _io'\n )\n }\n }\n }\n\n // Handle conditional parsing\n if (attr.if) {\n const condition = this.evaluateValue(attr.if, context)\n // If condition is false or falsy, skip this attribute\n if (!condition) {\n return undefined\n }\n }\n\n // Handle absolute positioning\n if (attr.pos !== undefined) {\n const pos = this.evaluateValue(attr.pos, context)\n if (typeof pos === 'number') {\n stream.seek(pos)\n } else if (typeof pos === 'bigint') {\n stream.seek(Number(pos))\n } else {\n throw new ParseError(`pos must evaluate to a number, got ${typeof pos}`)\n }\n }\n\n // Custom I/O handled above by selecting stream\n\n // Handle repetition\n if (attr.repeat) {\n return this.parseRepeated(attr, context)\n }\n\n // Handle contents validation\n if (attr.contents) {\n return this.parseContents(attr, context)\n }\n\n // Parse single value\n const value = this.parseValue(attr, context)\n\n // Note: We don't apply enum mapping here to keep values as integers\n // This allows enum comparisons in expressions to work correctly\n // Enum mapping should be done at the presentation layer if needed\n\n return value\n }\n\n /**\n * Parse a repeated attribute.\n *\n * @param attr - Attribute specification with repeat\n * @param context - Execution context\n * @returns Array of parsed values\n * @private\n */\n private parseRepeated(attr: AttributeSpec, context: Context): unknown[] {\n const stream = context.io\n const result: unknown[] = []\n\n switch (attr.repeat) {\n case 'expr': {\n // Fixed number of repetitions\n const countValue = this.evaluateValue(attr['repeat-expr'], context)\n const count =\n typeof countValue === 'number'\n ? countValue\n : typeof countValue === 'bigint'\n ? Number(countValue)\n : 0\n\n if (count < 0) {\n throw new ParseError(`repeat-expr must be non-negative, got ${count}`)\n }\n\n for (let i = 0; i < count; i++) {\n // Set _index for expressions\n context.set('_index', i)\n const value = this.parseAttribute(\n { ...attr, repeat: undefined, 'repeat-expr': undefined },\n context\n )\n result.push(value)\n }\n break\n }\n\n case 'eos': {\n // Repeat until end of stream\n while (!stream.isEof()) {\n context.set('_index', result.length)\n result.push(this.parseValue(attr, context))\n }\n break\n }\n\n case 'until': {\n // Repeat until condition is true\n if (!attr['repeat-until']) {\n throw new ParseError('repeat-until expression is required')\n }\n\n let index = 0\n while (true) {\n context.set('_index', index)\n\n // Parse the value first\n const value = this.parseAttribute(\n { ...attr, repeat: undefined, 'repeat-until': undefined },\n context\n )\n result.push(value)\n\n // Set _ to the last parsed value for the condition\n context.set('_', value)\n\n // Evaluate the condition\n const condition = this.evaluateValue(attr['repeat-until'], context)\n\n // Break if condition is true\n if (condition) {\n break\n }\n\n // Check for EOF to prevent infinite loops\n if (stream.isEof()) {\n break\n }\n\n index++\n }\n break\n }\n\n default:\n throw new ParseError(`Unknown repeat type: ${attr.repeat}`)\n }\n\n return result\n }\n\n /**\n * Parse and validate contents.\n *\n * @param attr - Attribute specification with contents\n * @param context - Execution context\n * @returns The validated contents\n * @private\n */\n private parseContents(\n attr: AttributeSpec,\n context: Context\n ): Uint8Array | string {\n const stream = context.io\n const expected = attr.contents!\n\n if (Array.isArray(expected)) {\n // Byte array contents\n const bytes = stream.readBytes(expected.length)\n for (let i = 0; i < expected.length; i++) {\n if (bytes[i] !== expected[i]) {\n throw new ValidationError(\n `Contents mismatch at byte ${i}: expected ${expected[i]}, got ${bytes[i]}`,\n stream.pos - expected.length + i\n )\n }\n }\n return bytes\n } else {\n // String contents\n const encoding =\n attr.encoding ||\n this.schema.meta?.encoding ||\n this.parentMeta?.encoding ||\n 'UTF-8'\n const str = stream.readStr(expected.length, encoding)\n if (str !== expected) {\n throw new ValidationError(\n `Contents mismatch: expected \"${expected}\", got \"${str}\"`,\n stream.pos - expected.length\n )\n }\n return str\n }\n }\n\n /**\n * Parse a single value according to its type.\n *\n * @param attr - Attribute specification\n * @param context - Execution context\n * @returns Parsed value\n * @private\n */\n private parseValue(attr: AttributeSpec, context: Context): unknown {\n const stream = context.io\n const type = attr.type\n\n // Handle sized reads\n if (attr.size !== undefined) {\n const sizeValue = this.evaluateValue(attr.size, context)\n const size =\n typeof sizeValue === 'number'\n ? sizeValue\n : typeof sizeValue === 'bigint'\n ? Number(sizeValue)\n : 0\n\n if (size < 0) {\n throw new ParseError(`size must be non-negative, got ${size}`)\n }\n\n if (type === 'str' || !type) {\n // String or raw bytes\n const encoding =\n attr.encoding ||\n this.schema.meta?.encoding ||\n this.parentMeta?.encoding ||\n 'UTF-8'\n let data: Uint8Array\n if (type === 'str') {\n data = stream.readBytes(size)\n // Apply processing if specified\n if (attr.process) {\n data = this.applyProcessing(data, attr.process)\n }\n // eslint-disable-next-line no-undef\n return new TextDecoder(encoding).decode(data)\n } else {\n data = stream.readBytes(size)\n // Apply processing if specified\n if (attr.process) {\n data = this.applyProcessing(data, attr.process)\n }\n return data\n }\n } else {\n // Sized substream for complex type\n let data = stream.readBytes(size)\n // Apply processing if specified\n if (attr.process) {\n data = this.applyProcessing(data, attr.process)\n }\n const substream = new KaitaiStream(data)\n return this.parseType(type, substream, context, attr['type-args'])\n }\n }\n\n // Handle size-eos\n if (attr['size-eos']) {\n if (type === 'str') {\n const encoding =\n attr.encoding ||\n this.schema.meta?.encoding ||\n this.parentMeta?.encoding ||\n 'UTF-8'\n const bytes = stream.readBytesFull()\n // eslint-disable-next-line no-undef\n return new TextDecoder(encoding).decode(bytes)\n } else {\n let bytes = stream.readBytesFull()\n // Apply processing if specified\n if (attr.process) {\n bytes = this.applyProcessing(bytes, attr.process)\n }\n if (type) {\n const sub = new KaitaiStream(bytes)\n return this.parseType(type, sub, context, attr['type-args'])\n }\n return bytes\n }\n }\n\n // Handle type-based parsing\n if (!type) {\n throw new ParseError('Attribute must have either type, size, or contents')\n }\n\n return this.parseType(type, stream, context, attr['type-args'])\n }\n\n /**\n * Parse a value of a specific type.\n *\n * @param type - Type name or switch specification\n * @param stream - Stream to read from\n * @param context - Execution context\n * @param typeArgs - Arguments for parametric types\n * @returns Parsed value\n * @private\n */\n private parseType(\n type: string | object,\n stream: KaitaiStream,\n context: Context,\n typeArgs?: Array<string | number | boolean>\n ): unknown {\n // Handle switch types\n if (typeof type === 'object') {\n return this.parseSwitchType(\n type as Record<string, unknown>,\n stream,\n context\n )\n }\n\n // Parse parameterized type syntax: type_name(arg1, arg2, ...)\n const { typeName, args } = this.parseParameterizedType(type, context)\n const effectiveArgs = args.length > 0 ? args : typeArgs\n\n // Handle built-in types\n if (isBuiltinType(typeName)) {\n return this.parseBuiltinType(typeName, stream, context)\n }\n\n // Handle user-defined types\n if (this.schema.types && typeName in this.schema.types) {\n const typeSchema = this.schema.types[typeName]\n // Pass parent meta for nested types\n const meta = this.schema.meta || this.parentMeta\n\n // Inherit parent enums if nested type doesn't have its own\n if (this.schema.enums && !typeSchema.enums) {\n typeSchema.enums = this.schema.enums\n }\n\n // Inherit parent types if nested type doesn't have its own\n if (this.schema.types && !typeSchema.types) {\n typeSchema.types = this.schema.types\n }\n\n const interpreter = new TypeInterpreter(typeSchema, meta)\n return interpreter.parse(\n stream,\n context.current,\n effectiveArgs,\n context.root\n )\n }\n\n throw new ParseError(`Unknown type: ${typeName}`)\n }\n\n /**\n * Parse parameterized type syntax and extract type name and arguments.\n * Supports: type_name(arg1, arg2, ...) or just type_name\n *\n * @param typeSpec - Type specification string\n * @param context - Execution context for evaluating argument expressions\n * @returns Object with typeName and evaluated args\n * @private\n */\n private parseParameterizedType(\n typeSpec: string,\n context: Context\n ): { typeName: string; args: Array<string | number | boolean> } {\n // Check if type has parameters: type_name(...)\n const match = typeSpec.match(/^([a-z_][a-z0-9_]*)\\((.*)\\)$/i)\n\n if (!match) {\n // No parameters, return as-is\n return { typeName: typeSpec, args: [] }\n }\n\n const typeName = match[1]\n const argsString = match[2].trim()\n\n if (!argsString) {\n // Empty parameters: type_name()\n return { typeName, args: [] }\n }\n\n // Parse arguments - handle strings, numbers, booleans, and expressions\n const args: Array<string | number | boolean> = []\n let current = ''\n let inString = false\n let stringChar = ''\n let parenDepth = 0\n\n for (let i = 0; i < argsString.length; i++) {\n const char = argsString[i]\n\n if (inString) {\n current += char\n if (char === stringChar && argsString[i - 1] !== '\\\\') {\n inString = false\n }\n } else if (char === '\"' || char === \"'\") {\n inString = true\n stringChar = char\n current += char\n } else if (char === '(') {\n parenDepth++\n current += char\n } else if (char === ')') {\n parenDepth--\n current += char\n } else if (char === ',' && parenDepth === 0) {\n // Argument separator\n args.push(this.parseArgument(current.trim(), context))\n current = ''\n } else {\n current += char\n }\n }\n\n // Add last argument\n if (current.trim()) {\n args.push(this.parseArgument(current.trim(), context))\n }\n\n return { typeName, args }\n }\n\n /**\n * Parse and evaluate a single type argument.\n *\n * @param arg - Argument string\n * @param context - Execution context\n * @returns Evaluated argument value\n * @private\n */\n private parseArgument(\n arg: string,\n context: Context\n ): string | number | boolean {\n // Boolean literals\n if (arg === 'true') return true\n if (arg === 'false') return false\n\n // String literals\n if (\n (arg.startsWith('\"') && arg.endsWith('\"')) ||\n (arg.startsWith(\"'\") && arg.endsWith(\"'\"))\n ) {\n return arg.slice(1, -1)\n }\n\n // Numeric literals\n if (/^-?\\d+$/.test(arg)) {\n return parseInt(arg, 10)\n }\n if (/^-?\\d+\\.\\d+$/.test(arg)) {\n return parseFloat(arg)\n }\n if (/^0x[0-9a-f]+$/i.test(arg)) {\n return parseInt(arg, 16)\n }\n\n // Expression - evaluate in context\n try {\n const result = this.evaluateValue(arg, context)\n // Convert to primitive types\n if (\n typeof result === 'string' ||\n typeof result === 'number' ||\n typeof result === 'boolean'\n ) {\n return result\n }\n // For other types, convert to number if possible\n return Number(result)\n } catch {\n // If evaluation fails, treat as string\n return arg\n }\n }\n\n /**\n * Parse a switch type (type selection based on expression).\n *\n * @param switchType - Switch type specification\n * @param stream - Stream to read from\n * @param context - Execution context\n * @returns Parsed value\n * @private\n */\n private parseSwitchType(\n switchType: Record<string, unknown>,\n stream: KaitaiStream,\n context: Context\n ): unknown {\n const switchOn = switchType['switch-on']\n const cases = switchType['cases'] as Record<string, string> | undefined\n const defaultType = switchType['default'] as string | undefined\n\n if (!switchOn || typeof switchOn !== 'string') {\n throw new ParseError('switch-on expression is required for switch types')\n }\n\n if (!cases) {\n throw new ParseError('cases are required for switch types')\n }\n\n // Evaluate the switch expression\n const switchValue = this.evaluateValue(switchOn, context)\n\n // Convert switch value to string for case matching\n const switchKey = String(switchValue)\n\n // Find matching case\n let selectedType: string | undefined = cases[switchKey]\n\n // Use default if no case matches\n if (selectedType === undefined && defaultType) {\n selectedType = defaultType\n }\n\n if (selectedType === undefined) {\n throw new ParseError(\n `No matching case for switch value \"${switchKey}\" and no default type specified`\n )\n }\n\n // Parse using the selected type\n return this.parseType(selectedType, stream, context)\n }\n\n /**\n * Parse a built-in type.\n *\n * @param type - Built-in type name\n * @param stream - Stream to read from\n * @param context - Execution context\n * @returns Parsed value\n * @private\n */\n private parseBuiltinType(\n type: string,\n stream: KaitaiStream,\n context: Context\n ): unknown {\n const base = getBaseType(type)\n const typeEndian = getTypeEndianness(type)\n // Get endianness from schema or parent\n const meta = this.schema.meta || this.parentMeta\n const metaEndian = meta?.endian\n\n // Resolve endianness (static or expression-based)\n let endian: Endianness\n if (typeEndian) {\n // Type-specific endianness (e.g., u4le, u4be)\n endian = typeEndian\n } else if (typeof metaEndian === 'string') {\n // Static endianness from meta\n endian = metaEndian\n } else if (metaEndian && typeof metaEndian === 'object') {\n // Expression-based endianness (switch-on)\n endian = this.evaluateEndianExpression(metaEndian, context)\n } else {\n // Default to little-endian\n endian = 'le'\n }\n\n // Integer types\n if (isIntegerType(type)) {\n return this.readInteger(base, endian, stream)\n }\n\n // Float types\n if (isFloatType(type)) {\n return this.readFloat(base, endian, stream)\n }\n\n // Bit field types: b1, b2, ..., b64 (default bit-endian: BE)\n if (/^b\\d+$/.test(type)) {\n const n = parseInt(type.slice(1), 10)\n const val = stream.readBitsIntBe(n)\n // Return number when safely representable, else BigInt\n const maxSafe = BigInt(Number.MAX_SAFE_INTEGER)\n return val <= maxSafe ? Number(val) : val\n }\n\n // String types\n if (isStringType(type)) {\n const encoding = this.schema.meta?.encoding || 'UTF-8'\n\n if (type === 'strz') {\n // Null-terminated string with default parameters\n return stream.readStrz(encoding, 0, false, true, true)\n } else if (type === 'str') {\n // str type requires size, size-eos, or terminator\n throw new ParseError(\n 'str type requires size, size-eos, or terminator attribute'\n )\n }\n }\n\n throw new ParseError(`Unknown built-in type: ${type}`)\n }\n\n /**\n * Read an integer value.\n *\n * @param type - Integer type (u1, u2, u4, u8, s1, s2, s4, s8)\n * @param endian - Endianness\n * @param stream - Stream to read from\n * @returns Integer value\n * @private\n */\n private readInteger(\n type: string,\n endian: Endianness,\n stream: KaitaiStream\n ): number | bigint {\n switch (type) {\n case 'u1':\n return stream.readU1()\n case 'u2':\n return endian === 'le' ? stream.readU2le() : stream.readU2be()\n case 'u4':\n return endian === 'le' ? stream.readU4le() : stream.readU4be()\n case 'u8':\n return endian === 'le' ? stream.readU8le() : stream.readU8be()\n case 's1':\n return stream.readS1()\n case 's2':\n return endian === 'le' ? stream.readS2le() : stream.readS2be()\n case 's4':\n return endian === 'le' ? stream.readS4le() : stream.readS4be()\n case 's8':\n return endian === 'le' ? stream.readS8le() : stream.readS8be()\n default:\n throw new ParseError(`Unknown integer type: ${type}`)\n }\n }\n\n /**\n * Read a floating point value.\n *\n * @param type - Float type (f4, f8)\n * @param endian - Endianness\n * @param stream - Stream to read from\n * @returns Float value\n * @private\n */\n private readFloat(\n type: string,\n endian: Endianness,\n stream: KaitaiStream\n ): number {\n switch (type) {\n case 'f4':\n return endian === 'le' ? stream.readF4le() : stream.readF4be()\n case 'f8':\n return endian === 'le' ? stream.readF8le() : stream.readF8be()\n default:\n throw new ParseError(`Unknown float type: ${type}`)\n }\n }\n\n /**\n * Apply processing transformation to data.\n * Delegates to the process utility module.\n *\n * @param data - Data to process\n * @param process - Processing specification\n * @returns Processed data\n * @private\n */\n private applyProcessing(\n data: Uint8Array,\n process: string | Record<string, unknown>\n ): Uint8Array {\n return applyProcess(data, process)\n }\n\n /**\n * Evaluate expression-based endianness (switch-on).\n *\n * @param endianExpr - Endianness expression with switch-on and cases\n * @param context - Execution context\n * @returns Resolved endianness ('le' or 'be')\n * @private\n */\n private evaluateEndianExpression(\n endianExpr: EndianExpression,\n context: Context\n ): Endianness {\n const switchOn = endianExpr['switch-on']\n const cases = endianExpr.cases\n\n if (!switchOn || typeof switchOn !== 'string') {\n throw new ParseError('Endian expression missing \"switch-on\" field')\n }\n\n if (!cases || typeof cases !== 'object') {\n throw new ParseError('Endian expression missing \"cases\" field')\n }\n\n // Evaluate the switch-on expression\n const switchValue = this.evaluateValue(switchOn, context)\n\n // Convert to string for case matching\n const key = String(switchValue)\n\n // Look up the endianness in cases\n if (key in cases) {\n const endian = cases[key]\n if (endian !== 'le' && endian !== 'be') {\n throw new ParseError(`Invalid endianness value: ${endian}`)\n }\n return endian\n }\n\n // Default to little-endian if no match\n return 'le'\n }\n\n /**\n * Evaluate a value that can be an expression or literal.\n *\n * @param value - Value to evaluate (expression string, number, or boolean)\n * @param context - Execution context\n * @returns Evaluated result\n * @private\n */\n private evaluateValue(\n value: string | number | boolean | undefined,\n context: Context\n ): unknown {\n if (value === undefined) {\n return undefined\n }\n\n // If it's a number or boolean, return as-is\n if (typeof value === 'number' || typeof value === 'boolean') {\n return value\n }\n\n // If it's a string, evaluate as expression\n if (typeof value === 'string') {\n try {\n return evaluateExpression(value, context)\n } catch (error) {\n throw new ParseError(\n `Failed to evaluate expression \"${value}\": ${error instanceof Error ? error.message : String(error)}`\n )\n }\n }\n\n return value\n }\n}\n","/**\n * @fileoverview Main entry point for kaitai-struct-ts library\n * @module kaitai-struct-ts\n * @author Fabiano Pinto\n * @license MIT\n * @version 0.2.0\n *\n * @description\n * A runtime interpreter for Kaitai Struct binary format definitions in TypeScript.\n * Parse any binary data format by providing a .ksy (Kaitai Struct YAML) definition file.\n *\n * @example\n * ```typescript\n * import { parse } from 'kaitai-struct-ts'\n *\n * const ksyDefinition = `\n * meta:\n * id: my_format\n * endian: le\n * seq:\n * - id: magic\n * contents: [0x4D, 0x5A]\n * - id: version\n * type: u2\n * `\n *\n * const buffer = new Uint8Array([0x4D, 0x5A, 0x01, 0x00])\n * const result = parse(ksyDefinition, buffer)\n * console.log(result.version) // 1\n * ```\n */\n\nimport { KaitaiStream } from './stream'\nimport { KsyParser } from './parser'\nimport { TypeInterpreter } from './interpreter'\n\n// Export main classes\nexport { KaitaiStream } from './stream'\nexport { KsyParser } from './parser'\nexport { TypeInterpreter } from './interpreter'\nexport { Context } from './interpreter'\n\n// Export types from schema\nexport type {\n KsySchema,\n MetaSpec,\n AttributeSpec,\n InstanceSpec,\n SwitchType,\n EnumSpec,\n ParamSpec,\n Endianness,\n EndianExpression,\n RepeatSpec,\n ProcessSpec,\n ProcessObject,\n ValidationResult,\n ValidationError as SchemaValidationError,\n ValidationWarning,\n} from './parser/schema'\n\nexport {\n BUILTIN_TYPES,\n isBuiltinType,\n getTypeEndianness,\n getBaseType,\n isIntegerType,\n isFloatType,\n isStringType,\n} from './parser/schema'\n\n// Export error classes\nexport * from './utils/errors'\n\n/**\n * Parse binary data using a Kaitai Struct definition.\n * This is the main convenience function for parsing.\n *\n * @param ksyYaml - YAML string containing the .ksy definition\n * @param buffer - Binary data to parse (ArrayBuffer or Uint8Array)\n * @param options - Parsing options\n * @returns Parsed object with fields defined in the .ksy file\n * @throws {ParseError} If YAML parsing fails\n * @throws {ValidationError} If schema validation fails\n * @throws {EOFError} If unexpected end of stream is reached\n *\n * @example\n * ```typescript\n * const result = parse(ksyYaml, binaryData)\n * console.log(result.fieldName)\n * ```\n */\nexport function parse(\n ksyYaml: string,\n buffer: ArrayBuffer | Uint8Array,\n options: ParseOptions = {}\n): Record<string, unknown> {\n const { validate = true, strict = false } = options\n\n // Parse the KSY schema\n const parser = new KsyParser()\n const schema = parser.parse(ksyYaml, { validate, strict })\n\n // Create a stream from the buffer\n const stream = new KaitaiStream(buffer)\n\n // Create an interpreter and parse\n const interpreter = new TypeInterpreter(schema)\n return interpreter.parse(stream)\n}\n\n/**\n * Options for the parse function.\n *\n * @interface ParseOptions\n */\nexport interface ParseOptions {\n /** Whether to validate the schema (default: true) */\n validate?: boolean\n\n /** Whether to treat warnings as errors (default: false) */\n strict?: boolean\n}\n"]}