prettier-plugin-java-for-cjs 2.8.1

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":["freeGlobal","Symbol","root","objectProto","hasOwnProperty","nativeObjectToString","symToStringTag","Symbol","Symbol","getRawTag","objectToString","symbolTag","isObjectLike","baseGetTag","INFINITY","symbolProto","Symbol","isArray","arrayMap","isSymbol","trimmedEndIndex","isSymbol","isObject","baseTrim","INFINITY","toNumber","toFinite","funcTag","genTag","isObject","baseGetTag","root","coreJsData","funcToString","objectProto","hasOwnProperty","isObject","isMasked","isFunction","toSource","getValue","baseIsNative","WeakMap","getNative","root","isObject","getNative","defineProperty","identity","constant","shortOut","baseSetToString","strictIndexOf","baseFindIndex","baseIsNaN","baseIndexOf","MAX_SAFE_INTEGER","defineProperty","hasOwnProperty","eq","nativeMax","apply","setToString","overRest","identity","isLength","isFunction","isObject","isArrayLike","isIndex","eq","baseRest","isIterateeCall","objectProto","argsTag","isObjectLike","baseGetTag","objectProto","hasOwnProperty","propertyIsEnumerable","baseIsArguments","isObjectLike","freeExports","freeModule","Buffer","root","stubFalse","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","isObjectLike","isLength","baseGetTag","freeExports","freeModule","freeGlobal","nodeUtil","baseUnary","baseIsTypedArray","hasOwnProperty","isArray","isArguments","isBuffer","isTypedArray","baseTimes","isIndex","overArg","hasOwnProperty","isPrototype","nativeKeys","isArrayLike","arrayLikeKeys","baseKeys","hasOwnProperty","createAssigner","isPrototype","isArrayLike","keys","hasOwnProperty","isObject","nativeKeysIn","isPrototype","isArrayLike","arrayLikeKeys","baseKeysIn","isArray","isSymbol","getNative","nativeCreate","HASH_UNDEFINED","hasOwnProperty","nativeCreate","hasOwnProperty","nativeCreate","HASH_UNDEFINED","nativeCreate","hashClear","hashDelete","hashGet","hashHas","hashSet","eq","assocIndexOf","assocIndexOf","assocIndexOf","assocIndexOf","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","Map","getNative","root","Hash","Map","ListCache","map","isKeyable","getMapData","getMapData","getMapData","getMapData","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","FUNC_ERROR_TEXT","MapCache","memoize","memoizeCapped","baseToString","isArray","isKey","stringToPath","toString","isSymbol","castPath","toKey","baseGet","values","Symbol","isArray","isArguments","isFlattenable","baseFlatten","overArg","ListCache","LARGE_ARRAY_SIZE","ListCache","Map","MapCache","ListCache","stackClear","stackDelete","stackGet","stackHas","stackSet","copyObject","keys","copyObject","keysIn","Buffer","root","stubArray","arrayFilter","copyObject","getSymbols","stubArray","getSymbols","getPrototype","copyObject","getSymbolsIn","isArray","arrayPush","baseGetAllKeys","keys","getSymbols","baseGetAllKeys","keysIn","getSymbolsIn","getNative","root","Promise","getNative","root","Set","getNative","root","mapTag","objectTag","setTag","weakMapTag","dataViewTag","toSource","DataView","Map","Promise","Set","WeakMap","baseGetTag","hasOwnProperty","Uint8Array","root","Uint8Array","cloneArrayBuffer","symbolProto","Symbol","symbolValueOf","cloneArrayBuffer","boolTag","dateTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","cloneArrayBuffer","cloneDataView","cloneTypedArray","cloneRegExp","cloneSymbol","isPrototype","baseCreate","getPrototype","mapTag","isObjectLike","getTag","nodeUtil","baseUnary","baseIsMap","setTag","isObjectLike","getTag","nodeUtil","baseUnary","baseIsSet","CLONE_SYMBOLS_FLAG","argsTag","arrayTag","boolTag","dateTag","errorTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","isObject","isArray","initCloneArray","copyArray","getTag","isBuffer","cloneBuffer","initCloneObject","copySymbolsIn","baseAssignIn","copySymbols","baseAssign","initCloneByTag","Stack","isSet","isMap","key","getAllKeysIn","getAllKeys","keysIn","keys","baseClone","values","MapCache","setCacheAdd","setCacheHas","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","SetCache","arraySome","cacheHas","othValue","map","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","mapTag","regexpTag","setTag","stringTag","Symbol","Uint8Array","eq","mapToArray","setToArray","equalArrays","COMPARE_PARTIAL_FLAG","hasOwnProperty","getAllKeys","COMPARE_PARTIAL_FLAG","hasOwnProperty","isArray","getTag","isBuffer","Stack","isTypedArray","equalArrays","equalByTag","equalObjects","isObjectLike","baseIsEqualDeep","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","Stack","baseIsEqual","isObject","keys","isStrictComparable","getMatchData","matchesStrictComparable","baseIsMatch","castPath","toKey","isLength","isIndex","isArray","isArguments","hasPath","baseHasIn","isKey","isStrictComparable","matchesStrictComparable","toKey","get","hasIn","baseIsEqual","baseGet","isKey","baseProperty","toKey","basePropertyDeep","identity","isArray","baseMatchesProperty","baseMatches","property","createBaseFor","baseFor","keys","isArrayLike","createBaseEach","baseForOwn","collection","isArray","arrayAggregator","baseAggregator","baseIteratee","hasOwnProperty","baseRest","isIterateeCall","keysIn","eq","isObjectLike","isArrayLike","LARGE_ARRAY_SIZE","includes","arrayIncludes","values","arrayMap","baseUnary","arrayIncludesWith","cacheHas","SetCache","baseRest","isArrayLikeObject","baseDifference","baseFlatten","values","toInteger","baseSlice","toInteger","baseSlice","identity","isArray","arrayEach","baseEach","castFunction","collection","isArray","arrayEvery","baseEvery","isIterateeCall","baseIteratee","collection","isArray","arrayFilter","baseFilter","baseIteratee","isArrayLike","baseIteratee","keys","nativeMax","toInteger","baseFindIndex","baseIteratee","createFind","findIndex","isArrayLike","collection","map","isArray","arrayMap","baseMap","baseIteratee","flatMap","baseFlatten","map","hasOwnProperty","createAggregator","hasOwnProperty","hasPath","baseHas","isArray","isObjectLike","baseGetTag","arrayMap","baseValues","keys","nativeMax","isArrayLike","values","toInteger","isString","baseIndexOf","toInteger","baseIndexOf","isArrayLike","isArray","isBuffer","isTypedArray","isArguments","getTag","isPrototype","baseKeys","isObjectLike","baseGetTag","nodeUtil","baseUnary","baseIsRegExp","isSymbol","baseExtremum","identity","baseLt","isObject","castPath","toKey","isIndex","baseGet","castPath","arrayMap","getAllKeysIn","baseIteratee","basePickBy","collection","isArray","arrayReduce","baseReduce","baseIteratee","baseEach","isArray","arrayFilter","baseFilter","negate","baseIteratee","collection","isArray","arraySome","baseSome","isIterateeCall","baseIteratee","Set","setToArray","noop","values","includes","arrayIncludes","arrayIncludesWith","createSet","setToArray","cacheHas","SetCache","baseUniq","baseUniq","baseIteratee","tokenLabel","hasTokenLabel","isString","pickBy","map","isRegExp","some","includes","every","getProductionDslName","drop","uniq","flatten","map","newState","atom","atom","values","find","includes","isArray","every","defaults","reject","map","isRegExp","includes","isFunction","isString","isUndefined","isArray","indexOf","has","reduce","isEmpty","filter","difference","compact","first","group","find","flatten","values","keys","clone","compact","flatten","map","difference","isEmpty","isArray","includes","has","indent","assign","isArray","clone","reject","isUndefined","keys","isEmpty","map","identity","noop","reduce","group","line","msg","last","currConfig","isString","createToken","isUndefined","has","first","map","reduce","getExtraProductionArgument","getProductionDslName","resolveGrammar","values","clone","isEmpty","_first","drop","last","dropRight","getProdType","tokenMatcher","every","map","reduce","flatten","has","isEmpty","keys","AlternativeGAST","map","validateGrammar","flatMap","collectorVisitor","values","pickBy","groupBy","first","getProductionDslName","option","reduce","includes","isEmpty","difference","clone","AlternativeGAST","flatten","drop","dropRight","reject","getProdType","alternation","compact","filter","defaults","orgResolveGrammar","orgValidateGrammar","includes","has","dropRight","isEmpty","find","includes","map","flatten","clone","isEmpty","flatMap","getProdType","has","alternation","getProductionDslName","repetition","option","repetitionMandatory","keys","isArray","isUndefined","isEmpty","map","compact","filter","isFunction","has","noop","isUndefined","keys","newState","includes","values","has","isArray","isEmpty","reduce","every","flatten","values","uniq","isObject","clone","invokeRuleWithTry","newState","has","clone","isUndefined","first","createToken","has","peek","isFunction","isArray","some","has","indent","values","isEmpty","map","has","clone","createTokenOrg","chars.firstIdentChar","repetition","alternation","map","option","filter","block","plus","star","optional","first","last","map","map","reduce","flatten","isEmpty","newState","min","uniqBy","flatMap","closure","defineRules","defineRules","defineRules","defineRules","defineRules","defineRules","defineRules","defineRules","t","JavaLexer","keys","map","join","hardline","parser","line","group","indent","softline","ifBreak","ranges","parser","root","name","CATEGORIES","block","join","hardline","indent","values","line","group","ifBreak","softline","group","indent","line","softline","join","indentIfBreak","children","hardline","constant","indent","line","group","softline","join","children","hardline","hasNonAssignmentOperators","group","indent","line","hardline","join","join","hardline","line","indent","join","declarations","group","indent","line","arrays","blocksAndStatements","classes","expressions","interfaces","lexicalStructure","names","packagesAndModules","typesValuesAndVariables","parser","printer"],"sources":["../src/options.ts","../../../node_modules/lodash-es/_freeGlobal.js","../../../node_modules/lodash-es/_root.js","../../../node_modules/lodash-es/_Symbol.js","../../../node_modules/lodash-es/_getRawTag.js","../../../node_modules/lodash-es/_objectToString.js","../../../node_modules/lodash-es/_baseGetTag.js","../../../node_modules/lodash-es/isObjectLike.js","../../../node_modules/lodash-es/isSymbol.js","../../../node_modules/lodash-es/_arrayMap.js","../../../node_modules/lodash-es/isArray.js","../../../node_modules/lodash-es/_baseToString.js","../../../node_modules/lodash-es/_trimmedEndIndex.js","../../../node_modules/lodash-es/_baseTrim.js","../../../node_modules/lodash-es/isObject.js","../../../node_modules/lodash-es/toNumber.js","../../../node_modules/lodash-es/toFinite.js","../../../node_modules/lodash-es/toInteger.js","../../../node_modules/lodash-es/identity.js","../../../node_modules/lodash-es/isFunction.js","../../../node_modules/lodash-es/_coreJsData.js","../../../node_modules/lodash-es/_isMasked.js","../../../node_modules/lodash-es/_toSource.js","../../../node_modules/lodash-es/_baseIsNative.js","../../../node_modules/lodash-es/_getValue.js","../../../node_modules/lodash-es/_getNative.js","../../../node_modules/lodash-es/_WeakMap.js","../../../node_modules/lodash-es/_baseCreate.js","../../../node_modules/lodash-es/_apply.js","../../../node_modules/lodash-es/noop.js","../../../node_modules/lodash-es/_copyArray.js","../../../node_modules/lodash-es/_shortOut.js","../../../node_modules/lodash-es/constant.js","../../../node_modules/lodash-es/_defineProperty.js","../../../node_modules/lodash-es/_baseSetToString.js","../../../node_modules/lodash-es/_setToString.js","../../../node_modules/lodash-es/_arrayEach.js","../../../node_modules/lodash-es/_baseFindIndex.js","../../../node_modules/lodash-es/_baseIsNaN.js","../../../node_modules/lodash-es/_strictIndexOf.js","../../../node_modules/lodash-es/_baseIndexOf.js","../../../node_modules/lodash-es/_arrayIncludes.js","../../../node_modules/lodash-es/_isIndex.js","../../../node_modules/lodash-es/_baseAssignValue.js","../../../node_modules/lodash-es/eq.js","../../../node_modules/lodash-es/_assignValue.js","../../../node_modules/lodash-es/_copyObject.js","../../../node_modules/lodash-es/_overRest.js","../../../node_modules/lodash-es/_baseRest.js","../../../node_modules/lodash-es/isLength.js","../../../node_modules/lodash-es/isArrayLike.js","../../../node_modules/lodash-es/_isIterateeCall.js","../../../node_modules/lodash-es/_createAssigner.js","../../../node_modules/lodash-es/_isPrototype.js","../../../node_modules/lodash-es/_baseTimes.js","../../../node_modules/lodash-es/_baseIsArguments.js","../../../node_modules/lodash-es/isArguments.js","../../../node_modules/lodash-es/stubFalse.js","../../../node_modules/lodash-es/isBuffer.js","../../../node_modules/lodash-es/_baseIsTypedArray.js","../../../node_modules/lodash-es/_baseUnary.js","../../../node_modules/lodash-es/_nodeUtil.js","../../../node_modules/lodash-es/isTypedArray.js","../../../node_modules/lodash-es/_arrayLikeKeys.js","../../../node_modules/lodash-es/_overArg.js","../../../node_modules/lodash-es/_nativeKeys.js","../../../node_modules/lodash-es/_baseKeys.js","../../../node_modules/lodash-es/keys.js","../../../node_modules/lodash-es/assign.js","../../../node_modules/lodash-es/_nativeKeysIn.js","../../../node_modules/lodash-es/_baseKeysIn.js","../../../node_modules/lodash-es/keysIn.js","../../../node_modules/lodash-es/_isKey.js","../../../node_modules/lodash-es/_nativeCreate.js","../../../node_modules/lodash-es/_hashClear.js","../../../node_modules/lodash-es/_hashDelete.js","../../../node_modules/lodash-es/_hashGet.js","../../../node_modules/lodash-es/_hashHas.js","../../../node_modules/lodash-es/_hashSet.js","../../../node_modules/lodash-es/_Hash.js","../../../node_modules/lodash-es/_listCacheClear.js","../../../node_modules/lodash-es/_assocIndexOf.js","../../../node_modules/lodash-es/_listCacheDelete.js","../../../node_modules/lodash-es/_listCacheGet.js","../../../node_modules/lodash-es/_listCacheHas.js","../../../node_modules/lodash-es/_listCacheSet.js","../../../node_modules/lodash-es/_ListCache.js","../../../node_modules/lodash-es/_Map.js","../../../node_modules/lodash-es/_mapCacheClear.js","../../../node_modules/lodash-es/_isKeyable.js","../../../node_modules/lodash-es/_getMapData.js","../../../node_modules/lodash-es/_mapCacheDelete.js","../../../node_modules/lodash-es/_mapCacheGet.js","../../../node_modules/lodash-es/_mapCacheHas.js","../../../node_modules/lodash-es/_mapCacheSet.js","../../../node_modules/lodash-es/_MapCache.js","../../../node_modules/lodash-es/memoize.js","../../../node_modules/lodash-es/_memoizeCapped.js","../../../node_modules/lodash-es/_stringToPath.js","../../../node_modules/lodash-es/toString.js","../../../node_modules/lodash-es/_castPath.js","../../../node_modules/lodash-es/_toKey.js","../../../node_modules/lodash-es/_baseGet.js","../../../node_modules/lodash-es/get.js","../../../node_modules/lodash-es/_arrayPush.js","../../../node_modules/lodash-es/_isFlattenable.js","../../../node_modules/lodash-es/_baseFlatten.js","../../../node_modules/lodash-es/flatten.js","../../../node_modules/lodash-es/_getPrototype.js","../../../node_modules/lodash-es/_baseSlice.js","../../../node_modules/lodash-es/_arrayReduce.js","../../../node_modules/lodash-es/_stackClear.js","../../../node_modules/lodash-es/_stackDelete.js","../../../node_modules/lodash-es/_stackGet.js","../../../node_modules/lodash-es/_stackHas.js","../../../node_modules/lodash-es/_stackSet.js","../../../node_modules/lodash-es/_Stack.js","../../../node_modules/lodash-es/_baseAssign.js","../../../node_modules/lodash-es/_baseAssignIn.js","../../../node_modules/lodash-es/_cloneBuffer.js","../../../node_modules/lodash-es/_arrayFilter.js","../../../node_modules/lodash-es/stubArray.js","../../../node_modules/lodash-es/_getSymbols.js","../../../node_modules/lodash-es/_copySymbols.js","../../../node_modules/lodash-es/_getSymbolsIn.js","../../../node_modules/lodash-es/_copySymbolsIn.js","../../../node_modules/lodash-es/_baseGetAllKeys.js","../../../node_modules/lodash-es/_getAllKeys.js","../../../node_modules/lodash-es/_getAllKeysIn.js","../../../node_modules/lodash-es/_DataView.js","../../../node_modules/lodash-es/_Promise.js","../../../node_modules/lodash-es/_Set.js","../../../node_modules/lodash-es/_getTag.js","../../../node_modules/lodash-es/_initCloneArray.js","../../../node_modules/lodash-es/_Uint8Array.js","../../../node_modules/lodash-es/_cloneArrayBuffer.js","../../../node_modules/lodash-es/_cloneDataView.js","../../../node_modules/lodash-es/_cloneRegExp.js","../../../node_modules/lodash-es/_cloneSymbol.js","../../../node_modules/lodash-es/_cloneTypedArray.js","../../../node_modules/lodash-es/_initCloneByTag.js","../../../node_modules/lodash-es/_initCloneObject.js","../../../node_modules/lodash-es/_baseIsMap.js","../../../node_modules/lodash-es/isMap.js","../../../node_modules/lodash-es/_baseIsSet.js","../../../node_modules/lodash-es/isSet.js","../../../node_modules/lodash-es/_baseClone.js","../../../node_modules/lodash-es/clone.js","../../../node_modules/lodash-es/compact.js","../../../node_modules/lodash-es/_setCacheAdd.js","../../../node_modules/lodash-es/_setCacheHas.js","../../../node_modules/lodash-es/_SetCache.js","../../../node_modules/lodash-es/_arraySome.js","../../../node_modules/lodash-es/_cacheHas.js","../../../node_modules/lodash-es/_equalArrays.js","../../../node_modules/lodash-es/_mapToArray.js","../../../node_modules/lodash-es/_setToArray.js","../../../node_modules/lodash-es/_equalByTag.js","../../../node_modules/lodash-es/_equalObjects.js","../../../node_modules/lodash-es/_baseIsEqualDeep.js","../../../node_modules/lodash-es/_baseIsEqual.js","../../../node_modules/lodash-es/_baseIsMatch.js","../../../node_modules/lodash-es/_isStrictComparable.js","../../../node_modules/lodash-es/_getMatchData.js","../../../node_modules/lodash-es/_matchesStrictComparable.js","../../../node_modules/lodash-es/_baseMatches.js","../../../node_modules/lodash-es/_baseHasIn.js","../../../node_modules/lodash-es/_hasPath.js","../../../node_modules/lodash-es/hasIn.js","../../../node_modules/lodash-es/_baseMatchesProperty.js","../../../node_modules/lodash-es/_baseProperty.js","../../../node_modules/lodash-es/_basePropertyDeep.js","../../../node_modules/lodash-es/property.js","../../../node_modules/lodash-es/_baseIteratee.js","../../../node_modules/lodash-es/_arrayAggregator.js","../../../node_modules/lodash-es/_createBaseFor.js","../../../node_modules/lodash-es/_baseFor.js","../../../node_modules/lodash-es/_baseForOwn.js","../../../node_modules/lodash-es/_createBaseEach.js","../../../node_modules/lodash-es/_baseEach.js","../../../node_modules/lodash-es/_baseAggregator.js","../../../node_modules/lodash-es/_createAggregator.js","../../../node_modules/lodash-es/defaults.js","../../../node_modules/lodash-es/isArrayLikeObject.js","../../../node_modules/lodash-es/_arrayIncludesWith.js","../../../node_modules/lodash-es/_baseDifference.js","../../../node_modules/lodash-es/difference.js","../../../node_modules/lodash-es/last.js","../../../node_modules/lodash-es/drop.js","../../../node_modules/lodash-es/dropRight.js","../../../node_modules/lodash-es/_castFunction.js","../../../node_modules/lodash-es/forEach.js","../../../node_modules/lodash-es/_arrayEvery.js","../../../node_modules/lodash-es/_baseEvery.js","../../../node_modules/lodash-es/every.js","../../../node_modules/lodash-es/_baseFilter.js","../../../node_modules/lodash-es/filter.js","../../../node_modules/lodash-es/_createFind.js","../../../node_modules/lodash-es/findIndex.js","../../../node_modules/lodash-es/find.js","../../../node_modules/lodash-es/head.js","../../../node_modules/lodash-es/_baseMap.js","../../../node_modules/lodash-es/map.js","../../../node_modules/lodash-es/flatMap.js","../../../node_modules/lodash-es/groupBy.js","../../../node_modules/lodash-es/_baseHas.js","../../../node_modules/lodash-es/has.js","../../../node_modules/lodash-es/isString.js","../../../node_modules/lodash-es/_baseValues.js","../../../node_modules/lodash-es/values.js","../../../node_modules/lodash-es/includes.js","../../../node_modules/lodash-es/indexOf.js","../../../node_modules/lodash-es/isEmpty.js","../../../node_modules/lodash-es/_baseIsRegExp.js","../../../node_modules/lodash-es/isRegExp.js","../../../node_modules/lodash-es/isUndefined.js","../../../node_modules/lodash-es/_baseLt.js","../../../node_modules/lodash-es/_baseExtremum.js","../../../node_modules/lodash-es/min.js","../../../node_modules/lodash-es/negate.js","../../../node_modules/lodash-es/_baseSet.js","../../../node_modules/lodash-es/_basePickBy.js","../../../node_modules/lodash-es/pickBy.js","../../../node_modules/lodash-es/_baseReduce.js","../../../node_modules/lodash-es/reduce.js","../../../node_modules/lodash-es/reject.js","../../../node_modules/lodash-es/_baseSome.js","../../../node_modules/lodash-es/some.js","../../../node_modules/lodash-es/_createSet.js","../../../node_modules/lodash-es/_baseUniq.js","../../../node_modules/lodash-es/uniq.js","../../../node_modules/lodash-es/uniqBy.js","../../../node_modules/@chevrotain/utils/lib/src/print.js","../../../node_modules/@chevrotain/utils/lib/src/timer.js","../../../node_modules/@chevrotain/utils/lib/src/to-fast-properties.js","../../../node_modules/@chevrotain/gast/lib/src/model.js","../../../node_modules/@chevrotain/gast/lib/src/visitor.js","../../../node_modules/@chevrotain/gast/lib/src/helpers.js","../../../node_modules/chevrotain/lib/src/parse/grammar/rest.js","../../../node_modules/chevrotain/lib/src/parse/grammar/first.js","../../../node_modules/chevrotain/lib/src/parse/constants.js","../../../node_modules/chevrotain/lib/src/parse/grammar/follow.js","../../../node_modules/@chevrotain/regexp-to-ast/lib/src/utils.js","../../../node_modules/@chevrotain/regexp-to-ast/lib/src/character-classes.js","../../../node_modules/@chevrotain/regexp-to-ast/lib/src/regexp-parser.js","../../../node_modules/@chevrotain/regexp-to-ast/lib/src/base-regexp-visitor.js","../../../node_modules/chevrotain/lib/src/scan/reg_exp_parser.js","../../../node_modules/chevrotain/lib/src/scan/reg_exp.js","../../../node_modules/chevrotain/lib/src/scan/lexer.js","../../../node_modules/chevrotain/lib/src/scan/tokens.js","../../../node_modules/chevrotain/lib/src/scan/lexer_errors_public.js","../../../node_modules/chevrotain/lib/src/scan/lexer_public.js","../../../node_modules/chevrotain/lib/src/scan/tokens_public.js","../../../node_modules/chevrotain/lib/src/parse/errors_public.js","../../../node_modules/chevrotain/lib/src/parse/grammar/resolver.js","../../../node_modules/chevrotain/lib/src/parse/grammar/interpreter.js","../../../node_modules/chevrotain/lib/src/parse/grammar/lookahead.js","../../../node_modules/chevrotain/lib/src/parse/grammar/checks.js","../../../node_modules/chevrotain/lib/src/parse/grammar/gast/gast_resolver_public.js","../../../node_modules/chevrotain/lib/src/parse/exceptions_public.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/recoverable.js","../../../node_modules/chevrotain/lib/src/parse/grammar/keys.js","../../../node_modules/chevrotain/lib/src/parse/grammar/llk_lookahead.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/looksahead.js","../../../node_modules/chevrotain/lib/src/parse/cst/cst.js","../../../node_modules/chevrotain/lib/src/lang/lang_extensions.js","../../../node_modules/chevrotain/lib/src/parse/cst/cst_visitor.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/tree_builder.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/lexer_adapter.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_api.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_engine.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/error_handler.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/context_assist.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/gast_recorder.js","../../../node_modules/chevrotain/lib/src/parse/parser/traits/perf_tracer.js","../../../node_modules/chevrotain/lib/src/parse/parser/utils/apply_mixins.js","../../../node_modules/chevrotain/lib/src/parse/parser/parser.js","../../../node_modules/lodash/_freeGlobal.js","../../../node_modules/lodash/_root.js","../../../node_modules/lodash/_Symbol.js","../../../node_modules/lodash/_arrayMap.js","../../../node_modules/lodash/isArray.js","../../../node_modules/lodash/_getRawTag.js","../../../node_modules/lodash/_objectToString.js","../../../node_modules/lodash/_baseGetTag.js","../../../node_modules/lodash/isObjectLike.js","../../../node_modules/lodash/isSymbol.js","../../../node_modules/lodash/_baseToString.js","../../../node_modules/lodash/toString.js","../../../node_modules/lodash/_baseSlice.js","../../../node_modules/lodash/_castSlice.js","../../../node_modules/lodash/_hasUnicode.js","../../../node_modules/lodash/_asciiToArray.js","../../../node_modules/lodash/_unicodeToArray.js","../../../node_modules/lodash/_stringToArray.js","../../../node_modules/lodash/_createCaseFirst.js","../../../node_modules/lodash/upperFirst.js","../../../node_modules/lodash/capitalize.js","../../../node_modules/lodash/_arrayReduce.js","../../../node_modules/lodash/_basePropertyOf.js","../../../node_modules/lodash/_deburrLetter.js","../../../node_modules/lodash/deburr.js","../../../node_modules/lodash/_asciiWords.js","../../../node_modules/lodash/_hasUnicodeWord.js","../../../node_modules/lodash/_unicodeWords.js","../../../node_modules/lodash/words.js","../../../node_modules/lodash/_createCompounder.js","../../../node_modules/lodash/camelCase.js","../../java-parser/src/unicodesets.js","../../java-parser/src/tokens.js","../../java-parser/src/utils.js","../../java-parser/src/lexer.js","../../../node_modules/chevrotain-allstar/lib/atn.js","../../../node_modules/chevrotain-allstar/lib/dfa.js","../../../node_modules/chevrotain-allstar/lib/all-star-lookahead.js","../../java-parser/src/productions/lexical-structure.js","../../java-parser/src/productions/types-values-and-variables.js","../../java-parser/src/productions/names.js","../../java-parser/src/productions/packages-and-modules.js","../../java-parser/src/productions/classes.js","../../java-parser/src/productions/interfaces.js","../../java-parser/src/productions/arrays.js","../../java-parser/src/productions/blocks-and-statements.js","../../java-parser/src/productions/expressions.js","../../java-parser/src/parser.js","../../java-parser/src/index.js","../src/printers/helpers.ts","../src/comments.ts","../src/parser.ts","../src/printers/arrays.ts","../src/printers/blocks-and-statements.ts","../src/printers/classes.ts","../src/printers/expressions.ts","../src/printers/interfaces.ts","../src/printers/lexical-structure.ts","../src/printers/names.ts","../src/printers/packages-and-modules.ts","../src/printers/types-values-and-variables.ts","../src/printers/index.ts","../src/printer.ts","../src/index.ts"],"sourcesContent":["import type { SupportOptions } from \"prettier\";\n\nexport default {\n  entrypoint: {\n    type: \"choice\",\n    category: \"Global\",\n    default: \"compilationUnit\",\n    // sed -nr 's/.*\\.RULE\\(([^,]+),.*/\\1/p' $(ls path/to/java-parser/rules/folder/*)\n    choices: [\n      { value: \"arrayInitializer\", description: \"\" },\n      { value: \"variableInitializerList\", description: \"\" },\n      { value: \"block\", description: \"\" },\n      { value: \"blockStatements\", description: \"\" },\n      { value: \"blockStatement\", description: \"\" },\n      { value: \"localVariableDeclarationStatement\", description: \"\" },\n      { value: \"localVariableDeclaration\", description: \"\" },\n      { value: \"localVariableType\", description: \"\" },\n      { value: \"statement\", description: \"\" },\n      { value: \"statementWithoutTrailingSubstatement\", description: \"\" },\n      { value: \"emptyStatement\", description: \"\" },\n      { value: \"labeledStatement\", description: \"\" },\n      { value: \"expressionStatement\", description: \"\" },\n      { value: \"statementExpression\", description: \"\" },\n      { value: \"ifStatement\", description: \"\" },\n      { value: \"assertStatement\", description: \"\" },\n      { value: \"switchStatement\", description: \"\" },\n      { value: \"switchBlock\", description: \"\" },\n      { value: \"switchBlockStatementGroup\", description: \"\" },\n      { value: \"switchLabel\", description: \"\" },\n      { value: \"switchRule\", description: \"\" },\n      { value: \"caseConstant\", description: \"\" },\n      { value: \"casePattern\", description: \"\" },\n      { value: \"whileStatement\", description: \"\" },\n      { value: \"doStatement\", description: \"\" },\n      { value: \"forStatement\", description: \"\" },\n      { value: \"basicForStatement\", description: \"\" },\n      { value: \"forInit\", description: \"\" },\n      { value: \"forUpdate\", description: \"\" },\n      { value: \"statementExpressionList\", description: \"\" },\n      { value: \"enhancedForStatement\", description: \"\" },\n      { value: \"breakStatement\", description: \"\" },\n      { value: \"continueStatement\", description: \"\" },\n      { value: \"returnStatement\", description: \"\" },\n      { value: \"throwStatement\", description: \"\" },\n      { value: \"synchronizedStatement\", description: \"\" },\n      { value: \"tryStatement\", description: \"\" },\n      { value: \"catches\", description: \"\" },\n      { value: \"catchClause\", description: \"\" },\n      { value: \"catchFormalParameter\", description: \"\" },\n      { value: \"catchType\", description: \"\" },\n      { value: \"finally\", description: \"\" },\n      { value: \"tryWithResourcesStatement\", description: \"\" },\n      { value: \"resourceSpecification\", description: \"\" },\n      { value: \"resourceList\", description: \"\" },\n      { value: \"resource\", description: \"\" },\n      { value: \"yieldStatement\", description: \"\" },\n      { value: \"variableAccess\", description: \"\" },\n      { value: \"classDeclaration\", description: \"\" },\n      { value: \"normalClassDeclaration\", description: \"\" },\n      { value: \"classModifier\", description: \"\" },\n      { value: \"typeParameters\", description: \"\" },\n      { value: \"typeParameterList\", description: \"\" },\n      { value: \"classExtends\", description: \"\" },\n      { value: \"classImplements\", description: \"\" },\n      { value: \"interfaceTypeList\", description: \"\" },\n      { value: \"classPermits\", description: \"\" },\n      { value: \"classBody\", description: \"\" },\n      { value: \"classBodyDeclaration\", description: \"\" },\n      { value: \"classMemberDeclaration\", description: \"\" },\n      { value: \"fieldDeclaration\", description: \"\" },\n      { value: \"fieldModifier\", description: \"\" },\n      { value: \"variableDeclaratorList\", description: \"\" },\n      { value: \"variableDeclarator\", description: \"\" },\n      { value: \"variableDeclaratorId\", description: \"\" },\n      { value: \"variableInitializer\", description: \"\" },\n      { value: \"unannType\", description: \"\" },\n      { value: \"unannPrimitiveTypeWithOptionalDimsSuffix\", description: \"\" },\n      { value: \"unannPrimitiveType\", description: \"\" },\n      { value: \"unannReferenceType\", description: \"\" },\n      { value: \"unannClassOrInterfaceType\", description: \"\" },\n      { value: \"unannClassType\", description: \"\" },\n      { value: \"unannInterfaceType\", description: \"\" },\n      { value: \"unannTypeVariable\", description: \"\" },\n      { value: \"methodDeclaration\", description: \"\" },\n      { value: \"methodModifier\", description: \"\" },\n      { value: \"methodHeader\", description: \"\" },\n      { value: \"result\", description: \"\" },\n      { value: \"methodDeclarator\", description: \"\" },\n      { value: \"receiverParameter\", description: \"\" },\n      { value: \"formalParameterList\", description: \"\" },\n      { value: \"formalParameter\", description: \"\" },\n      { value: \"variableParaRegularParameter\", description: \"\" },\n      { value: \"variableArityParameter\", description: \"\" },\n      { value: \"variableModifier\", description: \"\" },\n      { value: \"throws\", description: \"\" },\n      { value: \"exceptionTypeList\", description: \"\" },\n      { value: \"exceptionType\", description: \"\" },\n      { value: \"methodBody\", description: \"\" },\n      { value: \"instanceInitializer\", description: \"\" },\n      { value: \"staticInitializer\", description: \"\" },\n      { value: \"constructorDeclaration\", description: \"\" },\n      { value: \"constructorModifier\", description: \"\" },\n      { value: \"constructorDeclarator\", description: \"\" },\n      { value: \"simpleTypeName\", description: \"\" },\n      { value: \"constructorBody\", description: \"\" },\n      { value: \"explicitConstructorInvocation\", description: \"\" },\n      { value: \"unqualifiedExplicitConstructorInvocation\", description: \"\" },\n      { value: \"qualifiedExplicitConstructorInvocation\", description: \"\" },\n      { value: \"enumDeclaration\", description: \"\" },\n      { value: \"enumBody\", description: \"\" },\n      { value: \"enumConstantList\", description: \"\" },\n      { value: \"enumConstant\", description: \"\" },\n      { value: \"enumConstantModifier\", description: \"\" },\n      { value: \"enumBodyDeclarations\", description: \"\" },\n      { value: \"recordDeclaration\", description: \"\" },\n      { value: \"recordHeader\", description: \"\" },\n      { value: \"recordComponentList\", description: \"\" },\n      { value: \"recordComponent\", description: \"\" },\n      { value: \"variableArityRecordComponent\", description: \"\" },\n      { value: \"recordComponentModifier\", description: \"\" },\n      { value: \"recordBody\", description: \"\" },\n      { value: \"recordBodyDeclaration\", description: \"\" },\n      { value: \"compactConstructorDeclaration\", description: \"\" },\n      { value: \"isDims\", description: \"\" },\n      { value: \"expression\", description: \"\" },\n      { value: \"lambdaExpression\", description: \"\" },\n      { value: \"lambdaParameters\", description: \"\" },\n      { value: \"lambdaParametersWithBraces\", description: \"\" },\n      { value: \"lambdaParameterList\", description: \"\" },\n      { value: \"conciseLambdaParameterList\", description: \"\" },\n      { value: \"normalLambdaParameterList\", description: \"\" },\n      { value: \"normalLambdaParameter\", description: \"\" },\n      { value: \"regularLambdaParameter\", description: \"\" },\n      { value: \"lambdaParameterType\", description: \"\" },\n      { value: \"conciseLambdaParameter\", description: \"\" },\n      { value: \"lambdaBody\", description: \"\" },\n      { value: \"conditionalExpression\", description: \"\" },\n      { value: \"binaryExpression\", description: \"\" },\n      { value: \"unaryExpression\", description: \"\" },\n      { value: \"unaryExpressionNotPlusMinus\", description: \"\" },\n      { value: \"primary\", description: \"\" },\n      { value: \"primaryPrefix\", description: \"\" },\n      { value: \"primarySuffix\", description: \"\" },\n      { value: \"fqnOrRefType\", description: \"\" },\n      { value: \"fqnOrRefTypePartRest\", description: \"\" },\n      { value: \"fqnOrRefTypePartCommon\", description: \"\" },\n      { value: \"fqnOrRefTypePartFirst\", description: \"\" },\n      { value: \"parenthesisExpression\", description: \"\" },\n      { value: \"castExpression\", description: \"\" },\n      { value: \"primitiveCastExpression\", description: \"\" },\n      { value: \"referenceTypeCastExpression\", description: \"\" },\n      { value: \"newExpression\", description: \"\" },\n      { value: \"unqualifiedClassInstanceCreationExpression\", description: \"\" },\n      { value: \"classOrInterfaceTypeToInstantiate\", description: \"\" },\n      { value: \"typeArgumentsOrDiamond\", description: \"\" },\n      { value: \"diamond\", description: \"\" },\n      { value: \"methodInvocationSuffix\", description: \"\" },\n      { value: \"argumentList\", description: \"\" },\n      { value: \"arrayCreationExpression\", description: \"\" },\n      {\n        value: \"arrayCreationExpressionWithoutInitializerSuffix\",\n        description: \"\"\n      },\n      { value: \"arrayCreationWithInitializerSuffix\", description: \"\" },\n      { value: \"dimExprs\", description: \"\" },\n      { value: \"dimExpr\", description: \"\" },\n      { value: \"classLiteralSuffix\", description: \"\" },\n      { value: \"arrayAccessSuffix\", description: \"\" },\n      { value: \"methodReferenceSuffix\", description: \"\" },\n      { value: \"templateArgument\", description: \"\" },\n      { value: \"template\", description: \"\" },\n      { value: \"stringTemplate\", description: \"\" },\n      { value: \"textBlockTemplate\", description: \"\" },\n      { value: \"embeddedExpression\", description: \"\" },\n      { value: \"pattern\", description: \"\" },\n      { value: \"typePattern\", description: \"\" },\n      { value: \"recordPattern\", description: \"\" },\n      { value: \"componentPatternList\", description: \"\" },\n      { value: \"componentPattern\", description: \"\" },\n      { value: \"matchAllPattern\", description: \"\" },\n      { value: \"guard\", description: \"\" },\n      { value: \"isRefTypeInMethodRef\", description: \"\" },\n      { value: \"interfaceDeclaration\", description: \"\" },\n      { value: \"normalInterfaceDeclaration\", description: \"\" },\n      { value: \"interfaceModifier\", description: \"\" },\n      { value: \"interfaceExtends\", description: \"\" },\n      { value: \"interfacePermits\", description: \"\" },\n      { value: \"interfaceBody\", description: \"\" },\n      { value: \"interfaceMemberDeclaration\", description: \"\" },\n      { value: \"constantDeclaration\", description: \"\" },\n      { value: \"constantModifier\", description: \"\" },\n      { value: \"interfaceMethodDeclaration\", description: \"\" },\n      { value: \"interfaceMethodModifier\", description: \"\" },\n      { value: \"annotationInterfaceDeclaration\", description: \"\" },\n      { value: \"annotationInterfaceBody\", description: \"\" },\n      { value: \"annotationInterfaceMemberDeclaration\", description: \"\" },\n      { value: \"annotationInterfaceElementDeclaration\", description: \"\" },\n      { value: \"annotationInterfaceElementModifier\", description: \"\" },\n      { value: \"defaultValue\", description: \"\" },\n      { value: \"annotation\", description: \"\" },\n      { value: \"elementValuePairList\", description: \"\" },\n      { value: \"elementValuePair\", description: \"\" },\n      { value: \"elementValue\", description: \"\" },\n      { value: \"elementValueArrayInitializer\", description: \"\" },\n      { value: \"elementValueList\", description: \"\" },\n      { value: \"literal\", description: \"\" },\n      { value: \"integerLiteral\", description: \"\" },\n      { value: \"floatingPointLiteral\", description: \"\" },\n      { value: \"booleanLiteral\", description: \"\" },\n      { value: \"shiftOperator\", description: \"\" },\n      { value: \"moduleName\", description: \"\" },\n      { value: \"packageName\", description: \"\" },\n      { value: \"typeName\", description: \"\" },\n      { value: \"expressionName\", description: \"\" },\n      { value: \"methodName\", description: \"\" },\n      { value: \"packageOrTypeName\", description: \"\" },\n      { value: \"ambiguousName\", description: \"\" },\n      { value: \"compilationUnit\", description: \"\" },\n      { value: \"ordinaryCompilationUnit\", description: \"\" },\n      { value: \"modularCompilationUnit\", description: \"\" },\n      { value: \"packageDeclaration\", description: \"\" },\n      { value: \"packageModifier\", description: \"\" },\n      { value: \"importDeclaration\", description: \"\" },\n      { value: \"typeDeclaration\", description: \"\" },\n      { value: \"moduleDeclaration\", description: \"\" },\n      { value: \"moduleDirective\", description: \"\" },\n      { value: \"requiresModuleDirective\", description: \"\" },\n      { value: \"exportsModuleDirective\", description: \"\" },\n      { value: \"opensModuleDirective\", description: \"\" },\n      { value: \"usesModuleDirective\", description: \"\" },\n      { value: \"providesModuleDirective\", description: \"\" },\n      { value: \"requiresModifier\", description: \"\" },\n      { value: \"primitiveType\", description: \"\" },\n      { value: \"numericType\", description: \"\" },\n      { value: \"integralType\", description: \"\" },\n      { value: \"floatingPointType\", description: \"\" },\n      { value: \"referenceType\", description: \"\" },\n      { value: \"classOrInterfaceType\", description: \"\" },\n      { value: \"classType\", description: \"\" },\n      { value: \"interfaceType\", description: \"\" },\n      { value: \"typeVariable\", description: \"\" },\n      { value: \"dims\", description: \"\" },\n      { value: \"typeParameter\", description: \"\" },\n      { value: \"typeParameterModifier\", description: \"\" },\n      { value: \"typeBound\", description: \"\" },\n      { value: \"additionalBound\", description: \"\" },\n      { value: \"typeArguments\", description: \"\" },\n      { value: \"typeArgumentList\", description: \"\" },\n      { value: \"typeArgument\", description: \"\" },\n      { value: \"wildcard\", description: \"\" },\n      { value: \"wildcardBounds\", description: \"\" }\n    ],\n    description:\n      \"Prettify from the entrypoint, allowing to use prettier on snippet.\"\n  },\n  arrowParens: {\n    type: \"choice\",\n    category: \"Java\",\n    default: \"always\",\n    choices: [\n      { value: \"always\", description: \"\" },\n      { value: \"avoid\", description: \"\" }\n    ],\n    description: \"Include parentheses around a sole arrow function parameter.\"\n  },\n  trailingComma: {\n    type: \"choice\",\n    category: \"Java\",\n    default: \"all\",\n    choices: [\n      { value: \"all\", description: \"\" },\n      { value: \"es5\", description: \"\" },\n      { value: \"none\", description: \"\" }\n    ],\n    description: \"Print trailing commas wherever possible when multi-line.\"\n  },\n  experimentalOperatorPosition: {\n    type: \"choice\",\n    category: \"Java\",\n    default: \"end\",\n    choices: [\n      { value: \"start\", description: \"\" },\n      { value: \"end\", description: \"\" }\n    ],\n    description: \"Where to print operators when binary expressions wrap lines.\"\n  }\n} satisfies SupportOptions;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nexport default getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nexport default baseGetTag;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nexport default arrayMap;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nexport default isArray;\n","import Symbol from './_Symbol.js';\nimport arrayMap from './_arrayMap.js';\nimport isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default baseToString;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nexport default identity;\n","import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n","import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n","import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nexport default toSource;\n","import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nexport default baseIsNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n","import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nexport default WeakMap;\n","import isObject from './isObject.js';\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nexport default baseCreate;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nexport default apply;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nexport default noop;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nexport default copyArray;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nexport default shortOut;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nexport default constant;\n","import getNative from './_getNative.js';\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nexport default defineProperty;\n","import constant from './constant.js';\nimport defineProperty from './_defineProperty.js';\nimport identity from './identity.js';\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nexport default baseSetToString;\n","import baseSetToString from './_baseSetToString.js';\nimport shortOut from './_shortOut.js';\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nexport default setToString;\n","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nexport default arrayEach;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nexport default baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nexport default baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nexport default strictIndexOf;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIsNaN from './_baseIsNaN.js';\nimport strictIndexOf from './_strictIndexOf.js';\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nexport default baseIndexOf;\n","import baseIndexOf from './_baseIndexOf.js';\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nexport default arrayIncludes;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nexport default isIndex;\n","import defineProperty from './_defineProperty.js';\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nexport default baseAssignValue;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n","import baseAssignValue from './_baseAssignValue.js';\nimport eq from './eq.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nexport default assignValue;\n","import assignValue from './_assignValue.js';\nimport baseAssignValue from './_baseAssignValue.js';\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nexport default copyObject;\n","import apply from './_apply.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nexport default overRest;\n","import identity from './identity.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nexport default baseRest;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n","import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n","import eq from './eq.js';\nimport isArrayLike from './isArrayLike.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nexport default isIterateeCall;\n","import baseRest from './_baseRest.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\nexport default createAssigner;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nexport default isPrototype;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nexport default baseTimes;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nexport default baseIsArguments;\n","import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nexport default stubFalse;\n","import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n","import baseGetTag from './_baseGetTag.js';\nimport isLength from './isLength.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nexport default baseIsTypedArray;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nexport default baseUnary;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nexport default nodeUtil;\n","import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n","import baseTimes from './_baseTimes.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isIndex from './_isIndex.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default arrayLikeKeys;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nexport default overArg;\n","import overArg from './_overArg.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nexport default nativeKeys;\n","import isPrototype from './_isPrototype.js';\nimport nativeKeys from './_nativeKeys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default baseKeys;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n","import assignValue from './_assignValue.js';\nimport copyObject from './_copyObject.js';\nimport createAssigner from './_createAssigner.js';\nimport isArrayLike from './isArrayLike.js';\nimport isPrototype from './_isPrototype.js';\nimport keys from './keys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * function Bar() {\n *   this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\nvar assign = createAssigner(function(object, source) {\n  if (isPrototype(source) || isArrayLike(source)) {\n    copyObject(source, keys(source), object);\n    return;\n  }\n  for (var key in source) {\n    if (hasOwnProperty.call(source, key)) {\n      assignValue(object, key, source[key]);\n    }\n  }\n});\n\nexport default assign;\n","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default nativeKeysIn;\n","import isObject from './isObject.js';\nimport isPrototype from './_isPrototype.js';\nimport nativeKeysIn from './_nativeKeysIn.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default baseKeysIn;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeysIn from './_baseKeysIn.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nexport default keysIn;\n","import isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nexport default isKey;\n","import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nexport default hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nexport default hashSet;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nexport default listCacheClear;\n","import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nexport default listCacheDelete;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nexport default listCacheSet;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nexport default mapCacheClear;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nexport default isKeyable;\n","import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n","import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nexport default mapCacheSet;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n","import MapCache from './_MapCache.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nexport default memoize;\n","import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nexport default memoizeCapped;\n","import memoizeCapped from './_memoizeCapped.js';\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nexport default stringToPath;\n","import baseToString from './_baseToString.js';\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nexport default toString;\n","import isArray from './isArray.js';\nimport isKey from './_isKey.js';\nimport stringToPath from './_stringToPath.js';\nimport toString from './toString.js';\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nexport default castPath;\n","import isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default toKey;\n","import castPath from './_castPath.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nexport default baseGet;\n","import baseGet from './_baseGet.js';\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nexport default get;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nexport default arrayPush;\n","import Symbol from './_Symbol.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nexport default isFlattenable;\n","import arrayPush from './_arrayPush.js';\nimport isFlattenable from './_isFlattenable.js';\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nexport default baseFlatten;\n","import baseFlatten from './_baseFlatten.js';\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import overArg from './_overArg.js';\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nexport default getPrototype;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nexport default baseSlice;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nexport default arrayReduce;\n","import ListCache from './_ListCache.js';\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nexport default stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nexport default stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nexport default stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nexport default stackHas;\n","import ListCache from './_ListCache.js';\nimport Map from './_Map.js';\nimport MapCache from './_MapCache.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nexport default stackSet;\n","import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\n","import copyObject from './_copyObject.js';\nimport keys from './keys.js';\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nexport default baseAssign;\n","import copyObject from './_copyObject.js';\nimport keysIn from './keysIn.js';\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nexport default baseAssignIn;\n","import root from './_root.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nexport default cloneBuffer;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nexport default arrayFilter;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n","import arrayFilter from './_arrayFilter.js';\nimport stubArray from './stubArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nexport default getSymbols;\n","import copyObject from './_copyObject.js';\nimport getSymbols from './_getSymbols.js';\n\n/**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nexport default copySymbols;\n","import arrayPush from './_arrayPush.js';\nimport getPrototype from './_getPrototype.js';\nimport getSymbols from './_getSymbols.js';\nimport stubArray from './stubArray.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n  var result = [];\n  while (object) {\n    arrayPush(result, getSymbols(object));\n    object = getPrototype(object);\n  }\n  return result;\n};\n\nexport default getSymbolsIn;\n","import copyObject from './_copyObject.js';\nimport getSymbolsIn from './_getSymbolsIn.js';\n\n/**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nexport default copySymbolsIn;\n","import arrayPush from './_arrayPush.js';\nimport isArray from './isArray.js';\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nexport default baseGetAllKeys;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbols from './_getSymbols.js';\nimport keys from './keys.js';\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nexport default getAllKeys;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbolsIn from './_getSymbolsIn.js';\nimport keysIn from './keysIn.js';\n\n/**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nexport default getAllKeysIn;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nexport default DataView;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nexport default Promise;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nexport default Set;\n","import DataView from './_DataView.js';\nimport Map from './_Map.js';\nimport Promise from './_Promise.js';\nimport Set from './_Set.js';\nimport WeakMap from './_WeakMap.js';\nimport baseGetTag from './_baseGetTag.js';\nimport toSource from './_toSource.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nexport default getTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = new array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\nexport default initCloneArray;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nexport default Uint8Array;\n","import Uint8Array from './_Uint8Array.js';\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nexport default cloneArrayBuffer;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nexport default cloneDataView;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nexport default cloneRegExp;\n","import Symbol from './_Symbol.js';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nexport default cloneSymbol;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nexport default cloneTypedArray;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\nimport cloneDataView from './_cloneDataView.js';\nimport cloneRegExp from './_cloneRegExp.js';\nimport cloneSymbol from './_cloneSymbol.js';\nimport cloneTypedArray from './_cloneTypedArray.js';\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return new Ctor;\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return new Ctor;\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\nexport default initCloneByTag;\n","import baseCreate from './_baseCreate.js';\nimport getPrototype from './_getPrototype.js';\nimport isPrototype from './_isPrototype.js';\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nexport default initCloneObject;\n","import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nexport default baseIsMap;\n","import baseIsMap from './_baseIsMap.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nexport default isMap;\n","import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nexport default baseIsSet;\n","import baseIsSet from './_baseIsSet.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nexport default isSet;\n","import Stack from './_Stack.js';\nimport arrayEach from './_arrayEach.js';\nimport assignValue from './_assignValue.js';\nimport baseAssign from './_baseAssign.js';\nimport baseAssignIn from './_baseAssignIn.js';\nimport cloneBuffer from './_cloneBuffer.js';\nimport copyArray from './_copyArray.js';\nimport copySymbols from './_copySymbols.js';\nimport copySymbolsIn from './_copySymbolsIn.js';\nimport getAllKeys from './_getAllKeys.js';\nimport getAllKeysIn from './_getAllKeysIn.js';\nimport getTag from './_getTag.js';\nimport initCloneArray from './_initCloneArray.js';\nimport initCloneByTag from './_initCloneByTag.js';\nimport initCloneObject from './_initCloneObject.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isMap from './isMap.js';\nimport isObject from './isObject.js';\nimport isSet from './isSet.js';\nimport keys from './keys.js';\nimport keysIn from './keysIn.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Deep clone\n *  2 - Flatten inherited properties\n *  4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n  var result,\n      isDeep = bitmask & CLONE_DEEP_FLAG,\n      isFlat = bitmask & CLONE_FLAT_FLAG,\n      isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      result = (isFlat || isFunc) ? {} : initCloneObject(value);\n      if (!isDeep) {\n        return isFlat\n          ? copySymbolsIn(value, baseAssignIn(result, value))\n          : copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (isSet(value)) {\n    value.forEach(function(subValue) {\n      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n    });\n  } else if (isMap(value)) {\n    value.forEach(function(subValue, key) {\n      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n    });\n  }\n\n  var keysFunc = isFull\n    ? (isFlat ? getAllKeysIn : getAllKeys)\n    : (isFlat ? keysIn : keys);\n\n  var props = isArr ? undefined : keysFunc(value);\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n  });\n  return result;\n}\n\nexport default baseClone;\n","import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nexport default clone;\n","/**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\nfunction compact(array) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (value) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nexport default compact;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nexport default setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nexport default setCacheHas;\n","import MapCache from './_MapCache.js';\nimport setCacheAdd from './_setCacheAdd.js';\nimport setCacheHas from './_setCacheHas.js';\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nexport default SetCache;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arraySome;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nexport default cacheHas;\n","import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nexport default setToArray;\n","import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n","import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n","import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nexport default baseIsEqualDeep;\n","import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nexport default baseIsEqual;\n","import Stack from './_Stack.js';\nimport baseIsEqual from './_baseIsEqual.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nexport default baseIsMatch;\n","import isObject from './isObject.js';\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nexport default isStrictComparable;\n","import isStrictComparable from './_isStrictComparable.js';\nimport keys from './keys.js';\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nexport default getMatchData;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nexport default matchesStrictComparable;\n","import baseIsMatch from './_baseIsMatch.js';\nimport getMatchData from './_getMatchData.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nexport default baseMatches;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nexport default baseHasIn;\n","import castPath from './_castPath.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isIndex from './_isIndex.js';\nimport isLength from './isLength.js';\nimport toKey from './_toKey.js';\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nexport default hasPath;\n","import baseHasIn from './_baseHasIn.js';\nimport hasPath from './_hasPath.js';\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nexport default hasIn;\n","import baseIsEqual from './_baseIsEqual.js';\nimport get from './get.js';\nimport hasIn from './hasIn.js';\nimport isKey from './_isKey.js';\nimport isStrictComparable from './_isStrictComparable.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\nimport toKey from './_toKey.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nexport default baseMatchesProperty;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nexport default baseProperty;\n","import baseGet from './_baseGet.js';\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nexport default basePropertyDeep;\n","import baseProperty from './_baseProperty.js';\nimport basePropertyDeep from './_basePropertyDeep.js';\nimport isKey from './_isKey.js';\nimport toKey from './_toKey.js';\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nexport default property;\n","import baseMatches from './_baseMatches.js';\nimport baseMatchesProperty from './_baseMatchesProperty.js';\nimport identity from './identity.js';\nimport isArray from './isArray.js';\nimport property from './property.js';\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nexport default baseIteratee;\n","/**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\nfunction arrayAggregator(array, setter, iteratee, accumulator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    var value = array[index];\n    setter(accumulator, value, iteratee(value), array);\n  }\n  return accumulator;\n}\n\nexport default arrayAggregator;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nexport default createBaseFor;\n","import createBaseFor from './_createBaseFor.js';\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nexport default baseFor;\n","import baseFor from './_baseFor.js';\nimport keys from './keys.js';\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nexport default baseForOwn;\n","import isArrayLike from './isArrayLike.js';\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nexport default createBaseEach;\n","import baseForOwn from './_baseForOwn.js';\nimport createBaseEach from './_createBaseEach.js';\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nexport default baseEach;\n","import baseEach from './_baseEach.js';\n\n/**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\nfunction baseAggregator(collection, setter, iteratee, accumulator) {\n  baseEach(collection, function(value, key, collection) {\n    setter(accumulator, value, iteratee(value), collection);\n  });\n  return accumulator;\n}\n\nexport default baseAggregator;\n","import arrayAggregator from './_arrayAggregator.js';\nimport baseAggregator from './_baseAggregator.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\nfunction createAggregator(setter, initializer) {\n  return function(collection, iteratee) {\n    var func = isArray(collection) ? arrayAggregator : baseAggregator,\n        accumulator = initializer ? initializer() : {};\n\n    return func(collection, setter, baseIteratee(iteratee, 2), accumulator);\n  };\n}\n\nexport default createAggregator;\n","import baseRest from './_baseRest.js';\nimport eq from './eq.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport keysIn from './keysIn.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(object, sources) {\n  object = Object(object);\n\n  var index = -1;\n  var length = sources.length;\n  var guard = length > 2 ? sources[2] : undefined;\n\n  if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n    length = 1;\n  }\n\n  while (++index < length) {\n    var source = sources[index];\n    var props = keysIn(source);\n    var propsIndex = -1;\n    var propsLength = props.length;\n\n    while (++propsIndex < propsLength) {\n      var key = props[propsIndex];\n      var value = object[key];\n\n      if (value === undefined ||\n          (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        object[key] = source[key];\n      }\n    }\n  }\n\n  return object;\n});\n\nexport default defaults;\n","import isArrayLike from './isArrayLike.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nexport default isArrayLikeObject;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arrayIncludesWith;\n","import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport arrayMap from './_arrayMap.js';\nimport baseUnary from './_baseUnary.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nexport default baseDifference;\n","import baseDifference from './_baseDifference.js';\nimport baseFlatten from './_baseFlatten.js';\nimport baseRest from './_baseRest.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nexport default difference;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","import baseSlice from './_baseSlice.js';\nimport toInteger from './toInteger.js';\n\n/**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\nfunction drop(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  return baseSlice(array, n < 0 ? 0 : n, length);\n}\n\nexport default drop;\n","import baseSlice from './_baseSlice.js';\nimport toInteger from './toInteger.js';\n\n/**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\nfunction dropRight(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  n = length - n;\n  return baseSlice(array, 0, n < 0 ? 0 : n);\n}\n\nexport default dropRight;\n","import identity from './identity.js';\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nexport default castFunction;\n","import arrayEach from './_arrayEach.js';\nimport baseEach from './_baseEach.js';\nimport castFunction from './_castFunction.js';\nimport isArray from './isArray.js';\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nexport default forEach;\n","/**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n */\nfunction arrayEvery(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (!predicate(array[index], index, array)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport default arrayEvery;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`\n */\nfunction baseEvery(collection, predicate) {\n  var result = true;\n  baseEach(collection, function(value, index, collection) {\n    result = !!predicate(value, index, collection);\n    return result;\n  });\n  return result;\n}\n\nexport default baseEvery;\n","import arrayEvery from './_arrayEvery.js';\nimport baseEvery from './_baseEvery.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': false },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\nfunction every(collection, predicate, guard) {\n  var func = isArray(collection) ? arrayEvery : baseEvery;\n  if (guard && isIterateeCall(collection, predicate, guard)) {\n    predicate = undefined;\n  }\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default every;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nexport default baseFilter;\n","import arrayFilter from './_arrayFilter.js';\nimport baseFilter from './_baseFilter.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default filter;\n","import baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nexport default createFind;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nexport default find;\n","/**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\nfunction head(array) {\n  return (array && array.length) ? array[0] : undefined;\n}\n\nexport default head;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nexport default baseMap;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n","import baseFlatten from './_baseFlatten.js';\nimport map from './map.js';\n\n/**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n *   return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\nfunction flatMap(collection, iteratee) {\n  return baseFlatten(map(collection, iteratee), 1);\n}\n\nexport default flatMap;\n","import baseAssignValue from './_baseAssignValue.js';\nimport createAggregator from './_createAggregator.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\nvar groupBy = createAggregator(function(result, value, key) {\n  if (hasOwnProperty.call(result, key)) {\n    result[key].push(value);\n  } else {\n    baseAssignValue(result, key, [value]);\n  }\n});\n\nexport default groupBy;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHas(object, key) {\n  return object != null && hasOwnProperty.call(object, key);\n}\n\nexport default baseHas;\n","import baseHas from './_baseHas.js';\nimport hasPath from './_hasPath.js';\n\n/**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\nfunction has(object, path) {\n  return object != null && hasPath(object, path, baseHas);\n}\n\nexport default has;\n","import baseGetTag from './_baseGetTag.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nexport default isString;\n","import arrayMap from './_arrayMap.js';\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nexport default baseValues;\n","import baseValues from './_baseValues.js';\nimport keys from './keys.js';\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nexport default values;\n","import baseIndexOf from './_baseIndexOf.js';\nimport isArrayLike from './isArrayLike.js';\nimport isString from './isString.js';\nimport toInteger from './toInteger.js';\nimport values from './values.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\nfunction includes(collection, value, fromIndex, guard) {\n  collection = isArrayLike(collection) ? collection : values(collection);\n  fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n  var length = collection.length;\n  if (fromIndex < 0) {\n    fromIndex = nativeMax(length + fromIndex, 0);\n  }\n  return isString(collection)\n    ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n    : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n}\n\nexport default includes;\n","import baseIndexOf from './_baseIndexOf.js';\nimport toInteger from './toInteger.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\nfunction indexOf(array, value, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseIndexOf(array, value, index);\n}\n\nexport default indexOf;\n","import baseKeys from './_baseKeys.js';\nimport getTag from './_getTag.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isArrayLike from './isArrayLike.js';\nimport isBuffer from './isBuffer.js';\nimport isPrototype from './_isPrototype.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport default isEmpty;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar regexpTag = '[object RegExp]';\n\n/**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\nfunction baseIsRegExp(value) {\n  return isObjectLike(value) && baseGetTag(value) == regexpTag;\n}\n\nexport default baseIsRegExp;\n","import baseIsRegExp from './_baseIsRegExp.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsRegExp = nodeUtil && nodeUtil.isRegExp;\n\n/**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\nvar isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\nexport default isRegExp;\n","/**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\nfunction isUndefined(value) {\n  return value === undefined;\n}\n\nexport default isUndefined;\n","/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nexport default baseLt;\n","import isSymbol from './isSymbol.js';\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nexport default baseExtremum;\n","import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nexport default min;\n","/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n *   return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\nfunction negate(predicate) {\n  if (typeof predicate != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  return function() {\n    var args = arguments;\n    switch (args.length) {\n      case 0: return !predicate.call(this);\n      case 1: return !predicate.call(this, args[0]);\n      case 2: return !predicate.call(this, args[0], args[1]);\n      case 3: return !predicate.call(this, args[0], args[1], args[2]);\n    }\n    return !predicate.apply(this, args);\n  };\n}\n\nexport default negate;\n","import assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nexport default basePickBy;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport basePickBy from './_basePickBy.js';\nimport getAllKeysIn from './_getAllKeysIn.js';\n\n/**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\nfunction pickBy(object, predicate) {\n  if (object == null) {\n    return {};\n  }\n  var props = arrayMap(getAllKeysIn(object), function(prop) {\n    return [prop];\n  });\n  predicate = baseIteratee(predicate);\n  return basePickBy(object, props, function(value, path) {\n    return predicate(value, path[0]);\n  });\n}\n\nexport default pickBy;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nexport default baseReduce;\n","import arrayReduce from './_arrayReduce.js';\nimport baseEach from './_baseEach.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseReduce from './_baseReduce.js';\nimport isArray from './isArray.js';\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nexport default reduce;\n","import arrayFilter from './_arrayFilter.js';\nimport baseFilter from './_baseFilter.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\nimport negate from './negate.js';\n\n/**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': false },\n *   { 'user': 'fred',   'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\nfunction reject(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, negate(baseIteratee(predicate, 3)));\n}\n\nexport default reject;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction baseSome(collection, predicate) {\n  var result;\n\n  baseEach(collection, function(value, index, collection) {\n    result = predicate(value, index, collection);\n    return !result;\n  });\n  return !!result;\n}\n\nexport default baseSome;\n","import arraySome from './_arraySome.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseSome from './_baseSome.js';\nimport isArray from './isArray.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n *   { 'user': 'barney', 'active': true },\n *   { 'user': 'fred',   'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\nfunction some(collection, predicate, guard) {\n  var func = isArray(collection) ? arraySome : baseSome;\n  if (guard && isIterateeCall(collection, predicate, guard)) {\n    predicate = undefined;\n  }\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default some;\n","import Set from './_Set.js';\nimport noop from './noop.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nexport default createSet;\n","import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport cacheHas from './_cacheHas.js';\nimport createSet from './_createSet.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nexport default baseUniq;\n","import baseUniq from './_baseUniq.js';\n\n/**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\nfunction uniq(array) {\n  return (array && array.length) ? baseUniq(array) : [];\n}\n\nexport default uniq;\n","import baseIteratee from './_baseIteratee.js';\nimport baseUniq from './_baseUniq.js';\n\n/**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\nfunction uniqBy(array, iteratee) {\n  return (array && array.length) ? baseUniq(array, baseIteratee(iteratee, 2)) : [];\n}\n\nexport default uniqBy;\n","export function PRINT_ERROR(msg) {\n    /* istanbul ignore else - can't override global.console in node.js */\n    if (console && console.error) {\n        console.error(`Error: ${msg}`);\n    }\n}\nexport function PRINT_WARNING(msg) {\n    /* istanbul ignore else - can't override global.console in node.js*/\n    if (console && console.warn) {\n        // TODO: modify docs accordingly\n        console.warn(`Warning: ${msg}`);\n    }\n}\n//# sourceMappingURL=print.js.map","export function timer(func) {\n    const start = new Date().getTime();\n    const val = func();\n    const end = new Date().getTime();\n    const total = end - start;\n    return { time: total, value: val };\n}\n//# sourceMappingURL=timer.js.map","// based on: https://github.com/petkaantonov/bluebird/blob/b97c0d2d487e8c5076e8bd897e0dcd4622d31846/src/util.js#L201-L216\nexport function toFastProperties(toBecomeFast) {\n    function FakeConstructor() { }\n    // If our object is used as a constructor, it would receive\n    FakeConstructor.prototype = toBecomeFast;\n    const fakeInstance = new FakeConstructor();\n    function fakeAccess() {\n        return typeof fakeInstance.bar;\n    }\n    // help V8 understand this is a \"real\" prototype by actually using\n    // the fake instance.\n    fakeAccess();\n    fakeAccess();\n    // Always true condition to suppress the Firefox warning of unreachable\n    // code after a return statement.\n    if (1)\n        return toBecomeFast;\n    // Eval prevents optimization of this method (even though this is dead code)\n    // - https://esbuild.github.io/content-types/#direct-eval\n    /* istanbul ignore next */\n    // tslint:disable-next-line\n    (0, eval)(toBecomeFast);\n}\n//# sourceMappingURL=to-fast-properties.js.map","import { assign, forEach, isRegExp, isString, map, pickBy } from \"lodash-es\";\n// TODO: duplicated code to avoid extracting another sub-package -- how to avoid?\nfunction tokenLabel(tokType) {\n    if (hasTokenLabel(tokType)) {\n        return tokType.LABEL;\n    }\n    else {\n        return tokType.name;\n    }\n}\n// TODO: duplicated code to avoid extracting another sub-package -- how to avoid?\nfunction hasTokenLabel(obj) {\n    return isString(obj.LABEL) && obj.LABEL !== \"\";\n}\nexport class AbstractProduction {\n    get definition() {\n        return this._definition;\n    }\n    set definition(value) {\n        this._definition = value;\n    }\n    constructor(_definition) {\n        this._definition = _definition;\n    }\n    accept(visitor) {\n        visitor.visit(this);\n        forEach(this.definition, (prod) => {\n            prod.accept(visitor);\n        });\n    }\n}\nexport class NonTerminal extends AbstractProduction {\n    constructor(options) {\n        super([]);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n    set definition(definition) {\n        // immutable\n    }\n    get definition() {\n        if (this.referencedRule !== undefined) {\n            return this.referencedRule.definition;\n        }\n        return [];\n    }\n    accept(visitor) {\n        visitor.visit(this);\n        // don't visit children of a reference, we will get cyclic infinite loops if we do so\n    }\n}\nexport class Rule extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.orgText = \"\";\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Alternative extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.ignoreAmbiguities = false;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Option extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class RepetitionMandatory extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class RepetitionMandatoryWithSeparator extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Repetition extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class RepetitionWithSeparator extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Alternation extends AbstractProduction {\n    get definition() {\n        return this._definition;\n    }\n    set definition(value) {\n        this._definition = value;\n    }\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        this.ignoreAmbiguities = false;\n        this.hasPredicates = false;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Terminal {\n    constructor(options) {\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n    accept(visitor) {\n        visitor.visit(this);\n    }\n}\nexport function serializeGrammar(topRules) {\n    return map(topRules, serializeProduction);\n}\nexport function serializeProduction(node) {\n    function convertDefinition(definition) {\n        return map(definition, serializeProduction);\n    }\n    /* istanbul ignore else */\n    if (node instanceof NonTerminal) {\n        const serializedNonTerminal = {\n            type: \"NonTerminal\",\n            name: node.nonTerminalName,\n            idx: node.idx,\n        };\n        if (isString(node.label)) {\n            serializedNonTerminal.label = node.label;\n        }\n        return serializedNonTerminal;\n    }\n    else if (node instanceof Alternative) {\n        return {\n            type: \"Alternative\",\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Option) {\n        return {\n            type: \"Option\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof RepetitionMandatory) {\n        return {\n            type: \"RepetitionMandatory\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof RepetitionMandatoryWithSeparator) {\n        return {\n            type: \"RepetitionMandatoryWithSeparator\",\n            idx: node.idx,\n            separator: (serializeProduction(new Terminal({ terminalType: node.separator }))),\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof RepetitionWithSeparator) {\n        return {\n            type: \"RepetitionWithSeparator\",\n            idx: node.idx,\n            separator: (serializeProduction(new Terminal({ terminalType: node.separator }))),\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Repetition) {\n        return {\n            type: \"Repetition\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Alternation) {\n        return {\n            type: \"Alternation\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Terminal) {\n        const serializedTerminal = {\n            type: \"Terminal\",\n            name: node.terminalType.name,\n            label: tokenLabel(node.terminalType),\n            idx: node.idx,\n        };\n        if (isString(node.label)) {\n            serializedTerminal.terminalLabel = node.label;\n        }\n        const pattern = node.terminalType.PATTERN;\n        if (node.terminalType.PATTERN) {\n            serializedTerminal.pattern = isRegExp(pattern)\n                ? pattern.source\n                : pattern;\n        }\n        return serializedTerminal;\n    }\n    else if (node instanceof Rule) {\n        return {\n            type: \"Rule\",\n            name: node.name,\n            orgText: node.orgText,\n            definition: convertDefinition(node.definition),\n        };\n        /* c8 ignore next 3 */\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\n//# sourceMappingURL=model.js.map","import { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"./model.js\";\nexport class GAstVisitor {\n    visit(node) {\n        const nodeAny = node;\n        switch (nodeAny.constructor) {\n            case NonTerminal:\n                return this.visitNonTerminal(nodeAny);\n            case Alternative:\n                return this.visitAlternative(nodeAny);\n            case Option:\n                return this.visitOption(nodeAny);\n            case RepetitionMandatory:\n                return this.visitRepetitionMandatory(nodeAny);\n            case RepetitionMandatoryWithSeparator:\n                return this.visitRepetitionMandatoryWithSeparator(nodeAny);\n            case RepetitionWithSeparator:\n                return this.visitRepetitionWithSeparator(nodeAny);\n            case Repetition:\n                return this.visitRepetition(nodeAny);\n            case Alternation:\n                return this.visitAlternation(nodeAny);\n            case Terminal:\n                return this.visitTerminal(nodeAny);\n            case Rule:\n                return this.visitRule(nodeAny);\n            /* c8 ignore next 2 */\n            default:\n                throw Error(\"non exhaustive match\");\n        }\n    }\n    /* c8 ignore next */\n    visitNonTerminal(node) { }\n    /* c8 ignore next */\n    visitAlternative(node) { }\n    /* c8 ignore next */\n    visitOption(node) { }\n    /* c8 ignore next */\n    visitRepetition(node) { }\n    /* c8 ignore next */\n    visitRepetitionMandatory(node) { }\n    /* c8 ignore next 3 */\n    visitRepetitionMandatoryWithSeparator(node) { }\n    /* c8 ignore next */\n    visitRepetitionWithSeparator(node) { }\n    /* c8 ignore next */\n    visitAlternation(node) { }\n    /* c8 ignore next */\n    visitTerminal(node) { }\n    /* c8 ignore next */\n    visitRule(node) { }\n}\n//# sourceMappingURL=visitor.js.map","import { every, includes, some } from \"lodash-es\";\nimport { AbstractProduction, Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"./model.js\";\nexport function isSequenceProd(prod) {\n    return (prod instanceof Alternative ||\n        prod instanceof Option ||\n        prod instanceof Repetition ||\n        prod instanceof RepetitionMandatory ||\n        prod instanceof RepetitionMandatoryWithSeparator ||\n        prod instanceof RepetitionWithSeparator ||\n        prod instanceof Terminal ||\n        prod instanceof Rule);\n}\nexport function isOptionalProd(prod, alreadyVisited = []) {\n    const isDirectlyOptional = prod instanceof Option ||\n        prod instanceof Repetition ||\n        prod instanceof RepetitionWithSeparator;\n    if (isDirectlyOptional) {\n        return true;\n    }\n    // note that this can cause infinite loop if one optional empty TOP production has a cyclic dependency with another\n    // empty optional top rule\n    // may be indirectly optional ((A?B?C?) | (D?E?F?))\n    if (prod instanceof Alternation) {\n        // for OR its enough for just one of the alternatives to be optional\n        return some(prod.definition, (subProd) => {\n            return isOptionalProd(subProd, alreadyVisited);\n        });\n    }\n    else if (prod instanceof NonTerminal && includes(alreadyVisited, prod)) {\n        // avoiding stack overflow due to infinite recursion\n        return false;\n    }\n    else if (prod instanceof AbstractProduction) {\n        if (prod instanceof NonTerminal) {\n            alreadyVisited.push(prod);\n        }\n        return every(prod.definition, (subProd) => {\n            return isOptionalProd(subProd, alreadyVisited);\n        });\n    }\n    else {\n        return false;\n    }\n}\nexport function isBranchingProd(prod) {\n    return prod instanceof Alternation;\n}\nexport function getProductionDslName(prod) {\n    /* istanbul ignore else */\n    if (prod instanceof NonTerminal) {\n        return \"SUBRULE\";\n    }\n    else if (prod instanceof Option) {\n        return \"OPTION\";\n    }\n    else if (prod instanceof Alternation) {\n        return \"OR\";\n    }\n    else if (prod instanceof RepetitionMandatory) {\n        return \"AT_LEAST_ONE\";\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator) {\n        return \"AT_LEAST_ONE_SEP\";\n    }\n    else if (prod instanceof RepetitionWithSeparator) {\n        return \"MANY_SEP\";\n    }\n    else if (prod instanceof Repetition) {\n        return \"MANY\";\n    }\n    else if (prod instanceof Terminal) {\n        return \"CONSUME\";\n        /* c8 ignore next 3 */\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\n//# sourceMappingURL=helpers.js.map","import { drop, forEach } from \"lodash-es\";\nimport { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Terminal, } from \"@chevrotain/gast\";\n/**\n *  A Grammar Walker that computes the \"remaining\" grammar \"after\" a productions in the grammar.\n */\nexport class RestWalker {\n    walk(prod, prevRest = []) {\n        forEach(prod.definition, (subProd, index) => {\n            const currRest = drop(prod.definition, index + 1);\n            /* istanbul ignore else */\n            if (subProd instanceof NonTerminal) {\n                this.walkProdRef(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Terminal) {\n                this.walkTerminal(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Alternative) {\n                this.walkFlat(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Option) {\n                this.walkOption(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof RepetitionMandatory) {\n                this.walkAtLeastOne(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof RepetitionMandatoryWithSeparator) {\n                this.walkAtLeastOneSep(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof RepetitionWithSeparator) {\n                this.walkManySep(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Repetition) {\n                this.walkMany(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Alternation) {\n                this.walkOr(subProd, currRest, prevRest);\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        });\n    }\n    walkTerminal(terminal, currRest, prevRest) { }\n    walkProdRef(refProd, currRest, prevRest) { }\n    walkFlat(flatProd, currRest, prevRest) {\n        // ABCDEF => after the D the rest is EF\n        const fullOrRest = currRest.concat(prevRest);\n        this.walk(flatProd, fullOrRest);\n    }\n    walkOption(optionProd, currRest, prevRest) {\n        // ABC(DE)?F => after the (DE)? the rest is F\n        const fullOrRest = currRest.concat(prevRest);\n        this.walk(optionProd, fullOrRest);\n    }\n    walkAtLeastOne(atLeastOneProd, currRest, prevRest) {\n        // ABC(DE)+F => after the (DE)+ the rest is (DE)?F\n        const fullAtLeastOneRest = [\n            new Option({ definition: atLeastOneProd.definition }),\n        ].concat(currRest, prevRest);\n        this.walk(atLeastOneProd, fullAtLeastOneRest);\n    }\n    walkAtLeastOneSep(atLeastOneSepProd, currRest, prevRest) {\n        // ABC DE(,DE)* F => after the (,DE)+ the rest is (,DE)?F\n        const fullAtLeastOneSepRest = restForRepetitionWithSeparator(atLeastOneSepProd, currRest, prevRest);\n        this.walk(atLeastOneSepProd, fullAtLeastOneSepRest);\n    }\n    walkMany(manyProd, currRest, prevRest) {\n        // ABC(DE)*F => after the (DE)* the rest is (DE)?F\n        const fullManyRest = [\n            new Option({ definition: manyProd.definition }),\n        ].concat(currRest, prevRest);\n        this.walk(manyProd, fullManyRest);\n    }\n    walkManySep(manySepProd, currRest, prevRest) {\n        // ABC (DE(,DE)*)? F => after the (,DE)* the rest is (,DE)?F\n        const fullManySepRest = restForRepetitionWithSeparator(manySepProd, currRest, prevRest);\n        this.walk(manySepProd, fullManySepRest);\n    }\n    walkOr(orProd, currRest, prevRest) {\n        // ABC(D|E|F)G => when finding the (D|E|F) the rest is G\n        const fullOrRest = currRest.concat(prevRest);\n        // walk all different alternatives\n        forEach(orProd.definition, (alt) => {\n            // wrapping each alternative in a single definition wrapper\n            // to avoid errors in computing the rest of that alternative in the invocation to computeInProdFollows\n            // (otherwise for OR([alt1,alt2]) alt2 will be considered in 'rest' of alt1\n            const prodWrapper = new Alternative({ definition: [alt] });\n            this.walk(prodWrapper, fullOrRest);\n        });\n    }\n}\nfunction restForRepetitionWithSeparator(repSepProd, currRest, prevRest) {\n    const repSepRest = [\n        new Option({\n            definition: [\n                new Terminal({ terminalType: repSepProd.separator }),\n            ].concat(repSepProd.definition),\n        }),\n    ];\n    const fullRepSepRest = repSepRest.concat(currRest, prevRest);\n    return fullRepSepRest;\n}\n//# sourceMappingURL=rest.js.map","import { flatten, map, uniq } from \"lodash-es\";\nimport { isBranchingProd, isOptionalProd, isSequenceProd, NonTerminal, Terminal, } from \"@chevrotain/gast\";\nexport function first(prod) {\n    /* istanbul ignore else */\n    if (prod instanceof NonTerminal) {\n        // this could in theory cause infinite loops if\n        // (1) prod A refs prod B.\n        // (2) prod B refs prod A\n        // (3) AB can match the empty set\n        // in other words a cycle where everything is optional so the first will keep\n        // looking ahead for the next optional part and will never exit\n        // currently there is no safeguard for this unique edge case because\n        // (1) not sure a grammar in which this can happen is useful for anything (productive)\n        return first(prod.referencedRule);\n    }\n    else if (prod instanceof Terminal) {\n        return firstForTerminal(prod);\n    }\n    else if (isSequenceProd(prod)) {\n        return firstForSequence(prod);\n    }\n    else if (isBranchingProd(prod)) {\n        return firstForBranching(prod);\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nexport function firstForSequence(prod) {\n    let firstSet = [];\n    const seq = prod.definition;\n    let nextSubProdIdx = 0;\n    let hasInnerProdsRemaining = seq.length > nextSubProdIdx;\n    let currSubProd;\n    // so we enter the loop at least once (if the definition is not empty\n    let isLastInnerProdOptional = true;\n    // scan a sequence until it's end or until we have found a NONE optional production in it\n    while (hasInnerProdsRemaining && isLastInnerProdOptional) {\n        currSubProd = seq[nextSubProdIdx];\n        isLastInnerProdOptional = isOptionalProd(currSubProd);\n        firstSet = firstSet.concat(first(currSubProd));\n        nextSubProdIdx = nextSubProdIdx + 1;\n        hasInnerProdsRemaining = seq.length > nextSubProdIdx;\n    }\n    return uniq(firstSet);\n}\nexport function firstForBranching(prod) {\n    const allAlternativesFirsts = map(prod.definition, (innerProd) => {\n        return first(innerProd);\n    });\n    return uniq(flatten(allAlternativesFirsts));\n}\nexport function firstForTerminal(terminal) {\n    return [terminal.terminalType];\n}\n//# sourceMappingURL=first.js.map","// TODO: can this be removed? where is it used?\nexport const IN = \"_~IN~_\";\n//# sourceMappingURL=constants.js.map","import { RestWalker } from \"./rest.js\";\nimport { first } from \"./first.js\";\nimport { assign, forEach } from \"lodash-es\";\nimport { IN } from \"../constants.js\";\nimport { Alternative } from \"@chevrotain/gast\";\n// This ResyncFollowsWalker computes all of the follows required for RESYNC\n// (skipping reference production).\nexport class ResyncFollowsWalker extends RestWalker {\n    constructor(topProd) {\n        super();\n        this.topProd = topProd;\n        this.follows = {};\n    }\n    startWalking() {\n        this.walk(this.topProd);\n        return this.follows;\n    }\n    walkTerminal(terminal, currRest, prevRest) {\n        // do nothing! just like in the public sector after 13:00\n    }\n    walkProdRef(refProd, currRest, prevRest) {\n        const followName = buildBetweenProdsFollowPrefix(refProd.referencedRule, refProd.idx) +\n            this.topProd.name;\n        const fullRest = currRest.concat(prevRest);\n        const restProd = new Alternative({ definition: fullRest });\n        const t_in_topProd_follows = first(restProd);\n        this.follows[followName] = t_in_topProd_follows;\n    }\n}\nexport function computeAllProdsFollows(topProductions) {\n    const reSyncFollows = {};\n    forEach(topProductions, (topProd) => {\n        const currRefsFollow = new ResyncFollowsWalker(topProd).startWalking();\n        assign(reSyncFollows, currRefsFollow);\n    });\n    return reSyncFollows;\n}\nexport function buildBetweenProdsFollowPrefix(inner, occurenceInParent) {\n    return inner.name + occurenceInParent + IN;\n}\nexport function buildInProdFollowPrefix(terminal) {\n    const terminalName = terminal.terminalType.name;\n    return terminalName + terminal.idx + IN;\n}\n//# sourceMappingURL=follow.js.map","export function cc(char) {\n    return char.charCodeAt(0);\n}\nexport function insertToSet(item, set) {\n    if (Array.isArray(item)) {\n        item.forEach(function (subItem) {\n            set.push(subItem);\n        });\n    }\n    else {\n        set.push(item);\n    }\n}\nexport function addFlag(flagObj, flagKey) {\n    if (flagObj[flagKey] === true) {\n        throw \"duplicate flag \" + flagKey;\n    }\n    const x = flagObj[flagKey];\n    flagObj[flagKey] = true;\n}\nexport function ASSERT_EXISTS(obj) {\n    // istanbul ignore next\n    if (obj === undefined) {\n        throw Error(\"Internal Error - Should never get here!\");\n    }\n    return true;\n}\n// istanbul ignore next\nexport function ASSERT_NEVER_REACH_HERE() {\n    throw Error(\"Internal Error - Should never get here!\");\n}\nexport function isCharacter(obj) {\n    return obj[\"type\"] === \"Character\";\n}\n//# sourceMappingURL=utils.js.map","import { cc } from \"./utils.js\";\nexport const digitsCharCodes = [];\nfor (let i = cc(\"0\"); i <= cc(\"9\"); i++) {\n    digitsCharCodes.push(i);\n}\nexport const wordCharCodes = [cc(\"_\")].concat(digitsCharCodes);\nfor (let i = cc(\"a\"); i <= cc(\"z\"); i++) {\n    wordCharCodes.push(i);\n}\nfor (let i = cc(\"A\"); i <= cc(\"Z\"); i++) {\n    wordCharCodes.push(i);\n}\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp#character-classes\nexport const whitespaceCodes = [\n    cc(\" \"),\n    cc(\"\\f\"),\n    cc(\"\\n\"),\n    cc(\"\\r\"),\n    cc(\"\\t\"),\n    cc(\"\\v\"),\n    cc(\"\\t\"),\n    cc(\"\\u00a0\"),\n    cc(\"\\u1680\"),\n    cc(\"\\u2000\"),\n    cc(\"\\u2001\"),\n    cc(\"\\u2002\"),\n    cc(\"\\u2003\"),\n    cc(\"\\u2004\"),\n    cc(\"\\u2005\"),\n    cc(\"\\u2006\"),\n    cc(\"\\u2007\"),\n    cc(\"\\u2008\"),\n    cc(\"\\u2009\"),\n    cc(\"\\u200a\"),\n    cc(\"\\u2028\"),\n    cc(\"\\u2029\"),\n    cc(\"\\u202f\"),\n    cc(\"\\u205f\"),\n    cc(\"\\u3000\"),\n    cc(\"\\ufeff\"),\n];\n//# sourceMappingURL=character-classes.js.map","import { addFlag, ASSERT_EXISTS, ASSERT_NEVER_REACH_HERE, cc, insertToSet, isCharacter, } from \"./utils.js\";\nimport { digitsCharCodes, whitespaceCodes, wordCharCodes, } from \"./character-classes.js\";\n// consts and utilities\nconst hexDigitPattern = /[0-9a-fA-F]/;\nconst decimalPattern = /[0-9]/;\nconst decimalPatternNoZero = /[1-9]/;\n// https://hackernoon.com/the-madness-of-parsing-real-world-javascript-regexps-d9ee336df983\n// https://www.ecma-international.org/ecma-262/8.0/index.html#prod-Pattern\nexport class RegExpParser {\n    constructor() {\n        this.idx = 0;\n        this.input = \"\";\n        this.groupIdx = 0;\n    }\n    saveState() {\n        return {\n            idx: this.idx,\n            input: this.input,\n            groupIdx: this.groupIdx,\n        };\n    }\n    restoreState(newState) {\n        this.idx = newState.idx;\n        this.input = newState.input;\n        this.groupIdx = newState.groupIdx;\n    }\n    pattern(input) {\n        // parser state\n        this.idx = 0;\n        this.input = input;\n        this.groupIdx = 0;\n        this.consumeChar(\"/\");\n        const value = this.disjunction();\n        this.consumeChar(\"/\");\n        const flags = {\n            type: \"Flags\",\n            loc: { begin: this.idx, end: input.length },\n            global: false,\n            ignoreCase: false,\n            multiLine: false,\n            unicode: false,\n            sticky: false,\n        };\n        while (this.isRegExpFlag()) {\n            switch (this.popChar()) {\n                case \"g\":\n                    addFlag(flags, \"global\");\n                    break;\n                case \"i\":\n                    addFlag(flags, \"ignoreCase\");\n                    break;\n                case \"m\":\n                    addFlag(flags, \"multiLine\");\n                    break;\n                case \"u\":\n                    addFlag(flags, \"unicode\");\n                    break;\n                case \"y\":\n                    addFlag(flags, \"sticky\");\n                    break;\n            }\n        }\n        if (this.idx !== this.input.length) {\n            throw Error(\"Redundant input: \" + this.input.substring(this.idx));\n        }\n        return {\n            type: \"Pattern\",\n            flags: flags,\n            value: value,\n            loc: this.loc(0),\n        };\n    }\n    disjunction() {\n        const alts = [];\n        const begin = this.idx;\n        alts.push(this.alternative());\n        while (this.peekChar() === \"|\") {\n            this.consumeChar(\"|\");\n            alts.push(this.alternative());\n        }\n        return { type: \"Disjunction\", value: alts, loc: this.loc(begin) };\n    }\n    alternative() {\n        const terms = [];\n        const begin = this.idx;\n        while (this.isTerm()) {\n            terms.push(this.term());\n        }\n        return { type: \"Alternative\", value: terms, loc: this.loc(begin) };\n    }\n    term() {\n        if (this.isAssertion()) {\n            return this.assertion();\n        }\n        else {\n            return this.atom();\n        }\n    }\n    assertion() {\n        const begin = this.idx;\n        switch (this.popChar()) {\n            case \"^\":\n                return {\n                    type: \"StartAnchor\",\n                    loc: this.loc(begin),\n                };\n            case \"$\":\n                return { type: \"EndAnchor\", loc: this.loc(begin) };\n            // '\\b' or '\\B'\n            case \"\\\\\":\n                switch (this.popChar()) {\n                    case \"b\":\n                        return {\n                            type: \"WordBoundary\",\n                            loc: this.loc(begin),\n                        };\n                    case \"B\":\n                        return {\n                            type: \"NonWordBoundary\",\n                            loc: this.loc(begin),\n                        };\n                }\n                // istanbul ignore next\n                throw Error(\"Invalid Assertion Escape\");\n            // '(?=' or '(?!'\n            case \"(\":\n                this.consumeChar(\"?\");\n                let type;\n                switch (this.popChar()) {\n                    case \"=\":\n                        type = \"Lookahead\";\n                        break;\n                    case \"!\":\n                        type = \"NegativeLookahead\";\n                        break;\n                }\n                ASSERT_EXISTS(type);\n                const disjunction = this.disjunction();\n                this.consumeChar(\")\");\n                return {\n                    type: type,\n                    value: disjunction,\n                    loc: this.loc(begin),\n                };\n        }\n        // istanbul ignore next\n        return ASSERT_NEVER_REACH_HERE();\n    }\n    quantifier(isBacktracking = false) {\n        let range = undefined;\n        const begin = this.idx;\n        switch (this.popChar()) {\n            case \"*\":\n                range = {\n                    atLeast: 0,\n                    atMost: Infinity,\n                };\n                break;\n            case \"+\":\n                range = {\n                    atLeast: 1,\n                    atMost: Infinity,\n                };\n                break;\n            case \"?\":\n                range = {\n                    atLeast: 0,\n                    atMost: 1,\n                };\n                break;\n            case \"{\":\n                const atLeast = this.integerIncludingZero();\n                switch (this.popChar()) {\n                    case \"}\":\n                        range = {\n                            atLeast: atLeast,\n                            atMost: atLeast,\n                        };\n                        break;\n                    case \",\":\n                        let atMost;\n                        if (this.isDigit()) {\n                            atMost = this.integerIncludingZero();\n                            range = {\n                                atLeast: atLeast,\n                                atMost: atMost,\n                            };\n                        }\n                        else {\n                            range = {\n                                atLeast: atLeast,\n                                atMost: Infinity,\n                            };\n                        }\n                        this.consumeChar(\"}\");\n                        break;\n                }\n                // throwing exceptions from \"ASSERT_EXISTS\" during backtracking\n                // causes severe performance degradations\n                if (isBacktracking === true && range === undefined) {\n                    return undefined;\n                }\n                ASSERT_EXISTS(range);\n                break;\n        }\n        // throwing exceptions from \"ASSERT_EXISTS\" during backtracking\n        // causes severe performance degradations\n        if (isBacktracking === true && range === undefined) {\n            return undefined;\n        }\n        // istanbul ignore else\n        if (ASSERT_EXISTS(range)) {\n            if (this.peekChar(0) === \"?\") {\n                this.consumeChar(\"?\");\n                range.greedy = false;\n            }\n            else {\n                range.greedy = true;\n            }\n            range.type = \"Quantifier\";\n            range.loc = this.loc(begin);\n            return range;\n        }\n    }\n    atom() {\n        let atom;\n        const begin = this.idx;\n        switch (this.peekChar()) {\n            case \".\":\n                atom = this.dotAll();\n                break;\n            case \"\\\\\":\n                atom = this.atomEscape();\n                break;\n            case \"[\":\n                atom = this.characterClass();\n                break;\n            case \"(\":\n                atom = this.group();\n                break;\n        }\n        if (atom === undefined && this.isPatternCharacter()) {\n            atom = this.patternCharacter();\n        }\n        // istanbul ignore else\n        if (ASSERT_EXISTS(atom)) {\n            atom.loc = this.loc(begin);\n            if (this.isQuantifier()) {\n                atom.quantifier = this.quantifier();\n            }\n            return atom;\n        }\n        // istanbul ignore next\n        return ASSERT_NEVER_REACH_HERE();\n    }\n    dotAll() {\n        this.consumeChar(\".\");\n        return {\n            type: \"Set\",\n            complement: true,\n            value: [cc(\"\\n\"), cc(\"\\r\"), cc(\"\\u2028\"), cc(\"\\u2029\")],\n        };\n    }\n    atomEscape() {\n        this.consumeChar(\"\\\\\");\n        switch (this.peekChar()) {\n            case \"1\":\n            case \"2\":\n            case \"3\":\n            case \"4\":\n            case \"5\":\n            case \"6\":\n            case \"7\":\n            case \"8\":\n            case \"9\":\n                return this.decimalEscapeAtom();\n            case \"d\":\n            case \"D\":\n            case \"s\":\n            case \"S\":\n            case \"w\":\n            case \"W\":\n                return this.characterClassEscape();\n            case \"f\":\n            case \"n\":\n            case \"r\":\n            case \"t\":\n            case \"v\":\n                return this.controlEscapeAtom();\n            case \"c\":\n                return this.controlLetterEscapeAtom();\n            case \"0\":\n                return this.nulCharacterAtom();\n            case \"x\":\n                return this.hexEscapeSequenceAtom();\n            case \"u\":\n                return this.regExpUnicodeEscapeSequenceAtom();\n            default:\n                return this.identityEscapeAtom();\n        }\n    }\n    decimalEscapeAtom() {\n        const value = this.positiveInteger();\n        return { type: \"GroupBackReference\", value: value };\n    }\n    characterClassEscape() {\n        let set;\n        let complement = false;\n        switch (this.popChar()) {\n            case \"d\":\n                set = digitsCharCodes;\n                break;\n            case \"D\":\n                set = digitsCharCodes;\n                complement = true;\n                break;\n            case \"s\":\n                set = whitespaceCodes;\n                break;\n            case \"S\":\n                set = whitespaceCodes;\n                complement = true;\n                break;\n            case \"w\":\n                set = wordCharCodes;\n                break;\n            case \"W\":\n                set = wordCharCodes;\n                complement = true;\n                break;\n        }\n        // istanbul ignore else\n        if (ASSERT_EXISTS(set)) {\n            return { type: \"Set\", value: set, complement: complement };\n        }\n        // istanbul ignore next\n        return ASSERT_NEVER_REACH_HERE();\n    }\n    controlEscapeAtom() {\n        let escapeCode;\n        switch (this.popChar()) {\n            case \"f\":\n                escapeCode = cc(\"\\f\");\n                break;\n            case \"n\":\n                escapeCode = cc(\"\\n\");\n                break;\n            case \"r\":\n                escapeCode = cc(\"\\r\");\n                break;\n            case \"t\":\n                escapeCode = cc(\"\\t\");\n                break;\n            case \"v\":\n                escapeCode = cc(\"\\v\");\n                break;\n        }\n        // istanbul ignore else\n        if (ASSERT_EXISTS(escapeCode)) {\n            return { type: \"Character\", value: escapeCode };\n        }\n        // istanbul ignore next\n        return ASSERT_NEVER_REACH_HERE();\n    }\n    controlLetterEscapeAtom() {\n        this.consumeChar(\"c\");\n        const letter = this.popChar();\n        if (/[a-zA-Z]/.test(letter) === false) {\n            throw Error(\"Invalid \");\n        }\n        const letterCode = letter.toUpperCase().charCodeAt(0) - 64;\n        return { type: \"Character\", value: letterCode };\n    }\n    nulCharacterAtom() {\n        // TODO implement '[lookahead ∉ DecimalDigit]'\n        // TODO: for the deprecated octal escape sequence\n        this.consumeChar(\"0\");\n        return { type: \"Character\", value: cc(\"\\0\") };\n    }\n    hexEscapeSequenceAtom() {\n        this.consumeChar(\"x\");\n        return this.parseHexDigits(2);\n    }\n    regExpUnicodeEscapeSequenceAtom() {\n        this.consumeChar(\"u\");\n        return this.parseHexDigits(4);\n    }\n    identityEscapeAtom() {\n        // TODO: implement \"SourceCharacter but not UnicodeIDContinue\"\n        // // http://unicode.org/reports/tr31/#Specific_Character_Adjustments\n        const escapedChar = this.popChar();\n        return { type: \"Character\", value: cc(escapedChar) };\n    }\n    classPatternCharacterAtom() {\n        switch (this.peekChar()) {\n            // istanbul ignore next\n            case \"\\n\":\n            // istanbul ignore next\n            case \"\\r\":\n            // istanbul ignore next\n            case \"\\u2028\":\n            // istanbul ignore next\n            case \"\\u2029\":\n            // istanbul ignore next\n            case \"\\\\\":\n            // istanbul ignore next\n            case \"]\":\n                throw Error(\"TBD\");\n            default:\n                const nextChar = this.popChar();\n                return { type: \"Character\", value: cc(nextChar) };\n        }\n    }\n    characterClass() {\n        const set = [];\n        let complement = false;\n        this.consumeChar(\"[\");\n        if (this.peekChar(0) === \"^\") {\n            this.consumeChar(\"^\");\n            complement = true;\n        }\n        while (this.isClassAtom()) {\n            const from = this.classAtom();\n            const isFromSingleChar = from.type === \"Character\";\n            if (isCharacter(from) && this.isRangeDash()) {\n                this.consumeChar(\"-\");\n                const to = this.classAtom();\n                const isToSingleChar = to.type === \"Character\";\n                // a range can only be used when both sides are single characters\n                if (isCharacter(to)) {\n                    if (to.value < from.value) {\n                        throw Error(\"Range out of order in character class\");\n                    }\n                    set.push({ from: from.value, to: to.value });\n                }\n                else {\n                    // literal dash\n                    insertToSet(from.value, set);\n                    set.push(cc(\"-\"));\n                    insertToSet(to.value, set);\n                }\n            }\n            else {\n                insertToSet(from.value, set);\n            }\n        }\n        this.consumeChar(\"]\");\n        return { type: \"Set\", complement: complement, value: set };\n    }\n    classAtom() {\n        switch (this.peekChar()) {\n            // istanbul ignore next\n            case \"]\":\n            // istanbul ignore next\n            case \"\\n\":\n            // istanbul ignore next\n            case \"\\r\":\n            // istanbul ignore next\n            case \"\\u2028\":\n            // istanbul ignore next\n            case \"\\u2029\":\n                throw Error(\"TBD\");\n            case \"\\\\\":\n                return this.classEscape();\n            default:\n                return this.classPatternCharacterAtom();\n        }\n    }\n    classEscape() {\n        this.consumeChar(\"\\\\\");\n        switch (this.peekChar()) {\n            // Matches a backspace.\n            // (Not to be confused with \\b word boundary outside characterClass)\n            case \"b\":\n                this.consumeChar(\"b\");\n                return { type: \"Character\", value: cc(\"\\u0008\") };\n            case \"d\":\n            case \"D\":\n            case \"s\":\n            case \"S\":\n            case \"w\":\n            case \"W\":\n                return this.characterClassEscape();\n            case \"f\":\n            case \"n\":\n            case \"r\":\n            case \"t\":\n            case \"v\":\n                return this.controlEscapeAtom();\n            case \"c\":\n                return this.controlLetterEscapeAtom();\n            case \"0\":\n                return this.nulCharacterAtom();\n            case \"x\":\n                return this.hexEscapeSequenceAtom();\n            case \"u\":\n                return this.regExpUnicodeEscapeSequenceAtom();\n            default:\n                return this.identityEscapeAtom();\n        }\n    }\n    group() {\n        let capturing = true;\n        this.consumeChar(\"(\");\n        switch (this.peekChar(0)) {\n            case \"?\":\n                this.consumeChar(\"?\");\n                this.consumeChar(\":\");\n                capturing = false;\n                break;\n            default:\n                this.groupIdx++;\n                break;\n        }\n        const value = this.disjunction();\n        this.consumeChar(\")\");\n        const groupAst = {\n            type: \"Group\",\n            capturing: capturing,\n            value: value,\n        };\n        if (capturing) {\n            groupAst[\"idx\"] = this.groupIdx;\n        }\n        return groupAst;\n    }\n    positiveInteger() {\n        let number = this.popChar();\n        // istanbul ignore next - can't ever get here due to previous lookahead checks\n        // still implementing this error checking in case this ever changes.\n        if (decimalPatternNoZero.test(number) === false) {\n            throw Error(\"Expecting a positive integer\");\n        }\n        while (decimalPattern.test(this.peekChar(0))) {\n            number += this.popChar();\n        }\n        return parseInt(number, 10);\n    }\n    integerIncludingZero() {\n        let number = this.popChar();\n        if (decimalPattern.test(number) === false) {\n            throw Error(\"Expecting an integer\");\n        }\n        while (decimalPattern.test(this.peekChar(0))) {\n            number += this.popChar();\n        }\n        return parseInt(number, 10);\n    }\n    patternCharacter() {\n        const nextChar = this.popChar();\n        switch (nextChar) {\n            // istanbul ignore next\n            case \"\\n\":\n            // istanbul ignore next\n            case \"\\r\":\n            // istanbul ignore next\n            case \"\\u2028\":\n            // istanbul ignore next\n            case \"\\u2029\":\n            // istanbul ignore next\n            case \"^\":\n            // istanbul ignore next\n            case \"$\":\n            // istanbul ignore next\n            case \"\\\\\":\n            // istanbul ignore next\n            case \".\":\n            // istanbul ignore next\n            case \"*\":\n            // istanbul ignore next\n            case \"+\":\n            // istanbul ignore next\n            case \"?\":\n            // istanbul ignore next\n            case \"(\":\n            // istanbul ignore next\n            case \")\":\n            // istanbul ignore next\n            case \"[\":\n            // istanbul ignore next\n            case \"|\":\n                // istanbul ignore next\n                throw Error(\"TBD\");\n            default:\n                return { type: \"Character\", value: cc(nextChar) };\n        }\n    }\n    isRegExpFlag() {\n        switch (this.peekChar(0)) {\n            case \"g\":\n            case \"i\":\n            case \"m\":\n            case \"u\":\n            case \"y\":\n                return true;\n            default:\n                return false;\n        }\n    }\n    isRangeDash() {\n        return this.peekChar() === \"-\" && this.isClassAtom(1);\n    }\n    isDigit() {\n        return decimalPattern.test(this.peekChar(0));\n    }\n    isClassAtom(howMuch = 0) {\n        switch (this.peekChar(howMuch)) {\n            case \"]\":\n            case \"\\n\":\n            case \"\\r\":\n            case \"\\u2028\":\n            case \"\\u2029\":\n                return false;\n            default:\n                return true;\n        }\n    }\n    isTerm() {\n        return this.isAtom() || this.isAssertion();\n    }\n    isAtom() {\n        if (this.isPatternCharacter()) {\n            return true;\n        }\n        switch (this.peekChar(0)) {\n            case \".\":\n            case \"\\\\\": // atomEscape\n            case \"[\": // characterClass\n            // TODO: isAtom must be called before isAssertion - disambiguate\n            case \"(\": // group\n                return true;\n            default:\n                return false;\n        }\n    }\n    isAssertion() {\n        switch (this.peekChar(0)) {\n            case \"^\":\n            case \"$\":\n                return true;\n            // '\\b' or '\\B'\n            case \"\\\\\":\n                switch (this.peekChar(1)) {\n                    case \"b\":\n                    case \"B\":\n                        return true;\n                    default:\n                        return false;\n                }\n            // '(?=' or '(?!'\n            case \"(\":\n                return (this.peekChar(1) === \"?\" &&\n                    (this.peekChar(2) === \"=\" || this.peekChar(2) === \"!\"));\n            default:\n                return false;\n        }\n    }\n    isQuantifier() {\n        const prevState = this.saveState();\n        try {\n            return this.quantifier(true) !== undefined;\n        }\n        catch (e) {\n            return false;\n        }\n        finally {\n            this.restoreState(prevState);\n        }\n    }\n    isPatternCharacter() {\n        switch (this.peekChar()) {\n            case \"^\":\n            case \"$\":\n            case \"\\\\\":\n            case \".\":\n            case \"*\":\n            case \"+\":\n            case \"?\":\n            case \"(\":\n            case \")\":\n            case \"[\":\n            case \"|\":\n            case \"/\":\n            case \"\\n\":\n            case \"\\r\":\n            case \"\\u2028\":\n            case \"\\u2029\":\n                return false;\n            default:\n                return true;\n        }\n    }\n    parseHexDigits(howMany) {\n        let hexString = \"\";\n        for (let i = 0; i < howMany; i++) {\n            const hexChar = this.popChar();\n            if (hexDigitPattern.test(hexChar) === false) {\n                throw Error(\"Expecting a HexDecimal digits\");\n            }\n            hexString += hexChar;\n        }\n        const charCode = parseInt(hexString, 16);\n        return { type: \"Character\", value: charCode };\n    }\n    peekChar(howMuch = 0) {\n        return this.input[this.idx + howMuch];\n    }\n    popChar() {\n        const nextChar = this.peekChar(0);\n        this.consumeChar(undefined);\n        return nextChar;\n    }\n    consumeChar(char) {\n        if (char !== undefined && this.input[this.idx] !== char) {\n            throw Error(\"Expected: '\" +\n                char +\n                \"' but found: '\" +\n                this.input[this.idx] +\n                \"' at offset: \" +\n                this.idx);\n        }\n        if (this.idx >= this.input.length) {\n            throw Error(\"Unexpected end of input\");\n        }\n        this.idx++;\n    }\n    loc(begin) {\n        return { begin: begin, end: this.idx };\n    }\n}\n//# sourceMappingURL=regexp-parser.js.map","export class BaseRegExpVisitor {\n    visitChildren(node) {\n        for (const key in node) {\n            const child = node[key];\n            /* istanbul ignore else */\n            if (node.hasOwnProperty(key)) {\n                if (child.type !== undefined) {\n                    this.visit(child);\n                }\n                else if (Array.isArray(child)) {\n                    child.forEach((subChild) => {\n                        this.visit(subChild);\n                    }, this);\n                }\n            }\n        }\n    }\n    visit(node) {\n        switch (node.type) {\n            case \"Pattern\":\n                this.visitPattern(node);\n                break;\n            case \"Flags\":\n                this.visitFlags(node);\n                break;\n            case \"Disjunction\":\n                this.visitDisjunction(node);\n                break;\n            case \"Alternative\":\n                this.visitAlternative(node);\n                break;\n            case \"StartAnchor\":\n                this.visitStartAnchor(node);\n                break;\n            case \"EndAnchor\":\n                this.visitEndAnchor(node);\n                break;\n            case \"WordBoundary\":\n                this.visitWordBoundary(node);\n                break;\n            case \"NonWordBoundary\":\n                this.visitNonWordBoundary(node);\n                break;\n            case \"Lookahead\":\n                this.visitLookahead(node);\n                break;\n            case \"NegativeLookahead\":\n                this.visitNegativeLookahead(node);\n                break;\n            case \"Character\":\n                this.visitCharacter(node);\n                break;\n            case \"Set\":\n                this.visitSet(node);\n                break;\n            case \"Group\":\n                this.visitGroup(node);\n                break;\n            case \"GroupBackReference\":\n                this.visitGroupBackReference(node);\n                break;\n            case \"Quantifier\":\n                this.visitQuantifier(node);\n                break;\n        }\n        this.visitChildren(node);\n    }\n    visitPattern(node) { }\n    visitFlags(node) { }\n    visitDisjunction(node) { }\n    visitAlternative(node) { }\n    // Assertion\n    visitStartAnchor(node) { }\n    visitEndAnchor(node) { }\n    visitWordBoundary(node) { }\n    visitNonWordBoundary(node) { }\n    visitLookahead(node) { }\n    visitNegativeLookahead(node) { }\n    // atoms\n    visitCharacter(node) { }\n    visitSet(node) { }\n    visitGroup(node) { }\n    visitGroupBackReference(node) { }\n    visitQuantifier(node) { }\n}\n//# sourceMappingURL=base-regexp-visitor.js.map","import { RegExpParser, } from \"@chevrotain/regexp-to-ast\";\nlet regExpAstCache = {};\nconst regExpParser = new RegExpParser();\nexport function getRegExpAst(regExp) {\n    const regExpStr = regExp.toString();\n    if (regExpAstCache.hasOwnProperty(regExpStr)) {\n        return regExpAstCache[regExpStr];\n    }\n    else {\n        const regExpAst = regExpParser.pattern(regExpStr);\n        regExpAstCache[regExpStr] = regExpAst;\n        return regExpAst;\n    }\n}\nexport function clearRegExpParserCache() {\n    regExpAstCache = {};\n}\n//# sourceMappingURL=reg_exp_parser.js.map","import { BaseRegExpVisitor, } from \"@chevrotain/regexp-to-ast\";\nimport { every, find, forEach, includes, isArray, values } from \"lodash-es\";\nimport { PRINT_ERROR, PRINT_WARNING } from \"@chevrotain/utils\";\nimport { getRegExpAst } from \"./reg_exp_parser.js\";\nimport { charCodeToOptimizedIndex, minOptimizationVal } from \"./lexer.js\";\nconst complementErrorMessage = \"Complement Sets are not supported for first char optimization\";\nexport const failedOptimizationPrefixMsg = 'Unable to use \"first char\" lexer optimizations:\\n';\nexport function getOptimizedStartCodesIndices(regExp, ensureOptimizations = false) {\n    try {\n        const ast = getRegExpAst(regExp);\n        const firstChars = firstCharOptimizedIndices(ast.value, {}, ast.flags.ignoreCase);\n        return firstChars;\n    }\n    catch (e) {\n        /* istanbul ignore next */\n        // Testing this relies on the regexp-to-ast library having a bug... */\n        // TODO: only the else branch needs to be ignored, try to fix with newer prettier / tsc\n        if (e.message === complementErrorMessage) {\n            if (ensureOptimizations) {\n                PRINT_WARNING(`${failedOptimizationPrefixMsg}` +\n                    `\\tUnable to optimize: < ${regExp.toString()} >\\n` +\n                    \"\\tComplement Sets cannot be automatically optimized.\\n\" +\n                    \"\\tThis will disable the lexer's first char optimizations.\\n\" +\n                    \"\\tSee: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.\");\n            }\n        }\n        else {\n            let msgSuffix = \"\";\n            if (ensureOptimizations) {\n                msgSuffix =\n                    \"\\n\\tThis will disable the lexer's first char optimizations.\\n\" +\n                        \"\\tSee: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.\";\n            }\n            PRINT_ERROR(`${failedOptimizationPrefixMsg}\\n` +\n                `\\tFailed parsing: < ${regExp.toString()} >\\n` +\n                `\\tUsing the @chevrotain/regexp-to-ast library\\n` +\n                \"\\tPlease open an issue at: https://github.com/chevrotain/chevrotain/issues\" +\n                msgSuffix);\n        }\n    }\n    return [];\n}\nexport function firstCharOptimizedIndices(ast, result, ignoreCase) {\n    switch (ast.type) {\n        case \"Disjunction\":\n            for (let i = 0; i < ast.value.length; i++) {\n                firstCharOptimizedIndices(ast.value[i], result, ignoreCase);\n            }\n            break;\n        case \"Alternative\":\n            const terms = ast.value;\n            for (let i = 0; i < terms.length; i++) {\n                const term = terms[i];\n                // skip terms that cannot effect the first char results\n                switch (term.type) {\n                    case \"EndAnchor\":\n                    // A group back reference cannot affect potential starting char.\n                    // because if a back reference is the first production than automatically\n                    // the group being referenced has had to come BEFORE so its codes have already been added\n                    case \"GroupBackReference\":\n                    // assertions do not affect potential starting codes\n                    case \"Lookahead\":\n                    case \"NegativeLookahead\":\n                    case \"StartAnchor\":\n                    case \"WordBoundary\":\n                    case \"NonWordBoundary\":\n                        continue;\n                }\n                const atom = term;\n                switch (atom.type) {\n                    case \"Character\":\n                        addOptimizedIdxToResult(atom.value, result, ignoreCase);\n                        break;\n                    case \"Set\":\n                        if (atom.complement === true) {\n                            throw Error(complementErrorMessage);\n                        }\n                        forEach(atom.value, (code) => {\n                            if (typeof code === \"number\") {\n                                addOptimizedIdxToResult(code, result, ignoreCase);\n                            }\n                            else {\n                                // range\n                                const range = code;\n                                // cannot optimize when ignoreCase is\n                                if (ignoreCase === true) {\n                                    for (let rangeCode = range.from; rangeCode <= range.to; rangeCode++) {\n                                        addOptimizedIdxToResult(rangeCode, result, ignoreCase);\n                                    }\n                                }\n                                // Optimization (2 orders of magnitude less work for very large ranges)\n                                else {\n                                    // handle unoptimized values\n                                    for (let rangeCode = range.from; rangeCode <= range.to && rangeCode < minOptimizationVal; rangeCode++) {\n                                        addOptimizedIdxToResult(rangeCode, result, ignoreCase);\n                                    }\n                                    // Less common charCode where we optimize for faster init time, by using larger \"buckets\"\n                                    if (range.to >= minOptimizationVal) {\n                                        const minUnOptVal = range.from >= minOptimizationVal\n                                            ? range.from\n                                            : minOptimizationVal;\n                                        const maxUnOptVal = range.to;\n                                        const minOptIdx = charCodeToOptimizedIndex(minUnOptVal);\n                                        const maxOptIdx = charCodeToOptimizedIndex(maxUnOptVal);\n                                        for (let currOptIdx = minOptIdx; currOptIdx <= maxOptIdx; currOptIdx++) {\n                                            result[currOptIdx] = currOptIdx;\n                                        }\n                                    }\n                                }\n                            }\n                        });\n                        break;\n                    case \"Group\":\n                        firstCharOptimizedIndices(atom.value, result, ignoreCase);\n                        break;\n                    /* istanbul ignore next */\n                    default:\n                        throw Error(\"Non Exhaustive Match\");\n                }\n                // reached a mandatory production, no more **start** codes can be found on this alternative\n                const isOptionalQuantifier = atom.quantifier !== undefined && atom.quantifier.atLeast === 0;\n                if (\n                // A group may be optional due to empty contents /(?:)/\n                // or if everything inside it is optional /((a)?)/\n                (atom.type === \"Group\" && isWholeOptional(atom) === false) ||\n                    // If this term is not a group it may only be optional if it has an optional quantifier\n                    (atom.type !== \"Group\" && isOptionalQuantifier === false)) {\n                    break;\n                }\n            }\n            break;\n        /* istanbul ignore next */\n        default:\n            throw Error(\"non exhaustive match!\");\n    }\n    // console.log(Object.keys(result).length)\n    return values(result);\n}\nfunction addOptimizedIdxToResult(code, result, ignoreCase) {\n    const optimizedCharIdx = charCodeToOptimizedIndex(code);\n    result[optimizedCharIdx] = optimizedCharIdx;\n    if (ignoreCase === true) {\n        handleIgnoreCase(code, result);\n    }\n}\nfunction handleIgnoreCase(code, result) {\n    const char = String.fromCharCode(code);\n    const upperChar = char.toUpperCase();\n    /* istanbul ignore else */\n    if (upperChar !== char) {\n        const optimizedCharIdx = charCodeToOptimizedIndex(upperChar.charCodeAt(0));\n        result[optimizedCharIdx] = optimizedCharIdx;\n    }\n    else {\n        const lowerChar = char.toLowerCase();\n        if (lowerChar !== char) {\n            const optimizedCharIdx = charCodeToOptimizedIndex(lowerChar.charCodeAt(0));\n            result[optimizedCharIdx] = optimizedCharIdx;\n        }\n    }\n}\nfunction findCode(setNode, targetCharCodes) {\n    return find(setNode.value, (codeOrRange) => {\n        if (typeof codeOrRange === \"number\") {\n            return includes(targetCharCodes, codeOrRange);\n        }\n        else {\n            // range\n            const range = codeOrRange;\n            return (find(targetCharCodes, (targetCode) => range.from <= targetCode && targetCode <= range.to) !== undefined);\n        }\n    });\n}\nfunction isWholeOptional(ast) {\n    const quantifier = ast.quantifier;\n    if (quantifier && quantifier.atLeast === 0) {\n        return true;\n    }\n    if (!ast.value) {\n        return false;\n    }\n    return isArray(ast.value)\n        ? every(ast.value, isWholeOptional)\n        : isWholeOptional(ast.value);\n}\nclass CharCodeFinder extends BaseRegExpVisitor {\n    constructor(targetCharCodes) {\n        super();\n        this.targetCharCodes = targetCharCodes;\n        this.found = false;\n    }\n    visitChildren(node) {\n        // No need to keep looking...\n        if (this.found === true) {\n            return;\n        }\n        // switch lookaheads as they do not actually consume any characters thus\n        // finding a charCode at lookahead context does not mean that regexp can actually contain it in a match.\n        switch (node.type) {\n            case \"Lookahead\":\n                this.visitLookahead(node);\n                return;\n            case \"NegativeLookahead\":\n                this.visitNegativeLookahead(node);\n                return;\n        }\n        super.visitChildren(node);\n    }\n    visitCharacter(node) {\n        if (includes(this.targetCharCodes, node.value)) {\n            this.found = true;\n        }\n    }\n    visitSet(node) {\n        if (node.complement) {\n            if (findCode(node, this.targetCharCodes) === undefined) {\n                this.found = true;\n            }\n        }\n        else {\n            if (findCode(node, this.targetCharCodes) !== undefined) {\n                this.found = true;\n            }\n        }\n    }\n}\nexport function canMatchCharCode(charCodes, pattern) {\n    if (pattern instanceof RegExp) {\n        const ast = getRegExpAst(pattern);\n        const charCodeFinder = new CharCodeFinder(charCodes);\n        charCodeFinder.visit(ast);\n        return charCodeFinder.found;\n    }\n    else {\n        return (find(pattern, (char) => {\n            return includes(charCodes, char.charCodeAt(0));\n        }) !== undefined);\n    }\n}\n//# sourceMappingURL=reg_exp.js.map","import { BaseRegExpVisitor } from \"@chevrotain/regexp-to-ast\";\nimport { Lexer, LexerDefinitionErrorType, } from \"./lexer_public.js\";\nimport { compact, defaults, difference, filter, find, first, flatten, forEach, has, includes, indexOf, isArray, isEmpty, isFunction, isRegExp, isString, isUndefined, keys, map, reduce, reject, values, } from \"lodash-es\";\nimport { PRINT_ERROR } from \"@chevrotain/utils\";\nimport { canMatchCharCode, failedOptimizationPrefixMsg, getOptimizedStartCodesIndices, } from \"./reg_exp.js\";\nimport { getRegExpAst } from \"./reg_exp_parser.js\";\nconst PATTERN = \"PATTERN\";\nexport const DEFAULT_MODE = \"defaultMode\";\nexport const MODES = \"modes\";\nexport let SUPPORT_STICKY = typeof new RegExp(\"(?:)\").sticky === \"boolean\";\nexport function disableSticky() {\n    SUPPORT_STICKY = false;\n}\nexport function enableSticky() {\n    SUPPORT_STICKY = true;\n}\nexport function analyzeTokenTypes(tokenTypes, options) {\n    options = defaults(options, {\n        useSticky: SUPPORT_STICKY,\n        debug: false,\n        safeMode: false,\n        positionTracking: \"full\",\n        lineTerminatorCharacters: [\"\\r\", \"\\n\"],\n        tracer: (msg, action) => action(),\n    });\n    const tracer = options.tracer;\n    tracer(\"initCharCodeToOptimizedIndexMap\", () => {\n        initCharCodeToOptimizedIndexMap();\n    });\n    let onlyRelevantTypes;\n    tracer(\"Reject Lexer.NA\", () => {\n        onlyRelevantTypes = reject(tokenTypes, (currType) => {\n            return currType[PATTERN] === Lexer.NA;\n        });\n    });\n    let hasCustom = false;\n    let allTransformedPatterns;\n    tracer(\"Transform Patterns\", () => {\n        hasCustom = false;\n        allTransformedPatterns = map(onlyRelevantTypes, (currType) => {\n            const currPattern = currType[PATTERN];\n            /* istanbul ignore else */\n            if (isRegExp(currPattern)) {\n                const regExpSource = currPattern.source;\n                if (regExpSource.length === 1 &&\n                    // only these regExp meta characters which can appear in a length one regExp\n                    regExpSource !== \"^\" &&\n                    regExpSource !== \"$\" &&\n                    regExpSource !== \".\" &&\n                    !currPattern.ignoreCase) {\n                    return regExpSource;\n                }\n                else if (regExpSource.length === 2 &&\n                    regExpSource[0] === \"\\\\\" &&\n                    // not a meta character\n                    !includes([\n                        \"d\",\n                        \"D\",\n                        \"s\",\n                        \"S\",\n                        \"t\",\n                        \"r\",\n                        \"n\",\n                        \"t\",\n                        \"0\",\n                        \"c\",\n                        \"b\",\n                        \"B\",\n                        \"f\",\n                        \"v\",\n                        \"w\",\n                        \"W\",\n                    ], regExpSource[1])) {\n                    // escaped meta Characters: /\\+/ /\\[/\n                    // or redundant escaping: /\\a/\n                    // without the escaping \"\\\"\n                    return regExpSource[1];\n                }\n                else {\n                    return options.useSticky\n                        ? addStickyFlag(currPattern)\n                        : addStartOfInput(currPattern);\n                }\n            }\n            else if (isFunction(currPattern)) {\n                hasCustom = true;\n                // CustomPatternMatcherFunc - custom patterns do not require any transformations, only wrapping in a RegExp Like object\n                return { exec: currPattern };\n            }\n            else if (typeof currPattern === \"object\") {\n                hasCustom = true;\n                // ICustomPattern\n                return currPattern;\n            }\n            else if (typeof currPattern === \"string\") {\n                if (currPattern.length === 1) {\n                    return currPattern;\n                }\n                else {\n                    const escapedRegExpString = currPattern.replace(/[\\\\^$.*+?()[\\]{}|]/g, \"\\\\$&\");\n                    const wrappedRegExp = new RegExp(escapedRegExpString);\n                    return options.useSticky\n                        ? addStickyFlag(wrappedRegExp)\n                        : addStartOfInput(wrappedRegExp);\n                }\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        });\n    });\n    let patternIdxToType;\n    let patternIdxToGroup;\n    let patternIdxToLongerAltIdxArr;\n    let patternIdxToPushMode;\n    let patternIdxToPopMode;\n    tracer(\"misc mapping\", () => {\n        patternIdxToType = map(onlyRelevantTypes, (currType) => currType.tokenTypeIdx);\n        patternIdxToGroup = map(onlyRelevantTypes, (clazz) => {\n            const groupName = clazz.GROUP;\n            /* istanbul ignore next */\n            if (groupName === Lexer.SKIPPED) {\n                return undefined;\n            }\n            else if (isString(groupName)) {\n                return groupName;\n            }\n            else if (isUndefined(groupName)) {\n                return false;\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        });\n        patternIdxToLongerAltIdxArr = map(onlyRelevantTypes, (clazz) => {\n            const longerAltType = clazz.LONGER_ALT;\n            if (longerAltType) {\n                const longerAltIdxArr = isArray(longerAltType)\n                    ? map(longerAltType, (type) => indexOf(onlyRelevantTypes, type))\n                    : [indexOf(onlyRelevantTypes, longerAltType)];\n                return longerAltIdxArr;\n            }\n        });\n        patternIdxToPushMode = map(onlyRelevantTypes, (clazz) => clazz.PUSH_MODE);\n        patternIdxToPopMode = map(onlyRelevantTypes, (clazz) => has(clazz, \"POP_MODE\"));\n    });\n    let patternIdxToCanLineTerminator;\n    tracer(\"Line Terminator Handling\", () => {\n        const lineTerminatorCharCodes = getCharCodes(options.lineTerminatorCharacters);\n        patternIdxToCanLineTerminator = map(onlyRelevantTypes, (tokType) => false);\n        if (options.positionTracking !== \"onlyOffset\") {\n            patternIdxToCanLineTerminator = map(onlyRelevantTypes, (tokType) => {\n                if (has(tokType, \"LINE_BREAKS\")) {\n                    return !!tokType.LINE_BREAKS;\n                }\n                else {\n                    return (checkLineBreaksIssues(tokType, lineTerminatorCharCodes) === false &&\n                        canMatchCharCode(lineTerminatorCharCodes, tokType.PATTERN));\n                }\n            });\n        }\n    });\n    let patternIdxToIsCustom;\n    let patternIdxToShort;\n    let emptyGroups;\n    let patternIdxToConfig;\n    tracer(\"Misc Mapping #2\", () => {\n        patternIdxToIsCustom = map(onlyRelevantTypes, isCustomPattern);\n        patternIdxToShort = map(allTransformedPatterns, isShortPattern);\n        emptyGroups = reduce(onlyRelevantTypes, (acc, clazz) => {\n            const groupName = clazz.GROUP;\n            if (isString(groupName) && !(groupName === Lexer.SKIPPED)) {\n                acc[groupName] = [];\n            }\n            return acc;\n        }, {});\n        patternIdxToConfig = map(allTransformedPatterns, (x, idx) => {\n            return {\n                pattern: allTransformedPatterns[idx],\n                longerAlt: patternIdxToLongerAltIdxArr[idx],\n                canLineTerminator: patternIdxToCanLineTerminator[idx],\n                isCustom: patternIdxToIsCustom[idx],\n                short: patternIdxToShort[idx],\n                group: patternIdxToGroup[idx],\n                push: patternIdxToPushMode[idx],\n                pop: patternIdxToPopMode[idx],\n                tokenTypeIdx: patternIdxToType[idx],\n                tokenType: onlyRelevantTypes[idx],\n            };\n        });\n    });\n    let canBeOptimized = true;\n    let charCodeToPatternIdxToConfig = [];\n    if (!options.safeMode) {\n        tracer(\"First Char Optimization\", () => {\n            charCodeToPatternIdxToConfig = reduce(onlyRelevantTypes, (result, currTokType, idx) => {\n                if (typeof currTokType.PATTERN === \"string\") {\n                    const charCode = currTokType.PATTERN.charCodeAt(0);\n                    const optimizedIdx = charCodeToOptimizedIndex(charCode);\n                    addToMapOfArrays(result, optimizedIdx, patternIdxToConfig[idx]);\n                }\n                else if (isArray(currTokType.START_CHARS_HINT)) {\n                    let lastOptimizedIdx;\n                    forEach(currTokType.START_CHARS_HINT, (charOrInt) => {\n                        const charCode = typeof charOrInt === \"string\"\n                            ? charOrInt.charCodeAt(0)\n                            : charOrInt;\n                        const currOptimizedIdx = charCodeToOptimizedIndex(charCode);\n                        // Avoid adding the config multiple times\n                        /* istanbul ignore else */\n                        // - Difficult to check this scenario effects as it is only a performance\n                        //   optimization that does not change correctness\n                        if (lastOptimizedIdx !== currOptimizedIdx) {\n                            lastOptimizedIdx = currOptimizedIdx;\n                            addToMapOfArrays(result, currOptimizedIdx, patternIdxToConfig[idx]);\n                        }\n                    });\n                }\n                else if (isRegExp(currTokType.PATTERN)) {\n                    if (currTokType.PATTERN.unicode) {\n                        canBeOptimized = false;\n                        if (options.ensureOptimizations) {\n                            PRINT_ERROR(`${failedOptimizationPrefixMsg}` +\n                                `\\tUnable to analyze < ${currTokType.PATTERN.toString()} > pattern.\\n` +\n                                \"\\tThe regexp unicode flag is not currently supported by the regexp-to-ast library.\\n\" +\n                                \"\\tThis will disable the lexer's first char optimizations.\\n\" +\n                                \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE\");\n                        }\n                    }\n                    else {\n                        const optimizedCodes = getOptimizedStartCodesIndices(currTokType.PATTERN, options.ensureOptimizations);\n                        /* istanbul ignore if */\n                        // start code will only be empty given an empty regExp or failure of regexp-to-ast library\n                        // the first should be a different validation and the second cannot be tested.\n                        if (isEmpty(optimizedCodes)) {\n                            // we cannot understand what codes may start possible matches\n                            // The optimization correctness requires knowing start codes for ALL patterns.\n                            // Not actually sure this is an error, no debug message\n                            canBeOptimized = false;\n                        }\n                        forEach(optimizedCodes, (code) => {\n                            addToMapOfArrays(result, code, patternIdxToConfig[idx]);\n                        });\n                    }\n                }\n                else {\n                    if (options.ensureOptimizations) {\n                        PRINT_ERROR(`${failedOptimizationPrefixMsg}` +\n                            `\\tTokenType: <${currTokType.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\\n` +\n                            \"\\tThis will disable the lexer's first char optimizations.\\n\" +\n                            \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE\");\n                    }\n                    canBeOptimized = false;\n                }\n                return result;\n            }, []);\n        });\n    }\n    return {\n        emptyGroups: emptyGroups,\n        patternIdxToConfig: patternIdxToConfig,\n        charCodeToPatternIdxToConfig: charCodeToPatternIdxToConfig,\n        hasCustom: hasCustom,\n        canBeOptimized: canBeOptimized,\n    };\n}\nexport function validatePatterns(tokenTypes, validModesNames) {\n    let errors = [];\n    const missingResult = findMissingPatterns(tokenTypes);\n    errors = errors.concat(missingResult.errors);\n    const invalidResult = findInvalidPatterns(missingResult.valid);\n    const validTokenTypes = invalidResult.valid;\n    errors = errors.concat(invalidResult.errors);\n    errors = errors.concat(validateRegExpPattern(validTokenTypes));\n    errors = errors.concat(findInvalidGroupType(validTokenTypes));\n    errors = errors.concat(findModesThatDoNotExist(validTokenTypes, validModesNames));\n    errors = errors.concat(findUnreachablePatterns(validTokenTypes));\n    return errors;\n}\nfunction validateRegExpPattern(tokenTypes) {\n    let errors = [];\n    const withRegExpPatterns = filter(tokenTypes, (currTokType) => isRegExp(currTokType[PATTERN]));\n    errors = errors.concat(findEndOfInputAnchor(withRegExpPatterns));\n    errors = errors.concat(findStartOfInputAnchor(withRegExpPatterns));\n    errors = errors.concat(findUnsupportedFlags(withRegExpPatterns));\n    errors = errors.concat(findDuplicatePatterns(withRegExpPatterns));\n    errors = errors.concat(findEmptyMatchRegExps(withRegExpPatterns));\n    return errors;\n}\nexport function findMissingPatterns(tokenTypes) {\n    const tokenTypesWithMissingPattern = filter(tokenTypes, (currType) => {\n        return !has(currType, PATTERN);\n    });\n    const errors = map(tokenTypesWithMissingPattern, (currType) => {\n        return {\n            message: \"Token Type: ->\" +\n                currType.name +\n                \"<- missing static 'PATTERN' property\",\n            type: LexerDefinitionErrorType.MISSING_PATTERN,\n            tokenTypes: [currType],\n        };\n    });\n    const valid = difference(tokenTypes, tokenTypesWithMissingPattern);\n    return { errors, valid };\n}\nexport function findInvalidPatterns(tokenTypes) {\n    const tokenTypesWithInvalidPattern = filter(tokenTypes, (currType) => {\n        const pattern = currType[PATTERN];\n        return (!isRegExp(pattern) &&\n            !isFunction(pattern) &&\n            !has(pattern, \"exec\") &&\n            !isString(pattern));\n    });\n    const errors = map(tokenTypesWithInvalidPattern, (currType) => {\n        return {\n            message: \"Token Type: ->\" +\n                currType.name +\n                \"<- static 'PATTERN' can only be a RegExp, a\" +\n                \" Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.\",\n            type: LexerDefinitionErrorType.INVALID_PATTERN,\n            tokenTypes: [currType],\n        };\n    });\n    const valid = difference(tokenTypes, tokenTypesWithInvalidPattern);\n    return { errors, valid };\n}\nconst end_of_input = /[^\\\\][$]/;\nexport function findEndOfInputAnchor(tokenTypes) {\n    class EndAnchorFinder extends BaseRegExpVisitor {\n        constructor() {\n            super(...arguments);\n            this.found = false;\n        }\n        visitEndAnchor(node) {\n            this.found = true;\n        }\n    }\n    const invalidRegex = filter(tokenTypes, (currType) => {\n        const pattern = currType.PATTERN;\n        try {\n            const regexpAst = getRegExpAst(pattern);\n            const endAnchorVisitor = new EndAnchorFinder();\n            endAnchorVisitor.visit(regexpAst);\n            return endAnchorVisitor.found;\n        }\n        catch (e) {\n            // old behavior in case of runtime exceptions with regexp-to-ast.\n            /* istanbul ignore next - cannot ensure an error in regexp-to-ast*/\n            return end_of_input.test(pattern.source);\n        }\n    });\n    const errors = map(invalidRegex, (currType) => {\n        return {\n            message: \"Unexpected RegExp Anchor Error:\\n\" +\n                \"\\tToken Type: ->\" +\n                currType.name +\n                \"<- static 'PATTERN' cannot contain end of input anchor '$'\\n\" +\n                \"\\tSee chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS\" +\n                \"\\tfor details.\",\n            type: LexerDefinitionErrorType.EOI_ANCHOR_FOUND,\n            tokenTypes: [currType],\n        };\n    });\n    return errors;\n}\nexport function findEmptyMatchRegExps(tokenTypes) {\n    const matchesEmptyString = filter(tokenTypes, (currType) => {\n        const pattern = currType.PATTERN;\n        return pattern.test(\"\");\n    });\n    const errors = map(matchesEmptyString, (currType) => {\n        return {\n            message: \"Token Type: ->\" +\n                currType.name +\n                \"<- static 'PATTERN' must not match an empty string\",\n            type: LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,\n            tokenTypes: [currType],\n        };\n    });\n    return errors;\n}\nconst start_of_input = /[^\\\\[][\\^]|^\\^/;\nexport function findStartOfInputAnchor(tokenTypes) {\n    class StartAnchorFinder extends BaseRegExpVisitor {\n        constructor() {\n            super(...arguments);\n            this.found = false;\n        }\n        visitStartAnchor(node) {\n            this.found = true;\n        }\n    }\n    const invalidRegex = filter(tokenTypes, (currType) => {\n        const pattern = currType.PATTERN;\n        try {\n            const regexpAst = getRegExpAst(pattern);\n            const startAnchorVisitor = new StartAnchorFinder();\n            startAnchorVisitor.visit(regexpAst);\n            return startAnchorVisitor.found;\n        }\n        catch (e) {\n            // old behavior in case of runtime exceptions with regexp-to-ast.\n            /* istanbul ignore next - cannot ensure an error in regexp-to-ast*/\n            return start_of_input.test(pattern.source);\n        }\n    });\n    const errors = map(invalidRegex, (currType) => {\n        return {\n            message: \"Unexpected RegExp Anchor Error:\\n\" +\n                \"\\tToken Type: ->\" +\n                currType.name +\n                \"<- static 'PATTERN' cannot contain start of input anchor '^'\\n\" +\n                \"\\tSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS\" +\n                \"\\tfor details.\",\n            type: LexerDefinitionErrorType.SOI_ANCHOR_FOUND,\n            tokenTypes: [currType],\n        };\n    });\n    return errors;\n}\nexport function findUnsupportedFlags(tokenTypes) {\n    const invalidFlags = filter(tokenTypes, (currType) => {\n        const pattern = currType[PATTERN];\n        return pattern instanceof RegExp && (pattern.multiline || pattern.global);\n    });\n    const errors = map(invalidFlags, (currType) => {\n        return {\n            message: \"Token Type: ->\" +\n                currType.name +\n                \"<- static 'PATTERN' may NOT contain global('g') or multiline('m')\",\n            type: LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,\n            tokenTypes: [currType],\n        };\n    });\n    return errors;\n}\n// This can only test for identical duplicate RegExps, not semantically equivalent ones.\nexport function findDuplicatePatterns(tokenTypes) {\n    const found = [];\n    let identicalPatterns = map(tokenTypes, (outerType) => {\n        return reduce(tokenTypes, (result, innerType) => {\n            if (outerType.PATTERN.source === innerType.PATTERN.source &&\n                !includes(found, innerType) &&\n                innerType.PATTERN !== Lexer.NA) {\n                // this avoids duplicates in the result, each Token Type may only appear in one \"set\"\n                // in essence we are creating Equivalence classes on equality relation.\n                found.push(innerType);\n                result.push(innerType);\n                return result;\n            }\n            return result;\n        }, []);\n    });\n    identicalPatterns = compact(identicalPatterns);\n    const duplicatePatterns = filter(identicalPatterns, (currIdenticalSet) => {\n        return currIdenticalSet.length > 1;\n    });\n    const errors = map(duplicatePatterns, (setOfIdentical) => {\n        const tokenTypeNames = map(setOfIdentical, (currType) => {\n            return currType.name;\n        });\n        const dupPatternSrc = first(setOfIdentical).PATTERN;\n        return {\n            message: `The same RegExp pattern ->${dupPatternSrc}<-` +\n                `has been used in all of the following Token Types: ${tokenTypeNames.join(\", \")} <-`,\n            type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,\n            tokenTypes: setOfIdentical,\n        };\n    });\n    return errors;\n}\nexport function findInvalidGroupType(tokenTypes) {\n    const invalidTypes = filter(tokenTypes, (clazz) => {\n        if (!has(clazz, \"GROUP\")) {\n            return false;\n        }\n        const group = clazz.GROUP;\n        return group !== Lexer.SKIPPED && group !== Lexer.NA && !isString(group);\n    });\n    const errors = map(invalidTypes, (currType) => {\n        return {\n            message: \"Token Type: ->\" +\n                currType.name +\n                \"<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String\",\n            type: LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,\n            tokenTypes: [currType],\n        };\n    });\n    return errors;\n}\nexport function findModesThatDoNotExist(tokenTypes, validModes) {\n    const invalidModes = filter(tokenTypes, (clazz) => {\n        return (clazz.PUSH_MODE !== undefined && !includes(validModes, clazz.PUSH_MODE));\n    });\n    const errors = map(invalidModes, (tokType) => {\n        const msg = `Token Type: ->${tokType.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${tokType.PUSH_MODE}<-` +\n            `which does not exist`;\n        return {\n            message: msg,\n            type: LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,\n            tokenTypes: [tokType],\n        };\n    });\n    return errors;\n}\nexport function findUnreachablePatterns(tokenTypes) {\n    const errors = [];\n    const canBeTested = reduce(tokenTypes, (result, tokType, idx) => {\n        const pattern = tokType.PATTERN;\n        if (pattern === Lexer.NA) {\n            return result;\n        }\n        // a more comprehensive validation for all forms of regExps would require\n        // deeper regExp analysis capabilities\n        if (isString(pattern)) {\n            result.push({ str: pattern, idx, tokenType: tokType });\n        }\n        else if (isRegExp(pattern) && noMetaChar(pattern)) {\n            result.push({ str: pattern.source, idx, tokenType: tokType });\n        }\n        return result;\n    }, []);\n    forEach(tokenTypes, (tokType, testIdx) => {\n        forEach(canBeTested, ({ str, idx, tokenType }) => {\n            if (testIdx < idx && testTokenType(str, tokType.PATTERN)) {\n                const msg = `Token: ->${tokenType.name}<- can never be matched.\\n` +\n                    `Because it appears AFTER the Token Type ->${tokType.name}<-` +\n                    `in the lexer's definition.\\n` +\n                    `See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;\n                errors.push({\n                    message: msg,\n                    type: LexerDefinitionErrorType.UNREACHABLE_PATTERN,\n                    tokenTypes: [tokType, tokenType],\n                });\n            }\n        });\n    });\n    return errors;\n}\nfunction testTokenType(str, pattern) {\n    /* istanbul ignore else */\n    if (isRegExp(pattern)) {\n        const regExpArray = pattern.exec(str);\n        return regExpArray !== null && regExpArray.index === 0;\n    }\n    else if (isFunction(pattern)) {\n        // maintain the API of custom patterns\n        return pattern(str, 0, [], {});\n    }\n    else if (has(pattern, \"exec\")) {\n        // maintain the API of custom patterns\n        return pattern.exec(str, 0, [], {});\n    }\n    else if (typeof pattern === \"string\") {\n        return pattern === str;\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nfunction noMetaChar(regExp) {\n    //https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp\n    const metaChars = [\n        \".\",\n        \"\\\\\",\n        \"[\",\n        \"]\",\n        \"|\",\n        \"^\",\n        \"$\",\n        \"(\",\n        \")\",\n        \"?\",\n        \"*\",\n        \"+\",\n        \"{\",\n    ];\n    return (find(metaChars, (char) => regExp.source.indexOf(char) !== -1) === undefined);\n}\nexport function addStartOfInput(pattern) {\n    const flags = pattern.ignoreCase ? \"i\" : \"\";\n    // always wrapping in a none capturing group preceded by '^' to make sure matching can only work on start of input.\n    // duplicate/redundant start of input markers have no meaning (/^^^^A/ === /^A/)\n    return new RegExp(`^(?:${pattern.source})`, flags);\n}\nexport function addStickyFlag(pattern) {\n    const flags = pattern.ignoreCase ? \"iy\" : \"y\";\n    // always wrapping in a none capturing group preceded by '^' to make sure matching can only work on start of input.\n    // duplicate/redundant start of input markers have no meaning (/^^^^A/ === /^A/)\n    return new RegExp(`${pattern.source}`, flags);\n}\nexport function performRuntimeChecks(lexerDefinition, trackLines, lineTerminatorCharacters) {\n    const errors = [];\n    // some run time checks to help the end users.\n    if (!has(lexerDefinition, DEFAULT_MODE)) {\n        errors.push({\n            message: \"A MultiMode Lexer cannot be initialized without a <\" +\n                DEFAULT_MODE +\n                \"> property in its definition\\n\",\n            type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE,\n        });\n    }\n    if (!has(lexerDefinition, MODES)) {\n        errors.push({\n            message: \"A MultiMode Lexer cannot be initialized without a <\" +\n                MODES +\n                \"> property in its definition\\n\",\n            type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY,\n        });\n    }\n    if (has(lexerDefinition, MODES) &&\n        has(lexerDefinition, DEFAULT_MODE) &&\n        !has(lexerDefinition.modes, lexerDefinition.defaultMode)) {\n        errors.push({\n            message: `A MultiMode Lexer cannot be initialized with a ${DEFAULT_MODE}: <${lexerDefinition.defaultMode}>` +\n                `which does not exist\\n`,\n            type: LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST,\n        });\n    }\n    if (has(lexerDefinition, MODES)) {\n        forEach(lexerDefinition.modes, (currModeValue, currModeName) => {\n            forEach(currModeValue, (currTokType, currIdx) => {\n                if (isUndefined(currTokType)) {\n                    errors.push({\n                        message: `A Lexer cannot be initialized using an undefined Token Type. Mode:` +\n                            `<${currModeName}> at index: <${currIdx}>\\n`,\n                        type: LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED,\n                    });\n                }\n                else if (has(currTokType, \"LONGER_ALT\")) {\n                    const longerAlt = isArray(currTokType.LONGER_ALT)\n                        ? currTokType.LONGER_ALT\n                        : [currTokType.LONGER_ALT];\n                    forEach(longerAlt, (currLongerAlt) => {\n                        if (!isUndefined(currLongerAlt) &&\n                            !includes(currModeValue, currLongerAlt)) {\n                            errors.push({\n                                message: `A MultiMode Lexer cannot be initialized with a longer_alt <${currLongerAlt.name}> on token <${currTokType.name}> outside of mode <${currModeName}>\\n`,\n                                type: LexerDefinitionErrorType.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE,\n                            });\n                        }\n                    });\n                }\n            });\n        });\n    }\n    return errors;\n}\nexport function performWarningRuntimeChecks(lexerDefinition, trackLines, lineTerminatorCharacters) {\n    const warnings = [];\n    let hasAnyLineBreak = false;\n    const allTokenTypes = compact(flatten(values(lexerDefinition.modes)));\n    const concreteTokenTypes = reject(allTokenTypes, (currType) => currType[PATTERN] === Lexer.NA);\n    const terminatorCharCodes = getCharCodes(lineTerminatorCharacters);\n    if (trackLines) {\n        forEach(concreteTokenTypes, (tokType) => {\n            const currIssue = checkLineBreaksIssues(tokType, terminatorCharCodes);\n            if (currIssue !== false) {\n                const message = buildLineBreakIssueMessage(tokType, currIssue);\n                const warningDescriptor = {\n                    message,\n                    type: currIssue.issue,\n                    tokenType: tokType,\n                };\n                warnings.push(warningDescriptor);\n            }\n            else {\n                // we don't want to attempt to scan if the user explicitly specified the line_breaks option.\n                if (has(tokType, \"LINE_BREAKS\")) {\n                    if (tokType.LINE_BREAKS === true) {\n                        hasAnyLineBreak = true;\n                    }\n                }\n                else {\n                    if (canMatchCharCode(terminatorCharCodes, tokType.PATTERN)) {\n                        hasAnyLineBreak = true;\n                    }\n                }\n            }\n        });\n    }\n    if (trackLines && !hasAnyLineBreak) {\n        warnings.push({\n            message: \"Warning: No LINE_BREAKS Found.\\n\" +\n                \"\\tThis Lexer has been defined to track line and column information,\\n\" +\n                \"\\tBut none of the Token Types can be identified as matching a line terminator.\\n\" +\n                \"\\tSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \\n\" +\n                \"\\tfor details.\",\n            type: LexerDefinitionErrorType.NO_LINE_BREAKS_FLAGS,\n        });\n    }\n    return warnings;\n}\nexport function cloneEmptyGroups(emptyGroups) {\n    const clonedResult = {};\n    const groupKeys = keys(emptyGroups);\n    forEach(groupKeys, (currKey) => {\n        const currGroupValue = emptyGroups[currKey];\n        /* istanbul ignore else */\n        if (isArray(currGroupValue)) {\n            clonedResult[currKey] = [];\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n    });\n    return clonedResult;\n}\n// TODO: refactor to avoid duplication\nexport function isCustomPattern(tokenType) {\n    const pattern = tokenType.PATTERN;\n    /* istanbul ignore else */\n    if (isRegExp(pattern)) {\n        return false;\n    }\n    else if (isFunction(pattern)) {\n        // CustomPatternMatcherFunc - custom patterns do not require any transformations, only wrapping in a RegExp Like object\n        return true;\n    }\n    else if (has(pattern, \"exec\")) {\n        // ICustomPattern\n        return true;\n    }\n    else if (isString(pattern)) {\n        return false;\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nexport function isShortPattern(pattern) {\n    if (isString(pattern) && pattern.length === 1) {\n        return pattern.charCodeAt(0);\n    }\n    else {\n        return false;\n    }\n}\n/**\n * Faster than using a RegExp for default newline detection during lexing.\n */\nexport const LineTerminatorOptimizedTester = {\n    // implements /\\n|\\r\\n?/g.test\n    test: function (text) {\n        const len = text.length;\n        for (let i = this.lastIndex; i < len; i++) {\n            const c = text.charCodeAt(i);\n            if (c === 10) {\n                this.lastIndex = i + 1;\n                return true;\n            }\n            else if (c === 13) {\n                if (text.charCodeAt(i + 1) === 10) {\n                    this.lastIndex = i + 2;\n                }\n                else {\n                    this.lastIndex = i + 1;\n                }\n                return true;\n            }\n        }\n        return false;\n    },\n    lastIndex: 0,\n};\nfunction checkLineBreaksIssues(tokType, lineTerminatorCharCodes) {\n    if (has(tokType, \"LINE_BREAKS\")) {\n        // if the user explicitly declared the line_breaks option we will respect their choice\n        // and assume it is correct.\n        return false;\n    }\n    else {\n        /* istanbul ignore else */\n        if (isRegExp(tokType.PATTERN)) {\n            try {\n                // TODO: why is the casting suddenly needed?\n                canMatchCharCode(lineTerminatorCharCodes, tokType.PATTERN);\n            }\n            catch (e) {\n                /* istanbul ignore next - to test this we would have to mock <canMatchCharCode> to throw an error */\n                return {\n                    issue: LexerDefinitionErrorType.IDENTIFY_TERMINATOR,\n                    errMsg: e.message,\n                };\n            }\n            return false;\n        }\n        else if (isString(tokType.PATTERN)) {\n            // string literal patterns can always be analyzed to detect line terminator usage\n            return false;\n        }\n        else if (isCustomPattern(tokType)) {\n            // custom token types\n            return { issue: LexerDefinitionErrorType.CUSTOM_LINE_BREAK };\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n    }\n}\nexport function buildLineBreakIssueMessage(tokType, details) {\n    /* istanbul ignore else */\n    if (details.issue === LexerDefinitionErrorType.IDENTIFY_TERMINATOR) {\n        return (\"Warning: unable to identify line terminator usage in pattern.\\n\" +\n            `\\tThe problem is in the <${tokType.name}> Token Type\\n` +\n            `\\t Root cause: ${details.errMsg}.\\n` +\n            \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR\");\n    }\n    else if (details.issue === LexerDefinitionErrorType.CUSTOM_LINE_BREAK) {\n        return (\"Warning: A Custom Token Pattern should specify the <line_breaks> option.\\n\" +\n            `\\tThe problem is in the <${tokType.name}> Token Type\\n` +\n            \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK\");\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nfunction getCharCodes(charsOrCodes) {\n    const charCodes = map(charsOrCodes, (numOrString) => {\n        if (isString(numOrString)) {\n            return numOrString.charCodeAt(0);\n        }\n        else {\n            return numOrString;\n        }\n    });\n    return charCodes;\n}\nfunction addToMapOfArrays(map, key, value) {\n    if (map[key] === undefined) {\n        map[key] = [value];\n    }\n    else {\n        map[key].push(value);\n    }\n}\nexport const minOptimizationVal = 256;\n/**\n * We are mapping charCode above ASCI (256) into buckets each in the size of 256.\n * This is because ASCI are the most common start chars so each one of those will get its own\n * possible token configs vector.\n *\n * Tokens starting with charCodes \"above\" ASCI are uncommon, so we can \"afford\"\n * to place these into buckets of possible token configs, What we gain from\n * this is avoiding the case of creating an optimization 'charCodeToPatternIdxToConfig'\n * which would contain 10,000+ arrays of small size (e.g unicode Identifiers scenario).\n * Our 'charCodeToPatternIdxToConfig' max size will now be:\n * 256 + (2^16 / 2^8) - 1 === 511\n *\n * note the hack for fast division integer part extraction\n * See: https://stackoverflow.com/a/4228528\n */\nlet charCodeToOptimizedIdxMap = [];\nexport function charCodeToOptimizedIndex(charCode) {\n    return charCode < minOptimizationVal\n        ? charCode\n        : charCodeToOptimizedIdxMap[charCode];\n}\n/**\n * This is a compromise between cold start / hot running performance\n * Creating this array takes ~3ms on a modern machine,\n * But if we perform the computation at runtime as needed the CSS Lexer benchmark\n * performance degrades by ~10%\n *\n * TODO: Perhaps it should be lazy initialized only if a charCode > 255 is used.\n */\nfunction initCharCodeToOptimizedIndexMap() {\n    if (isEmpty(charCodeToOptimizedIdxMap)) {\n        charCodeToOptimizedIdxMap = new Array(65536);\n        for (let i = 0; i < 65536; i++) {\n            charCodeToOptimizedIdxMap[i] = i > 255 ? 255 + ~~(i / 255) : i;\n        }\n    }\n}\n//# sourceMappingURL=lexer.js.map","import { clone, compact, difference, flatten, forEach, has, includes, isArray, isEmpty, map, } from \"lodash-es\";\nexport function tokenStructuredMatcher(tokInstance, tokConstructor) {\n    const instanceType = tokInstance.tokenTypeIdx;\n    if (instanceType === tokConstructor.tokenTypeIdx) {\n        return true;\n    }\n    else {\n        return (tokConstructor.isParent === true &&\n            tokConstructor.categoryMatchesMap[instanceType] === true);\n    }\n}\n// Optimized tokenMatcher in case our grammar does not use token categories\n// Being so tiny it is much more likely to be in-lined and this avoid the function call overhead\nexport function tokenStructuredMatcherNoCategories(token, tokType) {\n    return token.tokenTypeIdx === tokType.tokenTypeIdx;\n}\nexport let tokenShortNameIdx = 1;\nexport const tokenIdxToClass = {};\nexport function augmentTokenTypes(tokenTypes) {\n    // collect the parent Token Types as well.\n    const tokenTypesAndParents = expandCategories(tokenTypes);\n    // add required tokenType and categoryMatches properties\n    assignTokenDefaultProps(tokenTypesAndParents);\n    // fill up the categoryMatches\n    assignCategoriesMapProp(tokenTypesAndParents);\n    assignCategoriesTokensProp(tokenTypesAndParents);\n    forEach(tokenTypesAndParents, (tokType) => {\n        tokType.isParent = tokType.categoryMatches.length > 0;\n    });\n}\nexport function expandCategories(tokenTypes) {\n    let result = clone(tokenTypes);\n    let categories = tokenTypes;\n    let searching = true;\n    while (searching) {\n        categories = compact(flatten(map(categories, (currTokType) => currTokType.CATEGORIES)));\n        const newCategories = difference(categories, result);\n        result = result.concat(newCategories);\n        if (isEmpty(newCategories)) {\n            searching = false;\n        }\n        else {\n            categories = newCategories;\n        }\n    }\n    return result;\n}\nexport function assignTokenDefaultProps(tokenTypes) {\n    forEach(tokenTypes, (currTokType) => {\n        if (!hasShortKeyProperty(currTokType)) {\n            tokenIdxToClass[tokenShortNameIdx] = currTokType;\n            currTokType.tokenTypeIdx = tokenShortNameIdx++;\n        }\n        // CATEGORIES? : TokenType | TokenType[]\n        if (hasCategoriesProperty(currTokType) &&\n            !isArray(currTokType.CATEGORIES)\n        // &&\n        // !isUndefined(currTokType.CATEGORIES.PATTERN)\n        ) {\n            currTokType.CATEGORIES = [currTokType.CATEGORIES];\n        }\n        if (!hasCategoriesProperty(currTokType)) {\n            currTokType.CATEGORIES = [];\n        }\n        if (!hasExtendingTokensTypesProperty(currTokType)) {\n            currTokType.categoryMatches = [];\n        }\n        if (!hasExtendingTokensTypesMapProperty(currTokType)) {\n            currTokType.categoryMatchesMap = {};\n        }\n    });\n}\nexport function assignCategoriesTokensProp(tokenTypes) {\n    forEach(tokenTypes, (currTokType) => {\n        // avoid duplications\n        currTokType.categoryMatches = [];\n        forEach(currTokType.categoryMatchesMap, (val, key) => {\n            currTokType.categoryMatches.push(tokenIdxToClass[key].tokenTypeIdx);\n        });\n    });\n}\nexport function assignCategoriesMapProp(tokenTypes) {\n    forEach(tokenTypes, (currTokType) => {\n        singleAssignCategoriesToksMap([], currTokType);\n    });\n}\nexport function singleAssignCategoriesToksMap(path, nextNode) {\n    forEach(path, (pathNode) => {\n        nextNode.categoryMatchesMap[pathNode.tokenTypeIdx] = true;\n    });\n    forEach(nextNode.CATEGORIES, (nextCategory) => {\n        const newPath = path.concat(nextNode);\n        // avoids infinite loops due to cyclic categories.\n        if (!includes(newPath, nextCategory)) {\n            singleAssignCategoriesToksMap(newPath, nextCategory);\n        }\n    });\n}\nexport function hasShortKeyProperty(tokType) {\n    return has(tokType, \"tokenTypeIdx\");\n}\nexport function hasCategoriesProperty(tokType) {\n    return has(tokType, \"CATEGORIES\");\n}\nexport function hasExtendingTokensTypesProperty(tokType) {\n    return has(tokType, \"categoryMatches\");\n}\nexport function hasExtendingTokensTypesMapProperty(tokType) {\n    return has(tokType, \"categoryMatchesMap\");\n}\nexport function isTokenType(tokType) {\n    return has(tokType, \"tokenTypeIdx\");\n}\n//# sourceMappingURL=tokens.js.map","export const defaultLexerErrorProvider = {\n    buildUnableToPopLexerModeMessage(token) {\n        return `Unable to pop Lexer Mode after encountering Token ->${token.image}<- The Mode Stack is empty`;\n    },\n    buildUnexpectedCharactersMessage(fullText, startOffset, length, line, column) {\n        return (`unexpected character: ->${fullText.charAt(startOffset)}<- at offset: ${startOffset},` + ` skipped ${length} characters.`);\n    },\n};\n//# sourceMappingURL=lexer_errors_public.js.map","import { analyzeTokenTypes, charCodeToOptimizedIndex, cloneEmptyGroups, DEFAULT_MODE, LineTerminatorOptimizedTester, performRuntimeChecks, performWarningRuntimeChecks, SUPPORT_STICKY, validatePatterns, } from \"./lexer.js\";\nimport { assign, clone, forEach, identity, isArray, isEmpty, isUndefined, keys, last, map, noop, reduce, reject, } from \"lodash-es\";\nimport { PRINT_WARNING, timer, toFastProperties } from \"@chevrotain/utils\";\nimport { augmentTokenTypes } from \"./tokens.js\";\nimport { defaultLexerErrorProvider } from \"./lexer_errors_public.js\";\nimport { clearRegExpParserCache } from \"./reg_exp_parser.js\";\nexport var LexerDefinitionErrorType;\n(function (LexerDefinitionErrorType) {\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MISSING_PATTERN\"] = 0] = \"MISSING_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"INVALID_PATTERN\"] = 1] = \"INVALID_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"EOI_ANCHOR_FOUND\"] = 2] = \"EOI_ANCHOR_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"UNSUPPORTED_FLAGS_FOUND\"] = 3] = \"UNSUPPORTED_FLAGS_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"DUPLICATE_PATTERNS_FOUND\"] = 4] = \"DUPLICATE_PATTERNS_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"INVALID_GROUP_TYPE_FOUND\"] = 5] = \"INVALID_GROUP_TYPE_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"PUSH_MODE_DOES_NOT_EXIST\"] = 6] = \"PUSH_MODE_DOES_NOT_EXIST\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE\"] = 7] = \"MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY\"] = 8] = \"MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST\"] = 9] = \"MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED\"] = 10] = \"LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"SOI_ANCHOR_FOUND\"] = 11] = \"SOI_ANCHOR_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"EMPTY_MATCH_PATTERN\"] = 12] = \"EMPTY_MATCH_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"NO_LINE_BREAKS_FLAGS\"] = 13] = \"NO_LINE_BREAKS_FLAGS\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"UNREACHABLE_PATTERN\"] = 14] = \"UNREACHABLE_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"IDENTIFY_TERMINATOR\"] = 15] = \"IDENTIFY_TERMINATOR\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"CUSTOM_LINE_BREAK\"] = 16] = \"CUSTOM_LINE_BREAK\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE\"] = 17] = \"MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE\";\n})(LexerDefinitionErrorType || (LexerDefinitionErrorType = {}));\nconst DEFAULT_LEXER_CONFIG = {\n    deferDefinitionErrorsHandling: false,\n    positionTracking: \"full\",\n    lineTerminatorsPattern: /\\n|\\r\\n?/g,\n    lineTerminatorCharacters: [\"\\n\", \"\\r\"],\n    ensureOptimizations: false,\n    safeMode: false,\n    errorMessageProvider: defaultLexerErrorProvider,\n    traceInitPerf: false,\n    skipValidations: false,\n    recoveryEnabled: true,\n};\nObject.freeze(DEFAULT_LEXER_CONFIG);\nexport class Lexer {\n    constructor(lexerDefinition, config = DEFAULT_LEXER_CONFIG) {\n        this.lexerDefinition = lexerDefinition;\n        this.lexerDefinitionErrors = [];\n        this.lexerDefinitionWarning = [];\n        this.patternIdxToConfig = {};\n        this.charCodeToPatternIdxToConfig = {};\n        this.modes = [];\n        this.emptyGroups = {};\n        this.trackStartLines = true;\n        this.trackEndLines = true;\n        this.hasCustom = false;\n        this.canModeBeOptimized = {};\n        // Duplicated from the parser's perf trace trait to allow future extraction\n        // of the lexer to a separate package.\n        this.TRACE_INIT = (phaseDesc, phaseImpl) => {\n            // No need to optimize this using NOOP pattern because\n            // It is not called in a hot spot...\n            if (this.traceInitPerf === true) {\n                this.traceInitIndent++;\n                const indent = new Array(this.traceInitIndent + 1).join(\"\\t\");\n                if (this.traceInitIndent < this.traceInitMaxIdent) {\n                    console.log(`${indent}--> <${phaseDesc}>`);\n                }\n                const { time, value } = timer(phaseImpl);\n                /* istanbul ignore next - Difficult to reproduce specific performance behavior (>10ms) in tests */\n                const traceMethod = time > 10 ? console.warn : console.log;\n                if (this.traceInitIndent < this.traceInitMaxIdent) {\n                    traceMethod(`${indent}<-- <${phaseDesc}> time: ${time}ms`);\n                }\n                this.traceInitIndent--;\n                return value;\n            }\n            else {\n                return phaseImpl();\n            }\n        };\n        if (typeof config === \"boolean\") {\n            throw Error(\"The second argument to the Lexer constructor is now an ILexerConfig Object.\\n\" +\n                \"a boolean 2nd argument is no longer supported\");\n        }\n        // todo: defaults func?\n        this.config = assign({}, DEFAULT_LEXER_CONFIG, config);\n        const traceInitVal = this.config.traceInitPerf;\n        if (traceInitVal === true) {\n            this.traceInitMaxIdent = Infinity;\n            this.traceInitPerf = true;\n        }\n        else if (typeof traceInitVal === \"number\") {\n            this.traceInitMaxIdent = traceInitVal;\n            this.traceInitPerf = true;\n        }\n        this.traceInitIndent = -1;\n        this.TRACE_INIT(\"Lexer Constructor\", () => {\n            let actualDefinition;\n            let hasOnlySingleMode = true;\n            this.TRACE_INIT(\"Lexer Config handling\", () => {\n                if (this.config.lineTerminatorsPattern ===\n                    DEFAULT_LEXER_CONFIG.lineTerminatorsPattern) {\n                    // optimized built-in implementation for the defaults definition of lineTerminators\n                    this.config.lineTerminatorsPattern = LineTerminatorOptimizedTester;\n                }\n                else {\n                    if (this.config.lineTerminatorCharacters ===\n                        DEFAULT_LEXER_CONFIG.lineTerminatorCharacters) {\n                        throw Error(\"Error: Missing <lineTerminatorCharacters> property on the Lexer config.\\n\" +\n                            \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS\");\n                    }\n                }\n                if (config.safeMode && config.ensureOptimizations) {\n                    throw Error('\"safeMode\" and \"ensureOptimizations\" flags are mutually exclusive.');\n                }\n                this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking);\n                this.trackEndLines = /full/i.test(this.config.positionTracking);\n                // Convert SingleModeLexerDefinition into a IMultiModeLexerDefinition.\n                if (isArray(lexerDefinition)) {\n                    actualDefinition = {\n                        modes: { defaultMode: clone(lexerDefinition) },\n                        defaultMode: DEFAULT_MODE,\n                    };\n                }\n                else {\n                    // no conversion needed, input should already be a IMultiModeLexerDefinition\n                    hasOnlySingleMode = false;\n                    actualDefinition = clone(lexerDefinition);\n                }\n            });\n            if (this.config.skipValidations === false) {\n                this.TRACE_INIT(\"performRuntimeChecks\", () => {\n                    this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(performRuntimeChecks(actualDefinition, this.trackStartLines, this.config.lineTerminatorCharacters));\n                });\n                this.TRACE_INIT(\"performWarningRuntimeChecks\", () => {\n                    this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat(performWarningRuntimeChecks(actualDefinition, this.trackStartLines, this.config.lineTerminatorCharacters));\n                });\n            }\n            // for extra robustness to avoid throwing an none informative error message\n            actualDefinition.modes = actualDefinition.modes\n                ? actualDefinition.modes\n                : {};\n            // an error of undefined TokenTypes will be detected in \"performRuntimeChecks\" above.\n            // this transformation is to increase robustness in the case of partially invalid lexer definition.\n            forEach(actualDefinition.modes, (currModeValue, currModeName) => {\n                actualDefinition.modes[currModeName] = reject(currModeValue, (currTokType) => isUndefined(currTokType));\n            });\n            const allModeNames = keys(actualDefinition.modes);\n            forEach(actualDefinition.modes, (currModDef, currModName) => {\n                this.TRACE_INIT(`Mode: <${currModName}> processing`, () => {\n                    this.modes.push(currModName);\n                    if (this.config.skipValidations === false) {\n                        this.TRACE_INIT(`validatePatterns`, () => {\n                            this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(validatePatterns(currModDef, allModeNames));\n                        });\n                    }\n                    // If definition errors were encountered, the analysis phase may fail unexpectedly/\n                    // Considering a lexer with definition errors may never be used, there is no point\n                    // to performing the analysis anyhow...\n                    if (isEmpty(this.lexerDefinitionErrors)) {\n                        augmentTokenTypes(currModDef);\n                        let currAnalyzeResult;\n                        this.TRACE_INIT(`analyzeTokenTypes`, () => {\n                            currAnalyzeResult = analyzeTokenTypes(currModDef, {\n                                lineTerminatorCharacters: this.config.lineTerminatorCharacters,\n                                positionTracking: config.positionTracking,\n                                ensureOptimizations: config.ensureOptimizations,\n                                safeMode: config.safeMode,\n                                tracer: this.TRACE_INIT,\n                            });\n                        });\n                        this.patternIdxToConfig[currModName] =\n                            currAnalyzeResult.patternIdxToConfig;\n                        this.charCodeToPatternIdxToConfig[currModName] =\n                            currAnalyzeResult.charCodeToPatternIdxToConfig;\n                        this.emptyGroups = assign({}, this.emptyGroups, currAnalyzeResult.emptyGroups);\n                        this.hasCustom = currAnalyzeResult.hasCustom || this.hasCustom;\n                        this.canModeBeOptimized[currModName] =\n                            currAnalyzeResult.canBeOptimized;\n                    }\n                });\n            });\n            this.defaultMode = actualDefinition.defaultMode;\n            if (!isEmpty(this.lexerDefinitionErrors) &&\n                !this.config.deferDefinitionErrorsHandling) {\n                const allErrMessages = map(this.lexerDefinitionErrors, (error) => {\n                    return error.message;\n                });\n                const allErrMessagesString = allErrMessages.join(\"-----------------------\\n\");\n                throw new Error(\"Errors detected in definition of Lexer:\\n\" + allErrMessagesString);\n            }\n            // Only print warning if there are no errors, This will avoid pl\n            forEach(this.lexerDefinitionWarning, (warningDescriptor) => {\n                PRINT_WARNING(warningDescriptor.message);\n            });\n            this.TRACE_INIT(\"Choosing sub-methods implementations\", () => {\n                // Choose the relevant internal implementations for this specific parser.\n                // These implementations should be in-lined by the JavaScript engine\n                // to provide optimal performance in each scenario.\n                if (SUPPORT_STICKY) {\n                    this.chopInput = identity;\n                    this.match = this.matchWithTest;\n                }\n                else {\n                    this.updateLastIndex = noop;\n                    this.match = this.matchWithExec;\n                }\n                if (hasOnlySingleMode) {\n                    this.handleModes = noop;\n                }\n                if (this.trackStartLines === false) {\n                    this.computeNewColumn = identity;\n                }\n                if (this.trackEndLines === false) {\n                    this.updateTokenEndLineColumnLocation = noop;\n                }\n                if (/full/i.test(this.config.positionTracking)) {\n                    this.createTokenInstance = this.createFullToken;\n                }\n                else if (/onlyStart/i.test(this.config.positionTracking)) {\n                    this.createTokenInstance = this.createStartOnlyToken;\n                }\n                else if (/onlyOffset/i.test(this.config.positionTracking)) {\n                    this.createTokenInstance = this.createOffsetOnlyToken;\n                }\n                else {\n                    throw Error(`Invalid <positionTracking> config option: \"${this.config.positionTracking}\"`);\n                }\n                if (this.hasCustom) {\n                    this.addToken = this.addTokenUsingPush;\n                    this.handlePayload = this.handlePayloadWithCustom;\n                }\n                else {\n                    this.addToken = this.addTokenUsingMemberAccess;\n                    this.handlePayload = this.handlePayloadNoCustom;\n                }\n            });\n            this.TRACE_INIT(\"Failed Optimization Warnings\", () => {\n                const unOptimizedModes = reduce(this.canModeBeOptimized, (cannotBeOptimized, canBeOptimized, modeName) => {\n                    if (canBeOptimized === false) {\n                        cannotBeOptimized.push(modeName);\n                    }\n                    return cannotBeOptimized;\n                }, []);\n                if (config.ensureOptimizations && !isEmpty(unOptimizedModes)) {\n                    throw Error(`Lexer Modes: < ${unOptimizedModes.join(\", \")} > cannot be optimized.\\n` +\n                        '\\t Disable the \"ensureOptimizations\" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.\\n' +\n                        \"\\t Or inspect the console log for details on how to resolve these issues.\");\n                }\n            });\n            this.TRACE_INIT(\"clearRegExpParserCache\", () => {\n                clearRegExpParserCache();\n            });\n            this.TRACE_INIT(\"toFastProperties\", () => {\n                toFastProperties(this);\n            });\n        });\n    }\n    tokenize(text, initialMode = this.defaultMode) {\n        if (!isEmpty(this.lexerDefinitionErrors)) {\n            const allErrMessages = map(this.lexerDefinitionErrors, (error) => {\n                return error.message;\n            });\n            const allErrMessagesString = allErrMessages.join(\"-----------------------\\n\");\n            throw new Error(\"Unable to Tokenize because Errors detected in definition of Lexer:\\n\" +\n                allErrMessagesString);\n        }\n        return this.tokenizeInternal(text, initialMode);\n    }\n    // There is quite a bit of duplication between this and \"tokenizeInternalLazy\"\n    // This is intentional due to performance considerations.\n    // this method also used quite a bit of `!` none null assertions because it is too optimized\n    // for `tsc` to always understand it is \"safe\"\n    tokenizeInternal(text, initialMode) {\n        let i, j, k, matchAltImage, longerAlt, matchedImage, payload, altPayload, imageLength, group, tokType, newToken, errLength, droppedChar, msg, match;\n        const orgText = text;\n        const orgLength = orgText.length;\n        let offset = 0;\n        let matchedTokensIndex = 0;\n        // initializing the tokensArray to the \"guessed\" size.\n        // guessing too little will still reduce the number of array re-sizes on pushes.\n        // guessing too large (Tested by guessing x4 too large) may cost a bit more of memory\n        // but would still have a faster runtime by avoiding (All but one) array resizing.\n        const guessedNumberOfTokens = this.hasCustom\n            ? 0 // will break custom token pattern APIs the matchedTokens array will contain undefined elements.\n            : Math.floor(text.length / 10);\n        const matchedTokens = new Array(guessedNumberOfTokens);\n        const errors = [];\n        let line = this.trackStartLines ? 1 : undefined;\n        let column = this.trackStartLines ? 1 : undefined;\n        const groups = cloneEmptyGroups(this.emptyGroups);\n        const trackLines = this.trackStartLines;\n        const lineTerminatorPattern = this.config.lineTerminatorsPattern;\n        let currModePatternsLength = 0;\n        let patternIdxToConfig = [];\n        let currCharCodeToPatternIdxToConfig = [];\n        const modeStack = [];\n        const emptyArray = [];\n        Object.freeze(emptyArray);\n        let getPossiblePatterns;\n        function getPossiblePatternsSlow() {\n            return patternIdxToConfig;\n        }\n        function getPossiblePatternsOptimized(charCode) {\n            const optimizedCharIdx = charCodeToOptimizedIndex(charCode);\n            const possiblePatterns = currCharCodeToPatternIdxToConfig[optimizedCharIdx];\n            if (possiblePatterns === undefined) {\n                return emptyArray;\n            }\n            else {\n                return possiblePatterns;\n            }\n        }\n        const pop_mode = (popToken) => {\n            // TODO: perhaps avoid this error in the edge case there is no more input?\n            if (modeStack.length === 1 &&\n                // if we have both a POP_MODE and a PUSH_MODE this is in-fact a \"transition\"\n                // So no error should occur.\n                popToken.tokenType.PUSH_MODE === undefined) {\n                // if we try to pop the last mode there lexer will no longer have ANY mode.\n                // thus the pop is ignored, an error will be created and the lexer will continue parsing in the previous mode.\n                const msg = this.config.errorMessageProvider.buildUnableToPopLexerModeMessage(popToken);\n                errors.push({\n                    offset: popToken.startOffset,\n                    line: popToken.startLine,\n                    column: popToken.startColumn,\n                    length: popToken.image.length,\n                    message: msg,\n                });\n            }\n            else {\n                modeStack.pop();\n                const newMode = last(modeStack);\n                patternIdxToConfig = this.patternIdxToConfig[newMode];\n                currCharCodeToPatternIdxToConfig =\n                    this.charCodeToPatternIdxToConfig[newMode];\n                currModePatternsLength = patternIdxToConfig.length;\n                const modeCanBeOptimized = this.canModeBeOptimized[newMode] && this.config.safeMode === false;\n                if (currCharCodeToPatternIdxToConfig && modeCanBeOptimized) {\n                    getPossiblePatterns = getPossiblePatternsOptimized;\n                }\n                else {\n                    getPossiblePatterns = getPossiblePatternsSlow;\n                }\n            }\n        };\n        function push_mode(newMode) {\n            modeStack.push(newMode);\n            currCharCodeToPatternIdxToConfig =\n                this.charCodeToPatternIdxToConfig[newMode];\n            patternIdxToConfig = this.patternIdxToConfig[newMode];\n            currModePatternsLength = patternIdxToConfig.length;\n            currModePatternsLength = patternIdxToConfig.length;\n            const modeCanBeOptimized = this.canModeBeOptimized[newMode] && this.config.safeMode === false;\n            if (currCharCodeToPatternIdxToConfig && modeCanBeOptimized) {\n                getPossiblePatterns = getPossiblePatternsOptimized;\n            }\n            else {\n                getPossiblePatterns = getPossiblePatternsSlow;\n            }\n        }\n        // this pattern seems to avoid a V8 de-optimization, although that de-optimization does not\n        // seem to matter performance wise.\n        push_mode.call(this, initialMode);\n        let currConfig;\n        const recoveryEnabled = this.config.recoveryEnabled;\n        while (offset < orgLength) {\n            matchedImage = null;\n            const nextCharCode = orgText.charCodeAt(offset);\n            const chosenPatternIdxToConfig = getPossiblePatterns(nextCharCode);\n            const chosenPatternsLength = chosenPatternIdxToConfig.length;\n            for (i = 0; i < chosenPatternsLength; i++) {\n                currConfig = chosenPatternIdxToConfig[i];\n                const currPattern = currConfig.pattern;\n                payload = null;\n                // manually in-lined because > 600 chars won't be in-lined in V8\n                const singleCharCode = currConfig.short;\n                if (singleCharCode !== false) {\n                    if (nextCharCode === singleCharCode) {\n                        // single character string\n                        matchedImage = currPattern;\n                    }\n                }\n                else if (currConfig.isCustom === true) {\n                    match = currPattern.exec(orgText, offset, matchedTokens, groups);\n                    if (match !== null) {\n                        matchedImage = match[0];\n                        if (match.payload !== undefined) {\n                            payload = match.payload;\n                        }\n                    }\n                    else {\n                        matchedImage = null;\n                    }\n                }\n                else {\n                    this.updateLastIndex(currPattern, offset);\n                    matchedImage = this.match(currPattern, text, offset);\n                }\n                if (matchedImage !== null) {\n                    // even though this pattern matched we must try a another longer alternative.\n                    // this can be used to prioritize keywords over identifiers\n                    longerAlt = currConfig.longerAlt;\n                    if (longerAlt !== undefined) {\n                        // TODO: micro optimize, avoid extra prop access\n                        // by saving/linking longerAlt on the original config?\n                        const longerAltLength = longerAlt.length;\n                        for (k = 0; k < longerAltLength; k++) {\n                            const longerAltConfig = patternIdxToConfig[longerAlt[k]];\n                            const longerAltPattern = longerAltConfig.pattern;\n                            altPayload = null;\n                            // single Char can never be a longer alt so no need to test it.\n                            // manually in-lined because > 600 chars won't be in-lined in V8\n                            if (longerAltConfig.isCustom === true) {\n                                match = longerAltPattern.exec(orgText, offset, matchedTokens, groups);\n                                if (match !== null) {\n                                    matchAltImage = match[0];\n                                    if (match.payload !== undefined) {\n                                        altPayload = match.payload;\n                                    }\n                                }\n                                else {\n                                    matchAltImage = null;\n                                }\n                            }\n                            else {\n                                this.updateLastIndex(longerAltPattern, offset);\n                                matchAltImage = this.match(longerAltPattern, text, offset);\n                            }\n                            if (matchAltImage && matchAltImage.length > matchedImage.length) {\n                                matchedImage = matchAltImage;\n                                payload = altPayload;\n                                currConfig = longerAltConfig;\n                                // Exit the loop early after matching one of the longer alternatives\n                                // The first matched alternative takes precedence\n                                break;\n                            }\n                        }\n                    }\n                    break;\n                }\n            }\n            // successful match\n            if (matchedImage !== null) {\n                imageLength = matchedImage.length;\n                group = currConfig.group;\n                if (group !== undefined) {\n                    tokType = currConfig.tokenTypeIdx;\n                    // TODO: \"offset + imageLength\" and the new column may be computed twice in case of \"full\" location information inside\n                    // createFullToken method\n                    newToken = this.createTokenInstance(matchedImage, offset, tokType, currConfig.tokenType, line, column, imageLength);\n                    this.handlePayload(newToken, payload);\n                    // TODO: optimize NOOP in case there are no special groups?\n                    if (group === false) {\n                        matchedTokensIndex = this.addToken(matchedTokens, matchedTokensIndex, newToken);\n                    }\n                    else {\n                        groups[group].push(newToken);\n                    }\n                }\n                text = this.chopInput(text, imageLength);\n                offset = offset + imageLength;\n                // TODO: with newlines the column may be assigned twice\n                column = this.computeNewColumn(column, imageLength);\n                if (trackLines === true && currConfig.canLineTerminator === true) {\n                    let numOfLTsInMatch = 0;\n                    let foundTerminator;\n                    let lastLTEndOffset;\n                    lineTerminatorPattern.lastIndex = 0;\n                    do {\n                        foundTerminator = lineTerminatorPattern.test(matchedImage);\n                        if (foundTerminator === true) {\n                            lastLTEndOffset = lineTerminatorPattern.lastIndex - 1;\n                            numOfLTsInMatch++;\n                        }\n                    } while (foundTerminator === true);\n                    if (numOfLTsInMatch !== 0) {\n                        line = line + numOfLTsInMatch;\n                        column = imageLength - lastLTEndOffset;\n                        this.updateTokenEndLineColumnLocation(newToken, group, lastLTEndOffset, numOfLTsInMatch, line, column, imageLength);\n                    }\n                }\n                // will be NOOP if no modes present\n                this.handleModes(currConfig, pop_mode, push_mode, newToken);\n            }\n            else {\n                // error recovery, drop characters until we identify a valid token's start point\n                const errorStartOffset = offset;\n                const errorLine = line;\n                const errorColumn = column;\n                let foundResyncPoint = recoveryEnabled === false;\n                while (foundResyncPoint === false && offset < orgLength) {\n                    // Identity Func (when sticky flag is enabled)\n                    text = this.chopInput(text, 1);\n                    offset++;\n                    for (j = 0; j < currModePatternsLength; j++) {\n                        const currConfig = patternIdxToConfig[j];\n                        const currPattern = currConfig.pattern;\n                        // manually in-lined because > 600 chars won't be in-lined in V8\n                        const singleCharCode = currConfig.short;\n                        if (singleCharCode !== false) {\n                            if (orgText.charCodeAt(offset) === singleCharCode) {\n                                // single character string\n                                foundResyncPoint = true;\n                            }\n                        }\n                        else if (currConfig.isCustom === true) {\n                            foundResyncPoint =\n                                currPattern.exec(orgText, offset, matchedTokens, groups) !== null;\n                        }\n                        else {\n                            this.updateLastIndex(currPattern, offset);\n                            foundResyncPoint = currPattern.exec(text) !== null;\n                        }\n                        if (foundResyncPoint === true) {\n                            break;\n                        }\n                    }\n                }\n                errLength = offset - errorStartOffset;\n                column = this.computeNewColumn(column, errLength);\n                // at this point we either re-synced or reached the end of the input text\n                msg = this.config.errorMessageProvider.buildUnexpectedCharactersMessage(orgText, errorStartOffset, errLength, errorLine, errorColumn);\n                errors.push({\n                    offset: errorStartOffset,\n                    line: errorLine,\n                    column: errorColumn,\n                    length: errLength,\n                    message: msg,\n                });\n                if (recoveryEnabled === false) {\n                    break;\n                }\n            }\n        }\n        // if we do have custom patterns which push directly into the\n        // TODO: custom tokens should not push directly??\n        if (!this.hasCustom) {\n            // if we guessed a too large size for the tokens array this will shrink it to the right size.\n            matchedTokens.length = matchedTokensIndex;\n        }\n        return {\n            tokens: matchedTokens,\n            groups: groups,\n            errors: errors,\n        };\n    }\n    handleModes(config, pop_mode, push_mode, newToken) {\n        if (config.pop === true) {\n            // need to save the PUSH_MODE property as if the mode is popped\n            // patternIdxToPopMode is updated to reflect the new mode after popping the stack\n            const pushMode = config.push;\n            pop_mode(newToken);\n            if (pushMode !== undefined) {\n                push_mode.call(this, pushMode);\n            }\n        }\n        else if (config.push !== undefined) {\n            push_mode.call(this, config.push);\n        }\n    }\n    chopInput(text, length) {\n        return text.substring(length);\n    }\n    updateLastIndex(regExp, newLastIndex) {\n        regExp.lastIndex = newLastIndex;\n    }\n    // TODO: decrease this under 600 characters? inspect stripping comments option in TSC compiler\n    updateTokenEndLineColumnLocation(newToken, group, lastLTIdx, numOfLTsInMatch, line, column, imageLength) {\n        let lastCharIsLT, fixForEndingInLT;\n        if (group !== undefined) {\n            // a none skipped multi line Token, need to update endLine/endColumn\n            lastCharIsLT = lastLTIdx === imageLength - 1;\n            fixForEndingInLT = lastCharIsLT ? -1 : 0;\n            if (!(numOfLTsInMatch === 1 && lastCharIsLT === true)) {\n                // if a token ends in a LT that last LT only affects the line numbering of following Tokens\n                newToken.endLine = line + fixForEndingInLT;\n                // the last LT in a token does not affect the endColumn either as the [columnStart ... columnEnd)\n                // inclusive to exclusive range.\n                newToken.endColumn = column - 1 + -fixForEndingInLT;\n            }\n            // else single LT in the last character of a token, no need to modify the endLine/EndColumn\n        }\n    }\n    computeNewColumn(oldColumn, imageLength) {\n        return oldColumn + imageLength;\n    }\n    createOffsetOnlyToken(image, startOffset, tokenTypeIdx, tokenType) {\n        return {\n            image,\n            startOffset,\n            tokenTypeIdx,\n            tokenType,\n        };\n    }\n    createStartOnlyToken(image, startOffset, tokenTypeIdx, tokenType, startLine, startColumn) {\n        return {\n            image,\n            startOffset,\n            startLine,\n            startColumn,\n            tokenTypeIdx,\n            tokenType,\n        };\n    }\n    createFullToken(image, startOffset, tokenTypeIdx, tokenType, startLine, startColumn, imageLength) {\n        return {\n            image,\n            startOffset,\n            endOffset: startOffset + imageLength - 1,\n            startLine,\n            endLine: startLine,\n            startColumn,\n            endColumn: startColumn + imageLength - 1,\n            tokenTypeIdx,\n            tokenType,\n        };\n    }\n    addTokenUsingPush(tokenVector, index, tokenToAdd) {\n        tokenVector.push(tokenToAdd);\n        return index;\n    }\n    addTokenUsingMemberAccess(tokenVector, index, tokenToAdd) {\n        tokenVector[index] = tokenToAdd;\n        index++;\n        return index;\n    }\n    handlePayloadNoCustom(token, payload) { }\n    handlePayloadWithCustom(token, payload) {\n        if (payload !== null) {\n            token.payload = payload;\n        }\n    }\n    matchWithTest(pattern, text, offset) {\n        const found = pattern.test(text);\n        if (found === true) {\n            return text.substring(offset, pattern.lastIndex);\n        }\n        return null;\n    }\n    matchWithExec(pattern, text) {\n        const regExpArray = pattern.exec(text);\n        return regExpArray !== null ? regExpArray[0] : null;\n    }\n}\nLexer.SKIPPED = \"This marks a skipped Token pattern, this means each token identified by it will\" +\n    \"be consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.\";\nLexer.NA = /NOT_APPLICABLE/;\n//# sourceMappingURL=lexer_public.js.map","import { has, isString, isUndefined } from \"lodash-es\";\nimport { Lexer } from \"./lexer_public.js\";\nimport { augmentTokenTypes, tokenStructuredMatcher } from \"./tokens.js\";\nexport function tokenLabel(tokType) {\n    if (hasTokenLabel(tokType)) {\n        return tokType.LABEL;\n    }\n    else {\n        return tokType.name;\n    }\n}\nexport function tokenName(tokType) {\n    return tokType.name;\n}\nexport function hasTokenLabel(obj) {\n    return isString(obj.LABEL) && obj.LABEL !== \"\";\n}\nconst PARENT = \"parent\";\nconst CATEGORIES = \"categories\";\nconst LABEL = \"label\";\nconst GROUP = \"group\";\nconst PUSH_MODE = \"push_mode\";\nconst POP_MODE = \"pop_mode\";\nconst LONGER_ALT = \"longer_alt\";\nconst LINE_BREAKS = \"line_breaks\";\nconst START_CHARS_HINT = \"start_chars_hint\";\nexport function createToken(config) {\n    return createTokenInternal(config);\n}\nfunction createTokenInternal(config) {\n    const pattern = config.pattern;\n    const tokenType = {};\n    tokenType.name = config.name;\n    if (!isUndefined(pattern)) {\n        tokenType.PATTERN = pattern;\n    }\n    if (has(config, PARENT)) {\n        throw (\"The parent property is no longer supported.\\n\" +\n            \"See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.\");\n    }\n    if (has(config, CATEGORIES)) {\n        // casting to ANY as this will be fixed inside `augmentTokenTypes``\n        tokenType.CATEGORIES = config[CATEGORIES];\n    }\n    augmentTokenTypes([tokenType]);\n    if (has(config, LABEL)) {\n        tokenType.LABEL = config[LABEL];\n    }\n    if (has(config, GROUP)) {\n        tokenType.GROUP = config[GROUP];\n    }\n    if (has(config, POP_MODE)) {\n        tokenType.POP_MODE = config[POP_MODE];\n    }\n    if (has(config, PUSH_MODE)) {\n        tokenType.PUSH_MODE = config[PUSH_MODE];\n    }\n    if (has(config, LONGER_ALT)) {\n        tokenType.LONGER_ALT = config[LONGER_ALT];\n    }\n    if (has(config, LINE_BREAKS)) {\n        tokenType.LINE_BREAKS = config[LINE_BREAKS];\n    }\n    if (has(config, START_CHARS_HINT)) {\n        tokenType.START_CHARS_HINT = config[START_CHARS_HINT];\n    }\n    return tokenType;\n}\nexport const EOF = createToken({ name: \"EOF\", pattern: Lexer.NA });\naugmentTokenTypes([EOF]);\nexport function createTokenInstance(tokType, image, startOffset, endOffset, startLine, endLine, startColumn, endColumn) {\n    return {\n        image,\n        startOffset,\n        endOffset,\n        startLine,\n        endLine,\n        startColumn,\n        endColumn,\n        tokenTypeIdx: tokType.tokenTypeIdx,\n        tokenType: tokType,\n    };\n}\nexport function tokenMatcher(token, tokType) {\n    return tokenStructuredMatcher(token, tokType);\n}\n//# sourceMappingURL=tokens_public.js.map","import { hasTokenLabel, tokenLabel } from \"../scan/tokens_public.js\";\nimport { first, map, reduce } from \"lodash-es\";\nimport { getProductionDslName, NonTerminal, Rule, Terminal, } from \"@chevrotain/gast\";\nexport const defaultParserErrorProvider = {\n    buildMismatchTokenMessage({ expected, actual, previous, ruleName }) {\n        const hasLabel = hasTokenLabel(expected);\n        const expectedMsg = hasLabel\n            ? `--> ${tokenLabel(expected)} <--`\n            : `token of type --> ${expected.name} <--`;\n        const msg = `Expecting ${expectedMsg} but found --> '${actual.image}' <--`;\n        return msg;\n    },\n    buildNotAllInputParsedMessage({ firstRedundant, ruleName }) {\n        return \"Redundant input, expecting EOF but found: \" + firstRedundant.image;\n    },\n    buildNoViableAltMessage({ expectedPathsPerAlt, actual, previous, customUserDescription, ruleName, }) {\n        const errPrefix = \"Expecting: \";\n        // TODO: issue: No Viable Alternative Error may have incomplete details. #502\n        const actualText = first(actual).image;\n        const errSuffix = \"\\nbut found: '\" + actualText + \"'\";\n        if (customUserDescription) {\n            return errPrefix + customUserDescription + errSuffix;\n        }\n        else {\n            const allLookAheadPaths = reduce(expectedPathsPerAlt, (result, currAltPaths) => result.concat(currAltPaths), []);\n            const nextValidTokenSequences = map(allLookAheadPaths, (currPath) => `[${map(currPath, (currTokenType) => tokenLabel(currTokenType)).join(\", \")}]`);\n            const nextValidSequenceItems = map(nextValidTokenSequences, (itemMsg, idx) => `  ${idx + 1}. ${itemMsg}`);\n            const calculatedDescription = `one of these possible Token sequences:\\n${nextValidSequenceItems.join(\"\\n\")}`;\n            return errPrefix + calculatedDescription + errSuffix;\n        }\n    },\n    buildEarlyExitMessage({ expectedIterationPaths, actual, customUserDescription, ruleName, }) {\n        const errPrefix = \"Expecting: \";\n        // TODO: issue: No Viable Alternative Error may have incomplete details. #502\n        const actualText = first(actual).image;\n        const errSuffix = \"\\nbut found: '\" + actualText + \"'\";\n        if (customUserDescription) {\n            return errPrefix + customUserDescription + errSuffix;\n        }\n        else {\n            const nextValidTokenSequences = map(expectedIterationPaths, (currPath) => `[${map(currPath, (currTokenType) => tokenLabel(currTokenType)).join(\",\")}]`);\n            const calculatedDescription = `expecting at least one iteration which starts with one of these possible Token sequences::\\n  ` +\n                `<${nextValidTokenSequences.join(\" ,\")}>`;\n            return errPrefix + calculatedDescription + errSuffix;\n        }\n    },\n};\nObject.freeze(defaultParserErrorProvider);\nexport const defaultGrammarResolverErrorProvider = {\n    buildRuleNotFoundError(topLevelRule, undefinedRule) {\n        const msg = \"Invalid grammar, reference to a rule which is not defined: ->\" +\n            undefinedRule.nonTerminalName +\n            \"<-\\n\" +\n            \"inside top level rule: ->\" +\n            topLevelRule.name +\n            \"<-\";\n        return msg;\n    },\n};\nexport const defaultGrammarValidatorErrorProvider = {\n    buildDuplicateFoundError(topLevelRule, duplicateProds) {\n        function getExtraProductionArgument(prod) {\n            if (prod instanceof Terminal) {\n                return prod.terminalType.name;\n            }\n            else if (prod instanceof NonTerminal) {\n                return prod.nonTerminalName;\n            }\n            else {\n                return \"\";\n            }\n        }\n        const topLevelName = topLevelRule.name;\n        const duplicateProd = first(duplicateProds);\n        const index = duplicateProd.idx;\n        const dslName = getProductionDslName(duplicateProd);\n        const extraArgument = getExtraProductionArgument(duplicateProd);\n        const hasExplicitIndex = index > 0;\n        let msg = `->${dslName}${hasExplicitIndex ? index : \"\"}<- ${extraArgument ? `with argument: ->${extraArgument}<-` : \"\"}\n                  appears more than once (${duplicateProds.length} times) in the top level rule: ->${topLevelName}<-.                  \n                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES \n                  `;\n        // white space trimming time! better to trim afterwards as it allows to use WELL formatted multi line template strings...\n        msg = msg.replace(/[ \\t]+/g, \" \");\n        msg = msg.replace(/\\s\\s+/g, \"\\n\");\n        return msg;\n    },\n    buildNamespaceConflictError(rule) {\n        const errMsg = `Namespace conflict found in grammar.\\n` +\n            `The grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <${rule.name}>.\\n` +\n            `To resolve this make sure each Terminal and Non-Terminal names are unique\\n` +\n            `This is easy to accomplish by using the convention that Terminal names start with an uppercase letter\\n` +\n            `and Non-Terminal names start with a lower case letter.`;\n        return errMsg;\n    },\n    buildAlternationPrefixAmbiguityError(options) {\n        const pathMsg = map(options.prefixPath, (currTok) => tokenLabel(currTok)).join(\", \");\n        const occurrence = options.alternation.idx === 0 ? \"\" : options.alternation.idx;\n        const errMsg = `Ambiguous alternatives: <${options.ambiguityIndices.join(\" ,\")}> due to common lookahead prefix\\n` +\n            `in <OR${occurrence}> inside <${options.topLevelRule.name}> Rule,\\n` +\n            `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n` +\n            `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX\\n` +\n            `For Further details.`;\n        return errMsg;\n    },\n    buildAlternationAmbiguityError(options) {\n        const pathMsg = map(options.prefixPath, (currtok) => tokenLabel(currtok)).join(\", \");\n        const occurrence = options.alternation.idx === 0 ? \"\" : options.alternation.idx;\n        let currMessage = `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\" ,\")}> in <OR${occurrence}>` +\n            ` inside <${options.topLevelRule.name}> Rule,\\n` +\n            `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n`;\n        currMessage =\n            currMessage +\n                `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\\n` +\n                `For Further details.`;\n        return currMessage;\n    },\n    buildEmptyRepetitionError(options) {\n        let dslName = getProductionDslName(options.repetition);\n        if (options.repetition.idx !== 0) {\n            dslName += options.repetition.idx;\n        }\n        const errMsg = `The repetition <${dslName}> within Rule <${options.topLevelRule.name}> can never consume any tokens.\\n` +\n            `This could lead to an infinite loop.`;\n        return errMsg;\n    },\n    // TODO: remove - `errors_public` from nyc.config.js exclude\n    //       once this method is fully removed from this file\n    buildTokenNameError(options) {\n        /* istanbul ignore next */\n        return \"deprecated\";\n    },\n    buildEmptyAlternationError(options) {\n        const errMsg = `Ambiguous empty alternative: <${options.emptyChoiceIdx + 1}>` +\n            ` in <OR${options.alternation.idx}> inside <${options.topLevelRule.name}> Rule.\\n` +\n            `Only the last alternative may be an empty alternative.`;\n        return errMsg;\n    },\n    buildTooManyAlternativesError(options) {\n        const errMsg = `An Alternation cannot have more than 256 alternatives:\\n` +\n            `<OR${options.alternation.idx}> inside <${options.topLevelRule.name}> Rule.\\n has ${options.alternation.definition.length + 1} alternatives.`;\n        return errMsg;\n    },\n    buildLeftRecursionError(options) {\n        const ruleName = options.topLevelRule.name;\n        const pathNames = map(options.leftRecursionPath, (currRule) => currRule.name);\n        const leftRecursivePath = `${ruleName} --> ${pathNames\n            .concat([ruleName])\n            .join(\" --> \")}`;\n        const errMsg = `Left Recursion found in grammar.\\n` +\n            `rule: <${ruleName}> can be invoked from itself (directly or indirectly)\\n` +\n            `without consuming any Tokens. The grammar path that causes this is: \\n ${leftRecursivePath}\\n` +\n            ` To fix this refactor your grammar to remove the left recursion.\\n` +\n            `see: https://en.wikipedia.org/wiki/LL_parser#Left_factoring.`;\n        return errMsg;\n    },\n    // TODO: remove - `errors_public` from nyc.config.js exclude\n    //       once this method is fully removed from this file\n    buildInvalidRuleNameError(options) {\n        /* istanbul ignore next */\n        return \"deprecated\";\n    },\n    buildDuplicateRuleNameError(options) {\n        let ruleName;\n        if (options.topLevelRule instanceof Rule) {\n            ruleName = options.topLevelRule.name;\n        }\n        else {\n            ruleName = options.topLevelRule;\n        }\n        const errMsg = `Duplicate definition, rule: ->${ruleName}<- is already defined in the grammar: ->${options.grammarName}<-`;\n        return errMsg;\n    },\n};\n//# sourceMappingURL=errors_public.js.map","import { ParserDefinitionErrorType, } from \"../parser/parser.js\";\nimport { forEach, values } from \"lodash-es\";\nimport { GAstVisitor } from \"@chevrotain/gast\";\nexport function resolveGrammar(topLevels, errMsgProvider) {\n    const refResolver = new GastRefResolverVisitor(topLevels, errMsgProvider);\n    refResolver.resolveRefs();\n    return refResolver.errors;\n}\nexport class GastRefResolverVisitor extends GAstVisitor {\n    constructor(nameToTopRule, errMsgProvider) {\n        super();\n        this.nameToTopRule = nameToTopRule;\n        this.errMsgProvider = errMsgProvider;\n        this.errors = [];\n    }\n    resolveRefs() {\n        forEach(values(this.nameToTopRule), (prod) => {\n            this.currTopLevel = prod;\n            prod.accept(this);\n        });\n    }\n    visitNonTerminal(node) {\n        const ref = this.nameToTopRule[node.nonTerminalName];\n        if (!ref) {\n            const msg = this.errMsgProvider.buildRuleNotFoundError(this.currTopLevel, node);\n            this.errors.push({\n                message: msg,\n                type: ParserDefinitionErrorType.UNRESOLVED_SUBRULE_REF,\n                ruleName: this.currTopLevel.name,\n                unresolvedRefName: node.nonTerminalName,\n            });\n        }\n        else {\n            node.referencedRule = ref;\n        }\n    }\n}\n//# sourceMappingURL=resolver.js.map","import { clone, drop, dropRight, first as _first, forEach, isEmpty, last, } from \"lodash-es\";\nimport { first } from \"./first.js\";\nimport { RestWalker } from \"./rest.js\";\nimport { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"@chevrotain/gast\";\nexport class AbstractNextPossibleTokensWalker extends RestWalker {\n    constructor(topProd, path) {\n        super();\n        this.topProd = topProd;\n        this.path = path;\n        this.possibleTokTypes = [];\n        this.nextProductionName = \"\";\n        this.nextProductionOccurrence = 0;\n        this.found = false;\n        this.isAtEndOfPath = false;\n    }\n    startWalking() {\n        this.found = false;\n        if (this.path.ruleStack[0] !== this.topProd.name) {\n            throw Error(\"The path does not start with the walker's top Rule!\");\n        }\n        // immutable for the win\n        this.ruleStack = clone(this.path.ruleStack).reverse(); // intelij bug requires assertion\n        this.occurrenceStack = clone(this.path.occurrenceStack).reverse(); // intelij bug requires assertion\n        // already verified that the first production is valid, we now seek the 2nd production\n        this.ruleStack.pop();\n        this.occurrenceStack.pop();\n        this.updateExpectedNext();\n        this.walk(this.topProd);\n        return this.possibleTokTypes;\n    }\n    walk(prod, prevRest = []) {\n        // stop scanning once we found the path\n        if (!this.found) {\n            super.walk(prod, prevRest);\n        }\n    }\n    walkProdRef(refProd, currRest, prevRest) {\n        // found the next production, need to keep walking in it\n        if (refProd.referencedRule.name === this.nextProductionName &&\n            refProd.idx === this.nextProductionOccurrence) {\n            const fullRest = currRest.concat(prevRest);\n            this.updateExpectedNext();\n            this.walk(refProd.referencedRule, fullRest);\n        }\n    }\n    updateExpectedNext() {\n        // need to consume the Terminal\n        if (isEmpty(this.ruleStack)) {\n            // must reset nextProductionXXX to avoid walking down another Top Level production while what we are\n            // really seeking is the last Terminal...\n            this.nextProductionName = \"\";\n            this.nextProductionOccurrence = 0;\n            this.isAtEndOfPath = true;\n        }\n        else {\n            this.nextProductionName = this.ruleStack.pop();\n            this.nextProductionOccurrence = this.occurrenceStack.pop();\n        }\n    }\n}\nexport class NextAfterTokenWalker extends AbstractNextPossibleTokensWalker {\n    constructor(topProd, path) {\n        super(topProd, path);\n        this.path = path;\n        this.nextTerminalName = \"\";\n        this.nextTerminalOccurrence = 0;\n        this.nextTerminalName = this.path.lastTok.name;\n        this.nextTerminalOccurrence = this.path.lastTokOccurrence;\n    }\n    walkTerminal(terminal, currRest, prevRest) {\n        if (this.isAtEndOfPath &&\n            terminal.terminalType.name === this.nextTerminalName &&\n            terminal.idx === this.nextTerminalOccurrence &&\n            !this.found) {\n            const fullRest = currRest.concat(prevRest);\n            const restProd = new Alternative({ definition: fullRest });\n            this.possibleTokTypes = first(restProd);\n            this.found = true;\n        }\n    }\n}\n/**\n * This walker only \"walks\" a single \"TOP\" level in the Grammar Ast, this means\n * it never \"follows\" production refs\n */\nexport class AbstractNextTerminalAfterProductionWalker extends RestWalker {\n    constructor(topRule, occurrence) {\n        super();\n        this.topRule = topRule;\n        this.occurrence = occurrence;\n        this.result = {\n            token: undefined,\n            occurrence: undefined,\n            isEndOfRule: undefined,\n        };\n    }\n    startWalking() {\n        this.walk(this.topRule);\n        return this.result;\n    }\n}\nexport class NextTerminalAfterManyWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkMany(manyProd, currRest, prevRest) {\n        if (manyProd.idx === this.occurrence) {\n            const firstAfterMany = _first(currRest.concat(prevRest));\n            this.result.isEndOfRule = firstAfterMany === undefined;\n            if (firstAfterMany instanceof Terminal) {\n                this.result.token = firstAfterMany.terminalType;\n                this.result.occurrence = firstAfterMany.idx;\n            }\n        }\n        else {\n            super.walkMany(manyProd, currRest, prevRest);\n        }\n    }\n}\nexport class NextTerminalAfterManySepWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkManySep(manySepProd, currRest, prevRest) {\n        if (manySepProd.idx === this.occurrence) {\n            const firstAfterManySep = _first(currRest.concat(prevRest));\n            this.result.isEndOfRule = firstAfterManySep === undefined;\n            if (firstAfterManySep instanceof Terminal) {\n                this.result.token = firstAfterManySep.terminalType;\n                this.result.occurrence = firstAfterManySep.idx;\n            }\n        }\n        else {\n            super.walkManySep(manySepProd, currRest, prevRest);\n        }\n    }\n}\nexport class NextTerminalAfterAtLeastOneWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkAtLeastOne(atLeastOneProd, currRest, prevRest) {\n        if (atLeastOneProd.idx === this.occurrence) {\n            const firstAfterAtLeastOne = _first(currRest.concat(prevRest));\n            this.result.isEndOfRule = firstAfterAtLeastOne === undefined;\n            if (firstAfterAtLeastOne instanceof Terminal) {\n                this.result.token = firstAfterAtLeastOne.terminalType;\n                this.result.occurrence = firstAfterAtLeastOne.idx;\n            }\n        }\n        else {\n            super.walkAtLeastOne(atLeastOneProd, currRest, prevRest);\n        }\n    }\n}\n// TODO: reduce code duplication in the AfterWalkers\nexport class NextTerminalAfterAtLeastOneSepWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkAtLeastOneSep(atleastOneSepProd, currRest, prevRest) {\n        if (atleastOneSepProd.idx === this.occurrence) {\n            const firstAfterfirstAfterAtLeastOneSep = _first(currRest.concat(prevRest));\n            this.result.isEndOfRule = firstAfterfirstAfterAtLeastOneSep === undefined;\n            if (firstAfterfirstAfterAtLeastOneSep instanceof Terminal) {\n                this.result.token = firstAfterfirstAfterAtLeastOneSep.terminalType;\n                this.result.occurrence = firstAfterfirstAfterAtLeastOneSep.idx;\n            }\n        }\n        else {\n            super.walkAtLeastOneSep(atleastOneSepProd, currRest, prevRest);\n        }\n    }\n}\nexport function possiblePathsFrom(targetDef, maxLength, currPath = []) {\n    // avoid side effects\n    currPath = clone(currPath);\n    let result = [];\n    let i = 0;\n    // TODO: avoid inner funcs\n    function remainingPathWith(nextDef) {\n        return nextDef.concat(drop(targetDef, i + 1));\n    }\n    // TODO: avoid inner funcs\n    function getAlternativesForProd(definition) {\n        const alternatives = possiblePathsFrom(remainingPathWith(definition), maxLength, currPath);\n        return result.concat(alternatives);\n    }\n    /**\n     * Mandatory productions will halt the loop as the paths computed from their recursive calls will already contain the\n     * following (rest) of the targetDef.\n     *\n     * For optional productions (Option/Repetition/...) the loop will continue to represent the paths that do not include the\n     * the optional production.\n     */\n    while (currPath.length < maxLength && i < targetDef.length) {\n        const prod = targetDef[i];\n        /* istanbul ignore else */\n        if (prod instanceof Alternative) {\n            return getAlternativesForProd(prod.definition);\n        }\n        else if (prod instanceof NonTerminal) {\n            return getAlternativesForProd(prod.definition);\n        }\n        else if (prod instanceof Option) {\n            result = getAlternativesForProd(prod.definition);\n        }\n        else if (prod instanceof RepetitionMandatory) {\n            const newDef = prod.definition.concat([\n                new Repetition({\n                    definition: prod.definition,\n                }),\n            ]);\n            return getAlternativesForProd(newDef);\n        }\n        else if (prod instanceof RepetitionMandatoryWithSeparator) {\n            const newDef = [\n                new Alternative({ definition: prod.definition }),\n                new Repetition({\n                    definition: [new Terminal({ terminalType: prod.separator })].concat(prod.definition),\n                }),\n            ];\n            return getAlternativesForProd(newDef);\n        }\n        else if (prod instanceof RepetitionWithSeparator) {\n            const newDef = prod.definition.concat([\n                new Repetition({\n                    definition: [new Terminal({ terminalType: prod.separator })].concat(prod.definition),\n                }),\n            ]);\n            result = getAlternativesForProd(newDef);\n        }\n        else if (prod instanceof Repetition) {\n            const newDef = prod.definition.concat([\n                new Repetition({\n                    definition: prod.definition,\n                }),\n            ]);\n            result = getAlternativesForProd(newDef);\n        }\n        else if (prod instanceof Alternation) {\n            forEach(prod.definition, (currAlt) => {\n                // TODO: this is a limited check for empty alternatives\n                //   It would prevent a common case of infinite loops during parser initialization.\n                //   However **in-directly** empty alternatives may still cause issues.\n                if (isEmpty(currAlt.definition) === false) {\n                    result = getAlternativesForProd(currAlt.definition);\n                }\n            });\n            return result;\n        }\n        else if (prod instanceof Terminal) {\n            currPath.push(prod.terminalType);\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n        i++;\n    }\n    result.push({\n        partialPath: currPath,\n        suffixDef: drop(targetDef, i),\n    });\n    return result;\n}\nexport function nextPossibleTokensAfter(initialDef, tokenVector, tokMatcher, maxLookAhead) {\n    const EXIT_NON_TERMINAL = \"EXIT_NONE_TERMINAL\";\n    // to avoid creating a new Array each time.\n    const EXIT_NON_TERMINAL_ARR = [EXIT_NON_TERMINAL];\n    const EXIT_ALTERNATIVE = \"EXIT_ALTERNATIVE\";\n    let foundCompletePath = false;\n    const tokenVectorLength = tokenVector.length;\n    const minimalAlternativesIndex = tokenVectorLength - maxLookAhead - 1;\n    const result = [];\n    const possiblePaths = [];\n    possiblePaths.push({\n        idx: -1,\n        def: initialDef,\n        ruleStack: [],\n        occurrenceStack: [],\n    });\n    while (!isEmpty(possiblePaths)) {\n        const currPath = possiblePaths.pop();\n        // skip alternatives if no more results can be found (assuming deterministic grammar with fixed lookahead)\n        if (currPath === EXIT_ALTERNATIVE) {\n            if (foundCompletePath &&\n                last(possiblePaths).idx <= minimalAlternativesIndex) {\n                // remove irrelevant alternative\n                possiblePaths.pop();\n            }\n            continue;\n        }\n        const currDef = currPath.def;\n        const currIdx = currPath.idx;\n        const currRuleStack = currPath.ruleStack;\n        const currOccurrenceStack = currPath.occurrenceStack;\n        // For Example: an empty path could exist in a valid grammar in the case of an EMPTY_ALT\n        if (isEmpty(currDef)) {\n            continue;\n        }\n        const prod = currDef[0];\n        /* istanbul ignore else */\n        if (prod === EXIT_NON_TERMINAL) {\n            const nextPath = {\n                idx: currIdx,\n                def: drop(currDef),\n                ruleStack: dropRight(currRuleStack),\n                occurrenceStack: dropRight(currOccurrenceStack),\n            };\n            possiblePaths.push(nextPath);\n        }\n        else if (prod instanceof Terminal) {\n            /* istanbul ignore else */\n            if (currIdx < tokenVectorLength - 1) {\n                const nextIdx = currIdx + 1;\n                const actualToken = tokenVector[nextIdx];\n                if (tokMatcher(actualToken, prod.terminalType)) {\n                    const nextPath = {\n                        idx: nextIdx,\n                        def: drop(currDef),\n                        ruleStack: currRuleStack,\n                        occurrenceStack: currOccurrenceStack,\n                    };\n                    possiblePaths.push(nextPath);\n                }\n                // end of the line\n            }\n            else if (currIdx === tokenVectorLength - 1) {\n                // IGNORE ABOVE ELSE\n                result.push({\n                    nextTokenType: prod.terminalType,\n                    nextTokenOccurrence: prod.idx,\n                    ruleStack: currRuleStack,\n                    occurrenceStack: currOccurrenceStack,\n                });\n                foundCompletePath = true;\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        }\n        else if (prod instanceof NonTerminal) {\n            const newRuleStack = clone(currRuleStack);\n            newRuleStack.push(prod.nonTerminalName);\n            const newOccurrenceStack = clone(currOccurrenceStack);\n            newOccurrenceStack.push(prod.idx);\n            const nextPath = {\n                idx: currIdx,\n                def: prod.definition.concat(EXIT_NON_TERMINAL_ARR, drop(currDef)),\n                ruleStack: newRuleStack,\n                occurrenceStack: newOccurrenceStack,\n            };\n            possiblePaths.push(nextPath);\n        }\n        else if (prod instanceof Option) {\n            // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n            const nextPathWithout = {\n                idx: currIdx,\n                def: drop(currDef),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWithout);\n            // required marker to avoid backtracking paths whose higher priority alternatives already matched\n            possiblePaths.push(EXIT_ALTERNATIVE);\n            const nextPathWith = {\n                idx: currIdx,\n                def: prod.definition.concat(drop(currDef)),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWith);\n        }\n        else if (prod instanceof RepetitionMandatory) {\n            // TODO:(THE NEW operators here take a while...) (convert once?)\n            const secondIteration = new Repetition({\n                definition: prod.definition,\n                idx: prod.idx,\n            });\n            const nextDef = prod.definition.concat([secondIteration], drop(currDef));\n            const nextPath = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPath);\n        }\n        else if (prod instanceof RepetitionMandatoryWithSeparator) {\n            // TODO:(THE NEW operators here take a while...) (convert once?)\n            const separatorGast = new Terminal({\n                terminalType: prod.separator,\n            });\n            const secondIteration = new Repetition({\n                definition: [separatorGast].concat(prod.definition),\n                idx: prod.idx,\n            });\n            const nextDef = prod.definition.concat([secondIteration], drop(currDef));\n            const nextPath = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPath);\n        }\n        else if (prod instanceof RepetitionWithSeparator) {\n            // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n            const nextPathWithout = {\n                idx: currIdx,\n                def: drop(currDef),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWithout);\n            // required marker to avoid backtracking paths whose higher priority alternatives already matched\n            possiblePaths.push(EXIT_ALTERNATIVE);\n            const separatorGast = new Terminal({\n                terminalType: prod.separator,\n            });\n            const nthRepetition = new Repetition({\n                definition: [separatorGast].concat(prod.definition),\n                idx: prod.idx,\n            });\n            const nextDef = prod.definition.concat([nthRepetition], drop(currDef));\n            const nextPathWith = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWith);\n        }\n        else if (prod instanceof Repetition) {\n            // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n            const nextPathWithout = {\n                idx: currIdx,\n                def: drop(currDef),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWithout);\n            // required marker to avoid backtracking paths whose higher priority alternatives already matched\n            possiblePaths.push(EXIT_ALTERNATIVE);\n            // TODO: an empty repetition will cause infinite loops here, will the parser detect this in selfAnalysis?\n            const nthRepetition = new Repetition({\n                definition: prod.definition,\n                idx: prod.idx,\n            });\n            const nextDef = prod.definition.concat([nthRepetition], drop(currDef));\n            const nextPathWith = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWith);\n        }\n        else if (prod instanceof Alternation) {\n            // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n            for (let i = prod.definition.length - 1; i >= 0; i--) {\n                const currAlt = prod.definition[i];\n                const currAltPath = {\n                    idx: currIdx,\n                    def: currAlt.definition.concat(drop(currDef)),\n                    ruleStack: currRuleStack,\n                    occurrenceStack: currOccurrenceStack,\n                };\n                possiblePaths.push(currAltPath);\n                possiblePaths.push(EXIT_ALTERNATIVE);\n            }\n        }\n        else if (prod instanceof Alternative) {\n            possiblePaths.push({\n                idx: currIdx,\n                def: prod.definition.concat(drop(currDef)),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            });\n        }\n        else if (prod instanceof Rule) {\n            // last because we should only encounter at most a single one of these per invocation.\n            possiblePaths.push(expandTopLevelRule(prod, currIdx, currRuleStack, currOccurrenceStack));\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n    }\n    return result;\n}\nfunction expandTopLevelRule(topRule, currIdx, currRuleStack, currOccurrenceStack) {\n    const newRuleStack = clone(currRuleStack);\n    newRuleStack.push(topRule.name);\n    const newCurrOccurrenceStack = clone(currOccurrenceStack);\n    // top rule is always assumed to have been called with occurrence index 1\n    newCurrOccurrenceStack.push(1);\n    return {\n        idx: currIdx,\n        def: topRule.definition,\n        ruleStack: newRuleStack,\n        occurrenceStack: newCurrOccurrenceStack,\n    };\n}\n//# sourceMappingURL=interpreter.js.map","import { every, flatten, forEach, has, isEmpty, map, reduce } from \"lodash-es\";\nimport { possiblePathsFrom } from \"./interpreter.js\";\nimport { RestWalker } from \"./rest.js\";\nimport { tokenStructuredMatcher, tokenStructuredMatcherNoCategories, } from \"../../scan/tokens.js\";\nimport { Alternation, Alternative as AlternativeGAST, GAstVisitor, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, } from \"@chevrotain/gast\";\nexport var PROD_TYPE;\n(function (PROD_TYPE) {\n    PROD_TYPE[PROD_TYPE[\"OPTION\"] = 0] = \"OPTION\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION\"] = 1] = \"REPETITION\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION_MANDATORY\"] = 2] = \"REPETITION_MANDATORY\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION_MANDATORY_WITH_SEPARATOR\"] = 3] = \"REPETITION_MANDATORY_WITH_SEPARATOR\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION_WITH_SEPARATOR\"] = 4] = \"REPETITION_WITH_SEPARATOR\";\n    PROD_TYPE[PROD_TYPE[\"ALTERNATION\"] = 5] = \"ALTERNATION\";\n})(PROD_TYPE || (PROD_TYPE = {}));\nexport function getProdType(prod) {\n    /* istanbul ignore else */\n    if (prod instanceof Option || prod === \"Option\") {\n        return PROD_TYPE.OPTION;\n    }\n    else if (prod instanceof Repetition || prod === \"Repetition\") {\n        return PROD_TYPE.REPETITION;\n    }\n    else if (prod instanceof RepetitionMandatory ||\n        prod === \"RepetitionMandatory\") {\n        return PROD_TYPE.REPETITION_MANDATORY;\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator ||\n        prod === \"RepetitionMandatoryWithSeparator\") {\n        return PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR;\n    }\n    else if (prod instanceof RepetitionWithSeparator ||\n        prod === \"RepetitionWithSeparator\") {\n        return PROD_TYPE.REPETITION_WITH_SEPARATOR;\n    }\n    else if (prod instanceof Alternation || prod === \"Alternation\") {\n        return PROD_TYPE.ALTERNATION;\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nexport function getLookaheadPaths(options) {\n    const { occurrence, rule, prodType, maxLookahead } = options;\n    const type = getProdType(prodType);\n    if (type === PROD_TYPE.ALTERNATION) {\n        return getLookaheadPathsForOr(occurrence, rule, maxLookahead);\n    }\n    else {\n        return getLookaheadPathsForOptionalProd(occurrence, rule, type, maxLookahead);\n    }\n}\nexport function buildLookaheadFuncForOr(occurrence, ruleGrammar, maxLookahead, hasPredicates, dynamicTokensEnabled, laFuncBuilder) {\n    const lookAheadPaths = getLookaheadPathsForOr(occurrence, ruleGrammar, maxLookahead);\n    const tokenMatcher = areTokenCategoriesNotUsed(lookAheadPaths)\n        ? tokenStructuredMatcherNoCategories\n        : tokenStructuredMatcher;\n    return laFuncBuilder(lookAheadPaths, hasPredicates, tokenMatcher, dynamicTokensEnabled);\n}\n/**\n *  When dealing with an Optional production (OPTION/MANY/2nd iteration of AT_LEAST_ONE/...) we need to compare\n *  the lookahead \"inside\" the production and the lookahead immediately \"after\" it in the same top level rule (context free).\n *\n *  Example: given a production:\n *  ABC(DE)?DF\n *\n *  The optional '(DE)?' should only be entered if we see 'DE'. a single Token 'D' is not sufficient to distinguish between the two\n *  alternatives.\n *\n *  @returns A Lookahead function which will return true IFF the parser should parse the Optional production.\n */\nexport function buildLookaheadFuncForOptionalProd(occurrence, ruleGrammar, k, dynamicTokensEnabled, prodType, lookaheadBuilder) {\n    const lookAheadPaths = getLookaheadPathsForOptionalProd(occurrence, ruleGrammar, prodType, k);\n    const tokenMatcher = areTokenCategoriesNotUsed(lookAheadPaths)\n        ? tokenStructuredMatcherNoCategories\n        : tokenStructuredMatcher;\n    return lookaheadBuilder(lookAheadPaths[0], tokenMatcher, dynamicTokensEnabled);\n}\nexport function buildAlternativesLookAheadFunc(alts, hasPredicates, tokenMatcher, dynamicTokensEnabled) {\n    const numOfAlts = alts.length;\n    const areAllOneTokenLookahead = every(alts, (currAlt) => {\n        return every(currAlt, (currPath) => {\n            return currPath.length === 1;\n        });\n    });\n    // This version takes into account the predicates as well.\n    if (hasPredicates) {\n        /**\n         * @returns {number} - The chosen alternative index\n         */\n        return function (orAlts) {\n            // unfortunately the predicates must be extracted every single time\n            // as they cannot be cached due to references to parameters(vars) which are no longer valid.\n            // note that in the common case of no predicates, no cpu time will be wasted on this (see else block)\n            const predicates = map(orAlts, (currAlt) => currAlt.GATE);\n            for (let t = 0; t < numOfAlts; t++) {\n                const currAlt = alts[t];\n                const currNumOfPaths = currAlt.length;\n                const currPredicate = predicates[t];\n                if (currPredicate !== undefined && currPredicate.call(this) === false) {\n                    // if the predicate does not match there is no point in checking the paths\n                    continue;\n                }\n                nextPath: for (let j = 0; j < currNumOfPaths; j++) {\n                    const currPath = currAlt[j];\n                    const currPathLength = currPath.length;\n                    for (let i = 0; i < currPathLength; i++) {\n                        const nextToken = this.LA(i + 1);\n                        if (tokenMatcher(nextToken, currPath[i]) === false) {\n                            // mismatch in current path\n                            // try the next pth\n                            continue nextPath;\n                        }\n                    }\n                    // found a full path that matches.\n                    // this will also work for an empty ALT as the loop will be skipped\n                    return t;\n                }\n                // none of the paths for the current alternative matched\n                // try the next alternative\n            }\n            // none of the alternatives could be matched\n            return undefined;\n        };\n    }\n    else if (areAllOneTokenLookahead && !dynamicTokensEnabled) {\n        // optimized (common) case of all the lookaheads paths requiring only\n        // a single token lookahead. These Optimizations cannot work if dynamically defined Tokens are used.\n        const singleTokenAlts = map(alts, (currAlt) => {\n            return flatten(currAlt);\n        });\n        const choiceToAlt = reduce(singleTokenAlts, (result, currAlt, idx) => {\n            forEach(currAlt, (currTokType) => {\n                if (!has(result, currTokType.tokenTypeIdx)) {\n                    result[currTokType.tokenTypeIdx] = idx;\n                }\n                forEach(currTokType.categoryMatches, (currExtendingType) => {\n                    if (!has(result, currExtendingType)) {\n                        result[currExtendingType] = idx;\n                    }\n                });\n            });\n            return result;\n        }, {});\n        /**\n         * @returns {number} - The chosen alternative index\n         */\n        return function () {\n            const nextToken = this.LA(1);\n            return choiceToAlt[nextToken.tokenTypeIdx];\n        };\n    }\n    else {\n        // optimized lookahead without needing to check the predicates at all.\n        // this causes code duplication which is intentional to improve performance.\n        /**\n         * @returns {number} - The chosen alternative index\n         */\n        return function () {\n            for (let t = 0; t < numOfAlts; t++) {\n                const currAlt = alts[t];\n                const currNumOfPaths = currAlt.length;\n                nextPath: for (let j = 0; j < currNumOfPaths; j++) {\n                    const currPath = currAlt[j];\n                    const currPathLength = currPath.length;\n                    for (let i = 0; i < currPathLength; i++) {\n                        const nextToken = this.LA(i + 1);\n                        if (tokenMatcher(nextToken, currPath[i]) === false) {\n                            // mismatch in current path\n                            // try the next pth\n                            continue nextPath;\n                        }\n                    }\n                    // found a full path that matches.\n                    // this will also work for an empty ALT as the loop will be skipped\n                    return t;\n                }\n                // none of the paths for the current alternative matched\n                // try the next alternative\n            }\n            // none of the alternatives could be matched\n            return undefined;\n        };\n    }\n}\nexport function buildSingleAlternativeLookaheadFunction(alt, tokenMatcher, dynamicTokensEnabled) {\n    const areAllOneTokenLookahead = every(alt, (currPath) => {\n        return currPath.length === 1;\n    });\n    const numOfPaths = alt.length;\n    // optimized (common) case of all the lookaheads paths requiring only\n    // a single token lookahead.\n    if (areAllOneTokenLookahead && !dynamicTokensEnabled) {\n        const singleTokensTypes = flatten(alt);\n        if (singleTokensTypes.length === 1 &&\n            isEmpty(singleTokensTypes[0].categoryMatches)) {\n            const expectedTokenType = singleTokensTypes[0];\n            const expectedTokenUniqueKey = expectedTokenType.tokenTypeIdx;\n            return function () {\n                return this.LA(1).tokenTypeIdx === expectedTokenUniqueKey;\n            };\n        }\n        else {\n            const choiceToAlt = reduce(singleTokensTypes, (result, currTokType, idx) => {\n                result[currTokType.tokenTypeIdx] = true;\n                forEach(currTokType.categoryMatches, (currExtendingType) => {\n                    result[currExtendingType] = true;\n                });\n                return result;\n            }, []);\n            return function () {\n                const nextToken = this.LA(1);\n                return choiceToAlt[nextToken.tokenTypeIdx] === true;\n            };\n        }\n    }\n    else {\n        return function () {\n            nextPath: for (let j = 0; j < numOfPaths; j++) {\n                const currPath = alt[j];\n                const currPathLength = currPath.length;\n                for (let i = 0; i < currPathLength; i++) {\n                    const nextToken = this.LA(i + 1);\n                    if (tokenMatcher(nextToken, currPath[i]) === false) {\n                        // mismatch in current path\n                        // try the next pth\n                        continue nextPath;\n                    }\n                }\n                // found a full path that matches.\n                return true;\n            }\n            // none of the paths matched\n            return false;\n        };\n    }\n}\nclass RestDefinitionFinderWalker extends RestWalker {\n    constructor(topProd, targetOccurrence, targetProdType) {\n        super();\n        this.topProd = topProd;\n        this.targetOccurrence = targetOccurrence;\n        this.targetProdType = targetProdType;\n    }\n    startWalking() {\n        this.walk(this.topProd);\n        return this.restDef;\n    }\n    checkIsTarget(node, expectedProdType, currRest, prevRest) {\n        if (node.idx === this.targetOccurrence &&\n            this.targetProdType === expectedProdType) {\n            this.restDef = currRest.concat(prevRest);\n            return true;\n        }\n        // performance optimization, do not iterate over the entire Grammar ast after we have found the target\n        return false;\n    }\n    walkOption(optionProd, currRest, prevRest) {\n        if (!this.checkIsTarget(optionProd, PROD_TYPE.OPTION, currRest, prevRest)) {\n            super.walkOption(optionProd, currRest, prevRest);\n        }\n    }\n    walkAtLeastOne(atLeastOneProd, currRest, prevRest) {\n        if (!this.checkIsTarget(atLeastOneProd, PROD_TYPE.REPETITION_MANDATORY, currRest, prevRest)) {\n            super.walkOption(atLeastOneProd, currRest, prevRest);\n        }\n    }\n    walkAtLeastOneSep(atLeastOneSepProd, currRest, prevRest) {\n        if (!this.checkIsTarget(atLeastOneSepProd, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, currRest, prevRest)) {\n            super.walkOption(atLeastOneSepProd, currRest, prevRest);\n        }\n    }\n    walkMany(manyProd, currRest, prevRest) {\n        if (!this.checkIsTarget(manyProd, PROD_TYPE.REPETITION, currRest, prevRest)) {\n            super.walkOption(manyProd, currRest, prevRest);\n        }\n    }\n    walkManySep(manySepProd, currRest, prevRest) {\n        if (!this.checkIsTarget(manySepProd, PROD_TYPE.REPETITION_WITH_SEPARATOR, currRest, prevRest)) {\n            super.walkOption(manySepProd, currRest, prevRest);\n        }\n    }\n}\n/**\n * Returns the definition of a target production in a top level level rule.\n */\nclass InsideDefinitionFinderVisitor extends GAstVisitor {\n    constructor(targetOccurrence, targetProdType, targetRef) {\n        super();\n        this.targetOccurrence = targetOccurrence;\n        this.targetProdType = targetProdType;\n        this.targetRef = targetRef;\n        this.result = [];\n    }\n    checkIsTarget(node, expectedProdName) {\n        if (node.idx === this.targetOccurrence &&\n            this.targetProdType === expectedProdName &&\n            (this.targetRef === undefined || node === this.targetRef)) {\n            this.result = node.definition;\n        }\n    }\n    visitOption(node) {\n        this.checkIsTarget(node, PROD_TYPE.OPTION);\n    }\n    visitRepetition(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION);\n    }\n    visitRepetitionMandatory(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION_MANDATORY);\n    }\n    visitRepetitionMandatoryWithSeparator(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR);\n    }\n    visitRepetitionWithSeparator(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION_WITH_SEPARATOR);\n    }\n    visitAlternation(node) {\n        this.checkIsTarget(node, PROD_TYPE.ALTERNATION);\n    }\n}\nfunction initializeArrayOfArrays(size) {\n    const result = new Array(size);\n    for (let i = 0; i < size; i++) {\n        result[i] = [];\n    }\n    return result;\n}\n/**\n * A sort of hash function between a Path in the grammar and a string.\n * Note that this returns multiple \"hashes\" to support the scenario of token categories.\n * -  A single path with categories may match multiple **actual** paths.\n */\nfunction pathToHashKeys(path) {\n    let keys = [\"\"];\n    for (let i = 0; i < path.length; i++) {\n        const tokType = path[i];\n        const longerKeys = [];\n        for (let j = 0; j < keys.length; j++) {\n            const currShorterKey = keys[j];\n            longerKeys.push(currShorterKey + \"_\" + tokType.tokenTypeIdx);\n            for (let t = 0; t < tokType.categoryMatches.length; t++) {\n                const categoriesKeySuffix = \"_\" + tokType.categoryMatches[t];\n                longerKeys.push(currShorterKey + categoriesKeySuffix);\n            }\n        }\n        keys = longerKeys;\n    }\n    return keys;\n}\n/**\n * Imperative style due to being called from a hot spot\n */\nfunction isUniquePrefixHash(altKnownPathsKeys, searchPathKeys, idx) {\n    for (let currAltIdx = 0; currAltIdx < altKnownPathsKeys.length; currAltIdx++) {\n        // We only want to test vs the other alternatives\n        if (currAltIdx === idx) {\n            continue;\n        }\n        const otherAltKnownPathsKeys = altKnownPathsKeys[currAltIdx];\n        for (let searchIdx = 0; searchIdx < searchPathKeys.length; searchIdx++) {\n            const searchKey = searchPathKeys[searchIdx];\n            if (otherAltKnownPathsKeys[searchKey] === true) {\n                return false;\n            }\n        }\n    }\n    // None of the SearchPathKeys were found in any of the other alternatives\n    return true;\n}\nexport function lookAheadSequenceFromAlternatives(altsDefs, k) {\n    const partialAlts = map(altsDefs, (currAlt) => possiblePathsFrom([currAlt], 1));\n    const finalResult = initializeArrayOfArrays(partialAlts.length);\n    const altsHashes = map(partialAlts, (currAltPaths) => {\n        const dict = {};\n        forEach(currAltPaths, (item) => {\n            const keys = pathToHashKeys(item.partialPath);\n            forEach(keys, (currKey) => {\n                dict[currKey] = true;\n            });\n        });\n        return dict;\n    });\n    let newData = partialAlts;\n    // maxLookahead loop\n    for (let pathLength = 1; pathLength <= k; pathLength++) {\n        const currDataset = newData;\n        newData = initializeArrayOfArrays(currDataset.length);\n        // alternatives loop\n        for (let altIdx = 0; altIdx < currDataset.length; altIdx++) {\n            const currAltPathsAndSuffixes = currDataset[altIdx];\n            // paths in current alternative loop\n            for (let currPathIdx = 0; currPathIdx < currAltPathsAndSuffixes.length; currPathIdx++) {\n                const currPathPrefix = currAltPathsAndSuffixes[currPathIdx].partialPath;\n                const suffixDef = currAltPathsAndSuffixes[currPathIdx].suffixDef;\n                const prefixKeys = pathToHashKeys(currPathPrefix);\n                const isUnique = isUniquePrefixHash(altsHashes, prefixKeys, altIdx);\n                // End of the line for this path.\n                if (isUnique || isEmpty(suffixDef) || currPathPrefix.length === k) {\n                    const currAltResult = finalResult[altIdx];\n                    // TODO: Can we implement a containsPath using Maps/Dictionaries?\n                    if (containsPath(currAltResult, currPathPrefix) === false) {\n                        currAltResult.push(currPathPrefix);\n                        // Update all new  keys for the current path.\n                        for (let j = 0; j < prefixKeys.length; j++) {\n                            const currKey = prefixKeys[j];\n                            altsHashes[altIdx][currKey] = true;\n                        }\n                    }\n                }\n                // Expand longer paths\n                else {\n                    const newPartialPathsAndSuffixes = possiblePathsFrom(suffixDef, pathLength + 1, currPathPrefix);\n                    newData[altIdx] = newData[altIdx].concat(newPartialPathsAndSuffixes);\n                    // Update keys for new known paths\n                    forEach(newPartialPathsAndSuffixes, (item) => {\n                        const prefixKeys = pathToHashKeys(item.partialPath);\n                        forEach(prefixKeys, (key) => {\n                            altsHashes[altIdx][key] = true;\n                        });\n                    });\n                }\n            }\n        }\n    }\n    return finalResult;\n}\nexport function getLookaheadPathsForOr(occurrence, ruleGrammar, k, orProd) {\n    const visitor = new InsideDefinitionFinderVisitor(occurrence, PROD_TYPE.ALTERNATION, orProd);\n    ruleGrammar.accept(visitor);\n    return lookAheadSequenceFromAlternatives(visitor.result, k);\n}\nexport function getLookaheadPathsForOptionalProd(occurrence, ruleGrammar, prodType, k) {\n    const insideDefVisitor = new InsideDefinitionFinderVisitor(occurrence, prodType);\n    ruleGrammar.accept(insideDefVisitor);\n    const insideDef = insideDefVisitor.result;\n    const afterDefWalker = new RestDefinitionFinderWalker(ruleGrammar, occurrence, prodType);\n    const afterDef = afterDefWalker.startWalking();\n    const insideFlat = new AlternativeGAST({ definition: insideDef });\n    const afterFlat = new AlternativeGAST({ definition: afterDef });\n    return lookAheadSequenceFromAlternatives([insideFlat, afterFlat], k);\n}\nexport function containsPath(alternative, searchPath) {\n    compareOtherPath: for (let i = 0; i < alternative.length; i++) {\n        const otherPath = alternative[i];\n        if (otherPath.length !== searchPath.length) {\n            continue;\n        }\n        for (let j = 0; j < otherPath.length; j++) {\n            const searchTok = searchPath[j];\n            const otherTok = otherPath[j];\n            const matchingTokens = searchTok === otherTok ||\n                otherTok.categoryMatchesMap[searchTok.tokenTypeIdx] !== undefined;\n            if (matchingTokens === false) {\n                continue compareOtherPath;\n            }\n        }\n        return true;\n    }\n    return false;\n}\nexport function isStrictPrefixOfPath(prefix, other) {\n    return (prefix.length < other.length &&\n        every(prefix, (tokType, idx) => {\n            const otherTokType = other[idx];\n            return (tokType === otherTokType ||\n                otherTokType.categoryMatchesMap[tokType.tokenTypeIdx]);\n        }));\n}\nexport function areTokenCategoriesNotUsed(lookAheadPaths) {\n    return every(lookAheadPaths, (singleAltPaths) => every(singleAltPaths, (singlePath) => every(singlePath, (token) => isEmpty(token.categoryMatches))));\n}\n//# sourceMappingURL=lookahead.js.map","import { clone, compact, difference, drop, dropRight, filter, first, flatMap, flatten, forEach, groupBy, includes, isEmpty, map, pickBy, reduce, reject, values, } from \"lodash-es\";\nimport { ParserDefinitionErrorType, } from \"../parser/parser.js\";\nimport { Alternation, Alternative as AlternativeGAST, GAstVisitor, getProductionDslName, isOptionalProd, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Terminal, } from \"@chevrotain/gast\";\nimport { containsPath, getLookaheadPathsForOptionalProd, getLookaheadPathsForOr, getProdType, isStrictPrefixOfPath, } from \"./lookahead.js\";\nimport { nextPossibleTokensAfter } from \"./interpreter.js\";\nimport { tokenStructuredMatcher } from \"../../scan/tokens.js\";\nexport function validateLookahead(options) {\n    const lookaheadValidationErrorMessages = options.lookaheadStrategy.validate({\n        rules: options.rules,\n        tokenTypes: options.tokenTypes,\n        grammarName: options.grammarName,\n    });\n    return map(lookaheadValidationErrorMessages, (errorMessage) => (Object.assign({ type: ParserDefinitionErrorType.CUSTOM_LOOKAHEAD_VALIDATION }, errorMessage)));\n}\nexport function validateGrammar(topLevels, tokenTypes, errMsgProvider, grammarName) {\n    const duplicateErrors = flatMap(topLevels, (currTopLevel) => validateDuplicateProductions(currTopLevel, errMsgProvider));\n    const termsNamespaceConflictErrors = checkTerminalAndNoneTerminalsNameSpace(topLevels, tokenTypes, errMsgProvider);\n    const tooManyAltsErrors = flatMap(topLevels, (curRule) => validateTooManyAlts(curRule, errMsgProvider));\n    const duplicateRulesError = flatMap(topLevels, (curRule) => validateRuleDoesNotAlreadyExist(curRule, topLevels, grammarName, errMsgProvider));\n    return duplicateErrors.concat(termsNamespaceConflictErrors, tooManyAltsErrors, duplicateRulesError);\n}\nfunction validateDuplicateProductions(topLevelRule, errMsgProvider) {\n    const collectorVisitor = new OccurrenceValidationCollector();\n    topLevelRule.accept(collectorVisitor);\n    const allRuleProductions = collectorVisitor.allProductions;\n    const productionGroups = groupBy(allRuleProductions, identifyProductionForDuplicates);\n    const duplicates = pickBy(productionGroups, (currGroup) => {\n        return currGroup.length > 1;\n    });\n    const errors = map(values(duplicates), (currDuplicates) => {\n        const firstProd = first(currDuplicates);\n        const msg = errMsgProvider.buildDuplicateFoundError(topLevelRule, currDuplicates);\n        const dslName = getProductionDslName(firstProd);\n        const defError = {\n            message: msg,\n            type: ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,\n            ruleName: topLevelRule.name,\n            dslName: dslName,\n            occurrence: firstProd.idx,\n        };\n        const param = getExtraProductionArgument(firstProd);\n        if (param) {\n            defError.parameter = param;\n        }\n        return defError;\n    });\n    return errors;\n}\nexport function identifyProductionForDuplicates(prod) {\n    return `${getProductionDslName(prod)}_#_${prod.idx}_#_${getExtraProductionArgument(prod)}`;\n}\nfunction getExtraProductionArgument(prod) {\n    if (prod instanceof Terminal) {\n        return prod.terminalType.name;\n    }\n    else if (prod instanceof NonTerminal) {\n        return prod.nonTerminalName;\n    }\n    else {\n        return \"\";\n    }\n}\nexport class OccurrenceValidationCollector extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.allProductions = [];\n    }\n    visitNonTerminal(subrule) {\n        this.allProductions.push(subrule);\n    }\n    visitOption(option) {\n        this.allProductions.push(option);\n    }\n    visitRepetitionWithSeparator(manySep) {\n        this.allProductions.push(manySep);\n    }\n    visitRepetitionMandatory(atLeastOne) {\n        this.allProductions.push(atLeastOne);\n    }\n    visitRepetitionMandatoryWithSeparator(atLeastOneSep) {\n        this.allProductions.push(atLeastOneSep);\n    }\n    visitRepetition(many) {\n        this.allProductions.push(many);\n    }\n    visitAlternation(or) {\n        this.allProductions.push(or);\n    }\n    visitTerminal(terminal) {\n        this.allProductions.push(terminal);\n    }\n}\nexport function validateRuleDoesNotAlreadyExist(rule, allRules, className, errMsgProvider) {\n    const errors = [];\n    const occurrences = reduce(allRules, (result, curRule) => {\n        if (curRule.name === rule.name) {\n            return result + 1;\n        }\n        return result;\n    }, 0);\n    if (occurrences > 1) {\n        const errMsg = errMsgProvider.buildDuplicateRuleNameError({\n            topLevelRule: rule,\n            grammarName: className,\n        });\n        errors.push({\n            message: errMsg,\n            type: ParserDefinitionErrorType.DUPLICATE_RULE_NAME,\n            ruleName: rule.name,\n        });\n    }\n    return errors;\n}\n// TODO: is there anyway to get only the rule names of rules inherited from the super grammars?\n// This is not part of the IGrammarErrorProvider because the validation cannot be performed on\n// The grammar structure, only at runtime.\nexport function validateRuleIsOverridden(ruleName, definedRulesNames, className) {\n    const errors = [];\n    let errMsg;\n    if (!includes(definedRulesNames, ruleName)) {\n        errMsg =\n            `Invalid rule override, rule: ->${ruleName}<- cannot be overridden in the grammar: ->${className}<-` +\n                `as it is not defined in any of the super grammars `;\n        errors.push({\n            message: errMsg,\n            type: ParserDefinitionErrorType.INVALID_RULE_OVERRIDE,\n            ruleName: ruleName,\n        });\n    }\n    return errors;\n}\nexport function validateNoLeftRecursion(topRule, currRule, errMsgProvider, path = []) {\n    const errors = [];\n    const nextNonTerminals = getFirstNoneTerminal(currRule.definition);\n    if (isEmpty(nextNonTerminals)) {\n        return [];\n    }\n    else {\n        const ruleName = topRule.name;\n        const foundLeftRecursion = includes(nextNonTerminals, topRule);\n        if (foundLeftRecursion) {\n            errors.push({\n                message: errMsgProvider.buildLeftRecursionError({\n                    topLevelRule: topRule,\n                    leftRecursionPath: path,\n                }),\n                type: ParserDefinitionErrorType.LEFT_RECURSION,\n                ruleName: ruleName,\n            });\n        }\n        // we are only looking for cyclic paths leading back to the specific topRule\n        // other cyclic paths are ignored, we still need this difference to avoid infinite loops...\n        const validNextSteps = difference(nextNonTerminals, path.concat([topRule]));\n        const errorsFromNextSteps = flatMap(validNextSteps, (currRefRule) => {\n            const newPath = clone(path);\n            newPath.push(currRefRule);\n            return validateNoLeftRecursion(topRule, currRefRule, errMsgProvider, newPath);\n        });\n        return errors.concat(errorsFromNextSteps);\n    }\n}\nexport function getFirstNoneTerminal(definition) {\n    let result = [];\n    if (isEmpty(definition)) {\n        return result;\n    }\n    const firstProd = first(definition);\n    /* istanbul ignore else */\n    if (firstProd instanceof NonTerminal) {\n        result.push(firstProd.referencedRule);\n    }\n    else if (firstProd instanceof AlternativeGAST ||\n        firstProd instanceof Option ||\n        firstProd instanceof RepetitionMandatory ||\n        firstProd instanceof RepetitionMandatoryWithSeparator ||\n        firstProd instanceof RepetitionWithSeparator ||\n        firstProd instanceof Repetition) {\n        result = result.concat(getFirstNoneTerminal(firstProd.definition));\n    }\n    else if (firstProd instanceof Alternation) {\n        // each sub definition in alternation is a FLAT\n        result = flatten(map(firstProd.definition, (currSubDef) => getFirstNoneTerminal(currSubDef.definition)));\n    }\n    else if (firstProd instanceof Terminal) {\n        // nothing to see, move along\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n    const isFirstOptional = isOptionalProd(firstProd);\n    const hasMore = definition.length > 1;\n    if (isFirstOptional && hasMore) {\n        const rest = drop(definition);\n        return result.concat(getFirstNoneTerminal(rest));\n    }\n    else {\n        return result;\n    }\n}\nclass OrCollector extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.alternations = [];\n    }\n    visitAlternation(node) {\n        this.alternations.push(node);\n    }\n}\nexport function validateEmptyOrAlternative(topLevelRule, errMsgProvider) {\n    const orCollector = new OrCollector();\n    topLevelRule.accept(orCollector);\n    const ors = orCollector.alternations;\n    const errors = flatMap(ors, (currOr) => {\n        const exceptLast = dropRight(currOr.definition);\n        return flatMap(exceptLast, (currAlternative, currAltIdx) => {\n            const possibleFirstInAlt = nextPossibleTokensAfter([currAlternative], [], tokenStructuredMatcher, 1);\n            if (isEmpty(possibleFirstInAlt)) {\n                return [\n                    {\n                        message: errMsgProvider.buildEmptyAlternationError({\n                            topLevelRule: topLevelRule,\n                            alternation: currOr,\n                            emptyChoiceIdx: currAltIdx,\n                        }),\n                        type: ParserDefinitionErrorType.NONE_LAST_EMPTY_ALT,\n                        ruleName: topLevelRule.name,\n                        occurrence: currOr.idx,\n                        alternative: currAltIdx + 1,\n                    },\n                ];\n            }\n            else {\n                return [];\n            }\n        });\n    });\n    return errors;\n}\nexport function validateAmbiguousAlternationAlternatives(topLevelRule, globalMaxLookahead, errMsgProvider) {\n    const orCollector = new OrCollector();\n    topLevelRule.accept(orCollector);\n    let ors = orCollector.alternations;\n    // New Handling of ignoring ambiguities\n    // - https://github.com/chevrotain/chevrotain/issues/869\n    ors = reject(ors, (currOr) => currOr.ignoreAmbiguities === true);\n    const errors = flatMap(ors, (currOr) => {\n        const currOccurrence = currOr.idx;\n        const actualMaxLookahead = currOr.maxLookahead || globalMaxLookahead;\n        const alternatives = getLookaheadPathsForOr(currOccurrence, topLevelRule, actualMaxLookahead, currOr);\n        const altsAmbiguityErrors = checkAlternativesAmbiguities(alternatives, currOr, topLevelRule, errMsgProvider);\n        const altsPrefixAmbiguityErrors = checkPrefixAlternativesAmbiguities(alternatives, currOr, topLevelRule, errMsgProvider);\n        return altsAmbiguityErrors.concat(altsPrefixAmbiguityErrors);\n    });\n    return errors;\n}\nexport class RepetitionCollector extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.allProductions = [];\n    }\n    visitRepetitionWithSeparator(manySep) {\n        this.allProductions.push(manySep);\n    }\n    visitRepetitionMandatory(atLeastOne) {\n        this.allProductions.push(atLeastOne);\n    }\n    visitRepetitionMandatoryWithSeparator(atLeastOneSep) {\n        this.allProductions.push(atLeastOneSep);\n    }\n    visitRepetition(many) {\n        this.allProductions.push(many);\n    }\n}\nexport function validateTooManyAlts(topLevelRule, errMsgProvider) {\n    const orCollector = new OrCollector();\n    topLevelRule.accept(orCollector);\n    const ors = orCollector.alternations;\n    const errors = flatMap(ors, (currOr) => {\n        if (currOr.definition.length > 255) {\n            return [\n                {\n                    message: errMsgProvider.buildTooManyAlternativesError({\n                        topLevelRule: topLevelRule,\n                        alternation: currOr,\n                    }),\n                    type: ParserDefinitionErrorType.TOO_MANY_ALTS,\n                    ruleName: topLevelRule.name,\n                    occurrence: currOr.idx,\n                },\n            ];\n        }\n        else {\n            return [];\n        }\n    });\n    return errors;\n}\nexport function validateSomeNonEmptyLookaheadPath(topLevelRules, maxLookahead, errMsgProvider) {\n    const errors = [];\n    forEach(topLevelRules, (currTopRule) => {\n        const collectorVisitor = new RepetitionCollector();\n        currTopRule.accept(collectorVisitor);\n        const allRuleProductions = collectorVisitor.allProductions;\n        forEach(allRuleProductions, (currProd) => {\n            const prodType = getProdType(currProd);\n            const actualMaxLookahead = currProd.maxLookahead || maxLookahead;\n            const currOccurrence = currProd.idx;\n            const paths = getLookaheadPathsForOptionalProd(currOccurrence, currTopRule, prodType, actualMaxLookahead);\n            const pathsInsideProduction = paths[0];\n            if (isEmpty(flatten(pathsInsideProduction))) {\n                const errMsg = errMsgProvider.buildEmptyRepetitionError({\n                    topLevelRule: currTopRule,\n                    repetition: currProd,\n                });\n                errors.push({\n                    message: errMsg,\n                    type: ParserDefinitionErrorType.NO_NON_EMPTY_LOOKAHEAD,\n                    ruleName: currTopRule.name,\n                });\n            }\n        });\n    });\n    return errors;\n}\nfunction checkAlternativesAmbiguities(alternatives, alternation, rule, errMsgProvider) {\n    const foundAmbiguousPaths = [];\n    const identicalAmbiguities = reduce(alternatives, (result, currAlt, currAltIdx) => {\n        // ignore (skip) ambiguities with this alternative\n        if (alternation.definition[currAltIdx].ignoreAmbiguities === true) {\n            return result;\n        }\n        forEach(currAlt, (currPath) => {\n            const altsCurrPathAppearsIn = [currAltIdx];\n            forEach(alternatives, (currOtherAlt, currOtherAltIdx) => {\n                if (currAltIdx !== currOtherAltIdx &&\n                    containsPath(currOtherAlt, currPath) &&\n                    // ignore (skip) ambiguities with this \"other\" alternative\n                    alternation.definition[currOtherAltIdx].ignoreAmbiguities !== true) {\n                    altsCurrPathAppearsIn.push(currOtherAltIdx);\n                }\n            });\n            if (altsCurrPathAppearsIn.length > 1 &&\n                !containsPath(foundAmbiguousPaths, currPath)) {\n                foundAmbiguousPaths.push(currPath);\n                result.push({\n                    alts: altsCurrPathAppearsIn,\n                    path: currPath,\n                });\n            }\n        });\n        return result;\n    }, []);\n    const currErrors = map(identicalAmbiguities, (currAmbDescriptor) => {\n        const ambgIndices = map(currAmbDescriptor.alts, (currAltIdx) => currAltIdx + 1);\n        const currMessage = errMsgProvider.buildAlternationAmbiguityError({\n            topLevelRule: rule,\n            alternation: alternation,\n            ambiguityIndices: ambgIndices,\n            prefixPath: currAmbDescriptor.path,\n        });\n        return {\n            message: currMessage,\n            type: ParserDefinitionErrorType.AMBIGUOUS_ALTS,\n            ruleName: rule.name,\n            occurrence: alternation.idx,\n            alternatives: currAmbDescriptor.alts,\n        };\n    });\n    return currErrors;\n}\nexport function checkPrefixAlternativesAmbiguities(alternatives, alternation, rule, errMsgProvider) {\n    // flatten\n    const pathsAndIndices = reduce(alternatives, (result, currAlt, idx) => {\n        const currPathsAndIdx = map(currAlt, (currPath) => {\n            return { idx: idx, path: currPath };\n        });\n        return result.concat(currPathsAndIdx);\n    }, []);\n    const errors = compact(flatMap(pathsAndIndices, (currPathAndIdx) => {\n        const alternativeGast = alternation.definition[currPathAndIdx.idx];\n        // ignore (skip) ambiguities with this alternative\n        if (alternativeGast.ignoreAmbiguities === true) {\n            return [];\n        }\n        const targetIdx = currPathAndIdx.idx;\n        const targetPath = currPathAndIdx.path;\n        const prefixAmbiguitiesPathsAndIndices = filter(pathsAndIndices, (searchPathAndIdx) => {\n            // prefix ambiguity can only be created from lower idx (higher priority) path\n            return (\n            // ignore (skip) ambiguities with this \"other\" alternative\n            alternation.definition[searchPathAndIdx.idx].ignoreAmbiguities !==\n                true &&\n                searchPathAndIdx.idx < targetIdx &&\n                // checking for strict prefix because identical lookaheads\n                // will be be detected using a different validation.\n                isStrictPrefixOfPath(searchPathAndIdx.path, targetPath));\n        });\n        const currPathPrefixErrors = map(prefixAmbiguitiesPathsAndIndices, (currAmbPathAndIdx) => {\n            const ambgIndices = [currAmbPathAndIdx.idx + 1, targetIdx + 1];\n            const occurrence = alternation.idx === 0 ? \"\" : alternation.idx;\n            const message = errMsgProvider.buildAlternationPrefixAmbiguityError({\n                topLevelRule: rule,\n                alternation: alternation,\n                ambiguityIndices: ambgIndices,\n                prefixPath: currAmbPathAndIdx.path,\n            });\n            return {\n                message: message,\n                type: ParserDefinitionErrorType.AMBIGUOUS_PREFIX_ALTS,\n                ruleName: rule.name,\n                occurrence: occurrence,\n                alternatives: ambgIndices,\n            };\n        });\n        return currPathPrefixErrors;\n    }));\n    return errors;\n}\nfunction checkTerminalAndNoneTerminalsNameSpace(topLevels, tokenTypes, errMsgProvider) {\n    const errors = [];\n    const tokenNames = map(tokenTypes, (currToken) => currToken.name);\n    forEach(topLevels, (currRule) => {\n        const currRuleName = currRule.name;\n        if (includes(tokenNames, currRuleName)) {\n            const errMsg = errMsgProvider.buildNamespaceConflictError(currRule);\n            errors.push({\n                message: errMsg,\n                type: ParserDefinitionErrorType.CONFLICT_TOKENS_RULES_NAMESPACE,\n                ruleName: currRuleName,\n            });\n        }\n    });\n    return errors;\n}\n//# sourceMappingURL=checks.js.map","import { defaults, forEach } from \"lodash-es\";\nimport { resolveGrammar as orgResolveGrammar } from \"../resolver.js\";\nimport { validateGrammar as orgValidateGrammar } from \"../checks.js\";\nimport { defaultGrammarResolverErrorProvider, defaultGrammarValidatorErrorProvider, } from \"../../errors_public.js\";\nexport function resolveGrammar(options) {\n    const actualOptions = defaults(options, {\n        errMsgProvider: defaultGrammarResolverErrorProvider,\n    });\n    const topRulesTable = {};\n    forEach(options.rules, (rule) => {\n        topRulesTable[rule.name] = rule;\n    });\n    return orgResolveGrammar(topRulesTable, actualOptions.errMsgProvider);\n}\nexport function validateGrammar(options) {\n    options = defaults(options, {\n        errMsgProvider: defaultGrammarValidatorErrorProvider,\n    });\n    return orgValidateGrammar(options.rules, options.tokenTypes, options.errMsgProvider, options.grammarName);\n}\n//# sourceMappingURL=gast_resolver_public.js.map","import { includes } from \"lodash-es\";\nconst MISMATCHED_TOKEN_EXCEPTION = \"MismatchedTokenException\";\nconst NO_VIABLE_ALT_EXCEPTION = \"NoViableAltException\";\nconst EARLY_EXIT_EXCEPTION = \"EarlyExitException\";\nconst NOT_ALL_INPUT_PARSED_EXCEPTION = \"NotAllInputParsedException\";\nconst RECOGNITION_EXCEPTION_NAMES = [\n    MISMATCHED_TOKEN_EXCEPTION,\n    NO_VIABLE_ALT_EXCEPTION,\n    EARLY_EXIT_EXCEPTION,\n    NOT_ALL_INPUT_PARSED_EXCEPTION,\n];\nObject.freeze(RECOGNITION_EXCEPTION_NAMES);\n// hacks to bypass no support for custom Errors in javascript/typescript\nexport function isRecognitionException(error) {\n    // can't do instanceof on hacked custom js exceptions\n    return includes(RECOGNITION_EXCEPTION_NAMES, error.name);\n}\nclass RecognitionException extends Error {\n    constructor(message, token) {\n        super(message);\n        this.token = token;\n        this.resyncedTokens = [];\n        // fix prototype chain when typescript target is ES5\n        Object.setPrototypeOf(this, new.target.prototype);\n        /* istanbul ignore next - V8 workaround to remove constructor from stacktrace when typescript target is ES5 */\n        if (Error.captureStackTrace) {\n            Error.captureStackTrace(this, this.constructor);\n        }\n    }\n}\nexport class MismatchedTokenException extends RecognitionException {\n    constructor(message, token, previousToken) {\n        super(message, token);\n        this.previousToken = previousToken;\n        this.name = MISMATCHED_TOKEN_EXCEPTION;\n    }\n}\nexport class NoViableAltException extends RecognitionException {\n    constructor(message, token, previousToken) {\n        super(message, token);\n        this.previousToken = previousToken;\n        this.name = NO_VIABLE_ALT_EXCEPTION;\n    }\n}\nexport class NotAllInputParsedException extends RecognitionException {\n    constructor(message, token) {\n        super(message, token);\n        this.name = NOT_ALL_INPUT_PARSED_EXCEPTION;\n    }\n}\nexport class EarlyExitException extends RecognitionException {\n    constructor(message, token, previousToken) {\n        super(message, token);\n        this.previousToken = previousToken;\n        this.name = EARLY_EXIT_EXCEPTION;\n    }\n}\n//# sourceMappingURL=exceptions_public.js.map","import { createTokenInstance, EOF, tokenMatcher, } from \"../../../scan/tokens_public.js\";\nimport { clone, dropRight, find, flatten, has, includes, isEmpty, map, } from \"lodash-es\";\nimport { MismatchedTokenException } from \"../../exceptions_public.js\";\nimport { IN } from \"../../constants.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\nexport const EOF_FOLLOW_KEY = {};\nexport const IN_RULE_RECOVERY_EXCEPTION = \"InRuleRecoveryException\";\nexport class InRuleRecoveryException extends Error {\n    constructor(message) {\n        super(message);\n        this.name = IN_RULE_RECOVERY_EXCEPTION;\n    }\n}\n/**\n * This trait is responsible for the error recovery and fault tolerant logic\n */\nexport class Recoverable {\n    initRecoverable(config) {\n        this.firstAfterRepMap = {};\n        this.resyncFollows = {};\n        this.recoveryEnabled = has(config, \"recoveryEnabled\")\n            ? config.recoveryEnabled // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.recoveryEnabled;\n        // performance optimization, NOOP will be inlined which\n        // effectively means that this optional feature does not exist\n        // when not used.\n        if (this.recoveryEnabled) {\n            this.attemptInRepetitionRecovery = attemptInRepetitionRecovery;\n        }\n    }\n    getTokenToInsert(tokType) {\n        const tokToInsert = createTokenInstance(tokType, \"\", NaN, NaN, NaN, NaN, NaN, NaN);\n        tokToInsert.isInsertedInRecovery = true;\n        return tokToInsert;\n    }\n    canTokenTypeBeInsertedInRecovery(tokType) {\n        return true;\n    }\n    canTokenTypeBeDeletedInRecovery(tokType) {\n        return true;\n    }\n    tryInRepetitionRecovery(grammarRule, grammarRuleArgs, lookAheadFunc, expectedTokType) {\n        // TODO: can the resyncTokenType be cached?\n        const reSyncTokType = this.findReSyncTokenType();\n        const savedLexerState = this.exportLexerState();\n        const resyncedTokens = [];\n        let passedResyncPoint = false;\n        const nextTokenWithoutResync = this.LA(1);\n        let currToken = this.LA(1);\n        const generateErrorMessage = () => {\n            const previousToken = this.LA(0);\n            // we are preemptively re-syncing before an error has been detected, therefor we must reproduce\n            // the error that would have been thrown\n            const msg = this.errorMessageProvider.buildMismatchTokenMessage({\n                expected: expectedTokType,\n                actual: nextTokenWithoutResync,\n                previous: previousToken,\n                ruleName: this.getCurrRuleFullName(),\n            });\n            const error = new MismatchedTokenException(msg, nextTokenWithoutResync, this.LA(0));\n            // the first token here will be the original cause of the error, this is not part of the resyncedTokens property.\n            error.resyncedTokens = dropRight(resyncedTokens);\n            this.SAVE_ERROR(error);\n        };\n        while (!passedResyncPoint) {\n            // re-synced to a point where we can safely exit the repetition/\n            if (this.tokenMatcher(currToken, expectedTokType)) {\n                generateErrorMessage();\n                return; // must return here to avoid reverting the inputIdx\n            }\n            else if (lookAheadFunc.call(this)) {\n                // we skipped enough tokens so we can resync right back into another iteration of the repetition grammar rule\n                generateErrorMessage();\n                // recursive invocation in other to support multiple re-syncs in the same top level repetition grammar rule\n                grammarRule.apply(this, grammarRuleArgs);\n                return; // must return here to avoid reverting the inputIdx\n            }\n            else if (this.tokenMatcher(currToken, reSyncTokType)) {\n                passedResyncPoint = true;\n            }\n            else {\n                currToken = this.SKIP_TOKEN();\n                this.addToResyncTokens(currToken, resyncedTokens);\n            }\n        }\n        // we were unable to find a CLOSER point to resync inside the Repetition, reset the state.\n        // The parsing exception we were trying to prevent will happen in the NEXT parsing step. it may be handled by\n        // \"between rules\" resync recovery later in the flow.\n        this.importLexerState(savedLexerState);\n    }\n    shouldInRepetitionRecoveryBeTried(expectTokAfterLastMatch, nextTokIdx, notStuck) {\n        // Edge case of arriving from a MANY repetition which is stuck\n        // Attempting recovery in this case could cause an infinite loop\n        if (notStuck === false) {\n            return false;\n        }\n        // no need to recover, next token is what we expect...\n        if (this.tokenMatcher(this.LA(1), expectTokAfterLastMatch)) {\n            return false;\n        }\n        // error recovery is disabled during backtracking as it can make the parser ignore a valid grammar path\n        // and prefer some backtracking path that includes recovered errors.\n        if (this.isBackTracking()) {\n            return false;\n        }\n        // if we can perform inRule recovery (single token insertion or deletion) we always prefer that recovery algorithm\n        // because if it works, it makes the least amount of changes to the input stream (greedy algorithm)\n        //noinspection RedundantIfStatementJS\n        if (this.canPerformInRuleRecovery(expectTokAfterLastMatch, this.getFollowsForInRuleRecovery(expectTokAfterLastMatch, nextTokIdx))) {\n            return false;\n        }\n        return true;\n    }\n    // Error Recovery functionality\n    getFollowsForInRuleRecovery(tokType, tokIdxInRule) {\n        const grammarPath = this.getCurrentGrammarPath(tokType, tokIdxInRule);\n        const follows = this.getNextPossibleTokenTypes(grammarPath);\n        return follows;\n    }\n    tryInRuleRecovery(expectedTokType, follows) {\n        if (this.canRecoverWithSingleTokenInsertion(expectedTokType, follows)) {\n            const tokToInsert = this.getTokenToInsert(expectedTokType);\n            return tokToInsert;\n        }\n        if (this.canRecoverWithSingleTokenDeletion(expectedTokType)) {\n            const nextTok = this.SKIP_TOKEN();\n            this.consumeToken();\n            return nextTok;\n        }\n        throw new InRuleRecoveryException(\"sad sad panda\");\n    }\n    canPerformInRuleRecovery(expectedToken, follows) {\n        return (this.canRecoverWithSingleTokenInsertion(expectedToken, follows) ||\n            this.canRecoverWithSingleTokenDeletion(expectedToken));\n    }\n    canRecoverWithSingleTokenInsertion(expectedTokType, follows) {\n        if (!this.canTokenTypeBeInsertedInRecovery(expectedTokType)) {\n            return false;\n        }\n        // must know the possible following tokens to perform single token insertion\n        if (isEmpty(follows)) {\n            return false;\n        }\n        const mismatchedTok = this.LA(1);\n        const isMisMatchedTokInFollows = find(follows, (possibleFollowsTokType) => {\n            return this.tokenMatcher(mismatchedTok, possibleFollowsTokType);\n        }) !== undefined;\n        return isMisMatchedTokInFollows;\n    }\n    canRecoverWithSingleTokenDeletion(expectedTokType) {\n        if (!this.canTokenTypeBeDeletedInRecovery(expectedTokType)) {\n            return false;\n        }\n        const isNextTokenWhatIsExpected = this.tokenMatcher(this.LA(2), expectedTokType);\n        return isNextTokenWhatIsExpected;\n    }\n    isInCurrentRuleReSyncSet(tokenTypeIdx) {\n        const followKey = this.getCurrFollowKey();\n        const currentRuleReSyncSet = this.getFollowSetFromFollowKey(followKey);\n        return includes(currentRuleReSyncSet, tokenTypeIdx);\n    }\n    findReSyncTokenType() {\n        const allPossibleReSyncTokTypes = this.flattenFollowSet();\n        // this loop will always terminate as EOF is always in the follow stack and also always (virtually) in the input\n        let nextToken = this.LA(1);\n        let k = 2;\n        while (true) {\n            const foundMatch = find(allPossibleReSyncTokTypes, (resyncTokType) => {\n                const canMatch = tokenMatcher(nextToken, resyncTokType);\n                return canMatch;\n            });\n            if (foundMatch !== undefined) {\n                return foundMatch;\n            }\n            nextToken = this.LA(k);\n            k++;\n        }\n    }\n    getCurrFollowKey() {\n        // the length is at least one as we always add the ruleName to the stack before invoking the rule.\n        if (this.RULE_STACK.length === 1) {\n            return EOF_FOLLOW_KEY;\n        }\n        const currRuleShortName = this.getLastExplicitRuleShortName();\n        const currRuleIdx = this.getLastExplicitRuleOccurrenceIndex();\n        const prevRuleShortName = this.getPreviousExplicitRuleShortName();\n        return {\n            ruleName: this.shortRuleNameToFullName(currRuleShortName),\n            idxInCallingRule: currRuleIdx,\n            inRule: this.shortRuleNameToFullName(prevRuleShortName),\n        };\n    }\n    buildFullFollowKeyStack() {\n        const explicitRuleStack = this.RULE_STACK;\n        const explicitOccurrenceStack = this.RULE_OCCURRENCE_STACK;\n        return map(explicitRuleStack, (ruleName, idx) => {\n            if (idx === 0) {\n                return EOF_FOLLOW_KEY;\n            }\n            return {\n                ruleName: this.shortRuleNameToFullName(ruleName),\n                idxInCallingRule: explicitOccurrenceStack[idx],\n                inRule: this.shortRuleNameToFullName(explicitRuleStack[idx - 1]),\n            };\n        });\n    }\n    flattenFollowSet() {\n        const followStack = map(this.buildFullFollowKeyStack(), (currKey) => {\n            return this.getFollowSetFromFollowKey(currKey);\n        });\n        return flatten(followStack);\n    }\n    getFollowSetFromFollowKey(followKey) {\n        if (followKey === EOF_FOLLOW_KEY) {\n            return [EOF];\n        }\n        const followName = followKey.ruleName + followKey.idxInCallingRule + IN + followKey.inRule;\n        return this.resyncFollows[followName];\n    }\n    // It does not make any sense to include a virtual EOF token in the list of resynced tokens\n    // as EOF does not really exist and thus does not contain any useful information (line/column numbers)\n    addToResyncTokens(token, resyncTokens) {\n        if (!this.tokenMatcher(token, EOF)) {\n            resyncTokens.push(token);\n        }\n        return resyncTokens;\n    }\n    reSyncTo(tokType) {\n        const resyncedTokens = [];\n        let nextTok = this.LA(1);\n        while (this.tokenMatcher(nextTok, tokType) === false) {\n            nextTok = this.SKIP_TOKEN();\n            this.addToResyncTokens(nextTok, resyncedTokens);\n        }\n        // the last token is not part of the error.\n        return dropRight(resyncedTokens);\n    }\n    attemptInRepetitionRecovery(prodFunc, args, lookaheadFunc, dslMethodIdx, prodOccurrence, nextToksWalker, notStuck) {\n        // by default this is a NO-OP\n        // The actual implementation is with the function(not method) below\n    }\n    getCurrentGrammarPath(tokType, tokIdxInRule) {\n        const pathRuleStack = this.getHumanReadableRuleStack();\n        const pathOccurrenceStack = clone(this.RULE_OCCURRENCE_STACK);\n        const grammarPath = {\n            ruleStack: pathRuleStack,\n            occurrenceStack: pathOccurrenceStack,\n            lastTok: tokType,\n            lastTokOccurrence: tokIdxInRule,\n        };\n        return grammarPath;\n    }\n    getHumanReadableRuleStack() {\n        return map(this.RULE_STACK, (currShortName) => this.shortRuleNameToFullName(currShortName));\n    }\n}\nexport function attemptInRepetitionRecovery(prodFunc, args, lookaheadFunc, dslMethodIdx, prodOccurrence, nextToksWalker, notStuck) {\n    const key = this.getKeyForAutomaticLookahead(dslMethodIdx, prodOccurrence);\n    let firstAfterRepInfo = this.firstAfterRepMap[key];\n    if (firstAfterRepInfo === undefined) {\n        const currRuleName = this.getCurrRuleFullName();\n        const ruleGrammar = this.getGAstProductions()[currRuleName];\n        const walker = new nextToksWalker(ruleGrammar, prodOccurrence);\n        firstAfterRepInfo = walker.startWalking();\n        this.firstAfterRepMap[key] = firstAfterRepInfo;\n    }\n    let expectTokAfterLastMatch = firstAfterRepInfo.token;\n    let nextTokIdx = firstAfterRepInfo.occurrence;\n    const isEndOfRule = firstAfterRepInfo.isEndOfRule;\n    // special edge case of a TOP most repetition after which the input should END.\n    // this will force an attempt for inRule recovery in that scenario.\n    if (this.RULE_STACK.length === 1 &&\n        isEndOfRule &&\n        expectTokAfterLastMatch === undefined) {\n        expectTokAfterLastMatch = EOF;\n        nextTokIdx = 1;\n    }\n    // We don't have anything to re-sync to...\n    // this condition was extracted from `shouldInRepetitionRecoveryBeTried` to act as a type-guard\n    if (expectTokAfterLastMatch === undefined || nextTokIdx === undefined) {\n        return;\n    }\n    if (this.shouldInRepetitionRecoveryBeTried(expectTokAfterLastMatch, nextTokIdx, notStuck)) {\n        // TODO: performance optimization: instead of passing the original args here, we modify\n        // the args param (or create a new one) and make sure the lookahead func is explicitly provided\n        // to avoid searching the cache for it once more.\n        this.tryInRepetitionRecovery(prodFunc, args, lookaheadFunc, expectTokAfterLastMatch);\n    }\n}\n//# sourceMappingURL=recoverable.js.map","// Lookahead keys are 32Bit integers in the form\n// TTTTTTTT-ZZZZZZZZZZZZ-YYYY-XXXXXXXX\n// XXXX -> Occurrence Index bitmap.\n// YYYY -> DSL Method Type bitmap.\n// ZZZZZZZZZZZZZZZ -> Rule short Index bitmap.\n// TTTTTTTTT -> alternation alternative index bitmap\nexport const BITS_FOR_METHOD_TYPE = 4;\nexport const BITS_FOR_OCCURRENCE_IDX = 8;\nexport const BITS_FOR_RULE_IDX = 12;\n// TODO: validation, this means that there may at most 2^8 --> 256 alternatives for an alternation.\nexport const BITS_FOR_ALT_IDX = 8;\n// short string used as part of mapping keys.\n// being short improves the performance when composing KEYS for maps out of these\n// The 5 - 8 bits (16 possible values, are reserved for the DSL method indices)\nexport const OR_IDX = 1 << BITS_FOR_OCCURRENCE_IDX;\nexport const OPTION_IDX = 2 << BITS_FOR_OCCURRENCE_IDX;\nexport const MANY_IDX = 3 << BITS_FOR_OCCURRENCE_IDX;\nexport const AT_LEAST_ONE_IDX = 4 << BITS_FOR_OCCURRENCE_IDX;\nexport const MANY_SEP_IDX = 5 << BITS_FOR_OCCURRENCE_IDX;\nexport const AT_LEAST_ONE_SEP_IDX = 6 << BITS_FOR_OCCURRENCE_IDX;\n// this actually returns a number, but it is always used as a string (object prop key)\nexport function getKeyForAutomaticLookahead(ruleIdx, dslMethodIdx, occurrence) {\n    return occurrence | dslMethodIdx | ruleIdx;\n}\nconst BITS_START_FOR_ALT_IDX = 32 - BITS_FOR_ALT_IDX;\n//# sourceMappingURL=keys.js.map","import { flatMap, isEmpty } from \"lodash-es\";\nimport { defaultGrammarValidatorErrorProvider } from \"../errors_public.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser/parser.js\";\nimport { validateAmbiguousAlternationAlternatives, validateEmptyOrAlternative, validateNoLeftRecursion, validateSomeNonEmptyLookaheadPath, } from \"./checks.js\";\nimport { buildAlternativesLookAheadFunc, buildLookaheadFuncForOptionalProd, buildLookaheadFuncForOr, buildSingleAlternativeLookaheadFunction, getProdType, } from \"./lookahead.js\";\nexport class LLkLookaheadStrategy {\n    constructor(options) {\n        var _a;\n        this.maxLookahead =\n            (_a = options === null || options === void 0 ? void 0 : options.maxLookahead) !== null && _a !== void 0 ? _a : DEFAULT_PARSER_CONFIG.maxLookahead;\n    }\n    validate(options) {\n        const leftRecursionErrors = this.validateNoLeftRecursion(options.rules);\n        if (isEmpty(leftRecursionErrors)) {\n            const emptyAltErrors = this.validateEmptyOrAlternatives(options.rules);\n            const ambiguousAltsErrors = this.validateAmbiguousAlternationAlternatives(options.rules, this.maxLookahead);\n            const emptyRepetitionErrors = this.validateSomeNonEmptyLookaheadPath(options.rules, this.maxLookahead);\n            const allErrors = [\n                ...leftRecursionErrors,\n                ...emptyAltErrors,\n                ...ambiguousAltsErrors,\n                ...emptyRepetitionErrors,\n            ];\n            return allErrors;\n        }\n        return leftRecursionErrors;\n    }\n    validateNoLeftRecursion(rules) {\n        return flatMap(rules, (currTopRule) => validateNoLeftRecursion(currTopRule, currTopRule, defaultGrammarValidatorErrorProvider));\n    }\n    validateEmptyOrAlternatives(rules) {\n        return flatMap(rules, (currTopRule) => validateEmptyOrAlternative(currTopRule, defaultGrammarValidatorErrorProvider));\n    }\n    validateAmbiguousAlternationAlternatives(rules, maxLookahead) {\n        return flatMap(rules, (currTopRule) => validateAmbiguousAlternationAlternatives(currTopRule, maxLookahead, defaultGrammarValidatorErrorProvider));\n    }\n    validateSomeNonEmptyLookaheadPath(rules, maxLookahead) {\n        return validateSomeNonEmptyLookaheadPath(rules, maxLookahead, defaultGrammarValidatorErrorProvider);\n    }\n    buildLookaheadForAlternation(options) {\n        return buildLookaheadFuncForOr(options.prodOccurrence, options.rule, options.maxLookahead, options.hasPredicates, options.dynamicTokensEnabled, buildAlternativesLookAheadFunc);\n    }\n    buildLookaheadForOptional(options) {\n        return buildLookaheadFuncForOptionalProd(options.prodOccurrence, options.rule, options.maxLookahead, options.dynamicTokensEnabled, getProdType(options.prodType), buildSingleAlternativeLookaheadFunction);\n    }\n}\n//# sourceMappingURL=llk_lookahead.js.map","import { forEach, has } from \"lodash-es\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\nimport { AT_LEAST_ONE_IDX, AT_LEAST_ONE_SEP_IDX, getKeyForAutomaticLookahead, MANY_IDX, MANY_SEP_IDX, OPTION_IDX, OR_IDX, } from \"../../grammar/keys.js\";\nimport { GAstVisitor, getProductionDslName, } from \"@chevrotain/gast\";\nimport { LLkLookaheadStrategy } from \"../../grammar/llk_lookahead.js\";\n/**\n * Trait responsible for the lookahead related utilities and optimizations.\n */\nexport class LooksAhead {\n    initLooksAhead(config) {\n        this.dynamicTokensEnabled = has(config, \"dynamicTokensEnabled\")\n            ? config.dynamicTokensEnabled // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.dynamicTokensEnabled;\n        this.maxLookahead = has(config, \"maxLookahead\")\n            ? config.maxLookahead // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.maxLookahead;\n        this.lookaheadStrategy = has(config, \"lookaheadStrategy\")\n            ? config.lookaheadStrategy // assumes end user provides the correct config value/type\n            : new LLkLookaheadStrategy({ maxLookahead: this.maxLookahead });\n        this.lookAheadFuncsCache = new Map();\n    }\n    preComputeLookaheadFunctions(rules) {\n        forEach(rules, (currRule) => {\n            this.TRACE_INIT(`${currRule.name} Rule Lookahead`, () => {\n                const { alternation, repetition, option, repetitionMandatory, repetitionMandatoryWithSeparator, repetitionWithSeparator, } = collectMethods(currRule);\n                forEach(alternation, (currProd) => {\n                    const prodIdx = currProd.idx === 0 ? \"\" : currProd.idx;\n                    this.TRACE_INIT(`${getProductionDslName(currProd)}${prodIdx}`, () => {\n                        const laFunc = this.lookaheadStrategy.buildLookaheadForAlternation({\n                            prodOccurrence: currProd.idx,\n                            rule: currRule,\n                            maxLookahead: currProd.maxLookahead || this.maxLookahead,\n                            hasPredicates: currProd.hasPredicates,\n                            dynamicTokensEnabled: this.dynamicTokensEnabled,\n                        });\n                        const key = getKeyForAutomaticLookahead(this.fullRuleNameToShort[currRule.name], OR_IDX, currProd.idx);\n                        this.setLaFuncCache(key, laFunc);\n                    });\n                });\n                forEach(repetition, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, MANY_IDX, \"Repetition\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(option, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, OPTION_IDX, \"Option\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(repetitionMandatory, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, AT_LEAST_ONE_IDX, \"RepetitionMandatory\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(repetitionMandatoryWithSeparator, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, AT_LEAST_ONE_SEP_IDX, \"RepetitionMandatoryWithSeparator\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(repetitionWithSeparator, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, MANY_SEP_IDX, \"RepetitionWithSeparator\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n            });\n        });\n    }\n    computeLookaheadFunc(rule, prodOccurrence, prodKey, prodType, prodMaxLookahead, dslMethodName) {\n        this.TRACE_INIT(`${dslMethodName}${prodOccurrence === 0 ? \"\" : prodOccurrence}`, () => {\n            const laFunc = this.lookaheadStrategy.buildLookaheadForOptional({\n                prodOccurrence,\n                rule,\n                maxLookahead: prodMaxLookahead || this.maxLookahead,\n                dynamicTokensEnabled: this.dynamicTokensEnabled,\n                prodType,\n            });\n            const key = getKeyForAutomaticLookahead(this.fullRuleNameToShort[rule.name], prodKey, prodOccurrence);\n            this.setLaFuncCache(key, laFunc);\n        });\n    }\n    // this actually returns a number, but it is always used as a string (object prop key)\n    getKeyForAutomaticLookahead(dslMethodIdx, occurrence) {\n        const currRuleShortName = this.getLastExplicitRuleShortName();\n        return getKeyForAutomaticLookahead(currRuleShortName, dslMethodIdx, occurrence);\n    }\n    getLaFuncFromCache(key) {\n        return this.lookAheadFuncsCache.get(key);\n    }\n    /* istanbul ignore next */\n    setLaFuncCache(key, value) {\n        this.lookAheadFuncsCache.set(key, value);\n    }\n}\nclass DslMethodsCollectorVisitor extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.dslMethods = {\n            option: [],\n            alternation: [],\n            repetition: [],\n            repetitionWithSeparator: [],\n            repetitionMandatory: [],\n            repetitionMandatoryWithSeparator: [],\n        };\n    }\n    reset() {\n        this.dslMethods = {\n            option: [],\n            alternation: [],\n            repetition: [],\n            repetitionWithSeparator: [],\n            repetitionMandatory: [],\n            repetitionMandatoryWithSeparator: [],\n        };\n    }\n    visitOption(option) {\n        this.dslMethods.option.push(option);\n    }\n    visitRepetitionWithSeparator(manySep) {\n        this.dslMethods.repetitionWithSeparator.push(manySep);\n    }\n    visitRepetitionMandatory(atLeastOne) {\n        this.dslMethods.repetitionMandatory.push(atLeastOne);\n    }\n    visitRepetitionMandatoryWithSeparator(atLeastOneSep) {\n        this.dslMethods.repetitionMandatoryWithSeparator.push(atLeastOneSep);\n    }\n    visitRepetition(many) {\n        this.dslMethods.repetition.push(many);\n    }\n    visitAlternation(or) {\n        this.dslMethods.alternation.push(or);\n    }\n}\nconst collectorVisitor = new DslMethodsCollectorVisitor();\nexport function collectMethods(rule) {\n    collectorVisitor.reset();\n    rule.accept(collectorVisitor);\n    const dslMethods = collectorVisitor.dslMethods;\n    // avoid uncleaned references\n    collectorVisitor.reset();\n    return dslMethods;\n}\n//# sourceMappingURL=looksahead.js.map","/**\n * This nodeLocation tracking is not efficient and should only be used\n * when error recovery is enabled or the Token Vector contains virtual Tokens\n * (e.g, Python Indent/Outdent)\n * As it executes the calculation for every single terminal/nonTerminal\n * and does not rely on the fact the token vector is **sorted**\n */\nexport function setNodeLocationOnlyOffset(currNodeLocation, newLocationInfo) {\n    // First (valid) update for this cst node\n    if (isNaN(currNodeLocation.startOffset) === true) {\n        // assumption1: Token location information is either NaN or a valid number\n        // assumption2: Token location information is fully valid if it exist\n        // (both start/end offsets exist and are numbers).\n        currNodeLocation.startOffset = newLocationInfo.startOffset;\n        currNodeLocation.endOffset = newLocationInfo.endOffset;\n    }\n    // Once the startOffset has been updated with a valid number it should never receive\n    // any farther updates as the Token vector is sorted.\n    // We still have to check this this condition for every new possible location info\n    // because with error recovery enabled we may encounter invalid tokens (NaN location props)\n    else if (currNodeLocation.endOffset < newLocationInfo.endOffset === true) {\n        currNodeLocation.endOffset = newLocationInfo.endOffset;\n    }\n}\n/**\n * This nodeLocation tracking is not efficient and should only be used\n * when error recovery is enabled or the Token Vector contains virtual Tokens\n * (e.g, Python Indent/Outdent)\n * As it executes the calculation for every single terminal/nonTerminal\n * and does not rely on the fact the token vector is **sorted**\n */\nexport function setNodeLocationFull(currNodeLocation, newLocationInfo) {\n    // First (valid) update for this cst node\n    if (isNaN(currNodeLocation.startOffset) === true) {\n        // assumption1: Token location information is either NaN or a valid number\n        // assumption2: Token location information is fully valid if it exist\n        // (all start/end props exist and are numbers).\n        currNodeLocation.startOffset = newLocationInfo.startOffset;\n        currNodeLocation.startColumn = newLocationInfo.startColumn;\n        currNodeLocation.startLine = newLocationInfo.startLine;\n        currNodeLocation.endOffset = newLocationInfo.endOffset;\n        currNodeLocation.endColumn = newLocationInfo.endColumn;\n        currNodeLocation.endLine = newLocationInfo.endLine;\n    }\n    // Once the start props has been updated with a valid number it should never receive\n    // any farther updates as the Token vector is sorted.\n    // We still have to check this this condition for every new possible location info\n    // because with error recovery enabled we may encounter invalid tokens (NaN location props)\n    else if (currNodeLocation.endOffset < newLocationInfo.endOffset === true) {\n        currNodeLocation.endOffset = newLocationInfo.endOffset;\n        currNodeLocation.endColumn = newLocationInfo.endColumn;\n        currNodeLocation.endLine = newLocationInfo.endLine;\n    }\n}\nexport function addTerminalToCst(node, token, tokenTypeName) {\n    if (node.children[tokenTypeName] === undefined) {\n        node.children[tokenTypeName] = [token];\n    }\n    else {\n        node.children[tokenTypeName].push(token);\n    }\n}\nexport function addNoneTerminalToCst(node, ruleName, ruleResult) {\n    if (node.children[ruleName] === undefined) {\n        node.children[ruleName] = [ruleResult];\n    }\n    else {\n        node.children[ruleName].push(ruleResult);\n    }\n}\n//# sourceMappingURL=cst.js.map","const NAME = \"name\";\nexport function defineNameProp(obj, nameValue) {\n    Object.defineProperty(obj, NAME, {\n        enumerable: false,\n        configurable: true,\n        writable: false,\n        value: nameValue,\n    });\n}\n//# sourceMappingURL=lang_extensions.js.map","import { compact, filter, forEach, isArray, isEmpty, isFunction, isUndefined, keys, map, } from \"lodash-es\";\nimport { defineNameProp } from \"../../lang/lang_extensions.js\";\nexport function defaultVisit(ctx, param) {\n    const childrenNames = keys(ctx);\n    const childrenNamesLength = childrenNames.length;\n    for (let i = 0; i < childrenNamesLength; i++) {\n        const currChildName = childrenNames[i];\n        const currChildArray = ctx[currChildName];\n        const currChildArrayLength = currChildArray.length;\n        for (let j = 0; j < currChildArrayLength; j++) {\n            const currChild = currChildArray[j];\n            // distinction between Tokens Children and CstNode children\n            if (currChild.tokenTypeIdx === undefined) {\n                this[currChild.name](currChild.children, param);\n            }\n        }\n    }\n    // defaultVisit does not support generic out param\n}\nexport function createBaseSemanticVisitorConstructor(grammarName, ruleNames) {\n    const derivedConstructor = function () { };\n    // can be overwritten according to:\n    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/\n    // name?redirectlocale=en-US&redirectslug=JavaScript%2FReference%2FGlobal_Objects%2FFunction%2Fname\n    defineNameProp(derivedConstructor, grammarName + \"BaseSemantics\");\n    const semanticProto = {\n        visit: function (cstNode, param) {\n            // enables writing more concise visitor methods when CstNode has only a single child\n            if (isArray(cstNode)) {\n                // A CST Node's children dictionary can never have empty arrays as values\n                // If a key is defined there will be at least one element in the corresponding value array.\n                cstNode = cstNode[0];\n            }\n            // enables passing optional CstNodes concisely.\n            if (isUndefined(cstNode)) {\n                return undefined;\n            }\n            return this[cstNode.name](cstNode.children, param);\n        },\n        validateVisitor: function () {\n            const semanticDefinitionErrors = validateVisitor(this, ruleNames);\n            if (!isEmpty(semanticDefinitionErrors)) {\n                const errorMessages = map(semanticDefinitionErrors, (currDefError) => currDefError.msg);\n                throw Error(`Errors Detected in CST Visitor <${this.constructor.name}>:\\n\\t` +\n                    `${errorMessages.join(\"\\n\\n\").replace(/\\n/g, \"\\n\\t\")}`);\n            }\n        },\n    };\n    derivedConstructor.prototype = semanticProto;\n    derivedConstructor.prototype.constructor = derivedConstructor;\n    derivedConstructor._RULE_NAMES = ruleNames;\n    return derivedConstructor;\n}\nexport function createBaseVisitorConstructorWithDefaults(grammarName, ruleNames, baseConstructor) {\n    const derivedConstructor = function () { };\n    // can be overwritten according to:\n    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/\n    // name?redirectlocale=en-US&redirectslug=JavaScript%2FReference%2FGlobal_Objects%2FFunction%2Fname\n    defineNameProp(derivedConstructor, grammarName + \"BaseSemanticsWithDefaults\");\n    const withDefaultsProto = Object.create(baseConstructor.prototype);\n    forEach(ruleNames, (ruleName) => {\n        withDefaultsProto[ruleName] = defaultVisit;\n    });\n    derivedConstructor.prototype = withDefaultsProto;\n    derivedConstructor.prototype.constructor = derivedConstructor;\n    return derivedConstructor;\n}\nexport var CstVisitorDefinitionError;\n(function (CstVisitorDefinitionError) {\n    CstVisitorDefinitionError[CstVisitorDefinitionError[\"REDUNDANT_METHOD\"] = 0] = \"REDUNDANT_METHOD\";\n    CstVisitorDefinitionError[CstVisitorDefinitionError[\"MISSING_METHOD\"] = 1] = \"MISSING_METHOD\";\n})(CstVisitorDefinitionError || (CstVisitorDefinitionError = {}));\nexport function validateVisitor(visitorInstance, ruleNames) {\n    const missingErrors = validateMissingCstMethods(visitorInstance, ruleNames);\n    return missingErrors;\n}\nexport function validateMissingCstMethods(visitorInstance, ruleNames) {\n    const missingRuleNames = filter(ruleNames, (currRuleName) => {\n        return isFunction(visitorInstance[currRuleName]) === false;\n    });\n    const errors = map(missingRuleNames, (currRuleName) => {\n        return {\n            msg: `Missing visitor method: <${currRuleName}> on ${(visitorInstance.constructor.name)} CST Visitor.`,\n            type: CstVisitorDefinitionError.MISSING_METHOD,\n            methodName: currRuleName,\n        };\n    });\n    return compact(errors);\n}\n//# sourceMappingURL=cst_visitor.js.map","import { addNoneTerminalToCst, addTerminalToCst, setNodeLocationFull, setNodeLocationOnlyOffset, } from \"../../cst/cst.js\";\nimport { has, isUndefined, keys, noop } from \"lodash-es\";\nimport { createBaseSemanticVisitorConstructor, createBaseVisitorConstructorWithDefaults, } from \"../../cst/cst_visitor.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n/**\n * This trait is responsible for the CST building logic.\n */\nexport class TreeBuilder {\n    initTreeBuilder(config) {\n        this.CST_STACK = [];\n        // outputCst is no longer exposed/defined in the pubic API\n        this.outputCst = config.outputCst;\n        this.nodeLocationTracking = has(config, \"nodeLocationTracking\")\n            ? config.nodeLocationTracking // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.nodeLocationTracking;\n        if (!this.outputCst) {\n            this.cstInvocationStateUpdate = noop;\n            this.cstFinallyStateUpdate = noop;\n            this.cstPostTerminal = noop;\n            this.cstPostNonTerminal = noop;\n            this.cstPostRule = noop;\n        }\n        else {\n            if (/full/i.test(this.nodeLocationTracking)) {\n                if (this.recoveryEnabled) {\n                    this.setNodeLocationFromToken = setNodeLocationFull;\n                    this.setNodeLocationFromNode = setNodeLocationFull;\n                    this.cstPostRule = noop;\n                    this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery;\n                }\n                else {\n                    this.setNodeLocationFromToken = noop;\n                    this.setNodeLocationFromNode = noop;\n                    this.cstPostRule = this.cstPostRuleFull;\n                    this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular;\n                }\n            }\n            else if (/onlyOffset/i.test(this.nodeLocationTracking)) {\n                if (this.recoveryEnabled) {\n                    this.setNodeLocationFromToken = setNodeLocationOnlyOffset;\n                    this.setNodeLocationFromNode = setNodeLocationOnlyOffset;\n                    this.cstPostRule = noop;\n                    this.setInitialNodeLocation =\n                        this.setInitialNodeLocationOnlyOffsetRecovery;\n                }\n                else {\n                    this.setNodeLocationFromToken = noop;\n                    this.setNodeLocationFromNode = noop;\n                    this.cstPostRule = this.cstPostRuleOnlyOffset;\n                    this.setInitialNodeLocation =\n                        this.setInitialNodeLocationOnlyOffsetRegular;\n                }\n            }\n            else if (/none/i.test(this.nodeLocationTracking)) {\n                this.setNodeLocationFromToken = noop;\n                this.setNodeLocationFromNode = noop;\n                this.cstPostRule = noop;\n                this.setInitialNodeLocation = noop;\n            }\n            else {\n                throw Error(`Invalid <nodeLocationTracking> config option: \"${config.nodeLocationTracking}\"`);\n            }\n        }\n    }\n    setInitialNodeLocationOnlyOffsetRecovery(cstNode) {\n        cstNode.location = {\n            startOffset: NaN,\n            endOffset: NaN,\n        };\n    }\n    setInitialNodeLocationOnlyOffsetRegular(cstNode) {\n        cstNode.location = {\n            // without error recovery the starting Location of a new CstNode is guaranteed\n            // To be the next Token's startOffset (for valid inputs).\n            // For invalid inputs there won't be any CSTOutput so this potential\n            // inaccuracy does not matter\n            startOffset: this.LA(1).startOffset,\n            endOffset: NaN,\n        };\n    }\n    setInitialNodeLocationFullRecovery(cstNode) {\n        cstNode.location = {\n            startOffset: NaN,\n            startLine: NaN,\n            startColumn: NaN,\n            endOffset: NaN,\n            endLine: NaN,\n            endColumn: NaN,\n        };\n    }\n    /**\n       *  @see setInitialNodeLocationOnlyOffsetRegular for explanation why this work\n  \n       * @param cstNode\n       */\n    setInitialNodeLocationFullRegular(cstNode) {\n        const nextToken = this.LA(1);\n        cstNode.location = {\n            startOffset: nextToken.startOffset,\n            startLine: nextToken.startLine,\n            startColumn: nextToken.startColumn,\n            endOffset: NaN,\n            endLine: NaN,\n            endColumn: NaN,\n        };\n    }\n    cstInvocationStateUpdate(fullRuleName) {\n        const cstNode = {\n            name: fullRuleName,\n            children: Object.create(null),\n        };\n        this.setInitialNodeLocation(cstNode);\n        this.CST_STACK.push(cstNode);\n    }\n    cstFinallyStateUpdate() {\n        this.CST_STACK.pop();\n    }\n    cstPostRuleFull(ruleCstNode) {\n        // casts to `required<CstNodeLocation>` are safe because `cstPostRuleFull` should only be invoked when full location is enabled\n        const prevToken = this.LA(0);\n        const loc = ruleCstNode.location;\n        // If this condition is true it means we consumed at least one Token\n        // In this CstNode.\n        if (loc.startOffset <= prevToken.startOffset === true) {\n            loc.endOffset = prevToken.endOffset;\n            loc.endLine = prevToken.endLine;\n            loc.endColumn = prevToken.endColumn;\n        }\n        // \"empty\" CstNode edge case\n        else {\n            loc.startOffset = NaN;\n            loc.startLine = NaN;\n            loc.startColumn = NaN;\n        }\n    }\n    cstPostRuleOnlyOffset(ruleCstNode) {\n        const prevToken = this.LA(0);\n        // `location' is not null because `cstPostRuleOnlyOffset` will only be invoked when location tracking is enabled.\n        const loc = ruleCstNode.location;\n        // If this condition is true it means we consumed at least one Token\n        // In this CstNode.\n        if (loc.startOffset <= prevToken.startOffset === true) {\n            loc.endOffset = prevToken.endOffset;\n        }\n        // \"empty\" CstNode edge case\n        else {\n            loc.startOffset = NaN;\n        }\n    }\n    cstPostTerminal(key, consumedToken) {\n        const rootCst = this.CST_STACK[this.CST_STACK.length - 1];\n        addTerminalToCst(rootCst, consumedToken, key);\n        // This is only used when **both** error recovery and CST Output are enabled.\n        this.setNodeLocationFromToken(rootCst.location, consumedToken);\n    }\n    cstPostNonTerminal(ruleCstResult, ruleName) {\n        const preCstNode = this.CST_STACK[this.CST_STACK.length - 1];\n        addNoneTerminalToCst(preCstNode, ruleName, ruleCstResult);\n        // This is only used when **both** error recovery and CST Output are enabled.\n        this.setNodeLocationFromNode(preCstNode.location, ruleCstResult.location);\n    }\n    getBaseCstVisitorConstructor() {\n        if (isUndefined(this.baseCstVisitorConstructor)) {\n            const newBaseCstVisitorConstructor = createBaseSemanticVisitorConstructor(this.className, keys(this.gastProductionsCache));\n            this.baseCstVisitorConstructor = newBaseCstVisitorConstructor;\n            return newBaseCstVisitorConstructor;\n        }\n        return this.baseCstVisitorConstructor;\n    }\n    getBaseCstVisitorConstructorWithDefaults() {\n        if (isUndefined(this.baseCstVisitorWithDefaultsConstructor)) {\n            const newConstructor = createBaseVisitorConstructorWithDefaults(this.className, keys(this.gastProductionsCache), this.getBaseCstVisitorConstructor());\n            this.baseCstVisitorWithDefaultsConstructor = newConstructor;\n            return newConstructor;\n        }\n        return this.baseCstVisitorWithDefaultsConstructor;\n    }\n    getLastExplicitRuleShortName() {\n        const ruleStack = this.RULE_STACK;\n        return ruleStack[ruleStack.length - 1];\n    }\n    getPreviousExplicitRuleShortName() {\n        const ruleStack = this.RULE_STACK;\n        return ruleStack[ruleStack.length - 2];\n    }\n    getLastExplicitRuleOccurrenceIndex() {\n        const occurrenceStack = this.RULE_OCCURRENCE_STACK;\n        return occurrenceStack[occurrenceStack.length - 1];\n    }\n}\n//# sourceMappingURL=tree_builder.js.map","import { END_OF_FILE } from \"../parser.js\";\n/**\n * Trait responsible abstracting over the interaction with Lexer output (Token vector).\n *\n * This could be generalized to support other kinds of lexers, e.g.\n * - Just in Time Lexing / Lexer-Less parsing.\n * - Streaming Lexer.\n */\nexport class LexerAdapter {\n    initLexerAdapter() {\n        this.tokVector = [];\n        this.tokVectorLength = 0;\n        this.currIdx = -1;\n    }\n    set input(newInput) {\n        // @ts-ignore - `this parameter` not supported in setters/getters\n        //   - https://www.typescriptlang.org/docs/handbook/functions.html#this-parameters\n        if (this.selfAnalysisDone !== true) {\n            throw Error(`Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.`);\n        }\n        // @ts-ignore - `this parameter` not supported in setters/getters\n        //   - https://www.typescriptlang.org/docs/handbook/functions.html#this-parameters\n        this.reset();\n        this.tokVector = newInput;\n        this.tokVectorLength = newInput.length;\n    }\n    get input() {\n        return this.tokVector;\n    }\n    // skips a token and returns the next token\n    SKIP_TOKEN() {\n        if (this.currIdx <= this.tokVector.length - 2) {\n            this.consumeToken();\n            return this.LA(1);\n        }\n        else {\n            return END_OF_FILE;\n        }\n    }\n    // Lexer (accessing Token vector) related methods which can be overridden to implement lazy lexers\n    // or lexers dependent on parser context.\n    LA(howMuch) {\n        const soughtIdx = this.currIdx + howMuch;\n        if (soughtIdx < 0 || this.tokVectorLength <= soughtIdx) {\n            return END_OF_FILE;\n        }\n        else {\n            return this.tokVector[soughtIdx];\n        }\n    }\n    consumeToken() {\n        this.currIdx++;\n    }\n    exportLexerState() {\n        return this.currIdx;\n    }\n    importLexerState(newState) {\n        this.currIdx = newState;\n    }\n    resetLexerState() {\n        this.currIdx = -1;\n    }\n    moveToTerminatedState() {\n        this.currIdx = this.tokVector.length - 1;\n    }\n    getLexerPosition() {\n        return this.exportLexerState();\n    }\n}\n//# sourceMappingURL=lexer_adapter.js.map","import { includes, values } from \"lodash-es\";\nimport { isRecognitionException } from \"../../exceptions_public.js\";\nimport { DEFAULT_RULE_CONFIG, ParserDefinitionErrorType } from \"../parser.js\";\nimport { defaultGrammarValidatorErrorProvider } from \"../../errors_public.js\";\nimport { validateRuleIsOverridden } from \"../../grammar/checks.js\";\nimport { serializeGrammar } from \"@chevrotain/gast\";\n/**\n * This trait is responsible for implementing the public API\n * for defining Chevrotain parsers, i.e:\n * - CONSUME\n * - RULE\n * - OPTION\n * - ...\n */\nexport class RecognizerApi {\n    ACTION(impl) {\n        return impl.call(this);\n    }\n    consume(idx, tokType, options) {\n        return this.consumeInternal(tokType, idx, options);\n    }\n    subrule(idx, ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, idx, options);\n    }\n    option(idx, actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, idx);\n    }\n    or(idx, altsOrOpts) {\n        return this.orInternal(altsOrOpts, idx);\n    }\n    many(idx, actionORMethodDef) {\n        return this.manyInternal(idx, actionORMethodDef);\n    }\n    atLeastOne(idx, actionORMethodDef) {\n        return this.atLeastOneInternal(idx, actionORMethodDef);\n    }\n    CONSUME(tokType, options) {\n        return this.consumeInternal(tokType, 0, options);\n    }\n    CONSUME1(tokType, options) {\n        return this.consumeInternal(tokType, 1, options);\n    }\n    CONSUME2(tokType, options) {\n        return this.consumeInternal(tokType, 2, options);\n    }\n    CONSUME3(tokType, options) {\n        return this.consumeInternal(tokType, 3, options);\n    }\n    CONSUME4(tokType, options) {\n        return this.consumeInternal(tokType, 4, options);\n    }\n    CONSUME5(tokType, options) {\n        return this.consumeInternal(tokType, 5, options);\n    }\n    CONSUME6(tokType, options) {\n        return this.consumeInternal(tokType, 6, options);\n    }\n    CONSUME7(tokType, options) {\n        return this.consumeInternal(tokType, 7, options);\n    }\n    CONSUME8(tokType, options) {\n        return this.consumeInternal(tokType, 8, options);\n    }\n    CONSUME9(tokType, options) {\n        return this.consumeInternal(tokType, 9, options);\n    }\n    SUBRULE(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 0, options);\n    }\n    SUBRULE1(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 1, options);\n    }\n    SUBRULE2(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 2, options);\n    }\n    SUBRULE3(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 3, options);\n    }\n    SUBRULE4(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 4, options);\n    }\n    SUBRULE5(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 5, options);\n    }\n    SUBRULE6(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 6, options);\n    }\n    SUBRULE7(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 7, options);\n    }\n    SUBRULE8(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 8, options);\n    }\n    SUBRULE9(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 9, options);\n    }\n    OPTION(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 0);\n    }\n    OPTION1(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 1);\n    }\n    OPTION2(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 2);\n    }\n    OPTION3(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 3);\n    }\n    OPTION4(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 4);\n    }\n    OPTION5(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 5);\n    }\n    OPTION6(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 6);\n    }\n    OPTION7(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 7);\n    }\n    OPTION8(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 8);\n    }\n    OPTION9(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 9);\n    }\n    OR(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 0);\n    }\n    OR1(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 1);\n    }\n    OR2(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 2);\n    }\n    OR3(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 3);\n    }\n    OR4(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 4);\n    }\n    OR5(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 5);\n    }\n    OR6(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 6);\n    }\n    OR7(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 7);\n    }\n    OR8(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 8);\n    }\n    OR9(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 9);\n    }\n    MANY(actionORMethodDef) {\n        this.manyInternal(0, actionORMethodDef);\n    }\n    MANY1(actionORMethodDef) {\n        this.manyInternal(1, actionORMethodDef);\n    }\n    MANY2(actionORMethodDef) {\n        this.manyInternal(2, actionORMethodDef);\n    }\n    MANY3(actionORMethodDef) {\n        this.manyInternal(3, actionORMethodDef);\n    }\n    MANY4(actionORMethodDef) {\n        this.manyInternal(4, actionORMethodDef);\n    }\n    MANY5(actionORMethodDef) {\n        this.manyInternal(5, actionORMethodDef);\n    }\n    MANY6(actionORMethodDef) {\n        this.manyInternal(6, actionORMethodDef);\n    }\n    MANY7(actionORMethodDef) {\n        this.manyInternal(7, actionORMethodDef);\n    }\n    MANY8(actionORMethodDef) {\n        this.manyInternal(8, actionORMethodDef);\n    }\n    MANY9(actionORMethodDef) {\n        this.manyInternal(9, actionORMethodDef);\n    }\n    MANY_SEP(options) {\n        this.manySepFirstInternal(0, options);\n    }\n    MANY_SEP1(options) {\n        this.manySepFirstInternal(1, options);\n    }\n    MANY_SEP2(options) {\n        this.manySepFirstInternal(2, options);\n    }\n    MANY_SEP3(options) {\n        this.manySepFirstInternal(3, options);\n    }\n    MANY_SEP4(options) {\n        this.manySepFirstInternal(4, options);\n    }\n    MANY_SEP5(options) {\n        this.manySepFirstInternal(5, options);\n    }\n    MANY_SEP6(options) {\n        this.manySepFirstInternal(6, options);\n    }\n    MANY_SEP7(options) {\n        this.manySepFirstInternal(7, options);\n    }\n    MANY_SEP8(options) {\n        this.manySepFirstInternal(8, options);\n    }\n    MANY_SEP9(options) {\n        this.manySepFirstInternal(9, options);\n    }\n    AT_LEAST_ONE(actionORMethodDef) {\n        this.atLeastOneInternal(0, actionORMethodDef);\n    }\n    AT_LEAST_ONE1(actionORMethodDef) {\n        return this.atLeastOneInternal(1, actionORMethodDef);\n    }\n    AT_LEAST_ONE2(actionORMethodDef) {\n        this.atLeastOneInternal(2, actionORMethodDef);\n    }\n    AT_LEAST_ONE3(actionORMethodDef) {\n        this.atLeastOneInternal(3, actionORMethodDef);\n    }\n    AT_LEAST_ONE4(actionORMethodDef) {\n        this.atLeastOneInternal(4, actionORMethodDef);\n    }\n    AT_LEAST_ONE5(actionORMethodDef) {\n        this.atLeastOneInternal(5, actionORMethodDef);\n    }\n    AT_LEAST_ONE6(actionORMethodDef) {\n        this.atLeastOneInternal(6, actionORMethodDef);\n    }\n    AT_LEAST_ONE7(actionORMethodDef) {\n        this.atLeastOneInternal(7, actionORMethodDef);\n    }\n    AT_LEAST_ONE8(actionORMethodDef) {\n        this.atLeastOneInternal(8, actionORMethodDef);\n    }\n    AT_LEAST_ONE9(actionORMethodDef) {\n        this.atLeastOneInternal(9, actionORMethodDef);\n    }\n    AT_LEAST_ONE_SEP(options) {\n        this.atLeastOneSepFirstInternal(0, options);\n    }\n    AT_LEAST_ONE_SEP1(options) {\n        this.atLeastOneSepFirstInternal(1, options);\n    }\n    AT_LEAST_ONE_SEP2(options) {\n        this.atLeastOneSepFirstInternal(2, options);\n    }\n    AT_LEAST_ONE_SEP3(options) {\n        this.atLeastOneSepFirstInternal(3, options);\n    }\n    AT_LEAST_ONE_SEP4(options) {\n        this.atLeastOneSepFirstInternal(4, options);\n    }\n    AT_LEAST_ONE_SEP5(options) {\n        this.atLeastOneSepFirstInternal(5, options);\n    }\n    AT_LEAST_ONE_SEP6(options) {\n        this.atLeastOneSepFirstInternal(6, options);\n    }\n    AT_LEAST_ONE_SEP7(options) {\n        this.atLeastOneSepFirstInternal(7, options);\n    }\n    AT_LEAST_ONE_SEP8(options) {\n        this.atLeastOneSepFirstInternal(8, options);\n    }\n    AT_LEAST_ONE_SEP9(options) {\n        this.atLeastOneSepFirstInternal(9, options);\n    }\n    RULE(name, implementation, config = DEFAULT_RULE_CONFIG) {\n        if (includes(this.definedRulesNames, name)) {\n            const errMsg = defaultGrammarValidatorErrorProvider.buildDuplicateRuleNameError({\n                topLevelRule: name,\n                grammarName: this.className,\n            });\n            const error = {\n                message: errMsg,\n                type: ParserDefinitionErrorType.DUPLICATE_RULE_NAME,\n                ruleName: name,\n            };\n            this.definitionErrors.push(error);\n        }\n        this.definedRulesNames.push(name);\n        const ruleImplementation = this.defineRule(name, implementation, config);\n        this[name] = ruleImplementation;\n        return ruleImplementation;\n    }\n    OVERRIDE_RULE(name, impl, config = DEFAULT_RULE_CONFIG) {\n        const ruleErrors = validateRuleIsOverridden(name, this.definedRulesNames, this.className);\n        this.definitionErrors = this.definitionErrors.concat(ruleErrors);\n        const ruleImplementation = this.defineRule(name, impl, config);\n        this[name] = ruleImplementation;\n        return ruleImplementation;\n    }\n    BACKTRACK(grammarRule, args) {\n        return function () {\n            // save org state\n            this.isBackTrackingStack.push(1);\n            const orgState = this.saveRecogState();\n            try {\n                grammarRule.apply(this, args);\n                // if no exception was thrown we have succeed parsing the rule.\n                return true;\n            }\n            catch (e) {\n                if (isRecognitionException(e)) {\n                    return false;\n                }\n                else {\n                    throw e;\n                }\n            }\n            finally {\n                this.reloadRecogState(orgState);\n                this.isBackTrackingStack.pop();\n            }\n        };\n    }\n    // GAST export APIs\n    getGAstProductions() {\n        return this.gastProductionsCache;\n    }\n    getSerializedGastProductions() {\n        return serializeGrammar(values(this.gastProductionsCache));\n    }\n}\n//# sourceMappingURL=recognizer_api.js.map","import { clone, every, flatten, has, isArray, isEmpty, isObject, reduce, uniq, values, } from \"lodash-es\";\nimport { AT_LEAST_ONE_IDX, AT_LEAST_ONE_SEP_IDX, BITS_FOR_METHOD_TYPE, BITS_FOR_OCCURRENCE_IDX, MANY_IDX, MANY_SEP_IDX, OPTION_IDX, OR_IDX, } from \"../../grammar/keys.js\";\nimport { isRecognitionException, MismatchedTokenException, NotAllInputParsedException, } from \"../../exceptions_public.js\";\nimport { PROD_TYPE } from \"../../grammar/lookahead.js\";\nimport { NextTerminalAfterAtLeastOneSepWalker, NextTerminalAfterAtLeastOneWalker, NextTerminalAfterManySepWalker, NextTerminalAfterManyWalker, } from \"../../grammar/interpreter.js\";\nimport { DEFAULT_RULE_CONFIG } from \"../parser.js\";\nimport { IN_RULE_RECOVERY_EXCEPTION } from \"./recoverable.js\";\nimport { EOF } from \"../../../scan/tokens_public.js\";\nimport { augmentTokenTypes, isTokenType, tokenStructuredMatcher, tokenStructuredMatcherNoCategories, } from \"../../../scan/tokens.js\";\n/**\n * This trait is responsible for the runtime parsing engine\n * Used by the official API (recognizer_api.ts)\n */\nexport class RecognizerEngine {\n    initRecognizerEngine(tokenVocabulary, config) {\n        this.className = this.constructor.name;\n        // TODO: would using an ES6 Map or plain object be faster (CST building scenario)\n        this.shortRuleNameToFull = {};\n        this.fullRuleNameToShort = {};\n        this.ruleShortNameIdx = 256;\n        this.tokenMatcher = tokenStructuredMatcherNoCategories;\n        this.subruleIdx = 0;\n        this.definedRulesNames = [];\n        this.tokensMap = {};\n        this.isBackTrackingStack = [];\n        this.RULE_STACK = [];\n        this.RULE_OCCURRENCE_STACK = [];\n        this.gastProductionsCache = {};\n        if (has(config, \"serializedGrammar\")) {\n            throw Error(\"The Parser's configuration can no longer contain a <serializedGrammar> property.\\n\" +\n                \"\\tSee: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0\\n\" +\n                \"\\tFor Further details.\");\n        }\n        if (isArray(tokenVocabulary)) {\n            // This only checks for Token vocabularies provided as arrays.\n            // That is good enough because the main objective is to detect users of pre-V4.0 APIs\n            // rather than all edge cases of empty Token vocabularies.\n            if (isEmpty(tokenVocabulary)) {\n                throw Error(\"A Token Vocabulary cannot be empty.\\n\" +\n                    \"\\tNote that the first argument for the parser constructor\\n\" +\n                    \"\\tis no longer a Token vector (since v4.0).\");\n            }\n            if (typeof tokenVocabulary[0].startOffset === \"number\") {\n                throw Error(\"The Parser constructor no longer accepts a token vector as the first argument.\\n\" +\n                    \"\\tSee: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0\\n\" +\n                    \"\\tFor Further details.\");\n            }\n        }\n        if (isArray(tokenVocabulary)) {\n            this.tokensMap = reduce(tokenVocabulary, (acc, tokType) => {\n                acc[tokType.name] = tokType;\n                return acc;\n            }, {});\n        }\n        else if (has(tokenVocabulary, \"modes\") &&\n            every(flatten(values(tokenVocabulary.modes)), isTokenType)) {\n            const allTokenTypes = flatten(values(tokenVocabulary.modes));\n            const uniqueTokens = uniq(allTokenTypes);\n            this.tokensMap = reduce(uniqueTokens, (acc, tokType) => {\n                acc[tokType.name] = tokType;\n                return acc;\n            }, {});\n        }\n        else if (isObject(tokenVocabulary)) {\n            this.tokensMap = clone(tokenVocabulary);\n        }\n        else {\n            throw new Error(\"<tokensDictionary> argument must be An Array of Token constructors,\" +\n                \" A dictionary of Token constructors or an IMultiModeLexerDefinition\");\n        }\n        // always add EOF to the tokenNames -> constructors map. it is useful to assure all the input has been\n        // parsed with a clear error message (\"expecting EOF but found ...\")\n        this.tokensMap[\"EOF\"] = EOF;\n        const allTokenTypes = has(tokenVocabulary, \"modes\")\n            ? flatten(values(tokenVocabulary.modes))\n            : values(tokenVocabulary);\n        const noTokenCategoriesUsed = every(allTokenTypes, (tokenConstructor) => isEmpty(tokenConstructor.categoryMatches));\n        this.tokenMatcher = noTokenCategoriesUsed\n            ? tokenStructuredMatcherNoCategories\n            : tokenStructuredMatcher;\n        // Because ES2015+ syntax should be supported for creating Token classes\n        // We cannot assume that the Token classes were created using the \"extendToken\" utilities\n        // Therefore we must augment the Token classes both on Lexer initialization and on Parser initialization\n        augmentTokenTypes(values(this.tokensMap));\n    }\n    defineRule(ruleName, impl, config) {\n        if (this.selfAnalysisDone) {\n            throw Error(`Grammar rule <${ruleName}> may not be defined after the 'performSelfAnalysis' method has been called'\\n` +\n                `Make sure that all grammar rule definitions are done before 'performSelfAnalysis' is called.`);\n        }\n        const resyncEnabled = has(config, \"resyncEnabled\")\n            ? config.resyncEnabled // assumes end user provides the correct config value/type\n            : DEFAULT_RULE_CONFIG.resyncEnabled;\n        const recoveryValueFunc = has(config, \"recoveryValueFunc\")\n            ? config.recoveryValueFunc // assumes end user provides the correct config value/type\n            : DEFAULT_RULE_CONFIG.recoveryValueFunc;\n        // performance optimization: Use small integers as keys for the longer human readable \"full\" rule names.\n        // this greatly improves Map access time (as much as 8% for some performance benchmarks).\n        const shortName = this.ruleShortNameIdx << (BITS_FOR_METHOD_TYPE + BITS_FOR_OCCURRENCE_IDX);\n        this.ruleShortNameIdx++;\n        this.shortRuleNameToFull[shortName] = ruleName;\n        this.fullRuleNameToShort[ruleName] = shortName;\n        let invokeRuleWithTry;\n        // Micro optimization, only check the condition **once** on rule definition\n        // instead of **every single** rule invocation.\n        if (this.outputCst === true) {\n            invokeRuleWithTry = function invokeRuleWithTry(...args) {\n                try {\n                    this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);\n                    impl.apply(this, args);\n                    const cst = this.CST_STACK[this.CST_STACK.length - 1];\n                    this.cstPostRule(cst);\n                    return cst;\n                }\n                catch (e) {\n                    return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc);\n                }\n                finally {\n                    this.ruleFinallyStateUpdate();\n                }\n            };\n        }\n        else {\n            invokeRuleWithTry = function invokeRuleWithTryCst(...args) {\n                try {\n                    this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);\n                    return impl.apply(this, args);\n                }\n                catch (e) {\n                    return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc);\n                }\n                finally {\n                    this.ruleFinallyStateUpdate();\n                }\n            };\n        }\n        const wrappedGrammarRule = Object.assign(invokeRuleWithTry, { ruleName, originalGrammarAction: impl });\n        return wrappedGrammarRule;\n    }\n    invokeRuleCatch(e, resyncEnabledConfig, recoveryValueFunc) {\n        const isFirstInvokedRule = this.RULE_STACK.length === 1;\n        // note the reSync is always enabled for the first rule invocation, because we must always be able to\n        // reSync with EOF and just output some INVALID ParseTree\n        // during backtracking reSync recovery is disabled, otherwise we can't be certain the backtracking\n        // path is really the most valid one\n        const reSyncEnabled = resyncEnabledConfig && !this.isBackTracking() && this.recoveryEnabled;\n        if (isRecognitionException(e)) {\n            const recogError = e;\n            if (reSyncEnabled) {\n                const reSyncTokType = this.findReSyncTokenType();\n                if (this.isInCurrentRuleReSyncSet(reSyncTokType)) {\n                    recogError.resyncedTokens = this.reSyncTo(reSyncTokType);\n                    if (this.outputCst) {\n                        const partialCstResult = this.CST_STACK[this.CST_STACK.length - 1];\n                        partialCstResult.recoveredNode = true;\n                        return partialCstResult;\n                    }\n                    else {\n                        return recoveryValueFunc(e);\n                    }\n                }\n                else {\n                    if (this.outputCst) {\n                        const partialCstResult = this.CST_STACK[this.CST_STACK.length - 1];\n                        partialCstResult.recoveredNode = true;\n                        recogError.partialCstResult = partialCstResult;\n                    }\n                    // to be handled Further up the call stack\n                    throw recogError;\n                }\n            }\n            else if (isFirstInvokedRule) {\n                // otherwise a Redundant input error will be created as well and we cannot guarantee that this is indeed the case\n                this.moveToTerminatedState();\n                // the parser should never throw one of its own errors outside its flow.\n                // even if error recovery is disabled\n                return recoveryValueFunc(e);\n            }\n            else {\n                // to be recovered Further up the call stack\n                throw recogError;\n            }\n        }\n        else {\n            // some other Error type which we don't know how to handle (for example a built in JavaScript Error)\n            throw e;\n        }\n    }\n    // Implementation of parsing DSL\n    optionInternal(actionORMethodDef, occurrence) {\n        const key = this.getKeyForAutomaticLookahead(OPTION_IDX, occurrence);\n        return this.optionInternalLogic(actionORMethodDef, occurrence, key);\n    }\n    optionInternalLogic(actionORMethodDef, occurrence, key) {\n        let lookAheadFunc = this.getLaFuncFromCache(key);\n        let action;\n        if (typeof actionORMethodDef !== \"function\") {\n            action = actionORMethodDef.DEF;\n            const predicate = actionORMethodDef.GATE;\n            // predicate present\n            if (predicate !== undefined) {\n                const orgLookaheadFunction = lookAheadFunc;\n                lookAheadFunc = () => {\n                    return predicate.call(this) && orgLookaheadFunction.call(this);\n                };\n            }\n        }\n        else {\n            action = actionORMethodDef;\n        }\n        if (lookAheadFunc.call(this) === true) {\n            return action.call(this);\n        }\n        return undefined;\n    }\n    atLeastOneInternal(prodOccurrence, actionORMethodDef) {\n        const laKey = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_IDX, prodOccurrence);\n        return this.atLeastOneInternalLogic(prodOccurrence, actionORMethodDef, laKey);\n    }\n    atLeastOneInternalLogic(prodOccurrence, actionORMethodDef, key) {\n        let lookAheadFunc = this.getLaFuncFromCache(key);\n        let action;\n        if (typeof actionORMethodDef !== \"function\") {\n            action = actionORMethodDef.DEF;\n            const predicate = actionORMethodDef.GATE;\n            // predicate present\n            if (predicate !== undefined) {\n                const orgLookaheadFunction = lookAheadFunc;\n                lookAheadFunc = () => {\n                    return predicate.call(this) && orgLookaheadFunction.call(this);\n                };\n            }\n        }\n        else {\n            action = actionORMethodDef;\n        }\n        if (lookAheadFunc.call(this) === true) {\n            let notStuck = this.doSingleRepetition(action);\n            while (lookAheadFunc.call(this) === true &&\n                notStuck === true) {\n                notStuck = this.doSingleRepetition(action);\n            }\n        }\n        else {\n            throw this.raiseEarlyExitException(prodOccurrence, PROD_TYPE.REPETITION_MANDATORY, actionORMethodDef.ERR_MSG);\n        }\n        // note that while it may seem that this can cause an error because by using a recursive call to\n        // AT_LEAST_ONE we change the grammar to AT_LEAST_TWO, AT_LEAST_THREE ... , the possible recursive call\n        // from the tryInRepetitionRecovery(...) will only happen IFF there really are TWO/THREE/.... items.\n        // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n        this.attemptInRepetitionRecovery(this.atLeastOneInternal, [prodOccurrence, actionORMethodDef], lookAheadFunc, AT_LEAST_ONE_IDX, prodOccurrence, NextTerminalAfterAtLeastOneWalker);\n    }\n    atLeastOneSepFirstInternal(prodOccurrence, options) {\n        const laKey = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_SEP_IDX, prodOccurrence);\n        this.atLeastOneSepFirstInternalLogic(prodOccurrence, options, laKey);\n    }\n    atLeastOneSepFirstInternalLogic(prodOccurrence, options, key) {\n        const action = options.DEF;\n        const separator = options.SEP;\n        const firstIterationLookaheadFunc = this.getLaFuncFromCache(key);\n        // 1st iteration\n        if (firstIterationLookaheadFunc.call(this) === true) {\n            action.call(this);\n            //  TODO: Optimization can move this function construction into \"attemptInRepetitionRecovery\"\n            //  because it is only needed in error recovery scenarios.\n            const separatorLookAheadFunc = () => {\n                return this.tokenMatcher(this.LA(1), separator);\n            };\n            // 2nd..nth iterations\n            while (this.tokenMatcher(this.LA(1), separator) === true) {\n                // note that this CONSUME will never enter recovery because\n                // the separatorLookAheadFunc checks that the separator really does exist.\n                this.CONSUME(separator);\n                // No need for checking infinite loop here due to consuming the separator.\n                action.call(this);\n            }\n            // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n            this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [\n                prodOccurrence,\n                separator,\n                separatorLookAheadFunc,\n                action,\n                NextTerminalAfterAtLeastOneSepWalker,\n            ], separatorLookAheadFunc, AT_LEAST_ONE_SEP_IDX, prodOccurrence, NextTerminalAfterAtLeastOneSepWalker);\n        }\n        else {\n            throw this.raiseEarlyExitException(prodOccurrence, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, options.ERR_MSG);\n        }\n    }\n    manyInternal(prodOccurrence, actionORMethodDef) {\n        const laKey = this.getKeyForAutomaticLookahead(MANY_IDX, prodOccurrence);\n        return this.manyInternalLogic(prodOccurrence, actionORMethodDef, laKey);\n    }\n    manyInternalLogic(prodOccurrence, actionORMethodDef, key) {\n        let lookaheadFunction = this.getLaFuncFromCache(key);\n        let action;\n        if (typeof actionORMethodDef !== \"function\") {\n            action = actionORMethodDef.DEF;\n            const predicate = actionORMethodDef.GATE;\n            // predicate present\n            if (predicate !== undefined) {\n                const orgLookaheadFunction = lookaheadFunction;\n                lookaheadFunction = () => {\n                    return predicate.call(this) && orgLookaheadFunction.call(this);\n                };\n            }\n        }\n        else {\n            action = actionORMethodDef;\n        }\n        let notStuck = true;\n        while (lookaheadFunction.call(this) === true && notStuck === true) {\n            notStuck = this.doSingleRepetition(action);\n        }\n        // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n        this.attemptInRepetitionRecovery(this.manyInternal, [prodOccurrence, actionORMethodDef], lookaheadFunction, MANY_IDX, prodOccurrence, NextTerminalAfterManyWalker, \n        // The notStuck parameter is only relevant when \"attemptInRepetitionRecovery\"\n        // is invoked from manyInternal, in the MANY_SEP case and AT_LEAST_ONE[_SEP]\n        // An infinite loop cannot occur as:\n        // - Either the lookahead is guaranteed to consume something (Single Token Separator)\n        // - AT_LEAST_ONE by definition is guaranteed to consume something (or error out).\n        notStuck);\n    }\n    manySepFirstInternal(prodOccurrence, options) {\n        const laKey = this.getKeyForAutomaticLookahead(MANY_SEP_IDX, prodOccurrence);\n        this.manySepFirstInternalLogic(prodOccurrence, options, laKey);\n    }\n    manySepFirstInternalLogic(prodOccurrence, options, key) {\n        const action = options.DEF;\n        const separator = options.SEP;\n        const firstIterationLaFunc = this.getLaFuncFromCache(key);\n        // 1st iteration\n        if (firstIterationLaFunc.call(this) === true) {\n            action.call(this);\n            const separatorLookAheadFunc = () => {\n                return this.tokenMatcher(this.LA(1), separator);\n            };\n            // 2nd..nth iterations\n            while (this.tokenMatcher(this.LA(1), separator) === true) {\n                // note that this CONSUME will never enter recovery because\n                // the separatorLookAheadFunc checks that the separator really does exist.\n                this.CONSUME(separator);\n                // No need for checking infinite loop here due to consuming the separator.\n                action.call(this);\n            }\n            // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n            this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [\n                prodOccurrence,\n                separator,\n                separatorLookAheadFunc,\n                action,\n                NextTerminalAfterManySepWalker,\n            ], separatorLookAheadFunc, MANY_SEP_IDX, prodOccurrence, NextTerminalAfterManySepWalker);\n        }\n    }\n    repetitionSepSecondInternal(prodOccurrence, separator, separatorLookAheadFunc, action, nextTerminalAfterWalker) {\n        while (separatorLookAheadFunc()) {\n            // note that this CONSUME will never enter recovery because\n            // the separatorLookAheadFunc checks that the separator really does exist.\n            this.CONSUME(separator);\n            action.call(this);\n        }\n        // we can only arrive to this function after an error\n        // has occurred (hence the name 'second') so the following\n        // IF will always be entered, its possible to remove it...\n        // however it is kept to avoid confusion and be consistent.\n        // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n        /* istanbul ignore else */\n        this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [\n            prodOccurrence,\n            separator,\n            separatorLookAheadFunc,\n            action,\n            nextTerminalAfterWalker,\n        ], separatorLookAheadFunc, AT_LEAST_ONE_SEP_IDX, prodOccurrence, nextTerminalAfterWalker);\n    }\n    doSingleRepetition(action) {\n        const beforeIteration = this.getLexerPosition();\n        action.call(this);\n        const afterIteration = this.getLexerPosition();\n        // This boolean will indicate if this repetition progressed\n        // or if we are \"stuck\" (potential infinite loop in the repetition).\n        return afterIteration > beforeIteration;\n    }\n    orInternal(altsOrOpts, occurrence) {\n        const laKey = this.getKeyForAutomaticLookahead(OR_IDX, occurrence);\n        const alts = isArray(altsOrOpts) ? altsOrOpts : altsOrOpts.DEF;\n        const laFunc = this.getLaFuncFromCache(laKey);\n        const altIdxToTake = laFunc.call(this, alts);\n        if (altIdxToTake !== undefined) {\n            const chosenAlternative = alts[altIdxToTake];\n            return chosenAlternative.ALT.call(this);\n        }\n        this.raiseNoAltException(occurrence, altsOrOpts.ERR_MSG);\n    }\n    ruleFinallyStateUpdate() {\n        this.RULE_STACK.pop();\n        this.RULE_OCCURRENCE_STACK.pop();\n        // NOOP when cst is disabled\n        this.cstFinallyStateUpdate();\n        if (this.RULE_STACK.length === 0 && this.isAtEndOfInput() === false) {\n            const firstRedundantTok = this.LA(1);\n            const errMsg = this.errorMessageProvider.buildNotAllInputParsedMessage({\n                firstRedundant: firstRedundantTok,\n                ruleName: this.getCurrRuleFullName(),\n            });\n            this.SAVE_ERROR(new NotAllInputParsedException(errMsg, firstRedundantTok));\n        }\n    }\n    subruleInternal(ruleToCall, idx, options) {\n        let ruleResult;\n        try {\n            const args = options !== undefined ? options.ARGS : undefined;\n            this.subruleIdx = idx;\n            ruleResult = ruleToCall.apply(this, args);\n            this.cstPostNonTerminal(ruleResult, options !== undefined && options.LABEL !== undefined\n                ? options.LABEL\n                : ruleToCall.ruleName);\n            return ruleResult;\n        }\n        catch (e) {\n            throw this.subruleInternalError(e, options, ruleToCall.ruleName);\n        }\n    }\n    subruleInternalError(e, options, ruleName) {\n        if (isRecognitionException(e) && e.partialCstResult !== undefined) {\n            this.cstPostNonTerminal(e.partialCstResult, options !== undefined && options.LABEL !== undefined\n                ? options.LABEL\n                : ruleName);\n            delete e.partialCstResult;\n        }\n        throw e;\n    }\n    consumeInternal(tokType, idx, options) {\n        let consumedToken;\n        try {\n            const nextToken = this.LA(1);\n            if (this.tokenMatcher(nextToken, tokType) === true) {\n                this.consumeToken();\n                consumedToken = nextToken;\n            }\n            else {\n                this.consumeInternalError(tokType, nextToken, options);\n            }\n        }\n        catch (eFromConsumption) {\n            consumedToken = this.consumeInternalRecovery(tokType, idx, eFromConsumption);\n        }\n        this.cstPostTerminal(options !== undefined && options.LABEL !== undefined\n            ? options.LABEL\n            : tokType.name, consumedToken);\n        return consumedToken;\n    }\n    consumeInternalError(tokType, nextToken, options) {\n        let msg;\n        const previousToken = this.LA(0);\n        if (options !== undefined && options.ERR_MSG) {\n            msg = options.ERR_MSG;\n        }\n        else {\n            msg = this.errorMessageProvider.buildMismatchTokenMessage({\n                expected: tokType,\n                actual: nextToken,\n                previous: previousToken,\n                ruleName: this.getCurrRuleFullName(),\n            });\n        }\n        throw this.SAVE_ERROR(new MismatchedTokenException(msg, nextToken, previousToken));\n    }\n    consumeInternalRecovery(tokType, idx, eFromConsumption) {\n        // no recovery allowed during backtracking, otherwise backtracking may recover invalid syntax and accept it\n        // but the original syntax could have been parsed successfully without any backtracking + recovery\n        if (this.recoveryEnabled &&\n            // TODO: more robust checking of the exception type. Perhaps Typescript extending expressions?\n            eFromConsumption.name === \"MismatchedTokenException\" &&\n            !this.isBackTracking()) {\n            const follows = this.getFollowsForInRuleRecovery(tokType, idx);\n            try {\n                return this.tryInRuleRecovery(tokType, follows);\n            }\n            catch (eFromInRuleRecovery) {\n                if (eFromInRuleRecovery.name === IN_RULE_RECOVERY_EXCEPTION) {\n                    // failed in RuleRecovery.\n                    // throw the original error in order to trigger reSync error recovery\n                    throw eFromConsumption;\n                }\n                else {\n                    throw eFromInRuleRecovery;\n                }\n            }\n        }\n        else {\n            throw eFromConsumption;\n        }\n    }\n    saveRecogState() {\n        // errors is a getter which will clone the errors array\n        const savedErrors = this.errors;\n        const savedRuleStack = clone(this.RULE_STACK);\n        return {\n            errors: savedErrors,\n            lexerState: this.exportLexerState(),\n            RULE_STACK: savedRuleStack,\n            CST_STACK: this.CST_STACK,\n        };\n    }\n    reloadRecogState(newState) {\n        this.errors = newState.errors;\n        this.importLexerState(newState.lexerState);\n        this.RULE_STACK = newState.RULE_STACK;\n    }\n    ruleInvocationStateUpdate(shortName, fullName, idxInCallingRule) {\n        this.RULE_OCCURRENCE_STACK.push(idxInCallingRule);\n        this.RULE_STACK.push(shortName);\n        // NOOP when cst is disabled\n        this.cstInvocationStateUpdate(fullName);\n    }\n    isBackTracking() {\n        return this.isBackTrackingStack.length !== 0;\n    }\n    getCurrRuleFullName() {\n        const shortName = this.getLastExplicitRuleShortName();\n        return this.shortRuleNameToFull[shortName];\n    }\n    shortRuleNameToFullName(shortName) {\n        return this.shortRuleNameToFull[shortName];\n    }\n    isAtEndOfInput() {\n        return this.tokenMatcher(this.LA(1), EOF);\n    }\n    reset() {\n        this.resetLexerState();\n        this.subruleIdx = 0;\n        this.isBackTrackingStack = [];\n        this.errors = [];\n        this.RULE_STACK = [];\n        // TODO: extract a specific reset for TreeBuilder trait\n        this.CST_STACK = [];\n        this.RULE_OCCURRENCE_STACK = [];\n    }\n}\n//# sourceMappingURL=recognizer_engine.js.map","import { EarlyExitException, isRecognitionException, NoViableAltException, } from \"../../exceptions_public.js\";\nimport { clone, has } from \"lodash-es\";\nimport { getLookaheadPathsForOptionalProd, getLookaheadPathsForOr, } from \"../../grammar/lookahead.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n/**\n * Trait responsible for runtime parsing errors.\n */\nexport class ErrorHandler {\n    initErrorHandler(config) {\n        this._errors = [];\n        this.errorMessageProvider = has(config, \"errorMessageProvider\")\n            ? config.errorMessageProvider // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.errorMessageProvider;\n    }\n    SAVE_ERROR(error) {\n        if (isRecognitionException(error)) {\n            error.context = {\n                ruleStack: this.getHumanReadableRuleStack(),\n                ruleOccurrenceStack: clone(this.RULE_OCCURRENCE_STACK),\n            };\n            this._errors.push(error);\n            return error;\n        }\n        else {\n            throw Error(\"Trying to save an Error which is not a RecognitionException\");\n        }\n    }\n    get errors() {\n        return clone(this._errors);\n    }\n    set errors(newErrors) {\n        this._errors = newErrors;\n    }\n    // TODO: consider caching the error message computed information\n    raiseEarlyExitException(occurrence, prodType, userDefinedErrMsg) {\n        const ruleName = this.getCurrRuleFullName();\n        const ruleGrammar = this.getGAstProductions()[ruleName];\n        const lookAheadPathsPerAlternative = getLookaheadPathsForOptionalProd(occurrence, ruleGrammar, prodType, this.maxLookahead);\n        const insideProdPaths = lookAheadPathsPerAlternative[0];\n        const actualTokens = [];\n        for (let i = 1; i <= this.maxLookahead; i++) {\n            actualTokens.push(this.LA(i));\n        }\n        const msg = this.errorMessageProvider.buildEarlyExitMessage({\n            expectedIterationPaths: insideProdPaths,\n            actual: actualTokens,\n            previous: this.LA(0),\n            customUserDescription: userDefinedErrMsg,\n            ruleName: ruleName,\n        });\n        throw this.SAVE_ERROR(new EarlyExitException(msg, this.LA(1), this.LA(0)));\n    }\n    // TODO: consider caching the error message computed information\n    raiseNoAltException(occurrence, errMsgTypes) {\n        const ruleName = this.getCurrRuleFullName();\n        const ruleGrammar = this.getGAstProductions()[ruleName];\n        // TODO: getLookaheadPathsForOr can be slow for large enough maxLookahead and certain grammars, consider caching ?\n        const lookAheadPathsPerAlternative = getLookaheadPathsForOr(occurrence, ruleGrammar, this.maxLookahead);\n        const actualTokens = [];\n        for (let i = 1; i <= this.maxLookahead; i++) {\n            actualTokens.push(this.LA(i));\n        }\n        const previousToken = this.LA(0);\n        const errMsg = this.errorMessageProvider.buildNoViableAltMessage({\n            expectedPathsPerAlt: lookAheadPathsPerAlternative,\n            actual: actualTokens,\n            previous: previousToken,\n            customUserDescription: errMsgTypes,\n            ruleName: this.getCurrRuleFullName(),\n        });\n        throw this.SAVE_ERROR(new NoViableAltException(errMsg, this.LA(1), previousToken));\n    }\n}\n//# sourceMappingURL=error_handler.js.map","import { NextAfterTokenWalker, nextPossibleTokensAfter, } from \"../../grammar/interpreter.js\";\nimport { first, isUndefined } from \"lodash-es\";\nexport class ContentAssist {\n    initContentAssist() { }\n    computeContentAssist(startRuleName, precedingInput) {\n        const startRuleGast = this.gastProductionsCache[startRuleName];\n        if (isUndefined(startRuleGast)) {\n            throw Error(`Rule ->${startRuleName}<- does not exist in this grammar.`);\n        }\n        return nextPossibleTokensAfter([startRuleGast], precedingInput, this.tokenMatcher, this.maxLookahead);\n    }\n    // TODO: should this be a member method or a utility? it does not have any state or usage of 'this'...\n    // TODO: should this be more explicitly part of the public API?\n    getNextPossibleTokenTypes(grammarPath) {\n        const topRuleName = first(grammarPath.ruleStack);\n        const gastProductions = this.getGAstProductions();\n        const topProduction = gastProductions[topRuleName];\n        const nextPossibleTokenTypes = new NextAfterTokenWalker(topProduction, grammarPath).startWalking();\n        return nextPossibleTokenTypes;\n    }\n}\n//# sourceMappingURL=context_assist.js.map","import { forEach, has, isArray, isFunction, last as peek, some, } from \"lodash-es\";\nimport { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"@chevrotain/gast\";\nimport { Lexer } from \"../../../scan/lexer_public.js\";\nimport { augmentTokenTypes, hasShortKeyProperty, } from \"../../../scan/tokens.js\";\nimport { createToken, createTokenInstance, } from \"../../../scan/tokens_public.js\";\nimport { END_OF_FILE } from \"../parser.js\";\nimport { BITS_FOR_OCCURRENCE_IDX } from \"../../grammar/keys.js\";\nconst RECORDING_NULL_OBJECT = {\n    description: \"This Object indicates the Parser is during Recording Phase\",\n};\nObject.freeze(RECORDING_NULL_OBJECT);\nconst HANDLE_SEPARATOR = true;\nconst MAX_METHOD_IDX = Math.pow(2, BITS_FOR_OCCURRENCE_IDX) - 1;\nconst RFT = createToken({ name: \"RECORDING_PHASE_TOKEN\", pattern: Lexer.NA });\naugmentTokenTypes([RFT]);\nconst RECORDING_PHASE_TOKEN = createTokenInstance(RFT, \"This IToken indicates the Parser is in Recording Phase\\n\\t\" +\n    \"\" +\n    \"See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details\", \n// Using \"-1\" instead of NaN (as in EOF) because an actual number is less likely to\n// cause errors if the output of LA or CONSUME would be (incorrectly) used during the recording phase.\n-1, -1, -1, -1, -1, -1);\nObject.freeze(RECORDING_PHASE_TOKEN);\nconst RECORDING_PHASE_CSTNODE = {\n    name: \"This CSTNode indicates the Parser is in Recording Phase\\n\\t\" +\n        \"See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details\",\n    children: {},\n};\n/**\n * This trait handles the creation of the GAST structure for Chevrotain Grammars\n */\nexport class GastRecorder {\n    initGastRecorder(config) {\n        this.recordingProdStack = [];\n        this.RECORDING_PHASE = false;\n    }\n    enableRecording() {\n        this.RECORDING_PHASE = true;\n        this.TRACE_INIT(\"Enable Recording\", () => {\n            /**\n             * Warning Dark Voodoo Magic upcoming!\n             * We are \"replacing\" the public parsing DSL methods API\n             * With **new** alternative implementations on the Parser **instance**\n             *\n             * So far this is the only way I've found to avoid performance regressions during parsing time.\n             * - Approx 30% performance regression was measured on Chrome 75 Canary when attempting to replace the \"internal\"\n             *   implementations directly instead.\n             */\n            for (let i = 0; i < 10; i++) {\n                const idx = i > 0 ? i : \"\";\n                this[`CONSUME${idx}`] = function (arg1, arg2) {\n                    return this.consumeInternalRecord(arg1, i, arg2);\n                };\n                this[`SUBRULE${idx}`] = function (arg1, arg2) {\n                    return this.subruleInternalRecord(arg1, i, arg2);\n                };\n                this[`OPTION${idx}`] = function (arg1) {\n                    return this.optionInternalRecord(arg1, i);\n                };\n                this[`OR${idx}`] = function (arg1) {\n                    return this.orInternalRecord(arg1, i);\n                };\n                this[`MANY${idx}`] = function (arg1) {\n                    this.manyInternalRecord(i, arg1);\n                };\n                this[`MANY_SEP${idx}`] = function (arg1) {\n                    this.manySepFirstInternalRecord(i, arg1);\n                };\n                this[`AT_LEAST_ONE${idx}`] = function (arg1) {\n                    this.atLeastOneInternalRecord(i, arg1);\n                };\n                this[`AT_LEAST_ONE_SEP${idx}`] = function (arg1) {\n                    this.atLeastOneSepFirstInternalRecord(i, arg1);\n                };\n            }\n            // DSL methods with the idx(suffix) as an argument\n            this[`consume`] = function (idx, arg1, arg2) {\n                return this.consumeInternalRecord(arg1, idx, arg2);\n            };\n            this[`subrule`] = function (idx, arg1, arg2) {\n                return this.subruleInternalRecord(arg1, idx, arg2);\n            };\n            this[`option`] = function (idx, arg1) {\n                return this.optionInternalRecord(arg1, idx);\n            };\n            this[`or`] = function (idx, arg1) {\n                return this.orInternalRecord(arg1, idx);\n            };\n            this[`many`] = function (idx, arg1) {\n                this.manyInternalRecord(idx, arg1);\n            };\n            this[`atLeastOne`] = function (idx, arg1) {\n                this.atLeastOneInternalRecord(idx, arg1);\n            };\n            this.ACTION = this.ACTION_RECORD;\n            this.BACKTRACK = this.BACKTRACK_RECORD;\n            this.LA = this.LA_RECORD;\n        });\n    }\n    disableRecording() {\n        this.RECORDING_PHASE = false;\n        // By deleting these **instance** properties, any future invocation\n        // will be deferred to the original methods on the **prototype** object\n        // This seems to get rid of any incorrect optimizations that V8 may\n        // do during the recording phase.\n        this.TRACE_INIT(\"Deleting Recording methods\", () => {\n            const that = this;\n            for (let i = 0; i < 10; i++) {\n                const idx = i > 0 ? i : \"\";\n                delete that[`CONSUME${idx}`];\n                delete that[`SUBRULE${idx}`];\n                delete that[`OPTION${idx}`];\n                delete that[`OR${idx}`];\n                delete that[`MANY${idx}`];\n                delete that[`MANY_SEP${idx}`];\n                delete that[`AT_LEAST_ONE${idx}`];\n                delete that[`AT_LEAST_ONE_SEP${idx}`];\n            }\n            delete that[`consume`];\n            delete that[`subrule`];\n            delete that[`option`];\n            delete that[`or`];\n            delete that[`many`];\n            delete that[`atLeastOne`];\n            delete that.ACTION;\n            delete that.BACKTRACK;\n            delete that.LA;\n        });\n    }\n    //   Parser methods are called inside an ACTION?\n    //   Maybe try/catch/finally on ACTIONS while disabling the recorders state changes?\n    // @ts-expect-error -- noop place holder\n    ACTION_RECORD(impl) {\n        // NO-OP during recording\n    }\n    // Executing backtracking logic will break our recording logic assumptions\n    BACKTRACK_RECORD(grammarRule, args) {\n        return () => true;\n    }\n    // LA is part of the official API and may be used for custom lookahead logic\n    // by end users who may forget to wrap it in ACTION or inside a GATE\n    LA_RECORD(howMuch) {\n        // We cannot use the RECORD_PHASE_TOKEN here because someone may depend\n        // On LA return EOF at the end of the input so an infinite loop may occur.\n        return END_OF_FILE;\n    }\n    topLevelRuleRecord(name, def) {\n        try {\n            const newTopLevelRule = new Rule({ definition: [], name: name });\n            newTopLevelRule.name = name;\n            this.recordingProdStack.push(newTopLevelRule);\n            def.call(this);\n            this.recordingProdStack.pop();\n            return newTopLevelRule;\n        }\n        catch (originalError) {\n            if (originalError.KNOWN_RECORDER_ERROR !== true) {\n                try {\n                    originalError.message =\n                        originalError.message +\n                            '\\n\\t This error was thrown during the \"grammar recording phase\" For more info see:\\n\\t' +\n                            \"https://chevrotain.io/docs/guide/internals.html#grammar-recording\";\n                }\n                catch (mutabilityError) {\n                    // We may not be able to modify the original error object\n                    throw originalError;\n                }\n            }\n            throw originalError;\n        }\n    }\n    // Implementation of parsing DSL\n    optionInternalRecord(actionORMethodDef, occurrence) {\n        return recordProd.call(this, Option, actionORMethodDef, occurrence);\n    }\n    atLeastOneInternalRecord(occurrence, actionORMethodDef) {\n        recordProd.call(this, RepetitionMandatory, actionORMethodDef, occurrence);\n    }\n    atLeastOneSepFirstInternalRecord(occurrence, options) {\n        recordProd.call(this, RepetitionMandatoryWithSeparator, options, occurrence, HANDLE_SEPARATOR);\n    }\n    manyInternalRecord(occurrence, actionORMethodDef) {\n        recordProd.call(this, Repetition, actionORMethodDef, occurrence);\n    }\n    manySepFirstInternalRecord(occurrence, options) {\n        recordProd.call(this, RepetitionWithSeparator, options, occurrence, HANDLE_SEPARATOR);\n    }\n    orInternalRecord(altsOrOpts, occurrence) {\n        return recordOrProd.call(this, altsOrOpts, occurrence);\n    }\n    subruleInternalRecord(ruleToCall, occurrence, options) {\n        assertMethodIdxIsValid(occurrence);\n        if (!ruleToCall || has(ruleToCall, \"ruleName\") === false) {\n            const error = new Error(`<SUBRULE${getIdxSuffix(occurrence)}> argument is invalid` +\n                ` expecting a Parser method reference but got: <${JSON.stringify(ruleToCall)}>` +\n                `\\n inside top level rule: <${this.recordingProdStack[0].name}>`);\n            error.KNOWN_RECORDER_ERROR = true;\n            throw error;\n        }\n        const prevProd = peek(this.recordingProdStack);\n        const ruleName = ruleToCall.ruleName;\n        const newNoneTerminal = new NonTerminal({\n            idx: occurrence,\n            nonTerminalName: ruleName,\n            label: options === null || options === void 0 ? void 0 : options.LABEL,\n            // The resolving of the `referencedRule` property will be done once all the Rule's GASTs have been created\n            referencedRule: undefined,\n        });\n        prevProd.definition.push(newNoneTerminal);\n        return this.outputCst\n            ? RECORDING_PHASE_CSTNODE\n            : RECORDING_NULL_OBJECT;\n    }\n    consumeInternalRecord(tokType, occurrence, options) {\n        assertMethodIdxIsValid(occurrence);\n        if (!hasShortKeyProperty(tokType)) {\n            const error = new Error(`<CONSUME${getIdxSuffix(occurrence)}> argument is invalid` +\n                ` expecting a TokenType reference but got: <${JSON.stringify(tokType)}>` +\n                `\\n inside top level rule: <${this.recordingProdStack[0].name}>`);\n            error.KNOWN_RECORDER_ERROR = true;\n            throw error;\n        }\n        const prevProd = peek(this.recordingProdStack);\n        const newNoneTerminal = new Terminal({\n            idx: occurrence,\n            terminalType: tokType,\n            label: options === null || options === void 0 ? void 0 : options.LABEL,\n        });\n        prevProd.definition.push(newNoneTerminal);\n        return RECORDING_PHASE_TOKEN;\n    }\n}\nfunction recordProd(prodConstructor, mainProdArg, occurrence, handleSep = false) {\n    assertMethodIdxIsValid(occurrence);\n    const prevProd = peek(this.recordingProdStack);\n    const grammarAction = isFunction(mainProdArg) ? mainProdArg : mainProdArg.DEF;\n    const newProd = new prodConstructor({ definition: [], idx: occurrence });\n    if (handleSep) {\n        newProd.separator = mainProdArg.SEP;\n    }\n    if (has(mainProdArg, \"MAX_LOOKAHEAD\")) {\n        newProd.maxLookahead = mainProdArg.MAX_LOOKAHEAD;\n    }\n    this.recordingProdStack.push(newProd);\n    grammarAction.call(this);\n    prevProd.definition.push(newProd);\n    this.recordingProdStack.pop();\n    return RECORDING_NULL_OBJECT;\n}\nfunction recordOrProd(mainProdArg, occurrence) {\n    assertMethodIdxIsValid(occurrence);\n    const prevProd = peek(this.recordingProdStack);\n    // Only an array of alternatives\n    const hasOptions = isArray(mainProdArg) === false;\n    const alts = hasOptions === false ? mainProdArg : mainProdArg.DEF;\n    const newOrProd = new Alternation({\n        definition: [],\n        idx: occurrence,\n        ignoreAmbiguities: hasOptions && mainProdArg.IGNORE_AMBIGUITIES === true,\n    });\n    if (has(mainProdArg, \"MAX_LOOKAHEAD\")) {\n        newOrProd.maxLookahead = mainProdArg.MAX_LOOKAHEAD;\n    }\n    const hasPredicates = some(alts, (currAlt) => isFunction(currAlt.GATE));\n    newOrProd.hasPredicates = hasPredicates;\n    prevProd.definition.push(newOrProd);\n    forEach(alts, (currAlt) => {\n        const currAltFlat = new Alternative({ definition: [] });\n        newOrProd.definition.push(currAltFlat);\n        if (has(currAlt, \"IGNORE_AMBIGUITIES\")) {\n            currAltFlat.ignoreAmbiguities = currAlt.IGNORE_AMBIGUITIES; // assumes end user provides the correct config value/type\n        }\n        // **implicit** ignoreAmbiguities due to usage of gate\n        else if (has(currAlt, \"GATE\")) {\n            currAltFlat.ignoreAmbiguities = true;\n        }\n        this.recordingProdStack.push(currAltFlat);\n        currAlt.ALT.call(this);\n        this.recordingProdStack.pop();\n    });\n    return RECORDING_NULL_OBJECT;\n}\nfunction getIdxSuffix(idx) {\n    return idx === 0 ? \"\" : `${idx}`;\n}\nfunction assertMethodIdxIsValid(idx) {\n    if (idx < 0 || idx > MAX_METHOD_IDX) {\n        const error = new Error(\n        // The stack trace will contain all the needed details\n        `Invalid DSL Method idx value: <${idx}>\\n\\t` +\n            `Idx value must be a none negative value smaller than ${MAX_METHOD_IDX + 1}`);\n        error.KNOWN_RECORDER_ERROR = true;\n        throw error;\n    }\n}\n//# sourceMappingURL=gast_recorder.js.map","import { has } from \"lodash-es\";\nimport { timer } from \"@chevrotain/utils\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n/**\n * Trait responsible for runtime parsing errors.\n */\nexport class PerformanceTracer {\n    initPerformanceTracer(config) {\n        if (has(config, \"traceInitPerf\")) {\n            const userTraceInitPerf = config.traceInitPerf;\n            const traceIsNumber = typeof userTraceInitPerf === \"number\";\n            this.traceInitMaxIdent = traceIsNumber\n                ? userTraceInitPerf\n                : Infinity;\n            this.traceInitPerf = traceIsNumber\n                ? userTraceInitPerf > 0\n                : userTraceInitPerf; // assumes end user provides the correct config value/type\n        }\n        else {\n            this.traceInitMaxIdent = 0;\n            this.traceInitPerf = DEFAULT_PARSER_CONFIG.traceInitPerf;\n        }\n        this.traceInitIndent = -1;\n    }\n    TRACE_INIT(phaseDesc, phaseImpl) {\n        // No need to optimize this using NOOP pattern because\n        // It is not called in a hot spot...\n        if (this.traceInitPerf === true) {\n            this.traceInitIndent++;\n            const indent = new Array(this.traceInitIndent + 1).join(\"\\t\");\n            if (this.traceInitIndent < this.traceInitMaxIdent) {\n                console.log(`${indent}--> <${phaseDesc}>`);\n            }\n            const { time, value } = timer(phaseImpl);\n            /* istanbul ignore next - Difficult to reproduce specific performance behavior (>10ms) in tests */\n            const traceMethod = time > 10 ? console.warn : console.log;\n            if (this.traceInitIndent < this.traceInitMaxIdent) {\n                traceMethod(`${indent}<-- <${phaseDesc}> time: ${time}ms`);\n            }\n            this.traceInitIndent--;\n            return value;\n        }\n        else {\n            return phaseImpl();\n        }\n    }\n}\n//# sourceMappingURL=perf_tracer.js.map","export function applyMixins(derivedCtor, baseCtors) {\n    baseCtors.forEach((baseCtor) => {\n        const baseProto = baseCtor.prototype;\n        Object.getOwnPropertyNames(baseProto).forEach((propName) => {\n            if (propName === \"constructor\") {\n                return;\n            }\n            const basePropDescriptor = Object.getOwnPropertyDescriptor(baseProto, propName);\n            // Handle Accessors\n            if (basePropDescriptor &&\n                (basePropDescriptor.get || basePropDescriptor.set)) {\n                Object.defineProperty(derivedCtor.prototype, propName, basePropDescriptor);\n            }\n            else {\n                derivedCtor.prototype[propName] = baseCtor.prototype[propName];\n            }\n        });\n    });\n}\n//# sourceMappingURL=apply_mixins.js.map","import { clone, forEach, has, isEmpty, map, values } from \"lodash-es\";\nimport { toFastProperties } from \"@chevrotain/utils\";\nimport { computeAllProdsFollows } from \"../grammar/follow.js\";\nimport { createTokenInstance, EOF } from \"../../scan/tokens_public.js\";\nimport { defaultGrammarValidatorErrorProvider, defaultParserErrorProvider, } from \"../errors_public.js\";\nimport { resolveGrammar, validateGrammar, } from \"../grammar/gast/gast_resolver_public.js\";\nimport { Recoverable } from \"./traits/recoverable.js\";\nimport { LooksAhead } from \"./traits/looksahead.js\";\nimport { TreeBuilder } from \"./traits/tree_builder.js\";\nimport { LexerAdapter } from \"./traits/lexer_adapter.js\";\nimport { RecognizerApi } from \"./traits/recognizer_api.js\";\nimport { RecognizerEngine } from \"./traits/recognizer_engine.js\";\nimport { ErrorHandler } from \"./traits/error_handler.js\";\nimport { ContentAssist } from \"./traits/context_assist.js\";\nimport { GastRecorder } from \"./traits/gast_recorder.js\";\nimport { PerformanceTracer } from \"./traits/perf_tracer.js\";\nimport { applyMixins } from \"./utils/apply_mixins.js\";\nimport { validateLookahead } from \"../grammar/checks.js\";\nexport const END_OF_FILE = createTokenInstance(EOF, \"\", NaN, NaN, NaN, NaN, NaN, NaN);\nObject.freeze(END_OF_FILE);\nexport const DEFAULT_PARSER_CONFIG = Object.freeze({\n    recoveryEnabled: false,\n    maxLookahead: 3,\n    dynamicTokensEnabled: false,\n    outputCst: true,\n    errorMessageProvider: defaultParserErrorProvider,\n    nodeLocationTracking: \"none\",\n    traceInitPerf: false,\n    skipValidations: false,\n});\nexport const DEFAULT_RULE_CONFIG = Object.freeze({\n    recoveryValueFunc: () => undefined,\n    resyncEnabled: true,\n});\nexport var ParserDefinitionErrorType;\n(function (ParserDefinitionErrorType) {\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"INVALID_RULE_NAME\"] = 0] = \"INVALID_RULE_NAME\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"DUPLICATE_RULE_NAME\"] = 1] = \"DUPLICATE_RULE_NAME\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"INVALID_RULE_OVERRIDE\"] = 2] = \"INVALID_RULE_OVERRIDE\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"DUPLICATE_PRODUCTIONS\"] = 3] = \"DUPLICATE_PRODUCTIONS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"UNRESOLVED_SUBRULE_REF\"] = 4] = \"UNRESOLVED_SUBRULE_REF\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"LEFT_RECURSION\"] = 5] = \"LEFT_RECURSION\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"NONE_LAST_EMPTY_ALT\"] = 6] = \"NONE_LAST_EMPTY_ALT\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"AMBIGUOUS_ALTS\"] = 7] = \"AMBIGUOUS_ALTS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"CONFLICT_TOKENS_RULES_NAMESPACE\"] = 8] = \"CONFLICT_TOKENS_RULES_NAMESPACE\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"INVALID_TOKEN_NAME\"] = 9] = \"INVALID_TOKEN_NAME\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"NO_NON_EMPTY_LOOKAHEAD\"] = 10] = \"NO_NON_EMPTY_LOOKAHEAD\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"AMBIGUOUS_PREFIX_ALTS\"] = 11] = \"AMBIGUOUS_PREFIX_ALTS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"TOO_MANY_ALTS\"] = 12] = \"TOO_MANY_ALTS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"CUSTOM_LOOKAHEAD_VALIDATION\"] = 13] = \"CUSTOM_LOOKAHEAD_VALIDATION\";\n})(ParserDefinitionErrorType || (ParserDefinitionErrorType = {}));\nexport function EMPTY_ALT(value = undefined) {\n    return function () {\n        return value;\n    };\n}\nexport class Parser {\n    /**\n     *  @deprecated use the **instance** method with the same name instead\n     */\n    static performSelfAnalysis(parserInstance) {\n        throw Error(\"The **static** `performSelfAnalysis` method has been deprecated.\" +\n            \"\\t\\nUse the **instance** method with the same name instead.\");\n    }\n    performSelfAnalysis() {\n        this.TRACE_INIT(\"performSelfAnalysis\", () => {\n            let defErrorsMsgs;\n            this.selfAnalysisDone = true;\n            const className = this.className;\n            this.TRACE_INIT(\"toFastProps\", () => {\n                // Without this voodoo magic the parser would be x3-x4 slower\n                // It seems it is better to invoke `toFastProperties` **before**\n                // Any manipulations of the `this` object done during the recording phase.\n                toFastProperties(this);\n            });\n            this.TRACE_INIT(\"Grammar Recording\", () => {\n                try {\n                    this.enableRecording();\n                    // Building the GAST\n                    forEach(this.definedRulesNames, (currRuleName) => {\n                        const wrappedRule = this[currRuleName];\n                        const originalGrammarAction = wrappedRule[\"originalGrammarAction\"];\n                        let recordedRuleGast;\n                        this.TRACE_INIT(`${currRuleName} Rule`, () => {\n                            recordedRuleGast = this.topLevelRuleRecord(currRuleName, originalGrammarAction);\n                        });\n                        this.gastProductionsCache[currRuleName] = recordedRuleGast;\n                    });\n                }\n                finally {\n                    this.disableRecording();\n                }\n            });\n            let resolverErrors = [];\n            this.TRACE_INIT(\"Grammar Resolving\", () => {\n                resolverErrors = resolveGrammar({\n                    rules: values(this.gastProductionsCache),\n                });\n                this.definitionErrors = this.definitionErrors.concat(resolverErrors);\n            });\n            this.TRACE_INIT(\"Grammar Validations\", () => {\n                // only perform additional grammar validations IFF no resolving errors have occurred.\n                // as unresolved grammar may lead to unhandled runtime exceptions in the follow up validations.\n                if (isEmpty(resolverErrors) && this.skipValidations === false) {\n                    const validationErrors = validateGrammar({\n                        rules: values(this.gastProductionsCache),\n                        tokenTypes: values(this.tokensMap),\n                        errMsgProvider: defaultGrammarValidatorErrorProvider,\n                        grammarName: className,\n                    });\n                    const lookaheadValidationErrors = validateLookahead({\n                        lookaheadStrategy: this.lookaheadStrategy,\n                        rules: values(this.gastProductionsCache),\n                        tokenTypes: values(this.tokensMap),\n                        grammarName: className,\n                    });\n                    this.definitionErrors = this.definitionErrors.concat(validationErrors, lookaheadValidationErrors);\n                }\n            });\n            // this analysis may fail if the grammar is not perfectly valid\n            if (isEmpty(this.definitionErrors)) {\n                // The results of these computations are not needed unless error recovery is enabled.\n                if (this.recoveryEnabled) {\n                    this.TRACE_INIT(\"computeAllProdsFollows\", () => {\n                        const allFollows = computeAllProdsFollows(values(this.gastProductionsCache));\n                        this.resyncFollows = allFollows;\n                    });\n                }\n                this.TRACE_INIT(\"ComputeLookaheadFunctions\", () => {\n                    var _a, _b;\n                    (_b = (_a = this.lookaheadStrategy).initialize) === null || _b === void 0 ? void 0 : _b.call(_a, {\n                        rules: values(this.gastProductionsCache),\n                    });\n                    this.preComputeLookaheadFunctions(values(this.gastProductionsCache));\n                });\n            }\n            if (!Parser.DEFER_DEFINITION_ERRORS_HANDLING &&\n                !isEmpty(this.definitionErrors)) {\n                defErrorsMsgs = map(this.definitionErrors, (defError) => defError.message);\n                throw new Error(`Parser Definition Errors detected:\\n ${defErrorsMsgs.join(\"\\n-------------------------------\\n\")}`);\n            }\n        });\n    }\n    constructor(tokenVocabulary, config) {\n        this.definitionErrors = [];\n        this.selfAnalysisDone = false;\n        const that = this;\n        that.initErrorHandler(config);\n        that.initLexerAdapter();\n        that.initLooksAhead(config);\n        that.initRecognizerEngine(tokenVocabulary, config);\n        that.initRecoverable(config);\n        that.initTreeBuilder(config);\n        that.initContentAssist();\n        that.initGastRecorder(config);\n        that.initPerformanceTracer(config);\n        if (has(config, \"ignoredIssues\")) {\n            throw new Error(\"The <ignoredIssues> IParserConfig property has been deprecated.\\n\\t\" +\n                \"Please use the <IGNORE_AMBIGUITIES> flag on the relevant DSL method instead.\\n\\t\" +\n                \"See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#IGNORING_AMBIGUITIES\\n\\t\" +\n                \"For further details.\");\n        }\n        this.skipValidations = has(config, \"skipValidations\")\n            ? config.skipValidations // casting assumes the end user passing the correct type\n            : DEFAULT_PARSER_CONFIG.skipValidations;\n    }\n}\n// Set this flag to true if you don't want the Parser to throw error when problems in it's definition are detected.\n// (normally during the parser's constructor).\n// This is a design time flag, it will not affect the runtime error handling of the parser, just design time errors,\n// for example: duplicate rule names, referencing an unresolved subrule, ect...\n// This flag should not be enabled during normal usage, it is used in special situations, for example when\n// needing to display the parser definition errors in some GUI(online playground).\nParser.DEFER_DEFINITION_ERRORS_HANDLING = false;\napplyMixins(Parser, [\n    Recoverable,\n    LooksAhead,\n    TreeBuilder,\n    LexerAdapter,\n    RecognizerEngine,\n    RecognizerApi,\n    ErrorHandler,\n    ContentAssist,\n    GastRecorder,\n    PerformanceTracer,\n]);\nexport class CstParser extends Parser {\n    constructor(tokenVocabulary, config = DEFAULT_PARSER_CONFIG) {\n        const configClone = clone(config);\n        configClone.outputCst = true;\n        super(tokenVocabulary, configClone);\n    }\n}\nexport class EmbeddedActionsParser extends Parser {\n    constructor(tokenVocabulary, config = DEFAULT_PARSER_CONFIG) {\n        const configClone = clone(config);\n        configClone.outputCst = false;\n        super(tokenVocabulary, configClone);\n    }\n}\n//# sourceMappingURL=parser.js.map","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nmodule.exports = baseSlice;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\nfunction castSlice(array, start, end) {\n  var length = array.length;\n  end = end === undefined ? length : end;\n  return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\nmodule.exports = castSlice;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","/**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction asciiToArray(string) {\n  return string.split('');\n}\n\nmodule.exports = asciiToArray;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction unicodeToArray(string) {\n  return string.match(reUnicode) || [];\n}\n\nmodule.exports = unicodeToArray;\n","var asciiToArray = require('./_asciiToArray'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeToArray = require('./_unicodeToArray');\n\n/**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction stringToArray(string) {\n  return hasUnicode(string)\n    ? unicodeToArray(string)\n    : asciiToArray(string);\n}\n\nmodule.exports = stringToArray;\n","var castSlice = require('./_castSlice'),\n    hasUnicode = require('./_hasUnicode'),\n    stringToArray = require('./_stringToArray'),\n    toString = require('./toString');\n\n/**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\nfunction createCaseFirst(methodName) {\n  return function(string) {\n    string = toString(string);\n\n    var strSymbols = hasUnicode(string)\n      ? stringToArray(string)\n      : undefined;\n\n    var chr = strSymbols\n      ? strSymbols[0]\n      : string.charAt(0);\n\n    var trailing = strSymbols\n      ? castSlice(strSymbols, 1).join('')\n      : string.slice(1);\n\n    return chr[methodName]() + trailing;\n  };\n}\n\nmodule.exports = createCaseFirst;\n","var createCaseFirst = require('./_createCaseFirst');\n\n/**\n * Converts the first character of `string` to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.upperFirst('fred');\n * // => 'Fred'\n *\n * _.upperFirst('FRED');\n * // => 'FRED'\n */\nvar upperFirst = createCaseFirst('toUpperCase');\n\nmodule.exports = upperFirst;\n","var toString = require('./toString'),\n    upperFirst = require('./upperFirst');\n\n/**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\nfunction capitalize(string) {\n  return upperFirst(toString(string).toLowerCase());\n}\n\nmodule.exports = capitalize;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nmodule.exports = arrayReduce;\n","/**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyOf(object) {\n  return function(key) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = basePropertyOf;\n","var basePropertyOf = require('./_basePropertyOf');\n\n/** Used to map Latin Unicode letters to basic Latin letters. */\nvar deburredLetters = {\n  // Latin-1 Supplement block.\n  '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n  '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n  '\\xc7': 'C',  '\\xe7': 'c',\n  '\\xd0': 'D',  '\\xf0': 'd',\n  '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n  '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n  '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n  '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n  '\\xd1': 'N',  '\\xf1': 'n',\n  '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n  '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n  '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n  '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n  '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n  '\\xc6': 'Ae', '\\xe6': 'ae',\n  '\\xde': 'Th', '\\xfe': 'th',\n  '\\xdf': 'ss',\n  // Latin Extended-A block.\n  '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n  '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n  '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n  '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n  '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n  '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n  '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n  '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n  '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n  '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n  '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n  '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n  '\\u0134': 'J',  '\\u0135': 'j',\n  '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n  '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n  '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n  '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n  '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n  '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n  '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n  '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n  '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n  '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n  '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n  '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n  '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n  '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n  '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n  '\\u0174': 'W',  '\\u0175': 'w',\n  '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n  '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n  '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n  '\\u0132': 'IJ', '\\u0133': 'ij',\n  '\\u0152': 'Oe', '\\u0153': 'oe',\n  '\\u0149': \"'n\", '\\u017f': 's'\n};\n\n/**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\nvar deburrLetter = basePropertyOf(deburredLetters);\n\nmodule.exports = deburrLetter;\n","var deburrLetter = require('./_deburrLetter'),\n    toString = require('./toString');\n\n/** Used to match Latin Unicode letters (excluding mathematical operators). */\nvar reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n/** Used to compose unicode character classes. */\nvar rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange;\n\n/** Used to compose unicode capture groups. */\nvar rsCombo = '[' + rsComboRange + ']';\n\n/**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\nvar reComboMark = RegExp(rsCombo, 'g');\n\n/**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\nfunction deburr(string) {\n  string = toString(string);\n  return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n}\n\nmodule.exports = deburr;\n","/** Used to match words composed of alphanumeric characters. */\nvar reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n/**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\nfunction asciiWords(string) {\n  return string.match(reAsciiWord) || [];\n}\n\nmodule.exports = asciiWords;\n","/** Used to detect strings that need a more robust regexp to match words. */\nvar reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n/**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\nfunction hasUnicodeWord(string) {\n  return reHasUnicodeWord.test(string);\n}\n\nmodule.exports = hasUnicodeWord;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsDingbatRange = '\\\\u2700-\\\\u27bf',\n    rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n    rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n    rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n    rsPunctuationRange = '\\\\u2000-\\\\u206f',\n    rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n    rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n    rsVarRange = '\\\\ufe0e\\\\ufe0f',\n    rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n/** Used to compose unicode capture groups. */\nvar rsApos = \"['\\u2019]\",\n    rsBreak = '[' + rsBreakRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsDigits = '\\\\d+',\n    rsDingbat = '[' + rsDingbatRange + ']',\n    rsLower = '[' + rsLowerRange + ']',\n    rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsUpper = '[' + rsUpperRange + ']',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n    rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n    rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n    rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n    reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n    rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq;\n\n/** Used to match complex or compound words. */\nvar reUnicodeWord = RegExp([\n  rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n  rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n  rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n  rsUpper + '+' + rsOptContrUpper,\n  rsOrdUpper,\n  rsOrdLower,\n  rsDigits,\n  rsEmoji\n].join('|'), 'g');\n\n/**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\nfunction unicodeWords(string) {\n  return string.match(reUnicodeWord) || [];\n}\n\nmodule.exports = unicodeWords;\n","var asciiWords = require('./_asciiWords'),\n    hasUnicodeWord = require('./_hasUnicodeWord'),\n    toString = require('./toString'),\n    unicodeWords = require('./_unicodeWords');\n\n/**\n * Splits `string` into an array of its words.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {RegExp|string} [pattern] The pattern to match words.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the words of `string`.\n * @example\n *\n * _.words('fred, barney, & pebbles');\n * // => ['fred', 'barney', 'pebbles']\n *\n * _.words('fred, barney, & pebbles', /[^, ]+/g);\n * // => ['fred', 'barney', '&', 'pebbles']\n */\nfunction words(string, pattern, guard) {\n  string = toString(string);\n  pattern = guard ? undefined : pattern;\n\n  if (pattern === undefined) {\n    return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n  }\n  return string.match(pattern) || [];\n}\n\nmodule.exports = words;\n","var arrayReduce = require('./_arrayReduce'),\n    deburr = require('./deburr'),\n    words = require('./words');\n\n/** Used to compose unicode capture groups. */\nvar rsApos = \"['\\u2019]\";\n\n/** Used to match apostrophes. */\nvar reApos = RegExp(rsApos, 'g');\n\n/**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\nfunction createCompounder(callback) {\n  return function(string) {\n    return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n  };\n}\n\nmodule.exports = createCompounder;\n","var capitalize = require('./capitalize'),\n    createCompounder = require('./_createCompounder');\n\n/**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\nvar camelCase = createCompounder(function(result, word, index) {\n  word = word.toLowerCase();\n  return result + (index ? capitalize(word) : word);\n});\n\nmodule.exports = camelCase;\n","/*File generated with ../scripts/unicode.js using ../resources/Unicode/UnicodeData.txt.\n * As Java Identifiers may contains unicodes letters, this file defines two sets of unicode\n * characters, firstIdentChar used to help to determine if a character can be the first letter\n * of a JavaIdentifier and the other one (restIdentChar) to determine if it can be part of a\n * JavaIdentifier other than the first character.\n * Java uses the same file UnicodeData.txt as the unicode.js script to define the unicodes.\n * For more:\n *   https://github.com/jhipster/prettier-java/issues/116\n *   https://github.com/jhipster/prettier-java/pull/155\n */\nconst addRanges = (set, rangesArr) => {\n  for (let i = 0; i < rangesArr.length; i++) {\n    const range = rangesArr[i];\n    const start = range[0];\n    const end = range[1];\n    for (let codePoint = start; codePoint <= end; codePoint++) {\n      set.add(codePoint);\n    }\n  }\n};\nconst fic = new Set([\n  181, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283,\n  285, 287, 289, 291, 293, 295, 297, 299, 301, 303, 305, 307, 309, 314, 316,\n  318, 320, 322, 324, 326, 331, 333, 335, 337, 339, 341, 343, 345, 347, 349,\n  351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 378, 380,\n  387, 389, 392, 402, 405, 414, 417, 419, 421, 424, 429, 432, 436, 438, 454,\n  457, 460, 462, 464, 466, 468, 470, 472, 474, 479, 481, 483, 485, 487, 489,\n  491, 493, 499, 501, 505, 507, 509, 511, 513, 515, 517, 519, 521, 523, 525,\n  527, 529, 531, 533, 535, 537, 539, 541, 543, 545, 547, 549, 551, 553, 555,\n  557, 559, 561, 572, 578, 583, 585, 587, 589, 881, 883, 887, 912, 985, 987,\n  989, 991, 993, 995, 997, 999, 1001, 1003, 1005, 1013, 1016, 1121, 1123, 1125,\n  1127, 1129, 1131, 1133, 1135, 1137, 1139, 1141, 1143, 1145, 1147, 1149, 1151,\n  1153, 1163, 1165, 1167, 1169, 1171, 1173, 1175, 1177, 1179, 1181, 1183, 1185,\n  1187, 1189, 1191, 1193, 1195, 1197, 1199, 1201, 1203, 1205, 1207, 1209, 1211,\n  1213, 1215, 1218, 1220, 1222, 1224, 1226, 1228, 1233, 1235, 1237, 1239, 1241,\n  1243, 1245, 1247, 1249, 1251, 1253, 1255, 1257, 1259, 1261, 1263, 1265, 1267,\n  1269, 1271, 1273, 1275, 1277, 1279, 1281, 1283, 1285, 1287, 1289, 1291, 1293,\n  1295, 1297, 1299, 1301, 1303, 1305, 1307, 1309, 1311, 1313, 1315, 1317, 1319,\n  1321, 1323, 1325, 1327, 7681, 7683, 7685, 7687, 7689, 7691, 7693, 7695, 7697,\n  7699, 7701, 7703, 7705, 7707, 7709, 7711, 7713, 7715, 7717, 7719, 7721, 7723,\n  7725, 7727, 7729, 7731, 7733, 7735, 7737, 7739, 7741, 7743, 7745, 7747, 7749,\n  7751, 7753, 7755, 7757, 7759, 7761, 7763, 7765, 7767, 7769, 7771, 7773, 7775,\n  7777, 7779, 7781, 7783, 7785, 7787, 7789, 7791, 7793, 7795, 7797, 7799, 7801,\n  7803, 7805, 7807, 7809, 7811, 7813, 7815, 7817, 7819, 7821, 7823, 7825, 7827,\n  7839, 7841, 7843, 7845, 7847, 7849, 7851, 7853, 7855, 7857, 7859, 7861, 7863,\n  7865, 7867, 7869, 7871, 7873, 7875, 7877, 7879, 7881, 7883, 7885, 7887, 7889,\n  7891, 7893, 7895, 7897, 7899, 7901, 7903, 7905, 7907, 7909, 7911, 7913, 7915,\n  7917, 7919, 7921, 7923, 7925, 7927, 7929, 7931, 7933, 8126, 8458, 8467, 8495,\n  8500, 8505, 8526, 8580, 11361, 11368, 11370, 11372, 11377, 11393, 11395,\n  11397, 11399, 11401, 11403, 11405, 11407, 11409, 11411, 11413, 11415, 11417,\n  11419, 11421, 11423, 11425, 11427, 11429, 11431, 11433, 11435, 11437, 11439,\n  11441, 11443, 11445, 11447, 11449, 11451, 11453, 11455, 11457, 11459, 11461,\n  11463, 11465, 11467, 11469, 11471, 11473, 11475, 11477, 11479, 11481, 11483,\n  11485, 11487, 11489, 11500, 11502, 11507, 11559, 11565, 42561, 42563, 42565,\n  42567, 42569, 42571, 42573, 42575, 42577, 42579, 42581, 42583, 42585, 42587,\n  42589, 42591, 42593, 42595, 42597, 42599, 42601, 42603, 42605, 42625, 42627,\n  42629, 42631, 42633, 42635, 42637, 42639, 42641, 42643, 42645, 42647, 42649,\n  42651, 42787, 42789, 42791, 42793, 42795, 42797, 42803, 42805, 42807, 42809,\n  42811, 42813, 42815, 42817, 42819, 42821, 42823, 42825, 42827, 42829, 42831,\n  42833, 42835, 42837, 42839, 42841, 42843, 42845, 42847, 42849, 42851, 42853,\n  42855, 42857, 42859, 42861, 42863, 42874, 42876, 42879, 42881, 42883, 42885,\n  42887, 42892, 42894, 42897, 42903, 42905, 42907, 42909, 42911, 42913, 42915,\n  42917, 42919, 42921, 42927, 42933, 42935, 42937, 42939, 42941, 42943, 42947,\n  43002, 119995, 120779, 748, 750, 884, 890, 1369, 1600, 2042, 2074, 2084, 2088,\n  2417, 3654, 3782, 4348, 6103, 6211, 6823, 7544, 8305, 8319, 11631, 11823,\n  12293, 12347, 40981, 42508, 42623, 42864, 42888, 43471, 43494, 43632, 43741,\n  65392, 94179, 125259, 170, 186, 443, 660, 1749, 1791, 1808, 1969, 2365, 2384,\n  2482, 2493, 2510, 2556, 2654, 2749, 2768, 2809, 2877, 2929, 2947, 2972, 3024,\n  3133, 3200, 3261, 3294, 3389, 3406, 3517, 3716, 3749, 3773, 3840, 4159, 4193,\n  4238, 4696, 4800, 6108, 6314, 7418, 12294, 12348, 12447, 12543, 13312, 19968,\n  42606, 42895, 42999, 43259, 43642, 43697, 43712, 43714, 43762, 44032, 64285,\n  64318, 67592, 67644, 68096, 69415, 69956, 70006, 70106, 70108, 70280, 70461,\n  70480, 70751, 70855, 71236, 71352, 71935, 72161, 72163, 72192, 72250, 72272,\n  72349, 72768, 73030, 73112, 94032, 94208, 123214, 126500, 126503, 126521,\n  126523, 126530, 126535, 126537, 126539, 126548, 126551, 126553, 126555,\n  126557, 126559, 126564, 126590, 131072, 173824, 177984, 178208, 183984, 453,\n  456, 459, 498, 8124, 8140, 8188, 256, 258, 260, 262, 264, 266, 268, 270, 272,\n  274, 276, 278, 280, 282, 284, 286, 288, 290, 292, 294, 296, 298, 300, 302,\n  304, 306, 308, 310, 313, 315, 317, 319, 321, 323, 325, 327, 330, 332, 334,\n  336, 338, 340, 342, 344, 346, 348, 350, 352, 354, 356, 358, 360, 362, 364,\n  366, 368, 370, 372, 374, 379, 381, 388, 418, 420, 425, 428, 437, 444, 452,\n  455, 458, 461, 463, 465, 467, 469, 471, 473, 475, 478, 480, 482, 484, 486,\n  488, 490, 492, 494, 497, 500, 506, 508, 510, 512, 514, 516, 518, 520, 522,\n  524, 526, 528, 530, 532, 534, 536, 538, 540, 542, 544, 546, 548, 550, 552,\n  554, 556, 558, 560, 562, 577, 584, 586, 588, 590, 880, 882, 886, 895, 902,\n  908, 975, 984, 986, 988, 990, 992, 994, 996, 998, 1000, 1002, 1004, 1006,\n  1012, 1015, 1120, 1122, 1124, 1126, 1128, 1130, 1132, 1134, 1136, 1138, 1140,\n  1142, 1144, 1146, 1148, 1150, 1152, 1162, 1164, 1166, 1168, 1170, 1172, 1174,\n  1176, 1178, 1180, 1182, 1184, 1186, 1188, 1190, 1192, 1194, 1196, 1198, 1200,\n  1202, 1204, 1206, 1208, 1210, 1212, 1214, 1219, 1221, 1223, 1225, 1227, 1229,\n  1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1252, 1254, 1256,\n  1258, 1260, 1262, 1264, 1266, 1268, 1270, 1272, 1274, 1276, 1278, 1280, 1282,\n  1284, 1286, 1288, 1290, 1292, 1294, 1296, 1298, 1300, 1302, 1304, 1306, 1308,\n  1310, 1312, 1314, 1316, 1318, 1320, 1322, 1324, 1326, 4295, 4301, 7680, 7682,\n  7684, 7686, 7688, 7690, 7692, 7694, 7696, 7698, 7700, 7702, 7704, 7706, 7708,\n  7710, 7712, 7714, 7716, 7718, 7720, 7722, 7724, 7726, 7728, 7730, 7732, 7734,\n  7736, 7738, 7740, 7742, 7744, 7746, 7748, 7750, 7752, 7754, 7756, 7758, 7760,\n  7762, 7764, 7766, 7768, 7770, 7772, 7774, 7776, 7778, 7780, 7782, 7784, 7786,\n  7788, 7790, 7792, 7794, 7796, 7798, 7800, 7802, 7804, 7806, 7808, 7810, 7812,\n  7814, 7816, 7818, 7820, 7822, 7824, 7826, 7828, 7838, 7840, 7842, 7844, 7846,\n  7848, 7850, 7852, 7854, 7856, 7858, 7860, 7862, 7864, 7866, 7868, 7870, 7872,\n  7874, 7876, 7878, 7880, 7882, 7884, 7886, 7888, 7890, 7892, 7894, 7896, 7898,\n  7900, 7902, 7904, 7906, 7908, 7910, 7912, 7914, 7916, 7918, 7920, 7922, 7924,\n  7926, 7928, 7930, 7932, 7934, 8025, 8027, 8029, 8031, 8450, 8455, 8469, 8484,\n  8486, 8488, 8517, 8579, 11360, 11367, 11369, 11371, 11378, 11381, 11394,\n  11396, 11398, 11400, 11402, 11404, 11406, 11408, 11410, 11412, 11414, 11416,\n  11418, 11420, 11422, 11424, 11426, 11428, 11430, 11432, 11434, 11436, 11438,\n  11440, 11442, 11444, 11446, 11448, 11450, 11452, 11454, 11456, 11458, 11460,\n  11462, 11464, 11466, 11468, 11470, 11472, 11474, 11476, 11478, 11480, 11482,\n  11484, 11486, 11488, 11490, 11499, 11501, 11506, 42560, 42562, 42564, 42566,\n  42568, 42570, 42572, 42574, 42576, 42578, 42580, 42582, 42584, 42586, 42588,\n  42590, 42592, 42594, 42596, 42598, 42600, 42602, 42604, 42624, 42626, 42628,\n  42630, 42632, 42634, 42636, 42638, 42640, 42642, 42644, 42646, 42648, 42650,\n  42786, 42788, 42790, 42792, 42794, 42796, 42798, 42802, 42804, 42806, 42808,\n  42810, 42812, 42814, 42816, 42818, 42820, 42822, 42824, 42826, 42828, 42830,\n  42832, 42834, 42836, 42838, 42840, 42842, 42844, 42846, 42848, 42850, 42852,\n  42854, 42856, 42858, 42860, 42862, 42873, 42875, 42880, 42882, 42884, 42886,\n  42891, 42893, 42896, 42898, 42902, 42904, 42906, 42908, 42910, 42912, 42914,\n  42916, 42918, 42920, 42934, 42936, 42938, 42940, 42942, 42946, 119964, 119970,\n  120134, 120778, 12295, 66369, 66378, 36, 1423, 1547, 2555, 2801, 3065, 3647,\n  6107, 43064, 65020, 65129, 65284, 123647, 126128, 95, 8276, 65343\n]);\nconst fic_a = [\n  [97, 122],\n  [223, 246],\n  [248, 255],\n  [311, 312],\n  [328, 329],\n  [382, 384],\n  [396, 397],\n  [409, 411],\n  [426, 427],\n  [441, 442],\n  [445, 447],\n  [476, 477],\n  [495, 496],\n  [563, 569],\n  [575, 576],\n  [591, 659],\n  [661, 687],\n  [891, 893],\n  [940, 974],\n  [976, 977],\n  [981, 983],\n  [1007, 1011],\n  [1019, 1020],\n  [1072, 1119],\n  [1230, 1231],\n  [1376, 1416],\n  [4304, 4346],\n  [4349, 4351],\n  [5112, 5117],\n  [7296, 7304],\n  [7424, 7467],\n  [7531, 7543],\n  [7545, 7578],\n  [7829, 7837],\n  [7935, 7943],\n  [7952, 7957],\n  [7968, 7975],\n  [7984, 7991],\n  [8000, 8005],\n  [8016, 8023],\n  [8032, 8039],\n  [8048, 8061],\n  [8064, 8071],\n  [8080, 8087],\n  [8096, 8103],\n  [8112, 8116],\n  [8118, 8119],\n  [8130, 8132],\n  [8134, 8135],\n  [8144, 8147],\n  [8150, 8151],\n  [8160, 8167],\n  [8178, 8180],\n  [8182, 8183],\n  [8462, 8463],\n  [8508, 8509],\n  [8518, 8521],\n  [11312, 11358],\n  [11365, 11366],\n  [11379, 11380],\n  [11382, 11387],\n  [11491, 11492],\n  [11520, 11557],\n  [42799, 42801],\n  [42865, 42872],\n  [42899, 42901],\n  [43824, 43866],\n  [43872, 43879],\n  [43888, 43967],\n  [64256, 64262],\n  [64275, 64279],\n  [65345, 65370],\n  [66600, 66639],\n  [66776, 66811],\n  [68800, 68850],\n  [71872, 71903],\n  [93792, 93823],\n  [119834, 119859],\n  [119886, 119892],\n  [119894, 119911],\n  [119938, 119963],\n  [119990, 119993],\n  [119997, 120003],\n  [120005, 120015],\n  [120042, 120067],\n  [120094, 120119],\n  [120146, 120171],\n  [120198, 120223],\n  [120250, 120275],\n  [120302, 120327],\n  [120354, 120379],\n  [120406, 120431],\n  [120458, 120485],\n  [120514, 120538],\n  [120540, 120545],\n  [120572, 120596],\n  [120598, 120603],\n  [120630, 120654],\n  [120656, 120661],\n  [120688, 120712],\n  [120714, 120719],\n  [120746, 120770],\n  [120772, 120777],\n  [125218, 125251],\n  [688, 705],\n  [710, 721],\n  [736, 740],\n  [1765, 1766],\n  [2036, 2037],\n  [7288, 7293],\n  [7468, 7530],\n  [7579, 7615],\n  [8336, 8348],\n  [11388, 11389],\n  [12337, 12341],\n  [12445, 12446],\n  [12540, 12542],\n  [42232, 42237],\n  [42652, 42653],\n  [42775, 42783],\n  [43000, 43001],\n  [43763, 43764],\n  [43868, 43871],\n  [65438, 65439],\n  [92992, 92995],\n  [94099, 94111],\n  [94176, 94177],\n  [123191, 123197],\n  [13313, 19893],\n  [19969, 40943],\n  [44033, 55203],\n  [94209, 100343],\n  [131073, 173782],\n  [173825, 177972],\n  [177985, 178205],\n  [178209, 183969],\n  [183985, 191456],\n  [448, 451],\n  [1488, 1514],\n  [1519, 1522],\n  [1568, 1599],\n  [1601, 1610],\n  [1646, 1647],\n  [1649, 1747],\n  [1774, 1775],\n  [1786, 1788],\n  [1810, 1839],\n  [1869, 1957],\n  [1994, 2026],\n  [2048, 2069],\n  [2112, 2136],\n  [2144, 2154],\n  [2208, 2228],\n  [2230, 2237],\n  [2308, 2361],\n  [2392, 2401],\n  [2418, 2432],\n  [2437, 2444],\n  [2447, 2448],\n  [2451, 2472],\n  [2474, 2480],\n  [2486, 2489],\n  [2524, 2525],\n  [2527, 2529],\n  [2544, 2545],\n  [2565, 2570],\n  [2575, 2576],\n  [2579, 2600],\n  [2602, 2608],\n  [2610, 2611],\n  [2613, 2614],\n  [2616, 2617],\n  [2649, 2652],\n  [2674, 2676],\n  [2693, 2701],\n  [2703, 2705],\n  [2707, 2728],\n  [2730, 2736],\n  [2738, 2739],\n  [2741, 2745],\n  [2784, 2785],\n  [2821, 2828],\n  [2831, 2832],\n  [2835, 2856],\n  [2858, 2864],\n  [2866, 2867],\n  [2869, 2873],\n  [2908, 2909],\n  [2911, 2913],\n  [2949, 2954],\n  [2958, 2960],\n  [2962, 2965],\n  [2969, 2970],\n  [2974, 2975],\n  [2979, 2980],\n  [2984, 2986],\n  [2990, 3001],\n  [3077, 3084],\n  [3086, 3088],\n  [3090, 3112],\n  [3114, 3129],\n  [3160, 3162],\n  [3168, 3169],\n  [3205, 3212],\n  [3214, 3216],\n  [3218, 3240],\n  [3242, 3251],\n  [3253, 3257],\n  [3296, 3297],\n  [3313, 3314],\n  [3333, 3340],\n  [3342, 3344],\n  [3346, 3386],\n  [3412, 3414],\n  [3423, 3425],\n  [3450, 3455],\n  [3461, 3478],\n  [3482, 3505],\n  [3507, 3515],\n  [3520, 3526],\n  [3585, 3632],\n  [3634, 3635],\n  [3648, 3653],\n  [3713, 3714],\n  [3718, 3722],\n  [3724, 3747],\n  [3751, 3760],\n  [3762, 3763],\n  [3776, 3780],\n  [3804, 3807],\n  [3904, 3911],\n  [3913, 3948],\n  [3976, 3980],\n  [4096, 4138],\n  [4176, 4181],\n  [4186, 4189],\n  [4197, 4198],\n  [4206, 4208],\n  [4213, 4225],\n  [4352, 4680],\n  [4682, 4685],\n  [4688, 4694],\n  [4698, 4701],\n  [4704, 4744],\n  [4746, 4749],\n  [4752, 4784],\n  [4786, 4789],\n  [4792, 4798],\n  [4802, 4805],\n  [4808, 4822],\n  [4824, 4880],\n  [4882, 4885],\n  [4888, 4954],\n  [4992, 5007],\n  [5121, 5740],\n  [5743, 5759],\n  [5761, 5786],\n  [5792, 5866],\n  [5873, 5880],\n  [5888, 5900],\n  [5902, 5905],\n  [5920, 5937],\n  [5952, 5969],\n  [5984, 5996],\n  [5998, 6000],\n  [6016, 6067],\n  [6176, 6210],\n  [6212, 6264],\n  [6272, 6276],\n  [6279, 6312],\n  [6320, 6389],\n  [6400, 6430],\n  [6480, 6509],\n  [6512, 6516],\n  [6528, 6571],\n  [6576, 6601],\n  [6656, 6678],\n  [6688, 6740],\n  [6917, 6963],\n  [6981, 6987],\n  [7043, 7072],\n  [7086, 7087],\n  [7098, 7141],\n  [7168, 7203],\n  [7245, 7247],\n  [7258, 7287],\n  [7401, 7404],\n  [7406, 7411],\n  [7413, 7414],\n  [8501, 8504],\n  [11568, 11623],\n  [11648, 11670],\n  [11680, 11686],\n  [11688, 11694],\n  [11696, 11702],\n  [11704, 11710],\n  [11712, 11718],\n  [11720, 11726],\n  [11728, 11734],\n  [11736, 11742],\n  [12353, 12438],\n  [12449, 12538],\n  [12549, 12591],\n  [12593, 12686],\n  [12704, 12730],\n  [12784, 12799],\n  [40960, 40980],\n  [40982, 42124],\n  [42192, 42231],\n  [42240, 42507],\n  [42512, 42527],\n  [42538, 42539],\n  [42656, 42725],\n  [43003, 43009],\n  [43011, 43013],\n  [43015, 43018],\n  [43020, 43042],\n  [43072, 43123],\n  [43138, 43187],\n  [43250, 43255],\n  [43261, 43262],\n  [43274, 43301],\n  [43312, 43334],\n  [43360, 43388],\n  [43396, 43442],\n  [43488, 43492],\n  [43495, 43503],\n  [43514, 43518],\n  [43520, 43560],\n  [43584, 43586],\n  [43588, 43595],\n  [43616, 43631],\n  [43633, 43638],\n  [43646, 43695],\n  [43701, 43702],\n  [43705, 43709],\n  [43739, 43740],\n  [43744, 43754],\n  [43777, 43782],\n  [43785, 43790],\n  [43793, 43798],\n  [43808, 43814],\n  [43816, 43822],\n  [43968, 44002],\n  [55216, 55238],\n  [55243, 55291],\n  [63744, 64109],\n  [64112, 64217],\n  [64287, 64296],\n  [64298, 64310],\n  [64312, 64316],\n  [64320, 64321],\n  [64323, 64324],\n  [64326, 64433],\n  [64467, 64829],\n  [64848, 64911],\n  [64914, 64967],\n  [65008, 65019],\n  [65136, 65140],\n  [65142, 65276],\n  [65382, 65391],\n  [65393, 65437],\n  [65440, 65470],\n  [65474, 65479],\n  [65482, 65487],\n  [65490, 65495],\n  [65498, 65500],\n  [65536, 65547],\n  [65549, 65574],\n  [65576, 65594],\n  [65596, 65597],\n  [65599, 65613],\n  [65616, 65629],\n  [65664, 65786],\n  [66176, 66204],\n  [66208, 66256],\n  [66304, 66335],\n  [66349, 66368],\n  [66370, 66377],\n  [66384, 66421],\n  [66432, 66461],\n  [66464, 66499],\n  [66504, 66511],\n  [66640, 66717],\n  [66816, 66855],\n  [66864, 66915],\n  [67072, 67382],\n  [67392, 67413],\n  [67424, 67431],\n  [67584, 67589],\n  [67594, 67637],\n  [67639, 67640],\n  [67647, 67669],\n  [67680, 67702],\n  [67712, 67742],\n  [67808, 67826],\n  [67828, 67829],\n  [67840, 67861],\n  [67872, 67897],\n  [67968, 68023],\n  [68030, 68031],\n  [68112, 68115],\n  [68117, 68119],\n  [68121, 68149],\n  [68192, 68220],\n  [68224, 68252],\n  [68288, 68295],\n  [68297, 68324],\n  [68352, 68405],\n  [68416, 68437],\n  [68448, 68466],\n  [68480, 68497],\n  [68608, 68680],\n  [68864, 68899],\n  [69376, 69404],\n  [69424, 69445],\n  [69600, 69622],\n  [69635, 69687],\n  [69763, 69807],\n  [69840, 69864],\n  [69891, 69926],\n  [69968, 70002],\n  [70019, 70066],\n  [70081, 70084],\n  [70144, 70161],\n  [70163, 70187],\n  [70272, 70278],\n  [70282, 70285],\n  [70287, 70301],\n  [70303, 70312],\n  [70320, 70366],\n  [70405, 70412],\n  [70415, 70416],\n  [70419, 70440],\n  [70442, 70448],\n  [70450, 70451],\n  [70453, 70457],\n  [70493, 70497],\n  [70656, 70708],\n  [70727, 70730],\n  [70784, 70831],\n  [70852, 70853],\n  [71040, 71086],\n  [71128, 71131],\n  [71168, 71215],\n  [71296, 71338],\n  [71424, 71450],\n  [71680, 71723],\n  [72096, 72103],\n  [72106, 72144],\n  [72203, 72242],\n  [72284, 72329],\n  [72384, 72440],\n  [72704, 72712],\n  [72714, 72750],\n  [72818, 72847],\n  [72960, 72966],\n  [72968, 72969],\n  [72971, 73008],\n  [73056, 73061],\n  [73063, 73064],\n  [73066, 73097],\n  [73440, 73458],\n  [73728, 74649],\n  [74880, 75075],\n  [77824, 78894],\n  [82944, 83526],\n  [92160, 92728],\n  [92736, 92766],\n  [92880, 92909],\n  [92928, 92975],\n  [93027, 93047],\n  [93053, 93071],\n  [93952, 94026],\n  [100352, 101106],\n  [110592, 110878],\n  [110928, 110930],\n  [110948, 110951],\n  [110960, 111355],\n  [113664, 113770],\n  [113776, 113788],\n  [113792, 113800],\n  [113808, 113817],\n  [123136, 123180],\n  [123584, 123627],\n  [124928, 125124],\n  [126464, 126467],\n  [126469, 126495],\n  [126497, 126498],\n  [126505, 126514],\n  [126516, 126519],\n  [126541, 126543],\n  [126545, 126546],\n  [126561, 126562],\n  [126567, 126570],\n  [126572, 126578],\n  [126580, 126583],\n  [126585, 126588],\n  [126592, 126601],\n  [126603, 126619],\n  [126625, 126627],\n  [126629, 126633],\n  [126635, 126651],\n  [194560, 195101],\n  [8072, 8079],\n  [8088, 8095],\n  [8104, 8111],\n  [65, 90],\n  [192, 214],\n  [216, 222],\n  [376, 377],\n  [385, 386],\n  [390, 391],\n  [393, 395],\n  [398, 401],\n  [403, 404],\n  [406, 408],\n  [412, 413],\n  [415, 416],\n  [422, 423],\n  [430, 431],\n  [433, 435],\n  [439, 440],\n  [502, 504],\n  [570, 571],\n  [573, 574],\n  [579, 582],\n  [904, 906],\n  [910, 911],\n  [913, 929],\n  [931, 939],\n  [978, 980],\n  [1017, 1018],\n  [1021, 1071],\n  [1216, 1217],\n  [1329, 1366],\n  [4256, 4293],\n  [5024, 5109],\n  [7312, 7354],\n  [7357, 7359],\n  [7944, 7951],\n  [7960, 7965],\n  [7976, 7983],\n  [7992, 7999],\n  [8008, 8013],\n  [8040, 8047],\n  [8120, 8123],\n  [8136, 8139],\n  [8152, 8155],\n  [8168, 8172],\n  [8184, 8187],\n  [8459, 8461],\n  [8464, 8466],\n  [8473, 8477],\n  [8490, 8493],\n  [8496, 8499],\n  [8510, 8511],\n  [11264, 11310],\n  [11362, 11364],\n  [11373, 11376],\n  [11390, 11392],\n  [42877, 42878],\n  [42922, 42926],\n  [42928, 42932],\n  [42948, 42950],\n  [65313, 65338],\n  [66560, 66599],\n  [66736, 66771],\n  [68736, 68786],\n  [71840, 71871],\n  [93760, 93791],\n  [119808, 119833],\n  [119860, 119885],\n  [119912, 119937],\n  [119966, 119967],\n  [119973, 119974],\n  [119977, 119980],\n  [119982, 119989],\n  [120016, 120041],\n  [120068, 120069],\n  [120071, 120074],\n  [120077, 120084],\n  [120086, 120092],\n  [120120, 120121],\n  [120123, 120126],\n  [120128, 120132],\n  [120138, 120144],\n  [120172, 120197],\n  [120224, 120249],\n  [120276, 120301],\n  [120328, 120353],\n  [120380, 120405],\n  [120432, 120457],\n  [120488, 120512],\n  [120546, 120570],\n  [120604, 120628],\n  [120662, 120686],\n  [120720, 120744],\n  [125184, 125217],\n  [5870, 5872],\n  [8544, 8578],\n  [8581, 8584],\n  [12321, 12329],\n  [12344, 12346],\n  [42726, 42735],\n  [65856, 65908],\n  [66513, 66517],\n  [74752, 74862],\n  [162, 165],\n  [2046, 2047],\n  [2546, 2547],\n  [8352, 8383],\n  [65504, 65505],\n  [65509, 65510],\n  [73693, 73696],\n  [8255, 8256],\n  [65075, 65076],\n  [65101, 65103]\n];\naddRanges(fic, fic_a);\nconst ricd = new Set([\n  1471, 1479, 1648, 1809, 2045, 2362, 2364, 2381, 2433, 2492, 2509, 2558, 2620,\n  2641, 2677, 2748, 2765, 2817, 2876, 2879, 2893, 2902, 2946, 3008, 3021, 3072,\n  3076, 3201, 3260, 3263, 3270, 3405, 3530, 3542, 3633, 3761, 3893, 3895, 3897,\n  4038, 4226, 4237, 4253, 6086, 6109, 6313, 6450, 6683, 6742, 6752, 6754, 6783,\n  6964, 6972, 6978, 7142, 7149, 7405, 7412, 8417, 11647, 42607, 43010, 43014,\n  43019, 43263, 43443, 43493, 43587, 43596, 43644, 43696, 43713, 43766, 44005,\n  44008, 44013, 64286, 66045, 66272, 68159, 69633, 70003, 70196, 70206, 70367,\n  70464, 70726, 70750, 70842, 71229, 71339, 71341, 71351, 72160, 72263, 72767,\n  73018, 73031, 73109, 73111, 94031, 121461, 121476, 173, 1564, 1757, 1807,\n  2274, 6158, 65279, 69821, 69837, 917505\n]);\nconst ricd_a = [\n  [768, 879],\n  [1155, 1159],\n  [1425, 1469],\n  [1473, 1474],\n  [1476, 1477],\n  [1552, 1562],\n  [1611, 1631],\n  [1750, 1756],\n  [1759, 1764],\n  [1767, 1768],\n  [1770, 1773],\n  [1840, 1866],\n  [1958, 1968],\n  [2027, 2035],\n  [2070, 2073],\n  [2075, 2083],\n  [2085, 2087],\n  [2089, 2093],\n  [2137, 2139],\n  [2259, 2273],\n  [2275, 2306],\n  [2369, 2376],\n  [2385, 2391],\n  [2402, 2403],\n  [2497, 2500],\n  [2530, 2531],\n  [2561, 2562],\n  [2625, 2626],\n  [2631, 2632],\n  [2635, 2637],\n  [2672, 2673],\n  [2689, 2690],\n  [2753, 2757],\n  [2759, 2760],\n  [2786, 2787],\n  [2810, 2815],\n  [2881, 2884],\n  [2914, 2915],\n  [3134, 3136],\n  [3142, 3144],\n  [3146, 3149],\n  [3157, 3158],\n  [3170, 3171],\n  [3276, 3277],\n  [3298, 3299],\n  [3328, 3329],\n  [3387, 3388],\n  [3393, 3396],\n  [3426, 3427],\n  [3538, 3540],\n  [3636, 3642],\n  [3655, 3662],\n  [3764, 3772],\n  [3784, 3789],\n  [3864, 3865],\n  [3953, 3966],\n  [3968, 3972],\n  [3974, 3975],\n  [3981, 3991],\n  [3993, 4028],\n  [4141, 4144],\n  [4146, 4151],\n  [4153, 4154],\n  [4157, 4158],\n  [4184, 4185],\n  [4190, 4192],\n  [4209, 4212],\n  [4229, 4230],\n  [4957, 4959],\n  [5906, 5908],\n  [5938, 5940],\n  [5970, 5971],\n  [6002, 6003],\n  [6068, 6069],\n  [6071, 6077],\n  [6089, 6099],\n  [6155, 6157],\n  [6277, 6278],\n  [6432, 6434],\n  [6439, 6440],\n  [6457, 6459],\n  [6679, 6680],\n  [6744, 6750],\n  [6757, 6764],\n  [6771, 6780],\n  [6832, 6845],\n  [6912, 6915],\n  [6966, 6970],\n  [7019, 7027],\n  [7040, 7041],\n  [7074, 7077],\n  [7080, 7081],\n  [7083, 7085],\n  [7144, 7145],\n  [7151, 7153],\n  [7212, 7219],\n  [7222, 7223],\n  [7376, 7378],\n  [7380, 7392],\n  [7394, 7400],\n  [7416, 7417],\n  [7616, 7673],\n  [7675, 7679],\n  [8400, 8412],\n  [8421, 8432],\n  [11503, 11505],\n  [11744, 11775],\n  [12330, 12333],\n  [12441, 12442],\n  [42612, 42621],\n  [42654, 42655],\n  [42736, 42737],\n  [43045, 43046],\n  [43204, 43205],\n  [43232, 43249],\n  [43302, 43309],\n  [43335, 43345],\n  [43392, 43394],\n  [43446, 43449],\n  [43452, 43453],\n  [43561, 43566],\n  [43569, 43570],\n  [43573, 43574],\n  [43698, 43700],\n  [43703, 43704],\n  [43710, 43711],\n  [43756, 43757],\n  [65024, 65039],\n  [65056, 65071],\n  [66422, 66426],\n  [68097, 68099],\n  [68101, 68102],\n  [68108, 68111],\n  [68152, 68154],\n  [68325, 68326],\n  [68900, 68903],\n  [69446, 69456],\n  [69688, 69702],\n  [69759, 69761],\n  [69811, 69814],\n  [69817, 69818],\n  [69888, 69890],\n  [69927, 69931],\n  [69933, 69940],\n  [70016, 70017],\n  [70070, 70078],\n  [70089, 70092],\n  [70191, 70193],\n  [70198, 70199],\n  [70371, 70378],\n  [70400, 70401],\n  [70459, 70460],\n  [70502, 70508],\n  [70512, 70516],\n  [70712, 70719],\n  [70722, 70724],\n  [70835, 70840],\n  [70847, 70848],\n  [70850, 70851],\n  [71090, 71093],\n  [71100, 71101],\n  [71103, 71104],\n  [71132, 71133],\n  [71219, 71226],\n  [71231, 71232],\n  [71344, 71349],\n  [71453, 71455],\n  [71458, 71461],\n  [71463, 71467],\n  [71727, 71735],\n  [71737, 71738],\n  [72148, 72151],\n  [72154, 72155],\n  [72193, 72202],\n  [72243, 72248],\n  [72251, 72254],\n  [72273, 72278],\n  [72281, 72283],\n  [72330, 72342],\n  [72344, 72345],\n  [72752, 72758],\n  [72760, 72765],\n  [72850, 72871],\n  [72874, 72880],\n  [72882, 72883],\n  [72885, 72886],\n  [73009, 73014],\n  [73020, 73021],\n  [73023, 73029],\n  [73104, 73105],\n  [73459, 73460],\n  [92912, 92916],\n  [92976, 92982],\n  [94095, 94098],\n  [113821, 113822],\n  [119143, 119145],\n  [119163, 119170],\n  [119173, 119179],\n  [119210, 119213],\n  [119362, 119364],\n  [121344, 121398],\n  [121403, 121452],\n  [121499, 121503],\n  [121505, 121519],\n  [122880, 122886],\n  [122888, 122904],\n  [122907, 122913],\n  [122915, 122916],\n  [122918, 122922],\n  [123184, 123190],\n  [123628, 123631],\n  [125136, 125142],\n  [125252, 125258],\n  [917760, 917999],\n  [1536, 1541],\n  [8203, 8207],\n  [8234, 8238],\n  [8288, 8292],\n  [8294, 8303],\n  [65529, 65531],\n  [78896, 78904],\n  [113824, 113827],\n  [119155, 119162],\n  [917536, 917631]\n];\naddRanges(ricd, ricd_a);\nconst mac_a = [\n  [0, 8],\n  [14, 27],\n  [127, 159],\n  [768, 879],\n  [6832, 6911],\n  [7616, 7679],\n  [8400, 8447],\n  [65056, 65071],\n  [48, 57]\n];\naddRanges(ricd, mac_a);\nconst ric = new Set(\n  (function* () {\n    yield* fic;\n    yield* ricd;\n  })()\n);\nexport { fic as firstIdentChar, ric as restIdentChar };\n","import { createToken as createTokenOrg, Lexer } from \"chevrotain\";\nimport camelCase from \"lodash/camelCase.js\";\nimport * as chars from \"./unicodesets.js\";\n\n// A little mini DSL for easier lexer definition.\nconst fragments = {};\n\nfunction inlineFragments(def) {\n  let inlinedDef = def;\n  Object.keys(fragments).forEach(prevFragmentName => {\n    const prevFragmentDef = fragments[prevFragmentName];\n    const templateRegExp = new RegExp(`{{${prevFragmentName}}}`, \"g\");\n    inlinedDef = inlinedDef.replace(templateRegExp, prevFragmentDef);\n  });\n  return inlinedDef;\n}\n\nfunction FRAGMENT(name, def) {\n  fragments[name] = inlineFragments(def);\n}\n\nfunction MAKE_PATTERN(def, flags) {\n  const inlinedDef = inlineFragments(def);\n  return new RegExp(inlinedDef, flags);\n}\n\n// The order of fragments definitions is important\nFRAGMENT(\"Digits\", \"[0-9]([0-9_]*[0-9])?\");\nFRAGMENT(\"ExponentPart\", \"[eE][+-]?{{Digits}}\");\nFRAGMENT(\"HexDigit\", \"[0-9a-fA-F]\");\nFRAGMENT(\"HexDigits\", \"{{HexDigit}}(({{HexDigit}}|'_')*{{HexDigit}})?\");\nFRAGMENT(\"FloatTypeSuffix\", \"[fFdD]\");\nFRAGMENT(\"LineTerminator\", \"(\\\\x0A|(\\\\x0D(\\\\x0A)?))\");\nFRAGMENT(\"UnicodeMarker\", \"uu*\");\nFRAGMENT(\"UnicodeEscape\", \"\\\\\\\\{{UnicodeMarker}}{{HexDigit}}{4}\");\nFRAGMENT(\"RawInputCharacter\", \"\\\\\\\\{{UnicodeMarker}}[0-9a-fA-F]{4}\");\nFRAGMENT(\"UnicodeInputCharacter\", \"({{UnicodeEscape}}|{{RawInputCharacter}})\");\nFRAGMENT(\"OctalDigit\", \"[0-7]\");\nFRAGMENT(\"ZeroToThree\", \"[0-3]\");\nFRAGMENT(\n  \"OctalEscape\",\n  \"\\\\\\\\({{OctalDigit}}|{{ZeroToThree}}?{{OctalDigit}}{2})\"\n);\nFRAGMENT(\"EscapeSequence\", \"\\\\\\\\[bstnfr\\\"'\\\\\\\\]|{{OctalEscape}}\");\n// Not using InputCharacter terminology there because CR and LF are already captured in EscapeSequence\nFRAGMENT(\n  \"StringCharacter\",\n  '(?:(?:{{EscapeSequence}})|{{UnicodeEscape}}|(?![\"\\\\\\\\]).)'\n);\nFRAGMENT(\n  \"TextBlockCharacter\",\n  \"(?:(?:{{EscapeSequence}})|{{UnicodeEscape}}|(?!\\\\\\\\).|\\\\\\\\?{{LineTerminator}})\"\n);\n\nfunction matchJavaIdentifier(text, startOffset) {\n  let endOffset = startOffset;\n  let charCode = text.codePointAt(endOffset);\n\n  // We verifiy if the first character is from one of these categories\n  // Corresponds to the isJavaIdentifierStart function from Java\n  if (chars.firstIdentChar.has(charCode)) {\n    endOffset++;\n    // If we encounter a surrogate pair (something that is beyond 65535/FFFF)\n    // We skip another offset because a surrogate pair is of length 2.\n    if (charCode > 65535) {\n      endOffset++;\n    }\n    charCode = text.codePointAt(endOffset);\n  }\n\n  // We verify if the remaining characters is from one of these categories\n  // Corresponds to the isJavaIdentifierPart function from Java\n  while (chars.restIdentChar.has(charCode)) {\n    endOffset++;\n    // See above.\n    if (charCode > 65535) {\n      endOffset++;\n    }\n    charCode = text.codePointAt(endOffset);\n  }\n\n  // No match, must return null to conform with the RegExp.prototype.exec signature\n  if (endOffset === startOffset) {\n    return null;\n  }\n  const matchedString = text.substring(startOffset, endOffset);\n  // according to the RegExp.prototype.exec API the first item in the returned array must be the whole matched string.\n  return [matchedString];\n}\n\nconst Identifier = createTokenOrg({\n  name: \"Identifier\",\n  pattern: { exec: matchJavaIdentifier },\n  line_breaks: false,\n  start_chars_hint: Array.from(chars.firstIdentChar, x =>\n    String.fromCharCode(x)\n  )\n});\n\nconst allTokens = {\n  modes: {\n    global: [],\n    stringTemplate: [],\n    textBlockTemplate: []\n  },\n  defaultMode: \"global\"\n};\nconst allModes = Object.keys(allTokens.modes);\nconst tokenDictionary = {};\n\nfunction createToken(options, modes = allModes) {\n  // TODO create a test to check all the tokenbs have a label defined\n  if (!options.label) {\n    // simple token (e.g operator)\n    if (typeof options.pattern === \"string\") {\n      options.label = `'${options.pattern}'`;\n    }\n    // Complex token (e.g literal)\n    else if (options.pattern instanceof RegExp) {\n      options.label = `'${options.name}'`;\n    }\n  }\n\n  const newTokenType = createTokenOrg(options);\n  modes.forEach(mode => allTokens.modes[mode].push(newTokenType));\n  tokenDictionary[options.name] = newTokenType;\n  return newTokenType;\n}\n\nfunction createKeywordLikeToken(options) {\n  // A keyword 'like' token uses the \"longer_alt\" config option\n  // to resolve ambiguities, see: http://sap.github.io/chevrotain/docs/features/token_alternative_matches.html\n  options.longer_alt = Identifier;\n  return createToken(options);\n}\n\n// Token Categories\n// Used a Token Category to mark all restricted keywords.\n// This could be used in syntax highlights implementation.\nconst RestrictedKeyword = createToken({\n  name: \"RestrictedKeyword\",\n  pattern: Lexer.NA\n});\n\n// Used a Token Category to mark all keywords.\n// This could be used in syntax highlights implementation.\nconst Keyword = createToken({\n  name: \"Keyword\",\n  pattern: Lexer.NA\n});\n\nconst AssignmentOperator = createToken({\n  name: \"AssignmentOperator\",\n  pattern: Lexer.NA\n});\n\nconst BinaryOperator = createToken({\n  name: \"BinaryOperator\",\n  pattern: Lexer.NA\n});\n\nconst UnaryPrefixOperator = createToken({\n  name: \"UnaryPrefixOperator\",\n  pattern: Lexer.NA\n});\nconst UnaryPrefixOperatorNotPlusMinus = createToken({\n  name: \"UnaryPrefixOperatorNotPlusMinus\",\n  pattern: Lexer.NA\n});\n\nconst UnarySuffixOperator = createToken({\n  name: \"UnarySuffixOperator\",\n  pattern: Lexer.NA\n});\n\n// https://docs.oracle.com/javase/specs/jls/se11/html/jls-3.html#jls-3.11\nconst Separators = createToken({\n  name: \"Separators\",\n  pattern: Lexer.NA\n});\n\n// https://docs.oracle.com/javase/specs/jls/se11/html/jls-3.html#jls-3.6\n// Note [\\\\x09\\\\x20\\\\x0C] is equivalent to [\\\\t\\\\x20\\\\f] and that \\\\x20 represents\n// space character\ncreateToken({\n  name: \"WhiteSpace\",\n  pattern: MAKE_PATTERN(\"[\\\\x09\\\\x20\\\\x0C]|{{LineTerminator}}\"),\n  group: Lexer.SKIPPED\n});\ncreateToken({\n  name: \"LineComment\",\n  pattern: /\\/\\/[^\\n\\r]*/,\n  group: \"comments\"\n});\ncreateToken({\n  name: \"TraditionalComment\",\n  pattern: /\\/\\*([^*]|\\*(?!\\/))*\\*\\//,\n  group: \"comments\"\n});\ncreateToken({ name: \"BinaryLiteral\", pattern: /0[bB][01]([01_]*[01])?[lL]?/ });\ncreateToken({\n  name: \"FloatLiteral\",\n  pattern: MAKE_PATTERN(\n    \"{{Digits}}\\\\.({{Digits}})?({{ExponentPart}})?({{FloatTypeSuffix}})?|\" +\n      \"\\\\.{{Digits}}({{ExponentPart}})?({{FloatTypeSuffix}})?|\" +\n      \"{{Digits}}{{ExponentPart}}({{FloatTypeSuffix}})?|\" +\n      \"{{Digits}}({{ExponentPart}})?{{FloatTypeSuffix}}\"\n  )\n});\ncreateToken({ name: \"OctalLiteral\", pattern: /0_*[0-7]([0-7_]*[0-7])?[lL]?/ });\ncreateToken({\n  name: \"HexFloatLiteral\",\n  pattern: MAKE_PATTERN(\n    \"0[xX]({{HexDigits}}\\\\.?|({{HexDigits}})?\\\\.{{HexDigits}})[pP][+-]?{{Digits}}[fFdD]?\"\n  )\n});\ncreateToken({\n  name: \"HexLiteral\",\n  pattern: /0[xX][0-9a-fA-F]([0-9a-fA-F_]*[0-9a-fA-F])?[lL]?/\n});\ncreateToken({\n  name: \"DecimalLiteral\",\n  pattern: MAKE_PATTERN(\"(0|[1-9](_+{{Digits}}|({{Digits}})?))[lL]?\")\n});\n// https://docs.oracle.com/javase/specs/jls/se11/html/jls-3.html#jls-3.10.4\ncreateToken({\n  name: \"CharLiteral\",\n  // Not using SingleCharacter Terminology because ' and \\ are captured in EscapeSequence\n  pattern: MAKE_PATTERN(\n    \"'(?:[^\\\\\\\\']|(?:(?:{{EscapeSequence}})|{{UnicodeInputCharacter}}))'\"\n  )\n});\n\ncreateToken({\n  name: \"TextBlock\",\n  pattern: MAKE_PATTERN(\n    '\"\"\"[\\\\x09\\\\x20\\\\x0C]*{{LineTerminator}}{{TextBlockCharacter}}*?\"\"\"'\n  )\n});\n\ncreateToken({\n  name: \"TextBlockTemplateBegin\",\n  pattern: MAKE_PATTERN('\"\"\"{{LineTerminator}}{{TextBlockCharacter}}*?\\\\\\\\\\\\{'),\n  push_mode: \"textBlockTemplate\"\n});\n\ncreateToken(\n  {\n    name: \"TextBlockTemplateEnd\",\n    pattern: MAKE_PATTERN('\\\\}{{TextBlockCharacter}}*?\"\"\"'),\n    pop_mode: true\n  },\n  [\"textBlockTemplate\"]\n);\n\ncreateToken({\n  name: \"StringLiteral\",\n  pattern: MAKE_PATTERN('\"{{StringCharacter}}*?\"')\n});\n\ncreateToken({\n  name: \"StringTemplateBegin\",\n  pattern: MAKE_PATTERN('\"{{StringCharacter}}*?\\\\\\\\\\\\{'),\n  push_mode: \"stringTemplate\"\n});\n\ncreateToken(\n  {\n    name: \"StringTemplateEnd\",\n    pattern: MAKE_PATTERN('\\\\}{{StringCharacter}}*?\"'),\n    pop_mode: true\n  },\n  [\"stringTemplate\"]\n);\n\ncreateToken(\n  {\n    name: \"StringTemplateMid\",\n    pattern: MAKE_PATTERN(\"\\\\}{{StringCharacter}}*?\\\\\\\\\\\\{\")\n  },\n  [\"stringTemplate\"]\n);\n\ncreateToken(\n  {\n    name: \"TextBlockTemplateMid\",\n    pattern: MAKE_PATTERN(\"\\\\}{{TextBlockCharacter}}*?\\\\\\\\\\\\{\")\n  },\n  [\"textBlockTemplate\"]\n);\n\n// https://docs.oracle.com/javase/specs/jls/se21/html/jls-3.html#jls-3.9\n// TODO: how to handle the special rule (see spec above) for \"requires\" and \"transitive\"\nconst restrictedKeywords = [\n  \"open\",\n  \"module\",\n  \"requires\",\n  \"transitive\",\n  \"exports\",\n  \"opens\",\n  \"to\",\n  \"uses\",\n  \"provides\",\n  \"when\",\n  \"with\",\n  \"sealed\",\n  \"non-sealed\",\n  \"permits\"\n];\n\n// By sorting the keywords in descending order we avoid ambiguities\n// of common prefixes.\nsortDescLength(restrictedKeywords).forEach(word => {\n  createKeywordLikeToken({\n    name: word[0].toUpperCase() + camelCase(word.substr(1)),\n    pattern: word,\n    // restricted keywords can also be used as an Identifiers according to the spec.\n    // TODO: inspect this causes no ambiguities\n    categories: [Identifier, RestrictedKeyword]\n  });\n});\n\n// https://docs.oracle.com/javase/specs/jls/se11/html/jls-3.html#jls-3.9\nconst keywords = [\n  \"abstract\",\n  \"continue\",\n  \"for\",\n  \"new\",\n  \"switch\",\n  \"assert\",\n  \"default\",\n  \"if\",\n  \"package\",\n  \"synchronized\",\n  \"boolean\",\n  \"do\",\n  \"goto\",\n  \"private\",\n  \"this\",\n  \"break\",\n  \"double\",\n  \"implements\",\n  \"protected\",\n  \"throw\",\n  \"byte\",\n  \"else\",\n  \"import\",\n  \"public\",\n  \"throws\",\n  \"case\",\n  \"enum\",\n  // \"instanceof\", // special handling for \"instanceof\" operator below\n  \"return\",\n  \"transient\",\n  \"catch\",\n  \"extends\",\n  \"int\",\n  \"short\",\n  \"try\",\n  \"char\",\n  \"final\",\n  \"interface\",\n  \"static\",\n  \"void\",\n  \"class\",\n  \"finally\",\n  \"long\",\n  \"strictfp\",\n  \"volatile\",\n  \"const\",\n  \"float\",\n  \"native\",\n  \"super\",\n  \"while\",\n  [\"_\", \"underscore\"]\n];\n\nsortDescLength(keywords).forEach(word => {\n  // For handling symbols keywords (underscore)\n  const isPair = Array.isArray(word);\n  const actualName = isPair ? word[1] : word;\n  const actualPattern = isPair ? word[0] : word;\n\n  const options = {\n    name: actualName[0].toUpperCase() + actualName.substr(1),\n    pattern: actualPattern,\n    categories: Keyword\n  };\n\n  if (isPair) {\n    options.label = `'${actualName}'`;\n  }\n  createKeywordLikeToken(options);\n});\n\ncreateKeywordLikeToken({\n  name: \"Instanceof\",\n  pattern: \"instanceof\",\n  categories: [Keyword, BinaryOperator]\n});\n\ncreateKeywordLikeToken({\n  name: \"Var\",\n  pattern: \"var\",\n  // https://docs.oracle.com/javase/specs/jls/se16/html/jls-3.html#jls-3.9\n  // \"var is not a keyword, but rather an identifier with special meaning as the type of a local variable declaration\"\n  categories: Identifier\n});\ncreateKeywordLikeToken({\n  name: \"Yield\",\n  pattern: \"yield\",\n  // https://docs.oracle.com/javase/specs/jls/se16/html/jls-3.html#jls-3.9\n  // \"yield is not a keyword, but rather an identifier with special meaning as the type of a local variable declaration\"\n  categories: Identifier\n});\ncreateKeywordLikeToken({\n  name: \"Record\",\n  pattern: \"record\",\n  // https://docs.oracle.com/javase/specs/jls/se16/html/jls-3.html#jls-3.9\n  // \"record is not a keyword, but rather an identifier with special meaning as the type of a local variable declaration\"\n  categories: Identifier\n});\ncreateKeywordLikeToken({ name: \"True\", pattern: \"true\" });\ncreateKeywordLikeToken({ name: \"False\", pattern: \"false\" });\ncreateKeywordLikeToken({ name: \"Null\", pattern: \"null\" });\n\n// punctuation and symbols\ncreateToken({ name: \"At\", pattern: \"@\", categories: [Separators] });\ncreateToken({ name: \"Arrow\", pattern: \"->\" });\ncreateToken({ name: \"DotDotDot\", pattern: \"...\", categories: [Separators] });\ncreateToken({ name: \"Dot\", pattern: \".\", categories: [Separators] });\ncreateToken({ name: \"Comma\", pattern: \",\", categories: [Separators] });\ncreateToken({ name: \"Semicolon\", pattern: \";\", categories: [Separators] });\ncreateToken({ name: \"ColonColon\", pattern: \"::\", categories: [Separators] });\ncreateToken({ name: \"Colon\", pattern: \":\" });\ncreateToken({ name: \"QuestionMark\", pattern: \"?\" });\ncreateToken({ name: \"LBrace\", pattern: \"(\", categories: [Separators] });\ncreateToken({ name: \"RBrace\", pattern: \")\", categories: [Separators] });\ncreateToken({\n  name: \"LCurly\",\n  pattern: \"{\",\n  categories: [Separators],\n  push_mode: allTokens.defaultMode\n});\ncreateToken(\n  { name: \"RCurly\", pattern: \"}\", categories: [Separators], pop_mode: true },\n  [allTokens.defaultMode]\n);\ncreateToken({ name: \"LSquare\", pattern: \"[\", categories: [Separators] });\ncreateToken({ name: \"RSquare\", pattern: \"]\", categories: [Separators] });\n\n// prefix and suffix operators\n// must be defined before \"-\"\ncreateToken({\n  name: \"MinusMinus\",\n  pattern: \"--\",\n  categories: [\n    UnaryPrefixOperator,\n    UnarySuffixOperator,\n    UnaryPrefixOperatorNotPlusMinus\n  ]\n});\n// must be defined before \"+\"\ncreateToken({\n  name: \"PlusPlus\",\n  pattern: \"++\",\n  categories: [\n    UnaryPrefixOperator,\n    UnarySuffixOperator,\n    UnaryPrefixOperatorNotPlusMinus\n  ]\n});\ncreateToken({\n  name: \"Complement\",\n  pattern: \"~\",\n  categories: [UnaryPrefixOperator, UnaryPrefixOperatorNotPlusMinus]\n});\n\ncreateToken({\n  name: \"LessEquals\",\n  pattern: \"<=\",\n  categories: [BinaryOperator]\n});\ncreateToken({\n  name: \"LessLessEquals\",\n  pattern: \"<<=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Less\", pattern: \"<\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"GreaterEquals\",\n  pattern: \">=\",\n  categories: [BinaryOperator]\n});\ncreateToken({\n  name: \"GreaterGreaterEquals\",\n  pattern: \">>=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({\n  name: \"GreaterGreaterGreaterEquals\",\n  pattern: \">>>=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Greater\", pattern: \">\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"EqualsEquals\",\n  pattern: \"==\",\n  categories: [BinaryOperator]\n});\ncreateToken({\n  name: \"Equals\",\n  pattern: \"=\",\n  categories: [BinaryOperator, AssignmentOperator]\n});\ncreateToken({\n  name: \"MinusEquals\",\n  pattern: \"-=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({\n  name: \"Minus\",\n  pattern: \"-\",\n  categories: [BinaryOperator, UnaryPrefixOperator]\n});\ncreateToken({\n  name: \"PlusEquals\",\n  pattern: \"+=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({\n  name: \"Plus\",\n  pattern: \"+\",\n  categories: [BinaryOperator, UnaryPrefixOperator]\n});\ncreateToken({ name: \"AndAnd\", pattern: \"&&\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"AndEquals\",\n  pattern: \"&=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"And\", pattern: \"&\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"XorEquals\",\n  pattern: \"^=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Xor\", pattern: \"^\", categories: [BinaryOperator] });\ncreateToken({ name: \"NotEquals\", pattern: \"!=\", categories: [BinaryOperator] });\ncreateToken({ name: \"OrOr\", pattern: \"||\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"OrEquals\",\n  pattern: \"|=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Or\", pattern: \"|\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"MultiplyEquals\",\n  pattern: \"*=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Star\", pattern: \"*\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"DivideEquals\",\n  pattern: \"/=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Divide\", pattern: \"/\", categories: [BinaryOperator] });\ncreateToken({\n  name: \"ModuloEquals\",\n  pattern: \"%=\",\n  categories: [AssignmentOperator]\n});\ncreateToken({ name: \"Modulo\", pattern: \"%\", categories: [BinaryOperator] });\n\n// must be defined after \"!=\"\ncreateToken({\n  name: \"Not\",\n  pattern: \"!\",\n  categories: [UnaryPrefixOperator, UnaryPrefixOperatorNotPlusMinus]\n});\n\n// Identifier must appear AFTER all the keywords to avoid ambiguities.\n// See: https://github.com/SAP/chevrotain/blob/master/examples/lexer/keywords_vs_identifiers/keywords_vs_identifiers.js\nallModes.forEach(mode => allTokens.modes[mode].push(Identifier));\ntokenDictionary[\"Identifier\"] = Identifier;\n\nfunction sortDescLength(arr) {\n  // sort is not stable, but that will not affect the lexing results.\n  return arr.sort((a, b) => {\n    return b.length - a.length;\n  });\n}\n\nexport { allTokens, tokenDictionary as tokens };\n","/**\n * Should Parser / Lexer Validations be skipped?\n *\n * By default (productive mode) the validations would be skipped to reduce parser initialization time.\n * But during development flows (e.g testing/CI) they should be enabled to detect possible issues.\n *\n * @returns {boolean}\n */\nexport function getSkipValidations() {\n  return (\n    (typeof process !== \"undefined\" && // (not every runtime has a global `process` object\n      process.env &&\n      process.env[\"prettier-java-development-mode\"] === \"enabled\") === false\n  );\n}\n","import { Lexer } from \"chevrotain\";\nimport { allTokens } from \"./tokens.js\";\nimport { getSkipValidations } from \"./utils.js\";\n\nexport default new Lexer(allTokens, {\n  ensureOptimizations: true,\n  skipValidations: getSkipValidations()\n});\n","/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\nimport map from \"lodash-es/map.js\";\nimport filter from \"lodash-es/filter.js\";\nimport { Alternation, NonTerminal, Option, RepetitionMandatory, Repetition, Terminal, RepetitionWithSeparator, RepetitionMandatoryWithSeparator } from \"chevrotain\";\nexport function buildATNKey(rule, type, occurrence) {\n    return `${rule.name}_${type}_${occurrence}`;\n}\nexport const ATN_INVALID_TYPE = 0;\nexport const ATN_BASIC = 1;\nexport const ATN_RULE_START = 2;\nexport const ATN_PLUS_BLOCK_START = 4;\nexport const ATN_STAR_BLOCK_START = 5;\n// Currently unused as the ATN is not used for lexing\nexport const ATN_TOKEN_START = 6;\nexport const ATN_RULE_STOP = 7;\nexport const ATN_BLOCK_END = 8;\nexport const ATN_STAR_LOOP_BACK = 9;\nexport const ATN_STAR_LOOP_ENTRY = 10;\nexport const ATN_PLUS_LOOP_BACK = 11;\nexport const ATN_LOOP_END = 12;\nexport class AbstractTransition {\n    constructor(target) {\n        this.target = target;\n    }\n    isEpsilon() {\n        return false;\n    }\n}\nexport class AtomTransition extends AbstractTransition {\n    constructor(target, tokenType) {\n        super(target);\n        this.tokenType = tokenType;\n    }\n}\nexport class EpsilonTransition extends AbstractTransition {\n    constructor(target) {\n        super(target);\n    }\n    isEpsilon() {\n        return true;\n    }\n}\nexport class RuleTransition extends AbstractTransition {\n    constructor(ruleStart, rule, followState) {\n        super(ruleStart);\n        this.rule = rule;\n        this.followState = followState;\n    }\n    isEpsilon() {\n        return true;\n    }\n}\nexport function createATN(rules) {\n    const atn = {\n        decisionMap: {},\n        decisionStates: [],\n        ruleToStartState: new Map(),\n        ruleToStopState: new Map(),\n        states: []\n    };\n    createRuleStartAndStopATNStates(atn, rules);\n    const ruleLength = rules.length;\n    for (let i = 0; i < ruleLength; i++) {\n        const rule = rules[i];\n        const ruleBlock = block(atn, rule, rule);\n        if (ruleBlock === undefined) {\n            continue;\n        }\n        buildRuleHandle(atn, rule, ruleBlock);\n    }\n    return atn;\n}\nfunction createRuleStartAndStopATNStates(atn, rules) {\n    const ruleLength = rules.length;\n    for (let i = 0; i < ruleLength; i++) {\n        const rule = rules[i];\n        const start = newState(atn, rule, undefined, {\n            type: ATN_RULE_START\n        });\n        const stop = newState(atn, rule, undefined, {\n            type: ATN_RULE_STOP\n        });\n        start.stop = stop;\n        atn.ruleToStartState.set(rule, start);\n        atn.ruleToStopState.set(rule, stop);\n    }\n}\nfunction atom(atn, rule, production) {\n    if (production instanceof Terminal) {\n        return tokenRef(atn, rule, production.terminalType, production);\n    }\n    else if (production instanceof NonTerminal) {\n        return ruleRef(atn, rule, production);\n    }\n    else if (production instanceof Alternation) {\n        return alternation(atn, rule, production);\n    }\n    else if (production instanceof Option) {\n        return option(atn, rule, production);\n    }\n    else if (production instanceof Repetition) {\n        return repetition(atn, rule, production);\n    }\n    else if (production instanceof RepetitionWithSeparator) {\n        return repetitionSep(atn, rule, production);\n    }\n    else if (production instanceof RepetitionMandatory) {\n        return repetitionMandatory(atn, rule, production);\n    }\n    else if (production instanceof RepetitionMandatoryWithSeparator) {\n        return repetitionMandatorySep(atn, rule, production);\n    }\n    else {\n        return block(atn, rule, production);\n    }\n}\nfunction repetition(atn, rule, repetition) {\n    const starState = newState(atn, rule, repetition, {\n        type: ATN_STAR_BLOCK_START\n    });\n    defineDecisionState(atn, starState);\n    const handle = makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition));\n    return star(atn, rule, repetition, handle);\n}\nfunction repetitionSep(atn, rule, repetition) {\n    const starState = newState(atn, rule, repetition, {\n        type: ATN_STAR_BLOCK_START\n    });\n    defineDecisionState(atn, starState);\n    const handle = makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition));\n    const sep = tokenRef(atn, rule, repetition.separator, repetition);\n    return star(atn, rule, repetition, handle, sep);\n}\nfunction repetitionMandatory(atn, rule, repetition) {\n    const plusState = newState(atn, rule, repetition, {\n        type: ATN_PLUS_BLOCK_START\n    });\n    defineDecisionState(atn, plusState);\n    const handle = makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition));\n    return plus(atn, rule, repetition, handle);\n}\nfunction repetitionMandatorySep(atn, rule, repetition) {\n    const plusState = newState(atn, rule, repetition, {\n        type: ATN_PLUS_BLOCK_START\n    });\n    defineDecisionState(atn, plusState);\n    const handle = makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition));\n    const sep = tokenRef(atn, rule, repetition.separator, repetition);\n    return plus(atn, rule, repetition, handle, sep);\n}\nfunction alternation(atn, rule, alternation) {\n    const start = newState(atn, rule, alternation, {\n        type: ATN_BASIC\n    });\n    defineDecisionState(atn, start);\n    const alts = map(alternation.definition, (e) => atom(atn, rule, e));\n    const handle = makeAlts(atn, rule, start, alternation, ...alts);\n    return handle;\n}\nfunction option(atn, rule, option) {\n    const start = newState(atn, rule, option, {\n        type: ATN_BASIC\n    });\n    defineDecisionState(atn, start);\n    const handle = makeAlts(atn, rule, start, option, block(atn, rule, option));\n    return optional(atn, rule, option, handle);\n}\nfunction block(atn, rule, block) {\n    const handles = filter(map(block.definition, (e) => atom(atn, rule, e)), (e) => e !== undefined);\n    if (handles.length === 1) {\n        return handles[0];\n    }\n    else if (handles.length === 0) {\n        return undefined;\n    }\n    else {\n        return makeBlock(atn, handles);\n    }\n}\nfunction plus(atn, rule, plus, handle, sep) {\n    const blkStart = handle.left;\n    const blkEnd = handle.right;\n    const loop = newState(atn, rule, plus, {\n        type: ATN_PLUS_LOOP_BACK\n    });\n    defineDecisionState(atn, loop);\n    const end = newState(atn, rule, plus, {\n        type: ATN_LOOP_END\n    });\n    blkStart.loopback = loop;\n    end.loopback = loop;\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionMandatoryWithSeparator' : 'RepetitionMandatory', plus.idx)] = loop;\n    epsilon(blkEnd, loop); // block can see loop back\n    // Depending on whether we have a separator we put the exit transition at index 1 or 0\n    // This influences the chosen option in the lookahead DFA\n    if (sep === undefined) {\n        epsilon(loop, blkStart); // loop back to start\n        epsilon(loop, end); // exit\n    }\n    else {\n        epsilon(loop, end); // exit\n        // loop back to start with separator\n        epsilon(loop, sep.left);\n        epsilon(sep.right, blkStart);\n    }\n    return {\n        left: blkStart,\n        right: end\n    };\n}\nfunction star(atn, rule, star, handle, sep) {\n    const start = handle.left;\n    const end = handle.right;\n    const entry = newState(atn, rule, star, {\n        type: ATN_STAR_LOOP_ENTRY\n    });\n    defineDecisionState(atn, entry);\n    const loopEnd = newState(atn, rule, star, {\n        type: ATN_LOOP_END\n    });\n    const loop = newState(atn, rule, star, {\n        type: ATN_STAR_LOOP_BACK\n    });\n    entry.loopback = loop;\n    loopEnd.loopback = loop;\n    epsilon(entry, start); // loop enter edge (alt 2)\n    epsilon(entry, loopEnd); // bypass loop edge (alt 1)\n    epsilon(end, loop); // block end hits loop back\n    if (sep !== undefined) {\n        epsilon(loop, loopEnd); // end loop\n        // loop back to start of handle using separator\n        epsilon(loop, sep.left);\n        epsilon(sep.right, start);\n    }\n    else {\n        epsilon(loop, entry); // loop back to entry/exit decision\n    }\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionWithSeparator' : 'Repetition', star.idx)] = entry;\n    return {\n        left: entry,\n        right: loopEnd\n    };\n}\nfunction optional(atn, rule, optional, handle) {\n    const start = handle.left;\n    const end = handle.right;\n    epsilon(start, end);\n    atn.decisionMap[buildATNKey(rule, 'Option', optional.idx)] = start;\n    return handle;\n}\nfunction defineDecisionState(atn, state) {\n    atn.decisionStates.push(state);\n    state.decision = atn.decisionStates.length - 1;\n    return state.decision;\n}\nfunction makeAlts(atn, rule, start, production, ...alts) {\n    const end = newState(atn, rule, production, {\n        type: ATN_BLOCK_END,\n        start\n    });\n    start.end = end;\n    for (const alt of alts) {\n        if (alt !== undefined) {\n            // hook alts up to decision block\n            epsilon(start, alt.left);\n            epsilon(alt.right, end);\n        }\n        else {\n            epsilon(start, end);\n        }\n    }\n    const handle = {\n        left: start,\n        right: end\n    };\n    atn.decisionMap[buildATNKey(rule, getProdType(production), production.idx)] = start;\n    return handle;\n}\nfunction getProdType(production) {\n    if (production instanceof Alternation) {\n        return 'Alternation';\n    }\n    else if (production instanceof Option) {\n        return 'Option';\n    }\n    else if (production instanceof Repetition) {\n        return 'Repetition';\n    }\n    else if (production instanceof RepetitionWithSeparator) {\n        return 'RepetitionWithSeparator';\n    }\n    else if (production instanceof RepetitionMandatory) {\n        return 'RepetitionMandatory';\n    }\n    else if (production instanceof RepetitionMandatoryWithSeparator) {\n        return 'RepetitionMandatoryWithSeparator';\n    }\n    else {\n        throw new Error('Invalid production type encountered');\n    }\n}\nfunction makeBlock(atn, alts) {\n    const altsLength = alts.length;\n    for (let i = 0; i < altsLength - 1; i++) {\n        const handle = alts[i];\n        let transition;\n        if (handle.left.transitions.length === 1) {\n            transition = handle.left.transitions[0];\n        }\n        const isRuleTransition = transition instanceof RuleTransition;\n        const ruleTransition = transition;\n        const next = alts[i + 1].left;\n        if (handle.left.type === ATN_BASIC &&\n            handle.right.type === ATN_BASIC &&\n            transition !== undefined &&\n            ((isRuleTransition && ruleTransition.followState === handle.right) ||\n                transition.target === handle.right)) {\n            // we can avoid epsilon edge to next element\n            if (isRuleTransition) {\n                ruleTransition.followState = next;\n            }\n            else {\n                transition.target = next;\n            }\n            removeState(atn, handle.right); // we skipped over this state\n        }\n        else {\n            // need epsilon if previous block's right end node is complex\n            epsilon(handle.right, next);\n        }\n    }\n    const first = alts[0];\n    const last = alts[altsLength - 1];\n    return {\n        left: first.left,\n        right: last.right\n    };\n}\nfunction tokenRef(atn, rule, tokenType, production) {\n    const left = newState(atn, rule, production, {\n        type: ATN_BASIC\n    });\n    const right = newState(atn, rule, production, {\n        type: ATN_BASIC\n    });\n    addTransition(left, new AtomTransition(right, tokenType));\n    return {\n        left,\n        right\n    };\n}\nfunction ruleRef(atn, currentRule, nonTerminal) {\n    const rule = nonTerminal.referencedRule;\n    const start = atn.ruleToStartState.get(rule);\n    const left = newState(atn, currentRule, nonTerminal, {\n        type: ATN_BASIC\n    });\n    const right = newState(atn, currentRule, nonTerminal, {\n        type: ATN_BASIC\n    });\n    const call = new RuleTransition(start, rule, right);\n    addTransition(left, call);\n    return {\n        left,\n        right\n    };\n}\nfunction buildRuleHandle(atn, rule, block) {\n    const start = atn.ruleToStartState.get(rule);\n    epsilon(start, block.left);\n    const stop = atn.ruleToStopState.get(rule);\n    epsilon(block.right, stop);\n    const handle = {\n        left: start,\n        right: stop\n    };\n    return handle;\n}\nfunction epsilon(a, b) {\n    const transition = new EpsilonTransition(b);\n    addTransition(a, transition);\n}\nfunction newState(atn, rule, production, partial) {\n    const t = Object.assign({ atn,\n        production, epsilonOnlyTransitions: false, rule, transitions: [], nextTokenWithinRule: [], stateNumber: atn.states.length }, partial);\n    atn.states.push(t);\n    return t;\n}\nfunction addTransition(state, transition) {\n    // A single ATN state can only contain epsilon transitions or non-epsilon transitions\n    // Because they are never mixed, only setting the property for the first transition is fine\n    if (state.transitions.length === 0) {\n        state.epsilonOnlyTransitions = transition.isEpsilon();\n    }\n    state.transitions.push(transition);\n}\nfunction removeState(atn, state) {\n    atn.states.splice(atn.states.indexOf(state), 1);\n}\n//# sourceMappingURL=atn.js.map","/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\nimport map from \"lodash-es/map.js\";\nexport const DFA_ERROR = {};\nexport class ATNConfigSet {\n    constructor() {\n        this.map = {};\n        this.configs = [];\n    }\n    get size() {\n        return this.configs.length;\n    }\n    finalize() {\n        // Empties the map to free up memory\n        this.map = {};\n    }\n    add(config) {\n        const key = getATNConfigKey(config);\n        // Only add configs which don't exist in our map already\n        // While this does not influence the actual algorithm, adding them anyway would massively increase memory consumption\n        if (!(key in this.map)) {\n            this.map[key] = this.configs.length;\n            this.configs.push(config);\n        }\n    }\n    get elements() {\n        return this.configs;\n    }\n    get alts() {\n        return map(this.configs, (e) => e.alt);\n    }\n    get key() {\n        let value = \"\";\n        for (const k in this.map) {\n            value += k + \":\";\n        }\n        return value;\n    }\n}\nexport function getATNConfigKey(config, alt = true) {\n    return `${alt ? `a${config.alt}` : \"\"}s${config.state.stateNumber}:${config.stack.map((e) => e.stateNumber.toString()).join(\"_\")}`;\n}\n//# sourceMappingURL=dfa.js.map","/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\nimport { tokenMatcher, tokenLabel, NonTerminal, Alternation, Option, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Repetition, Terminal, LLkLookaheadStrategy, getLookaheadPaths } from \"chevrotain\";\nimport { ATN_RULE_STOP, AtomTransition, buildATNKey, createATN, EpsilonTransition, RuleTransition } from \"./atn.js\";\nimport { ATNConfigSet, DFA_ERROR, getATNConfigKey } from \"./dfa.js\";\nimport min from \"lodash-es/min.js\";\nimport flatMap from \"lodash-es/flatMap.js\";\nimport uniqBy from \"lodash-es/uniqBy.js\";\nimport map from \"lodash-es/map.js\";\nimport flatten from \"lodash-es/flatten.js\";\nimport forEach from \"lodash-es/forEach.js\";\nimport isEmpty from \"lodash-es/isEmpty.js\";\nimport reduce from \"lodash-es/reduce.js\";\nfunction createDFACache(startState, decision) {\n    const map = {};\n    return (predicateSet) => {\n        const key = predicateSet.toString();\n        let existing = map[key];\n        if (existing !== undefined) {\n            return existing;\n        }\n        else {\n            existing = {\n                atnStartState: startState,\n                decision,\n                states: {}\n            };\n            map[key] = existing;\n            return existing;\n        }\n    };\n}\nclass PredicateSet {\n    constructor() {\n        this.predicates = [];\n    }\n    is(index) {\n        return index >= this.predicates.length || this.predicates[index];\n    }\n    set(index, value) {\n        this.predicates[index] = value;\n    }\n    toString() {\n        let value = \"\";\n        const size = this.predicates.length;\n        for (let i = 0; i < size; i++) {\n            value += this.predicates[i] === true ? \"1\" : \"0\";\n        }\n        return value;\n    }\n}\nconst EMPTY_PREDICATES = new PredicateSet();\nexport class LLStarLookaheadStrategy extends LLkLookaheadStrategy {\n    constructor(options) {\n        var _a;\n        super();\n        this.logging = (_a = options === null || options === void 0 ? void 0 : options.logging) !== null && _a !== void 0 ? _a : ((message) => console.log(message));\n    }\n    initialize(options) {\n        this.atn = createATN(options.rules);\n        this.dfas = initATNSimulator(this.atn);\n    }\n    validateAmbiguousAlternationAlternatives() {\n        return [];\n    }\n    validateEmptyOrAlternatives() {\n        return [];\n    }\n    buildLookaheadForAlternation(options) {\n        const { prodOccurrence, rule, hasPredicates, dynamicTokensEnabled } = options;\n        const dfas = this.dfas;\n        const logging = this.logging;\n        const key = buildATNKey(rule, 'Alternation', prodOccurrence);\n        const decisionState = this.atn.decisionMap[key];\n        const decisionIndex = decisionState.decision;\n        const partialAlts = map(getLookaheadPaths({\n            maxLookahead: 1,\n            occurrence: prodOccurrence,\n            prodType: \"Alternation\",\n            rule: rule\n        }), (currAlt) => map(currAlt, (path) => path[0]));\n        if (isLL1Sequence(partialAlts, false) && !dynamicTokensEnabled) {\n            const choiceToAlt = reduce(partialAlts, (result, currAlt, idx) => {\n                forEach(currAlt, (currTokType) => {\n                    if (currTokType) {\n                        result[currTokType.tokenTypeIdx] = idx;\n                        forEach(currTokType.categoryMatches, (currExtendingType) => {\n                            result[currExtendingType] = idx;\n                        });\n                    }\n                });\n                return result;\n            }, {});\n            if (hasPredicates) {\n                return function (orAlts) {\n                    var _a;\n                    const nextToken = this.LA(1);\n                    const prediction = choiceToAlt[nextToken.tokenTypeIdx];\n                    if (orAlts !== undefined && prediction !== undefined) {\n                        const gate = (_a = orAlts[prediction]) === null || _a === void 0 ? void 0 : _a.GATE;\n                        if (gate !== undefined && gate.call(this) === false) {\n                            return undefined;\n                        }\n                    }\n                    return prediction;\n                };\n            }\n            else {\n                return function () {\n                    const nextToken = this.LA(1);\n                    return choiceToAlt[nextToken.tokenTypeIdx];\n                };\n            }\n        }\n        else if (hasPredicates) {\n            return function (orAlts) {\n                const predicates = new PredicateSet();\n                const length = orAlts === undefined ? 0 : orAlts.length;\n                for (let i = 0; i < length; i++) {\n                    const gate = orAlts === null || orAlts === void 0 ? void 0 : orAlts[i].GATE;\n                    predicates.set(i, gate === undefined || gate.call(this));\n                }\n                const result = adaptivePredict.call(this, dfas, decisionIndex, predicates, logging);\n                return typeof result === 'number' ? result : undefined;\n            };\n        }\n        else {\n            return function () {\n                const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging);\n                return typeof result === 'number' ? result : undefined;\n            };\n        }\n    }\n    buildLookaheadForOptional(options) {\n        const { prodOccurrence, rule, prodType, dynamicTokensEnabled } = options;\n        const dfas = this.dfas;\n        const logging = this.logging;\n        const key = buildATNKey(rule, prodType, prodOccurrence);\n        const decisionState = this.atn.decisionMap[key];\n        const decisionIndex = decisionState.decision;\n        const alts = map(getLookaheadPaths({\n            maxLookahead: 1,\n            occurrence: prodOccurrence,\n            prodType,\n            rule\n        }), (e) => {\n            return map(e, (g) => g[0]);\n        });\n        if (isLL1Sequence(alts) && alts[0][0] && !dynamicTokensEnabled) {\n            const alt = alts[0];\n            const singleTokensTypes = flatten(alt);\n            if (singleTokensTypes.length === 1 &&\n                isEmpty(singleTokensTypes[0].categoryMatches)) {\n                const expectedTokenType = singleTokensTypes[0];\n                const expectedTokenUniqueKey = expectedTokenType.tokenTypeIdx;\n                return function () {\n                    return this.LA(1).tokenTypeIdx === expectedTokenUniqueKey;\n                };\n            }\n            else {\n                const choiceToAlt = reduce(singleTokensTypes, (result, currTokType) => {\n                    if (currTokType !== undefined) {\n                        result[currTokType.tokenTypeIdx] = true;\n                        forEach(currTokType.categoryMatches, (currExtendingType) => {\n                            result[currExtendingType] = true;\n                        });\n                    }\n                    return result;\n                }, {});\n                return function () {\n                    const nextToken = this.LA(1);\n                    return choiceToAlt[nextToken.tokenTypeIdx] === true;\n                };\n            }\n        }\n        return function () {\n            const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging);\n            return typeof result === \"object\" ? false : result === 0;\n        };\n    }\n}\nfunction isLL1Sequence(sequences, allowEmpty = true) {\n    const fullSet = new Set();\n    for (const alt of sequences) {\n        const altSet = new Set();\n        for (const tokType of alt) {\n            if (tokType === undefined) {\n                if (allowEmpty) {\n                    // Epsilon production encountered\n                    break;\n                }\n                else {\n                    return false;\n                }\n            }\n            const indices = [tokType.tokenTypeIdx].concat(tokType.categoryMatches);\n            for (const index of indices) {\n                if (fullSet.has(index)) {\n                    if (!altSet.has(index)) {\n                        return false;\n                    }\n                }\n                else {\n                    fullSet.add(index);\n                    altSet.add(index);\n                }\n            }\n        }\n    }\n    return true;\n}\nfunction initATNSimulator(atn) {\n    const decisionLength = atn.decisionStates.length;\n    const decisionToDFA = Array(decisionLength);\n    for (let i = 0; i < decisionLength; i++) {\n        decisionToDFA[i] = createDFACache(atn.decisionStates[i], i);\n    }\n    return decisionToDFA;\n}\nfunction adaptivePredict(dfaCaches, decision, predicateSet, logging) {\n    const dfa = dfaCaches[decision](predicateSet);\n    let start = dfa.start;\n    if (start === undefined) {\n        const closure = computeStartState(dfa.atnStartState);\n        start = addDFAState(dfa, newDFAState(closure));\n        dfa.start = start;\n    }\n    const alt = performLookahead.apply(this, [dfa, start, predicateSet, logging]);\n    return alt;\n}\nfunction performLookahead(dfa, s0, predicateSet, logging) {\n    let previousD = s0;\n    let i = 1;\n    const path = [];\n    let t = this.LA(i++);\n    while (true) {\n        let d = getExistingTargetState(previousD, t);\n        if (d === undefined) {\n            d = computeLookaheadTarget.apply(this, [dfa, previousD, t, i, predicateSet, logging]);\n        }\n        if (d === DFA_ERROR) {\n            return buildAdaptivePredictError(path, previousD, t);\n        }\n        if (d.isAcceptState === true) {\n            return d.prediction;\n        }\n        previousD = d;\n        path.push(t);\n        t = this.LA(i++);\n    }\n}\nfunction computeLookaheadTarget(dfa, previousD, token, lookahead, predicateSet, logging) {\n    const reach = computeReachSet(previousD.configs, token, predicateSet);\n    if (reach.size === 0) {\n        addDFAEdge(dfa, previousD, token, DFA_ERROR);\n        return DFA_ERROR;\n    }\n    let newState = newDFAState(reach);\n    const predictedAlt = getUniqueAlt(reach, predicateSet);\n    if (predictedAlt !== undefined) {\n        newState.isAcceptState = true;\n        newState.prediction = predictedAlt;\n        newState.configs.uniqueAlt = predictedAlt;\n    }\n    else if (hasConflictTerminatingPrediction(reach)) {\n        const prediction = min(reach.alts);\n        newState.isAcceptState = true;\n        newState.prediction = prediction;\n        newState.configs.uniqueAlt = prediction;\n        reportLookaheadAmbiguity.apply(this, [dfa, lookahead, reach.alts, logging]);\n    }\n    newState = addDFAEdge(dfa, previousD, token, newState);\n    return newState;\n}\nfunction reportLookaheadAmbiguity(dfa, lookahead, ambiguityIndices, logging) {\n    const prefixPath = [];\n    for (let i = 1; i <= lookahead; i++) {\n        prefixPath.push(this.LA(i).tokenType);\n    }\n    const atnState = dfa.atnStartState;\n    const topLevelRule = atnState.rule;\n    const production = atnState.production;\n    const message = buildAmbiguityError({\n        topLevelRule,\n        ambiguityIndices,\n        production,\n        prefixPath\n    });\n    logging(message);\n}\nfunction buildAmbiguityError(options) {\n    const pathMsg = map(options.prefixPath, (currtok) => tokenLabel(currtok)).join(\", \");\n    const occurrence = options.production.idx === 0 ? \"\" : options.production.idx;\n    let currMessage = `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\", \")}> in <${getProductionDslName(options.production)}${occurrence}>` +\n        ` inside <${options.topLevelRule.name}> Rule,\\n` +\n        `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n`;\n    currMessage =\n        currMessage +\n            `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\\n` +\n            `For Further details.`;\n    return currMessage;\n}\nfunction getProductionDslName(prod) {\n    if (prod instanceof NonTerminal) {\n        return \"SUBRULE\";\n    }\n    else if (prod instanceof Option) {\n        return \"OPTION\";\n    }\n    else if (prod instanceof Alternation) {\n        return \"OR\";\n    }\n    else if (prod instanceof RepetitionMandatory) {\n        return \"AT_LEAST_ONE\";\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator) {\n        return \"AT_LEAST_ONE_SEP\";\n    }\n    else if (prod instanceof RepetitionWithSeparator) {\n        return \"MANY_SEP\";\n    }\n    else if (prod instanceof Repetition) {\n        return \"MANY\";\n    }\n    else if (prod instanceof Terminal) {\n        return \"CONSUME\";\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nfunction buildAdaptivePredictError(path, previous, current) {\n    const nextTransitions = flatMap(previous.configs.elements, (e) => e.state.transitions);\n    const nextTokenTypes = uniqBy(nextTransitions\n        .filter((e) => e instanceof AtomTransition)\n        .map((e) => e.tokenType), (e) => e.tokenTypeIdx);\n    return {\n        actualToken: current,\n        possibleTokenTypes: nextTokenTypes,\n        tokenPath: path\n    };\n}\nfunction getExistingTargetState(state, token) {\n    return state.edges[token.tokenTypeIdx];\n}\nfunction computeReachSet(configs, token, predicateSet) {\n    const intermediate = new ATNConfigSet();\n    const skippedStopStates = [];\n    for (const c of configs.elements) {\n        if (predicateSet.is(c.alt) === false) {\n            continue;\n        }\n        if (c.state.type === ATN_RULE_STOP) {\n            skippedStopStates.push(c);\n            continue;\n        }\n        const transitionLength = c.state.transitions.length;\n        for (let i = 0; i < transitionLength; i++) {\n            const transition = c.state.transitions[i];\n            const target = getReachableTarget(transition, token);\n            if (target !== undefined) {\n                intermediate.add({\n                    state: target,\n                    alt: c.alt,\n                    stack: c.stack\n                });\n            }\n        }\n    }\n    let reach;\n    if (skippedStopStates.length === 0 && intermediate.size === 1) {\n        reach = intermediate;\n    }\n    if (reach === undefined) {\n        reach = new ATNConfigSet();\n        for (const c of intermediate.elements) {\n            closure(c, reach);\n        }\n    }\n    if (skippedStopStates.length > 0 && !hasConfigInRuleStopState(reach)) {\n        for (const c of skippedStopStates) {\n            reach.add(c);\n        }\n    }\n    return reach;\n}\nfunction getReachableTarget(transition, token) {\n    if (transition instanceof AtomTransition &&\n        tokenMatcher(token, transition.tokenType)) {\n        return transition.target;\n    }\n    return undefined;\n}\nfunction getUniqueAlt(configs, predicateSet) {\n    let alt;\n    for (const c of configs.elements) {\n        if (predicateSet.is(c.alt) === true) {\n            if (alt === undefined) {\n                alt = c.alt;\n            }\n            else if (alt !== c.alt) {\n                return undefined;\n            }\n        }\n    }\n    return alt;\n}\nfunction newDFAState(closure) {\n    return {\n        configs: closure,\n        edges: {},\n        isAcceptState: false,\n        prediction: -1\n    };\n}\nfunction addDFAEdge(dfa, from, token, to) {\n    to = addDFAState(dfa, to);\n    from.edges[token.tokenTypeIdx] = to;\n    return to;\n}\nfunction addDFAState(dfa, state) {\n    if (state === DFA_ERROR) {\n        return state;\n    }\n    // Repetitions have the same config set\n    // Therefore, storing the key of the config in a map allows us to create a loop in our DFA\n    const mapKey = state.configs.key;\n    const existing = dfa.states[mapKey];\n    if (existing !== undefined) {\n        return existing;\n    }\n    state.configs.finalize();\n    dfa.states[mapKey] = state;\n    return state;\n}\nfunction computeStartState(atnState) {\n    const configs = new ATNConfigSet();\n    const numberOfTransitions = atnState.transitions.length;\n    for (let i = 0; i < numberOfTransitions; i++) {\n        const target = atnState.transitions[i].target;\n        const config = {\n            state: target,\n            alt: i,\n            stack: []\n        };\n        closure(config, configs);\n    }\n    return configs;\n}\nfunction closure(config, configs) {\n    const p = config.state;\n    if (p.type === ATN_RULE_STOP) {\n        if (config.stack.length > 0) {\n            const atnStack = [...config.stack];\n            const followState = atnStack.pop();\n            const followConfig = {\n                state: followState,\n                alt: config.alt,\n                stack: atnStack\n            };\n            closure(followConfig, configs);\n        }\n        else {\n            // Dipping into outer context, simply add the config\n            // This will stop computation once every config is at the rule stop state\n            configs.add(config);\n        }\n        return;\n    }\n    if (!p.epsilonOnlyTransitions) {\n        configs.add(config);\n    }\n    const transitionLength = p.transitions.length;\n    for (let i = 0; i < transitionLength; i++) {\n        const transition = p.transitions[i];\n        const c = getEpsilonTarget(config, transition);\n        if (c !== undefined) {\n            closure(c, configs);\n        }\n    }\n}\nfunction getEpsilonTarget(config, transition) {\n    if (transition instanceof EpsilonTransition) {\n        return {\n            state: transition.target,\n            alt: config.alt,\n            stack: config.stack\n        };\n    }\n    else if (transition instanceof RuleTransition) {\n        const stack = [...config.stack, transition.followState];\n        return {\n            state: transition.target,\n            alt: config.alt,\n            stack\n        };\n    }\n    return undefined;\n}\nfunction hasConfigInRuleStopState(configs) {\n    for (const c of configs.elements) {\n        if (c.state.type === ATN_RULE_STOP) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction allConfigsInRuleStopStates(configs) {\n    for (const c of configs.elements) {\n        if (c.state.type !== ATN_RULE_STOP) {\n            return false;\n        }\n    }\n    return true;\n}\nfunction hasConflictTerminatingPrediction(configs) {\n    if (allConfigsInRuleStopStates(configs)) {\n        return true;\n    }\n    const altSets = getConflictingAltSets(configs.elements);\n    const heuristic = hasConflictingAltSet(altSets) && !hasStateAssociatedWithOneAlt(altSets);\n    return heuristic;\n}\nfunction getConflictingAltSets(configs) {\n    const configToAlts = new Map();\n    for (const c of configs) {\n        const key = getATNConfigKey(c, false);\n        let alts = configToAlts.get(key);\n        if (alts === undefined) {\n            alts = {};\n            configToAlts.set(key, alts);\n        }\n        alts[c.alt] = true;\n    }\n    return configToAlts;\n}\nfunction hasConflictingAltSet(altSets) {\n    for (const value of Array.from(altSets.values())) {\n        if (Object.keys(value).length > 1) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction hasStateAssociatedWithOneAlt(altSets) {\n    for (const value of Array.from(altSets.values())) {\n        if (Object.keys(value).length === 1) {\n            return true;\n        }\n    }\n    return false;\n}\n//# sourceMappingURL=all-star-lookahead.js.map","export function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-3.html#jls-Literal\n  $.RULE(\"literal\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.integerLiteral) },\n      { ALT: () => $.SUBRULE($.floatingPointLiteral) },\n      { ALT: () => $.SUBRULE($.booleanLiteral) },\n      { ALT: () => $.CONSUME(t.CharLiteral) },\n      { ALT: () => $.CONSUME(t.TextBlock) },\n      { ALT: () => $.CONSUME(t.StringLiteral) },\n      { ALT: () => $.CONSUME(t.Null) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-3.html#jls-IntegerLiteral\n  $.RULE(\"integerLiteral\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.DecimalLiteral) },\n      { ALT: () => $.CONSUME(t.HexLiteral) },\n      { ALT: () => $.CONSUME(t.OctalLiteral) },\n      { ALT: () => $.CONSUME(t.BinaryLiteral) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-3.html#jls-FloatingPointLiteral\n  $.RULE(\"floatingPointLiteral\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.FloatLiteral) },\n      { ALT: () => $.CONSUME(t.HexFloatLiteral) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-3.html#jls-BooleanLiteral\n  $.RULE(\"booleanLiteral\", () => {\n    $.OR([{ ALT: () => $.CONSUME(t.True) }, { ALT: () => $.CONSUME(t.False) }]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-3.html#jls-3.12\n  $.RULE(\"shiftOperator\", () => {\n    $.OR([\n      {\n        GATE: () => $.LA(1).startOffset + 1 === $.LA(2).startOffset,\n        ALT: () => {\n          $.CONSUME(t.Less);\n          $.CONSUME2(t.Less);\n        }\n      },\n      {\n        GATE: () => $.LA(1).startOffset + 1 === $.LA(2).startOffset,\n        ALT: () => {\n          $.CONSUME(t.Greater);\n          $.CONSUME2(t.Greater);\n          $.OPTION({\n            GATE: () => $.LA(0).startOffset + 1 === $.LA(1).startOffset,\n            DEF: () => $.CONSUME3(t.Greater)\n          });\n        }\n      }\n    ]);\n  });\n}\n","export function defineRules($, t) {\n  // ---------------------\n  // Productions from §4 (Types, Values, and Variables)\n  // ---------------------\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-PrimitiveType\n  $.RULE(\"primitiveType\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.OR([\n      { ALT: () => $.SUBRULE($.numericType) },\n      { ALT: () => $.CONSUME(t.Boolean) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-NumericType\n  $.RULE(\"numericType\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.integralType) },\n      { ALT: () => $.SUBRULE($.floatingPointType) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-IntegralType\n  $.RULE(\"integralType\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.Byte) },\n      { ALT: () => $.CONSUME(t.Short) },\n      { ALT: () => $.CONSUME(t.Int) },\n      { ALT: () => $.CONSUME(t.Long) },\n      { ALT: () => $.CONSUME(t.Char) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-FloatingPointType\n  $.RULE(\"floatingPointType\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.Float) },\n      { ALT: () => $.CONSUME(t.Double) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-ReferenceType\n  $.RULE(\"referenceType\", () => {\n    $.MANY(() => {\n      // Spec Deviation: by extracting the common \"annotation\" prefix\n      // we can avoid backtracking and thus improve performance.\n      // Note that the annotation prefix is still present inside\n      // \"primitiveType\" and \"classOrInterfaceType\"\n      $.SUBRULE($.annotation);\n    });\n    // Spec Deviation: The array type \"dims\" suffix was extracted to this rule\n    // to avoid backtracking for performance reasons.\n    $.OR({\n      DEF: [\n        {\n          ALT: () => {\n            $.SUBRULE($.primitiveType);\n            $.SUBRULE($.dims);\n          }\n        },\n        {\n          // Spec Deviation: \"typeVariable\" alternative is missing because\n          //                 it is included in \"classOrInterfaceType\"\n          ALT: () => {\n            $.SUBRULE($.classOrInterfaceType);\n            $.OPTION(() => {\n              $.SUBRULE2($.dims);\n            });\n          }\n        }\n      ],\n      IGNORE_AMBIGUITIES: true // annotation prefix was extracted to remove ambiguities\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-ClassOrInterfaceType\n  $.RULE(\"classOrInterfaceType\", () => {\n    // Spec Deviation: The spec says: \"classType | interfaceType\" but \"interfaceType\"\n    //                 is not mentioned in the parser because it is identical to \"classType\"\n    //                 The distinction is **semantic** not syntactic.\n    $.SUBRULE($.classType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-ClassType\n  $.RULE(\"classType\", () => {\n    // Spec Deviation: Refactored left recursion and alternation to iterations\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.Identifier);\n    $.OPTION(() => {\n      $.SUBRULE($.typeArguments);\n    });\n    $.MANY2(() => {\n      $.CONSUME(t.Dot);\n      $.MANY3(() => {\n        $.SUBRULE2($.annotation);\n      });\n      // TODO: Semantic Check: This Identifier cannot be \"var\"\n      $.CONSUME2(t.Identifier);\n      $.OPTION2(() => $.SUBRULE2($.typeArguments));\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-InterfaceType\n  $.RULE(\"interfaceType\", () => {\n    $.SUBRULE($.classType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeVariable\n  $.RULE(\"typeVariable\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    // TODO: Semantic Check: This Identifier cannot be \"var\"\n    $.CONSUME(t.Identifier);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-Dims\n  $.RULE(\"dims\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.LSquare);\n    $.CONSUME(t.RSquare);\n    $.MANY2({\n      GATE: () => $.BACKTRACK_LOOKAHEAD($.isDims),\n      DEF: () => {\n        $.MANY3(() => {\n          $.SUBRULE2($.annotation);\n        });\n        $.CONSUME2(t.LSquare);\n        $.CONSUME2(t.RSquare);\n      }\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeParameter\n  $.RULE(\"typeParameter\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.typeParameterModifier);\n    });\n    $.SUBRULE($.typeIdentifier);\n    $.OPTION(() => {\n      $.SUBRULE($.typeBound);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeParameterModifier\n  $.RULE(\"typeParameterModifier\", () => {\n    $.SUBRULE($.annotation);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeBound\n  $.RULE(\"typeBound\", () => {\n    $.CONSUME(t.Extends);\n    // Spec Deviation: The alternative with \"TypeVariable\" is not specified\n    //      because it's syntax is included in \"classOrInterfaceType\"\n    $.SUBRULE($.classOrInterfaceType);\n    $.MANY(() => {\n      $.SUBRULE($.additionalBound);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-AdditionalBound\n  $.RULE(\"additionalBound\", () => {\n    $.CONSUME(t.And);\n    $.SUBRULE($.interfaceType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeArguments\n  $.RULE(\"typeArguments\", () => {\n    $.CONSUME(t.Less);\n    $.SUBRULE($.typeArgumentList);\n    $.CONSUME(t.Greater);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeArgumentList\n  $.RULE(\"typeArgumentList\", () => {\n    $.SUBRULE($.typeArgument);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.typeArgument);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-TypeArgument\n  $.RULE(\"typeArgument\", () => {\n    // TODO: performance: evaluate flipping the order of alternatives\n    $.OR([\n      { ALT: () => $.SUBRULE($.referenceType) },\n      { ALT: () => $.SUBRULE($.wildcard) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-Wildcard\n  $.RULE(\"wildcard\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.QuestionMark);\n    $.OPTION(() => {\n      $.SUBRULE($.wildcardBounds);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-4.html#jls-WildcardBounds\n  $.RULE(\"wildcardBounds\", () => {\n    // TODO: consider in-lining suffix into the alternatives to match the spec more strongly\n    $.OR([\n      { ALT: () => $.CONSUME(t.Extends) },\n      { ALT: () => $.CONSUME(t.Super) }\n    ]);\n    $.SUBRULE($.referenceType);\n  });\n}\n","import { tokenMatcher } from \"chevrotain\";\nexport function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-ModuleName\n  $.RULE(\"moduleName\", () => {\n    $.CONSUME(t.Identifier);\n    $.MANY(() => {\n      $.CONSUME(t.Dot);\n      $.CONSUME2(t.Identifier);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-PackageName\n  $.RULE(\"packageName\", () => {\n    $.CONSUME(t.Identifier);\n    $.MANY(() => {\n      $.CONSUME(t.Dot);\n      $.CONSUME2(t.Identifier);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-TypeName\n  $.RULE(\"typeName\", () => {\n    // Spec Deviation: The last Identifier in a \"typeName\" may not be be \"var\"\n    //                 But the parser does not check for that.\n    // TODO: post parsing semantic check: last \"Identifier\" in a \"typeName\"\n    //                                    cannot be the \"var\" keyword\n    // TODO: option 2 implement \"Not Var\" Ident using token categories?\n    $.CONSUME(t.Identifier);\n    $.MANY(() => {\n      $.CONSUME(t.Dot);\n      $.CONSUME2(t.Identifier);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-ExpressionName\n  $.RULE(\"expressionName\", () => {\n    // Spec Deviation: in-lined \"ambiguousName\" to be LL(K)\n    $.CONSUME(t.Identifier);\n    $.MANY({\n      // expressionName could be called by \"qualifiedExplicitConstructorInvocation\"\n      // in that case it may be followed by \".super\" so we need to look two tokens\n      // ahead.\n      GATE: () => tokenMatcher(this.LA(2).tokenType, t.Identifier),\n      DEF: () => {\n        $.CONSUME(t.Dot);\n        $.CONSUME2(t.Identifier);\n      }\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-MethodName\n  $.RULE(\"methodName\", () => {\n    $.CONSUME(t.Identifier);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-PackageOrTypeName\n  $.RULE(\"packageOrTypeName\", () => {\n    $.CONSUME(t.Identifier);\n    $.MANY({\n      // In some contexts a \"Dot Star\" (.*) may appear\n      // after a \"packageOrTypeName\", by default Chevrotain will\n      // only look a single token ahead (Dot) to determine if another iteration\n      // exists which will cause a parsing error for inputs such as:\n      // \"import a.b.c.*\"\n      GATE: () => tokenMatcher(this.LA(2).tokenType, t.Star) === false,\n      DEF: () => {\n        $.CONSUME(t.Dot);\n        $.CONSUME2(t.Identifier);\n      }\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-6.html#jls-AmbiguousName\n  $.RULE(\"ambiguousName\", () => {\n    $.CONSUME(t.Identifier);\n    $.MANY(() => {\n      $.CONSUME(t.Dot);\n      $.CONSUME2(t.Identifier);\n    });\n  });\n}\n","import { tokenMatcher, EOF } from \"chevrotain\";\n\nexport function defineRules($, t) {\n  /**\n   * Spec Deviation: As OrdinaryCompilationUnit and UnnamedClassCompilationUnit\n   * both can have multiple class or interface declarations, both were combined\n   * in the ordinaryCompilationUnit rule\n   *\n   * https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-CompilationUnit\n   * https://docs.oracle.com/javase/specs/jls/se22/preview/specs/implicitly-declared-classes-instance-main-methods-jls.html\n   */\n  $.RULE(\"compilationUnit\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.ordinaryCompilationUnit) },\n      { ALT: () => $.SUBRULE($.modularCompilationUnit) },\n      { ALT: () => $.CONSUME(EOF) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-OrdinaryCompilationUnit\n  $.RULE(\"ordinaryCompilationUnit\", () => {\n    $.OPTION(() => $.SUBRULE($.packageDeclaration));\n    $.MANY(() => {\n      $.SUBRULE3($.importDeclaration);\n    });\n    $.MANY2(() => {\n      $.SUBRULE($.typeDeclaration);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-ModularCompilationUnit\n  $.RULE(\"modularCompilationUnit\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.importDeclaration);\n    });\n    $.SUBRULE($.moduleDeclaration);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-PackageDeclaration\n  $.RULE(\"packageDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.packageModifier);\n    });\n    $.CONSUME(t.Package);\n    $.CONSUME(t.Identifier);\n    $.MANY2(() => {\n      $.CONSUME(t.Dot);\n      $.CONSUME2(t.Identifier);\n    });\n    $.CONSUME2(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-PackageModifier\n  $.RULE(\"packageModifier\", () => {\n    $.SUBRULE($.annotation);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-ImportDeclaration\n  $.RULE(\"importDeclaration\", () => {\n    // Spec Deviation: The spec defines four different kinds of import declarations.\n    //                 Our grammar however combines those into a single rule due to difficulties\n    //                 distinguishing between the alternatives due to unbound common prefix.\n    // TODO: A post parsing step is required to align with the official specs.\n    //       The Identifier \"var\" is not allowed in all positions and variations of the importDeclaration\n    $.OR([\n      {\n        ALT: () => {\n          $.CONSUME(t.Import);\n          $.OPTION(() => {\n            $.CONSUME(t.Static);\n          });\n          $.SUBRULE($.packageOrTypeName);\n          $.OPTION2(() => {\n            $.CONSUME(t.Dot);\n            $.CONSUME(t.Star);\n          });\n          $.CONSUME(t.Semicolon);\n        }\n      },\n      // Spec Deviation: The spec do not allow empty statement in between imports.\n      //                 However Java compiler consider empty statements valid, we chose\n      //                 to support that case, thus deviate from the spec.\n      //                 See here: https://github.com/jhipster/prettier-java/pull/158\n      {\n        ALT: () => $.SUBRULE($.emptyStatement)\n      }\n    ]);\n  });\n\n  /**\n   * Spec Deviation: As OrdinaryCompilationUnit and UnnamedClassCompilationUnit\n   * both can have multiple class or interface declarations, both were combined\n   * in the ordinaryCompilationUnit rule\n   *\n   * As a result, the typeDeclaration combine TopLevelClassOrInterfaceDeclaration and includes fields and method declarations as well\n   * to handle unnamed class compilation unit\n   *\n   * https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-TopLevelClassOrInterfaceDeclaration\n   * https://docs.oracle.com/javase/specs/jls/se22/preview/specs/implicitly-declared-classes-instance-main-methods-jls.html\n   */\n  $.RULE(\"typeDeclaration\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.Semicolon) },\n      { ALT: () => $.SUBRULE($.classDeclaration) },\n      { ALT: () => $.SUBRULE($.interfaceDeclaration) },\n      { ALT: () => $.SUBRULE($.fieldDeclaration) },\n      { ALT: () => $.SUBRULE($.methodDeclaration) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-ModuleDeclaration\n  $.RULE(\"moduleDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.OPTION(() => {\n      $.CONSUME(t.Open);\n    });\n    $.CONSUME(t.Module);\n    $.CONSUME(t.Identifier);\n    $.MANY2(() => {\n      $.CONSUME(t.Dot);\n      $.CONSUME2(t.Identifier);\n    });\n    $.CONSUME(t.LCurly);\n    $.MANY3(() => {\n      $.SUBRULE($.moduleDirective);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-ModuleDirective\n  $.RULE(\"moduleDirective\", () => {\n    // Spec Deviation: Each of the alternatives of \"moduleDirective\" was extracted\n    //                 to its own nonTerminal, to reduce verbosity.\n    $.OR([\n      { ALT: () => $.SUBRULE($.requiresModuleDirective) },\n      { ALT: () => $.SUBRULE($.exportsModuleDirective) },\n      { ALT: () => $.SUBRULE($.opensModuleDirective) },\n      { ALT: () => $.SUBRULE($.usesModuleDirective) },\n      { ALT: () => $.SUBRULE($.providesModuleDirective) }\n    ]);\n  });\n\n  $.RULE(\"requiresModuleDirective\", () => {\n    // Spec Deviation: extracted from \"moduleDirective\"\n    $.CONSUME(t.Requires);\n    $.MANY({\n      GATE: () => {\n        /**\n         * https://docs.oracle.com/javase/specs/jls/se22/html/jls-3.html#jls-3.9 -\n         *   There is one exception: immediately to the right of the character sequence `requires` in the ModuleDirective production,\n         *   the character sequence `transitive` is tokenized as a keyword unless it is followed by a separator,\n         *   in which case it is tokenized as an identifier.\n         */\n        return (\n          (tokenMatcher($.LA(1).tokenType, t.Transitive) &&\n            tokenMatcher($.LA(2).tokenType, t.Separators)) === false\n        );\n      },\n      DEF: () => {\n        $.SUBRULE($.requiresModifier);\n      }\n    });\n    $.SUBRULE($.moduleName);\n    $.CONSUME(t.Semicolon);\n  });\n\n  $.RULE(\"exportsModuleDirective\", () => {\n    // Spec Deviation: extracted from \"moduleDirective\"\n    $.CONSUME(t.Exports);\n    $.SUBRULE($.packageName);\n    $.OPTION(() => {\n      $.CONSUME(t.To);\n      $.SUBRULE($.moduleName);\n      $.MANY(() => {\n        $.CONSUME(t.Comma);\n        $.SUBRULE2($.moduleName);\n      });\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  $.RULE(\"opensModuleDirective\", () => {\n    // Spec Deviation: extracted from \"moduleDirective\"\n    $.CONSUME(t.Opens);\n    $.SUBRULE($.packageName);\n    $.OPTION(() => {\n      $.CONSUME(t.To);\n      $.SUBRULE($.moduleName);\n      $.MANY(() => {\n        $.CONSUME(t.Comma);\n        $.SUBRULE2($.moduleName);\n      });\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  $.RULE(\"usesModuleDirective\", () => {\n    // Spec Deviation: extracted from \"moduleDirective\"\n    $.CONSUME(t.Uses);\n    $.SUBRULE($.typeName);\n    $.CONSUME(t.Semicolon);\n  });\n\n  $.RULE(\"providesModuleDirective\", () => {\n    // Spec Deviation: extracted from \"moduleDirective\"\n    $.CONSUME(t.Provides);\n    $.SUBRULE($.typeName);\n    $.CONSUME(t.With);\n    $.SUBRULE2($.typeName);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE3($.typeName);\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-7.html#jls-RequiresModifier\n  $.RULE(\"requiresModifier\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.Transitive) },\n      { ALT: () => $.CONSUME(t.Static) }\n    ]);\n  });\n}\n","import { tokenMatcher } from \"chevrotain\";\n\nexport function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassDeclaration\n  $.RULE(\"classDeclaration\", () => {\n    // Spec Deviation: extracted common \"{classModifier}\" prefix\n    //      extraction is safe because there are no other references to\n    //      \"normalClassDeclaration\" and \"enumDeclaration\"\n    $.MANY(() => {\n      $.SUBRULE($.classModifier);\n    });\n    $.OR([\n      { ALT: () => $.SUBRULE($.normalClassDeclaration) },\n      { ALT: () => $.SUBRULE($.enumDeclaration) },\n      { ALT: () => $.SUBRULE($.recordDeclaration) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-NormalClassDeclaration\n  $.RULE(\"normalClassDeclaration\", () => {\n    // Spec Deviation: extracted common \"{classModifier}\" to \"classDeclaration\"\n    $.CONSUME(t.Class);\n    $.SUBRULE($.typeIdentifier);\n    $.OPTION(() => {\n      $.SUBRULE($.typeParameters);\n    });\n    $.OPTION2(() => {\n      $.SUBRULE($.classExtends);\n    });\n    $.OPTION3(() => {\n      $.SUBRULE($.classImplements);\n    });\n    $.OPTION4(() => {\n      $.SUBRULE($.classPermits);\n    });\n    $.SUBRULE($.classBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassModifier\n  $.RULE(\"classModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Protected) },\n      { ALT: () => $.CONSUME(t.Private) },\n      { ALT: () => $.CONSUME(t.Abstract) },\n      { ALT: () => $.CONSUME(t.Static) },\n      { ALT: () => $.CONSUME(t.Final) },\n      { ALT: () => $.CONSUME(t.Sealed) },\n      { ALT: () => $.CONSUME(t.NonSealed) },\n      { ALT: () => $.CONSUME(t.Strictfp) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-TypeParameters\n  $.RULE(\"typeParameters\", () => {\n    $.CONSUME(t.Less);\n    $.SUBRULE($.typeParameterList);\n    $.CONSUME(t.Greater);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-TypeParameterList\n  $.RULE(\"typeParameterList\", () => {\n    $.SUBRULE($.typeParameter);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.typeParameter);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassExtends\n  $.RULE(\"classExtends\", () => {\n    $.CONSUME(t.Extends);\n    $.SUBRULE($.classType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassImplements\n  $.RULE(\"classImplements\", () => {\n    $.CONSUME(t.Implements);\n    $.SUBRULE($.interfaceTypeList);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-InterfaceTypeList\n  $.RULE(\"interfaceTypeList\", () => {\n    $.SUBRULE($.interfaceType);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.interfaceType);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassPermits\n  $.RULE(\"classPermits\", () => {\n    $.CONSUME(t.Permits);\n    $.SUBRULE($.typeName);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.typeName);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassBody\n  $.RULE(\"classBody\", () => {\n    $.CONSUME(t.LCurly);\n    $.MANY(() => {\n      $.SUBRULE($.classBodyDeclaration);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassBodyDeclaration\n  $.RULE(\"classBodyDeclaration\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.classMemberDeclaration) },\n      { ALT: () => $.SUBRULE($.instanceInitializer) },\n      { ALT: () => $.SUBRULE($.staticInitializer) },\n      { ALT: () => $.SUBRULE($.constructorDeclaration) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ClassMemberDeclaration\n  $.RULE(\"classMemberDeclaration\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.fieldDeclaration) },\n      { ALT: () => $.SUBRULE($.methodDeclaration) },\n      { ALT: () => $.SUBRULE($.classDeclaration) },\n      { ALT: () => $.SUBRULE($.interfaceDeclaration) },\n      { ALT: () => $.CONSUME(t.Semicolon) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-FieldDeclaration\n  $.RULE(\"fieldDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.fieldModifier);\n    });\n    $.SUBRULE($.unannType);\n    $.SUBRULE($.variableDeclaratorList);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-FieldModifier\n  $.RULE(\"fieldModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Protected) },\n      { ALT: () => $.CONSUME(t.Private) },\n      { ALT: () => $.CONSUME(t.Static) },\n      { ALT: () => $.CONSUME(t.Final) },\n      { ALT: () => $.CONSUME(t.Transient) },\n      { ALT: () => $.CONSUME(t.Volatile) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableDeclaratorList\n  $.RULE(\"variableDeclaratorList\", isSingleDeclarator => {\n    $.SUBRULE($.variableDeclarator);\n    $.MANY({\n      // TypePattern has a semantic requirement that its VariableDeclaratorList\n      // consists of a single VariableDeclarator\n      GATE: () => !isSingleDeclarator,\n      DEF: () => {\n        $.CONSUME(t.Comma);\n        $.SUBRULE2($.variableDeclarator);\n      }\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableDeclarator\n  $.RULE(\"variableDeclarator\", () => {\n    $.SUBRULE($.variableDeclaratorId);\n    $.OPTION(() => {\n      $.CONSUME(t.Equals);\n      $.SUBRULE($.variableInitializer);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableDeclaratorId\n  $.RULE(\"variableDeclaratorId\", () => {\n    $.OR([\n      {\n        ALT: () => {\n          $.CONSUME(t.Identifier);\n          $.OPTION(() => {\n            $.SUBRULE($.dims);\n          });\n        }\n      },\n      { ALT: () => $.CONSUME(t.Underscore) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableInitializer\n  $.RULE(\"variableInitializer\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.expression) },\n      { ALT: () => $.SUBRULE($.arrayInitializer) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-UnannType\n  $.RULE(\"unannType\", () => {\n    $.OR([\n      // Spec Deviation: The array type \"dims\" suffix was extracted to this rule\n      // to avoid backtracking for performance reasons.\n      { ALT: () => $.SUBRULE($.unannPrimitiveTypeWithOptionalDimsSuffix) },\n      { ALT: () => $.SUBRULE($.unannReferenceType) }\n    ]);\n  });\n\n  $.RULE(\"unannPrimitiveTypeWithOptionalDimsSuffix\", () => {\n    $.SUBRULE($.unannPrimitiveType);\n    $.OPTION({\n      GATE: () => this.BACKTRACK_LOOKAHEAD($.isDims),\n      DEF: () => $.SUBRULE2($.dims)\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-UnannPrimitiveType\n  $.RULE(\"unannPrimitiveType\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.numericType) },\n      { ALT: () => $.CONSUME(t.Boolean) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-UnannReferenceType\n  $.RULE(\"unannReferenceType\", () => {\n    $.SUBRULE($.unannClassOrInterfaceType);\n    $.OPTION({\n      GATE: () => this.BACKTRACK_LOOKAHEAD($.isDims),\n      DEF: () => $.SUBRULE2($.dims)\n    });\n  });\n\n  $.RULE(\"unannClassOrInterfaceType\", () => {\n    // Spec Deviation: The spec says: \"UnannClassType  | UnannInterfaceType\" but \"UnannInterfaceType\"\n    //                 is not mentioned in the parser because it is identical to \"UnannClassType\"\n    //                 The distinction is **semantic** not syntactic.\n    $.SUBRULE($.unannClassType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-UnannClassType\n  $.RULE(\"unannClassType\", () => {\n    // Spec Deviation: Refactored left recursion and alternation to iterations\n    $.CONSUME(t.Identifier);\n    $.OPTION(() => {\n      $.SUBRULE($.typeArguments);\n    });\n    $.MANY2(() => {\n      $.CONSUME(t.Dot);\n      $.MANY3(() => {\n        $.SUBRULE2($.annotation);\n      });\n      // TODO: Semantic Check: This Identifier cannot be \"var\"\n      $.CONSUME2(t.Identifier);\n      $.OPTION2(() => {\n        $.SUBRULE2($.typeArguments);\n      });\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-UnannInterfaceType\n  $.RULE(\"unannInterfaceType\", () => {\n    $.SUBRULE($.unannClassType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-UnannTypeVariable\n  $.RULE(\"unannTypeVariable\", () => {\n    // TODO: Semantic Check: This Identifier cannot be \"var\"\n    // TODO: or define as token type?\n    $.CONSUME(t.Identifier);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-MethodDeclaration\n  $.RULE(\"methodDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.methodModifier);\n    });\n    $.SUBRULE($.methodHeader);\n    $.SUBRULE($.methodBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-MethodModifier\n  $.RULE(\"methodModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Protected) },\n      { ALT: () => $.CONSUME(t.Private) },\n      { ALT: () => $.CONSUME(t.Abstract) },\n      { ALT: () => $.CONSUME(t.Static) },\n      { ALT: () => $.CONSUME(t.Final) },\n      { ALT: () => $.CONSUME(t.Synchronized) },\n      { ALT: () => $.CONSUME(t.Native) },\n      { ALT: () => $.CONSUME(t.Strictfp) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-MethodHeader\n  $.RULE(\"methodHeader\", () => {\n    // Spec Deviation: extracted common prefix from both alternatives\n    $.OPTION(() => {\n      $.SUBRULE($.typeParameters);\n      $.MANY(() => {\n        $.SUBRULE($.annotation);\n      });\n    });\n    $.SUBRULE($.result);\n    $.SUBRULE($.methodDeclarator);\n    $.OPTION2(() => {\n      $.SUBRULE($.throws);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-Result\n  $.RULE(\"result\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.unannType) },\n      { ALT: () => $.CONSUME(t.Void) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-MethodDeclarator\n  $.RULE(\"methodDeclarator\", () => {\n    $.CONSUME(t.Identifier);\n    $.CONSUME(t.LBrace);\n    $.OR([\n      {\n        ALT: () => {\n          $.SUBRULE($.receiverParameter);\n          $.OPTION(() => {\n            $.CONSUME(t.Comma);\n            $.SUBRULE($.formalParameterList);\n          });\n        }\n      },\n      { ALT: () => $.OPTION1(() => $.SUBRULE1($.formalParameterList)) }\n    ]);\n    $.CONSUME(t.RBrace);\n    $.OPTION2(() => {\n      $.SUBRULE($.dims);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ReceiverParameter\n  $.RULE(\"receiverParameter\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.SUBRULE($.unannType);\n    $.OPTION(() => {\n      $.CONSUME(t.Identifier);\n      $.CONSUME(t.Dot);\n    });\n    $.CONSUME(t.This);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-FormalParameterList\n  $.RULE(\"formalParameterList\", () => {\n    $.SUBRULE($.formalParameter);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.formalParameter);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-FormalParameter\n  $.RULE(\"formalParameter\", () => {\n    $.OR([\n      // Spec Deviation: extracted to \"variableParaRegularParameter\"\n      { ALT: () => $.SUBRULE($.variableParaRegularParameter) },\n      { ALT: () => $.SUBRULE($.variableArityParameter) }\n    ]);\n  });\n\n  // Spec Deviation: extracted from \"formalParameter\"\n  $.RULE(\"variableParaRegularParameter\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.variableModifier);\n    });\n    $.SUBRULE($.unannType);\n    $.SUBRULE($.variableDeclaratorId);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableArityParameter\n  $.RULE(\"variableArityParameter\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.variableModifier);\n    });\n    $.SUBRULE($.unannType);\n    $.MANY2(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.DotDotDot);\n    $.CONSUME(t.Identifier);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableModifier\n  $.RULE(\"variableModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Final) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-Throws\n  $.RULE(\"throws\", () => {\n    $.CONSUME(t.Throws);\n    $.SUBRULE($.exceptionTypeList);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ExceptionTypeList\n  $.RULE(\"exceptionTypeList\", () => {\n    $.SUBRULE($.exceptionType);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.exceptionType);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ExceptionType\n  $.RULE(\"exceptionType\", () => {\n    // Spec Deviation: \"typeVariable\" alternative is missing because\n    //                 it is contained in classType.\n    $.SUBRULE($.classType);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-MethodBody\n  $.RULE(\"methodBody\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.block) },\n      { ALT: () => $.CONSUME(t.Semicolon) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-InstanceInitializer\n  $.RULE(\"instanceInitializer\", () => {\n    $.SUBRULE($.block);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-StaticInitializer\n  $.RULE(\"staticInitializer\", () => {\n    $.CONSUME(t.Static);\n    $.SUBRULE($.block);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ConstructorDeclaration\n  $.RULE(\"constructorDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.constructorModifier);\n    });\n    $.SUBRULE($.constructorDeclarator);\n    $.OPTION(() => {\n      $.SUBRULE($.throws);\n    });\n    $.SUBRULE($.constructorBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ConstructorModifier\n  $.RULE(\"constructorModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Protected) },\n      { ALT: () => $.CONSUME(t.Private) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ConstructorDeclarator\n  $.RULE(\"constructorDeclarator\", () => {\n    $.OPTION(() => {\n      $.SUBRULE($.typeParameters);\n    });\n    $.SUBRULE($.simpleTypeName);\n    $.CONSUME(t.LBrace);\n    $.OR([\n      {\n        ALT: () => {\n          $.SUBRULE($.receiverParameter);\n          $.OPTION1(() => {\n            $.CONSUME(t.Comma);\n            $.SUBRULE($.formalParameterList);\n          });\n        }\n      },\n      { ALT: () => $.OPTION2(() => $.SUBRULE1($.formalParameterList)) }\n    ]);\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-SimpleTypeName\n  $.RULE(\"simpleTypeName\", () => {\n    // TODO: implement: Identifier but not var\n    $.SUBRULE($.typeIdentifier);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ConstructorBody\n  $.RULE(\"constructorBody\", () => {\n    $.CONSUME(t.LCurly);\n    $.OPTION(() => {\n      $.SUBRULE($.explicitConstructorInvocation);\n    });\n    $.OPTION2(() => {\n      $.SUBRULE($.blockStatements);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-ExplicitConstructorInvocation\n  $.RULE(\"explicitConstructorInvocation\", () => {\n    // Spec Deviation: split into two separate sub rules.\n    $.OR([\n      { ALT: () => $.SUBRULE($.unqualifiedExplicitConstructorInvocation) },\n      { ALT: () => $.SUBRULE($.qualifiedExplicitConstructorInvocation) }\n    ]);\n  });\n\n  $.RULE(\"unqualifiedExplicitConstructorInvocation\", () => {\n    $.OPTION(() => {\n      $.SUBRULE($.typeArguments);\n    });\n    $.OR([\n      {\n        ALT: () => $.CONSUME(t.This)\n      },\n      {\n        ALT: () => $.CONSUME(t.Super)\n      }\n    ]);\n    $.CONSUME(t.LBrace);\n    $.OPTION2(() => {\n      $.SUBRULE($.argumentList);\n    });\n    $.CONSUME(t.RBrace);\n    $.CONSUME(t.Semicolon);\n  });\n\n  $.RULE(\"qualifiedExplicitConstructorInvocation\", () => {\n    // Spec Deviation: According to the spec the prefix may be a \"primary' as well,\n    //                 however, most primary variants don't make sense here\n    // TODO: discover which primary forms could be valid here\n    //       and handle only those specific cases.\n    //       It is best if we avoid referencing \"primary\" rule from\n    //       outside the expressions rules as the expressions rules are not aligned\n    //       to the spec style, so we want the smallest possible \"external api\"\n    //       for the expressions rules.\n    $.SUBRULE($.expressionName);\n    $.CONSUME(t.Dot);\n    $.OPTION(() => {\n      $.SUBRULE($.typeArguments);\n    });\n    $.CONSUME(t.Super);\n    $.CONSUME(t.LBrace);\n    $.OPTION2(() => {\n      $.SUBRULE($.argumentList);\n    });\n    $.CONSUME(t.RBrace);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-EnumDeclaration\n  $.RULE(\"enumDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.classModifier);\n    });\n    $.CONSUME(t.Enum);\n    $.SUBRULE($.typeIdentifier);\n    $.OPTION(() => {\n      $.SUBRULE($.classImplements);\n    });\n    $.SUBRULE($.enumBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-EnumBody\n  $.RULE(\"enumBody\", () => {\n    $.CONSUME(t.LCurly);\n    $.OPTION(() => {\n      $.SUBRULE($.enumConstantList);\n    });\n    $.OPTION2(() => {\n      $.CONSUME(t.Comma);\n    });\n    $.OPTION3(() => {\n      $.SUBRULE($.enumBodyDeclarations);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-EnumConstantList\n  $.RULE(\"enumConstantList\", () => {\n    $.SUBRULE($.enumConstant);\n    $.MANY({\n      GATE: () => {\n        const nextToken = $.LA(2);\n        return (\n          tokenMatcher(nextToken, t.Identifier) || tokenMatcher(nextToken, t.At)\n        );\n      },\n      DEF: () => {\n        $.CONSUME(t.Comma);\n        $.SUBRULE2($.enumConstant);\n      }\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-EnumConstant\n  $.RULE(\"enumConstant\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.enumConstantModifier);\n    });\n    $.CONSUME(t.Identifier);\n    $.OPTION(() => {\n      $.CONSUME(t.LBrace);\n      $.OPTION2(() => {\n        $.SUBRULE($.argumentList);\n      });\n      $.CONSUME(t.RBrace);\n    });\n    $.OPTION3(() => {\n      $.SUBRULE($.classBody);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-EnumConstantModifier\n  $.RULE(\"enumConstantModifier\", () => {\n    $.SUBRULE($.annotation);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-EnumBodyDeclarations\n  $.RULE(\"enumBodyDeclarations\", () => {\n    $.CONSUME(t.Semicolon);\n    $.MANY(() => {\n      $.SUBRULE($.classBodyDeclaration);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordHeader\n  $.RULE(\"recordDeclaration\", () => {\n    $.CONSUME(t.Record);\n    $.SUBRULE($.typeIdentifier);\n    $.OPTION(() => {\n      $.SUBRULE($.typeParameters);\n    });\n    $.SUBRULE($.recordHeader);\n    $.OPTION2(() => {\n      $.SUBRULE($.classImplements);\n    });\n    $.SUBRULE($.recordBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordHeader\n  $.RULE(\"recordHeader\", () => {\n    $.CONSUME(t.LBrace);\n    $.OPTION(() => {\n      $.SUBRULE($.recordComponentList);\n    });\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordComponentList\n  $.RULE(\"recordComponentList\", () => {\n    $.SUBRULE($.recordComponent);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.recordComponent);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordComponent\n  $.RULE(\"recordComponent\", () => {\n    // Spec Deviation: extracted common \"{recordComponentModifier} unannType\" prefix\n    //      extraction is safe because there are no other references to\n    //      \"variableArityRecordComponent\"\n    $.MANY(() => {\n      $.SUBRULE($.recordComponentModifier);\n    });\n    $.SUBRULE($.unannType);\n    $.OR([\n      { ALT: () => $.CONSUME(t.Identifier) },\n      { ALT: () => $.SUBRULE($.variableArityRecordComponent) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-VariableArityRecordComponent\n  // Spec Deviation: common \"{recordComponentModifier} unannType\" prefix was extracted in \"recordComponent\"\n  $.RULE(\"variableArityRecordComponent\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.DotDotDot);\n    $.CONSUME(t.Identifier);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordComponentModifier\n  $.RULE(\"recordComponentModifier\", () => {\n    $.SUBRULE($.annotation);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordBody\n  $.RULE(\"recordBody\", () => {\n    $.CONSUME(t.LCurly);\n    $.MANY(() => {\n      $.SUBRULE($.recordBodyDeclaration);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-RecordBodyDeclaration\n  $.RULE(\"recordBodyDeclaration\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.compactConstructorDeclaration) },\n      { ALT: () => $.SUBRULE($.classBodyDeclaration) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-8.html#jls-CompactConstructorDeclaration\n  $.RULE(\"compactConstructorDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.constructorModifier);\n    });\n    $.SUBRULE($.simpleTypeName);\n    $.SUBRULE($.constructorBody);\n  });\n\n  $.RULE(\"isDims\", () => {\n    $.MANY($.annotation);\n    return (\n      tokenMatcher(this.LA(1), t.LSquare) && tokenMatcher(this.LA(2), t.RSquare)\n    );\n  });\n}\n","import { tokenMatcher } from \"chevrotain\";\n\nexport function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceDeclaration\n  $.RULE(\"interfaceDeclaration\", () => {\n    // Spec Deviation: extracted the common \"interfaceModifier\" prefix to avoid backtracking.\n    $.MANY(() => {\n      $.SUBRULE($.interfaceModifier);\n    });\n\n    $.OR([\n      { ALT: () => $.SUBRULE($.normalInterfaceDeclaration) },\n      { ALT: () => $.SUBRULE($.annotationInterfaceDeclaration) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-NormalInterfaceDeclaration\n  $.RULE(\"normalInterfaceDeclaration\", () => {\n    // Spec Deviation: The \"interfaceModifier\" prefix was extracted to the \"interfaceDeclaration\"\n    $.CONSUME(t.Interface);\n    $.SUBRULE($.typeIdentifier);\n    $.OPTION(() => {\n      $.SUBRULE($.typeParameters);\n    });\n    $.OPTION2(() => {\n      $.SUBRULE($.interfaceExtends);\n    });\n    $.OPTION3(() => {\n      $.SUBRULE($.interfacePermits);\n    });\n    $.SUBRULE($.interfaceBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceModifier\n  $.RULE(\"interfaceModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Protected) },\n      { ALT: () => $.CONSUME(t.Private) },\n      { ALT: () => $.CONSUME(t.Abstract) },\n      { ALT: () => $.CONSUME(t.Static) },\n      { ALT: () => $.CONSUME(t.Sealed) },\n      { ALT: () => $.CONSUME(t.NonSealed) },\n      { ALT: () => $.CONSUME(t.Strictfp) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceExtends\n  $.RULE(\"interfaceExtends\", () => {\n    $.CONSUME(t.Extends);\n    $.SUBRULE($.interfaceTypeList);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/preview/specs/sealed-classes-jls.html\n  $.RULE(\"interfacePermits\", () => {\n    $.CONSUME(t.Permits);\n    $.SUBRULE($.typeName);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.typeName);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceBody\n  $.RULE(\"interfaceBody\", () => {\n    $.CONSUME(t.LCurly);\n    $.MANY(() => {\n      $.SUBRULE($.interfaceMemberDeclaration);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceMemberDeclaration\n  $.RULE(\"interfaceMemberDeclaration\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.constantDeclaration) },\n      { ALT: () => $.SUBRULE($.interfaceMethodDeclaration) },\n      { ALT: () => $.SUBRULE($.classDeclaration) },\n      { ALT: () => $.SUBRULE($.interfaceDeclaration) },\n      { ALT: () => $.CONSUME(t.Semicolon) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ConstantDeclaration\n  $.RULE(\"constantDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.constantModifier);\n    });\n    $.SUBRULE($.unannType);\n    $.SUBRULE($.variableDeclaratorList);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ConstantModifier\n  $.RULE(\"constantModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Static) },\n      { ALT: () => $.CONSUME(t.Final) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceMethodDeclaration\n  $.RULE(\"interfaceMethodDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.interfaceMethodModifier);\n    });\n    $.SUBRULE($.methodHeader);\n    $.SUBRULE($.methodBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-InterfaceMethodModifier\n  $.RULE(\"interfaceMethodModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Private) },\n      { ALT: () => $.CONSUME(t.Abstract) },\n      { ALT: () => $.CONSUME(t.Default) },\n      { ALT: () => $.CONSUME(t.Static) },\n      { ALT: () => $.CONSUME(t.Strictfp) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-AnnotationInterfaceDeclaration\n  $.RULE(\"annotationInterfaceDeclaration\", () => {\n    // Spec Deviation: The \"interfaceModifier\" prefix was extracted to the \"interfaceDeclaration\"\n    $.CONSUME(t.At);\n    $.CONSUME(t.Interface);\n    $.SUBRULE($.typeIdentifier);\n    $.SUBRULE($.annotationInterfaceBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-AnnotationInterfaceBody\n  $.RULE(\"annotationInterfaceBody\", () => {\n    $.CONSUME(t.LCurly);\n    $.MANY(() => {\n      $.SUBRULE($.annotationInterfaceMemberDeclaration);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-AnnotationInterfaceMemberDeclaration\n  $.RULE(\"annotationInterfaceMemberDeclaration\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotationInterfaceElementDeclaration) },\n      { ALT: () => $.SUBRULE($.constantDeclaration) },\n      { ALT: () => $.SUBRULE($.classDeclaration) },\n      { ALT: () => $.SUBRULE($.interfaceDeclaration) },\n      { ALT: () => $.CONSUME(t.Semicolon) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-AnnotationInterfaceElementDeclaration\n  $.RULE(\"annotationInterfaceElementDeclaration\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotationInterfaceElementModifier);\n    });\n    $.SUBRULE($.unannType);\n    $.CONSUME(t.Identifier);\n    $.CONSUME(t.LBrace);\n    $.CONSUME(t.RBrace);\n    $.OPTION(() => {\n      $.SUBRULE($.dims);\n    });\n    $.OPTION2(() => {\n      $.SUBRULE($.defaultValue);\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-AnnotationInterfaceElementModifier\n  $.RULE(\"annotationInterfaceElementModifier\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.annotation) },\n      { ALT: () => $.CONSUME(t.Public) },\n      { ALT: () => $.CONSUME(t.Abstract) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-DefaultValue\n  $.RULE(\"defaultValue\", () => {\n    $.CONSUME(t.Default);\n    $.SUBRULE($.elementValue);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-Annotation\n  $.RULE(\"annotation\", () => {\n    // Spec Deviation: The common prefix for all three annotation types was extracted to this rule.\n    // This was done to avoid the use of backtracking for performance reasons.\n    $.CONSUME(t.At);\n    $.SUBRULE($.typeName);\n\n    // If this optional grammar was not invoked we have a markerAnnotation\n    // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-MarkerAnnotation\n    $.OPTION(() => {\n      $.CONSUME(t.LBrace);\n      $.OR({\n        DEF: [\n          // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-NormalAnnotation\n          { ALT: () => $.SUBRULE($.elementValuePairList) },\n          // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-SingleElementAnnotation\n          { ALT: () => $.SUBRULE($.elementValue) },\n          {\n            ALT: () => {\n              /* empty normal annotation contents */\n            }\n          }\n        ],\n        IGNORE_AMBIGUITIES: true\n      });\n      $.CONSUME(t.RBrace);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ElementValuePairList\n  $.RULE(\"elementValuePairList\", () => {\n    $.SUBRULE($.elementValuePair);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.elementValuePair);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ElementValuePair\n  $.RULE(\"elementValuePair\", () => {\n    $.CONSUME(t.Identifier);\n    $.CONSUME(t.Equals);\n    $.SUBRULE($.elementValue);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ElementValue\n  $.RULE(\"elementValue\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.conditionalExpression) },\n      { ALT: () => $.SUBRULE($.elementValueArrayInitializer) },\n      { ALT: () => $.SUBRULE($.annotation) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ElementValueArrayInitializer\n  $.RULE(\"elementValueArrayInitializer\", () => {\n    $.CONSUME(t.LCurly);\n    $.OPTION(() => {\n      $.SUBRULE($.elementValueList);\n    });\n    $.OPTION2(() => {\n      $.CONSUME(t.Comma);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-9.html#jls-ElementValueList\n  $.RULE(\"elementValueList\", () => {\n    $.SUBRULE($.elementValue);\n    $.MANY({\n      GATE: () => tokenMatcher($.LA(2).tokenType, t.RCurly) === false,\n      DEF: () => {\n        $.CONSUME(t.Comma);\n        $.SUBRULE2($.elementValue);\n      }\n    });\n  });\n}\n","import { tokenMatcher } from \"chevrotain\";\n\nexport function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-10.html#jls-ArrayInitializer\n  $.RULE(\"arrayInitializer\", () => {\n    $.CONSUME(t.LCurly);\n    $.OPTION(() => {\n      $.SUBRULE($.variableInitializerList);\n    });\n    $.OPTION2(() => {\n      $.CONSUME(t.Comma);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-10.html#jls-VariableInitializerList\n  $.RULE(\"variableInitializerList\", () => {\n    $.SUBRULE($.variableInitializer);\n    $.MANY({\n      // The optional last \"Comma\" of an \"arrayInitializer\"\n      GATE: () => tokenMatcher(this.LA(2).tokenType, t.RCurly) === false,\n      DEF: () => {\n        $.CONSUME(t.Comma);\n        $.SUBRULE2($.variableInitializer);\n      }\n    });\n  });\n}\n","import { tokenMatcher } from \"chevrotain\";\n\n// Spec Deviation: The \"*NoShortIf\" variations were removed as the ambiguity of\n//                 the dangling else is resolved by attaching an \"else\" block\n//                 to the nearest \"if\"\nexport function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Block\n  $.RULE(\"block\", () => {\n    $.CONSUME(t.LCurly);\n    $.OPTION(() => {\n      $.SUBRULE($.blockStatements);\n    });\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-BlockStatements\n  $.RULE(\"blockStatements\", () => {\n    $.SUBRULE($.blockStatement);\n    $.MANY(() => {\n      $.SUBRULE2($.blockStatement);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-BlockStatement\n  $.RULE(\"blockStatement\", () => {\n    $.OR({\n      DEF: [\n        { ALT: () => $.SUBRULE($.localVariableDeclarationStatement) },\n        { ALT: () => $.SUBRULE($.classDeclaration) },\n        { ALT: () => $.SUBRULE($.interfaceDeclaration) },\n        { ALT: () => $.SUBRULE($.statement) }\n      ],\n      IGNORE_AMBIGUITIES: true\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-LocalVariableDeclarationStatement\n  $.RULE(\"localVariableDeclarationStatement\", () => {\n    $.SUBRULE($.localVariableDeclaration);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-LocalVariableDeclaration\n  $.RULE(\"localVariableDeclaration\", isSingleDeclarator => {\n    $.MANY(() => {\n      $.SUBRULE($.variableModifier);\n    });\n    $.SUBRULE($.localVariableType);\n    $.SUBRULE($.variableDeclaratorList, { ARGS: [isSingleDeclarator] });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-LocalVariableType\n  $.RULE(\"localVariableType\", () => {\n    $.OR({\n      DEF: [\n        { ALT: () => $.SUBRULE($.unannType) },\n        { ALT: () => $.CONSUME(t.Var) }\n      ],\n      IGNORE_AMBIGUITIES: true\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Statement\n  $.RULE(\"statement\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.statementWithoutTrailingSubstatement) },\n      { ALT: () => $.SUBRULE($.labeledStatement) },\n      // Spec deviation: combined \"IfThenStatement\" and \"IfThenElseStatement\"\n      { ALT: () => $.SUBRULE($.ifStatement) },\n      { ALT: () => $.SUBRULE($.whileStatement) },\n      { ALT: () => $.SUBRULE($.forStatement) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-StatementWithoutTrailingSubstatement\n  $.RULE(\"statementWithoutTrailingSubstatement\", () => {\n    $.OR({\n      DEF: [\n        { ALT: () => $.SUBRULE($.block) },\n        { ALT: () => $.SUBRULE($.yieldStatement) },\n        { ALT: () => $.SUBRULE($.emptyStatement) },\n        {\n          GATE: () => !tokenMatcher(this.LA(1).tokenType, t.Switch),\n          ALT: () => $.SUBRULE($.expressionStatement)\n        },\n        { ALT: () => $.SUBRULE($.assertStatement) },\n        { ALT: () => $.SUBRULE($.switchStatement) },\n        { ALT: () => $.SUBRULE($.doStatement) },\n        { ALT: () => $.SUBRULE($.breakStatement) },\n        { ALT: () => $.SUBRULE($.continueStatement) },\n        { ALT: () => $.SUBRULE($.returnStatement) },\n        { ALT: () => $.SUBRULE($.synchronizedStatement) },\n        { ALT: () => $.SUBRULE($.throwStatement) },\n        { ALT: () => $.SUBRULE($.tryStatement) }\n      ],\n      IGNORE_AMBIGUITIES: true\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-EmptyStatement\n  $.RULE(\"emptyStatement\", () => {\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-LabeledStatement\n  $.RULE(\"labeledStatement\", () => {\n    $.CONSUME(t.Identifier);\n    $.CONSUME(t.Colon);\n    $.SUBRULE($.statement);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ExpressionStatement\n  $.RULE(\"expressionStatement\", () => {\n    $.SUBRULE($.statementExpression);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-StatementExpression\n  $.RULE(\"statementExpression\", () => {\n    // Spec deviation: The many alternatives here were replaced with\n    //                 the \"expression\" rule as it contains them all,\n    //                 and distinguishing between the alternatives cannot be done\n    //                 using a fixed lookahead.\n    // TODO: verify the resulting expression is one of the valid alternatives?\n    $.SUBRULE($.expression);\n  });\n\n  // Spec deviation: combined \"IfThenStatement\" and \"IfThenElseStatement\"\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-IfThenStatement\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-IfThenElseStatement\n  $.RULE(\"ifStatement\", () => {\n    $.CONSUME(t.If);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.statement);\n    $.OPTION(() => {\n      $.CONSUME(t.Else);\n      $.SUBRULE2($.statement);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-AssertStatement\n  $.RULE(\"assertStatement\", () => {\n    $.CONSUME(t.Assert);\n    $.SUBRULE($.expression);\n    $.OPTION(() => {\n      $.CONSUME(t.Colon);\n      $.SUBRULE2($.expression);\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-SwitchStatement\n  $.RULE(\"switchStatement\", () => {\n    $.CONSUME(t.Switch);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.switchBlock);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-SwitchBlock\n  $.RULE(\"switchBlock\", () => {\n    $.CONSUME(t.LCurly);\n    $.OR([\n      {\n        ALT: () => {\n          $.SUBRULE($.switchRule);\n          $.MANY(() => $.SUBRULE2($.switchRule));\n        }\n      },\n      { ALT: () => $.MANY2(() => $.SUBRULE($.switchBlockStatementGroup)) }\n    ]);\n    $.CONSUME(t.RCurly);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-SwitchBlockStatementGroup\n  $.RULE(\"switchBlockStatementGroup\", () => {\n    $.SUBRULE($.switchLabel);\n    $.CONSUME(t.Colon);\n    $.OPTION(() => {\n      $.SUBRULE($.blockStatements);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-SwitchLabel\n  $.RULE(\"switchLabel\", () => {\n    $.OR([\n      {\n        ALT: () => {\n          $.CONSUME(t.Case);\n          $.OR2([\n            {\n              ALT: () => {\n                $.CONSUME(t.Null);\n                $.OPTION2(() => {\n                  $.CONSUME3(t.Comma);\n                  $.CONSUME(t.Default);\n                });\n              }\n            },\n            {\n              ALT: () => {\n                $.SUBRULE($.casePattern);\n                $.MANY(() => {\n                  $.CONSUME(t.Comma);\n                  $.SUBRULE2($.casePattern);\n                });\n                $.OPTION(() => {\n                  $.SUBRULE($.guard);\n                });\n              }\n            },\n            {\n              GATE: () => !tokenMatcher($.LA(1).tokenType, t.Null),\n              ALT: () => {\n                $.SUBRULE($.caseConstant);\n                $.MANY2(() => {\n                  $.CONSUME2(t.Comma);\n                  $.SUBRULE2($.caseConstant);\n                });\n              }\n            }\n          ]);\n        }\n      },\n      { ALT: () => $.CONSUME2(t.Default) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-SwitchRule\n  $.RULE(\"switchRule\", () => {\n    $.SUBRULE($.switchLabel);\n    $.CONSUME(t.Arrow);\n    $.OR([\n      { ALT: () => $.SUBRULE($.throwStatement) },\n      { ALT: () => $.SUBRULE($.block) },\n      {\n        ALT: () => {\n          $.SUBRULE($.expression);\n          $.CONSUME(t.Semicolon);\n        }\n      }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-CaseConstant\n  $.RULE(\"caseConstant\", () => {\n    $.SUBRULE($.conditionalExpression);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-CasePattern\n  $.RULE(\"casePattern\", () => {\n    $.SUBRULE($.pattern);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-WhileStatement\n  $.RULE(\"whileStatement\", () => {\n    $.CONSUME(t.While);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.statement);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-DoStatement\n  $.RULE(\"doStatement\", () => {\n    $.CONSUME(t.Do);\n    $.SUBRULE($.statement);\n    $.CONSUME(t.While);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ForStatement\n  $.RULE(\"forStatement\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.basicForStatement) },\n      { ALT: () => $.SUBRULE($.enhancedForStatement) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-BasicForStatement\n  $.RULE(\"basicForStatement\", () => {\n    $.CONSUME(t.For);\n    $.CONSUME(t.LBrace);\n    $.OPTION(() => {\n      $.SUBRULE($.forInit);\n    });\n    $.CONSUME(t.Semicolon);\n    $.OPTION2(() => {\n      $.SUBRULE($.expression);\n    });\n    $.CONSUME2(t.Semicolon);\n    $.OPTION3(() => {\n      $.SUBRULE($.forUpdate);\n    });\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.statement);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ForInit\n  $.RULE(\"forInit\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.localVariableDeclaration) },\n      { ALT: () => $.SUBRULE($.statementExpressionList) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ForUpdate\n  $.RULE(\"forUpdate\", () => {\n    $.SUBRULE($.statementExpressionList);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-StatementExpressionList\n  $.RULE(\"statementExpressionList\", () => {\n    $.SUBRULE($.statementExpression);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.statementExpression);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-EnhancedForStatement\n  $.RULE(\"enhancedForStatement\", () => {\n    $.CONSUME(t.For);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.localVariableDeclaration);\n    $.CONSUME(t.Colon);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.statement);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-BreakStatement\n  $.RULE(\"breakStatement\", () => {\n    $.CONSUME(t.Break);\n    $.OPTION(() => {\n      $.CONSUME(t.Identifier);\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ContinueStatement\n  $.RULE(\"continueStatement\", () => {\n    $.CONSUME(t.Continue);\n    $.OPTION(() => {\n      $.CONSUME(t.Identifier);\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ReturnStatement\n  $.RULE(\"returnStatement\", () => {\n    $.CONSUME(t.Return);\n    $.OPTION(() => {\n      $.SUBRULE($.expression);\n    });\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ThrowStatement\n  $.RULE(\"throwStatement\", () => {\n    $.CONSUME(t.Throw);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-SynchronizedStatement\n  $.RULE(\"synchronizedStatement\", () => {\n    $.CONSUME(t.Synchronized);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.block);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-TryStatement\n  $.RULE(\"tryStatement\", () => {\n    $.OR([\n      {\n        ALT: () => {\n          $.CONSUME(t.Try);\n          $.SUBRULE($.block);\n          $.OR2([\n            {\n              ALT: () => {\n                $.SUBRULE($.catches);\n                $.OPTION(() => {\n                  $.SUBRULE($.finally);\n                });\n              }\n            },\n            { ALT: () => $.SUBRULE2($.finally) }\n          ]);\n        }\n      },\n      { ALT: () => $.SUBRULE($.tryWithResourcesStatement) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Catches\n  $.RULE(\"catches\", () => {\n    $.SUBRULE($.catchClause);\n    $.MANY(() => {\n      $.SUBRULE2($.catchClause);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-CatchClause\n  $.RULE(\"catchClause\", () => {\n    $.CONSUME(t.Catch);\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.catchFormalParameter);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.block);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-CatchFormalParameter\n  $.RULE(\"catchFormalParameter\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.variableModifier);\n    });\n    $.SUBRULE($.catchType);\n    $.SUBRULE($.variableDeclaratorId);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-CatchType\n  $.RULE(\"catchType\", () => {\n    $.SUBRULE($.unannClassType);\n    $.MANY(() => {\n      $.CONSUME(t.Or);\n      $.SUBRULE2($.classType);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Finally\n  $.RULE(\"finally\", () => {\n    $.CONSUME(t.Finally);\n    $.SUBRULE($.block);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-TryWithResourcesStatement\n  $.RULE(\"tryWithResourcesStatement\", () => {\n    $.CONSUME(t.Try);\n    $.SUBRULE($.resourceSpecification);\n    $.SUBRULE($.block);\n    $.OPTION(() => {\n      $.SUBRULE($.catches);\n    });\n    $.OPTION2(() => {\n      $.SUBRULE($.finally);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ResourceSpecification\n  $.RULE(\"resourceSpecification\", () => {\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.resourceList);\n    $.OPTION(() => {\n      $.CONSUME(t.Semicolon);\n    });\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ResourceList\n  $.RULE(\"resourceList\", () => {\n    $.SUBRULE($.resource);\n    $.MANY({\n      GATE: () => tokenMatcher($.LA(2).tokenType, t.RBrace) === false,\n      DEF: () => {\n        $.CONSUME(t.Semicolon);\n        $.SUBRULE2($.resource);\n      }\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Resource\n  $.RULE(\"resource\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.localVariableDeclaration) },\n      { ALT: () => $.SUBRULE($.variableAccess) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-YieldStatement\n  $.RULE(\"yieldStatement\", () => {\n    $.CONSUME(t.Yield);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.Semicolon);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-VariableAccess\n  $.RULE(\"variableAccess\", () => {\n    // Spec Deviation: both \"expressionName\" and \"fieldAccess\" can be parsed\n    //                 by the \"primary\" rule\n    // TODO: verify that the primary is a fieldAccess or an expressionName.\n    $.SUBRULE($.primary);\n  });\n}\n","import { tokenMatcher } from \"chevrotain\";\nexport function defineRules($, t) {\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-Expression\n  $.RULE(\"expression\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.lambdaExpression) },\n      { ALT: () => $.SUBRULE($.conditionalExpression) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-LambdaExpression\n  $.RULE(\"lambdaExpression\", () => {\n    $.SUBRULE($.lambdaParameters);\n    $.CONSUME(t.Arrow);\n    $.SUBRULE($.lambdaBody);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-LambdaParameters\n  $.RULE(\"lambdaParameters\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.lambdaParametersWithBraces) },\n      { ALT: () => $.CONSUME(t.Identifier) },\n      { ALT: () => $.CONSUME(t.Underscore) }\n    ]);\n  });\n\n  $.RULE(\"lambdaParametersWithBraces\", () => {\n    $.CONSUME(t.LBrace);\n    $.OPTION(() => {\n      $.SUBRULE($.lambdaParameterList);\n    });\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-LambdaParameterList\n  $.RULE(\"lambdaParameterList\", () => {\n    $.OR([\n      {\n        GATE: () => {\n          const nextTokType = this.LA(1).tokenType;\n          const nextNextTokType = this.LA(2).tokenType;\n          return (\n            (tokenMatcher(nextTokType, t.Identifier) ||\n              tokenMatcher(nextTokType, t.Underscore)) &&\n            (tokenMatcher(nextNextTokType, t.RBrace) ||\n              tokenMatcher(nextNextTokType, t.Comma))\n          );\n        },\n        ALT: () => $.SUBRULE($.conciseLambdaParameterList)\n      },\n      { ALT: () => $.SUBRULE($.normalLambdaParameterList) }\n    ]);\n  });\n\n  $.RULE(\"conciseLambdaParameterList\", () => {\n    $.SUBRULE($.conciseLambdaParameter);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.conciseLambdaParameter);\n    });\n  });\n\n  $.RULE(\"normalLambdaParameterList\", () => {\n    $.SUBRULE($.normalLambdaParameter);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.normalLambdaParameter);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-NormalLambdaParameter\n  $.RULE(\"normalLambdaParameter\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.regularLambdaParameter) },\n      { ALT: () => $.SUBRULE($.variableArityParameter) }\n    ]);\n  });\n\n  $.RULE(\"regularLambdaParameter\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.variableModifier);\n    });\n    $.SUBRULE($.lambdaParameterType);\n    $.SUBRULE($.variableDeclaratorId);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-LambdaParameterType\n  $.RULE(\"lambdaParameterType\", () => {\n    $.OR({\n      DEF: [\n        { ALT: () => $.SUBRULE($.unannType) },\n        { ALT: () => $.CONSUME(t.Var) }\n      ],\n      IGNORE_AMBIGUITIES: true\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ConciseLambdaParameter\n  $.RULE(\"conciseLambdaParameter\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.Identifier) },\n      { ALT: () => $.CONSUME(t.Underscore) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-LambdaBody\n  $.RULE(\"lambdaBody\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.expression) },\n      { ALT: () => $.SUBRULE($.block) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ConditionalExpression\n  $.RULE(\"conditionalExpression\", () => {\n    $.SUBRULE($.binaryExpression);\n    $.OPTION(() => {\n      $.CONSUME(t.QuestionMark);\n      $.SUBRULE($.expression);\n      $.CONSUME(t.Colon);\n      // TODO: in the grammar this is limited to \"lambdaExpression: or \"conditionalExpression\"\n      $.SUBRULE2($.expression);\n    });\n  });\n\n  $.RULE(\"binaryExpression\", () => {\n    $.SUBRULE($.unaryExpression);\n    $.MANY(() => {\n      $.OR({\n        DEF: [\n          {\n            ALT: () => {\n              $.CONSUME(t.Instanceof);\n              $.OR1([\n                { ALT: () => $.SUBRULE($.pattern) },\n                { ALT: () => $.SUBRULE($.referenceType) }\n              ]);\n            }\n          },\n          {\n            ALT: () => {\n              $.CONSUME(t.AssignmentOperator);\n              $.SUBRULE2($.expression);\n            }\n          },\n          // This is an example of why Java does not have a well designed grammar\n          // See: https://manas.tech/blog/2008/10/12/why-java-generics-dont-have-problems-with-right-shift-operator.html\n          {\n            // TODO: this is a bug in Chevrotain lookahead calculation. the \"BinaryOperator\" token can match \"Less\" or \"Greater\"\n            //   as well, but because it is a **token Category** Chevrotain does not understand it need to looks two tokens ahead.\n            GATE: () =>\n              tokenMatcher($.LA(2).tokenType, t.Less) ||\n              tokenMatcher($.LA(2).tokenType, t.Greater),\n            ALT: () => {\n              $.SUBRULE($.shiftOperator);\n              $.SUBRULE2($.unaryExpression);\n            }\n          },\n          {\n            ALT: () => {\n              $.CONSUME(t.BinaryOperator);\n              $.SUBRULE3($.unaryExpression);\n            }\n          }\n        ],\n        IGNORE_AMBIGUITIES: true // the ambiguity between 1 and 4 options is resolved by the order (instanceOf is first)\n      });\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-UnaryExpression\n  $.RULE(\"unaryExpression\", () => {\n    $.MANY(() => {\n      $.CONSUME(t.UnaryPrefixOperator);\n    });\n    $.SUBRULE($.primary);\n    $.MANY2(() => {\n      $.CONSUME(t.UnarySuffixOperator);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-UnaryExpressionNotPlusMinus\n  $.RULE(\"unaryExpressionNotPlusMinus\", () => {\n    $.MANY(() => {\n      $.CONSUME(t.UnaryPrefixOperatorNotPlusMinus);\n    });\n    $.SUBRULE($.primary);\n    $.MANY2(() => {\n      $.CONSUME(t.UnarySuffixOperator);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-Primary\n  $.RULE(\"primary\", () => {\n    $.SUBRULE($.primaryPrefix);\n    $.MANY(() => {\n      $.SUBRULE($.primarySuffix);\n    });\n  });\n\n  $.RULE(\"primaryPrefix\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.literal) },\n      { ALT: () => $.CONSUME(t.This) },\n      { ALT: () => $.CONSUME(t.Void) },\n      { ALT: () => $.SUBRULE($.unannPrimitiveTypeWithOptionalDimsSuffix) },\n      { ALT: () => $.SUBRULE($.fqnOrRefType) },\n      { ALT: () => $.SUBRULE($.castExpression) },\n      { ALT: () => $.SUBRULE($.parenthesisExpression) },\n      { ALT: () => $.SUBRULE($.newExpression) },\n      { ALT: () => $.SUBRULE($.switchStatement) }\n    ]);\n  });\n\n  $.RULE(\"primarySuffix\", () => {\n    $.OR([\n      {\n        ALT: () => {\n          $.CONSUME(t.Dot);\n          $.OR2([\n            { ALT: () => $.CONSUME(t.This) },\n            {\n              ALT: () => $.SUBRULE($.unqualifiedClassInstanceCreationExpression)\n            },\n            {\n              ALT: () => {\n                $.OPTION(() => {\n                  $.SUBRULE($.typeArguments);\n                });\n                $.CONSUME(t.Identifier);\n              }\n            },\n            { ALT: () => $.SUBRULE($.templateArgument) }\n          ]);\n        }\n      },\n      { ALT: () => $.SUBRULE($.methodInvocationSuffix) },\n      { ALT: () => $.SUBRULE($.classLiteralSuffix) },\n      { ALT: () => $.SUBRULE($.arrayAccessSuffix) },\n      { ALT: () => $.SUBRULE($.methodReferenceSuffix) }\n    ]);\n  });\n\n  // See https://github.com/jhipster/prettier-java/pull/154 to understand\n  // why fqnOrRefTypePart is split in two rules (First and Rest)\n  $.RULE(\"fqnOrRefType\", () => {\n    $.SUBRULE($.fqnOrRefTypePartFirst);\n\n    $.MANY({\n      // avoids ambiguity with primary suffixes\n      GATE: () => {\n        const nextNextToken = $.LA(2);\n        return !(\n          tokenMatcher(nextNextToken, t.Class) ||\n          tokenMatcher(nextNextToken, t.This) ||\n          tokenMatcher(nextNextToken, t.New) ||\n          tokenMatcher(nextNextToken, t.StringLiteral) ||\n          tokenMatcher(nextNextToken, t.TextBlock) ||\n          tokenMatcher(nextNextToken, t.StringTemplateBegin) ||\n          tokenMatcher(nextNextToken, t.TextBlockTemplateBegin)\n        );\n      },\n      DEF: () => {\n        $.CONSUME(t.Dot);\n        $.SUBRULE2($.fqnOrRefTypePartRest);\n      }\n    });\n\n    // in case of an arrayType\n    $.OPTION({\n      // it is not enough to check only the opening \"[\", we must avoid conflict with\n      // arrayAccessSuffix\n      GATE: () =>\n        tokenMatcher($.LA(1).tokenType, t.At) ||\n        tokenMatcher($.LA(2).tokenType, t.RSquare),\n      DEF: () => {\n        $.SUBRULE($.dims);\n      }\n    });\n  });\n\n  // TODO: validation:\n  //       1. \"annotation\" cannot be mixed with \"methodTypeArguments\" or \"Super\".\n  //       2. \"methodTypeArguments\" cannot be mixed with \"classTypeArguments\" or \"annotation\".\n  //       3. \"Super\" cannot be mixed with \"classTypeArguments\" or \"annotation\".\n  //       4. At most one \"Super\" may be used.\n  //       5. \"Super\" may be last or one before last (last may also be first if there is only a single part).\n  $.RULE(\"fqnOrRefTypePartRest\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n\n    $.OPTION(() => $.SUBRULE2($.typeArguments));\n\n    $.SUBRULE($.fqnOrRefTypePartCommon);\n  });\n\n  $.RULE(\"fqnOrRefTypePartCommon\", () => {\n    $.OR([\n      { ALT: () => $.CONSUME(t.Identifier) },\n      { ALT: () => $.CONSUME(t.Super) }\n    ]);\n\n    let isRefTypeInMethodRef = false;\n    // Performance optimization, only perform this backtracking when a '<' is found\n    // TODO: performance optimization evaluation: avoid doing this backtracking for every \"<\" encountered.\n    //       we could do it once (using global state) per \"fqnOrRefType\"\n    // We could do it only once for\n    if (tokenMatcher($.LA(1).tokenType, t.Less)) {\n      isRefTypeInMethodRef = this.BACKTRACK_LOOKAHEAD($.isRefTypeInMethodRef);\n    }\n\n    $.OPTION2({\n      // unrestricted typeArguments here would create an ambiguity with \"LessThan\" operator\n      // e.g: \"var x = a < b;\"\n      // The \"<\" would be parsed as the beginning of a \"typeArguments\"\n      // and we will get an error: \"expecting '>' but found: ';'\"\n      GATE: () => isRefTypeInMethodRef,\n      DEF: () => {\n        $.SUBRULE3($.typeArguments);\n      }\n    });\n  });\n\n  $.RULE(\"fqnOrRefTypePartFirst\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n\n    $.SUBRULE($.fqnOrRefTypePartCommon);\n  });\n\n  $.RULE(\"parenthesisExpression\", () => {\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-CastExpression\n  $.RULE(\"castExpression\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.primitiveCastExpression) },\n      { ALT: () => $.SUBRULE($.referenceTypeCastExpression) }\n    ]);\n  });\n\n  $.RULE(\"primitiveCastExpression\", () => {\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.primitiveType);\n    $.CONSUME(t.RBrace);\n    $.SUBRULE($.unaryExpression);\n  });\n\n  $.RULE(\"referenceTypeCastExpression\", () => {\n    $.CONSUME(t.LBrace);\n    $.SUBRULE($.referenceType);\n    $.MANY(() => {\n      $.SUBRULE($.additionalBound);\n    });\n    $.CONSUME(t.RBrace);\n    $.OR([\n      { ALT: () => $.SUBRULE($.lambdaExpression) },\n      { ALT: () => $.SUBRULE($.unaryExpressionNotPlusMinus) }\n    ]);\n  });\n\n  $.RULE(\"newExpression\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.arrayCreationExpression) },\n      { ALT: () => $.SUBRULE($.unqualifiedClassInstanceCreationExpression) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-UnqualifiedClassInstanceCreationExpression\n  $.RULE(\"unqualifiedClassInstanceCreationExpression\", () => {\n    $.CONSUME(t.New);\n    $.OPTION(() => {\n      $.SUBRULE($.typeArguments);\n    });\n    $.SUBRULE($.classOrInterfaceTypeToInstantiate);\n    $.CONSUME(t.LBrace);\n    $.OPTION2(() => {\n      $.SUBRULE($.argumentList);\n    });\n    $.CONSUME(t.RBrace);\n    $.OPTION3(() => {\n      $.SUBRULE($.classBody);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ClassOrInterfaceTypeToInstantiate\n  $.RULE(\"classOrInterfaceTypeToInstantiate\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.Identifier);\n    $.MANY2(() => {\n      $.CONSUME(t.Dot);\n      $.MANY3(() => {\n        $.SUBRULE2($.annotation);\n      });\n      $.CONSUME2(t.Identifier);\n    });\n    $.OPTION(() => {\n      $.SUBRULE($.typeArgumentsOrDiamond);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-TypeArgumentsOrDiamond\n  $.RULE(\"typeArgumentsOrDiamond\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.diamond) },\n      { ALT: () => $.SUBRULE($.typeArguments) }\n    ]);\n  });\n\n  $.RULE(\"diamond\", () => {\n    $.CONSUME(t.Less);\n    $.CONSUME(t.Greater);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-MethodInvocation\n  $.RULE(\"methodInvocationSuffix\", () => {\n    $.CONSUME(t.LBrace);\n    $.OPTION2(() => {\n      $.SUBRULE($.argumentList);\n    });\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ArgumentList\n  $.RULE(\"argumentList\", () => {\n    $.SUBRULE($.expression);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.expression);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ArrayCreationExpression\n  $.RULE(\"arrayCreationExpression\", () => {\n    $.CONSUME(t.New);\n    $.OR([\n      { ALT: () => $.SUBRULE($.primitiveType) },\n      { ALT: () => $.SUBRULE($.classOrInterfaceType) }\n    ]);\n\n    $.OR2([\n      {\n        ALT: () => $.SUBRULE($.arrayCreationExpressionWithoutInitializerSuffix)\n      },\n      { ALT: () => $.SUBRULE($.arrayCreationWithInitializerSuffix) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ArrayCreationExpressionWithoutInitializer\n  $.RULE(\"arrayCreationExpressionWithoutInitializerSuffix\", () => {\n    $.SUBRULE($.dimExprs);\n    $.OPTION(() => {\n      $.SUBRULE($.dims);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ArrayCreationExpressionWithInitializer\n  $.RULE(\"arrayCreationWithInitializerSuffix\", () => {\n    $.SUBRULE($.dims);\n    $.SUBRULE($.arrayInitializer);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-DimExprs\n  $.RULE(\"dimExprs\", () => {\n    $.SUBRULE($.dimExpr);\n    $.MANY({\n      // The GATE is to distinguish DimExpr from Dims :\n      // the only difference between these two is the presence of an expression in the DimExpr\n      // Example: If the GATE is not present double[3][] won't be parsed as the parser will try to parse \"[]\"\n      // as a dimExpr instead of a dims\n      GATE: () => tokenMatcher($.LA(2).tokenType, t.RSquare) === false,\n      DEF: () => $.SUBRULE2($.dimExpr)\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-DimExpr\n  $.RULE(\"dimExpr\", () => {\n    $.MANY(() => {\n      $.SUBRULE($.annotation);\n    });\n    $.CONSUME(t.LSquare);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RSquare);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ClassLiteral\n  $.RULE(\"classLiteralSuffix\", () => {\n    $.MANY(() => {\n      $.CONSUME(t.LSquare);\n      $.CONSUME(t.RSquare);\n    });\n    $.CONSUME(t.Dot);\n    $.CONSUME(t.Class);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-ArrayAccess\n  $.RULE(\"arrayAccessSuffix\", () => {\n    $.CONSUME(t.LSquare);\n    $.SUBRULE($.expression);\n    $.CONSUME(t.RSquare);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-15.html#jls-MethodReference\n  $.RULE(\"methodReferenceSuffix\", () => {\n    $.CONSUME(t.ColonColon);\n    $.OPTION(() => {\n      $.SUBRULE($.typeArguments);\n    });\n\n    $.OR([\n      { ALT: () => $.CONSUME(t.Identifier) },\n      // TODO: a constructor method reference (\"new\") can only be used\n      //   in specific contexts, but perhaps this verification is best left\n      //   for a semantic analysis phase\n      { ALT: () => $.CONSUME(t.New) }\n    ]);\n  });\n\n  $.RULE(\"templateArgument\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.template) },\n      { ALT: () => $.CONSUME(t.StringLiteral) },\n      { ALT: () => $.CONSUME(t.TextBlock) }\n    ]);\n  });\n\n  $.RULE(\"template\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.stringTemplate) },\n      { ALT: () => $.SUBRULE($.textBlockTemplate) }\n    ]);\n  });\n\n  $.RULE(\"stringTemplate\", () => {\n    $.CONSUME(t.StringTemplateBegin);\n    $.SUBRULE($.embeddedExpression);\n    $.MANY(() => {\n      $.CONSUME(t.StringTemplateMid);\n      $.SUBRULE1($.embeddedExpression);\n    });\n    $.CONSUME(t.StringTemplateEnd);\n  });\n\n  $.RULE(\"textBlockTemplate\", () => {\n    $.CONSUME(t.TextBlockTemplateBegin);\n    $.SUBRULE($.embeddedExpression);\n    $.MANY(() => {\n      $.CONSUME(t.TextBlockTemplateMid);\n      $.SUBRULE1($.embeddedExpression);\n    });\n    $.CONSUME(t.TextBlockTemplateEnd);\n  });\n\n  $.RULE(\"embeddedExpression\", () => {\n    $.OPTION(() => {\n      $.SUBRULE($.expression);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Pattern\n  $.RULE(\"pattern\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.typePattern) },\n      { ALT: () => $.SUBRULE($.recordPattern) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-TypePattern\n  $.RULE(\"typePattern\", () => {\n    $.SUBRULE($.localVariableDeclaration, { ARGS: [true] });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-RecordPattern\n  $.RULE(\"recordPattern\", () => {\n    $.SUBRULE($.referenceType);\n    $.CONSUME(t.LBrace);\n    $.OPTION(() => {\n      $.SUBRULE($.componentPatternList);\n    });\n    $.CONSUME(t.RBrace);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ComponentPatternList\n  $.RULE(\"componentPatternList\", () => {\n    $.SUBRULE($.componentPattern);\n    $.MANY(() => {\n      $.CONSUME(t.Comma);\n      $.SUBRULE2($.componentPattern);\n    });\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-ComponentPattern\n  $.RULE(\"componentPattern\", () => {\n    $.OR([\n      { ALT: () => $.SUBRULE($.pattern) },\n      { ALT: () => $.SUBRULE($.matchAllPattern) }\n    ]);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-MatchAllPattern\n  $.RULE(\"matchAllPattern\", () => {\n    $.CONSUME(t.Underscore);\n  });\n\n  // https://docs.oracle.com/javase/specs/jls/se22/html/jls-14.html#jls-Guard\n  $.RULE(\"guard\", () => {\n    $.CONSUME(t.When);\n    $.SUBRULE($.expression);\n  });\n\n  $.RULE(\"isRefTypeInMethodRef\", () => {\n    let result = undefined;\n    $.SUBRULE($.typeArguments);\n\n    // arrayType\n    const hasDims = $.OPTION(() => {\n      $.SUBRULE($.dims);\n    });\n\n    const firstTokTypeAfterTypeArgs = this.LA(1).tokenType;\n    if (tokenMatcher(firstTokTypeAfterTypeArgs, t.ColonColon)) {\n      result = true;\n    }\n    // we must be at the end of a \"referenceType\" if \"dims\" were encountered\n    // So there is not point to check farther\n    else if (hasDims) {\n      result = false;\n    }\n\n    // in the middle of a \"classReferenceType\"\n    $.OPTION2(() => {\n      $.CONSUME(t.Dot);\n      $.SUBRULE($.classOrInterfaceType);\n    });\n\n    if (result !== undefined) {\n      return result;\n    }\n\n    const firstTokTypeAfterRefType = this.LA(1).tokenType;\n    return tokenMatcher(firstTokTypeAfterRefType, t.ColonColon);\n  });\n}\n\nexport function computeFirstForUnaryExpressionNotPlusMinus() {\n  const firstUnaryExpressionNotPlusMinus = this.computeContentAssist(\n    \"unaryExpressionNotPlusMinus\",\n    []\n  );\n  const nextTokTypes = firstUnaryExpressionNotPlusMinus.map(\n    x => x.nextTokenType\n  );\n  // uniq\n  return nextTokTypes.filter((v, i, a) => a.indexOf(v) === i);\n}\n","import { CstParser, isRecognitionException } from \"chevrotain\";\nimport { LLStarLookaheadStrategy } from \"chevrotain-allstar\";\nimport { allTokens, tokens as t } from \"./tokens.js\";\nimport * as lexicalStructure from \"./productions/lexical-structure.js\";\nimport * as typesValuesVariables from \"./productions/types-values-and-variables.js\";\nimport * as names from \"./productions/names.js\";\nimport * as packagesModules from \"./productions/packages-and-modules.js\";\nimport * as classes from \"./productions/classes.js\";\nimport * as interfaces from \"./productions/interfaces.js\";\nimport * as arrays from \"./productions/arrays.js\";\nimport * as blocksStatements from \"./productions/blocks-and-statements.js\";\nimport * as expressions from \"./productions/expressions.js\";\nimport { getSkipValidations } from \"./utils.js\";\n\n/**\n * This parser attempts to strongly align with the specs style at:\n * -  https://docs.oracle.com/javase/specs/jls/se11/html/jls-19.html\n *\n * Deviations from the spec will be marked.\n *\n * Note that deviations from the spec do not mean deviations from Java Grammar.\n * Rather it means an **equivalent** grammar which was written differently, e.g:\n * - LL(k) vs LR(K)\n * - Left Recursions vs Repetitions\n * - NonTerminals combined together or divided to sub-NonTerminals\n * - ...\n *\n * A special type of spec deviations are the \"super grammar\" kind.\n * This means that the parser has been defined in such a way that it accept a\n * **strict superset** of the inputs the official grammar accepts.\n *\n * This technique is used to simplify the parser when narrowing the set\n * of accepted inputs can more easily be done in a post parsing phase.\n *\n * TODO: document guide lines for using back tracking\n *\n */\nexport default class JavaParser extends CstParser {\n  constructor() {\n    super(allTokens, {\n      lookaheadStrategy: new LLStarLookaheadStrategy({\n        logging: getSkipValidations() ? () => {} : undefined\n      }),\n      nodeLocationTracking: \"full\",\n      // traceInitPerf: 2,\n      skipValidations: getSkipValidations()\n    });\n\n    const $ = this;\n\n    // ---------------------\n    // Productions from §3 (Lexical Structure)\n    // ---------------------\n    // TODO: move this rule to the correct file\n    $.RULE(\"typeIdentifier\", () => {\n      // TODO: implement: Identifier but not var in the lexer\n      $.CONSUME(t.Identifier);\n    });\n\n    // Include the productions from all \"chapters\".\n    lexicalStructure.defineRules.call(this, $, t);\n    typesValuesVariables.defineRules.call(this, $, t);\n    names.defineRules.call(this, $, t);\n    classes.defineRules.call(this, $, t);\n    packagesModules.defineRules.call(this, $, t);\n    interfaces.defineRules.call(this, $, t);\n    arrays.defineRules.call(this, $, t);\n    blocksStatements.defineRules.call(this, $, t);\n    expressions.defineRules.call(this, $, t);\n\n    this.firstForUnaryExpressionNotPlusMinus = [];\n    this.performSelfAnalysis();\n    this.firstForUnaryExpressionNotPlusMinus =\n      expressions.computeFirstForUnaryExpressionNotPlusMinus.call(this);\n  }\n\n  cstPostNonTerminal(ruleCstResult, ruleName) {\n    if (this.isBackTracking()) {\n      return;\n    }\n    super.cstPostNonTerminal(ruleCstResult, ruleName);\n  }\n\n  BACKTRACK_LOOKAHEAD(production, errValue = false) {\n    return this.ACTION(() => {\n      this.isBackTrackingStack.push(1);\n      // TODO: \"saveRecogState\" does not handle the occurrence stack\n      const orgState = this.saveRecogState();\n      try {\n        // hack to enable outputting non-CST values from grammar rules.\n        const { ruleName, originalGrammarAction } = production;\n        try {\n          this.ruleInvocationStateUpdate(\n            this.fullRuleNameToShort[ruleName],\n            ruleName,\n            this.subruleIdx\n          );\n          return originalGrammarAction.call(this);\n        } catch (e) {\n          return this.invokeRuleCatch(e, true, () => undefined);\n        } finally {\n          this.ruleFinallyStateUpdate();\n        }\n      } catch (e) {\n        if (isRecognitionException(e)) {\n          return errValue;\n        }\n        throw e;\n      } finally {\n        this.reloadRecogState(orgState);\n        this.isBackTrackingStack.pop();\n      }\n    });\n  }\n}\n","import JavaLexer from \"./lexer.js\";\nimport JavaParser from \"./parser.js\";\n\nconst parser = new JavaParser();\n\nexport const BaseJavaCstVisitor = parser.getBaseCstVisitorConstructor();\nexport const BaseJavaCstVisitorWithDefaults =\n  parser.getBaseCstVisitorConstructorWithDefaults();\n\nexport function lexAndParse(inputText, entryPoint = \"compilationUnit\") {\n  // Lex\n  const lexResult = JavaLexer.tokenize(inputText);\n\n  if (lexResult.errors.length > 0) {\n    const firstError = lexResult.errors[0];\n    throw Error(\n      \"Sad sad panda, lexing errors detected in line: \" +\n        firstError.line +\n        \", column: \" +\n        firstError.column +\n        \"!\\n\" +\n        firstError.message\n    );\n  }\n\n  const tokens = lexResult.tokens;\n  parser.input = tokens;\n\n  // Automatic CST created when parsing\n  const cst = parser[entryPoint]();\n\n  if (parser.errors.length > 0) {\n    const error = parser.errors[0];\n    throw Error(\n      \"Sad sad panda, parsing errors detected in line: \" +\n        error.token.startLine +\n        \", column: \" +\n        error.token.startColumn +\n        \"!\\n\" +\n        error.message +\n        \"!\\n\\t->\" +\n        error.context.ruleStack.join(\"\\n\\t->\")\n    );\n  }\n\n  cst.comments = lexResult.groups.comments;\n\n  return { cst, tokens };\n}\n\nexport function parse(inputText, entryPoint = \"compilationUnit\") {\n  return lexAndParse(inputText, entryPoint).cst;\n}\n\nexport default {\n  lexAndParse,\n  parse,\n  BaseJavaCstVisitor,\n  BaseJavaCstVisitorWithDefaults\n};\n","import type {\n  AnnotationCstNode,\n  BinaryExpressionCstNode,\n  ClassPermitsCstNode,\n  ClassTypeCtx,\n  CstElement,\n  CstNode,\n  ExpressionCstNode,\n  InterfacePermitsCstNode,\n  IToken,\n  StatementCstNode\n} from \"java-parser\";\nimport type { AstPath, Doc, ParserOptions } from \"prettier\";\nimport { builders } from \"prettier/doc\";\nimport type { JavaComment } from \"../comments.js\";\nimport parser from \"../parser.js\";\n\nconst { group, hardline, ifBreak, indent, join, line, softline } = builders;\n\nexport function onlyDefinedKey<\n  T extends Record<string, any>,\n  K extends Key<T> & string\n>(obj: T, options?: K[]) {\n  const keys = definedKeys(obj, options);\n  if (keys.length === 1) {\n    return keys[0];\n  }\n  throw new Error(\n    keys.length > 1\n      ? `More than one defined key found: ${keys}`\n      : \"No defined keys found\"\n  );\n}\n\nexport function definedKeys<\n  T extends Record<string, any>,\n  K extends Key<T> & string\n>(obj: T, options?: K[]) {\n  return (options ?? (Object.keys(obj) as K[])).filter(\n    key => obj[key] !== undefined\n  );\n}\n\nconst indexByModifier = [\n  \"public\",\n  \"protected\",\n  \"private\",\n  \"abstract\",\n  \"default\",\n  \"static\",\n  \"final\",\n  \"transient\",\n  \"volatile\",\n  \"synchronized\",\n  \"native\",\n  \"sealed\",\n  \"non-sealed\",\n  \"strictfp\"\n].reduce((map, name, index) => map.set(name, index), new Map<string, number>());\n\nexport function printWithModifiers<\n  T extends CstNode,\n  P extends IterProperties<T[\"children\"]>\n>(\n  path: AstPath<T>,\n  print: JavaPrintFn,\n  modifierChild: P,\n  contents: Doc,\n  noTypeAnnotations = false\n) {\n  const declarationAnnotations: Doc[] = [];\n  const otherModifiers: string[] = [];\n  const typeAnnotations: Doc[] = [];\n  each(\n    path,\n    modifierPath => {\n      const { children } = modifierPath.node as ModifierNode;\n      const modifier = print(modifierPath);\n      if (children.annotation) {\n        (otherModifiers.length ? typeAnnotations : declarationAnnotations).push(\n          modifier\n        );\n      } else {\n        otherModifiers.push(modifier as string);\n        declarationAnnotations.push(...typeAnnotations);\n        typeAnnotations.length = 0;\n      }\n    },\n    modifierChild\n  );\n  if (noTypeAnnotations) {\n    declarationAnnotations.push(...typeAnnotations);\n    typeAnnotations.length = 0;\n  }\n  otherModifiers.sort(\n    (a, b) => indexByModifier.get(a)! - indexByModifier.get(b)!\n  );\n  return join(hardline, [\n    ...declarationAnnotations,\n    join(\" \", [...otherModifiers, ...typeAnnotations, contents])\n  ]);\n}\n\nexport function hasDeclarationAnnotations(modifiers: ModifierNode[]) {\n  let hasAnnotation = false;\n  let hasNonAnnotation = false;\n  for (const modifier of modifiers) {\n    if (modifier.children.annotation) {\n      hasAnnotation = true;\n    } else if (hasAnnotation) {\n      return true;\n    } else {\n      hasNonAnnotation = true;\n    }\n  }\n  return hasAnnotation && !hasNonAnnotation;\n}\n\nexport function call<\n  T extends CstNode,\n  U,\n  P extends IterProperties<T[\"children\"]>\n>(\n  path: AstPath<T>,\n  callback: MapCallback<IndexValue<IndexValue<T, \"children\">, P>, U>,\n  child: P\n) {\n  return path.map(callback, \"children\", child)[0];\n}\n\nexport function each<\n  T extends CstNode,\n  P extends IterProperties<T[\"children\"]>\n>(\n  path: AstPath<T>,\n  callback: MapCallback<IndexValue<IndexValue<T, \"children\">, P>, void>,\n  child: P\n) {\n  if (path.node.children[child]) {\n    path.each(callback, \"children\", child);\n  }\n}\n\nexport function map<\n  T extends CstNode,\n  U,\n  P extends IterProperties<T[\"children\"]>\n>(\n  path: AstPath<T>,\n  callback: MapCallback<IndexValue<IndexValue<T, \"children\">, P>, U>,\n  child: P\n) {\n  return path.node.children[child] ? path.map(callback, \"children\", child) : [];\n}\n\nexport function flatMap<\n  T extends CstNode,\n  U,\n  P extends IterProperties<T[\"children\"]>\n>(\n  path: AstPath<T>,\n  callback: MapCallback<IndexValue<IndexValue<T, \"children\">, P>, U>,\n  children: P[]\n) {\n  return children\n    .flatMap(child =>\n      map(path, callback, child).map((doc, index) => {\n        const node = path.node.children[child][index];\n        return {\n          doc,\n          startOffset: parser.locStart(node)\n        };\n      })\n    )\n    .sort((a, b) => a.startOffset - b.startOffset)\n    .map(({ doc }) => doc);\n}\n\nexport function printSingle(\n  path: AstPath<JavaNonTerminal>,\n  print: JavaPrintFn,\n  _?: JavaParserOptions,\n  args?: unknown\n) {\n  return call(\n    path,\n    childPath => print(childPath, args),\n    onlyDefinedKey(path.node.children)\n  );\n}\n\nexport function lineStartWithComments(node: JavaNonTerminal) {\n  const { comments, location } = node;\n  return comments\n    ? Math.min(location.startLine, comments[0].startLine)\n    : location.startLine;\n}\n\nexport function lineEndWithComments(node: JavaNonTerminal) {\n  const { comments, location } = node;\n  return comments\n    ? Math.max(location.endLine, comments.at(-1)!.endLine)\n    : location.endLine;\n}\n\nexport function printDanglingComments(path: AstPath<JavaNonTerminal>) {\n  if (!path.node.comments) {\n    return [];\n  }\n  const comments: Doc[] = [];\n  path.each(commentPath => {\n    const comment = commentPath.node;\n    if (comment.leading || comment.trailing) {\n      return;\n    }\n    comment.printed = true;\n    comments.push(printComment(comment));\n  }, \"comments\");\n  return join(hardline, comments);\n}\n\nexport function printComment(node: JavaTerminal) {\n  const { image } = node;\n  const lines = image.split(\"\\n\").map(line => line.trim());\n  return lines.length > 1 &&\n    lines[0].startsWith(\"/*\") &&\n    lines.slice(1).every(line => line.startsWith(\"*\")) &&\n    lines.at(-1)!.endsWith(\"*/\")\n    ? join(\n        hardline,\n        lines.map((line, index) => (index === 0 ? line : ` ${line}`))\n      )\n    : image;\n}\n\nexport function hasLeadingComments(node: JavaNode) {\n  return node.comments?.some(({ leading }) => leading) ?? false;\n}\n\nexport function indentInParentheses(\n  contents: Doc,\n  opts?: { shouldBreak?: boolean }\n) {\n  return !Array.isArray(contents) || contents.length\n    ? group([\"(\", indent([softline, contents]), softline, \")\"], opts)\n    : \"()\";\n}\n\nexport function printArrayInitializer<\n  T extends JavaNonTerminal,\n  P extends IterProperties<T[\"children\"]>\n>(path: AstPath<T>, print: JavaPrintFn, options: JavaParserOptions, child: P) {\n  if (!(child && child in path.node.children)) {\n    const danglingComments = printDanglingComments(path);\n    return danglingComments.length\n      ? [\"{\", indent([hardline, ...danglingComments]), hardline, \"}\"]\n      : \"{}\";\n  }\n  const list = [call(path, print, child)];\n  if (options.trailingComma !== \"none\") {\n    list.push(ifBreak(\",\"));\n  }\n  return list.length ? group([\"{\", indent([line, ...list]), line, \"}\"]) : \"{}\";\n}\n\nexport function printBlock(path: AstPath<JavaNonTerminal>, contents: Doc[]) {\n  if (contents.length) {\n    return group([\n      \"{\",\n      indent([hardline, ...join(hardline, contents)]),\n      hardline,\n      \"}\"\n    ]);\n  }\n  const danglingComments = printDanglingComments(path);\n  if (danglingComments.length) {\n    return [\"{\", indent([hardline, ...danglingComments]), hardline, \"}\"];\n  }\n  const parent = path.grandparent;\n  const grandparent = path.getNode(4);\n  const greatGrandparent = path.getNode(6);\n  return (grandparent?.name === \"catches\" &&\n    grandparent.children.catchClause.length === 1 &&\n    (greatGrandparent?.name === \"tryStatement\" ||\n      greatGrandparent?.name === \"tryWithResourcesStatement\") &&\n    !greatGrandparent.children.finally) ||\n    (greatGrandparent &&\n      [\n        \"basicForStatement\",\n        \"doStatement\",\n        \"enhancedForStatement\",\n        \"whileStatement\"\n      ].includes(greatGrandparent.name)) ||\n    [\n      \"annotationInterfaceBody\",\n      \"classBody\",\n      \"constructorBody\",\n      \"enumBody\",\n      \"interfaceBody\",\n      \"moduleDeclaration\",\n      \"recordBody\"\n    ].includes(path.node.name) ||\n    (parent &&\n      [\n        \"instanceInitializer\",\n        \"lambdaBody\",\n        \"methodBody\",\n        \"staticInitializer\",\n        \"synchronizedStatement\"\n      ].includes(parent.name))\n    ? \"{}\"\n    : [\"{\", hardline, \"}\"];\n}\n\nexport function printName(\n  path: AstPath<JavaNonTerminal & { children: { Identifier: IToken[] } }>,\n  print: JavaPrintFn\n) {\n  return join(\".\", map(path, print, \"Identifier\"));\n}\n\nexport function printList<\n  T extends JavaNonTerminal,\n  P extends IterProperties<T[\"children\"]>\n>(path: AstPath<T>, print: JavaPrintFn, child: P) {\n  return join([\",\", line], map(path, print, child));\n}\n\nexport function printClassPermits(\n  path: AstPath<ClassPermitsCstNode | InterfacePermitsCstNode>,\n  print: JavaPrintFn\n) {\n  return group([\"permits\", indent([line, printList(path, print, \"typeName\")])]);\n}\n\nexport function printClassType(\n  path: AstPath<JavaNonTerminal & { children: ClassTypeCtx }>,\n  print: JavaPrintFn\n) {\n  const { children } = path.node;\n  return definedKeys(children, [\"annotation\", \"Identifier\", \"typeArguments\"])\n    .flatMap(child =>\n      children[child]!.map((node, index) => ({\n        child,\n        index,\n        startOffset: parser.locStart(node)\n      }))\n    )\n    .sort((a, b) => a.startOffset - b.startOffset)\n    .flatMap(({ child, index: childIndex }, index, array) => {\n      const node = children[child]![childIndex];\n      const next = array.at(index + 1);\n      const nextNode = next && children[next.child]![next.index];\n      const docs = [path.call(print, \"children\", child, childIndex)];\n      if (nextNode) {\n        if (isNonTerminal(node)) {\n          docs.push(node.name === \"annotation\" ? \" \" : \".\");\n        } else if (isTerminal(nextNode) || nextNode.name === \"annotation\") {\n          docs.push(\".\");\n        }\n      }\n      return docs;\n    });\n}\n\nexport function isBinaryExpression(expression: ExpressionCstNode) {\n  const conditionalExpression =\n    expression.children.conditionalExpression?.[0].children;\n  if (!conditionalExpression) {\n    return false;\n  }\n  const isTernary = conditionalExpression.QuestionMark !== undefined;\n  if (isTernary) {\n    return false;\n  }\n  return hasNonAssignmentOperators(conditionalExpression.binaryExpression[0]);\n}\n\nexport function hasAssignmentOperators(\n  binaryExpression: BinaryExpressionCstNode\n) {\n  return binaryExpression.children.AssignmentOperator !== undefined;\n}\n\nexport function hasNonAssignmentOperators(\n  binaryExpression: BinaryExpressionCstNode\n) {\n  return Object.keys(binaryExpression.children).some(name =>\n    [\"BinaryOperator\", \"Instanceof\", \"shiftOperator\"].includes(name)\n  );\n}\n\nexport function findBaseIndent(lines: string[]) {\n  return lines.length\n    ? Math.min(\n        ...lines.map(line => line.search(/\\S/)).filter(indent => indent >= 0)\n      )\n    : 0;\n}\n\nexport function isEmptyStatement(statement: StatementCstNode) {\n  return (\n    statement.children.statementWithoutTrailingSubstatement?.[0].children\n      .emptyStatement !== undefined\n  );\n}\n\nexport function isNonTerminal(node: CstElement): node is JavaNonTerminal {\n  return !isTerminal(node);\n}\n\nexport function isTerminal(node: CstElement): node is IToken {\n  return \"tokenType\" in node;\n}\n\nexport type JavaNode = CstElement & { comments?: JavaComment[] };\nexport type JavaNonTerminal = Exclude<JavaNode, IToken>;\nexport type JavaTerminal = Exclude<JavaNode, CstNode>;\nexport type JavaNodePrinters = {\n  [T in JavaNonTerminal[\"name\"]]: JavaNodePrinter<T>;\n};\nexport type JavaNodePrinter<T> = (\n  path: AstPath<Extract<JavaNonTerminal, { name: T }>>,\n  print: JavaPrintFn,\n  options: JavaParserOptions,\n  args?: unknown\n) => Doc;\nexport type JavaPrintFn = (path: AstPath<JavaNode>, args?: unknown) => Doc;\nexport type JavaParserOptions = ParserOptions<JavaNode> & {\n  entrypoint?: string;\n};\nexport type IterProperties<T> = T extends any[]\n  ? IndexProperties<T>\n  : ArrayProperties<T>;\n\ntype Key<T> = T extends T ? keyof T : never;\ntype ModifierNode = JavaNonTerminal & {\n  children: { annotation?: AnnotationCstNode[] };\n};\ntype IsTuple<T> = T extends []\n  ? true\n  : T extends [infer First, ...infer Remain]\n    ? IsTuple<Remain>\n    : false;\ntype IndexProperties<T extends { length: number }> =\n  IsTuple<T> extends true ? Exclude<Partial<T>[\"length\"], T[\"length\"]> : number;\ntype ArrayProperties<T> = {\n  [K in keyof T]: NonNullable<T[K]> extends readonly any[] ? K : never;\n}[keyof T];\ntype ArrayElement<T> = T extends Array<infer E> ? E : never;\ntype MapCallback<T, U> = (\n  path: AstPath<ArrayElement<T>>,\n  index: number,\n  value: any\n) => U;\ntype IndexValue<T, P> = T extends any[]\n  ? P extends number\n    ? T[P]\n    : never\n  : P extends keyof T\n    ? T[P]\n    : never;\n","import type { IToken } from \"java-parser\";\nimport { util, type AstPath } from \"prettier\";\nimport parser from \"./parser.js\";\nimport {\n  isEmptyStatement,\n  isNonTerminal,\n  isTerminal,\n  type JavaNode,\n  type JavaNonTerminal,\n  type JavaParserOptions\n} from \"./printers/helpers.js\";\n\nconst prettierIgnoreRangesByCst = new WeakMap<\n  JavaNode,\n  PrettierIgnoreRange[]\n>();\n\nexport function determinePrettierIgnoreRanges(cst: JavaNonTerminal) {\n  const { comments } = cst;\n  if (!comments) {\n    return;\n  }\n  const ranges = comments\n    .filter(({ image }) =>\n      /^\\/(?:\\/\\s*(?:prettier-ignore-(?:start|end)|@formatter:(?:off|on))\\s*|\\*\\s*(?:prettier-ignore-(?:start|end)|@formatter:(?:off|on))\\s*\\*\\/)$/.test(\n        image\n      )\n    )\n    .reduce((ranges, { image, startOffset }) => {\n      const previous = ranges.at(-1);\n      if (image.includes(\"start\") || image.includes(\"off\")) {\n        if (previous?.end !== Infinity) {\n          ranges.push({ start: startOffset, end: Infinity });\n        }\n      } else if (previous?.end === Infinity) {\n        previous.end = startOffset;\n      }\n      return ranges;\n    }, new Array<PrettierIgnoreRange>());\n  prettierIgnoreRangesByCst.set(cst, ranges);\n}\n\nexport function isFullyBetweenPrettierIgnore(path: AstPath<JavaNode>) {\n  const { node, root } = path;\n  const start = parser.locStart(node);\n  const end = parser.locEnd(node);\n  return (\n    prettierIgnoreRangesByCst\n      .get(root)\n      ?.some(range => range.start < start && end < range.end) === true\n  );\n}\n\nexport function canAttachComment(node: JavaNode) {\n  if (isTerminal(node)) {\n    const { name, CATEGORIES } = node.tokenType;\n    return (\n      name === \"Identifier\" ||\n      CATEGORIES?.find(({ name }) => name === \"BinaryOperator\") !== undefined\n    );\n  }\n  const { children, name } = node;\n  switch (name) {\n    case \"argumentList\":\n    case \"blockStatements\":\n    case \"emptyStatement\":\n    case \"enumBodyDeclarations\":\n      return false;\n    case \"annotationInterfaceMemberDeclaration\":\n    case \"classMemberDeclaration\":\n    case \"interfaceMemberDeclaration\":\n    case \"methodBody\":\n      return !children.Semicolon;\n    case \"blockStatement\":\n      return !children.statement || !isEmptyStatement(children.statement[0]);\n    case \"classBodyDeclaration\":\n      return !children.classMemberDeclaration?.[0].children.Semicolon;\n    case \"recordBodyDeclaration\":\n      return !children.classBodyDeclaration?.[0].children\n        .classMemberDeclaration?.[0].children.Semicolon;\n    case \"statement\":\n      return !isEmptyStatement(node);\n    case \"statementWithoutTrailingSubstatement\":\n      return !children.emptyStatement;\n    default:\n      return true;\n  }\n}\n\nexport function handleLineComment(\n  commentNode: JavaComment,\n  _: string,\n  options: JavaParserOptions\n) {\n  return [\n    handleBinaryExpressionComments,\n    handleConditionalExpressionComments,\n    handleFqnOrRefTypeComments,\n    handleIfStatementComments,\n    handleJumpStatementComments,\n    handleLabeledStatementComments,\n    handleNameComments,\n    handleTryStatementComments\n  ].some(fn => fn(commentNode, options));\n}\n\nexport function handleRemainingComment(commentNode: JavaComment) {\n  return [\n    handleFqnOrRefTypeComments,\n    handleMethodDeclaratorComments,\n    handleNameComments,\n    handleJumpStatementComments\n  ].some(fn => fn(commentNode));\n}\n\nfunction handleBinaryExpressionComments(\n  commentNode: JavaComment,\n  options: JavaParserOptions\n) {\n  const { enclosingNode, precedingNode, followingNode } = commentNode;\n  if (enclosingNode?.name === \"binaryExpression\") {\n    if (isBinaryOperator(followingNode)) {\n      if (options.experimentalOperatorPosition === \"start\") {\n        util.addLeadingComment(followingNode, commentNode);\n      } else {\n        util.addTrailingComment(followingNode, commentNode);\n      }\n      return true;\n    } else if (\n      options.experimentalOperatorPosition === \"start\" &&\n      isBinaryOperator(precedingNode)\n    ) {\n      util.addLeadingComment(precedingNode, commentNode);\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction handleConditionalExpressionComments(commentNode: JavaComment) {\n  const { startLine, endLine, enclosingNode, precedingNode, followingNode } =\n    commentNode;\n  if (\n    enclosingNode?.name === \"conditionalExpression\" &&\n    precedingNode &&\n    followingNode &&\n    isNonTerminal(precedingNode) &&\n    isNonTerminal(followingNode) &&\n    precedingNode.location.endLine < startLine &&\n    endLine < followingNode.location.startLine\n  ) {\n    util.addLeadingComment(followingNode, commentNode);\n    return true;\n  }\n  return false;\n}\n\nfunction handleFqnOrRefTypeComments(commentNode: JavaComment) {\n  const { enclosingNode, followingNode } = commentNode;\n  if (enclosingNode?.name === \"fqnOrRefType\" && followingNode) {\n    util.addLeadingComment(followingNode, commentNode);\n    return true;\n  }\n  return false;\n}\n\nfunction handleIfStatementComments(commentNode: JavaComment) {\n  const { enclosingNode, precedingNode } = commentNode;\n  if (\n    enclosingNode?.name === \"ifStatement\" &&\n    precedingNode &&\n    isNonTerminal(precedingNode) &&\n    precedingNode.name === \"statement\"\n  ) {\n    util.addDanglingComment(enclosingNode, commentNode, undefined);\n    return true;\n  }\n  return false;\n}\n\nfunction handleJumpStatementComments(commentNode: JavaComment) {\n  const { enclosingNode, precedingNode, followingNode } = commentNode;\n  if (\n    enclosingNode &&\n    !precedingNode &&\n    !followingNode &&\n    [\"breakStatement\", \"continueStatement\", \"returnStatement\"].includes(\n      enclosingNode.name\n    )\n  ) {\n    util.addTrailingComment(enclosingNode, commentNode);\n    return true;\n  }\n  return false;\n}\n\nfunction handleLabeledStatementComments(commentNode: JavaComment) {\n  const { enclosingNode, precedingNode } = commentNode;\n  if (\n    enclosingNode?.name === \"labeledStatement\" &&\n    precedingNode &&\n    isTerminal(precedingNode) &&\n    precedingNode.tokenType.name === \"Identifier\"\n  ) {\n    util.addLeadingComment(precedingNode, commentNode);\n    return true;\n  }\n  return false;\n}\n\nfunction handleMethodDeclaratorComments(commentNode: JavaComment) {\n  const { enclosingNode } = commentNode;\n  if (\n    enclosingNode?.name === \"methodDeclarator\" &&\n    !enclosingNode.children.receiverParameter &&\n    !enclosingNode.children.formalParameterList &&\n    enclosingNode.children.LBrace[0].startOffset < commentNode.startOffset &&\n    commentNode.startOffset < enclosingNode.children.RBrace[0].startOffset\n  ) {\n    util.addDanglingComment(enclosingNode, commentNode, undefined);\n    return true;\n  }\n  return false;\n}\n\nfunction handleNameComments(commentNode: JavaComment) {\n  const { enclosingNode, precedingNode } = commentNode;\n  if (\n    enclosingNode &&\n    precedingNode &&\n    isTerminal(precedingNode) &&\n    precedingNode.tokenType.name === \"Identifier\" &&\n    [\n      \"ambiguousName\",\n      \"classOrInterfaceTypeToInstantiate\",\n      \"expressionName\",\n      \"moduleDeclaration\",\n      \"moduleName\",\n      \"packageDeclaration\",\n      \"packageName\",\n      \"packageOrTypeName\",\n      \"typeName\"\n    ].includes(enclosingNode.name)\n  ) {\n    util.addTrailingComment(precedingNode, commentNode);\n    return true;\n  }\n  return false;\n}\n\nfunction handleTryStatementComments(commentNode: JavaComment) {\n  const { enclosingNode, followingNode } = commentNode;\n  if (\n    enclosingNode &&\n    [\"catches\", \"tryStatement\"].includes(enclosingNode.name) &&\n    followingNode &&\n    isNonTerminal(followingNode)\n  ) {\n    const block = (\n      followingNode.name === \"catches\"\n        ? followingNode.children.catchClause[0]\n        : followingNode.name === \"catchClause\" ||\n            followingNode.name === \"finally\"\n          ? followingNode\n          : null\n    )?.children.block[0];\n    if (!block) {\n      return false;\n    }\n    const blockStatement =\n      block.children.blockStatements?.[0].children.blockStatement[0];\n    if (blockStatement) {\n      util.addLeadingComment(blockStatement, commentNode);\n    } else {\n      util.addDanglingComment(block, commentNode, undefined);\n    }\n    return true;\n  }\n  return false;\n}\n\nfunction isBinaryOperator(node?: JavaNode) {\n  return (\n    node !== undefined &&\n    (isNonTerminal(node)\n      ? node.name === \"shiftOperator\"\n      : node.tokenType.CATEGORIES?.some(\n          ({ name }) => name === \"BinaryOperator\"\n        ))\n  );\n}\n\nexport type JavaComment = IToken & {\n  value: string;\n  leading: boolean;\n  trailing: boolean;\n  printed: boolean;\n  enclosingNode?: JavaNonTerminal;\n  precedingNode?: JavaNode;\n  followingNode?: JavaNode;\n};\n\ntype PrettierIgnoreRange = {\n  start: number;\n  end: number;\n};\n","import { parse } from \"java-parser\";\nimport type { Parser } from \"prettier\";\nimport { determinePrettierIgnoreRanges } from \"./comments.js\";\nimport {\n  isTerminal,\n  type JavaNode,\n  type JavaNonTerminal,\n  type JavaParserOptions\n} from \"./printers/helpers.js\";\n\nexport default {\n  parse(text, options: JavaParserOptions) {\n    const cst = parse(text, options.entrypoint) as JavaNonTerminal;\n    cst.comments?.forEach(comment => {\n      comment.value = comment.image;\n    });\n    determinePrettierIgnoreRanges(cst);\n    return cst;\n  },\n  astFormat: \"java\",\n  hasPragma(text) {\n    return /^\\/\\*\\*\\n\\s+\\*\\s@(format|prettier)\\n\\s+\\*\\//.test(text);\n  },\n  locStart(node) {\n    return isTerminal(node) ? node.startOffset : node.location.startOffset;\n  },\n  locEnd(node) {\n    return (isTerminal(node) ? node.endOffset : node.location.endOffset) + 1;\n  }\n} satisfies Parser<JavaNode>;\n","import {\n  printArrayInitializer,\n  printList,\n  type JavaNodePrinters\n} from \"./helpers.js\";\n\nexport default {\n  arrayInitializer(path, print, options) {\n    return printArrayInitializer(\n      path,\n      print,\n      options,\n      \"variableInitializerList\"\n    );\n  },\n\n  variableInitializerList(path, print) {\n    return printList(path, print, \"variableInitializer\");\n  }\n} satisfies Partial<JavaNodePrinters>;\n","import type { Doc } from \"prettier\";\nimport { builders } from \"prettier/doc\";\nimport {\n  call,\n  definedKeys,\n  hasLeadingComments,\n  indentInParentheses,\n  isBinaryExpression,\n  isEmptyStatement,\n  lineEndWithComments,\n  lineStartWithComments,\n  map,\n  onlyDefinedKey,\n  printBlock,\n  printDanglingComments,\n  printSingle,\n  printWithModifiers,\n  type JavaNodePrinters\n} from \"./helpers.js\";\n\nconst { group, hardline, ifBreak, indent, join, line, softline } = builders;\n\nexport default {\n  block(path, print) {\n    const statements = path.node.children.blockStatements\n      ? (call(path, print, \"blockStatements\") as Doc[])\n      : [];\n    return printBlock(path, statements.length ? [statements] : []);\n  },\n\n  blockStatements(path, print) {\n    return join(\n      hardline,\n      map(\n        path,\n        statementPath => {\n          const { node, previous } = statementPath;\n          const statement = print(statementPath);\n          return previous &&\n            lineStartWithComments(node) > lineEndWithComments(previous) + 1\n            ? [hardline, statement]\n            : statement;\n        },\n        \"blockStatement\"\n      ).filter(doc => doc !== \"\")\n    );\n  },\n\n  blockStatement: printSingle,\n\n  localVariableDeclarationStatement(path, print) {\n    return [call(path, print, \"localVariableDeclaration\"), \";\"];\n  },\n\n  localVariableDeclaration(path, print) {\n    const declaration = join(\" \", [\n      call(path, print, \"localVariableType\"),\n      call(path, print, \"variableDeclaratorList\")\n    ]);\n    return printWithModifiers(path, print, \"variableModifier\", declaration);\n  },\n\n  localVariableType: printSingle,\n  statement: printSingle,\n  statementWithoutTrailingSubstatement: printSingle,\n\n  emptyStatement() {\n    return \"\";\n  },\n\n  labeledStatement(path, print) {\n    return [\n      call(path, print, \"Identifier\"),\n      \": \",\n      call(path, print, \"statement\")\n    ];\n  },\n\n  expressionStatement(path, print) {\n    return [call(path, print, \"statementExpression\"), \";\"];\n  },\n\n  statementExpression: printSingle,\n\n  ifStatement(path, print) {\n    const { children } = path.node;\n    const hasEmptyStatement = isEmptyStatement(children.statement[0]);\n    const statements = map(path, print, \"statement\");\n    const statement: Doc[] = [\n      \"if \",\n      indentInParentheses(call(path, print, \"expression\")),\n      hasEmptyStatement ? \";\" : [\" \", statements[0]]\n    ];\n    if (children.Else) {\n      const danglingComments = printDanglingComments(path);\n      if (danglingComments.length) {\n        statement.push(hardline, ...danglingComments, hardline);\n      } else {\n        const elseHasBlock =\n          children.statement[0].children\n            .statementWithoutTrailingSubstatement?.[0].children.block !==\n          undefined;\n        statement.push(elseHasBlock ? \" \" : hardline);\n      }\n      const elseHasEmptyStatement = isEmptyStatement(children.statement[1]);\n      statement.push(\n        \"else\",\n        elseHasEmptyStatement ? \";\" : [\" \", statements[1]]\n      );\n    }\n    return statement;\n  },\n\n  assertStatement(path, print) {\n    return [\"assert \", ...join([\" : \"], map(path, print, \"expression\")), \";\"];\n  },\n\n  switchStatement(path, print) {\n    return join(\" \", [\n      \"switch\",\n      indentInParentheses(call(path, print, \"expression\")),\n      call(path, print, \"switchBlock\")\n    ]);\n  },\n\n  switchBlock(path, print) {\n    const { children } = path.node;\n    const caseKeys = definedKeys(children, [\n      \"switchBlockStatementGroup\",\n      \"switchRule\"\n    ]);\n    const cases = caseKeys.length === 1 ? map(path, print, caseKeys[0]) : [];\n    return printBlock(path, cases);\n  },\n\n  switchBlockStatementGroup(path, print) {\n    const { children } = path.node;\n    const switchLabel = call(path, print, \"switchLabel\");\n    if (!children.blockStatements) {\n      return [switchLabel, \":\"];\n    }\n    const blockStatements = call(path, print, \"blockStatements\");\n    const statements = children.blockStatements[0].children.blockStatement;\n    const onlyStatementIsBlock =\n      statements.length === 1 &&\n      statements[0].children.statement?.[0].children\n        .statementWithoutTrailingSubstatement?.[0].children.block !== undefined;\n    return [\n      switchLabel,\n      \":\",\n      onlyStatementIsBlock\n        ? [\" \", blockStatements]\n        : indent([hardline, blockStatements])\n    ];\n  },\n\n  switchLabel(path, print) {\n    const { children } = path.node;\n    if (!(children.caseConstant ?? children.casePattern ?? children.Null)) {\n      return \"default\";\n    }\n    const values: Doc[] = [];\n    if (children.Null) {\n      values.push(\"null\");\n      if (children.Default) {\n        values.push(\"default\");\n      }\n    } else {\n      const valuesKey = onlyDefinedKey(children, [\n        \"caseConstant\",\n        \"casePattern\"\n      ]);\n      values.push(...map(path, print, valuesKey));\n    }\n    const hasMultipleValues = values.length > 1;\n    const label = hasMultipleValues\n      ? [\"case\", indent([line, ...join([\",\", line], values)])]\n      : [\"case \", values[0]];\n    return children.guard\n      ? [\n          group([...label, hasMultipleValues ? line : \" \"]),\n          call(path, print, \"guard\")\n        ]\n      : group(label);\n  },\n\n  switchRule(path, print) {\n    const { children } = path.node;\n    const bodyKey = onlyDefinedKey(children, [\n      \"block\",\n      \"expression\",\n      \"throwStatement\"\n    ]);\n    const body = call(path, print, bodyKey);\n    const parts = [call(path, print, \"switchLabel\"), \" ->\"];\n    if (bodyKey !== \"block\" && hasLeadingComments(children[bodyKey]![0])) {\n      parts.push(indent([hardline, body]));\n    } else {\n      parts.push(\" \", body);\n    }\n    if (children.Semicolon) {\n      parts.push(\";\");\n    }\n    return parts;\n  },\n\n  caseConstant: printSingle,\n  casePattern: printSingle,\n\n  whileStatement(path, print) {\n    const statement = call(path, print, \"statement\");\n    const hasEmptyStatement = isEmptyStatement(path.node.children.statement[0]);\n    return [\n      \"while \",\n      indentInParentheses(call(path, print, \"expression\")),\n      ...[hasEmptyStatement ? \";\" : \" \", statement]\n    ];\n  },\n\n  doStatement(path, print) {\n    const hasEmptyStatement = isEmptyStatement(path.node.children.statement[0]);\n    return [\n      \"do\",\n      hasEmptyStatement ? \";\" : [\" \", call(path, print, \"statement\")],\n      \" while \",\n      indentInParentheses(call(path, print, \"expression\")),\n      \";\"\n    ];\n  },\n\n  forStatement: printSingle,\n\n  basicForStatement(path, print) {\n    const { children } = path.node;\n    const danglingComments = printDanglingComments(path);\n    if (danglingComments.length) {\n      danglingComments.push(hardline);\n    }\n    const expressions = ([\"forInit\", \"expression\", \"forUpdate\"] as const).map(\n      expressionKey =>\n        expressionKey in children ? call(path, print, expressionKey) : \"\"\n    );\n    const hasEmptyStatement = isEmptyStatement(children.statement[0]);\n    return [\n      ...danglingComments,\n      \"for \",\n      expressions.some(expression => expression !== \"\")\n        ? indentInParentheses(join([\";\", line], expressions))\n        : \"(;;)\",\n      hasEmptyStatement ? \";\" : [\" \", call(path, print, \"statement\")]\n    ];\n  },\n\n  forInit: printSingle,\n  forUpdate: printSingle,\n\n  statementExpressionList(path, print) {\n    return group(\n      map(path, print, \"statementExpression\").map((expression, index) =>\n        index === 0 ? expression : [\",\", indent([line, expression])]\n      )\n    );\n  },\n\n  enhancedForStatement(path, print) {\n    const statementNode = path.node.children.statement[0];\n    const forStatement = [\n      printDanglingComments(path),\n      \"for \",\n      \"(\",\n      call(path, print, \"localVariableDeclaration\"),\n      \" : \",\n      call(path, print, \"expression\"),\n      \")\"\n    ];\n    if (isEmptyStatement(statementNode)) {\n      forStatement.push(\";\");\n    } else {\n      const hasStatementBlock =\n        statementNode.children.statementWithoutTrailingSubstatement?.[0]\n          .children.block !== undefined;\n      const statement = call(path, print, \"statement\");\n      forStatement.push(\n        hasStatementBlock ? [\" \", statement] : indent([line, statement])\n      );\n    }\n    return group(forStatement);\n  },\n\n  breakStatement(path, print) {\n    return path.node.children.Identifier\n      ? [\"break \", call(path, print, \"Identifier\"), \";\"]\n      : \"break;\";\n  },\n\n  continueStatement(path, print) {\n    return path.node.children.Identifier\n      ? [\"continue \", call(path, print, \"Identifier\"), \";\"]\n      : \"continue;\";\n  },\n\n  returnStatement(path, print) {\n    const { children } = path.node;\n    const statement: Doc[] = [\"return\"];\n    if (children.expression) {\n      statement.push(\" \");\n      const expression = call(path, print, \"expression\");\n      if (isBinaryExpression(children.expression[0])) {\n        statement.push(\n          group([\n            ifBreak(\"(\"),\n            indent([softline, expression]),\n            softline,\n            ifBreak(\")\")\n          ])\n        );\n      } else {\n        statement.push(expression);\n      }\n    }\n    statement.push(\";\");\n    return statement;\n  },\n\n  throwStatement(path, print) {\n    return [\"throw \", call(path, print, \"expression\"), \";\"];\n  },\n\n  synchronizedStatement(path, print) {\n    return [\n      \"synchronized \",\n      indentInParentheses(call(path, print, \"expression\")),\n      \" \",\n      call(path, print, \"block\")\n    ];\n  },\n\n  tryStatement(path, print) {\n    const { children } = path.node;\n    if (children.tryWithResourcesStatement) {\n      return call(path, print, \"tryWithResourcesStatement\");\n    }\n    const blocks = [\"try\", call(path, print, \"block\")];\n    if (children.catches) {\n      blocks.push(call(path, print, \"catches\"));\n    }\n    if (children.finally) {\n      blocks.push(call(path, print, \"finally\"));\n    }\n    return join(\" \", blocks);\n  },\n\n  catches(path, print) {\n    return join(\" \", map(path, print, \"catchClause\"));\n  },\n\n  catchClause(path, print) {\n    return [\n      \"catch \",\n      indentInParentheses(call(path, print, \"catchFormalParameter\")),\n      \" \",\n      call(path, print, \"block\")\n    ];\n  },\n\n  catchFormalParameter(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"variableModifier\"),\n      call(path, print, \"catchType\"),\n      call(path, print, \"variableDeclaratorId\")\n    ]);\n  },\n\n  catchType(path, print) {\n    return join(\n      [line, \"| \"],\n      [call(path, print, \"unannClassType\"), ...map(path, print, \"classType\")]\n    );\n  },\n\n  finally(path, print) {\n    return [\"finally \", call(path, print, \"block\")];\n  },\n\n  tryWithResourcesStatement(path, print) {\n    const { children } = path.node;\n    const blocks = [\n      \"try\",\n      call(path, print, \"resourceSpecification\"),\n      call(path, print, \"block\")\n    ];\n    if (children.catches) {\n      blocks.push(call(path, print, \"catches\"));\n    }\n    if (children.finally) {\n      blocks.push(call(path, print, \"finally\"));\n    }\n    return join(\" \", blocks);\n  },\n\n  resourceSpecification(path, print) {\n    const resources = [call(path, print, \"resourceList\")];\n    if (path.node.children.Semicolon) {\n      resources.push(ifBreak(\";\"));\n    }\n    return indentInParentheses(resources);\n  },\n\n  resourceList(path, print) {\n    return join([\";\", line], map(path, print, \"resource\"));\n  },\n\n  resource: printSingle,\n\n  yieldStatement(path, print) {\n    return [\"yield \", call(path, print, \"expression\"), \";\"];\n  },\n\n  variableAccess: printSingle\n} satisfies Partial<JavaNodePrinters>;\n","import type {\n  ClassBodyCstNode,\n  EnumBodyDeclarationsCstNode\n} from \"java-parser\";\nimport type { AstPath, Doc } from \"prettier\";\nimport { builders } from \"prettier/doc\";\nimport {\n  call,\n  definedKeys,\n  each,\n  hasDeclarationAnnotations,\n  hasLeadingComments,\n  hasNonAssignmentOperators,\n  indentInParentheses,\n  lineEndWithComments,\n  lineStartWithComments,\n  map,\n  onlyDefinedKey,\n  printBlock,\n  printClassPermits,\n  printClassType,\n  printDanglingComments,\n  printList,\n  printSingle,\n  printWithModifiers,\n  type JavaNodePrinters,\n  type JavaNonTerminal,\n  type JavaPrintFn\n} from \"./helpers.js\";\n\nconst { group, hardline, indent, indentIfBreak, join, line, softline } =\n  builders;\n\nexport default {\n  classDeclaration(path, print) {\n    const declarationKey = onlyDefinedKey(path.node.children, [\n      \"enumDeclaration\",\n      \"normalClassDeclaration\",\n      \"recordDeclaration\"\n    ]);\n    const declaration = call(path, print, declarationKey);\n    return printWithModifiers(path, print, \"classModifier\", declaration, true);\n  },\n\n  normalClassDeclaration(path, print) {\n    const { children } = path.node;\n    const definedClauses = definedKeys(children, [\n      \"classExtends\",\n      \"classImplements\",\n      \"classPermits\"\n    ]);\n    const hasMultipleClauses = definedClauses.length > 1;\n    const hasTypeParameters = children.typeParameters !== undefined;\n    const parts = [\"class \", call(path, print, \"typeIdentifier\")];\n    if (hasTypeParameters) {\n      const typeParameters = call(path, print, \"typeParameters\");\n      parts.push(\n        hasMultipleClauses ? group(indent(typeParameters)) : typeParameters\n      );\n    }\n    if (definedClauses.length) {\n      const separator = hasTypeParameters && !hasMultipleClauses ? \" \" : line;\n      const clauses = definedClauses.flatMap(clause => [\n        separator,\n        call(path, print, clause)\n      ]);\n      const hasBody =\n        children.classBody[0].children.classBodyDeclaration !== undefined;\n      const clauseGroup = [\n        hasTypeParameters && !hasMultipleClauses ? clauses : indent(clauses),\n        hasBody ? separator : \" \"\n      ];\n      parts.push(hasMultipleClauses ? clauseGroup : group(clauseGroup));\n    } else {\n      parts.push(\" \");\n    }\n    return [group(parts), call(path, print, \"classBody\")];\n  },\n\n  classModifier: printSingle,\n\n  typeParameters(path, print) {\n    return [\n      \"<\",\n      indent([softline, call(path, print, \"typeParameterList\")]),\n      softline,\n      \">\"\n    ];\n  },\n\n  typeParameterList(path, print) {\n    return printList(path, print, \"typeParameter\");\n  },\n\n  classExtends(path, print) {\n    return [\"extends \", call(path, print, \"classType\")];\n  },\n\n  classImplements(path, print) {\n    return group([\n      \"implements\",\n      indent([line, call(path, print, \"interfaceTypeList\")])\n    ]);\n  },\n\n  classPermits: printClassPermits,\n\n  interfaceTypeList(path, print) {\n    return printList(path, print, \"interfaceType\");\n  },\n\n  classBody(path, print) {\n    return printBlock(path, printClassBodyDeclarations(path, print));\n  },\n\n  classBodyDeclaration: printSingle,\n\n  classMemberDeclaration(path, print) {\n    const { children } = path.node;\n    return children.Semicolon\n      ? \"\"\n      : call(path, print, onlyDefinedKey(children));\n  },\n\n  fieldDeclaration(path, print) {\n    const declaration = [\n      call(path, print, \"unannType\"),\n      \" \",\n      call(path, print, \"variableDeclaratorList\"),\n      \";\"\n    ];\n    return printWithModifiers(path, print, \"fieldModifier\", declaration);\n  },\n\n  fieldModifier: printSingle,\n\n  variableDeclaratorList(path, print) {\n    const declarators = map(path, print, \"variableDeclarator\");\n    return declarators.length > 1 &&\n      path.node.children.variableDeclarator.some(\n        ({ children }) => children.Equals\n      )\n      ? group(indent(join([\",\", line], declarators)), {\n          shouldBreak:\n            (path.getNode(4) as JavaNonTerminal | null)?.name !== \"forInit\"\n        })\n      : join(\", \", declarators);\n  },\n\n  variableDeclarator(path, print) {\n    const { children } = path.node;\n    const variableInitializer = children.variableInitializer?.[0];\n    const declaratorId = call(path, print, \"variableDeclaratorId\");\n    if (!variableInitializer) {\n      return declaratorId;\n    }\n    const binaryExpression =\n      variableInitializer.children.expression?.[0].children\n        .conditionalExpression?.[0].children.binaryExpression[0];\n    const declarator = [declaratorId, \" \", call(path, print, \"Equals\")];\n    const initializer = call(path, print, \"variableInitializer\");\n    if (\n      hasLeadingComments(variableInitializer) ||\n      (binaryExpression && hasNonAssignmentOperators(binaryExpression))\n    ) {\n      declarator.push(group(indent([line, initializer])));\n    } else {\n      const groupId = Symbol(\"assignment\");\n      declarator.push(\n        group(indent(line), { id: groupId }),\n        indentIfBreak(initializer, { groupId })\n      );\n    }\n    return group(declarator);\n  },\n\n  variableDeclaratorId(path, print) {\n    const { dims, Underscore } = path.node.children;\n    if (Underscore) {\n      return \"_\";\n    }\n    const identifier = call(path, print, \"Identifier\");\n    return dims ? [identifier, call(path, print, \"dims\")] : identifier;\n  },\n\n  variableInitializer: printSingle,\n  unannType: printSingle,\n\n  unannPrimitiveTypeWithOptionalDimsSuffix(path, print) {\n    const type = call(path, print, \"unannPrimitiveType\");\n    return path.node.children.dims ? [type, call(path, print, \"dims\")] : type;\n  },\n\n  unannPrimitiveType: printSingle,\n\n  unannReferenceType(path, print) {\n    const type = call(path, print, \"unannClassOrInterfaceType\");\n    return path.node.children.dims ? [type, call(path, print, \"dims\")] : type;\n  },\n\n  unannClassOrInterfaceType: printSingle,\n  unannClassType: printClassType,\n  unannInterfaceType: printSingle,\n  unannTypeVariable: printSingle,\n\n  methodDeclaration(path, print) {\n    const declaration = [\n      call(path, print, \"methodHeader\"),\n      path.node.children.methodBody[0].children.Semicolon ? \"\" : \" \",\n      call(path, print, \"methodBody\")\n    ];\n    return printWithModifiers(path, print, \"methodModifier\", declaration);\n  },\n\n  methodModifier: printSingle,\n\n  methodHeader(path, print) {\n    const { typeParameters, annotation, throws } = path.node.children;\n    const header: Doc[] = [];\n    if (typeParameters) {\n      header.push(group(call(path, print, \"typeParameters\")));\n    }\n    if (annotation) {\n      header.push(join(line, map(path, print, \"annotation\")));\n    }\n    header.push(\n      call(path, print, \"result\"),\n      call(path, print, \"methodDeclarator\")\n    );\n    return throws\n      ? group([\n          ...join(\" \", header),\n          group(indent([line, call(path, print, \"throws\")]))\n        ])\n      : group(join(\" \", header));\n  },\n\n  result: printSingle,\n\n  methodDeclarator(path, print) {\n    const { dims, formalParameterList, receiverParameter } = path.node.children;\n    const declarator = [call(path, print, \"Identifier\")];\n    const parameters: Doc[] = [];\n    if (receiverParameter) {\n      parameters.push(call(path, print, \"receiverParameter\"));\n    }\n    if (formalParameterList) {\n      parameters.push(call(path, print, \"formalParameterList\"));\n    }\n    const items = parameters.length\n      ? join([\",\", line], parameters)\n      : printDanglingComments(path);\n    declarator.push(items.length ? indentInParentheses(items) : \"()\");\n    if (dims) {\n      declarator.push(call(path, print, \"dims\"));\n    }\n    return declarator;\n  },\n\n  receiverParameter(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"annotation\"),\n      call(path, print, \"unannType\"),\n      path.node.children.Identifier\n        ? [call(path, print, \"Identifier\"), \".this\"]\n        : \"this\"\n    ]);\n  },\n\n  formalParameterList(path, print) {\n    return printList(path, print, \"formalParameter\");\n  },\n\n  formalParameter: printSingle,\n\n  variableParaRegularParameter(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"variableModifier\"),\n      call(path, print, \"unannType\"),\n      call(path, print, \"variableDeclaratorId\")\n    ]);\n  },\n\n  variableArityParameter(path, print) {\n    const type = join(\" \", [\n      ...map(path, print, \"variableModifier\"),\n      call(path, print, \"unannType\"),\n      ...map(path, print, \"annotation\")\n    ]);\n    return [type, \"... \", call(path, print, \"Identifier\")];\n  },\n\n  variableModifier: printSingle,\n\n  throws(path, print) {\n    return [\"throws \", call(path, print, \"exceptionTypeList\")];\n  },\n\n  exceptionTypeList(path, print) {\n    return join(\", \", map(path, print, \"exceptionType\"));\n  },\n\n  exceptionType: printSingle,\n  methodBody: printSingle,\n  instanceInitializer: printSingle,\n\n  staticInitializer(path, print) {\n    return [\"static \", call(path, print, \"block\")];\n  },\n\n  constructorDeclaration(path, print) {\n    const declaration = [call(path, print, \"constructorDeclarator\")];\n    if (path.node.children.throws) {\n      declaration.push(group(indent([line, call(path, print, \"throws\")])));\n    }\n    declaration.push(\" \", call(path, print, \"constructorBody\"));\n    return printWithModifiers(\n      path,\n      print,\n      \"constructorModifier\",\n      declaration,\n      true\n    );\n  },\n\n  constructorModifier: printSingle,\n\n  constructorDeclarator(path, print) {\n    const { children } = path.node;\n    const parameters: Doc[] = [];\n    if (children.receiverParameter) {\n      parameters.push(call(path, print, \"receiverParameter\"));\n    }\n    if (children.formalParameterList) {\n      parameters.push(call(path, print, \"formalParameterList\"));\n    }\n    const header = [call(path, print, \"simpleTypeName\")];\n    header.push(\n      parameters.length\n        ? indentInParentheses(join([\",\", line], parameters))\n        : \"()\"\n    );\n    return children.typeParameters\n      ? [group(call(path, print, \"typeParameters\")), \" \", ...header]\n      : header;\n  },\n\n  simpleTypeName: printSingle,\n\n  constructorBody(path, print) {\n    const { children } = path.node;\n    const statements: Doc[] = [];\n    if (children.explicitConstructorInvocation) {\n      statements.push(call(path, print, \"explicitConstructorInvocation\"));\n    }\n    if (children.blockStatements) {\n      statements.push(call(path, print, \"blockStatements\"));\n    }\n    return printBlock(path, statements);\n  },\n\n  explicitConstructorInvocation: printSingle,\n\n  unqualifiedExplicitConstructorInvocation(path, print) {\n    const { children } = path.node;\n    const invocation: Doc[] = [];\n    if (children.typeArguments) {\n      invocation.push(call(path, print, \"typeArguments\"));\n    }\n    invocation.push(children.Super ? \"super\" : \"this\");\n    if (children.argumentList) {\n      invocation.push(group([\"(\", call(path, print, \"argumentList\"), \")\"]));\n    } else {\n      invocation.push(\n        indentInParentheses(printDanglingComments(path), { shouldBreak: true })\n      );\n    }\n    invocation.push(\";\");\n    return invocation;\n  },\n\n  qualifiedExplicitConstructorInvocation(path, print) {\n    const { children } = path.node;\n    const invocation = [call(path, print, \"expressionName\"), \".\"];\n    if (children.typeArguments) {\n      invocation.push(call(path, print, \"typeArguments\"));\n    }\n    invocation.push(\"super\");\n    if (children.argumentList) {\n      invocation.push(group([\"(\", call(path, print, \"argumentList\"), \")\"]));\n    } else {\n      invocation.push(\n        indentInParentheses(printDanglingComments(path), { shouldBreak: true })\n      );\n    }\n    invocation.push(\";\");\n    return invocation;\n  },\n\n  enumDeclaration(path, print) {\n    const { children } = path.node;\n    const parts = [\"enum \", call(path, print, \"typeIdentifier\")];\n    if (children.classImplements) {\n      const body = children.enumBody[0].children;\n      const hasBody =\n        body.enumBodyDeclarations !== undefined ||\n        body.enumConstantList !== undefined;\n      parts.push(\n        indent([line, call(path, print, \"classImplements\")]),\n        hasBody ? line : \" \"\n      );\n    } else {\n      parts.push(\" \");\n    }\n    return [group(parts), call(path, print, \"enumBody\")];\n  },\n\n  enumBody(path, print, options) {\n    const { children } = path.node;\n    const contents: Doc[] = [];\n    const hasNonEmptyDeclaration = (children.enumBodyDeclarations ?? [])\n      .flatMap(({ children }) => children.classBodyDeclaration ?? [])\n      .some(\n        ({ children }) =>\n          !children.classMemberDeclaration?.[0].children.Semicolon\n      );\n    if (children.enumConstantList) {\n      contents.push(call(path, print, \"enumConstantList\"));\n      if (!hasNonEmptyDeclaration && options.trailingComma !== \"none\") {\n        contents.push(\",\");\n      }\n    }\n    if (hasNonEmptyDeclaration) {\n      contents.push(\";\", hardline, call(path, print, \"enumBodyDeclarations\"));\n    }\n    return printBlock(path, contents.length ? [contents] : []);\n  },\n\n  enumConstantList(path, print) {\n    return join(\n      [\",\", hardline],\n      map(\n        path,\n        constantPath => {\n          const constant = print(constantPath);\n          const { node, previous } = constantPath;\n          return !previous ||\n            lineStartWithComments(node) <= lineEndWithComments(previous) + 1\n            ? constant\n            : [hardline, constant];\n        },\n        \"enumConstant\"\n      )\n    );\n  },\n\n  enumConstant(path, print) {\n    const { argumentList, classBody } = path.node.children;\n    const initializer = [call(path, print, \"Identifier\")];\n    if (argumentList) {\n      initializer.push(group([\"(\", call(path, print, \"argumentList\"), \")\"]));\n    }\n    if (classBody) {\n      initializer.push(\" \", call(path, print, \"classBody\"));\n    }\n    return printWithModifiers(path, print, \"enumConstantModifier\", initializer);\n  },\n\n  enumConstantModifier: printSingle,\n\n  enumBodyDeclarations(path, print) {\n    return join(hardline, printClassBodyDeclarations(path, print));\n  },\n\n  recordDeclaration(path, print) {\n    const { children } = path.node;\n    const parts = [\"record \", call(path, print, \"typeIdentifier\")];\n    if (children.typeParameters) {\n      parts.push(group(call(path, print, \"typeParameters\")));\n    }\n    parts.push(call(path, print, \"recordHeader\"));\n    if (children.classImplements) {\n      const hasComponents =\n        children.recordHeader[0].children.recordComponentList !== undefined;\n      const hasBody =\n        children.recordBody[0].children.recordBodyDeclaration !== undefined;\n      const classImplements = [\n        hasComponents ? \" \" : line,\n        call(path, print, \"classImplements\")\n      ];\n      parts.push(\n        group([\n          hasComponents ? classImplements : indent(classImplements),\n          hasBody ? line : \" \"\n        ])\n      );\n    } else {\n      parts.push(\" \");\n    }\n    return [group(parts), call(path, print, \"recordBody\")];\n  },\n\n  recordHeader(path, print) {\n    return path.node.children.recordComponentList\n      ? [\n          \"(\",\n          indent([softline, call(path, print, \"recordComponentList\")]),\n          softline,\n          \")\"\n        ]\n      : indentInParentheses(printDanglingComments(path), { shouldBreak: true });\n  },\n\n  recordComponentList(path, print) {\n    return join(\n      [\",\", line],\n      map(\n        path,\n        componentPath => {\n          const { node, previous } = componentPath;\n          const blankLine =\n            previous &&\n            lineStartWithComments(node) > lineEndWithComments(previous) + 1;\n          const component = print(componentPath);\n          return blankLine ? [softline, component] : component;\n        },\n        \"recordComponent\"\n      )\n    );\n  },\n\n  recordComponent(path, print) {\n    const { children } = path.node;\n    const component = [call(path, print, \"unannType\")];\n    if (\n      children.Identifier ||\n      children.variableArityRecordComponent![0].children.annotation\n    ) {\n      component.push(\" \");\n    }\n    const suffixKey = onlyDefinedKey(children, [\n      \"Identifier\",\n      \"variableArityRecordComponent\"\n    ]);\n    component.push(call(path, print, suffixKey));\n    return group(\n      join(line, [...map(path, print, \"recordComponentModifier\"), component])\n    );\n  },\n\n  variableArityRecordComponent(path, print) {\n    return [\n      ...join(\" \", map(path, print, \"annotation\")),\n      \"... \",\n      call(path, print, \"Identifier\")\n    ];\n  },\n\n  recordComponentModifier: printSingle,\n\n  recordBody(path, print) {\n    const declarations: Doc[] = [];\n    let previousRequiresPadding = false;\n    each(\n      path,\n      declarationPath => {\n        const declaration = print(declarationPath);\n        if (declaration === \"\") {\n          return;\n        }\n        const { node, previous } = declarationPath;\n        const fieldDeclaration =\n          node.children.classBodyDeclaration?.[0].children\n            .classMemberDeclaration?.[0].children.fieldDeclaration?.[0]\n            .children;\n        const currentRequiresPadding =\n          !fieldDeclaration ||\n          hasDeclarationAnnotations(fieldDeclaration.fieldModifier ?? []);\n        const blankLine =\n          declarations.length > 0 &&\n          (previousRequiresPadding ||\n            currentRequiresPadding ||\n            lineStartWithComments(node) > lineEndWithComments(previous!) + 1);\n        declarations.push(blankLine ? [hardline, declaration] : declaration);\n        previousRequiresPadding = currentRequiresPadding;\n      },\n      \"recordBodyDeclaration\"\n    );\n    return printBlock(path, declarations);\n  },\n\n  recordBodyDeclaration: printSingle,\n\n  compactConstructorDeclaration(path, print) {\n    const declaration = [\n      call(path, print, \"simpleTypeName\"),\n      \" \",\n      call(path, print, \"constructorBody\")\n    ];\n    return printWithModifiers(\n      path,\n      print,\n      \"constructorModifier\",\n      declaration,\n      true\n    );\n  }\n} satisfies Partial<JavaNodePrinters>;\n\nfunction printClassBodyDeclarations(\n  path: AstPath<ClassBodyCstNode | EnumBodyDeclarationsCstNode>,\n  print: JavaPrintFn\n) {\n  if (!path.node.children.classBodyDeclaration) {\n    return [];\n  }\n  const declarations: Doc[] = [];\n  let previousRequiresPadding =\n    path.node.name === \"enumBodyDeclarations\" ||\n    (path.grandparent as JavaNonTerminal | null)?.name ===\n      \"normalClassDeclaration\";\n  each(\n    path,\n    declarationPath => {\n      const declaration = print(declarationPath);\n      if (declaration === \"\") {\n        return;\n      }\n      const { node, previous } = declarationPath;\n      const fieldDeclaration =\n        node.children.classMemberDeclaration?.[0].children.fieldDeclaration?.[0]\n          .children;\n      const currentRequiresPadding = fieldDeclaration\n        ? hasDeclarationAnnotations(fieldDeclaration.fieldModifier ?? [])\n        : true;\n      const blankLine =\n        previousRequiresPadding ||\n        (declarations.length > 0 &&\n          (currentRequiresPadding ||\n            lineStartWithComments(node) > lineEndWithComments(previous!) + 1));\n      declarations.push(blankLine ? [hardline, declaration] : declaration);\n      previousRequiresPadding = currentRequiresPadding;\n    },\n    \"classBodyDeclaration\"\n  );\n  return declarations;\n}\n","import type {\n  BinaryExpressionCstNode,\n  FqnOrRefTypeCtx,\n  PrimaryCstNode,\n  StringTemplateCstNode,\n  TextBlockTemplateCstNode\n} from \"java-parser\";\nimport type { AstPath, Doc } from \"prettier\";\nimport { builders, utils } from \"prettier/doc\";\nimport type { JavaComment } from \"../comments.js\";\nimport {\n  call,\n  definedKeys,\n  each,\n  findBaseIndent,\n  flatMap,\n  hasAssignmentOperators,\n  hasLeadingComments,\n  hasNonAssignmentOperators,\n  indentInParentheses,\n  isNonTerminal,\n  isTerminal,\n  map,\n  onlyDefinedKey,\n  printDanglingComments,\n  printList,\n  printName,\n  printSingle,\n  type IterProperties,\n  type JavaNodePrinters,\n  type JavaNonTerminal,\n  type JavaPrintFn\n} from \"./helpers.js\";\n\nconst {\n  align,\n  breakParent,\n  conditionalGroup,\n  group,\n  hardline,\n  ifBreak,\n  indent,\n  indentIfBreak,\n  join,\n  line,\n  lineSuffixBoundary,\n  softline\n} = builders;\nconst { removeLines, willBreak } = utils;\n\nexport default {\n  expression: printSingle,\n\n  lambdaExpression(path, print, _, args = {}) {\n    const hug = (args as { hug?: boolean }).hug ?? false;\n    const parameters = call(path, print, \"lambdaParameters\");\n    const expression = [hug ? removeLines(parameters) : parameters, \" ->\"];\n    const lambdaExpression =\n      path.node.children.lambdaBody[0].children.expression;\n    const body = call(path, print, \"lambdaBody\");\n    if (lambdaExpression) {\n      const suffix = indent([line, body]);\n      expression.push(group(hug ? [suffix, softline] : suffix));\n    } else {\n      expression.push(\" \", body);\n    }\n    return expression;\n  },\n\n  lambdaParameters(path, print, options) {\n    const parameters = printSingle(path, print);\n    return !path.node.children.lambdaParametersWithBraces &&\n      options.arrowParens === \"always\"\n      ? [\"(\", parameters, \")\"]\n      : parameters;\n  },\n\n  lambdaParametersWithBraces(path, print, options) {\n    const { lambdaParameterList } = path.node.children;\n    if (!lambdaParameterList) {\n      return \"()\";\n    }\n    const { conciseLambdaParameterList, normalLambdaParameterList } =\n      lambdaParameterList[0].children;\n    const parameterCount = (conciseLambdaParameterList?.[0].children\n      .conciseLambdaParameter ??\n      normalLambdaParameterList?.[0].children.normalLambdaParameter)!.length;\n    const parameters = call(path, print, \"lambdaParameterList\");\n    if (parameterCount > 1) {\n      return indentInParentheses(parameters);\n    }\n    return conciseLambdaParameterList && options.arrowParens === \"avoid\"\n      ? parameters\n      : [\"(\", parameters, \")\"];\n  },\n\n  lambdaParameterList: printSingle,\n\n  conciseLambdaParameterList(path, print) {\n    return printList(path, print, \"conciseLambdaParameter\");\n  },\n\n  normalLambdaParameterList(path, print) {\n    return printList(path, print, \"normalLambdaParameter\");\n  },\n\n  normalLambdaParameter: printSingle,\n\n  regularLambdaParameter(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"variableModifier\"),\n      call(path, print, \"lambdaParameterType\"),\n      call(path, print, \"variableDeclaratorId\")\n    ]);\n  },\n\n  lambdaParameterType: printSingle,\n  conciseLambdaParameter: printSingle,\n  lambdaBody: printSingle,\n\n  conditionalExpression(path, print, options) {\n    const binaryExpression = call(path, print, \"binaryExpression\");\n    const grandparentNodeName = (path.getNode(4) as JavaNonTerminal | null)\n      ?.name;\n    const isInParentheses = grandparentNodeName === \"parenthesisExpression\";\n    if (!path.node.children.QuestionMark) {\n      return isInParentheses ? binaryExpression : group(binaryExpression);\n    }\n    const isInReturn = grandparentNodeName === \"returnStatement\";\n    const prefix = group(\n      isInReturn ? indent(binaryExpression) : binaryExpression\n    );\n    const [consequent, alternate] = map(path, print, \"expression\");\n    const suffix = [\n      line,\n      [\"? \", options.useTabs ? indent(consequent) : align(2, consequent)],\n      line,\n      [\": \", options.useTabs ? indent(alternate) : align(2, alternate)]\n    ];\n    const isNestedTernary = grandparentNodeName === \"conditionalExpression\";\n    const alignedSuffix =\n      !isNestedTernary || options.useTabs\n        ? suffix\n        : align(Math.max(0, options.tabWidth - 2), suffix);\n    if (isNestedTernary) {\n      return [prefix, alignedSuffix];\n    }\n    const parts = [prefix, indent(alignedSuffix)];\n    return isInParentheses ? parts : group(parts);\n  },\n\n  binaryExpression(path, print, options) {\n    const { children } = path.node;\n    const operands = flatMap(\n      path,\n      print,\n      definedKeys(children, [\n        \"expression\",\n        \"pattern\",\n        \"referenceType\",\n        \"unaryExpression\"\n      ])\n    );\n    const operators = flatMap(\n      path,\n      operatorPath => {\n        const { node } = operatorPath;\n        let image: string;\n        if (isTerminal(node)) {\n          image = node.image;\n        } else if (node.children.Less) {\n          image = \"<<\";\n        } else {\n          image = node.children.Greater!.length === 2 ? \">>\" : \">>>\";\n        }\n        return { image, doc: print(operatorPath) };\n      },\n      definedKeys(children, [\n        \"AssignmentOperator\",\n        \"BinaryOperator\",\n        \"Instanceof\",\n        \"shiftOperator\"\n      ])\n    );\n    const isInList =\n      (path.getNode(4) as JavaNonTerminal | null)?.name === \"elementValue\" ||\n      (path.getNode(6) as JavaNonTerminal | null)?.name === \"argumentList\";\n    const binaryExpression =\n      children.expression?.[0].children.conditionalExpression?.[0].children\n        .binaryExpression[0];\n    return binary(operands, operators, {\n      hasNonAssignmentOperators:\n        (operators.length > 0 && !children.AssignmentOperator) ||\n        (binaryExpression && hasNonAssignmentOperators(binaryExpression)),\n      isInList,\n      isRoot: true,\n      operatorPosition: options.experimentalOperatorPosition\n    });\n  },\n\n  unaryExpression(path, print) {\n    return [\n      ...map(path, print, \"UnaryPrefixOperator\"),\n      call(path, print, \"primary\"),\n      ...map(path, print, \"UnarySuffixOperator\")\n    ];\n  },\n\n  unaryExpressionNotPlusMinus(path, print) {\n    const { children } = path.node;\n    const expression: Doc[] = [];\n    if (children.UnaryPrefixOperatorNotPlusMinus) {\n      expression.push(...map(path, print, \"UnaryPrefixOperatorNotPlusMinus\"));\n    }\n    expression.push(call(path, print, \"primary\"));\n    if (children.UnarySuffixOperator) {\n      expression.push(...map(path, print, \"UnarySuffixOperator\"));\n    }\n    return join(\" \", expression);\n  },\n\n  primary(path, print) {\n    const { children } = path.node;\n    if (!children.primarySuffix) {\n      return call(path, print, \"primaryPrefix\");\n    }\n    const methodInvocations = children.primarySuffix\n      .filter(({ children }) => children.methodInvocationSuffix)\n      .map(({ children }) => children.methodInvocationSuffix![0].children);\n    const hasLambdaMethodParameter = methodInvocations.some(\n      ({ argumentList }) =>\n        argumentList?.[0].children.expression.some(\n          ({ children }) => children.lambdaExpression\n        )\n    );\n    const prefixIsCallExpression =\n      children.primaryPrefix[0].children.newExpression;\n    const callExpressionCount =\n      methodInvocations.length +\n      (prefixIsCallExpression ? 1 : 0) +\n      children.primarySuffix.filter(\n        ({ children }) => children.unqualifiedClassInstanceCreationExpression\n      ).length;\n    const fqnOrRefType =\n      children.primaryPrefix[0].children.fqnOrRefType?.[0].children;\n    const prefixIsMethodInvocation =\n      fqnOrRefType?.fqnOrRefTypePartRest !== undefined &&\n      children.primarySuffix?.[0].children.methodInvocationSuffix !== undefined;\n    const prefixIsStaticMethodInvocation =\n      prefixIsMethodInvocation && isCapitalizedIdentifier(fqnOrRefType);\n    const prefixIsInstanceMethodInvocation =\n      prefixIsMethodInvocation && !prefixIsStaticMethodInvocation;\n    const mustBreakForCallExpressions =\n      methodInvocations.length > 2 && hasLambdaMethodParameter;\n    const separator = mustBreakForCallExpressions ? hardline : softline;\n    const prefix = [\n      call(\n        path,\n        prefixPath =>\n          print(prefixPath, {\n            lastSeparator:\n              prefixIsStaticMethodInvocation ||\n              (prefixIsInstanceMethodInvocation && callExpressionCount === 1)\n                ? \"\"\n                : separator\n          }),\n        \"primaryPrefix\"\n      )\n    ];\n    const canBreakForCallExpressions =\n      callExpressionCount > 2 ||\n      (callExpressionCount === 2 && prefixIsInstanceMethodInvocation) ||\n      willBreak(prefix);\n    const suffixes: Doc[] = [];\n    each(\n      path,\n      suffixPath => {\n        const { node, previous } = suffixPath;\n        const suffix = print(suffixPath);\n        if (node.children.Dot) {\n          if (\n            (canBreakForCallExpressions &&\n              ((!previous && prefixIsCallExpression) ||\n                previous?.children.methodInvocationSuffix ||\n                previous?.children\n                  .unqualifiedClassInstanceCreationExpression)) ||\n            (!node.children.templateArgument && willBreak(suffix))\n          ) {\n            suffixes.push(separator);\n          }\n          suffixes.push(suffix);\n        } else if (previous) {\n          suffixes.push(suffix);\n        } else {\n          prefix.push(\n            prefixIsInstanceMethodInvocation && callExpressionCount >= 2\n              ? indent(suffix)\n              : suffix\n          );\n        }\n      },\n      \"primarySuffix\"\n    );\n    const hasSuffixComments = children.primarySuffix.some(suffix =>\n      hasLeadingComments(suffix)\n    );\n    return group(\n      canBreakForCallExpressions || hasSuffixComments\n        ? [prefix, indent(suffixes)]\n        : [prefix, ...suffixes]\n    );\n  },\n\n  primaryPrefix: printSingle,\n\n  primarySuffix(path, print) {\n    const { children } = path.node;\n    if (!children.Dot) {\n      return printSingle(path, print);\n    }\n    const suffix: Doc[] = [\".\"];\n    if (children.This) {\n      suffix.push(\"this\");\n    } else if (children.Identifier) {\n      if (children.typeArguments) {\n        suffix.push(call(path, print, \"typeArguments\"));\n      }\n      suffix.push(call(path, print, \"Identifier\"));\n    } else {\n      const suffixKey = onlyDefinedKey(children, [\n        \"templateArgument\",\n        \"unqualifiedClassInstanceCreationExpression\"\n      ]);\n      suffix.push(call(path, print, suffixKey));\n    }\n    return suffix;\n  },\n\n  fqnOrRefType(path, print, _, args) {\n    const lastSeparator = (args as { lastSeparator?: Doc }).lastSeparator ?? \"\";\n    const fqnOrRefType = [\n      call(path, print, \"fqnOrRefTypePartFirst\"),\n      ...map(\n        path,\n        partPath => {\n          const part = print(partPath);\n          return partPath.isLast\n            ? [willBreak(part) ? hardline : lastSeparator, part]\n            : part;\n        },\n        \"fqnOrRefTypePartRest\"\n      )\n    ];\n    fqnOrRefType.push(indent(fqnOrRefType.pop()!));\n    return path.node.children.dims\n      ? [fqnOrRefType, call(path, print, \"dims\")]\n      : fqnOrRefType;\n  },\n\n  fqnOrRefTypePartFirst(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"annotation\"),\n      call(path, print, \"fqnOrRefTypePartCommon\")\n    ]);\n  },\n\n  fqnOrRefTypePartRest(path, print) {\n    const common = call(path, print, \"fqnOrRefTypePartCommon\");\n    const type = path.node.children.typeArguments\n      ? [call(path, print, \"typeArguments\"), common]\n      : common;\n    return [\".\", ...join(\" \", [...map(path, print, \"annotation\"), type])];\n  },\n\n  fqnOrRefTypePartCommon(path, print) {\n    const { children } = path.node;\n    const keywordKey = onlyDefinedKey(children, [\"Identifier\", \"Super\"]);\n    const keyword = call(path, print, keywordKey);\n    return children.typeArguments\n      ? [keyword, call(path, print, \"typeArguments\")]\n      : keyword;\n  },\n\n  parenthesisExpression(path, print) {\n    const expression = call(path, print, \"expression\");\n    const primaryAncestor = path.getNode(4) as PrimaryCstNode | null;\n    const binaryExpressionAncestor = path.getNode(\n      8\n    ) as BinaryExpressionCstNode | null;\n    const outerAncestor = path.getNode(14) as JavaNonTerminal | null;\n    const { conditionalExpression, lambdaExpression } =\n      path.node.children.expression[0].children;\n    const hasLambda = lambdaExpression !== undefined;\n    const hasTernary =\n      conditionalExpression?.[0].children.QuestionMark !== undefined;\n    const hasSuffix = primaryAncestor?.children.primarySuffix !== undefined;\n    const isAssignment =\n      (outerAncestor?.name === \"binaryExpression\" &&\n        hasAssignmentOperators(outerAncestor)) ||\n      outerAncestor?.name === \"variableInitializer\";\n    if (!hasLambda && hasSuffix && (!hasTernary || isAssignment)) {\n      return indentInParentheses(hasTernary ? group(expression) : expression);\n    } else if (\n      binaryExpressionAncestor &&\n      Object.keys(binaryExpressionAncestor.children).length === 1 &&\n      outerAncestor &&\n      [\"guard\", \"returnStatement\"].includes(outerAncestor.name)\n    ) {\n      return indentInParentheses(group(expression));\n    } else if (hasTernary && hasSuffix && !isAssignment) {\n      return group([\"(\", expression, softline, \")\"]);\n    } else {\n      return group([\n        \"(\",\n        hasLambda || hasTernary ? expression : indent(expression),\n        \")\"\n      ]);\n    }\n  },\n\n  castExpression: printSingle,\n\n  primitiveCastExpression(path, print) {\n    return [\n      \"(\",\n      call(path, print, \"primitiveType\"),\n      \") \",\n      call(path, print, \"unaryExpression\")\n    ];\n  },\n\n  referenceTypeCastExpression(path, print) {\n    const { children } = path.node;\n    const type = call(path, print, \"referenceType\");\n    const cast = children.additionalBound\n      ? indentInParentheses(\n          join(line, [type, ...map(path, print, \"additionalBound\")])\n        )\n      : [\"(\", type, \")\"];\n    const expressionKey = onlyDefinedKey(children, [\n      \"lambdaExpression\",\n      \"unaryExpressionNotPlusMinus\"\n    ]);\n    return [cast, \" \", call(path, print, expressionKey)];\n  },\n\n  newExpression: printSingle,\n\n  unqualifiedClassInstanceCreationExpression(path, print) {\n    const { children } = path.node;\n    const expression: Doc[] = [\"new \"];\n    if (children.typeArguments) {\n      expression.push(call(path, print, \"typeArguments\"));\n    }\n    expression.push(\n      call(path, print, \"classOrInterfaceTypeToInstantiate\"),\n      children.argumentList\n        ? group([\"(\", call(path, print, \"argumentList\"), \")\"])\n        : \"()\"\n    );\n    if (children.classBody) {\n      expression.push(\" \", call(path, print, \"classBody\"));\n    }\n    return expression;\n  },\n\n  classOrInterfaceTypeToInstantiate(path, print) {\n    const { children } = path.node;\n    const type = children.annotation\n      ? flatMap(\n          path,\n          childPath => [\n            print(childPath),\n            isNonTerminal(childPath.node) ? \" \" : \".\"\n          ],\n          [\"annotation\", \"Identifier\"]\n        )\n      : printName(path, print);\n    if (children.typeArgumentsOrDiamond) {\n      type.push(call(path, print, \"typeArgumentsOrDiamond\"));\n    }\n    return type;\n  },\n\n  typeArgumentsOrDiamond: printSingle,\n\n  diamond() {\n    return \"<>\";\n  },\n\n  methodInvocationSuffix(path, print) {\n    return path.node.children.argumentList\n      ? group([\"(\", call(path, print, \"argumentList\"), \")\"])\n      : indentInParentheses(printDanglingComments(path), { shouldBreak: true });\n  },\n\n  argumentList(path, print) {\n    const expressions = path.node.children.expression;\n    const lastExpression = expressions.at(\n      -1\n    ) as (typeof expressions)[number] & { comments?: JavaComment[] };\n    const lastExpressionLambdaBodyExpression =\n      lastExpression.children.lambdaExpression?.[0].children.lambdaBody[0]\n        .children.expression?.[0].children;\n    const lastExpressionLambdaBodyTernaryExpression =\n      lastExpressionLambdaBodyExpression?.conditionalExpression?.[0].children;\n    const isHuggable =\n      !lastExpression.comments &&\n      (!lastExpressionLambdaBodyExpression ||\n        lastExpressionLambdaBodyTernaryExpression?.QuestionMark !== undefined ||\n        lastExpressionLambdaBodyTernaryExpression?.binaryExpression?.[0]\n          .children.unaryExpression.length === 1) &&\n      expressions.findIndex(({ children }) => children.lambdaExpression) ===\n        expressions.length - 1;\n    const args = map(path, print, \"expression\");\n    const allArgsExpandable = [\n      indent([softline, ...join([\",\", line], args)]),\n      softline\n    ];\n    if (!isHuggable || willBreak((args.at(-1) as Doc[])[0])) {\n      return allArgsExpandable;\n    }\n    const headArgs = args.slice(0, -1);\n    const huggedLastArg = path.call(\n      argPath => print(argPath, { hug: true }),\n      \"children\",\n      \"expression\",\n      args.length - 1\n    );\n    const lastArgExpanded = join(\", \", [\n      ...headArgs,\n      group(huggedLastArg, { shouldBreak: true })\n    ]);\n    if (willBreak(huggedLastArg)) {\n      return [\n        breakParent,\n        conditionalGroup([lastArgExpanded, allArgsExpandable])\n      ];\n    }\n    return conditionalGroup([\n      join(\", \", [...headArgs, huggedLastArg]),\n      lastArgExpanded,\n      allArgsExpandable\n    ]);\n  },\n\n  arrayCreationExpression(path, print) {\n    const { children } = path.node;\n    const typeKey = onlyDefinedKey(children, [\n      \"classOrInterfaceType\",\n      \"primitiveType\"\n    ]);\n    const suffixKey = onlyDefinedKey(children, [\n      \"arrayCreationExpressionWithoutInitializerSuffix\",\n      \"arrayCreationWithInitializerSuffix\"\n    ]);\n    return [\"new \", call(path, print, typeKey), call(path, print, suffixKey)];\n  },\n\n  arrayCreationExpressionWithoutInitializerSuffix(path, print) {\n    const expressions = call(path, print, \"dimExprs\");\n    return path.node.children.dims\n      ? [expressions, call(path, print, \"dims\")]\n      : expressions;\n  },\n\n  arrayCreationWithInitializerSuffix(path, print) {\n    return [\n      call(path, print, \"dims\"),\n      \" \",\n      call(path, print, \"arrayInitializer\")\n    ];\n  },\n\n  dimExprs(path, print) {\n    return map(path, print, \"dimExpr\");\n  },\n\n  dimExpr(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"annotation\"),\n      [\"[\", call(path, print, \"expression\"), \"]\"]\n    ]);\n  },\n\n  classLiteralSuffix(path, print) {\n    const lSquares = map(path, print, \"LSquare\");\n    const rSquares = map(path, print, \"RSquare\");\n    return [\n      ...lSquares.flatMap((lSquare, index) => [lSquare, rSquares[index]]),\n      \".class\"\n    ];\n  },\n\n  arrayAccessSuffix(path, print) {\n    return [\"[\", call(path, print, \"expression\"), \"]\"];\n  },\n\n  methodReferenceSuffix(path, print) {\n    const { children } = path.node;\n    const reference: Doc[] = [\"::\"];\n    if (children.typeArguments) {\n      reference.push(call(path, print, \"typeArguments\"));\n    }\n    reference.push(\n      call(path, print, onlyDefinedKey(children, [\"Identifier\", \"New\"]))\n    );\n    return reference;\n  },\n\n  templateArgument: printSingle,\n  template: printSingle,\n\n  stringTemplate(path, print) {\n    return printTemplate(\n      path,\n      print,\n      \"StringTemplateBegin\",\n      \"StringTemplateMid\",\n      \"StringTemplateEnd\"\n    );\n  },\n\n  textBlockTemplate(path, print) {\n    return printTemplate(\n      path,\n      print,\n      \"TextBlockTemplateBegin\",\n      \"TextBlockTemplateMid\",\n      \"TextBlockTemplateEnd\"\n    );\n  },\n\n  embeddedExpression: printSingle,\n  pattern: printSingle,\n  typePattern: printSingle,\n\n  recordPattern(path, print) {\n    const patterns = path.node.children.componentPatternList\n      ? indentInParentheses(call(path, print, \"componentPatternList\"))\n      : \"()\";\n    return [call(path, print, \"referenceType\"), patterns];\n  },\n\n  componentPatternList(path, print) {\n    return printList(path, print, \"componentPattern\");\n  },\n\n  componentPattern: printSingle,\n  matchAllPattern: printSingle,\n\n  guard(path, print) {\n    const expression = call(path, print, \"expression\");\n    const hasParentheses =\n      path.node.children.expression[0].children.conditionalExpression?.[0]\n        .children.binaryExpression[0].children.unaryExpression[0].children\n        .primary[0].children.primaryPrefix[0].children.parenthesisExpression !==\n      undefined;\n    return [\n      \"when \",\n      hasParentheses\n        ? expression\n        : group([\n            ifBreak(\"(\"),\n            indent([softline, expression]),\n            softline,\n            ifBreak(\")\")\n          ])\n    ];\n  }\n} satisfies Partial<JavaNodePrinters>;\n\nfunction binary(\n  operands: Doc[],\n  operators: { image: string; doc: Doc }[],\n  {\n    hasNonAssignmentOperators = false,\n    isInList = false,\n    isRoot = false,\n    operatorPosition\n  }: {\n    hasNonAssignmentOperators?: boolean;\n    isInList?: boolean;\n    isRoot?: boolean;\n    operatorPosition: \"end\" | \"start\";\n  }\n): Doc {\n  let levelOperator: string | undefined;\n  let levelPrecedence: number | undefined;\n  let level: Doc[] = [];\n  while (operators.length) {\n    const nextOperator = operators[0].image;\n    const nextPrecedence = getOperatorPrecedence(nextOperator);\n\n    if (levelPrecedence === undefined || nextPrecedence === levelPrecedence) {\n      const { image: operator, doc: operatorDoc } = operators.shift()!;\n      level.push(operands.shift()!);\n      if (\n        levelOperator !== undefined &&\n        needsParentheses(levelOperator, operator)\n      ) {\n        level = [[\"(\", group(indent(level)), \")\"]];\n      }\n      const parts = [\" \", operatorDoc, line];\n      if (operatorPosition === \"start\" && !isAssignmentOperator(operator)) {\n        parts.reverse();\n      }\n      level.push(parts);\n      levelOperator = operator;\n      levelPrecedence = nextPrecedence;\n    } else if (nextPrecedence < levelPrecedence) {\n      if (!isRoot) {\n        break;\n      }\n      level.push(operands.shift()!);\n      const content = group(indent(level));\n      operands.unshift(\n        levelOperator !== undefined &&\n          needsParentheses(levelOperator, nextOperator)\n          ? [\"(\", content, \")\"]\n          : content\n      );\n      level = [];\n      levelOperator = undefined;\n      levelPrecedence = undefined;\n    } else {\n      const content = binary(operands, operators, { operatorPosition });\n      operands.unshift(\n        levelOperator !== undefined &&\n          needsParentheses(nextOperator, levelOperator)\n          ? [\"(\", group(indent(content)), \")\"]\n          : group(content)\n      );\n    }\n  }\n  level.push(operands.shift()!);\n  if (\n    !levelOperator ||\n    (!isInList &&\n      !isAssignmentOperator(levelOperator) &&\n      levelOperator !== \"instanceof\")\n  ) {\n    return level;\n  }\n  if (!isRoot || hasNonAssignmentOperators) {\n    return indent(level);\n  }\n  const groupId = Symbol(\"assignment\");\n  return [\n    level[0],\n    group(indent(level[1]), { id: groupId }),\n    indentIfBreak(level[2], { groupId })\n  ];\n}\n\nconst precedencesByOperator = new Map(\n  [\n    [\"||\"],\n    [\"&&\"],\n    [\"|\"],\n    [\"^\"],\n    [\"&\"],\n    [\"==\", \"!=\"],\n    [\"<\", \">\", \"<=\", \">=\", \"instanceof\"],\n    [\"<<\", \">>\", \">>>\"],\n    [\"+\", \"-\"],\n    [\"*\", \"/\", \"%\"]\n  ].flatMap((operators, index) => operators.map(operator => [operator, index]))\n);\nfunction getOperatorPrecedence(operator: string) {\n  return precedencesByOperator.get(operator) ?? -1;\n}\n\nfunction needsParentheses(operator: string, parentOperator: string) {\n  return (\n    (operator === \"&&\" && parentOperator === \"||\") ||\n    ([\"|\", \"^\", \"&\", \"<<\", \">>\", \">>>\"].includes(parentOperator) &&\n      getOperatorPrecedence(operator) >\n        getOperatorPrecedence(parentOperator)) ||\n    [operator, parentOperator].every(o => [\"==\", \"!=\"].includes(o)) ||\n    [operator, parentOperator].every(o => [\"<<\", \">>\", \">>>\"].includes(o)) ||\n    (operator === \"*\" && parentOperator === \"/\") ||\n    (operator === \"/\" && parentOperator === \"*\") ||\n    (operator === \"%\" && [\"+\", \"-\", \"*\", \"/\"].includes(parentOperator)) ||\n    ([\"*\", \"/\"].includes(operator) && parentOperator === \"%\")\n  );\n}\n\nconst assignmentOperators = new Set([\n  \"=\",\n  \"*=\",\n  \"/=\",\n  \"%=\",\n  \"+=\",\n  \"-=\",\n  \"<<=\",\n  \">>=\",\n  \">>>=\",\n  \"&=\",\n  \"^=\",\n  \"|=\"\n]);\nfunction isAssignmentOperator(operator: string) {\n  return assignmentOperators.has(operator);\n}\n\nfunction isCapitalizedIdentifier(fqnOrRefType: FqnOrRefTypeCtx) {\n  const nextToLastIdentifier = [\n    fqnOrRefType.fqnOrRefTypePartFirst[0],\n    ...(fqnOrRefType.fqnOrRefTypePartRest ?? [])\n  ].at(-2)?.children.fqnOrRefTypePartCommon[0].children.Identifier?.[0].image;\n  return /^\\p{Uppercase_Letter}/u.test(nextToLastIdentifier ?? \"\");\n}\n\nfunction printTemplate<\n  T extends StringTemplateCstNode | TextBlockTemplateCstNode,\n  C extends Exclude<IterProperties<T[\"children\"]>, \"embeddedExpression\">\n>(path: AstPath<T>, print: JavaPrintFn, beginKey: C, midKey: C, endKey: C) {\n  const begin = call(path, ({ node }) => node.image, beginKey);\n  const mids = map(path, ({ node }) => node.image, midKey);\n  const end = call(path, ({ node }) => node.image, endKey);\n  const lines = [begin, ...mids, end].join(\"\").split(\"\\n\").slice(1);\n  const baseIndent = findBaseIndent(lines);\n  const prefix = \"\\n\" + \" \".repeat(baseIndent);\n  const parts = [begin, ...mids, end].map(image =>\n    join(hardline, image.split(prefix))\n  );\n  return indent([\n    parts[0],\n    ...map(\n      path,\n      (expressionPath, index) => {\n        const expression = group([\n          indent([softline, print(expressionPath), lineSuffixBoundary]),\n          softline\n        ]);\n        return index === 0 ? expression : [parts[index], expression];\n      },\n      \"embeddedExpression\" as IterProperties<T[\"children\"]>\n    ),\n    parts.at(-1)!\n  ]);\n}\n","import type { Doc } from \"prettier\";\nimport { builders } from \"prettier/doc\";\nimport {\n  call,\n  definedKeys,\n  each,\n  hasDeclarationAnnotations,\n  indentInParentheses,\n  lineEndWithComments,\n  lineStartWithComments,\n  onlyDefinedKey,\n  printArrayInitializer,\n  printBlock,\n  printClassPermits,\n  printList,\n  printSingle,\n  printWithModifiers,\n  type JavaNodePrinters\n} from \"./helpers.js\";\n\nconst { group, hardline, indent, join, line } = builders;\n\nexport default {\n  interfaceDeclaration(path, print) {\n    const declarationKey = onlyDefinedKey(path.node.children, [\n      \"annotationInterfaceDeclaration\",\n      \"normalInterfaceDeclaration\"\n    ]);\n    return printWithModifiers(\n      path,\n      print,\n      \"interfaceModifier\",\n      call(path, print, declarationKey),\n      true\n    );\n  },\n\n  normalInterfaceDeclaration(path, print) {\n    const { children } = path.node;\n    const definedClauses = definedKeys(children, [\n      \"interfaceExtends\",\n      \"interfacePermits\"\n    ]);\n    const hasMultipleClauses = definedClauses.length > 1;\n    const hasTypeParameters = children.typeParameters !== undefined;\n    const parts = [\"interface \", call(path, print, \"typeIdentifier\")];\n    if (hasTypeParameters) {\n      const typeParameters = call(path, print, \"typeParameters\");\n      parts.push(\n        hasMultipleClauses ? group(indent(typeParameters)) : typeParameters\n      );\n    }\n    if (definedClauses.length) {\n      const separator = hasTypeParameters && !hasMultipleClauses ? \" \" : line;\n      const clauses = definedClauses.flatMap(clause => [\n        separator,\n        call(path, print, clause)\n      ]);\n      const hasBody =\n        children.interfaceBody[0].children.interfaceMemberDeclaration !==\n        undefined;\n      const clauseGroup = [\n        hasTypeParameters && !hasMultipleClauses ? clauses : indent(clauses),\n        hasBody ? separator : \" \"\n      ];\n      parts.push(hasMultipleClauses ? clauseGroup : group(clauseGroup));\n    } else {\n      parts.push(\" \");\n    }\n    return [group(parts), call(path, print, \"interfaceBody\")];\n  },\n\n  interfaceModifier: printSingle,\n\n  interfaceExtends(path, print) {\n    return group([\n      \"extends\",\n      indent([line, call(path, print, \"interfaceTypeList\")])\n    ]);\n  },\n\n  interfacePermits: printClassPermits,\n\n  interfaceBody(path, print) {\n    const declarations: Doc[] = [];\n    let previousRequiresPadding = false;\n    each(\n      path,\n      declarationPath => {\n        const declaration = print(declarationPath);\n        if (declaration === \"\") {\n          return;\n        }\n        const { node, previous } = declarationPath;\n        const constantDeclaration =\n          node.children.constantDeclaration?.[0].children;\n        const methodDeclaration =\n          node.children.interfaceMethodDeclaration?.[0].children;\n        const currentRequiresPadding =\n          (!constantDeclaration && !methodDeclaration) ||\n          methodDeclaration?.methodBody[0].children.block !== undefined ||\n          hasDeclarationAnnotations(\n            constantDeclaration?.constantModifier ??\n              methodDeclaration?.interfaceMethodModifier ??\n              []\n          );\n        const blankLine =\n          declarations.length > 0 &&\n          (previousRequiresPadding ||\n            currentRequiresPadding ||\n            lineStartWithComments(node) > lineEndWithComments(previous!) + 1);\n        declarations.push(blankLine ? [hardline, declaration] : declaration);\n        previousRequiresPadding = currentRequiresPadding;\n      },\n      \"interfaceMemberDeclaration\"\n    );\n    return printBlock(path, declarations);\n  },\n\n  interfaceMemberDeclaration(path, print) {\n    const { children } = path.node;\n    return children.Semicolon\n      ? \"\"\n      : call(path, print, onlyDefinedKey(children));\n  },\n\n  constantDeclaration(path, print) {\n    const declaration = [\n      call(path, print, \"unannType\"),\n      \" \",\n      call(path, print, \"variableDeclaratorList\"),\n      \";\"\n    ];\n    return printWithModifiers(path, print, \"constantModifier\", declaration);\n  },\n\n  constantModifier: printSingle,\n\n  interfaceMethodDeclaration(path, print) {\n    const declaration = [\n      call(path, print, \"methodHeader\"),\n      path.node.children.methodBody[0].children.Semicolon ? \"\" : \" \",\n      call(path, print, \"methodBody\")\n    ];\n    return printWithModifiers(\n      path,\n      print,\n      \"interfaceMethodModifier\",\n      declaration\n    );\n  },\n\n  interfaceMethodModifier: printSingle,\n\n  annotationInterfaceDeclaration(path, print) {\n    return join(\" \", [\n      \"@interface\",\n      call(path, print, \"typeIdentifier\"),\n      call(path, print, \"annotationInterfaceBody\")\n    ]);\n  },\n\n  annotationInterfaceBody(path, print) {\n    const declarations: Doc[] = [];\n    each(\n      path,\n      declarationPath => {\n        const declaration = print(declarationPath);\n        if (declaration === \"\") {\n          return;\n        }\n        declarations.push(\n          declarationPath.isFirst ? declaration : [hardline, declaration]\n        );\n      },\n      \"annotationInterfaceMemberDeclaration\"\n    );\n    return printBlock(path, declarations);\n  },\n\n  annotationInterfaceMemberDeclaration(path, print) {\n    const { children } = path.node;\n    return children.Semicolon\n      ? \"\"\n      : call(path, print, onlyDefinedKey(children));\n  },\n\n  annotationInterfaceElementDeclaration(path, print) {\n    const { dims, defaultValue } = path.node.children;\n    const declaration = [\n      call(path, print, \"unannType\"),\n      \" \",\n      call(path, print, \"Identifier\"),\n      \"()\"\n    ];\n    if (dims) {\n      declaration.push(call(path, print, \"dims\"));\n    }\n    if (defaultValue) {\n      declaration.push(\" \", call(path, print, \"defaultValue\"));\n    }\n    declaration.push(\";\");\n    return printWithModifiers(\n      path,\n      print,\n      \"annotationInterfaceElementModifier\",\n      declaration\n    );\n  },\n\n  annotationInterfaceElementModifier: printSingle,\n\n  defaultValue(path, print) {\n    return [\"default \", call(path, print, \"elementValue\")];\n  },\n\n  annotation(path, print) {\n    const { children } = path.node;\n    const annotation = [\"@\", call(path, print, \"typeName\")];\n    if (children.elementValue || children.elementValuePairList) {\n      const valuesKey = onlyDefinedKey(children, [\n        \"elementValue\",\n        \"elementValuePairList\"\n      ]);\n      annotation.push(indentInParentheses(call(path, print, valuesKey)));\n    }\n    return annotation;\n  },\n\n  elementValuePairList(path, print) {\n    return printList(path, print, \"elementValuePair\");\n  },\n\n  elementValuePair(path, print) {\n    return join(\" \", [\n      call(path, print, \"Identifier\"),\n      call(path, print, \"Equals\"),\n      call(path, print, \"elementValue\")\n    ]);\n  },\n\n  elementValue: printSingle,\n\n  elementValueArrayInitializer(path, print, options) {\n    return printArrayInitializer(path, print, options, \"elementValueList\");\n  },\n\n  elementValueList(path, print) {\n    return group(printList(path, print, \"elementValue\"));\n  }\n} satisfies Partial<JavaNodePrinters>;\n","import { builders } from \"prettier/doc\";\nimport {\n  findBaseIndent,\n  map,\n  onlyDefinedKey,\n  printSingle,\n  type JavaNodePrinters,\n  type JavaNonTerminal\n} from \"./helpers.js\";\n\nconst { hardline, indent, join } = builders;\n\nexport default {\n  literal(path, print) {\n    const { TextBlock } = path.node.children;\n    if (!TextBlock) {\n      return printSingle(path, print);\n    }\n    const [open, ...lines] = TextBlock[0].image.split(\"\\n\");\n    const baseIndent = findBaseIndent(lines);\n    const textBlock = join(hardline, [\n      open,\n      ...lines.map(line => line.slice(baseIndent))\n    ]);\n    const ancestor = path.getNode(14) as JavaNonTerminal | null;\n    return ancestor?.name === \"variableInitializer\" ||\n      (ancestor?.name === \"binaryExpression\" &&\n        ancestor.children.AssignmentOperator)\n      ? indent(textBlock)\n      : textBlock;\n  },\n\n  integerLiteral: printSingle,\n  floatingPointLiteral: printSingle,\n  booleanLiteral: printSingle,\n\n  shiftOperator(path, print) {\n    return map(path, print, onlyDefinedKey(path.node.children));\n  }\n} satisfies Partial<JavaNodePrinters>;\n","import { printName, printSingle, type JavaNodePrinters } from \"./helpers.js\";\n\nexport default {\n  typeIdentifier: printSingle,\n  moduleName: printName,\n  packageName: printName,\n  typeName: printName,\n  expressionName: printName,\n  methodName: printSingle,\n  packageOrTypeName: printName,\n  ambiguousName: printName\n} satisfies Partial<JavaNodePrinters>;\n","import type {\n  ExportsModuleDirectiveCstNode,\n  ImportDeclarationCstNode,\n  IToken,\n  OpensModuleDirectiveCstNode\n} from \"java-parser\";\nimport type { AstPath, Doc } from \"prettier\";\nimport { builders } from \"prettier/doc\";\nimport {\n  call,\n  lineEndWithComments,\n  lineStartWithComments,\n  map,\n  printBlock,\n  printDanglingComments,\n  printName,\n  printSingle,\n  type JavaNodePrinters,\n  type JavaPrintFn\n} from \"./helpers.js\";\n\nconst { group, hardline, indent, join, line } = builders;\n\nexport default {\n  compilationUnit(path, print) {\n    return [...printDanglingComments(path), printSingle(path, print), hardline];\n  },\n\n  ordinaryCompilationUnit(path, print) {\n    const { children } = path.node;\n    const declarations: Doc[] = [];\n    if (children.packageDeclaration) {\n      declarations.push(call(path, print, \"packageDeclaration\"));\n    }\n    if (children.importDeclaration) {\n      const staticCount = sortImports(children.importDeclaration);\n      const importDeclarations = map(path, print, \"importDeclaration\").filter(\n        doc => doc !== \"\"\n      );\n      const staticDeclarations = importDeclarations.slice(0, staticCount);\n      const nonStaticDeclarations = importDeclarations.slice(staticCount);\n      declarations.push(\n        ...[staticDeclarations, nonStaticDeclarations]\n          .filter(({ length }) => length)\n          .map(declarations => join(hardline, declarations))\n      );\n    }\n    if (children.typeDeclaration) {\n      declarations.push(\n        ...map(path, print, \"typeDeclaration\").filter(\n          declaration => declaration !== \"\"\n        )\n      );\n    }\n    return join([hardline, hardline], declarations);\n  },\n\n  modularCompilationUnit(path, print) {\n    const { children } = path.node;\n    const declarations: Doc[] = [];\n    if (children.importDeclaration) {\n      const staticCount = sortImports(children.importDeclaration);\n      const importDeclarations = map(path, print, \"importDeclaration\").filter(\n        doc => doc !== \"\"\n      );\n      const staticDeclarations = importDeclarations.slice(0, staticCount);\n      const nonStaticDeclarations = importDeclarations.slice(staticCount);\n      declarations.push(\n        ...[staticDeclarations, nonStaticDeclarations]\n          .filter(({ length }) => length)\n          .map(declarations => join(hardline, declarations))\n      );\n    }\n    declarations.push(call(path, print, \"moduleDeclaration\"));\n    return join([hardline, hardline], declarations);\n  },\n\n  packageDeclaration(path, print) {\n    return join(hardline, [\n      ...map(path, print, \"packageModifier\"),\n      [\"package \", printName(path, print), \";\"]\n    ]);\n  },\n\n  packageModifier: printSingle,\n\n  importDeclaration(path, print) {\n    const { children } = path.node;\n    if (children.emptyStatement) {\n      return call(path, print, \"emptyStatement\");\n    }\n    const declaration: Doc[] = [\"import \"];\n    if (children.Static) {\n      declaration.push(\"static \");\n    }\n    declaration.push(call(path, print, \"packageOrTypeName\"));\n    if (children.Star) {\n      declaration.push(\".*\");\n    }\n    declaration.push(\";\");\n    return declaration;\n  },\n\n  typeDeclaration(path, print) {\n    return path.node.children.Semicolon ? \"\" : printSingle(path, print);\n  },\n\n  moduleDeclaration(path, print) {\n    const { annotation, Open } = path.node.children;\n    const prefix: Doc[] = [];\n    if (annotation) {\n      prefix.push(...map(path, print, \"annotation\"));\n    }\n    if (Open) {\n      prefix.push(\"open\");\n    }\n    const declarations = map(\n      path,\n      declarationPath => {\n        const declaration = print(declarationPath);\n        const { node, previous } = declarationPath;\n        return !previous ||\n          lineStartWithComments(node) <= lineEndWithComments(previous) + 1\n          ? declaration\n          : [hardline, declaration];\n      },\n      \"moduleDirective\"\n    );\n    return join(\" \", [\n      ...prefix,\n      \"module\",\n      printName(path, print),\n      printBlock(path, declarations)\n    ]);\n  },\n\n  moduleDirective: printSingle,\n\n  requiresModuleDirective(path, print) {\n    return join(\" \", [\n      \"requires\",\n      ...map(path, print, \"requiresModifier\"),\n      [call(path, print, \"moduleName\"), \";\"]\n    ]);\n  },\n\n  exportsModuleDirective(path, print) {\n    return printToModuleNamesDirective(path, print, \"exports\");\n  },\n\n  opensModuleDirective(path, print) {\n    return printToModuleNamesDirective(path, print, \"opens\");\n  },\n\n  usesModuleDirective(path, print) {\n    return [\"uses \", call(path, print, \"typeName\"), \";\"];\n  },\n\n  providesModuleDirective(path, print) {\n    const [firstTypeName, ...restTypeNames] = map(path, print, \"typeName\");\n    return [\n      \"provides \",\n      firstTypeName,\n      group(\n        indent([\n          line,\n          group(indent([\"with\", line, ...join([\",\", line], restTypeNames)]))\n        ])\n      ),\n      \";\"\n    ];\n  },\n\n  requiresModifier: printSingle\n} satisfies Partial<JavaNodePrinters>;\n\nfunction sortImports(importDeclarations: ImportDeclarationCstNode[]) {\n  importDeclarations.sort(({ children: a }, { children: b }) => {\n    if (a.Static && !b.Static) {\n      return -1;\n    } else if (b.Static && !a.Static) {\n      return 1;\n    }\n    if (!b.packageOrTypeName) {\n      if (a.packageOrTypeName) {\n        return -1;\n      }\n      return 0;\n    } else if (!a.packageOrTypeName) {\n      return 1;\n    }\n    return compareFqn(a.packageOrTypeName[0], b.packageOrTypeName[0]);\n  });\n\n  return importDeclarations.reduce(\n    (staticCount, importDeclaration) =>\n      importDeclaration.children.Static ? staticCount + 1 : staticCount,\n    0\n  );\n}\n\nfunction compareFqn(\n  a: { children: { Identifier: IToken[] } },\n  b: { children: { Identifier: IToken[] } }\n) {\n  const identifiersA = a.children.Identifier;\n  const identifiersB = b.children.Identifier;\n\n  const minParts = Math.min(identifiersA.length, identifiersB.length);\n  for (let i = 0; i < minParts; i++) {\n    const imageA = identifiersA[i].image;\n    const imageB = identifiersB[i].image;\n    if (imageA < imageB) {\n      return -1;\n    } else if (imageA > imageB) {\n      return 1;\n    }\n  }\n\n  return identifiersA.length - identifiersB.length;\n}\n\nfunction printToModuleNamesDirective(\n  path: AstPath<ExportsModuleDirectiveCstNode | OpensModuleDirectiveCstNode>,\n  print: JavaPrintFn,\n  prefix: string\n) {\n  const directive = [prefix, \" \", call(path, print, \"packageName\")];\n  if (path.node.children.moduleName) {\n    const moduleNames = join([\",\", line], map(path, print, \"moduleName\"));\n    directive.push(\n      group(indent([line, group(indent([\"to\", line, ...moduleNames]))]))\n    );\n  }\n  directive.push(\";\");\n  return directive;\n}\n","import { builders } from \"prettier/doc\";\nimport {\n  call,\n  definedKeys,\n  flatMap,\n  isNonTerminal,\n  map,\n  onlyDefinedKey,\n  printClassType,\n  printList,\n  printSingle,\n  type JavaNodePrinters\n} from \"./helpers.js\";\n\nconst { group, indent, join, line, softline } = builders;\n\nexport default {\n  primitiveType(path, print) {\n    const { children } = path.node;\n    const typeKey = onlyDefinedKey(children, [\"Boolean\", \"numericType\"]);\n    return join(\" \", [\n      ...map(path, print, \"annotation\"),\n      call(path, print, typeKey)\n    ]);\n  },\n\n  numericType: printSingle,\n  integralType: printSingle,\n  floatingPointType: printSingle,\n\n  referenceType(path, print) {\n    const { children } = path.node;\n    const typeKey = onlyDefinedKey(children, [\n      \"primitiveType\",\n      \"classOrInterfaceType\"\n    ]);\n    const type = call(path, print, typeKey);\n    return join(\" \", [\n      ...map(path, print, \"annotation\"),\n      children.dims ? [type, call(path, print, \"dims\")] : type\n    ]);\n  },\n\n  classOrInterfaceType: printSingle,\n  classType: printClassType,\n  interfaceType: printSingle,\n\n  typeVariable(path, print) {\n    return join(\" \", [\n      ...map(path, print, \"annotation\"),\n      call(path, print, \"Identifier\")\n    ]);\n  },\n\n  dims(path, print) {\n    return flatMap(\n      path,\n      childPath => {\n        const child = print(childPath);\n        return isNonTerminal(childPath.node) ? [child, \" \"] : child;\n      },\n      definedKeys(path.node.children, [\"annotation\", \"LSquare\", \"RSquare\"])\n    );\n  },\n\n  typeParameter(path, print) {\n    const parameter = [\n      ...map(path, print, \"typeParameterModifier\"),\n      call(path, print, \"typeIdentifier\")\n    ];\n    if (path.node.children.typeBound) {\n      parameter.push(call(path, print, \"typeBound\"));\n    }\n    return join(\" \", parameter);\n  },\n\n  typeParameterModifier: printSingle,\n\n  typeBound(path, print) {\n    const bound = [\"extends \", call(path, print, \"classOrInterfaceType\")];\n    if (path.node.children.additionalBound) {\n      bound.push(\n        group(\n          indent([line, ...join(line, map(path, print, \"additionalBound\"))])\n        )\n      );\n    }\n    return bound;\n  },\n\n  additionalBound(path, print) {\n    return [\"& \", call(path, print, \"interfaceType\")];\n  },\n\n  typeArguments(path, print) {\n    return group([\n      \"<\",\n      indent([softline, call(path, print, \"typeArgumentList\")]),\n      softline,\n      \">\"\n    ]);\n  },\n\n  typeArgumentList(path, print) {\n    return printList(path, print, \"typeArgument\");\n  },\n\n  typeArgument: printSingle,\n\n  wildcard(path, print) {\n    const wildcard = [...map(path, print, \"annotation\"), \"?\"];\n    if (path.node.children.wildcardBounds) {\n      wildcard.push(call(path, print, \"wildcardBounds\"));\n    }\n    return join(\" \", wildcard);\n  },\n\n  wildcardBounds(path, print) {\n    return [\n      path.node.children.Extends ? \"extends\" : \"super\",\n      \" \",\n      call(path, print, \"referenceType\")\n    ];\n  }\n} satisfies Partial<JavaNodePrinters>;\n","import arrays from \"./arrays.js\";\nimport blocksAndStatements from \"./blocks-and-statements.js\";\nimport classes from \"./classes.js\";\nimport expressions from \"./expressions.js\";\nimport type { JavaNodePrinter, JavaNodePrinters } from \"./helpers.js\";\nimport interfaces from \"./interfaces.js\";\nimport lexicalStructure from \"./lexical-structure.js\";\nimport names from \"./names.js\";\nimport packagesAndModules from \"./packages-and-modules.js\";\nimport typesValuesAndVariables from \"./types-values-and-variables.js\";\n\nconst printersByNodeType: JavaNodePrinters = {\n  ...arrays,\n  ...blocksAndStatements,\n  ...classes,\n  ...expressions,\n  ...interfaces,\n  ...lexicalStructure,\n  ...names,\n  ...packagesAndModules,\n  ...typesValuesAndVariables\n};\n\nexport function printerForNodeType<T extends keyof JavaNodePrinters>(\n  type: T\n): JavaNodePrinter<T> {\n  return printersByNodeType[type];\n}\n","import type { AstPath, Printer } from \"prettier\";\nimport {\n  canAttachComment,\n  handleLineComment,\n  handleRemainingComment,\n  isFullyBetweenPrettierIgnore\n} from \"./comments.js\";\nimport {\n  isNonTerminal,\n  isTerminal,\n  printComment,\n  type JavaNode,\n  type JavaTerminal\n} from \"./printers/helpers.js\";\nimport { printerForNodeType } from \"./printers/index.js\";\n\nexport default {\n  print(path: DistributedAstPath<JavaNode>, options, print, args) {\n    return hasTerminal(path)\n      ? path.node.image\n      : printerForNodeType(path.node.name)(path, print, options, args);\n  },\n  hasPrettierIgnore(path) {\n    const { node } = path;\n    return (\n      node.comments?.some(({ image }) =>\n        /^(\\/\\/\\s*prettier-ignore|\\/\\*\\s*prettier-ignore\\s*\\*\\/)$/.test(image)\n      ) === true ||\n      (canAttachComment(node) && isFullyBetweenPrettierIgnore(path))\n    );\n  },\n  canAttachComment,\n  isBlockComment(node) {\n    return isTerminal(node) && node.tokenType.name === \"TraditionalComment\";\n  },\n  printComment(commentPath) {\n    const { node } = commentPath;\n    if (isNonTerminal(node) || node.tokenType.GROUP !== \"comments\") {\n      throw new Error(`Not a comment: ${JSON.stringify(node)}`);\n    }\n    return printComment(node);\n  },\n  getCommentChildNodes(node) {\n    return isNonTerminal(node)\n      ? Object.values(node.children).flatMap(child => child)\n      : [];\n  },\n  handleComments: {\n    ownLine: handleLineComment,\n    endOfLine: handleLineComment,\n    remaining: handleRemainingComment\n  }\n} satisfies Printer<JavaNode>;\n\nfunction hasTerminal(path: AstPath<JavaNode>): path is AstPath<JavaTerminal> {\n  return isTerminal(path.node);\n}\n\ntype DistributedAstPath<T> = T extends any ? AstPath<T> : never;\n","import type { Plugin } from \"prettier\";\nimport options from \"./options.js\";\nimport parser from \"./parser.js\";\nimport printer from \"./printer.js\";\nimport type { JavaNode } from \"./printers/helpers.js\";\n\nexport default {\n  languages: [\n    {\n      name: \"Java\",\n      parsers: [\"java\"],\n      group: \"Java\",\n      tmScope: \"source.java\",\n      aceMode: \"java\",\n      codemirrorMode: \"clike\",\n      codemirrorMimeType: \"text/x-java\",\n      extensions: [\".java\"],\n      linguistLanguageId: 181,\n      vscodeLanguageIds: [\"java\"]\n    }\n  ],\n  parsers: {\n    java: parser\n  },\n  printers: {\n    java: printer\n  },\n  options,\n  defaultOptions: {\n    arrowParens: \"avoid\"\n  }\n} satisfies Plugin<JavaNode>;\n"],"x_google_ignoreList":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,312,313,314],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,sBAAe;CACb,YAAY;EACV,MAAM;EACN,UAAU;EACV,SAAS;EAET,SAAS;GACP;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAAS,aAAa;IAAI;GACnC;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAqC,aAAa;IAAI;GAC/D;IAAE,OAAO;IAA4B,aAAa;IAAI;GACtD;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAAwC,aAAa;IAAI;GAClE;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAA6B,aAAa;IAAI;GACvD;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAA6B,aAAa;IAAI;GACvD;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAY,aAAa;IAAI;GACtC;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAA4C,aAAa;IAAI;GACtE;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAA6B,aAAa;IAAI;GACvD;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAU,aAAa;IAAI;GACpC;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAgC,aAAa;IAAI;GAC1D;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAU,aAAa;IAAI;GACpC;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAiC,aAAa;IAAI;GAC3D;IAAE,OAAO;IAA4C,aAAa;IAAI;GACtE;IAAE,OAAO;IAA0C,aAAa;IAAI;GACpE;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAY,aAAa;IAAI;GACtC;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAgC,aAAa;IAAI;GAC1D;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAiC,aAAa;IAAI;GAC3D;IAAE,OAAO;IAAU,aAAa;IAAI;GACpC;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAA8B,aAAa;IAAI;GACxD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAA8B,aAAa;IAAI;GACxD;IAAE,OAAO;IAA6B,aAAa;IAAI;GACvD;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAA+B,aAAa;IAAI;GACzD;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAA+B,aAAa;IAAI;GACzD;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAA8C,aAAa;IAAI;GACxE;IAAE,OAAO;IAAqC,aAAa;IAAI;GAC/D;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IACE,OAAO;IACP,aAAa;IACd;GACD;IAAE,OAAO;IAAsC,aAAa;IAAI;GAChE;IAAE,OAAO;IAAY,aAAa;IAAI;GACtC;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAY,aAAa;IAAI;GACtC;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAS,aAAa;IAAI;GACnC;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAA8B,aAAa;IAAI;GACxD;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAA8B,aAAa;IAAI;GACxD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAA8B,aAAa;IAAI;GACxD;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAAkC,aAAa;IAAI;GAC5D;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAAwC,aAAa;IAAI;GAClE;IAAE,OAAO;IAAyC,aAAa;IAAI;GACnE;IAAE,OAAO;IAAsC,aAAa;IAAI;GAChE;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAgC,aAAa;IAAI;GAC1D;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAW,aAAa;IAAI;GACrC;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAY,aAAa;IAAI;GACtC;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC5C;IAAE,OAAO;IAAc,aAAa;IAAI;GACxC;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAsB,aAAa;IAAI;GAChD;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAA0B,aAAa;IAAI;GACpD;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAuB,aAAa;IAAI;GACjD;IAAE,OAAO;IAA2B,aAAa;IAAI;GACrD;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAe,aAAa;IAAI;GACzC;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAqB,aAAa;IAAI;GAC/C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAwB,aAAa;IAAI;GAClD;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAQ,aAAa;IAAI;GAClC;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAyB,aAAa;IAAI;GACnD;IAAE,OAAO;IAAa,aAAa;IAAI;GACvC;IAAE,OAAO;IAAmB,aAAa;IAAI;GAC7C;IAAE,OAAO;IAAiB,aAAa;IAAI;GAC3C;IAAE,OAAO;IAAoB,aAAa;IAAI;GAC9C;IAAE,OAAO;IAAgB,aAAa;IAAI;GAC1C;IAAE,OAAO;IAAY,aAAa;IAAI;GACtC;IAAE,OAAO;IAAkB,aAAa;IAAI;GAC7C;EACD,aACE;EACH;CACD,aAAa;EACX,MAAM;EACN,UAAU;EACV,SAAS;EACT,SAAS,CACP;GAAE,OAAO;GAAU,aAAa;GAAI,EACpC;GAAE,OAAO;GAAS,aAAa;GAAI,CACpC;EACD,aAAa;EACd;CACD,eAAe;EACb,MAAM;EACN,UAAU;EACV,SAAS;EACT,SAAS;GACP;IAAE,OAAO;IAAO,aAAa;IAAI;GACjC;IAAE,OAAO;IAAO,aAAa;IAAI;GACjC;IAAE,OAAO;IAAQ,aAAa;IAAI;GACnC;EACD,aAAa;EACd;CACD,8BAA8B;EAC5B,MAAM;EACN,UAAU;EACV,SAAS;EACT,SAAS,CACP;GAAE,OAAO;GAAS,aAAa;GAAI,EACnC;GAAE,OAAO;GAAO,aAAa;GAAI,CAClC;EACD,aAAa;EACd;CACF;;;;;AC7RD,IAAI,aAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU;AAEpF,0BAAe;;;;;ACAf,IAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;;AAG5E,IAAI,OAAOA,uBAAc,YAAY,SAAS,cAAc,EAAE;AAE9D,oBAAe;;;;;ACLf,IAAIC,WAASC,cAAK;AAElB,sBAAeD;;;;;ACFf,IAAIE,gBAAc,OAAO;;AAGzB,IAAIC,oBAAiBD,cAAY;;;;;;AAOjC,IAAIE,yBAAuBF,cAAY;;AAGvC,IAAIG,mBAAiBC,kBAASA,gBAAO,cAAc;;;;;;;;AASnD,SAAS,UAAU,OAAO;CACxB,IAAI,QAAQH,kBAAe,KAAK,OAAOE,iBAAe,EAClD,MAAM,MAAMA;AAEhB,KAAI;AACF,QAAMA,oBAAkB;EACxB,IAAI,WAAW;UACR,GAAG;CAEZ,IAAI,SAASD,uBAAqB,KAAK,MAAM;AAC7C,KAAI,SACF,KAAI,MACF,OAAMC,oBAAkB;KAExB,QAAO,MAAMA;AAGjB,QAAO;;AAGT,yBAAe;;;;;;;;;ACrCf,IAAI,uBAPc,OAAO,UAOc;;;;;;;;AASvC,SAAS,eAAe,OAAO;AAC7B,QAAO,qBAAqB,KAAK,MAAM;;AAGzC,8BAAe;;;;;AChBf,IAAI,UAAU,iBACV,eAAe;;AAGnB,IAAI,iBAAiBE,kBAASA,gBAAO,cAAc;;;;;;;;AASnD,SAAS,WAAW,OAAO;AACzB,KAAI,SAAS,KACX,QAAO,UAAU,SAAY,eAAe;AAE9C,QAAQ,kBAAkB,kBAAkB,OAAO,MAAM,GACrDC,mBAAU,MAAM,GAChBC,wBAAe,MAAM;;AAG3B,0BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACHf,SAAS,aAAa,OAAO;AAC3B,QAAO,SAAS,QAAQ,OAAO,SAAS;;AAG1C,2BAAe;;;;;ACxBf,IAAIC,cAAY;;;;;;;;;;;;;;;;;;AAmBhB,SAAS,SAAS,OAAO;AACvB,QAAO,OAAO,SAAS,YACpBC,qBAAa,MAAM,IAAIC,oBAAW,MAAM,IAAIF;;AAGjD,uBAAe;;;;;;;;;;;;;ACnBf,SAAS,SAAS,OAAO,UAAU;CACjC,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,SAAS,MAAM,OAAO;AAE1B,QAAO,EAAE,QAAQ,OACf,QAAO,SAAS,SAAS,MAAM,QAAQ,OAAO,MAAM;AAEtD,QAAO;;AAGT,wBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;ACGf,IAAI,UAAU,MAAM;AAEpB,sBAAe;;;;;ACnBf,IAAIG,aAAW;;AAGf,IAAIC,gBAAcC,kBAASA,gBAAO,YAAY,QAC1C,iBAAiBD,gBAAcA,cAAY,WAAW;;;;;;;;;AAU1D,SAAS,aAAa,OAAO;AAE3B,KAAI,OAAO,SAAS,SAClB,QAAO;AAET,KAAIE,gBAAQ,MAAM,CAEhB,QAAOC,kBAAS,OAAO,aAAa,GAAG;AAEzC,KAAIC,iBAAS,MAAM,CACjB,QAAO,iBAAiB,eAAe,KAAK,MAAM,GAAG;CAEvD,IAAI,SAAU,QAAQ;AACtB,QAAQ,UAAU,OAAQ,IAAI,SAAU,CAACL,aAAY,OAAO;;AAG9D,4BAAe;;;;;ACnCf,IAAI,eAAe;;;;;;;;;AAUnB,SAAS,gBAAgB,QAAQ;CAC/B,IAAI,QAAQ,OAAO;AAEnB,QAAO,WAAW,aAAa,KAAK,OAAO,OAAO,MAAM,CAAC;AACzD,QAAO;;AAGT,+BAAe;;;;;ACff,IAAI,cAAc;;;;;;;;AASlB,SAAS,SAAS,QAAQ;AACxB,QAAO,SACH,OAAO,MAAM,GAAGM,yBAAgB,OAAO,GAAG,EAAE,CAAC,QAAQ,aAAa,GAAG,GACrE;;AAGN,wBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACOf,SAAS,SAAS,OAAO;CACvB,IAAI,OAAO,OAAO;AAClB,QAAO,SAAS,SAAS,QAAQ,YAAY,QAAQ;;AAGvD,uBAAe;;;;;ACzBf,IAAI,MAAM;;AAGV,IAAI,aAAa;;AAGjB,IAAI,aAAa;;AAGjB,IAAI,YAAY;;AAGhB,IAAI,eAAe;;;;;;;;;;;;;;;;;;;;;;;;AAyBnB,SAAS,SAAS,OAAO;AACvB,KAAI,OAAO,SAAS,SAClB,QAAO;AAET,KAAIC,iBAAS,MAAM,CACjB,QAAO;AAET,KAAIC,iBAAS,MAAM,EAAE;EACnB,IAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,SAAS,GAAG;AACnE,UAAQA,iBAAS,MAAM,GAAI,QAAQ,KAAM;;AAE3C,KAAI,OAAO,SAAS,SAClB,QAAO,UAAU,IAAI,QAAQ,CAAC;AAEhC,SAAQC,kBAAS,MAAM;CACvB,IAAI,WAAW,WAAW,KAAK,MAAM;AACrC,QAAQ,YAAY,UAAU,KAAK,MAAM,GACrC,aAAa,MAAM,MAAM,EAAE,EAAE,WAAW,IAAI,EAAE,GAC7C,WAAW,KAAK,MAAM,GAAG,MAAM,CAAC;;AAGvC,uBAAe;;;;;AC5Df,IAAIC,aAAW,UACX,cAAc;;;;;;;;;;;;;;;;;;;;;;;;AAyBlB,SAAS,SAAS,OAAO;AACvB,KAAI,CAAC,MACH,QAAO,UAAU,IAAI,QAAQ;AAE/B,SAAQC,iBAAS,MAAM;AACvB,KAAI,UAAUD,cAAY,UAAU,CAACA,WAEnC,SADY,QAAQ,IAAI,KAAK,KACf;AAEhB,QAAO,UAAU,QAAQ,QAAQ;;AAGnC,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACbf,SAAS,UAAU,OAAO;CACxB,IAAI,SAASE,iBAAS,MAAM,EACxB,YAAY,SAAS;AAEzB,QAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;;AAGzE,wBAAe;;;;;;;;;;;;;;;;;;;;ACnBf,SAAS,SAAS,OAAO;AACvB,QAAO;;AAGT,uBAAe;;;;;AChBf,IAAI,WAAW,0BACXC,YAAU,qBACVC,WAAS,8BACT,WAAW;;;;;;;;;;;;;;;;;;AAmBf,SAAS,WAAW,OAAO;AACzB,KAAI,CAACC,iBAAS,MAAM,CAClB,QAAO;CAIT,IAAI,MAAMC,oBAAW,MAAM;AAC3B,QAAO,OAAOH,aAAW,OAAOC,YAAU,OAAO,YAAY,OAAO;;AAGtE,yBAAe;;;;;ACjCf,IAAI,aAAaG,cAAK;AAEtB,0BAAe;;;;;ACFf,IAAI,aAAc,WAAW;CAC3B,IAAI,MAAM,SAAS,KAAKC,uBAAcA,oBAAW,QAAQA,oBAAW,KAAK,YAAY,GAAG;AACxF,QAAO,MAAO,mBAAmB,MAAO;GACvC;;;;;;;;AASH,SAAS,SAAS,MAAM;AACtB,QAAO,CAAC,CAAC,cAAe,cAAc;;AAGxC,wBAAe;;;;;ACff,IAAIC,iBAHY,SAAS,UAGI;;;;;;;;AAS7B,SAAS,SAAS,MAAM;AACtB,KAAI,QAAQ,MAAM;AAChB,MAAI;AACF,UAAOA,eAAa,KAAK,KAAK;WACvB,GAAG;AACZ,MAAI;AACF,UAAQ,OAAO;WACR,GAAG;;AAEd,QAAO;;AAGT,wBAAe;;;;;;;;AChBf,IAAI,eAAe;;AAGnB,IAAI,eAAe;;AAGnB,IAAI,YAAY,SAAS,WACrBC,gBAAc,OAAO;;AAGzB,IAAI,eAAe,UAAU;;AAG7B,IAAIC,oBAAiBD,cAAY;;AAGjC,IAAI,aAAa,OAAO,MACtB,aAAa,KAAKC,kBAAe,CAAC,QAAQ,cAAc,OAAO,CAC9D,QAAQ,0DAA0D,QAAQ,GAAG,IAC/E;;;;;;;;;AAUD,SAAS,aAAa,OAAO;AAC3B,KAAI,CAACC,iBAAS,MAAM,IAAIC,kBAAS,MAAM,CACrC,QAAO;AAGT,SADcC,mBAAW,MAAM,GAAG,aAAa,cAChC,KAAKC,kBAAS,MAAM,CAAC;;AAGtC,4BAAe;;;;;;;;;;;;ACtCf,SAAS,SAAS,QAAQ,KAAK;AAC7B,QAAO,UAAU,OAAO,SAAY,OAAO;;AAG7C,wBAAe;;;;;;;;;;;;ACDf,SAAS,UAAU,QAAQ,KAAK;CAC9B,IAAI,QAAQC,kBAAS,QAAQ,IAAI;AACjC,QAAOC,sBAAa,MAAM,GAAG,QAAQ;;AAGvC,yBAAe;;;;ACZf,IAAIC,YAAUC,mBAAUC,eAAM,UAAU;AAExC,uBAAeF;;;;;ACHf,IAAI,eAAe,OAAO;;;;;;;;;AAU1B,IAAI,aAAc,WAAW;CAC3B,SAAS,SAAS;AAClB,QAAO,SAAS,OAAO;AACrB,MAAI,CAACG,iBAAS,MAAM,CAClB,QAAO,EAAE;AAEX,MAAI,aACF,QAAO,aAAa,MAAM;AAE5B,SAAO,YAAY;EACnB,IAAI,SAAS,IAAI,QAAM;AACvB,SAAO,YAAY;AACnB,SAAO;;GAER;AAEH,0BAAe;;;;;;;;;;;;;;ACnBf,SAAS,MAAM,MAAM,SAAS,MAAM;AAClC,SAAQ,KAAK,QAAb;EACE,KAAK,EAAG,QAAO,KAAK,KAAK,QAAQ;EACjC,KAAK,EAAG,QAAO,KAAK,KAAK,SAAS,KAAK,GAAG;EAC1C,KAAK,EAAG,QAAO,KAAK,KAAK,SAAS,KAAK,IAAI,KAAK,GAAG;EACnD,KAAK,EAAG,QAAO,KAAK,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;;AAE9D,QAAO,KAAK,MAAM,SAAS,KAAK;;AAGlC,qBAAe;;;;;;;;;;;;;;;;ACRf,SAAS,OAAO;AAIhB,mBAAe;;;;;;;;;;;;ACRf,SAAS,UAAU,QAAQ,OAAO;CAChC,IAAI,QAAQ,IACR,SAAS,OAAO;AAEpB,WAAU,QAAQ,MAAM,OAAO;AAC/B,QAAO,EAAE,QAAQ,OACf,OAAM,SAAS,OAAO;AAExB,QAAO;;AAGT,yBAAe;;;;;AClBf,IAAI,YAAY,KACZ,WAAW;AAGf,IAAI,YAAY,KAAK;;;;;;;;;;AAWrB,SAAS,SAAS,MAAM;CACtB,IAAI,QAAQ,GACR,aAAa;AAEjB,QAAO,WAAW;EAChB,IAAI,QAAQ,WAAW,EACnB,YAAY,YAAY,QAAQ;AAEpC,eAAa;AACb,MAAI,YAAY,GACd;OAAI,EAAE,SAAS,UACb,QAAO,UAAU;QAGnB,SAAQ;AAEV,SAAO,KAAK,MAAM,QAAW,UAAU;;;AAI3C,wBAAe;;;;;;;;;;;;;;;;;;;;;;;ACjBf,SAAS,SAAS,OAAO;AACvB,QAAO,WAAW;AAChB,SAAO;;;AAIX,uBAAe;;;;ACvBf,IAAI,iBAAkB,WAAW;AAC/B,KAAI;EACF,IAAI,OAAOC,mBAAU,QAAQ,iBAAiB;AAC9C,OAAK,EAAE,EAAE,IAAI,EAAE,CAAC;AAChB,SAAO;UACA,GAAG;GACX;AAEH,8BAAe;;;;;;;;;;;;ACEf,IAAI,kBAAkB,CAACC,0BAAiBC,mBAAW,SAAS,MAAM,QAAQ;AACxE,QAAOD,wBAAe,MAAM,YAAY;EACtC,gBAAgB;EAChB,cAAc;EACd,SAASE,iBAAS,OAAO;EACzB,YAAY;EACb,CAAC;;AAGJ,+BAAe;;;;;;;;;;;;ACVf,IAAI,cAAcC,kBAASC,yBAAgB;AAE3C,2BAAe;;;;;;;;;;;;;ACJf,SAAS,UAAU,OAAO,UAAU;CAClC,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,QAAO,EAAE,QAAQ,OACf,KAAI,SAAS,MAAM,QAAQ,OAAO,MAAM,KAAK,MAC3C;AAGJ,QAAO;;AAGT,yBAAe;;;;;;;;;;;;;;;ACVf,SAAS,cAAc,OAAO,WAAW,WAAW,WAAW;CAC7D,IAAI,SAAS,MAAM,QACf,QAAQ,aAAa,YAAY,IAAI;AAEzC,QAAQ,YAAY,UAAU,EAAE,QAAQ,OACtC,KAAI,UAAU,MAAM,QAAQ,OAAO,MAAM,CACvC,QAAO;AAGX,QAAO;;AAGT,6BAAe;;;;;;;;;;;AChBf,SAAS,UAAU,OAAO;AACxB,QAAO,UAAU;;AAGnB,yBAAe;;;;;;;;;;;;;;ACDf,SAAS,cAAc,OAAO,OAAO,WAAW;CAC9C,IAAI,QAAQ,YAAY,GACpB,SAAS,MAAM;AAEnB,QAAO,EAAE,QAAQ,OACf,KAAI,MAAM,WAAW,MACnB,QAAO;AAGX,QAAO;;AAGT,6BAAe;;;;;;;;;;;;;ACTf,SAAS,YAAY,OAAO,OAAO,WAAW;AAC5C,QAAO,UAAU,QACbC,uBAAc,OAAO,OAAO,UAAU,GACtCC,uBAAc,OAAOC,oBAAW,UAAU;;AAGhD,2BAAe;;;;;;;;;;;;;ACRf,SAAS,cAAc,OAAO,OAAO;AAEnC,QAAO,CAAC,EADK,SAAS,OAAO,IAAI,MAAM,WACpBC,qBAAY,OAAO,OAAO,EAAE,GAAG;;AAGpD,6BAAe;;;;;ACff,IAAIC,qBAAmB;;AAGvB,IAAI,WAAW;;;;;;;;;AAUf,SAAS,QAAQ,OAAO,QAAQ;CAC9B,IAAI,OAAO,OAAO;AAClB,UAAS,UAAU,OAAOA,qBAAmB;AAE7C,QAAO,CAAC,CAAC,WACN,QAAQ,YACN,QAAQ,YAAY,SAAS,KAAK,MAAM,KACtC,QAAQ,MAAM,QAAQ,KAAK,KAAK,QAAQ;;AAGjD,uBAAe;;;;;;;;;;;;;ACbf,SAAS,gBAAgB,QAAQ,KAAK,OAAO;AAC3C,KAAI,OAAO,eAAeC,wBACxB,yBAAe,QAAQ,KAAK;EAC1B,gBAAgB;EAChB,cAAc;EACd,SAAS;EACT,YAAY;EACb,CAAC;KAEF,QAAO,OAAO;;AAIlB,+BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACQf,SAAS,GAAG,OAAO,OAAO;AACxB,QAAO,UAAU,SAAU,UAAU,SAAS,UAAU;;AAG1D,iBAAe;;;;;AC7Bf,IAAIC,oBAHc,OAAO,UAGQ;;;;;;;;;;;AAYjC,SAAS,YAAY,QAAQ,KAAK,OAAO;CACvC,IAAI,WAAW,OAAO;AACtB,KAAI,EAAEA,kBAAe,KAAK,QAAQ,IAAI,IAAIC,WAAG,UAAU,MAAM,KACxD,UAAU,UAAa,EAAE,OAAO,QACnC,0BAAgB,QAAQ,KAAK,MAAM;;AAIvC,2BAAe;;;;;;;;;;;;;;ACdf,SAAS,WAAW,QAAQ,OAAO,QAAQ,YAAY;CACrD,IAAI,QAAQ,CAAC;AACb,YAAW,SAAS,EAAE;CAEtB,IAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,MAAM,MAAM;EAEhB,IAAI,WAAW,aACX,WAAW,OAAO,MAAM,OAAO,MAAM,KAAK,QAAQ,OAAO,GACzD;AAEJ,MAAI,aAAa,OACf,YAAW,OAAO;AAEpB,MAAI,MACF,0BAAgB,QAAQ,KAAK,SAAS;MAEtC,sBAAY,QAAQ,KAAK,SAAS;;AAGtC,QAAO;;AAGT,0BAAe;;;;ACpCf,IAAIC,cAAY,KAAK;;;;;;;;;;AAWrB,SAAS,SAAS,MAAM,OAAO,WAAW;AACxC,SAAQA,YAAU,UAAU,SAAa,KAAK,SAAS,IAAK,OAAO,EAAE;AACrE,QAAO,WAAW;EAChB,IAAI,OAAO,WACP,QAAQ,IACR,SAASA,YAAU,KAAK,SAAS,OAAO,EAAE,EAC1C,QAAQ,MAAM,OAAO;AAEzB,SAAO,EAAE,QAAQ,OACf,OAAM,SAAS,KAAK,QAAQ;AAE9B,UAAQ;EACR,IAAI,YAAY,MAAM,QAAQ,EAAE;AAChC,SAAO,EAAE,QAAQ,MACf,WAAU,SAAS,KAAK;AAE1B,YAAU,SAAS,UAAU,MAAM;AACnC,SAAOC,eAAM,MAAM,MAAM,UAAU;;;AAIvC,wBAAe;;;;;;;;;;;;ACvBf,SAAS,SAAS,MAAM,OAAO;AAC7B,QAAOC,qBAAYC,kBAAS,MAAM,OAAOC,iBAAS,EAAE,OAAO,GAAG;;AAGhE,wBAAe;;;;;ACff,IAAI,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BvB,SAAS,SAAS,OAAO;AACvB,QAAO,OAAO,SAAS,YACrB,QAAQ,MAAM,QAAQ,KAAK,KAAK,SAAS;;AAG7C,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACNf,SAAS,YAAY,OAAO;AAC1B,QAAO,SAAS,QAAQC,iBAAS,MAAM,OAAO,IAAI,CAACC,mBAAW,MAAM;;AAGtE,0BAAe;;;;;;;;;;;;;;ACjBf,SAAS,eAAe,OAAO,OAAO,QAAQ;AAC5C,KAAI,CAACC,iBAAS,OAAO,CACnB,QAAO;CAET,IAAI,OAAO,OAAO;AAClB,KAAI,QAAQ,WACHC,oBAAY,OAAO,IAAIC,iBAAQ,OAAO,OAAO,OAAO,GACpD,QAAQ,YAAY,SAAS,OAEpC,QAAOC,WAAG,OAAO,QAAQ,MAAM;AAEjC,QAAO;;AAGT,8BAAe;;;;;;;;;;;ACnBf,SAAS,eAAe,UAAU;AAChC,QAAOC,kBAAS,SAAS,QAAQ,SAAS;EACxC,IAAI,QAAQ,IACR,SAAS,QAAQ,QACjB,aAAa,SAAS,IAAI,QAAQ,SAAS,KAAK,QAChD,QAAQ,SAAS,IAAI,QAAQ,KAAK;AAEtC,eAAc,SAAS,SAAS,KAAK,OAAO,cAAc,cACrD,UAAU,cACX;AAEJ,MAAI,SAASC,wBAAe,QAAQ,IAAI,QAAQ,IAAI,MAAM,EAAE;AAC1D,gBAAa,SAAS,IAAI,SAAY;AACtC,YAAS;;AAEX,WAAS,OAAO,OAAO;AACvB,SAAO,EAAE,QAAQ,QAAQ;GACvB,IAAI,SAAS,QAAQ;AACrB,OAAI,OACF,UAAS,QAAQ,QAAQ,OAAO,WAAW;;AAG/C,SAAO;GACP;;AAGJ,8BAAe;;;;;ACnCf,IAAIC,gBAAc,OAAO;;;;;;;;AASzB,SAAS,YAAY,OAAO;CAC1B,IAAI,OAAO,SAAS,MAAM;AAG1B,QAAO,WAFM,OAAO,QAAQ,cAAc,KAAK,aAAcA;;AAK/D,2BAAe;;;;;;;;;;;;;ACRf,SAAS,UAAU,GAAG,UAAU;CAC9B,IAAI,QAAQ,IACR,SAAS,MAAM,EAAE;AAErB,QAAO,EAAE,QAAQ,EACf,QAAO,SAAS,SAAS,MAAM;AAEjC,QAAO;;AAGT,yBAAe;;;;;ACff,IAAIC,YAAU;;;;;;;;AASd,SAAS,gBAAgB,OAAO;AAC9B,QAAOC,qBAAa,MAAM,IAAIC,oBAAW,MAAM,IAAIF;;AAGrD,+BAAe;;;;;ACbf,IAAIG,gBAAc,OAAO;;AAGzB,IAAIC,oBAAiBD,cAAY;;AAGjC,IAAIE,yBAAuBF,cAAY;;;;;;;;;;;;;;;;;;;AAoBvC,IAAI,cAAcG,yBAAgB,WAAW;AAAE,QAAO;GAAc,CAAC,GAAGA,2BAAkB,SAAS,OAAO;AACxG,QAAOC,qBAAa,MAAM,IAAIH,kBAAe,KAAK,OAAO,SAAS,IAChE,CAACC,uBAAqB,KAAK,OAAO,SAAS;;AAG/C,0BAAe;;;;;;;;;;;;;;;;;ACtBf,SAAS,YAAY;AACnB,QAAO;;AAGT,wBAAe;;;;;ACbf,IAAIG,gBAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;;AAGhF,IAAIC,eAAaD,iBAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;;AAM3F,IAAIE,WAHgBD,gBAAcA,aAAW,YAAYD,gBAG5BG,cAAK,SAAS;;;;;;;;;;;;;;;;;;AAsB3C,IAAI,YAnBiBD,WAASA,SAAO,WAAW,WAmBfE;AAEjC,uBAAe;;;;;AChCf,IAAIC,YAAU,sBACVC,aAAW,kBACXC,YAAU,oBACVC,YAAU,iBACVC,aAAW,kBACXC,YAAU,qBACVC,WAAS,gBACTC,cAAY,mBACZC,cAAY,mBACZC,cAAY,mBACZC,WAAS,gBACTC,cAAY,mBACZC,eAAa;AAEjB,IAAIC,mBAAiB,wBACjBC,gBAAc,qBACdC,eAAa,yBACbC,eAAa,yBACbC,YAAU,sBACVC,aAAW,uBACXC,aAAW,uBACXC,aAAW,uBACXC,oBAAkB,8BAClBC,cAAY,wBACZC,cAAY;;AAGhB,IAAI,iBAAiB,EAAE;AACvB,eAAeR,gBAAc,eAAeC,gBAC5C,eAAeC,aAAW,eAAeC,cACzC,eAAeC,cAAY,eAAeC,cAC1C,eAAeC,qBAAmB,eAAeC,eACjD,eAAeC,eAAa;AAC5B,eAAevB,aAAW,eAAeC,cACzC,eAAeY,oBAAkB,eAAeX,aAChD,eAAeY,iBAAe,eAAeX,aAC7C,eAAeC,cAAY,eAAeC,aAC1C,eAAeC,YAAU,eAAeC,eACxC,eAAeC,eAAa,eAAeC,eAC3C,eAAeC,YAAU,eAAeC,eACxC,eAAeC,gBAAc;;;;;;;;AAS7B,SAAS,iBAAiB,OAAO;AAC/B,QAAOY,qBAAa,MAAM,IACxBC,iBAAS,MAAM,OAAO,IAAI,CAAC,CAAC,eAAeC,oBAAW,MAAM;;AAGhE,gCAAe;;;;;;;;;;;ACpDf,SAAS,UAAU,MAAM;AACvB,QAAO,SAAS,OAAO;AACrB,SAAO,KAAK,MAAM;;;AAItB,yBAAe;;;;;ACVf,IAAIC,gBAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;;AAGhF,IAAIC,eAAaD,iBAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;;AAM3F,IAAI,cAHgBC,gBAAcA,aAAW,YAAYD,iBAGtBE,oBAAW;;AAG9C,IAAI,WAAY,WAAW;AACzB,KAAI;EAEF,IAAI,QAAQD,gBAAcA,aAAW,WAAWA,aAAW,QAAQ,OAAO,CAAC;AAE3E,MAAI,MACF,QAAO;AAIT,SAAO,eAAe,YAAY,WAAW,YAAY,QAAQ,OAAO;UACjE,GAAG;GACX;AAEH,wBAAe;;;;ACxBf,IAAI,mBAAmBE,qBAAYA,kBAAS;;;;;;;;;;;;;;;;;;AAmB5C,IAAI,eAAe,mBAAmBC,mBAAU,iBAAiB,GAAGC;AAEpE,2BAAe;;;;;ACff,IAAIC,oBAHc,OAAO,UAGQ;;;;;;;;;AAUjC,SAAS,cAAc,OAAO,WAAW;CACvC,IAAI,QAAQC,gBAAQ,MAAM,EACtB,QAAQ,CAAC,SAASC,oBAAY,MAAM,EACpC,SAAS,CAAC,SAAS,CAAC,SAASC,iBAAS,MAAM,EAC5C,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,UAAUC,qBAAa,MAAM,EAC3D,cAAc,SAAS,SAAS,UAAU,QAC1C,SAAS,cAAcC,mBAAU,MAAM,QAAQ,OAAO,GAAG,EAAE,EAC3D,SAAS,OAAO;AAEpB,MAAK,IAAI,OAAO,MACd,MAAK,aAAaL,kBAAe,KAAK,OAAO,IAAI,KAC7C,EAAE,gBAEC,OAAO,YAEN,WAAW,OAAO,YAAY,OAAO,aAErC,WAAW,OAAO,YAAY,OAAO,gBAAgB,OAAO,iBAE7DM,iBAAQ,KAAK,OAAO,GAEzB,QAAO,KAAK,IAAI;AAGpB,QAAO;;AAGT,6BAAe;;;;;;;;;;;;ACxCf,SAAS,QAAQ,MAAM,WAAW;AAChC,QAAO,SAAS,KAAK;AACnB,SAAO,KAAK,UAAU,IAAI,CAAC;;;AAI/B,uBAAe;;;;ACXf,IAAI,aAAaC,iBAAQ,OAAO,MAAM,OAAO;AAE7C,0BAAe;;;;;ACEf,IAAIC,oBAHc,OAAO,UAGQ;;;;;;;;AASjC,SAAS,SAAS,QAAQ;AACxB,KAAI,CAACC,qBAAY,OAAO,CACtB,QAAOC,oBAAW,OAAO;CAE3B,IAAI,SAAS,EAAE;AACf,MAAK,IAAI,OAAO,OAAO,OAAO,CAC5B,KAAIF,kBAAe,KAAK,QAAQ,IAAI,IAAI,OAAO,cAC7C,QAAO,KAAK,IAAI;AAGpB,QAAO;;AAGT,wBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACGf,SAAS,KAAK,QAAQ;AACpB,QAAOG,oBAAY,OAAO,GAAGC,uBAAc,OAAO,GAAGC,kBAAS,OAAO;;AAGvE,mBAAe;;;;;ACzBf,IAAIC,oBAHc,OAAO,UAGQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCjC,IAAI,SAASC,wBAAe,SAAS,QAAQ,QAAQ;AACnD,KAAIC,qBAAY,OAAO,IAAIC,oBAAY,OAAO,EAAE;AAC9C,sBAAW,QAAQC,aAAK,OAAO,EAAE,OAAO;AACxC;;AAEF,MAAK,IAAI,OAAO,OACd,KAAIJ,kBAAe,KAAK,QAAQ,IAAI,CAClC,sBAAY,QAAQ,KAAK,OAAO,KAAK;EAGzC;AAEF,qBAAe;;;;;;;;;;;;;AChDf,SAAS,aAAa,QAAQ;CAC5B,IAAI,SAAS,EAAE;AACf,KAAI,UAAU,KACZ,MAAK,IAAI,OAAO,OAAO,OAAO,CAC5B,QAAO,KAAK,IAAI;AAGpB,QAAO;;AAGT,4BAAe;;;;;ACXf,IAAIK,mBAHc,OAAO,UAGQ;;;;;;;;AASjC,SAAS,WAAW,QAAQ;AAC1B,KAAI,CAACC,iBAAS,OAAO,CACnB,QAAOC,sBAAa,OAAO;CAE7B,IAAI,UAAUC,qBAAY,OAAO,EAC7B,SAAS,EAAE;AAEf,MAAK,IAAI,OAAO,OACd,KAAI,EAAE,OAAO,kBAAkB,WAAW,CAACH,iBAAe,KAAK,QAAQ,IAAI,GACzE,QAAO,KAAK,IAAI;AAGpB,QAAO;;AAGT,0BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;ACLf,SAAS,OAAO,QAAQ;AACtB,QAAOI,oBAAY,OAAO,GAAGC,uBAAc,QAAQ,KAAK,GAAGC,oBAAW,OAAO;;AAG/E,qBAAe;;;;;AC3Bf,IAAI,eAAe,oDACf,gBAAgB;;;;;;;;;AAUpB,SAAS,MAAM,OAAO,QAAQ;AAC5B,KAAIC,gBAAQ,MAAM,CAChB,QAAO;CAET,IAAI,OAAO,OAAO;AAClB,KAAI,QAAQ,YAAY,QAAQ,YAAY,QAAQ,aAChD,SAAS,QAAQC,iBAAS,MAAM,CAClC,QAAO;AAET,QAAO,cAAc,KAAK,MAAM,IAAI,CAAC,aAAa,KAAK,MAAM,IAC1D,UAAU,QAAQ,SAAS,OAAO,OAAO;;AAG9C,qBAAe;;;;ACzBf,IAAI,eAAeC,mBAAU,QAAQ,SAAS;AAE9C,4BAAe;;;;;;;;;;;ACIf,SAAS,YAAY;AACnB,MAAK,WAAWC,wBAAeA,sBAAa,KAAK,GAAG,EAAE;AACtD,MAAK,OAAO;;AAGd,yBAAe;;;;;;;;;;;;;;ACJf,SAAS,WAAW,KAAK;CACvB,IAAI,SAAS,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,SAAS;AACnD,MAAK,QAAQ,SAAS,IAAI;AAC1B,QAAO;;AAGT,0BAAe;;;;;ACbf,IAAIC,mBAAiB;;AAMrB,IAAIC,mBAHc,OAAO,UAGQ;;;;;;;;;;AAWjC,SAAS,QAAQ,KAAK;CACpB,IAAI,OAAO,KAAK;AAChB,KAAIC,uBAAc;EAChB,IAAI,SAAS,KAAK;AAClB,SAAO,WAAWF,mBAAiB,SAAY;;AAEjD,QAAOC,iBAAe,KAAK,MAAM,IAAI,GAAG,KAAK,OAAO;;AAGtD,uBAAe;;;;;ACvBf,IAAIE,mBAHc,OAAO,UAGQ;;;;;;;;;;AAWjC,SAAS,QAAQ,KAAK;CACpB,IAAI,OAAO,KAAK;AAChB,QAAOC,wBAAgB,KAAK,SAAS,SAAaD,iBAAe,KAAK,MAAM,IAAI;;AAGlF,uBAAe;;;;;ACnBf,IAAIE,mBAAiB;;;;;;;;;;;AAYrB,SAAS,QAAQ,KAAK,OAAO;CAC3B,IAAI,OAAO,KAAK;AAChB,MAAK,QAAQ,KAAK,IAAI,IAAI,GAAG,IAAI;AACjC,MAAK,OAAQC,yBAAgB,UAAU,SAAaD,mBAAiB;AACrE,QAAO;;AAGT,uBAAe;;;;;;;;;;;ACTf,SAAS,KAAK,SAAS;CACrB,IAAI,QAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,MAAK,OAAO;AACZ,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,QAAQ;AACpB,OAAK,IAAI,MAAM,IAAI,MAAM,GAAG;;;AAKhC,KAAK,UAAU,QAAQE;AACvB,KAAK,UAAU,YAAYC;AAC3B,KAAK,UAAU,MAAMC;AACrB,KAAK,UAAU,MAAMC;AACrB,KAAK,UAAU,MAAMC;AAErB,oBAAe;;;;;;;;;;;ACxBf,SAAS,iBAAiB;AACxB,MAAK,WAAW,EAAE;AAClB,MAAK,OAAO;;AAGd,8BAAe;;;;;;;;;;;;ACFf,SAAS,aAAa,OAAO,KAAK;CAChC,IAAI,SAAS,MAAM;AACnB,QAAO,SACL,KAAIC,WAAG,MAAM,QAAQ,IAAI,IAAI,CAC3B,QAAO;AAGX,QAAO;;AAGT,4BAAe;;;;;ACdf,IAAI,SAHa,MAAM,UAGC;;;;;;;;;;AAWxB,SAAS,gBAAgB,KAAK;CAC5B,IAAI,OAAO,KAAK,UACZ,QAAQC,sBAAa,MAAM,IAAI;AAEnC,KAAI,QAAQ,EACV,QAAO;AAGT,KAAI,SADY,KAAK,SAAS,EAE5B,MAAK,KAAK;KAEV,QAAO,KAAK,MAAM,OAAO,EAAE;AAE7B,GAAE,KAAK;AACP,QAAO;;AAGT,+BAAe;;;;;;;;;;;;;ACvBf,SAAS,aAAa,KAAK;CACzB,IAAI,OAAO,KAAK,UACZ,QAAQC,sBAAa,MAAM,IAAI;AAEnC,QAAO,QAAQ,IAAI,SAAY,KAAK,OAAO;;AAG7C,4BAAe;;;;;;;;;;;;;ACPf,SAAS,aAAa,KAAK;AACzB,QAAOC,sBAAa,KAAK,UAAU,IAAI,GAAG;;AAG5C,4BAAe;;;;;;;;;;;;;;ACHf,SAAS,aAAa,KAAK,OAAO;CAChC,IAAI,OAAO,KAAK,UACZ,QAAQC,sBAAa,MAAM,IAAI;AAEnC,KAAI,QAAQ,GAAG;AACb,IAAE,KAAK;AACP,OAAK,KAAK,CAAC,KAAK,MAAM,CAAC;OAEvB,MAAK,OAAO,KAAK;AAEnB,QAAO;;AAGT,4BAAe;;;;;;;;;;;ACZf,SAAS,UAAU,SAAS;CAC1B,IAAI,QAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,MAAK,OAAO;AACZ,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,QAAQ;AACpB,OAAK,IAAI,MAAM,IAAI,MAAM,GAAG;;;AAKhC,UAAU,UAAU,QAAQC;AAC5B,UAAU,UAAU,YAAYC;AAChC,UAAU,UAAU,MAAMC;AAC1B,UAAU,UAAU,MAAMC;AAC1B,UAAU,UAAU,MAAMC;AAE1B,yBAAe;;;;AC3Bf,IAAIC,QAAMC,mBAAUC,eAAM,MAAM;AAEhC,mBAAeF;;;;;;;;;;;ACKf,SAAS,gBAAgB;AACvB,MAAK,OAAO;AACZ,MAAK,WAAW;EACd,QAAQ,IAAIG,eAAI;EAChB,OAAO,KAAKC,gBAAOC,qBAAU;EAC7B,UAAU,IAAIF,eAAI;EACnB;;AAGH,6BAAe;;;;;;;;;;;ACbf,SAAS,UAAU,OAAO;CACxB,IAAI,OAAO,OAAO;AAClB,QAAQ,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YACvE,UAAU,cACV,UAAU;;AAGjB,yBAAe;;;;;;;;;;;;ACJf,SAAS,WAAW,OAAK,KAAK;CAC5B,IAAI,OAAOG,MAAI;AACf,QAAOC,mBAAU,IAAI,GACjB,KAAK,OAAO,OAAO,WAAW,WAAW,UACzC,KAAK;;AAGX,0BAAe;;;;;;;;;;;;;ACNf,SAAS,eAAe,KAAK;CAC3B,IAAI,SAASC,oBAAW,MAAM,IAAI,CAAC,UAAU,IAAI;AACjD,MAAK,QAAQ,SAAS,IAAI;AAC1B,QAAO;;AAGT,8BAAe;;;;;;;;;;;;;ACNf,SAAS,YAAY,KAAK;AACxB,QAAOC,oBAAW,MAAM,IAAI,CAAC,IAAI,IAAI;;AAGvC,2BAAe;;;;;;;;;;;;;ACJf,SAAS,YAAY,KAAK;AACxB,QAAOC,oBAAW,MAAM,IAAI,CAAC,IAAI,IAAI;;AAGvC,2BAAe;;;;;;;;;;;;;;ACHf,SAAS,YAAY,KAAK,OAAO;CAC/B,IAAI,OAAOC,oBAAW,MAAM,IAAI,EAC5B,OAAO,KAAK;AAEhB,MAAK,IAAI,KAAK,MAAM;AACpB,MAAK,QAAQ,KAAK,QAAQ,OAAO,IAAI;AACrC,QAAO;;AAGT,2BAAe;;;;;;;;;;;ACRf,SAAS,SAAS,SAAS;CACzB,IAAI,QAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,MAAK,OAAO;AACZ,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,QAAQ;AACpB,OAAK,IAAI,MAAM,IAAI,MAAM,GAAG;;;AAKhC,SAAS,UAAU,QAAQC;AAC3B,SAAS,UAAU,YAAYC;AAC/B,SAAS,UAAU,MAAMC;AACzB,SAAS,UAAU,MAAMC;AACzB,SAAS,UAAU,MAAMC;AAEzB,wBAAe;;;;;AC5Bf,IAAIC,oBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CtB,SAAS,QAAQ,MAAM,UAAU;AAC/B,KAAI,OAAO,QAAQ,cAAe,YAAY,QAAQ,OAAO,YAAY,WACvE,OAAM,IAAI,UAAUA,kBAAgB;CAEtC,IAAI,WAAW,WAAW;EACxB,IAAI,OAAO,WACP,MAAM,WAAW,SAAS,MAAM,MAAM,KAAK,GAAG,KAAK,IACnD,QAAQ,SAAS;AAErB,MAAI,MAAM,IAAI,IAAI,CAChB,QAAO,MAAM,IAAI,IAAI;EAEvB,IAAI,SAAS,KAAK,MAAM,MAAM,KAAK;AACnC,WAAS,QAAQ,MAAM,IAAI,KAAK,OAAO,IAAI;AAC3C,SAAO;;AAET,UAAS,QAAQ,KAAK,QAAQ,SAASC,oBAAS;AAChD,QAAO;;AAIT,QAAQ,QAAQA;AAEhB,sBAAe;;;;;ACrEf,IAAI,mBAAmB;;;;;;;;;AAUvB,SAAS,cAAc,MAAM;CAC3B,IAAI,SAASC,gBAAQ,MAAM,SAAS,KAAK;AACvC,MAAI,MAAM,SAAS,iBACjB,OAAM,OAAO;AAEf,SAAO;GACP;CAEF,IAAI,QAAQ,OAAO;AACnB,QAAO;;AAGT,6BAAe;;;;;ACtBf,IAAI,aAAa;;AAGjB,IAAI,eAAe;;;;;;;;AASnB,IAAI,eAAeC,uBAAc,SAAS,QAAQ;CAChD,IAAI,SAAS,EAAE;AACf,KAAI,OAAO,WAAW,EAAE,KAAK,GAC3B,QAAO,KAAK,GAAG;AAEjB,QAAO,QAAQ,YAAY,SAAS,OAAO,QAAQ,OAAO,WAAW;AACnE,SAAO,KAAK,QAAQ,UAAU,QAAQ,cAAc,KAAK,GAAI,UAAU,MAAO;GAC9E;AACF,QAAO;EACP;AAEF,4BAAe;;;;;;;;;;;;;;;;;;;;;;;;;ACHf,SAAS,SAAS,OAAO;AACvB,QAAO,SAAS,OAAO,KAAKC,sBAAa,MAAM;;AAGjD,uBAAe;;;;;;;;;;;;ACdf,SAAS,SAAS,OAAO,QAAQ;AAC/B,KAAIC,gBAAQ,MAAM,CAChB,QAAO;AAET,QAAOC,eAAM,OAAO,OAAO,GAAG,CAAC,MAAM,GAAGC,sBAAaC,iBAAS,MAAM,CAAC;;AAGvE,wBAAe;;;;;ACjBf,IAAI,WAAW;;;;;;;;AASf,SAAS,MAAM,OAAO;AACpB,KAAI,OAAO,SAAS,YAAYC,iBAAS,MAAM,CAC7C,QAAO;CAET,IAAI,SAAU,QAAQ;AACtB,QAAQ,UAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAO;;AAG9D,qBAAe;;;;;;;;;;;;ACTf,SAAS,QAAQ,QAAQ,MAAM;AAC7B,QAAOC,kBAAS,MAAM,OAAO;CAE7B,IAAI,QAAQ,GACR,SAAS,KAAK;AAElB,QAAO,UAAU,QAAQ,QAAQ,OAC/B,UAAS,OAAOC,eAAM,KAAK,SAAS;AAEtC,QAAQ,SAAS,SAAS,SAAU,SAAS;;AAG/C,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACIf,SAAS,IAAI,QAAQ,MAAM,cAAc;CACvC,IAAI,SAAS,UAAU,OAAO,SAAYC,iBAAQ,QAAQ,KAAK;AAC/D,QAAO,WAAW,SAAY,eAAe;;AAG/C,kBAAe;;;;;;;;;;;;ACxBf,SAAS,UAAU,OAAO,UAAQ;CAChC,IAAI,QAAQ,IACR,SAASC,SAAO,QAChB,SAAS,MAAM;AAEnB,QAAO,EAAE,QAAQ,OACf,OAAM,SAAS,SAASA,SAAO;AAEjC,QAAO;;AAGT,yBAAe;;;;;ACdf,IAAI,mBAAmBC,kBAASA,gBAAO,qBAAqB;;;;;;;;AAS5D,SAAS,cAAc,OAAO;AAC5B,QAAOC,gBAAQ,MAAM,IAAIC,oBAAY,MAAM,IACzC,CAAC,EAAE,oBAAoB,SAAS,MAAM;;AAG1C,6BAAe;;;;;;;;;;;;;;;ACLf,SAAS,YAAY,OAAO,OAAO,WAAW,UAAU,QAAQ;CAC9D,IAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,eAAc,YAAYC;AAC1B,YAAW,SAAS,EAAE;AAEtB,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM;AAClB,MAAI,QAAQ,KAAK,UAAU,MAAM,CAC/B,KAAI,QAAQ,EAEV,aAAY,OAAO,QAAQ,GAAG,WAAW,UAAU,OAAO;MAE1D,oBAAU,QAAQ,MAAM;WAEjB,CAAC,SACV,QAAO,OAAO,UAAU;;AAG5B,QAAO;;AAGT,2BAAe;;;;;;;;;;;;;;;;;;ACrBf,SAAS,QAAQ,OAAO;AAEtB,SADa,SAAS,OAAO,IAAI,MAAM,UACvBC,qBAAY,OAAO,EAAE,GAAG,EAAE;;AAG5C,sBAAe;;;;;AClBf,IAAI,eAAeC,iBAAQ,OAAO,gBAAgB,OAAO;AAEzD,4BAAe;;;;;;;;;;;;;ACIf,SAAS,UAAU,OAAO,OAAO,KAAK;CACpC,IAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,KAAI,QAAQ,EACV,SAAQ,CAAC,QAAQ,SAAS,IAAK,SAAS;AAE1C,OAAM,MAAM,SAAS,SAAS;AAC9B,KAAI,MAAM,EACR,QAAO;AAET,UAAS,QAAQ,MAAM,IAAM,MAAM,UAAW;AAC9C,YAAW;CAEX,IAAI,SAAS,MAAM,OAAO;AAC1B,QAAO,EAAE,QAAQ,OACf,QAAO,SAAS,MAAM,QAAQ;AAEhC,QAAO;;AAGT,yBAAe;;;;;;;;;;;;;;;;AClBf,SAAS,YAAY,OAAO,UAAU,aAAa,WAAW;CAC5D,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,KAAI,aAAa,OACf,eAAc,MAAM,EAAE;AAExB,QAAO,EAAE,QAAQ,OACf,eAAc,SAAS,aAAa,MAAM,QAAQ,OAAO,MAAM;AAEjE,QAAO;;AAGT,2BAAe;;;;;;;;;;;AChBf,SAAS,aAAa;AACpB,MAAK,WAAW,IAAIC,oBAAS;AAC7B,MAAK,OAAO;;AAGd,0BAAe;;;;;;;;;;;;;ACLf,SAAS,YAAY,KAAK;CACxB,IAAI,OAAO,KAAK,UACZ,SAAS,KAAK,UAAU,IAAI;AAEhC,MAAK,OAAO,KAAK;AACjB,QAAO;;AAGT,2BAAe;;;;;;;;;;;;;ACRf,SAAS,SAAS,KAAK;AACrB,QAAO,KAAK,SAAS,IAAI,IAAI;;AAG/B,wBAAe;;;;;;;;;;;;;ACJf,SAAS,SAAS,KAAK;AACrB,QAAO,KAAK,SAAS,IAAI,IAAI;;AAG/B,wBAAe;;;;;ACRf,IAAIC,qBAAmB;;;;;;;;;;;AAYvB,SAAS,SAAS,KAAK,OAAO;CAC5B,IAAI,OAAO,KAAK;AAChB,KAAI,gBAAgBC,oBAAW;EAC7B,IAAI,QAAQ,KAAK;AACjB,MAAI,CAACC,gBAAQ,MAAM,SAASF,qBAAmB,GAAI;AACjD,SAAM,KAAK,CAAC,KAAK,MAAM,CAAC;AACxB,QAAK,OAAO,EAAE,KAAK;AACnB,UAAO;;AAET,SAAO,KAAK,WAAW,IAAIG,kBAAS,MAAM;;AAE5C,MAAK,IAAI,KAAK,MAAM;AACpB,MAAK,OAAO,KAAK;AACjB,QAAO;;AAGT,wBAAe;;;;;;;;;;;ACnBf,SAAS,MAAM,SAAS;AAEtB,MAAK,QADM,KAAK,WAAW,IAAIC,mBAAU,QAAQ,EAChC;;AAInB,MAAM,UAAU,QAAQC;AACxB,MAAM,UAAU,YAAYC;AAC5B,MAAM,UAAU,MAAMC;AACtB,MAAM,UAAU,MAAMC;AACtB,MAAM,UAAU,MAAMC;AAEtB,qBAAe;;;;;;;;;;;;;ACdf,SAAS,WAAW,QAAQ,QAAQ;AAClC,QAAO,UAAUC,oBAAW,QAAQC,aAAK,OAAO,EAAE,OAAO;;AAG3D,0BAAe;;;;;;;;;;;;;ACJf,SAAS,aAAa,QAAQ,QAAQ;AACpC,QAAO,UAAUC,oBAAW,QAAQC,eAAO,OAAO,EAAE,OAAO;;AAG7D,4BAAe;;;;;ACbf,IAAI,cAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;;AAGhF,IAAI,aAAa,eAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;;AAM3F,IAAIC,WAHgB,cAAc,WAAW,YAAY,cAG5BC,cAAK,SAAS,QACvC,cAAcD,WAASA,SAAO,cAAc;;;;;;;;;AAUhD,SAAS,YAAY,QAAQ,QAAQ;AACnC,KAAI,OACF,QAAO,OAAO,OAAO;CAEvB,IAAI,SAAS,OAAO,QAChB,SAAS,cAAc,YAAY,OAAO,GAAG,IAAI,OAAO,YAAY,OAAO;AAE/E,QAAO,KAAK,OAAO;AACnB,QAAO;;AAGT,2BAAe;;;;;;;;;;;;;ACzBf,SAAS,YAAY,OAAO,WAAW;CACrC,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX,SAAS,EAAE;AAEf,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM;AAClB,MAAI,UAAU,OAAO,OAAO,MAAM,CAChC,QAAO,cAAc;;AAGzB,QAAO;;AAGT,2BAAe;;;;;;;;;;;;;;;;;;;;;;ACNf,SAAS,YAAY;AACnB,QAAO,EAAE;;AAGX,wBAAe;;;;;ACff,IAAI,uBAHc,OAAO,UAGc;AAGvC,IAAI,mBAAmB,OAAO;;;;;;;;AAS9B,IAAI,aAAa,CAAC,mBAAmBE,oBAAY,SAAS,QAAQ;AAChE,KAAI,UAAU,KACZ,QAAO,EAAE;AAEX,UAAS,OAAO,OAAO;AACvB,QAAOC,qBAAY,iBAAiB,OAAO,EAAE,SAAS,QAAQ;AAC5D,SAAO,qBAAqB,KAAK,QAAQ,OAAO;GAChD;;AAGJ,0BAAe;;;;;;;;;;;;AClBf,SAAS,YAAY,QAAQ,QAAQ;AACnC,QAAOC,oBAAW,QAAQC,oBAAW,OAAO,EAAE,OAAO;;AAGvD,2BAAe;;;;;;;;;;;ACAf,IAAI,eAAe,CATI,OAAO,wBASSC,oBAAY,SAAS,QAAQ;CAClE,IAAI,SAAS,EAAE;AACf,QAAO,QAAQ;AACb,qBAAU,QAAQC,oBAAW,OAAO,CAAC;AACrC,WAASC,sBAAa,OAAO;;AAE/B,QAAO;;AAGT,4BAAe;;;;;;;;;;;;ACbf,SAAS,cAAc,QAAQ,QAAQ;AACrC,QAAOC,oBAAW,QAAQC,sBAAa,OAAO,EAAE,OAAO;;AAGzD,6BAAe;;;;;;;;;;;;;;;ACDf,SAAS,eAAe,QAAQ,UAAU,aAAa;CACrD,IAAI,SAAS,SAAS,OAAO;AAC7B,QAAOC,gBAAQ,OAAO,GAAG,SAASC,mBAAU,QAAQ,YAAY,OAAO,CAAC;;AAG1E,8BAAe;;;;;;;;;;;ACRf,SAAS,WAAW,QAAQ;AAC1B,QAAOC,wBAAe,QAAQC,cAAMC,oBAAW;;AAGjD,0BAAe;;;;;;;;;;;;ACHf,SAAS,aAAa,QAAQ;AAC5B,QAAOC,wBAAe,QAAQC,gBAAQC,sBAAa;;AAGrD,4BAAe;;;;ACZf,IAAI,WAAWC,mBAAUC,eAAM,WAAW;AAE1C,wBAAe;;;;ACFf,IAAIC,YAAUC,mBAAUC,eAAM,UAAU;AAExC,uBAAeF;;;;ACFf,IAAIG,QAAMC,mBAAUC,eAAM,MAAM;AAEhC,mBAAeF;;;;;ACGf,IAAIG,WAAS,gBACTC,cAAY,mBACZ,aAAa,oBACbC,WAAS,gBACTC,eAAa;AAEjB,IAAIC,gBAAc;;AAGlB,IAAI,qBAAqBC,kBAASC,kBAAS,EACvC,gBAAgBD,kBAASE,aAAI,EAC7B,oBAAoBF,kBAASG,iBAAQ,EACrC,gBAAgBH,kBAASI,aAAI,EAC7B,oBAAoBJ,kBAASK,iBAAQ;;;;;;;;AASzC,IAAI,SAASC;AAGb,IAAKL,qBAAY,OAAO,IAAIA,kCAAS,IAAI,YAAY,EAAE,CAAC,CAAC,IAAIF,iBACxDG,gBAAO,OAAO,IAAIA,cAAG,CAAC,IAAIP,YAC1BQ,oBAAW,OAAOA,iBAAQ,SAAS,CAAC,IAAI,cACxCC,gBAAO,OAAO,IAAIA,cAAG,CAAC,IAAIP,YAC1BQ,oBAAW,OAAO,IAAIA,kBAAO,CAAC,IAAIP,aACrC,UAAS,SAAS,OAAO;CACvB,IAAI,SAASQ,oBAAW,MAAM,EAC1B,OAAO,UAAUV,cAAY,MAAM,cAAc,QACjD,aAAa,OAAOI,kBAAS,KAAK,GAAG;AAEzC,KAAI,WACF,SAAQ,YAAR;EACE,KAAK,mBAAoB,QAAOD;EAChC,KAAK,cAAe,QAAOJ;EAC3B,KAAK,kBAAmB,QAAO;EAC/B,KAAK,cAAe,QAAOE;EAC3B,KAAK,kBAAmB,QAAOC;;AAGnC,QAAO;;AAIX,sBAAe;;;;;ACrDf,IAAIS,mBAHc,OAAO,UAGQ;;;;;;;;AASjC,SAAS,eAAe,OAAO;CAC7B,IAAI,SAAS,MAAM,QACf,SAAS,IAAI,MAAM,YAAY,OAAO;AAG1C,KAAI,UAAU,OAAO,MAAM,MAAM,YAAYA,iBAAe,KAAK,OAAO,QAAQ,EAAE;AAChF,SAAO,QAAQ,MAAM;AACrB,SAAO,QAAQ,MAAM;;AAEvB,QAAO;;AAGT,8BAAe;;;;;ACtBf,IAAIC,eAAaC,cAAK;AAEtB,0BAAeD;;;;;;;;;;;ACIf,SAAS,iBAAiB,aAAa;CACrC,IAAI,SAAS,IAAI,YAAY,YAAY,YAAY,WAAW;AAChE,KAAIE,oBAAW,OAAO,CAAC,IAAI,IAAIA,oBAAW,YAAY,CAAC;AACvD,QAAO;;AAGT,gCAAe;;;;;;;;;;;;ACLf,SAAS,cAAc,UAAU,QAAQ;CACvC,IAAI,SAAS,SAASC,0BAAiB,SAAS,OAAO,GAAG,SAAS;AACnE,QAAO,IAAI,SAAS,YAAY,QAAQ,SAAS,YAAY,SAAS,WAAW;;AAGnF,6BAAe;;;;;ACdf,IAAI,UAAU;;;;;;;;AASd,SAAS,YAAY,QAAQ;CAC3B,IAAI,SAAS,IAAI,OAAO,YAAY,OAAO,QAAQ,QAAQ,KAAK,OAAO,CAAC;AACxE,QAAO,YAAY,OAAO;AAC1B,QAAO;;AAGT,2BAAe;;;;;ACbf,IAAIC,gBAAcC,kBAASA,gBAAO,YAAY,QAC1CC,kBAAgBF,gBAAcA,cAAY,UAAU;;;;;;;;AASxD,SAAS,YAAY,QAAQ;AAC3B,QAAOE,kBAAgB,OAAOA,gBAAc,KAAK,OAAO,CAAC,GAAG,EAAE;;AAGhE,2BAAe;;;;;;;;;;;;ACPf,SAAS,gBAAgB,YAAY,QAAQ;CAC3C,IAAI,SAAS,SAASC,0BAAiB,WAAW,OAAO,GAAG,WAAW;AACvE,QAAO,IAAI,WAAW,YAAY,QAAQ,WAAW,YAAY,WAAW,OAAO;;AAGrF,+BAAe;;;;;ACRf,IAAIC,YAAU,oBACVC,YAAU,iBACVC,WAAS,gBACTC,cAAY,mBACZC,cAAY,mBACZC,WAAS,gBACTC,cAAY,mBACZC,cAAY;AAEhB,IAAIC,mBAAiB,wBACjBC,gBAAc,qBACdC,eAAa,yBACbC,eAAa,yBACbC,YAAU,sBACVC,aAAW,uBACXC,aAAW,uBACXC,aAAW,uBACXC,oBAAkB,8BAClBC,cAAY,wBACZC,cAAY;;;;;;;;;;;;;AAchB,SAAS,eAAe,QAAQ,KAAK,QAAQ;CAC3C,IAAI,OAAO,OAAO;AAClB,SAAQ,KAAR;EACE,KAAKV,iBACH,QAAOW,0BAAiB,OAAO;EAEjC,KAAKnB;EACL,KAAKC,UACH,QAAO,IAAI,KAAK,CAAC,OAAO;EAE1B,KAAKQ,cACH,QAAOW,uBAAc,QAAQ,OAAO;EAEtC,KAAKV;EAAY,KAAKC;EACtB,KAAKC;EAAS,KAAKC;EAAU,KAAKC;EAClC,KAAKC;EAAU,KAAKC;EAAiB,KAAKC;EAAW,KAAKC,YACxD,QAAOG,yBAAgB,QAAQ,OAAO;EAExC,KAAKnB,SACH,QAAO,IAAI,MAAI;EAEjB,KAAKC;EACL,KAAKG,YACH,QAAO,IAAI,KAAK,OAAO;EAEzB,KAAKF,YACH,QAAOkB,qBAAY,OAAO;EAE5B,KAAKjB,SACH,QAAO,IAAI,MAAI;EAEjB,KAAKE,YACH,QAAOgB,qBAAY,OAAO;;;AAIhC,8BAAe;;;;;;;;;;;ACjEf,SAAS,gBAAgB,QAAQ;AAC/B,QAAQ,OAAO,OAAO,eAAe,cAAc,CAACC,qBAAY,OAAO,GACnEC,oBAAWC,sBAAa,OAAO,CAAC,GAChC,EAAE;;AAGR,+BAAe;;;;;ACbf,IAAIC,WAAS;;;;;;;;AASb,SAAS,UAAU,OAAO;AACxB,QAAOC,qBAAa,MAAM,IAAIC,gBAAO,MAAM,IAAIF;;AAGjD,yBAAe;;;;ACZf,IAAI,YAAYG,qBAAYA,kBAAS;;;;;;;;;;;;;;;;;;AAmBrC,IAAI,QAAQ,YAAYC,mBAAU,UAAU,GAAGC;AAE/C,oBAAe;;;;;ACtBf,IAAIC,WAAS;;;;;;;;AASb,SAAS,UAAU,OAAO;AACxB,QAAOC,qBAAa,MAAM,IAAIC,gBAAO,MAAM,IAAIF;;AAGjD,yBAAe;;;;ACZf,IAAI,YAAYG,qBAAYA,kBAAS;;;;;;;;;;;;;;;;;;AAmBrC,IAAI,QAAQ,YAAYC,mBAAU,UAAU,GAAGC;AAE/C,oBAAe;;;;;ACFf,IAAI,kBAAkB,GAClB,kBAAkB,GAClBC,uBAAqB;;AAGzB,IAAIC,YAAU,sBACVC,aAAW,kBACXC,YAAU,oBACVC,YAAU,iBACVC,aAAW,kBACX,UAAU,qBACV,SAAS,8BACTC,WAAS,gBACTC,cAAY,mBACZC,cAAY,mBACZC,cAAY,mBACZC,WAAS,gBACTC,cAAY,mBACZC,cAAY,mBACZ,aAAa;AAEjB,IAAIC,mBAAiB,wBACjBC,gBAAc,qBACd,aAAa,yBACb,aAAa,yBACb,UAAU,sBACV,WAAW,uBACX,WAAW,uBACX,WAAW,uBACX,kBAAkB,8BAClB,YAAY,wBACZ,YAAY;;AAGhB,IAAI,gBAAgB,EAAE;AACtB,cAAcb,aAAW,cAAcC,cACvC,cAAcW,oBAAkB,cAAcC,iBAC9C,cAAcX,aAAW,cAAcC,aACvC,cAAc,cAAc,cAAc,cAC1C,cAAc,WAAW,cAAc,YACvC,cAAc,YAAY,cAAcE,YACxC,cAAcC,eAAa,cAAcC,eACzC,cAAcC,eAAa,cAAcC,YACzC,cAAcC,eAAa,cAAcC,eACzC,cAAc,YAAY,cAAc,mBACxC,cAAc,aAAa,cAAc,aAAa;AACtD,cAAcP,cAAY,cAAc,WACxC,cAAc,cAAc;;;;;;;;;;;;;;;;;AAkB5B,SAAS,UAAU,OAAO,SAAS,YAAY,KAAK,QAAQ,OAAO;CACjE,IAAI,QACA,SAAS,UAAU,iBACnB,SAAS,UAAU,iBACnB,SAAS,UAAUL;AAEvB,KAAI,WACF,UAAS,SAAS,WAAW,OAAO,KAAK,QAAQ,MAAM,GAAG,WAAW,MAAM;AAE7E,KAAI,WAAW,OACb,QAAO;AAET,KAAI,CAACe,iBAAS,MAAM,CAClB,QAAO;CAET,IAAI,QAAQC,gBAAQ,MAAM;AAC1B,KAAI,OAAO;AACT,WAASC,wBAAe,MAAM;AAC9B,MAAI,CAAC,OACH,QAAOC,mBAAU,OAAO,OAAO;QAE5B;EACL,IAAI,MAAMC,gBAAO,MAAM,EACnB,SAAS,OAAO,WAAW,OAAO;AAEtC,MAAIC,iBAAS,MAAM,CACjB,QAAOC,qBAAY,OAAO,OAAO;AAEnC,MAAI,OAAOb,eAAa,OAAOP,aAAY,UAAU,CAAC,QAAS;AAC7D,YAAU,UAAU,SAAU,EAAE,GAAGqB,yBAAgB,MAAM;AACzD,OAAI,CAAC,OACH,QAAO,SACHC,uBAAc,OAAOC,sBAAa,QAAQ,MAAM,CAAC,GACjDC,qBAAY,OAAOC,oBAAW,QAAQ,MAAM,CAAC;SAE9C;AACL,OAAI,CAAC,cAAc,KACjB,QAAO,SAAS,QAAQ,EAAE;AAE5B,YAASC,wBAAe,OAAO,KAAK,OAAO;;;AAI/C,WAAU,QAAQ,IAAIC,gBAAK;CAC3B,IAAI,UAAU,MAAM,IAAI,MAAM;AAC9B,KAAI,QACF,QAAO;AAET,OAAM,IAAI,OAAO,OAAO;AAExB,KAAIC,cAAM,MAAM,CACd,OAAM,QAAQ,SAAS,UAAU;AAC/B,SAAO,IAAI,UAAU,UAAU,SAAS,YAAY,UAAU,OAAO,MAAM,CAAC;GAC5E;UACOC,cAAM,MAAM,CACrB,OAAM,QAAQ,SAAS,UAAU,OAAK;AACpC,SAAO,IAAIC,OAAK,UAAU,UAAU,SAAS,YAAYA,OAAK,OAAO,MAAM,CAAC;GAC5E;CAOJ,IAAI,QAAQ,QAAQ,UAJL,SACV,SAASC,wBAAeC,sBACxB,SAASC,iBAASC,cAEkB,MAAM;AAC/C,oBAAU,SAAS,OAAO,SAAS,UAAU,OAAK;AAChD,MAAI,OAAO;AACT,WAAM;AACN,cAAW,MAAMJ;;AAGnB,uBAAY,QAAQA,OAAK,UAAU,UAAU,SAAS,YAAYA,OAAK,OAAO,MAAM,CAAC;GACrF;AACF,QAAO;;AAGT,yBAAe;;;;;AClKf,IAAI,qBAAqB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BzB,SAAS,MAAM,OAAO;AACpB,QAAOK,mBAAU,OAAO,mBAAmB;;AAG7C,oBAAe;;;;;;;;;;;;;;;;;;;ACpBf,SAAS,QAAQ,OAAO;CACtB,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX,SAAS,EAAE;AAEf,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM;AAClB,MAAI,MACF,QAAO,cAAc;;AAGzB,QAAO;;AAGT,sBAAe;;;;;AC7Bf,IAAI,iBAAiB;;;;;;;;;;;AAYrB,SAAS,YAAY,OAAO;AAC1B,MAAK,SAAS,IAAI,OAAO,eAAe;AACxC,QAAO;;AAGT,2BAAe;;;;;;;;;;;;;ACTf,SAAS,YAAY,OAAO;AAC1B,QAAO,KAAK,SAAS,IAAI,MAAM;;AAGjC,2BAAe;;;;;;;;;;;;ACDf,SAAS,SAAS,UAAQ;CACxB,IAAI,QAAQ,IACR,SAASC,YAAU,OAAO,IAAIA,SAAO;AAEzC,MAAK,WAAW,IAAIC,mBAAQ;AAC5B,QAAO,EAAE,QAAQ,OACf,MAAK,IAAID,SAAO,OAAO;;AAK3B,SAAS,UAAU,MAAM,SAAS,UAAU,OAAOE;AACnD,SAAS,UAAU,MAAMC;AAEzB,wBAAe;;;;;;;;;;;;;;AChBf,SAAS,UAAU,OAAO,WAAW;CACnC,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,QAAO,EAAE,QAAQ,OACf,KAAI,UAAU,MAAM,QAAQ,OAAO,MAAM,CACvC,QAAO;AAGX,QAAO;;AAGT,yBAAe;;;;;;;;;;;;ACdf,SAAS,SAAS,OAAO,KAAK;AAC5B,QAAO,MAAM,IAAI,IAAI;;AAGvB,wBAAe;;;;;ACPf,IAAIC,yBAAuB,GACvBC,2BAAyB;;;;;;;;;;;;;;AAe7B,SAAS,YAAY,OAAO,OAAO,SAAS,YAAY,WAAW,OAAO;CACxE,IAAI,YAAY,UAAUD,wBACtB,YAAY,MAAM,QAClB,YAAY,MAAM;AAEtB,KAAI,aAAa,aAAa,EAAE,aAAa,YAAY,WACvD,QAAO;CAGT,IAAI,aAAa,MAAM,IAAI,MAAM;CACjC,IAAI,aAAa,MAAM,IAAI,MAAM;AACjC,KAAI,cAAc,WAChB,QAAO,cAAc,SAAS,cAAc;CAE9C,IAAI,QAAQ,IACR,SAAS,MACT,OAAQ,UAAUC,2BAA0B,IAAIC,mBAAQ,GAAG;AAE/D,OAAM,IAAI,OAAO,MAAM;AACvB,OAAM,IAAI,OAAO,MAAM;AAGvB,QAAO,EAAE,QAAQ,WAAW;EAC1B,IAAI,WAAW,MAAM,QACjB,WAAW,MAAM;AAErB,MAAI,YACF,IAAI,WAAW,YACX,WAAW,UAAU,UAAU,OAAO,OAAO,OAAO,MAAM,GAC1D,WAAW,UAAU,UAAU,OAAO,OAAO,OAAO,MAAM;AAEhE,MAAI,aAAa,QAAW;AAC1B,OAAI,SACF;AAEF,YAAS;AACT;;AAGF,MAAI,MACF;OAAI,CAACC,mBAAU,OAAO,SAAS,YAAU,UAAU;AAC7C,QAAI,CAACC,kBAAS,MAAM,SAAS,KACxB,aAAaC,cAAY,UAAU,UAAUA,YAAU,SAAS,YAAY,MAAM,EACrF,QAAO,KAAK,KAAK,SAAS;KAE5B,EAAE;AACN,aAAS;AACT;;aAEO,EACL,aAAa,YACX,UAAU,UAAU,UAAU,SAAS,YAAY,MAAM,GAC1D;AACL,YAAS;AACT;;;AAGJ,OAAM,UAAU,MAAM;AACtB,OAAM,UAAU,MAAM;AACtB,QAAO;;AAGT,2BAAe;;;;;;;;;;;AC5Ef,SAAS,WAAW,OAAK;CACvB,IAAI,QAAQ,IACR,SAAS,MAAMC,MAAI,KAAK;AAE5B,OAAI,QAAQ,SAAS,OAAO,KAAK;AAC/B,SAAO,EAAE,SAAS,CAAC,KAAK,MAAM;GAC9B;AACF,QAAO;;AAGT,0BAAe;;;;;;;;;;;ACVf,SAAS,WAAW,KAAK;CACvB,IAAI,QAAQ,IACR,SAAS,MAAM,IAAI,KAAK;AAE5B,KAAI,QAAQ,SAAS,OAAO;AAC1B,SAAO,EAAE,SAAS;GAClB;AACF,QAAO;;AAGT,0BAAe;;;;;ACTf,IAAIC,yBAAuB,GACvBC,2BAAyB;;AAG7B,IAAI,UAAU,oBACV,UAAU,iBACV,WAAW,kBACXC,WAAS,gBACT,YAAY,mBACZC,cAAY,mBACZC,WAAS,gBACTC,cAAY,mBACZ,YAAY;AAEhB,IAAI,iBAAiB,wBACjB,cAAc;;AAGlB,IAAI,cAAcC,kBAASA,gBAAO,YAAY,QAC1C,gBAAgB,cAAc,YAAY,UAAU;;;;;;;;;;;;;;;;;;AAmBxD,SAAS,WAAW,QAAQ,OAAO,KAAK,SAAS,YAAY,WAAW,OAAO;AAC7E,SAAQ,KAAR;EACE,KAAK;AACH,OAAK,OAAO,cAAc,MAAM,cAC3B,OAAO,cAAc,MAAM,WAC9B,QAAO;AAET,YAAS,OAAO;AAChB,WAAQ,MAAM;EAEhB,KAAK;AACH,OAAK,OAAO,cAAc,MAAM,cAC5B,CAAC,UAAU,IAAIC,oBAAW,OAAO,EAAE,IAAIA,oBAAW,MAAM,CAAC,CAC3D,QAAO;AAET,UAAO;EAET,KAAK;EACL,KAAK;EACL,KAAK,UAGH,QAAOC,WAAG,CAAC,QAAQ,CAAC,MAAM;EAE5B,KAAK,SACH,QAAO,OAAO,QAAQ,MAAM,QAAQ,OAAO,WAAW,MAAM;EAE9D,KAAKL;EACL,KAAKE,YAIH,QAAO,UAAW,QAAQ;EAE5B,KAAKH,UACH,IAAI,UAAUO;EAEhB,KAAKL;GACH,IAAI,YAAY,UAAUJ;AAC1B,eAAY,UAAUU;AAEtB,OAAI,OAAO,QAAQ,MAAM,QAAQ,CAAC,UAChC,QAAO;GAGT,IAAI,UAAU,MAAM,IAAI,OAAO;AAC/B,OAAI,QACF,QAAO,WAAW;AAEpB,cAAWT;AAGX,SAAM,IAAI,QAAQ,MAAM;GACxB,IAAI,SAASU,qBAAY,QAAQ,OAAO,EAAE,QAAQ,MAAM,EAAE,SAAS,YAAY,WAAW,MAAM;AAChG,SAAM,UAAU,OAAO;AACvB,UAAO;EAET,KAAK,UACH,KAAI,cACF,QAAO,cAAc,KAAK,OAAO,IAAI,cAAc,KAAK,MAAM;;AAGpE,QAAO;;AAGT,0BAAe;;;;;AC5Gf,IAAIC,yBAAuB;;AAM3B,IAAIC,mBAHc,OAAO,UAGQ;;;;;;;;;;;;;;AAejC,SAAS,aAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;CAC1E,IAAI,YAAY,UAAUD,wBACtB,WAAWE,oBAAW,OAAO,EAC7B,YAAY,SAAS;AAIzB,KAAI,aAHWA,oBAAW,MAAM,CACP,UAEK,CAAC,UAC7B,QAAO;CAET,IAAI,QAAQ;AACZ,QAAO,SAAS;EACd,IAAI,MAAM,SAAS;AACnB,MAAI,EAAE,YAAY,OAAO,QAAQD,iBAAe,KAAK,OAAO,IAAI,EAC9D,QAAO;;CAIX,IAAI,aAAa,MAAM,IAAI,OAAO;CAClC,IAAI,aAAa,MAAM,IAAI,MAAM;AACjC,KAAI,cAAc,WAChB,QAAO,cAAc,SAAS,cAAc;CAE9C,IAAI,SAAS;AACb,OAAM,IAAI,QAAQ,MAAM;AACxB,OAAM,IAAI,OAAO,OAAO;CAExB,IAAI,WAAW;AACf,QAAO,EAAE,QAAQ,WAAW;AAC1B,QAAM,SAAS;EACf,IAAI,WAAW,OAAO,MAClB,WAAW,MAAM;AAErB,MAAI,YACF,IAAI,WAAW,YACX,WAAW,UAAU,UAAU,KAAK,OAAO,QAAQ,MAAM,GACzD,WAAW,UAAU,UAAU,KAAK,QAAQ,OAAO,MAAM;AAG/D,MAAI,EAAE,aAAa,SACV,aAAa,YAAY,UAAU,UAAU,UAAU,SAAS,YAAY,MAAM,GACnF,WACD;AACL,YAAS;AACT;;AAEF,eAAa,WAAW,OAAO;;AAEjC,KAAI,UAAU,CAAC,UAAU;EACvB,IAAI,UAAU,OAAO,aACjB,UAAU,MAAM;AAGpB,MAAI,WAAW,WACV,iBAAiB,UAAU,iBAAiB,SAC7C,EAAE,OAAO,WAAW,cAAc,mBAAmB,WACnD,OAAO,WAAW,cAAc,mBAAmB,SACvD,UAAS;;AAGb,OAAM,UAAU,OAAO;AACvB,OAAM,UAAU,MAAM;AACtB,QAAO;;AAGT,4BAAe;;;;;AC/Ef,IAAIE,yBAAuB;;AAG3B,IAAI,UAAU,sBACV,WAAW,kBACX,YAAY;;AAMhB,IAAIC,mBAHc,OAAO,UAGQ;;;;;;;;;;;;;;;AAgBjC,SAAS,gBAAgB,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;CAC7E,IAAI,WAAWC,gBAAQ,OAAO,EAC1B,WAAWA,gBAAQ,MAAM,EACzB,SAAS,WAAW,WAAWC,gBAAO,OAAO,EAC7C,SAAS,WAAW,WAAWA,gBAAO,MAAM;AAEhD,UAAS,UAAU,UAAU,YAAY;AACzC,UAAS,UAAU,UAAU,YAAY;CAEzC,IAAI,WAAW,UAAU,WACrB,WAAW,UAAU,WACrB,YAAY,UAAU;AAE1B,KAAI,aAAaC,iBAAS,OAAO,EAAE;AACjC,MAAI,CAACA,iBAAS,MAAM,CAClB,QAAO;AAET,aAAW;AACX,aAAW;;AAEb,KAAI,aAAa,CAAC,UAAU;AAC1B,YAAU,QAAQ,IAAIC,gBAAK;AAC3B,SAAQ,YAAYC,qBAAa,OAAO,GACpCC,qBAAY,QAAQ,OAAO,SAAS,YAAY,WAAW,MAAM,GACjEC,oBAAW,QAAQ,OAAO,QAAQ,SAAS,YAAY,WAAW,MAAM;;AAE9E,KAAI,EAAE,UAAUR,yBAAuB;EACrC,IAAI,eAAe,YAAYC,iBAAe,KAAK,QAAQ,cAAc,EACrE,eAAe,YAAYA,iBAAe,KAAK,OAAO,cAAc;AAExE,MAAI,gBAAgB,cAAc;GAChC,IAAI,eAAe,eAAe,OAAO,OAAO,GAAG,QAC/C,eAAe,eAAe,MAAM,OAAO,GAAG;AAElD,aAAU,QAAQ,IAAII,gBAAK;AAC3B,UAAO,UAAU,cAAc,cAAc,SAAS,YAAY,MAAM;;;AAG5E,KAAI,CAAC,UACH,QAAO;AAET,WAAU,QAAQ,IAAIA,gBAAK;AAC3B,QAAOI,sBAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,MAAM;;AAG3E,+BAAe;;;;;;;;;;;;;;;;;;ACjEf,SAAS,YAAY,OAAO,OAAO,SAAS,YAAY,OAAO;AAC7D,KAAI,UAAU,MACZ,QAAO;AAET,KAAI,SAAS,QAAQ,SAAS,QAAS,CAACC,qBAAa,MAAM,IAAI,CAACA,qBAAa,MAAM,CACjF,QAAO,UAAU,SAAS,UAAU;AAEtC,QAAOC,yBAAgB,OAAO,OAAO,SAAS,YAAY,aAAa,MAAM;;AAG/E,2BAAe;;;;;ACvBf,IAAIC,yBAAuB,GACvBC,2BAAyB;;;;;;;;;;;AAY7B,SAAS,YAAY,QAAQ,QAAQ,WAAW,YAAY;CAC1D,IAAI,QAAQ,UAAU,QAClB,SAAS,OACT,eAAe,CAAC;AAEpB,KAAI,UAAU,KACZ,QAAO,CAAC;AAEV,UAAS,OAAO,OAAO;AACvB,QAAO,SAAS;EACd,IAAI,OAAO,UAAU;AACrB,MAAK,gBAAgB,KAAK,KAClB,KAAK,OAAO,OAAO,KAAK,MACxB,EAAE,KAAK,MAAM,QAEnB,QAAO;;AAGX,QAAO,EAAE,QAAQ,QAAQ;AACvB,SAAO,UAAU;EACjB,IAAI,MAAM,KAAK,IACX,WAAW,OAAO,MAClB,WAAW,KAAK;AAEpB,MAAI,gBAAgB,KAAK,IACvB;OAAI,aAAa,UAAa,EAAE,OAAO,QACrC,QAAO;SAEJ;GACL,IAAI,QAAQ,IAAIC,gBAAK;AACrB,OAAI,YACF,IAAI,SAAS,WAAW,UAAU,UAAU,KAAK,QAAQ,QAAQ,MAAM;AAEzE,OAAI,EAAE,WAAW,SACTC,qBAAY,UAAU,UAAUH,yBAAuBC,0BAAwB,YAAY,MAAM,GACjG,QAEN,QAAO;;;AAIb,QAAO;;AAGT,2BAAe;;;;;;;;;;;;ACnDf,SAAS,mBAAmB,OAAO;AACjC,QAAO,UAAU,SAAS,CAACG,iBAAS,MAAM;;AAG5C,kCAAe;;;;;;;;;;;ACJf,SAAS,aAAa,QAAQ;CAC5B,IAAI,SAASC,aAAK,OAAO,EACrB,SAAS,OAAO;AAEpB,QAAO,UAAU;EACf,IAAI,MAAM,OAAO,SACb,QAAQ,OAAO;AAEnB,SAAO,UAAU;GAAC;GAAK;GAAOC,4BAAmB,MAAM;GAAC;;AAE1D,QAAO;;AAGT,4BAAe;;;;;;;;;;;;;ACdf,SAAS,wBAAwB,KAAK,UAAU;AAC9C,QAAO,SAAS,QAAQ;AACtB,MAAI,UAAU,KACZ,QAAO;AAET,SAAO,OAAO,SAAS,aACpB,aAAa,UAAc,OAAO,OAAO,OAAO;;;AAIvD,uCAAe;;;;;;;;;;;ACRf,SAAS,YAAY,QAAQ;CAC3B,IAAI,YAAYC,sBAAa,OAAO;AACpC,KAAI,UAAU,UAAU,KAAK,UAAU,GAAG,GACxC,QAAOC,iCAAwB,UAAU,GAAG,IAAI,UAAU,GAAG,GAAG;AAElE,QAAO,SAAS,QAAQ;AACtB,SAAO,WAAW,UAAUC,qBAAY,QAAQ,QAAQ,UAAU;;;AAItE,2BAAe;;;;;;;;;;;;ACbf,SAAS,UAAU,QAAQ,KAAK;AAC9B,QAAO,UAAU,QAAQ,OAAO,OAAO,OAAO;;AAGhD,yBAAe;;;;;;;;;;;;;ACIf,SAAS,QAAQ,QAAQ,MAAM,SAAS;AACtC,QAAOC,kBAAS,MAAM,OAAO;CAE7B,IAAI,QAAQ,IACR,SAAS,KAAK,QACd,SAAS;AAEb,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,MAAMC,eAAM,KAAK,OAAO;AAC5B,MAAI,EAAE,SAAS,UAAU,QAAQ,QAAQ,QAAQ,IAAI,EACnD;AAEF,WAAS,OAAO;;AAElB,KAAI,UAAU,EAAE,SAAS,OACvB,QAAO;AAET,UAAS,UAAU,OAAO,IAAI,OAAO;AACrC,QAAO,CAAC,CAAC,UAAUC,iBAAS,OAAO,IAAIC,iBAAQ,KAAK,OAAO,KACxDC,gBAAQ,OAAO,IAAIC,oBAAY,OAAO;;AAG3C,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACTf,SAAS,MAAM,QAAQ,MAAM;AAC3B,QAAO,UAAU,QAAQC,iBAAQ,QAAQ,MAAMC,mBAAU;;AAG3D,oBAAe;;;;;ACxBf,IAAI,uBAAuB,GACvB,yBAAyB;;;;;;;;;AAU7B,SAAS,oBAAoB,MAAM,UAAU;AAC3C,KAAIC,eAAM,KAAK,IAAIC,4BAAmB,SAAS,CAC7C,QAAOC,iCAAwBC,eAAM,KAAK,EAAE,SAAS;AAEvD,QAAO,SAAS,QAAQ;EACtB,IAAI,WAAWC,YAAI,QAAQ,KAAK;AAChC,SAAQ,aAAa,UAAa,aAAa,WAC3CC,cAAM,QAAQ,KAAK,GACnBC,qBAAY,UAAU,UAAU,uBAAuB,uBAAuB;;;AAItF,mCAAe;;;;;;;;;;;ACzBf,SAAS,aAAa,KAAK;AACzB,QAAO,SAAS,QAAQ;AACtB,SAAO,UAAU,OAAO,SAAY,OAAO;;;AAI/C,4BAAe;;;;;;;;;;;ACJf,SAAS,iBAAiB,MAAM;AAC9B,QAAO,SAAS,QAAQ;AACtB,SAAOC,iBAAQ,QAAQ,KAAK;;;AAIhC,gCAAe;;;;;;;;;;;;;;;;;;;;;;;;;;ACYf,SAAS,SAAS,MAAM;AACtB,QAAOC,eAAM,KAAK,GAAGC,sBAAaC,eAAM,KAAK,CAAC,GAAGC,0BAAiB,KAAK;;AAGzE,uBAAe;;;;;;;;;;;AClBf,SAAS,aAAa,OAAO;AAG3B,KAAI,OAAO,SAAS,WAClB,QAAO;AAET,KAAI,SAAS,KACX,QAAOC;AAET,KAAI,OAAO,SAAS,SAClB,QAAOC,gBAAQ,MAAM,GACjBC,6BAAoB,MAAM,IAAI,MAAM,GAAG,GACvCC,qBAAY,MAAM;AAExB,QAAOC,iBAAS,MAAM;;AAGxB,4BAAe;;;;;;;;;;;;;;ACpBf,SAAS,gBAAgB,OAAO,QAAQ,UAAU,aAAa;CAC7D,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM;AAClB,SAAO,aAAa,OAAO,SAAS,MAAM,EAAE,MAAM;;AAEpD,QAAO;;AAGT,+BAAe;;;;;;;;;;;ACdf,SAAS,cAAc,WAAW;AAChC,QAAO,SAAS,QAAQ,UAAU,UAAU;EAC1C,IAAI,QAAQ,IACR,WAAW,OAAO,OAAO,EACzB,QAAQ,SAAS,OAAO,EACxB,SAAS,MAAM;AAEnB,SAAO,UAAU;GACf,IAAI,MAAM,MAAM,YAAY,SAAS,EAAE;AACvC,OAAI,SAAS,SAAS,MAAM,KAAK,SAAS,KAAK,MAC7C;;AAGJ,SAAO;;;AAIX,6BAAe;;;;;;;;;;;;;;;ACXf,IAAI,UAAUC,wBAAe;AAE7B,uBAAe;;;;;;;;;;;;ACJf,SAAS,WAAW,QAAQ,UAAU;AACpC,QAAO,UAAUC,iBAAQ,QAAQ,UAAUC,aAAK;;AAGlD,0BAAe;;;;;;;;;;;;ACLf,SAAS,eAAe,UAAU,WAAW;AAC3C,QAAO,SAAS,YAAY,UAAU;AACpC,MAAI,cAAc,KAChB,QAAO;AAET,MAAI,CAACC,oBAAY,WAAW,CAC1B,QAAO,SAAS,YAAY,SAAS;EAEvC,IAAI,SAAS,WAAW,QACpB,QAAQ,YAAY,SAAS,IAC7B,WAAW,OAAO,WAAW;AAEjC,SAAQ,YAAY,UAAU,EAAE,QAAQ,OACtC,KAAI,SAAS,SAAS,QAAQ,OAAO,SAAS,KAAK,MACjD;AAGJ,SAAO;;;AAIX,8BAAe;;;;;;;;;;;;ACpBf,IAAI,WAAWC,wBAAeC,oBAAW;AAEzC,wBAAe;;;;;;;;;;;;;;;ACAf,SAAS,eAAe,YAAY,QAAQ,UAAU,aAAa;AACjE,mBAAS,YAAY,SAAS,OAAO,KAAK,cAAY;AACpD,SAAO,aAAa,OAAO,SAAS,MAAM,EAAEC,aAAW;GACvD;AACF,QAAO;;AAGT,8BAAe;;;;;;;;;;;;ACPf,SAAS,iBAAiB,QAAQ,aAAa;AAC7C,QAAO,SAAS,YAAY,UAAU;EACpC,IAAI,OAAOC,gBAAQ,WAAW,GAAGC,2BAAkBC,yBAC/C,cAAc,cAAc,aAAa,GAAG,EAAE;AAElD,SAAO,KAAK,YAAY,QAAQC,sBAAa,UAAU,EAAE,EAAE,YAAY;;;AAI3E,gCAAe;;;;;AChBf,IAAI,cAAc,OAAO;;AAGzB,IAAIC,mBAAiB,YAAY;;;;;;;;;;;;;;;;;;;;;;AAuBjC,IAAI,WAAWC,kBAAS,SAAS,QAAQ,SAAS;AAChD,UAAS,OAAO,OAAO;CAEvB,IAAI,QAAQ;CACZ,IAAI,SAAS,QAAQ;CACrB,IAAI,QAAQ,SAAS,IAAI,QAAQ,KAAK;AAEtC,KAAI,SAASC,wBAAe,QAAQ,IAAI,QAAQ,IAAI,MAAM,CACxD,UAAS;AAGX,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,SAAS,QAAQ;EACrB,IAAI,QAAQC,eAAO,OAAO;EAC1B,IAAI,aAAa;EACjB,IAAI,cAAc,MAAM;AAExB,SAAO,EAAE,aAAa,aAAa;GACjC,IAAI,MAAM,MAAM;GAChB,IAAI,QAAQ,OAAO;AAEnB,OAAI,UAAU,UACTC,WAAG,OAAO,YAAY,KAAK,IAAI,CAACJ,iBAAe,KAAK,QAAQ,IAAI,CACnE,QAAO,OAAO,OAAO;;;AAK3B,QAAO;EACP;AAEF,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnCf,SAAS,kBAAkB,OAAO;AAChC,QAAOK,qBAAa,MAAM,IAAIC,oBAAY,MAAM;;AAGlD,gCAAe;;;;;;;;;;;;;ACvBf,SAAS,kBAAkB,OAAO,OAAO,YAAY;CACnD,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,QAAO,EAAE,QAAQ,OACf,KAAI,WAAW,OAAO,MAAM,OAAO,CACjC,QAAO;AAGX,QAAO;;AAGT,iCAAe;;;;;ACbf,IAAIC,qBAAmB;;;;;;;;;;;;AAavB,SAAS,eAAe,OAAO,UAAQ,UAAU,YAAY;CAC3D,IAAI,QAAQ,IACRC,aAAWC,wBACX,WAAW,MACX,SAAS,MAAM,QACf,SAAS,EAAE,EACX,eAAeC,SAAO;AAE1B,KAAI,CAAC,OACH,QAAO;AAET,KAAI,SACF,YAASC,kBAASD,UAAQE,mBAAU,SAAS,CAAC;AAEhD,KAAI,YAAY;AACd,eAAWC;AACX,aAAW;YAEJH,SAAO,UAAUH,oBAAkB;AAC1C,eAAWO;AACX,aAAW;AACX,aAAS,IAAIC,kBAASL,SAAO;;AAE/B,OACA,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM,QACd,WAAW,YAAY,OAAO,QAAQ,SAAS,MAAM;AAEzD,UAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,MAAI,YAAY,aAAa,UAAU;GACrC,IAAI,cAAc;AAClB,UAAO,cACL,KAAIA,SAAO,iBAAiB,SAC1B,UAAS;AAGb,UAAO,KAAK,MAAM;aAEX,CAACF,WAASE,UAAQ,UAAU,WAAW,CAC9C,QAAO,KAAK,MAAM;;AAGtB,QAAO;;AAGT,8BAAe;;;;;;;;;;;;;;;;;;;;;;;;;ACxCf,IAAI,aAAaM,kBAAS,SAAS,OAAO,UAAQ;AAChD,QAAOC,0BAAkB,MAAM,GAC3BC,wBAAe,OAAOC,qBAAYC,UAAQ,GAAGH,2BAAmB,KAAK,CAAC,GACtE,EAAE;EACN;AAEF,yBAAe;;;;;;;;;;;;;;;;;;AClBf,SAAS,KAAK,OAAO;CACnB,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,QAAO,SAAS,MAAM,SAAS,KAAK;;AAGtC,mBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACSf,SAAS,KAAK,OAAO,GAAG,OAAO;CAC7B,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,KAAI,CAAC,OACH,QAAO,EAAE;AAEX,KAAK,SAAS,MAAM,SAAa,IAAII,kBAAU,EAAE;AACjD,QAAOC,mBAAU,OAAO,IAAI,IAAI,IAAI,GAAG,OAAO;;AAGhD,mBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACTf,SAAS,UAAU,OAAO,GAAG,OAAO;CAClC,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,KAAI,CAAC,OACH,QAAO,EAAE;AAEX,KAAK,SAAS,MAAM,SAAa,IAAIC,kBAAU,EAAE;AACjD,KAAI,SAAS;AACb,QAAOC,mBAAU,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE;;AAG3C,wBAAe;;;;;;;;;;;AC7Bf,SAAS,aAAa,OAAO;AAC3B,QAAO,OAAO,SAAS,aAAa,QAAQC;;AAG9C,4BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACsBf,SAAS,QAAQ,YAAY,UAAU;AAErC,SADWC,gBAAQ,WAAW,GAAGC,qBAAYC,mBACjC,YAAYC,sBAAa,SAAS,CAAC;;AAGjD,sBAAe;;;;;;;;;;;;;;AC9Bf,SAAS,WAAW,OAAO,WAAW;CACpC,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,QAAO,EAAE,QAAQ,OACf,KAAI,CAAC,UAAU,MAAM,QAAQ,OAAO,MAAM,CACxC,QAAO;AAGX,QAAO;;AAGT,0BAAe;;;;;;;;;;;;;ACXf,SAAS,UAAU,YAAY,WAAW;CACxC,IAAI,SAAS;AACb,mBAAS,YAAY,SAAS,OAAO,OAAO,cAAY;AACtD,WAAS,CAAC,CAAC,UAAU,OAAO,OAAOC,aAAW;AAC9C,SAAO;GACP;AACF,QAAO;;AAGT,yBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC2Bf,SAAS,MAAM,YAAY,WAAW,OAAO;CAC3C,IAAI,OAAOC,gBAAQ,WAAW,GAAGC,sBAAaC;AAC9C,KAAI,SAASC,wBAAe,YAAY,WAAW,MAAM,CACvD,aAAY;AAEd,QAAO,KAAK,YAAYC,sBAAa,WAAW,EAAE,CAAC;;AAGrD,oBAAe;;;;;;;;;;;;AC7Cf,SAAS,WAAW,YAAY,WAAW;CACzC,IAAI,SAAS,EAAE;AACf,mBAAS,YAAY,SAAS,OAAO,OAAO,cAAY;AACtD,MAAI,UAAU,OAAO,OAAOC,aAAW,CACrC,QAAO,KAAK,MAAM;GAEpB;AACF,QAAO;;AAGT,0BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC0Bf,SAAS,OAAO,YAAY,WAAW;AAErC,SADWC,gBAAQ,WAAW,GAAGC,uBAAcC,qBACnC,YAAYC,sBAAa,WAAW,EAAE,CAAC;;AAGrD,qBAAe;;;;;;;;;;;ACxCf,SAAS,WAAW,eAAe;AACjC,QAAO,SAAS,YAAY,WAAW,WAAW;EAChD,IAAI,WAAW,OAAO,WAAW;AACjC,MAAI,CAACC,oBAAY,WAAW,EAAE;GAC5B,IAAI,WAAWC,sBAAa,WAAW,EAAE;AACzC,gBAAaC,aAAK,WAAW;AAC7B,eAAY,SAAS,KAAK;AAAE,WAAO,SAAS,SAAS,MAAM,KAAK,SAAS;;;EAE3E,IAAI,QAAQ,cAAc,YAAY,WAAW,UAAU;AAC3D,SAAO,QAAQ,KAAK,SAAS,WAAW,WAAW,SAAS,SAAS;;;AAIzE,0BAAe;;;;ACnBf,IAAIC,cAAY,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCrB,SAAS,UAAU,OAAO,WAAW,WAAW;CAC9C,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,KAAI,CAAC,OACH,QAAO;CAET,IAAI,QAAQ,aAAa,OAAO,IAAIC,kBAAU,UAAU;AACxD,KAAI,QAAQ,EACV,SAAQD,YAAU,SAAS,OAAO,EAAE;AAEtC,QAAOE,uBAAc,OAAOC,sBAAa,WAAW,EAAE,EAAE,MAAM;;AAGhE,wBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACff,IAAI,OAAOC,oBAAWC,kBAAU;AAEhC,mBAAe;;;;;;;;;;;;;;;;;;;;;;ACvBf,SAAS,KAAK,OAAO;AACnB,QAAQ,SAAS,MAAM,SAAU,MAAM,KAAK;;AAG9C,mBAAe;;;;;;;;;;;;ACXf,SAAS,QAAQ,YAAY,UAAU;CACrC,IAAI,QAAQ,IACR,SAASC,oBAAY,WAAW,GAAG,MAAM,WAAW,OAAO,GAAG,EAAE;AAEpE,mBAAS,YAAY,SAAS,OAAO,KAAK,cAAY;AACpD,SAAO,EAAE,SAAS,SAAS,OAAO,KAAKC,aAAW;GAClD;AACF,QAAO;;AAGT,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC0Bf,SAASC,MAAI,YAAY,UAAU;AAEjC,SADWC,gBAAQ,WAAW,GAAGC,oBAAWC,kBAChC,YAAYC,sBAAa,UAAU,EAAE,CAAC;;AAGpD,kBAAeJ;;;;;;;;;;;;;;;;;;;;;;;;;AC5Bf,SAASK,UAAQ,YAAY,UAAU;AACrC,QAAOC,qBAAYC,YAAI,YAAY,SAAS,EAAE,EAAE;;AAGlD,sBAAeF;;;;;ACrBf,IAAIG,mBAHc,OAAO,UAGQ;;;;;;;;;;;;;;;;;;;;;;;;AAyBjC,IAAI,UAAUC,0BAAiB,SAAS,QAAQ,OAAO,KAAK;AAC1D,KAAID,iBAAe,KAAK,QAAQ,IAAI,CAClC,QAAO,KAAK,KAAK,MAAM;KAEvB,0BAAgB,QAAQ,KAAK,CAAC,MAAM,CAAC;EAEvC;AAEF,sBAAe;;;;;ACpCf,IAAIE,mBAHc,OAAO,UAGQ;;;;;;;;;AAUjC,SAAS,QAAQ,QAAQ,KAAK;AAC5B,QAAO,UAAU,QAAQA,iBAAe,KAAK,QAAQ,IAAI;;AAG3D,uBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACYf,SAAS,IAAI,QAAQ,MAAM;AACzB,QAAO,UAAU,QAAQC,iBAAQ,QAAQ,MAAMC,iBAAQ;;AAGzD,kBAAe;;;;;AC7Bf,IAAI,YAAY;;;;;;;;;;;;;;;;;;AAmBhB,SAAS,SAAS,OAAO;AACvB,QAAO,OAAO,SAAS,YACpB,CAACC,gBAAQ,MAAM,IAAIC,qBAAa,MAAM,IAAIC,oBAAW,MAAM,IAAI;;AAGpE,uBAAe;;;;;;;;;;;;;;ACjBf,SAAS,WAAW,QAAQ,OAAO;AACjC,QAAOC,kBAAS,OAAO,SAAS,KAAK;AACnC,SAAO,OAAO;GACd;;AAGJ,0BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACWf,SAAS,OAAO,QAAQ;AACtB,QAAO,UAAU,OAAO,EAAE,GAAGC,oBAAW,QAAQC,aAAK,OAAO,CAAC;;AAG/D,qBAAe;;;;AC1Bf,IAAIC,cAAY,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCrB,SAAS,SAAS,YAAY,OAAO,WAAW,OAAO;AACrD,cAAaC,oBAAY,WAAW,GAAG,aAAaC,eAAO,WAAW;AACtE,aAAa,aAAa,CAAC,QAASC,kBAAU,UAAU,GAAG;CAE3D,IAAI,SAAS,WAAW;AACxB,KAAI,YAAY,EACd,aAAYH,YAAU,SAAS,WAAW,EAAE;AAE9C,QAAOI,iBAAS,WAAW,GACtB,aAAa,UAAU,WAAW,QAAQ,OAAO,UAAU,GAAG,KAC9D,CAAC,CAAC,UAAUC,qBAAY,YAAY,OAAO,UAAU,GAAG;;AAG/D,uBAAe;;;;AChDf,IAAI,YAAY,KAAK;;;;;;;;;;;;;;;;;;;;;;;;AAyBrB,SAAS,QAAQ,OAAO,OAAO,WAAW;CACxC,IAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,KAAI,CAAC,OACH,QAAO;CAET,IAAI,QAAQ,aAAa,OAAO,IAAIC,kBAAU,UAAU;AACxD,KAAI,QAAQ,EACV,SAAQ,UAAU,SAAS,OAAO,EAAE;AAEtC,QAAOC,qBAAY,OAAO,OAAO,MAAM;;AAGzC,sBAAe;;;;;AC/Bf,IAAI,SAAS,gBACT,SAAS;;AAMb,IAAI,iBAHc,OAAO,UAGQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCjC,SAAS,QAAQ,OAAO;AACtB,KAAI,SAAS,KACX,QAAO;AAET,KAAIC,oBAAY,MAAM,KACjBC,gBAAQ,MAAM,IAAI,OAAO,SAAS,YAAY,OAAO,MAAM,UAAU,cACpEC,iBAAS,MAAM,IAAIC,qBAAa,MAAM,IAAIC,oBAAY,MAAM,EAChE,QAAO,CAAC,MAAM;CAEhB,IAAI,MAAMC,gBAAO,MAAM;AACvB,KAAI,OAAO,UAAU,OAAO,OAC1B,QAAO,CAAC,MAAM;AAEhB,KAAIC,qBAAY,MAAM,CACpB,QAAO,CAACC,kBAAS,MAAM,CAAC;AAE1B,MAAK,IAAI,OAAO,MACd,KAAI,eAAe,KAAK,OAAO,IAAI,CACjC,QAAO;AAGX,QAAO;;AAGT,sBAAe;;;;;ACxEf,IAAI,YAAY;;;;;;;;AAShB,SAAS,aAAa,OAAO;AAC3B,QAAOC,qBAAa,MAAM,IAAIC,oBAAW,MAAM,IAAI;;AAGrD,4BAAe;;;;ACZf,IAAI,eAAeC,qBAAYA,kBAAS;;;;;;;;;;;;;;;;;;AAmBxC,IAAI,WAAW,eAAeC,mBAAU,aAAa,GAAGC;AAExD,uBAAe;;;;;;;;;;;;;;;;;;;;;ACTf,SAAS,YAAY,OAAO;AAC1B,QAAO,UAAU;;AAGnB,0BAAe;;;;;;;;;;;;;ACZf,SAAS,OAAO,OAAO,OAAO;AAC5B,QAAO,QAAQ;;AAGjB,sBAAe;;;;;;;;;;;;;;ACDf,SAAS,aAAa,OAAO,UAAU,YAAY;CACjD,IAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM,QACd,UAAU,SAAS,MAAM;AAE7B,MAAI,WAAW,SAAS,aAAa,SAC5B,YAAY,WAAW,CAACC,iBAAS,QAAQ,GAC1C,WAAW,SAAS,SAAS,GAEnC,IAAI,WAAW,SACX,SAAS;;AAGjB,QAAO;;AAGT,4BAAe;;;;;;;;;;;;;;;;;;;;;;ACTf,SAAS,IAAI,OAAO;AAClB,QAAQ,SAAS,MAAM,SACnBC,sBAAa,OAAOC,kBAAUC,gBAAO,GACrC;;AAGN,kBAAe;;;;;AC3Bf,IAAI,kBAAkB;;;;;;;;;;;;;;;;;;;;;AAsBtB,SAAS,OAAO,WAAW;AACzB,KAAI,OAAO,aAAa,WACtB,OAAM,IAAI,UAAU,gBAAgB;AAEtC,QAAO,WAAW;EAChB,IAAI,OAAO;AACX,UAAQ,KAAK,QAAb;GACE,KAAK,EAAG,QAAO,CAAC,UAAU,KAAK,KAAK;GACpC,KAAK,EAAG,QAAO,CAAC,UAAU,KAAK,MAAM,KAAK,GAAG;GAC7C,KAAK,EAAG,QAAO,CAAC,UAAU,KAAK,MAAM,KAAK,IAAI,KAAK,GAAG;GACtD,KAAK,EAAG,QAAO,CAAC,UAAU,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;;AAEjE,SAAO,CAAC,UAAU,MAAM,MAAM,KAAK;;;AAIvC,qBAAe;;;;;;;;;;;;;;ACvBf,SAAS,QAAQ,QAAQ,MAAM,OAAO,YAAY;AAChD,KAAI,CAACC,iBAAS,OAAO,CACnB,QAAO;AAET,QAAOC,kBAAS,MAAM,OAAO;CAE7B,IAAI,QAAQ,IACR,SAAS,KAAK,QACd,YAAY,SAAS,GACrB,SAAS;AAEb,QAAO,UAAU,QAAQ,EAAE,QAAQ,QAAQ;EACzC,IAAI,MAAMC,eAAM,KAAK,OAAO,EACxB,WAAW;AAEf,MAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,YAC1D,QAAO;AAGT,MAAI,SAAS,WAAW;GACtB,IAAI,WAAW,OAAO;AACtB,cAAW,aAAa,WAAW,UAAU,KAAK,OAAO,GAAG;AAC5D,OAAI,aAAa,OACf,YAAWF,iBAAS,SAAS,GACzB,WACCG,iBAAQ,KAAK,QAAQ,GAAG,GAAG,EAAE,GAAG,EAAE;;AAG3C,uBAAY,QAAQ,KAAK,SAAS;AAClC,WAAS,OAAO;;AAElB,QAAO;;AAGT,uBAAe;;;;;;;;;;;;;ACrCf,SAAS,WAAW,QAAQ,OAAO,WAAW;CAC5C,IAAI,QAAQ,IACR,SAAS,MAAM,QACf,SAAS,EAAE;AAEf,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,OAAO,MAAM,QACb,QAAQC,iBAAQ,QAAQ,KAAK;AAEjC,MAAI,UAAU,OAAO,KAAK,CACxB,kBAAQ,QAAQC,kBAAS,MAAM,OAAO,EAAE,MAAM;;AAGlD,QAAO;;AAGT,0BAAe;;;;;;;;;;;;;;;;;;;;;;ACNf,SAAS,OAAO,QAAQ,WAAW;AACjC,KAAI,UAAU,KACZ,QAAO,EAAE;CAEX,IAAI,QAAQC,kBAASC,sBAAa,OAAO,EAAE,SAAS,MAAM;AACxD,SAAO,CAAC,KAAK;GACb;AACF,aAAYC,sBAAa,UAAU;AACnC,QAAOC,oBAAW,QAAQ,OAAO,SAAS,OAAO,MAAM;AACrD,SAAO,UAAU,OAAO,KAAK,GAAG;GAChC;;AAGJ,qBAAe;;;;;;;;;;;;;;;;;ACvBf,SAAS,WAAW,YAAY,UAAU,aAAa,WAAW,UAAU;AAC1E,UAAS,YAAY,SAAS,OAAO,OAAO,cAAY;AACtD,gBAAc,aACT,YAAY,OAAO,SACpB,SAAS,aAAa,OAAO,OAAOC,aAAW;GACnD;AACF,QAAO;;AAGT,0BAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACqBf,SAAS,OAAO,YAAY,UAAU,aAAa;CACjD,IAAI,OAAOC,gBAAQ,WAAW,GAAGC,uBAAcC,qBAC3C,YAAY,UAAU,SAAS;AAEnC,QAAO,KAAK,YAAYC,sBAAa,UAAU,EAAE,EAAE,aAAa,WAAWC,kBAAS;;AAGtF,qBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACVf,SAAS,OAAO,YAAY,WAAW;AAErC,SADWC,gBAAQ,WAAW,GAAGC,uBAAcC,qBACnC,YAAYC,eAAOC,sBAAa,WAAW,EAAE,CAAC,CAAC;;AAG7D,qBAAe;;;;;;;;;;;;;AClCf,SAAS,SAAS,YAAY,WAAW;CACvC,IAAI;AAEJ,mBAAS,YAAY,SAAS,OAAO,OAAO,cAAY;AACtD,WAAS,UAAU,OAAO,OAAOC,aAAW;AAC5C,SAAO,CAAC;GACR;AACF,QAAO,CAAC,CAAC;;AAGX,wBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACqBf,SAAS,KAAK,YAAY,WAAW,OAAO;CAC1C,IAAI,OAAOC,gBAAQ,WAAW,GAAGC,qBAAYC;AAC7C,KAAI,SAASC,wBAAe,YAAY,WAAW,MAAM,CACvD,aAAY;AAEd,QAAO,KAAK,YAAYC,sBAAa,WAAW,EAAE,CAAC;;AAGrD,mBAAe;;;;;;;;;;;ACpCf,IAAI,YAAY,EAAEC,gBAAQ,IAAIC,oBAAW,IAAID,aAAI,GAAE,GAAG,CAAC,CAAC,CAAC,MAT1C,YAS6DE,eAAO,SAAS,UAAQ;AAClG,QAAO,IAAIF,aAAIG,SAAO;;AAGxB,yBAAe;;;;;ACVf,IAAI,mBAAmB;;;;;;;;;;AAWvB,SAAS,SAAS,OAAO,UAAU,YAAY;CAC7C,IAAI,QAAQ,IACRC,aAAWC,wBACX,SAAS,MAAM,QACf,WAAW,MACX,SAAS,EAAE,EACX,OAAO;AAEX,KAAI,YAAY;AACd,aAAW;AACX,eAAWC;YAEJ,UAAU,kBAAkB;EACnC,IAAI,MAAM,WAAW,OAAOC,mBAAU,MAAM;AAC5C,MAAI,IACF,QAAOC,oBAAW,IAAI;AAExB,aAAW;AACX,eAAWC;AACX,SAAO,IAAIC,mBAAQ;OAGnB,QAAO,WAAW,EAAE,GAAG;AAEzB,OACA,QAAO,EAAE,QAAQ,QAAQ;EACvB,IAAI,QAAQ,MAAM,QACd,WAAW,WAAW,SAAS,MAAM,GAAG;AAE5C,UAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,MAAI,YAAY,aAAa,UAAU;GACrC,IAAI,YAAY,KAAK;AACrB,UAAO,YACL,KAAI,KAAK,eAAe,SACtB,UAAS;AAGb,OAAI,SACF,MAAK,KAAK,SAAS;AAErB,UAAO,KAAK,MAAM;aAEX,CAACN,WAAS,MAAM,UAAU,WAAW,EAAE;AAC9C,OAAI,SAAS,OACX,MAAK,KAAK,SAAS;AAErB,UAAO,KAAK,MAAM;;;AAGtB,QAAO;;AAGT,wBAAe;;;;;;;;;;;;;;;;;;;;;;ACnDf,SAAS,KAAK,OAAO;AACnB,QAAQ,SAAS,MAAM,SAAUO,kBAAS,MAAM,GAAG,EAAE;;AAGvD,mBAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;ACEf,SAAS,OAAO,OAAO,UAAU;AAC/B,QAAQ,SAAS,MAAM,SAAUC,kBAAS,OAAOC,sBAAa,UAAU,EAAE,CAAC,GAAG,EAAE;;AAGlF,qBAAe;;;;AC9Bf,SAAgB,YAAY,KAAK;;AAE7B,KAAI,WAAW,QAAQ,MACnB,SAAQ,MAAM,UAAU,MAAM;;AAGtC,SAAgB,cAAc,KAAK;;AAE/B,KAAI,WAAW,QAAQ,KAEnB,SAAQ,KAAK,YAAY,MAAM;;;;;ACVvC,SAAgB,MAAM,MAAM;CACxB,MAAM,yBAAQ,IAAI,MAAM,EAAC,SAAS;CAClC,MAAM,MAAM,MAAM;AAGlB,QAAO;EAAE,uBAFG,IAAI,MAAM,EAAC,SAAS,GACZ;EACE,OAAO;EAAK;;;;;ACJtC,SAAgB,iBAAiB,cAAc;CAC3C,SAAS,kBAAkB;AAE3B,iBAAgB,YAAY;CAC5B,MAAM,eAAe,IAAI,iBAAiB;CAC1C,SAAS,aAAa;AAClB,SAAO,OAAO,aAAa;;AAI/B,aAAY;AACZ,aAAY;AAIR,QAAO;;;;;ACdf,SAASC,aAAW,SAAS;AACzB,KAAIC,gBAAc,QAAQ,CACtB,QAAO,QAAQ;KAGf,QAAO,QAAQ;;AAIvB,SAASA,gBAAc,KAAK;AACxB,QAAOC,iBAAS,IAAI,MAAM,IAAI,IAAI,UAAU;;AAEhD,IAAa,qBAAb,MAAgC;CAC5B,IAAI,aAAa;AACb,SAAO,KAAK;;CAEhB,IAAI,WAAW,OAAO;AAClB,OAAK,cAAc;;CAEvB,YAAY,aAAa;AACrB,OAAK,cAAc;;CAEvB,OAAO,SAAS;AACZ,UAAQ,MAAM,KAAK;AACnB,kBAAQ,KAAK,aAAa,SAAS;AAC/B,QAAK,OAAO,QAAQ;IACtB;;;AAGV,IAAa,cAAb,cAAiC,mBAAmB;CAChD,YAAY,SAAS;AACjB,QAAM,EAAE,CAAC;AACT,OAAK,MAAM;AACX,iBAAO,MAAMC,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;CAEzD,IAAI,WAAW,YAAY;CAG3B,IAAI,aAAa;AACb,MAAI,KAAK,mBAAmB,OACxB,QAAO,KAAK,eAAe;AAE/B,SAAO,EAAE;;CAEb,OAAO,SAAS;AACZ,UAAQ,MAAM,KAAK;;;AAI3B,IAAa,OAAb,cAA0B,mBAAmB;CACzC,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,UAAU;AACf,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,cAAb,cAAiC,mBAAmB;CAChD,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,oBAAoB;AACzB,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,SAAb,cAA4B,mBAAmB;CAC3C,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,MAAM;AACX,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,sBAAb,cAAyC,mBAAmB;CACxD,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,MAAM;AACX,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,mCAAb,cAAsD,mBAAmB;CACrE,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,MAAM;AACX,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,aAAb,cAAgC,mBAAmB;CAC/C,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,MAAM;AACX,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,0BAAb,cAA6C,mBAAmB;CAC5D,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,MAAM;AACX,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,cAAb,cAAiC,mBAAmB;CAChD,IAAI,aAAa;AACb,SAAO,KAAK;;CAEhB,IAAI,WAAW,OAAO;AAClB,OAAK,cAAc;;CAEvB,YAAY,SAAS;AACjB,QAAM,QAAQ,WAAW;AACzB,OAAK,MAAM;AACX,OAAK,oBAAoB;AACzB,OAAK,gBAAgB;AACrB,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;;AAG7D,IAAa,WAAb,MAAsB;CAClB,YAAY,SAAS;AACjB,OAAK,MAAM;AACX,iBAAO,MAAMA,eAAO,UAAU,MAAM,MAAM,OAAU,CAAC;;CAEzD,OAAO,SAAS;AACZ,UAAQ,MAAM,KAAK;;;AAG3B,SAAgB,iBAAiB,UAAU;AACvC,QAAOC,YAAI,UAAU,oBAAoB;;AAE7C,SAAgB,oBAAoB,MAAM;CACtC,SAAS,kBAAkB,YAAY;AACnC,SAAOA,YAAI,YAAY,oBAAoB;;;AAG/C,KAAI,gBAAgB,aAAa;EAC7B,MAAM,wBAAwB;GAC1B,MAAM;GACN,MAAM,KAAK;GACX,KAAK,KAAK;GACb;AACD,MAAIF,iBAAS,KAAK,MAAM,CACpB,uBAAsB,QAAQ,KAAK;AAEvC,SAAO;YAEF,gBAAgB,YACrB,QAAO;EACH,MAAM;EACN,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,OACrB,QAAO;EACH,MAAM;EACN,KAAK,KAAK;EACV,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,oBACrB,QAAO;EACH,MAAM;EACN,KAAK,KAAK;EACV,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,iCACrB,QAAO;EACH,MAAM;EACN,KAAK,KAAK;EACV,WAAY,oBAAoB,IAAI,SAAS,EAAE,cAAc,KAAK,WAAW,CAAC,CAAC;EAC/E,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,wBACrB,QAAO;EACH,MAAM;EACN,KAAK,KAAK;EACV,WAAY,oBAAoB,IAAI,SAAS,EAAE,cAAc,KAAK,WAAW,CAAC,CAAC;EAC/E,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,WACrB,QAAO;EACH,MAAM;EACN,KAAK,KAAK;EACV,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,YACrB,QAAO;EACH,MAAM;EACN,KAAK,KAAK;EACV,YAAY,kBAAkB,KAAK,WAAW;EACjD;UAEI,gBAAgB,UAAU;EAC/B,MAAM,qBAAqB;GACvB,MAAM;GACN,MAAM,KAAK,aAAa;GACxB,OAAOF,aAAW,KAAK,aAAa;GACpC,KAAK,KAAK;GACb;AACD,MAAIE,iBAAS,KAAK,MAAM,CACpB,oBAAmB,gBAAgB,KAAK;EAE5C,MAAM,UAAU,KAAK,aAAa;AAClC,MAAI,KAAK,aAAa,QAClB,oBAAmB,UAAUG,iBAAS,QAAQ,GACxC,QAAQ,SACR;AAEV,SAAO;YAEF,gBAAgB,KACrB,QAAO;EACH,MAAM;EACN,MAAM,KAAK;EACX,SAAS,KAAK;EACd,YAAY,kBAAkB,KAAK,WAAW;EACjD;KAID,OAAM,MAAM,uBAAuB;;;;;AC5N3C,IAAa,cAAb,MAAyB;CACrB,MAAM,MAAM;EACR,MAAM,UAAU;AAChB,UAAQ,QAAQ,aAAhB;GACI,KAAK,YACD,QAAO,KAAK,iBAAiB,QAAQ;GACzC,KAAK,YACD,QAAO,KAAK,iBAAiB,QAAQ;GACzC,KAAK,OACD,QAAO,KAAK,YAAY,QAAQ;GACpC,KAAK,oBACD,QAAO,KAAK,yBAAyB,QAAQ;GACjD,KAAK,iCACD,QAAO,KAAK,sCAAsC,QAAQ;GAC9D,KAAK,wBACD,QAAO,KAAK,6BAA6B,QAAQ;GACrD,KAAK,WACD,QAAO,KAAK,gBAAgB,QAAQ;GACxC,KAAK,YACD,QAAO,KAAK,iBAAiB,QAAQ;GACzC,KAAK,SACD,QAAO,KAAK,cAAc,QAAQ;GACtC,KAAK,KACD,QAAO,KAAK,UAAU,QAAQ;GAElC,QACI,OAAM,MAAM,uBAAuB;;;;CAI/C,iBAAiB,MAAM;;CAEvB,iBAAiB,MAAM;;CAEvB,YAAY,MAAM;;CAElB,gBAAgB,MAAM;;CAEtB,yBAAyB,MAAM;;CAE/B,sCAAsC,MAAM;;CAE5C,6BAA6B,MAAM;;CAEnC,iBAAiB,MAAM;;CAEvB,cAAc,MAAM;;CAEpB,UAAU,MAAM;;;;;AC/CpB,SAAgB,eAAe,MAAM;AACjC,QAAQ,gBAAgB,eACpB,gBAAgB,UAChB,gBAAgB,cAChB,gBAAgB,uBAChB,gBAAgB,oCAChB,gBAAgB,2BAChB,gBAAgB,YAChB,gBAAgB;;AAExB,SAAgB,eAAe,MAAM,iBAAiB,EAAE,EAAE;AAItD,KAH2B,gBAAgB,UACvC,gBAAgB,cAChB,gBAAgB,wBAEhB,QAAO;AAKX,KAAI,gBAAgB,YAEhB,QAAOC,aAAK,KAAK,aAAa,YAAY;AACtC,SAAO,eAAe,SAAS,eAAe;GAChD;UAEG,gBAAgB,eAAeC,iBAAS,gBAAgB,KAAK,CAElE,QAAO;UAEF,gBAAgB,oBAAoB;AACzC,MAAI,gBAAgB,YAChB,gBAAe,KAAK,KAAK;AAE7B,SAAOC,cAAM,KAAK,aAAa,YAAY;AACvC,UAAO,eAAe,SAAS,eAAe;IAChD;OAGF,QAAO;;AAGf,SAAgB,gBAAgB,MAAM;AAClC,QAAO,gBAAgB;;AAE3B,SAAgBC,uBAAqB,MAAM;;AAEvC,KAAI,gBAAgB,YAChB,QAAO;UAEF,gBAAgB,OACrB,QAAO;UAEF,gBAAgB,YACrB,QAAO;UAEF,gBAAgB,oBACrB,QAAO;UAEF,gBAAgB,iCACrB,QAAO;UAEF,gBAAgB,wBACrB,QAAO;UAEF,gBAAgB,WACrB,QAAO;UAEF,gBAAgB,SACrB,QAAO;KAIP,OAAM,MAAM,uBAAuB;;;;;;;;ACtE3C,IAAa,aAAb,MAAwB;CACpB,KAAK,MAAM,WAAW,EAAE,EAAE;AACtB,kBAAQ,KAAK,aAAa,SAAS,UAAU;GACzC,MAAM,WAAWC,aAAK,KAAK,YAAY,QAAQ,EAAE;;AAEjD,OAAI,mBAAmB,YACnB,MAAK,YAAY,SAAS,UAAU,SAAS;YAExC,mBAAmB,SACxB,MAAK,aAAa,SAAS,UAAU,SAAS;YAEzC,mBAAmB,YACxB,MAAK,SAAS,SAAS,UAAU,SAAS;YAErC,mBAAmB,OACxB,MAAK,WAAW,SAAS,UAAU,SAAS;YAEvC,mBAAmB,oBACxB,MAAK,eAAe,SAAS,UAAU,SAAS;YAE3C,mBAAmB,iCACxB,MAAK,kBAAkB,SAAS,UAAU,SAAS;YAE9C,mBAAmB,wBACxB,MAAK,YAAY,SAAS,UAAU,SAAS;YAExC,mBAAmB,WACxB,MAAK,SAAS,SAAS,UAAU,SAAS;YAErC,mBAAmB,YACxB,MAAK,OAAO,SAAS,UAAU,SAAS;OAGxC,OAAM,MAAM,uBAAuB;IAEzC;;CAEN,aAAa,UAAU,UAAU,UAAU;CAC3C,YAAY,SAAS,UAAU,UAAU;CACzC,SAAS,UAAU,UAAU,UAAU;EAEnC,MAAM,aAAa,SAAS,OAAO,SAAS;AAC5C,OAAK,KAAK,UAAU,WAAW;;CAEnC,WAAW,YAAY,UAAU,UAAU;EAEvC,MAAM,aAAa,SAAS,OAAO,SAAS;AAC5C,OAAK,KAAK,YAAY,WAAW;;CAErC,eAAe,gBAAgB,UAAU,UAAU;EAE/C,MAAM,qBAAqB,CACvB,IAAI,OAAO,EAAE,YAAY,eAAe,YAAY,CAAC,CACxD,CAAC,OAAO,UAAU,SAAS;AAC5B,OAAK,KAAK,gBAAgB,mBAAmB;;CAEjD,kBAAkB,mBAAmB,UAAU,UAAU;EAErD,MAAM,wBAAwB,+BAA+B,mBAAmB,UAAU,SAAS;AACnG,OAAK,KAAK,mBAAmB,sBAAsB;;CAEvD,SAAS,UAAU,UAAU,UAAU;EAEnC,MAAM,eAAe,CACjB,IAAI,OAAO,EAAE,YAAY,SAAS,YAAY,CAAC,CAClD,CAAC,OAAO,UAAU,SAAS;AAC5B,OAAK,KAAK,UAAU,aAAa;;CAErC,YAAY,aAAa,UAAU,UAAU;EAEzC,MAAM,kBAAkB,+BAA+B,aAAa,UAAU,SAAS;AACvF,OAAK,KAAK,aAAa,gBAAgB;;CAE3C,OAAO,QAAQ,UAAU,UAAU;EAE/B,MAAM,aAAa,SAAS,OAAO,SAAS;AAE5C,kBAAQ,OAAO,aAAa,QAAQ;GAIhC,MAAM,cAAc,IAAI,YAAY,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC;AAC1D,QAAK,KAAK,aAAa,WAAW;IACpC;;;AAGV,SAAS,+BAA+B,YAAY,UAAU,UAAU;AASpE,QARmB,CACf,IAAI,OAAO,EACP,YAAY,CACR,IAAI,SAAS,EAAE,cAAc,WAAW,WAAW,CAAC,CACvD,CAAC,OAAO,WAAW,WAAW,EAClC,CAAC,CACL,CACiC,OAAO,UAAU,SAAS;;;;;ACjGhE,SAAgB,MAAM,MAAM;;AAExB,KAAI,gBAAgB,YAShB,QAAO,MAAM,KAAK,eAAe;UAE5B,gBAAgB,SACrB,QAAO,iBAAiB,KAAK;UAExB,eAAe,KAAK,CACzB,QAAO,iBAAiB,KAAK;UAExB,gBAAgB,KAAK,CAC1B,QAAO,kBAAkB,KAAK;KAG9B,OAAM,MAAM,uBAAuB;;AAG3C,SAAgB,iBAAiB,MAAM;CACnC,IAAI,WAAW,EAAE;CACjB,MAAM,MAAM,KAAK;CACjB,IAAI,iBAAiB;CACrB,IAAI,yBAAyB,IAAI,SAAS;CAC1C,IAAI;CAEJ,IAAI,0BAA0B;AAE9B,QAAO,0BAA0B,yBAAyB;AACtD,gBAAc,IAAI;AAClB,4BAA0B,eAAe,YAAY;AACrD,aAAW,SAAS,OAAO,MAAM,YAAY,CAAC;AAC9C,mBAAiB,iBAAiB;AAClC,2BAAyB,IAAI,SAAS;;AAE1C,QAAOC,aAAK,SAAS;;AAEzB,SAAgB,kBAAkB,MAAM;AAIpC,QAAOA,aAAKC,gBAHkBC,YAAI,KAAK,aAAa,cAAc;AAC9D,SAAO,MAAM,UAAU;GACzB,CACwC,CAAC;;AAE/C,SAAgB,iBAAiB,UAAU;AACvC,QAAO,CAAC,SAAS,aAAa;;;;;ACpDlC,MAAa,KAAK;;;;ACMlB,IAAa,sBAAb,cAAyC,WAAW;CAChD,YAAY,SAAS;AACjB,SAAO;AACP,OAAK,UAAU;AACf,OAAK,UAAU,EAAE;;CAErB,eAAe;AACX,OAAK,KAAK,KAAK,QAAQ;AACvB,SAAO,KAAK;;CAEhB,aAAa,UAAU,UAAU,UAAU;CAG3C,YAAY,SAAS,UAAU,UAAU;EACrC,MAAM,aAAa,8BAA8B,QAAQ,gBAAgB,QAAQ,IAAI,GACjF,KAAK,QAAQ;EAGjB,MAAM,uBAAuB,MADZ,IAAI,YAAY,EAAE,YADlB,SAAS,OAAO,SAAS,EACe,CAAC,CACd;AAC5C,OAAK,QAAQ,cAAc;;;AAGnC,SAAgB,uBAAuB,gBAAgB;CACnD,MAAM,gBAAgB,EAAE;AACxB,iBAAQ,iBAAiB,YAAY;AAEjC,iBAAO,eADgB,IAAI,oBAAoB,QAAQ,CAAC,cAAc,CACjC;GACvC;AACF,QAAO;;AAEX,SAAgB,8BAA8B,OAAO,mBAAmB;AACpE,QAAO,MAAM,OAAO,oBAAoB;;;;;ACtC5C,SAAgB,GAAG,MAAM;AACrB,QAAO,KAAK,WAAW,EAAE;;AAE7B,SAAgB,YAAY,MAAM,KAAK;AACnC,KAAI,MAAM,QAAQ,KAAK,CACnB,MAAK,QAAQ,SAAU,SAAS;AAC5B,MAAI,KAAK,QAAQ;GACnB;KAGF,KAAI,KAAK,KAAK;;AAGtB,SAAgB,QAAQ,SAAS,SAAS;AACtC,KAAI,QAAQ,aAAa,KACrB,OAAM,oBAAoB;AAEpB,SAAQ;AAClB,SAAQ,WAAW;;AAEvB,SAAgB,cAAc,KAAK;;AAE/B,KAAI,QAAQ,OACR,OAAM,MAAM,0CAA0C;AAE1D,QAAO;;;AAGX,SAAgB,0BAA0B;AACtC,OAAM,MAAM,0CAA0C;;AAE1D,SAAgB,YAAY,KAAK;AAC7B,QAAO,IAAI,YAAY;;;;;AC/B3B,MAAa,kBAAkB,EAAE;AACjC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,IAChC,iBAAgB,KAAK,EAAE;AAE3B,MAAa,gBAAgB,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,gBAAgB;AAC9D,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,IAChC,eAAc,KAAK,EAAE;AAEzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,IAChC,eAAc,KAAK,EAAE;AAGzB,MAAa,kBAAkB;CAC3B,GAAG,IAAI;CACP,GAAG,KAAK;CACR,GAAG,KAAK;CACR,GAAG,KAAK;CACR,GAAG,IAAK;CACR,GAAG,KAAK;CACR,GAAG,IAAK;CACR,GAAG,OAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,SAAS;CACZ,GAAG,SAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACZ,GAAG,IAAS;CACf;;;;ACrCD,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AACvB,MAAM,uBAAuB;AAG7B,IAAa,eAAb,MAA0B;CACtB,cAAc;AACV,OAAK,MAAM;AACX,OAAK,QAAQ;AACb,OAAK,WAAW;;CAEpB,YAAY;AACR,SAAO;GACH,KAAK,KAAK;GACV,OAAO,KAAK;GACZ,UAAU,KAAK;GAClB;;CAEL,aAAa,YAAU;AACnB,OAAK,MAAMC,WAAS;AACpB,OAAK,QAAQA,WAAS;AACtB,OAAK,WAAWA,WAAS;;CAE7B,QAAQ,OAAO;AAEX,OAAK,MAAM;AACX,OAAK,QAAQ;AACb,OAAK,WAAW;AAChB,OAAK,YAAY,IAAI;EACrB,MAAM,QAAQ,KAAK,aAAa;AAChC,OAAK,YAAY,IAAI;EACrB,MAAM,QAAQ;GACV,MAAM;GACN,KAAK;IAAE,OAAO,KAAK;IAAK,KAAK,MAAM;IAAQ;GAC3C,QAAQ;GACR,YAAY;GACZ,WAAW;GACX,SAAS;GACT,QAAQ;GACX;AACD,SAAO,KAAK,cAAc,CACtB,SAAQ,KAAK,SAAS,EAAtB;GACI,KAAK;AACD,YAAQ,OAAO,SAAS;AACxB;GACJ,KAAK;AACD,YAAQ,OAAO,aAAa;AAC5B;GACJ,KAAK;AACD,YAAQ,OAAO,YAAY;AAC3B;GACJ,KAAK;AACD,YAAQ,OAAO,UAAU;AACzB;GACJ,KAAK;AACD,YAAQ,OAAO,SAAS;AACxB;;AAGZ,MAAI,KAAK,QAAQ,KAAK,MAAM,OACxB,OAAM,MAAM,sBAAsB,KAAK,MAAM,UAAU,KAAK,IAAI,CAAC;AAErE,SAAO;GACH,MAAM;GACC;GACA;GACP,KAAK,KAAK,IAAI,EAAE;GACnB;;CAEL,cAAc;EACV,MAAM,OAAO,EAAE;EACf,MAAM,QAAQ,KAAK;AACnB,OAAK,KAAK,KAAK,aAAa,CAAC;AAC7B,SAAO,KAAK,UAAU,KAAK,KAAK;AAC5B,QAAK,YAAY,IAAI;AACrB,QAAK,KAAK,KAAK,aAAa,CAAC;;AAEjC,SAAO;GAAE,MAAM;GAAe,OAAO;GAAM,KAAK,KAAK,IAAI,MAAM;GAAE;;CAErE,cAAc;EACV,MAAM,QAAQ,EAAE;EAChB,MAAM,QAAQ,KAAK;AACnB,SAAO,KAAK,QAAQ,CAChB,OAAM,KAAK,KAAK,MAAM,CAAC;AAE3B,SAAO;GAAE,MAAM;GAAe,OAAO;GAAO,KAAK,KAAK,IAAI,MAAM;GAAE;;CAEtE,OAAO;AACH,MAAI,KAAK,aAAa,CAClB,QAAO,KAAK,WAAW;MAGvB,QAAO,KAAK,MAAM;;CAG1B,YAAY;EACR,MAAM,QAAQ,KAAK;AACnB,UAAQ,KAAK,SAAS,EAAtB;GACI,KAAK,IACD,QAAO;IACH,MAAM;IACN,KAAK,KAAK,IAAI,MAAM;IACvB;GACL,KAAK,IACD,QAAO;IAAE,MAAM;IAAa,KAAK,KAAK,IAAI,MAAM;IAAE;GAEtD,KAAK;AACD,YAAQ,KAAK,SAAS,EAAtB;KACI,KAAK,IACD,QAAO;MACH,MAAM;MACN,KAAK,KAAK,IAAI,MAAM;MACvB;KACL,KAAK,IACD,QAAO;MACH,MAAM;MACN,KAAK,KAAK,IAAI,MAAM;MACvB;;;AAGT,UAAM,MAAM,2BAA2B;GAE3C,KAAK;AACD,SAAK,YAAY,IAAI;IACrB,IAAI;AACJ,YAAQ,KAAK,SAAS,EAAtB;KACI,KAAK;AACD,aAAO;AACP;KACJ,KAAK;AACD,aAAO;AACP;;AAER,kBAAc,KAAK;IACnB,MAAM,cAAc,KAAK,aAAa;AACtC,SAAK,YAAY,IAAI;AACrB,WAAO;KACG;KACN,OAAO;KACP,KAAK,KAAK,IAAI,MAAM;KACvB;;;AAGT,SAAO,yBAAyB;;CAEpC,WAAW,iBAAiB,OAAO;EAC/B,IAAI,QAAQ;EACZ,MAAM,QAAQ,KAAK;AACnB,UAAQ,KAAK,SAAS,EAAtB;GACI,KAAK;AACD,YAAQ;KACJ,SAAS;KACT,QAAQ;KACX;AACD;GACJ,KAAK;AACD,YAAQ;KACJ,SAAS;KACT,QAAQ;KACX;AACD;GACJ,KAAK;AACD,YAAQ;KACJ,SAAS;KACT,QAAQ;KACX;AACD;GACJ,KAAK;IACD,MAAM,UAAU,KAAK,sBAAsB;AAC3C,YAAQ,KAAK,SAAS,EAAtB;KACI,KAAK;AACD,cAAQ;OACK;OACT,QAAQ;OACX;AACD;KACJ,KAAK;MACD,IAAI;AACJ,UAAI,KAAK,SAAS,EAAE;AAChB,gBAAS,KAAK,sBAAsB;AACpC,eAAQ;QACK;QACD;QACX;YAGD,SAAQ;OACK;OACT,QAAQ;OACX;AAEL,WAAK,YAAY,IAAI;AACrB;;AAIR,QAAI,mBAAmB,QAAQ,UAAU,OACrC;AAEJ,kBAAc,MAAM;AACpB;;AAIR,MAAI,mBAAmB,QAAQ,UAAU,OACrC;;AAGJ,MAAI,cAAc,MAAM,EAAE;AACtB,OAAI,KAAK,SAAS,EAAE,KAAK,KAAK;AAC1B,SAAK,YAAY,IAAI;AACrB,UAAM,SAAS;SAGf,OAAM,SAAS;AAEnB,SAAM,OAAO;AACb,SAAM,MAAM,KAAK,IAAI,MAAM;AAC3B,UAAO;;;CAGf,OAAO;EACH,IAAIC;EACJ,MAAM,QAAQ,KAAK;AACnB,UAAQ,KAAK,UAAU,EAAvB;GACI,KAAK;AACD,aAAO,KAAK,QAAQ;AACpB;GACJ,KAAK;AACD,aAAO,KAAK,YAAY;AACxB;GACJ,KAAK;AACD,aAAO,KAAK,gBAAgB;AAC5B;GACJ,KAAK;AACD,aAAO,KAAK,OAAO;AACnB;;AAER,MAAIA,WAAS,UAAa,KAAK,oBAAoB,CAC/C,UAAO,KAAK,kBAAkB;;AAGlC,MAAI,cAAcA,OAAK,EAAE;AACrB,UAAK,MAAM,KAAK,IAAI,MAAM;AAC1B,OAAI,KAAK,cAAc,CACnB,QAAK,aAAa,KAAK,YAAY;AAEvC,UAAOA;;;AAGX,SAAO,yBAAyB;;CAEpC,SAAS;AACL,OAAK,YAAY,IAAI;AACrB,SAAO;GACH,MAAM;GACN,YAAY;GACZ,OAAO;IAAC,GAAG,KAAK;IAAE,GAAG,KAAK;IAAE,GAAG,SAAS;IAAE,GAAG,SAAS;IAAC;GAC1D;;CAEL,aAAa;AACT,OAAK,YAAY,KAAK;AACtB,UAAQ,KAAK,UAAU,EAAvB;GACI,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,IACD,QAAO,KAAK,mBAAmB;GACnC,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,IACD,QAAO,KAAK,sBAAsB;GACtC,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,IACD,QAAO,KAAK,mBAAmB;GACnC,KAAK,IACD,QAAO,KAAK,yBAAyB;GACzC,KAAK,IACD,QAAO,KAAK,kBAAkB;GAClC,KAAK,IACD,QAAO,KAAK,uBAAuB;GACvC,KAAK,IACD,QAAO,KAAK,iCAAiC;GACjD,QACI,QAAO,KAAK,oBAAoB;;;CAG5C,oBAAoB;AAEhB,SAAO;GAAE,MAAM;GAAsB,OADvB,KAAK,iBAAiB;GACe;;CAEvD,uBAAuB;EACnB,IAAI;EACJ,IAAI,aAAa;AACjB,UAAQ,KAAK,SAAS,EAAtB;GACI,KAAK;AACD,UAAM;AACN;GACJ,KAAK;AACD,UAAM;AACN,iBAAa;AACb;GACJ,KAAK;AACD,UAAM;AACN;GACJ,KAAK;AACD,UAAM;AACN,iBAAa;AACb;GACJ,KAAK;AACD,UAAM;AACN;GACJ,KAAK;AACD,UAAM;AACN,iBAAa;AACb;;;AAGR,MAAI,cAAc,IAAI,CAClB,QAAO;GAAE,MAAM;GAAO,OAAO;GAAiB;GAAY;;AAG9D,SAAO,yBAAyB;;CAEpC,oBAAoB;EAChB,IAAI;AACJ,UAAQ,KAAK,SAAS,EAAtB;GACI,KAAK;AACD,iBAAa,GAAG,KAAK;AACrB;GACJ,KAAK;AACD,iBAAa,GAAG,KAAK;AACrB;GACJ,KAAK;AACD,iBAAa,GAAG,KAAK;AACrB;GACJ,KAAK;AACD,iBAAa,GAAG,IAAK;AACrB;GACJ,KAAK;AACD,iBAAa,GAAG,KAAK;AACrB;;;AAGR,MAAI,cAAc,WAAW,CACzB,QAAO;GAAE,MAAM;GAAa,OAAO;GAAY;;AAGnD,SAAO,yBAAyB;;CAEpC,0BAA0B;AACtB,OAAK,YAAY,IAAI;EACrB,MAAM,SAAS,KAAK,SAAS;AAC7B,MAAI,WAAW,KAAK,OAAO,KAAK,MAC5B,OAAM,MAAM,WAAW;AAG3B,SAAO;GAAE,MAAM;GAAa,OADT,OAAO,aAAa,CAAC,WAAW,EAAE,GAAG;GACT;;CAEnD,mBAAmB;AAGf,OAAK,YAAY,IAAI;AACrB,SAAO;GAAE,MAAM;GAAa,OAAO,GAAG,KAAK;GAAE;;CAEjD,wBAAwB;AACpB,OAAK,YAAY,IAAI;AACrB,SAAO,KAAK,eAAe,EAAE;;CAEjC,kCAAkC;AAC9B,OAAK,YAAY,IAAI;AACrB,SAAO,KAAK,eAAe,EAAE;;CAEjC,qBAAqB;AAIjB,SAAO;GAAE,MAAM;GAAa,OAAO,GADf,KAAK,SAAS,CACgB;GAAE;;CAExD,4BAA4B;AACxB,UAAQ,KAAK,UAAU,EAAvB;GAEI,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK,IACD,OAAM,MAAM,MAAM;GACtB,QAEI,QAAO;IAAE,MAAM;IAAa,OAAO,GADlB,KAAK,SAAS,CACgB;IAAE;;;CAG7D,iBAAiB;EACb,MAAM,MAAM,EAAE;EACd,IAAI,aAAa;AACjB,OAAK,YAAY,IAAI;AACrB,MAAI,KAAK,SAAS,EAAE,KAAK,KAAK;AAC1B,QAAK,YAAY,IAAI;AACrB,gBAAa;;AAEjB,SAAO,KAAK,aAAa,EAAE;GACvB,MAAM,OAAO,KAAK,WAAW;AACJ,QAAK;AAC9B,OAAI,YAAY,KAAK,IAAI,KAAK,aAAa,EAAE;AACzC,SAAK,YAAY,IAAI;IACrB,MAAM,KAAK,KAAK,WAAW;AACJ,OAAG;AAE1B,QAAI,YAAY,GAAG,EAAE;AACjB,SAAI,GAAG,QAAQ,KAAK,MAChB,OAAM,MAAM,wCAAwC;AAExD,SAAI,KAAK;MAAE,MAAM,KAAK;MAAO,IAAI,GAAG;MAAO,CAAC;WAE3C;AAED,iBAAY,KAAK,OAAO,IAAI;AAC5B,SAAI,KAAK,GAAG,IAAI,CAAC;AACjB,iBAAY,GAAG,OAAO,IAAI;;SAI9B,aAAY,KAAK,OAAO,IAAI;;AAGpC,OAAK,YAAY,IAAI;AACrB,SAAO;GAAE,MAAM;GAAmB;GAAY,OAAO;GAAK;;CAE9D,YAAY;AACR,UAAQ,KAAK,UAAU,EAAvB;GAEI,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK,SACD,OAAM,MAAM,MAAM;GACtB,KAAK,KACD,QAAO,KAAK,aAAa;GAC7B,QACI,QAAO,KAAK,2BAA2B;;;CAGnD,cAAc;AACV,OAAK,YAAY,KAAK;AACtB,UAAQ,KAAK,UAAU,EAAvB;GAGI,KAAK;AACD,SAAK,YAAY,IAAI;AACrB,WAAO;KAAE,MAAM;KAAa,OAAO,GAAG,KAAS;KAAE;GACrD,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,IACD,QAAO,KAAK,sBAAsB;GACtC,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,IACD,QAAO,KAAK,mBAAmB;GACnC,KAAK,IACD,QAAO,KAAK,yBAAyB;GACzC,KAAK,IACD,QAAO,KAAK,kBAAkB;GAClC,KAAK,IACD,QAAO,KAAK,uBAAuB;GACvC,KAAK,IACD,QAAO,KAAK,iCAAiC;GACjD,QACI,QAAO,KAAK,oBAAoB;;;CAG5C,QAAQ;EACJ,IAAI,YAAY;AAChB,OAAK,YAAY,IAAI;AACrB,UAAQ,KAAK,SAAS,EAAE,EAAxB;GACI,KAAK;AACD,SAAK,YAAY,IAAI;AACrB,SAAK,YAAY,IAAI;AACrB,gBAAY;AACZ;GACJ;AACI,SAAK;AACL;;EAER,MAAM,QAAQ,KAAK,aAAa;AAChC,OAAK,YAAY,IAAI;EACrB,MAAM,WAAW;GACb,MAAM;GACK;GACJ;GACV;AACD,MAAI,UACA,UAAS,SAAS,KAAK;AAE3B,SAAO;;CAEX,kBAAkB;EACd,IAAI,SAAS,KAAK,SAAS;;AAG3B,MAAI,qBAAqB,KAAK,OAAO,KAAK,MACtC,OAAM,MAAM,+BAA+B;AAE/C,SAAO,eAAe,KAAK,KAAK,SAAS,EAAE,CAAC,CACxC,WAAU,KAAK,SAAS;AAE5B,SAAO,SAAS,QAAQ,GAAG;;CAE/B,uBAAuB;EACnB,IAAI,SAAS,KAAK,SAAS;AAC3B,MAAI,eAAe,KAAK,OAAO,KAAK,MAChC,OAAM,MAAM,uBAAuB;AAEvC,SAAO,eAAe,KAAK,KAAK,SAAS,EAAE,CAAC,CACxC,WAAU,KAAK,SAAS;AAE5B,SAAO,SAAS,QAAQ,GAAG;;CAE/B,mBAAmB;EACf,MAAM,WAAW,KAAK,SAAS;AAC/B,UAAQ,UAAR;GAEI,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;GAEL,KAAK;;AAED,SAAM,MAAM,MAAM;GACtB,QACI,QAAO;IAAE,MAAM;IAAa,OAAO,GAAG,SAAS;IAAE;;;CAG7D,eAAe;AACX,UAAQ,KAAK,SAAS,EAAE,EAAxB;GACI,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,IACD,QAAO;GACX,QACI,QAAO;;;CAGnB,cAAc;AACV,SAAO,KAAK,UAAU,KAAK,OAAO,KAAK,YAAY,EAAE;;CAEzD,UAAU;AACN,SAAO,eAAe,KAAK,KAAK,SAAS,EAAE,CAAC;;CAEhD,YAAY,UAAU,GAAG;AACrB,UAAQ,KAAK,SAAS,QAAQ,EAA9B;GACI,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,SACD,QAAO;GACX,QACI,QAAO;;;CAGnB,SAAS;AACL,SAAO,KAAK,QAAQ,IAAI,KAAK,aAAa;;CAE9C,SAAS;AACL,MAAI,KAAK,oBAAoB,CACzB,QAAO;AAEX,UAAQ,KAAK,SAAS,EAAE,EAAxB;GACI,KAAK;GACL,KAAK;GACL,KAAK;GAEL,KAAK,IACD,QAAO;GACX,QACI,QAAO;;;CAGnB,cAAc;AACV,UAAQ,KAAK,SAAS,EAAE,EAAxB;GACI,KAAK;GACL,KAAK,IACD,QAAO;GAEX,KAAK,KACD,SAAQ,KAAK,SAAS,EAAE,EAAxB;IACI,KAAK;IACL,KAAK,IACD,QAAO;IACX,QACI,QAAO;;GAGnB,KAAK,IACD,QAAQ,KAAK,SAAS,EAAE,KAAK,QACxB,KAAK,SAAS,EAAE,KAAK,OAAO,KAAK,SAAS,EAAE,KAAK;GAC1D,QACI,QAAO;;;CAGnB,eAAe;EACX,MAAM,YAAY,KAAK,WAAW;AAClC,MAAI;AACA,UAAO,KAAK,WAAW,KAAK,KAAK;WAE9B,GAAG;AACN,UAAO;YAEH;AACJ,QAAK,aAAa,UAAU;;;CAGpC,qBAAqB;AACjB,UAAQ,KAAK,UAAU,EAAvB;GACI,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,SACD,QAAO;GACX,QACI,QAAO;;;CAGnB,eAAe,SAAS;EACpB,IAAI,YAAY;AAChB,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GAC9B,MAAM,UAAU,KAAK,SAAS;AAC9B,OAAI,gBAAgB,KAAK,QAAQ,KAAK,MAClC,OAAM,MAAM,gCAAgC;AAEhD,gBAAa;;AAGjB,SAAO;GAAE,MAAM;GAAa,OADX,SAAS,WAAW,GAAG;GACK;;CAEjD,SAAS,UAAU,GAAG;AAClB,SAAO,KAAK,MAAM,KAAK,MAAM;;CAEjC,UAAU;EACN,MAAM,WAAW,KAAK,SAAS,EAAE;AACjC,OAAK,YAAY,OAAU;AAC3B,SAAO;;CAEX,YAAY,MAAM;AACd,MAAI,SAAS,UAAa,KAAK,MAAM,KAAK,SAAS,KAC/C,OAAM,MAAM,gBACR,OACA,mBACA,KAAK,MAAM,KAAK,OAChB,kBACA,KAAK,IAAI;AAEjB,MAAI,KAAK,OAAO,KAAK,MAAM,OACvB,OAAM,MAAM,0BAA0B;AAE1C,OAAK;;CAET,IAAI,OAAO;AACP,SAAO;GAAS;GAAO,KAAK,KAAK;GAAK;;;;;;ACvtB9C,IAAa,oBAAb,MAA+B;CAC3B,cAAc,MAAM;AAChB,OAAK,MAAM,OAAO,MAAM;GACpB,MAAM,QAAQ,KAAK;;AAEnB,OAAI,KAAK,eAAe,IAAI,EACxB;QAAI,MAAM,SAAS,OACf,MAAK,MAAM,MAAM;aAEZ,MAAM,QAAQ,MAAM,CACzB,OAAM,SAAS,aAAa;AACxB,UAAK,MAAM,SAAS;OACrB,KAAK;;;;CAKxB,MAAM,MAAM;AACR,UAAQ,KAAK,MAAb;GACI,KAAK;AACD,SAAK,aAAa,KAAK;AACvB;GACJ,KAAK;AACD,SAAK,WAAW,KAAK;AACrB;GACJ,KAAK;AACD,SAAK,iBAAiB,KAAK;AAC3B;GACJ,KAAK;AACD,SAAK,iBAAiB,KAAK;AAC3B;GACJ,KAAK;AACD,SAAK,iBAAiB,KAAK;AAC3B;GACJ,KAAK;AACD,SAAK,eAAe,KAAK;AACzB;GACJ,KAAK;AACD,SAAK,kBAAkB,KAAK;AAC5B;GACJ,KAAK;AACD,SAAK,qBAAqB,KAAK;AAC/B;GACJ,KAAK;AACD,SAAK,eAAe,KAAK;AACzB;GACJ,KAAK;AACD,SAAK,uBAAuB,KAAK;AACjC;GACJ,KAAK;AACD,SAAK,eAAe,KAAK;AACzB;GACJ,KAAK;AACD,SAAK,SAAS,KAAK;AACnB;GACJ,KAAK;AACD,SAAK,WAAW,KAAK;AACrB;GACJ,KAAK;AACD,SAAK,wBAAwB,KAAK;AAClC;GACJ,KAAK;AACD,SAAK,gBAAgB,KAAK;AAC1B;;AAER,OAAK,cAAc,KAAK;;CAE5B,aAAa,MAAM;CACnB,WAAW,MAAM;CACjB,iBAAiB,MAAM;CACvB,iBAAiB,MAAM;CAEvB,iBAAiB,MAAM;CACvB,eAAe,MAAM;CACrB,kBAAkB,MAAM;CACxB,qBAAqB,MAAM;CAC3B,eAAe,MAAM;CACrB,uBAAuB,MAAM;CAE7B,eAAe,MAAM;CACrB,SAAS,MAAM;CACf,WAAW,MAAM;CACjB,wBAAwB,MAAM;CAC9B,gBAAgB,MAAM;;;;;AClF1B,IAAI,iBAAiB,EAAE;AACvB,MAAM,eAAe,IAAI,cAAc;AACvC,SAAgB,aAAa,QAAQ;CACjC,MAAM,YAAY,OAAO,UAAU;AACnC,KAAI,eAAe,eAAe,UAAU,CACxC,QAAO,eAAe;MAErB;EACD,MAAM,YAAY,aAAa,QAAQ,UAAU;AACjD,iBAAe,aAAa;AAC5B,SAAO;;;AAGf,SAAgB,yBAAyB;AACrC,kBAAiB,EAAE;;;;;ACVvB,MAAM,yBAAyB;AAC/B,MAAa,8BAA8B;AAC3C,SAAgB,8BAA8B,QAAQ,sBAAsB,OAAO;AAC/E,KAAI;EACA,MAAM,MAAM,aAAa,OAAO;AAEhC,SADmB,0BAA0B,IAAI,OAAO,EAAE,EAAE,IAAI,MAAM,WAAW;UAG9E,GAAG;;AAIN,MAAI,EAAE,YAAY,wBACd;OAAI,oBACA,eAAc,GAAG,sDACc,OAAO,UAAU,CAAC;;4FAGiD;SAGrG;GACD,IAAI,YAAY;AAChB,OAAI,oBACA,aACI;AAGR,eAAY,GAAG,4BAA4B,wBAChB,OAAO,UAAU,CAAC,gIAGzC,UAAU;;;AAGtB,QAAO,EAAE;;AAEb,SAAgB,0BAA0B,KAAK,QAAQ,YAAY;AAC/D,SAAQ,IAAI,MAAZ;EACI,KAAK;AACD,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,IAClC,2BAA0B,IAAI,MAAM,IAAI,QAAQ,WAAW;AAE/D;EACJ,KAAK;GACD,MAAM,QAAQ,IAAI;AAClB,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACnC,MAAM,OAAO,MAAM;AAEnB,YAAQ,KAAK,MAAb;KACI,KAAK;KAIL,KAAK;KAEL,KAAK;KACL,KAAK;KACL,KAAK;KACL,KAAK;KACL,KAAK,kBACD;;IAER,MAAMC,SAAO;AACb,YAAQA,OAAK,MAAb;KACI,KAAK;AACD,8BAAwBA,OAAK,OAAO,QAAQ,WAAW;AACvD;KACJ,KAAK;AACD,UAAIA,OAAK,eAAe,KACpB,OAAM,MAAM,uBAAuB;AAEvC,sBAAQA,OAAK,QAAQ,SAAS;AAC1B,WAAI,OAAO,SAAS,SAChB,yBAAwB,MAAM,QAAQ,WAAW;YAEhD;QAED,MAAM,QAAQ;AAEd,YAAI,eAAe,KACf,MAAK,IAAI,YAAY,MAAM,MAAM,aAAa,MAAM,IAAI,YACpD,yBAAwB,WAAW,QAAQ,WAAW;aAIzD;AAED,cAAK,IAAI,YAAY,MAAM,MAAM,aAAa,MAAM,MAAM,YAAY,oBAAoB,YACtF,yBAAwB,WAAW,QAAQ,WAAW;AAG1D,aAAI,MAAM,MAAM,oBAAoB;UAChC,MAAM,cAAc,MAAM,QAAQ,qBAC5B,MAAM,OACN;UACN,MAAM,cAAc,MAAM;UAC1B,MAAM,YAAY,yBAAyB,YAAY;UACvD,MAAM,YAAY,yBAAyB,YAAY;AACvD,eAAK,IAAI,aAAa,WAAW,cAAc,WAAW,aACtD,QAAO,cAAc;;;;QAKvC;AACF;KACJ,KAAK;AACD,gCAA0BA,OAAK,OAAO,QAAQ,WAAW;AACzD;KAEJ,QACI,OAAM,MAAM,uBAAuB;;IAG3C,MAAM,uBAAuBA,OAAK,eAAe,UAAaA,OAAK,WAAW,YAAY;AAC1F,QAGCA,OAAK,SAAS,WAAW,gBAAgBA,OAAK,KAAK,SAE/CA,OAAK,SAAS,WAAW,yBAAyB,MACnD;;AAGR;EAEJ,QACI,OAAM,MAAM,wBAAwB;;AAG5C,QAAOC,eAAO,OAAO;;AAEzB,SAAS,wBAAwB,MAAM,QAAQ,YAAY;CACvD,MAAM,mBAAmB,yBAAyB,KAAK;AACvD,QAAO,oBAAoB;AAC3B,KAAI,eAAe,KACf,kBAAiB,MAAM,OAAO;;AAGtC,SAAS,iBAAiB,MAAM,QAAQ;CACpC,MAAM,OAAO,OAAO,aAAa,KAAK;CACtC,MAAM,YAAY,KAAK,aAAa;;AAEpC,KAAI,cAAc,MAAM;EACpB,MAAM,mBAAmB,yBAAyB,UAAU,WAAW,EAAE,CAAC;AAC1E,SAAO,oBAAoB;QAE1B;EACD,MAAM,YAAY,KAAK,aAAa;AACpC,MAAI,cAAc,MAAM;GACpB,MAAM,mBAAmB,yBAAyB,UAAU,WAAW,EAAE,CAAC;AAC1E,UAAO,oBAAoB;;;;AAIvC,SAAS,SAAS,SAAS,iBAAiB;AACxC,QAAOC,aAAK,QAAQ,QAAQ,gBAAgB;AACxC,MAAI,OAAO,gBAAgB,SACvB,QAAOC,iBAAS,iBAAiB,YAAY;OAE5C;GAED,MAAM,QAAQ;AACd,UAAQD,aAAK,kBAAkB,eAAe,MAAM,QAAQ,cAAc,cAAc,MAAM,GAAG,KAAK;;GAE5G;;AAEN,SAAS,gBAAgB,KAAK;CAC1B,MAAM,aAAa,IAAI;AACvB,KAAI,cAAc,WAAW,YAAY,EACrC,QAAO;AAEX,KAAI,CAAC,IAAI,MACL,QAAO;AAEX,QAAOE,gBAAQ,IAAI,MAAM,GACnBC,cAAM,IAAI,OAAO,gBAAgB,GACjC,gBAAgB,IAAI,MAAM;;AAEpC,IAAM,iBAAN,cAA6B,kBAAkB;CAC3C,YAAY,iBAAiB;AACzB,SAAO;AACP,OAAK,kBAAkB;AACvB,OAAK,QAAQ;;CAEjB,cAAc,MAAM;AAEhB,MAAI,KAAK,UAAU,KACf;AAIJ,UAAQ,KAAK,MAAb;GACI,KAAK;AACD,SAAK,eAAe,KAAK;AACzB;GACJ,KAAK;AACD,SAAK,uBAAuB,KAAK;AACjC;;AAER,QAAM,cAAc,KAAK;;CAE7B,eAAe,MAAM;AACjB,MAAIF,iBAAS,KAAK,iBAAiB,KAAK,MAAM,CAC1C,MAAK,QAAQ;;CAGrB,SAAS,MAAM;AACX,MAAI,KAAK,YACL;OAAI,SAAS,MAAM,KAAK,gBAAgB,KAAK,OACzC,MAAK,QAAQ;aAIb,SAAS,MAAM,KAAK,gBAAgB,KAAK,OACzC,MAAK,QAAQ;;;AAK7B,SAAgB,iBAAiB,WAAW,SAAS;AACjD,KAAI,mBAAmB,QAAQ;EAC3B,MAAM,MAAM,aAAa,QAAQ;EACjC,MAAM,iBAAiB,IAAI,eAAe,UAAU;AACpD,iBAAe,MAAM,IAAI;AACzB,SAAO,eAAe;OAGtB,QAAQD,aAAK,UAAU,SAAS;AAC5B,SAAOC,iBAAS,WAAW,KAAK,WAAW,EAAE,CAAC;GAChD,KAAK;;;;;ACtOf,MAAM,UAAU;AAChB,MAAa,eAAe;AAC5B,MAAa,QAAQ;AACrB,IAAW,iBAAiB,wBAAO,IAAI,OAAO,OAAO,EAAC,WAAW;AAOjE,SAAgB,kBAAkB,YAAY,SAAS;AACnD,WAAUG,iBAAS,SAAS;EACxB,WAAW;EACX,OAAO;EACP,UAAU;EACV,kBAAkB;EAClB,0BAA0B,CAAC,MAAM,KAAK;EACtC,SAAS,KAAK,WAAW,QAAQ;EACpC,CAAC;CACF,MAAM,SAAS,QAAQ;AACvB,QAAO,yCAAyC;AAC5C,mCAAiC;GACnC;CACF,IAAI;AACJ,QAAO,yBAAyB;AAC5B,sBAAoBC,eAAO,aAAa,aAAa;AACjD,UAAO,SAAS,aAAa,MAAM;IACrC;GACJ;CACF,IAAI,YAAY;CAChB,IAAI;AACJ,QAAO,4BAA4B;AAC/B,cAAY;AACZ,2BAAyBC,YAAI,oBAAoB,aAAa;GAC1D,MAAM,cAAc,SAAS;;AAE7B,OAAIC,iBAAS,YAAY,EAAE;IACvB,MAAM,eAAe,YAAY;AACjC,QAAI,aAAa,WAAW,KAExB,iBAAiB,OACjB,iBAAiB,OACjB,iBAAiB,OACjB,CAAC,YAAY,WACb,QAAO;aAEF,aAAa,WAAW,KAC7B,aAAa,OAAO,QAEpB,CAACC,iBAAS;KACN;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACH,EAAE,aAAa,GAAG,CAInB,QAAO,aAAa;QAGpB,QAAO,QAAQ,YACT,cAAc,YAAY,GAC1B,gBAAgB,YAAY;cAGjCC,mBAAW,YAAY,EAAE;AAC9B,gBAAY;AAEZ,WAAO,EAAE,MAAM,aAAa;cAEvB,OAAO,gBAAgB,UAAU;AACtC,gBAAY;AAEZ,WAAO;cAEF,OAAO,gBAAgB,SAC5B,KAAI,YAAY,WAAW,EACvB,QAAO;QAEN;IACD,MAAM,sBAAsB,YAAY,QAAQ,uBAAuB,OAAO;IAC9E,MAAM,gBAAgB,IAAI,OAAO,oBAAoB;AACrD,WAAO,QAAQ,YACT,cAAc,cAAc,GAC5B,gBAAgB,cAAc;;OAIxC,OAAM,MAAM,uBAAuB;IAEzC;GACJ;CACF,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;AACJ,QAAO,sBAAsB;AACzB,qBAAmBH,YAAI,oBAAoB,aAAa,SAAS,aAAa;AAC9E,sBAAoBA,YAAI,oBAAoB,UAAU;GAClD,MAAM,YAAY,MAAM;;AAExB,OAAI,cAAc,MAAM,QACpB;YAEKI,iBAAS,UAAU,CACxB,QAAO;YAEFC,oBAAY,UAAU,CAC3B,QAAO;OAGP,OAAM,MAAM,uBAAuB;IAEzC;AACF,gCAA8BL,YAAI,oBAAoB,UAAU;GAC5D,MAAM,gBAAgB,MAAM;AAC5B,OAAI,cAIA,QAHwBM,gBAAQ,cAAc,GACxCN,YAAI,gBAAgB,SAASO,gBAAQ,mBAAmB,KAAK,CAAC,GAC9D,CAACA,gBAAQ,mBAAmB,cAAc,CAAC;IAGvD;AACF,yBAAuBP,YAAI,oBAAoB,UAAU,MAAM,UAAU;AACzE,wBAAsBA,YAAI,oBAAoB,UAAUQ,YAAI,OAAO,WAAW,CAAC;GACjF;CACF,IAAI;AACJ,QAAO,kCAAkC;EACrC,MAAM,0BAA0B,aAAa,QAAQ,yBAAyB;AAC9E,kCAAgCR,YAAI,oBAAoB,YAAY,MAAM;AAC1E,MAAI,QAAQ,qBAAqB,aAC7B,iCAAgCA,YAAI,oBAAoB,YAAY;AAChE,OAAIQ,YAAI,SAAS,cAAc,CAC3B,QAAO,CAAC,CAAC,QAAQ;OAGjB,QAAQ,sBAAsB,SAAS,wBAAwB,KAAK,SAChE,iBAAiB,yBAAyB,QAAQ,QAAQ;IAEpE;GAER;CACF,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;AACJ,QAAO,yBAAyB;AAC5B,yBAAuBR,YAAI,mBAAmB,gBAAgB;AAC9D,sBAAoBA,YAAI,wBAAwB,eAAe;AAC/D,gBAAcS,eAAO,oBAAoB,KAAK,UAAU;GACpD,MAAM,YAAY,MAAM;AACxB,OAAIL,iBAAS,UAAU,IAAI,EAAE,cAAc,MAAM,SAC7C,KAAI,aAAa,EAAE;AAEvB,UAAO;KACR,EAAE,CAAC;AACN,uBAAqBJ,YAAI,yBAAyB,GAAG,QAAQ;AACzD,UAAO;IACH,SAAS,uBAAuB;IAChC,WAAW,4BAA4B;IACvC,mBAAmB,8BAA8B;IACjD,UAAU,qBAAqB;IAC/B,OAAO,kBAAkB;IACzB,OAAO,kBAAkB;IACzB,MAAM,qBAAqB;IAC3B,KAAK,oBAAoB;IACzB,cAAc,iBAAiB;IAC/B,WAAW,kBAAkB;IAChC;IACH;GACJ;CACF,IAAI,iBAAiB;CACrB,IAAI,+BAA+B,EAAE;AACrC,KAAI,CAAC,QAAQ,SACT,QAAO,iCAAiC;AACpC,iCAA+BS,eAAO,oBAAoB,QAAQ,aAAa,QAAQ;AACnF,OAAI,OAAO,YAAY,YAAY,SAG/B,kBAAiB,QADI,yBADJ,YAAY,QAAQ,WAAW,EAAE,CACK,EAChB,mBAAmB,KAAK;YAE1DH,gBAAQ,YAAY,iBAAiB,EAAE;IAC5C,IAAI;AACJ,oBAAQ,YAAY,mBAAmB,cAAc;KAIjD,MAAM,mBAAmB,yBAHR,OAAO,cAAc,WAChC,UAAU,WAAW,EAAE,GACvB,UACqD;;AAK3D,SAAI,qBAAqB,kBAAkB;AACvC,yBAAmB;AACnB,uBAAiB,QAAQ,kBAAkB,mBAAmB,KAAK;;MAEzE;cAEGL,iBAAS,YAAY,QAAQ,CAClC,KAAI,YAAY,QAAQ,SAAS;AAC7B,qBAAiB;AACjB,QAAI,QAAQ,oBACR,aAAY,GAAG,oDACc,YAAY,QAAQ,UAAU,CAAC;;iGAG2C;UAG1G;IACD,MAAM,iBAAiB,8BAA8B,YAAY,SAAS,QAAQ,oBAAoB;;AAItG,QAAIS,gBAAQ,eAAe,CAIvB,kBAAiB;AAErB,oBAAQ,iBAAiB,SAAS;AAC9B,sBAAiB,QAAQ,MAAM,mBAAmB,KAAK;MACzD;;QAGL;AACD,QAAI,QAAQ,oBACR,aAAY,GAAG,4CACM,YAAY,KAAK;gGAEgE;AAE1G,qBAAiB;;AAErB,UAAO;KACR,EAAE,CAAC;GACR;AAEN,QAAO;EACU;EACO;EACU;EACnB;EACK;EACnB;;AAEL,SAAgB,iBAAiB,YAAY,iBAAiB;CAC1D,IAAI,SAAS,EAAE;CACf,MAAM,gBAAgB,oBAAoB,WAAW;AACrD,UAAS,OAAO,OAAO,cAAc,OAAO;CAC5C,MAAM,gBAAgB,oBAAoB,cAAc,MAAM;CAC9D,MAAM,kBAAkB,cAAc;AACtC,UAAS,OAAO,OAAO,cAAc,OAAO;AAC5C,UAAS,OAAO,OAAO,sBAAsB,gBAAgB,CAAC;AAC9D,UAAS,OAAO,OAAO,qBAAqB,gBAAgB,CAAC;AAC7D,UAAS,OAAO,OAAO,wBAAwB,iBAAiB,gBAAgB,CAAC;AACjF,UAAS,OAAO,OAAO,wBAAwB,gBAAgB,CAAC;AAChE,QAAO;;AAEX,SAAS,sBAAsB,YAAY;CACvC,IAAI,SAAS,EAAE;CACf,MAAM,qBAAqBC,eAAO,aAAa,gBAAgBV,iBAAS,YAAY,SAAS,CAAC;AAC9F,UAAS,OAAO,OAAO,qBAAqB,mBAAmB,CAAC;AAChE,UAAS,OAAO,OAAO,uBAAuB,mBAAmB,CAAC;AAClE,UAAS,OAAO,OAAO,qBAAqB,mBAAmB,CAAC;AAChE,UAAS,OAAO,OAAO,sBAAsB,mBAAmB,CAAC;AACjE,UAAS,OAAO,OAAO,sBAAsB,mBAAmB,CAAC;AACjE,QAAO;;AAEX,SAAgB,oBAAoB,YAAY;CAC5C,MAAM,+BAA+BU,eAAO,aAAa,aAAa;AAClE,SAAO,CAACH,YAAI,UAAU,QAAQ;GAChC;AAWF,QAAO;EAAE,QAVMR,YAAI,+BAA+B,aAAa;AAC3D,UAAO;IACH,SAAS,mBACL,SAAS,OACT;IACJ,MAAM,yBAAyB;IAC/B,YAAY,CAAC,SAAS;IACzB;IACH;EAEe,OADHY,mBAAW,YAAY,6BAA6B;EAC1C;;AAE5B,SAAgB,oBAAoB,YAAY;CAC5C,MAAM,+BAA+BD,eAAO,aAAa,aAAa;EAClE,MAAM,UAAU,SAAS;AACzB,SAAQ,CAACV,iBAAS,QAAQ,IACtB,CAACE,mBAAW,QAAQ,IACpB,CAACK,YAAI,SAAS,OAAO,IACrB,CAACJ,iBAAS,QAAQ;GACxB;AAYF,QAAO;EAAE,QAXMJ,YAAI,+BAA+B,aAAa;AAC3D,UAAO;IACH,SAAS,mBACL,SAAS,OACT;IAEJ,MAAM,yBAAyB;IAC/B,YAAY,CAAC,SAAS;IACzB;IACH;EAEe,OADHY,mBAAW,YAAY,6BAA6B;EAC1C;;AAE5B,MAAM,eAAe;AACrB,SAAgB,qBAAqB,YAAY;CAC7C,MAAM,wBAAwB,kBAAkB;EAC5C,cAAc;AACV,SAAM,GAAG,UAAU;AACnB,QAAK,QAAQ;;EAEjB,eAAe,MAAM;AACjB,QAAK,QAAQ;;;AA6BrB,QAZeZ,YAdMW,eAAO,aAAa,aAAa;EAClD,MAAM,UAAU,SAAS;AACzB,MAAI;GACA,MAAM,YAAY,aAAa,QAAQ;GACvC,MAAM,mBAAmB,IAAI,iBAAiB;AAC9C,oBAAiB,MAAM,UAAU;AACjC,UAAO,iBAAiB;WAErB,GAAG;;AAGN,UAAO,aAAa,KAAK,QAAQ,OAAO;;GAE9C,GACgC,aAAa;AAC3C,SAAO;GACH,SAAS,qDAEL,SAAS,OACT;GAGJ,MAAM,yBAAyB;GAC/B,YAAY,CAAC,SAAS;GACzB;GACH;;AAGN,SAAgB,sBAAsB,YAAY;AAc9C,QATeX,YAJYW,eAAO,aAAa,aAAa;AAExD,SADgB,SAAS,QACV,KAAK,GAAG;GACzB,GACsC,aAAa;AACjD,SAAO;GACH,SAAS,mBACL,SAAS,OACT;GACJ,MAAM,yBAAyB;GAC/B,YAAY,CAAC,SAAS;GACzB;GACH;;AAGN,MAAM,iBAAiB;AACvB,SAAgB,uBAAuB,YAAY;CAC/C,MAAM,0BAA0B,kBAAkB;EAC9C,cAAc;AACV,SAAM,GAAG,UAAU;AACnB,QAAK,QAAQ;;EAEjB,iBAAiB,MAAM;AACnB,QAAK,QAAQ;;;AA6BrB,QAZeX,YAdMW,eAAO,aAAa,aAAa;EAClD,MAAM,UAAU,SAAS;AACzB,MAAI;GACA,MAAM,YAAY,aAAa,QAAQ;GACvC,MAAM,qBAAqB,IAAI,mBAAmB;AAClD,sBAAmB,MAAM,UAAU;AACnC,UAAO,mBAAmB;WAEvB,GAAG;;AAGN,UAAO,eAAe,KAAK,QAAQ,OAAO;;GAEhD,GACgC,aAAa;AAC3C,SAAO;GACH,SAAS,qDAEL,SAAS,OACT;GAGJ,MAAM,yBAAyB;GAC/B,YAAY,CAAC,SAAS;GACzB;GACH;;AAGN,SAAgB,qBAAqB,YAAY;AAc7C,QATeX,YAJMW,eAAO,aAAa,aAAa;EAClD,MAAM,UAAU,SAAS;AACzB,SAAO,mBAAmB,WAAW,QAAQ,aAAa,QAAQ;GACpE,GACgC,aAAa;AAC3C,SAAO;GACH,SAAS,mBACL,SAAS,OACT;GACJ,MAAM,yBAAyB;GAC/B,YAAY,CAAC,SAAS;GACzB;GACH;;AAIN,SAAgB,sBAAsB,YAAY;CAC9C,MAAM,QAAQ,EAAE;CAChB,IAAI,oBAAoBX,YAAI,aAAa,cAAc;AACnD,SAAOS,eAAO,aAAa,QAAQ,cAAc;AAC7C,OAAI,UAAU,QAAQ,WAAW,UAAU,QAAQ,UAC/C,CAACP,iBAAS,OAAO,UAAU,IAC3B,UAAU,YAAY,MAAM,IAAI;AAGhC,UAAM,KAAK,UAAU;AACrB,WAAO,KAAK,UAAU;AACtB,WAAO;;AAEX,UAAO;KACR,EAAE,CAAC;GACR;AACF,qBAAoBW,gBAAQ,kBAAkB;AAgB9C,QAZeb,YAHWW,eAAO,oBAAoB,qBAAqB;AACtE,SAAO,iBAAiB,SAAS;GACnC,GACqC,mBAAmB;EACtD,MAAM,iBAAiBX,YAAI,iBAAiB,aAAa;AACrD,UAAO,SAAS;IAClB;AAEF,SAAO;GACH,SAAS,6BAFSc,aAAM,eAAe,CAAC,QAEY,uDACM,eAAe,KAAK,KAAK,CAAC;GACpF,MAAM,yBAAyB;GAC/B,YAAY;GACf;GACH;;AAGN,SAAgB,qBAAqB,YAAY;AAiB7C,QATed,YAPMW,eAAO,aAAa,UAAU;AAC/C,MAAI,CAACH,YAAI,OAAO,QAAQ,CACpB,QAAO;EAEX,MAAMO,UAAQ,MAAM;AACpB,SAAOA,YAAU,MAAM,WAAWA,YAAU,MAAM,MAAM,CAACX,iBAASW,QAAM;GAC1E,GACgC,aAAa;AAC3C,SAAO;GACH,SAAS,mBACL,SAAS,OACT;GACJ,MAAM,yBAAyB;GAC/B,YAAY,CAAC,SAAS;GACzB;GACH;;AAGN,SAAgB,wBAAwB,YAAY,YAAY;AAa5D,QATef,YAHMW,eAAO,aAAa,UAAU;AAC/C,SAAQ,MAAM,cAAc,UAAa,CAACT,iBAAS,YAAY,MAAM,UAAU;GACjF,GACgC,YAAY;AAG1C,SAAO;GACH,SAHQ,iBAAiB,QAAQ,KAAK,6DAA6D,QAAQ,UAAU;GAIrH,MAAM,yBAAyB;GAC/B,YAAY,CAAC,QAAQ;GACxB;GACH;;AAGN,SAAgB,wBAAwB,YAAY;CAChD,MAAM,SAAS,EAAE;CACjB,MAAM,cAAcO,eAAO,aAAa,QAAQ,SAAS,QAAQ;EAC7D,MAAM,UAAU,QAAQ;AACxB,MAAI,YAAY,MAAM,GAClB,QAAO;AAIX,MAAIL,iBAAS,QAAQ,CACjB,QAAO,KAAK;GAAE,KAAK;GAAS;GAAK,WAAW;GAAS,CAAC;WAEjDH,iBAAS,QAAQ,IAAI,WAAW,QAAQ,CAC7C,QAAO,KAAK;GAAE,KAAK,QAAQ;GAAQ;GAAK,WAAW;GAAS,CAAC;AAEjE,SAAO;IACR,EAAE,CAAC;AACN,iBAAQ,aAAa,SAAS,YAAY;AACtC,kBAAQ,cAAc,EAAE,KAAK,KAAK,gBAAgB;AAC9C,OAAI,UAAU,OAAO,cAAc,KAAK,QAAQ,QAAQ,EAAE;IACtD,MAAM,MAAM,YAAY,UAAU,KAAK,sEACU,QAAQ,KAAK;AAG9D,WAAO,KAAK;KACR,SAAS;KACT,MAAM,yBAAyB;KAC/B,YAAY,CAAC,SAAS,UAAU;KACnC,CAAC;;IAER;GACJ;AACF,QAAO;;AAEX,SAAS,cAAc,KAAK,SAAS;;AAEjC,KAAIA,iBAAS,QAAQ,EAAE;EACnB,MAAM,cAAc,QAAQ,KAAK,IAAI;AACrC,SAAO,gBAAgB,QAAQ,YAAY,UAAU;YAEhDE,mBAAW,QAAQ,CAExB,QAAO,QAAQ,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC;UAEzBK,YAAI,SAAS,OAAO,CAEzB,QAAO,QAAQ,KAAK,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC;UAE9B,OAAO,YAAY,SACxB,QAAO,YAAY;KAGnB,OAAM,MAAM,uBAAuB;;AAG3C,SAAS,WAAW,QAAQ;AAiBxB,QAAQQ,aAfU;EACd;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACH,GACwB,SAAS,OAAO,OAAO,QAAQ,KAAK,KAAK,GAAG,KAAK;;AAE9E,SAAgB,gBAAgB,SAAS;CACrC,MAAM,QAAQ,QAAQ,aAAa,MAAM;AAGzC,QAAO,IAAI,OAAO,OAAO,QAAQ,OAAO,IAAI,MAAM;;AAEtD,SAAgB,cAAc,SAAS;CACnC,MAAM,QAAQ,QAAQ,aAAa,OAAO;AAG1C,QAAO,IAAI,OAAO,GAAG,QAAQ,UAAU,MAAM;;AAEjD,SAAgB,qBAAqB,iBAAiB,YAAY,0BAA0B;CACxF,MAAM,SAAS,EAAE;AAEjB,KAAI,CAACR,YAAI,iBAAiB,aAAa,CACnC,QAAO,KAAK;EACR,SAAS,wDACL,eACA;EACJ,MAAM,yBAAyB;EAClC,CAAC;AAEN,KAAI,CAACA,YAAI,iBAAiB,MAAM,CAC5B,QAAO,KAAK;EACR,SAAS,wDACL,QACA;EACJ,MAAM,yBAAyB;EAClC,CAAC;AAEN,KAAIA,YAAI,iBAAiB,MAAM,IAC3BA,YAAI,iBAAiB,aAAa,IAClC,CAACA,YAAI,gBAAgB,OAAO,gBAAgB,YAAY,CACxD,QAAO,KAAK;EACR,SAAS,kDAAkD,aAAa,KAAK,gBAAgB,YAAY;EAEzG,MAAM,yBAAyB;EAClC,CAAC;AAEN,KAAIA,YAAI,iBAAiB,MAAM,CAC3B,iBAAQ,gBAAgB,QAAQ,eAAe,iBAAiB;AAC5D,kBAAQ,gBAAgB,aAAa,YAAY;AAC7C,OAAIH,oBAAY,YAAY,CACxB,QAAO,KAAK;IACR,SAAS,sEACD,aAAa,eAAe,QAAQ;IAC5C,MAAM,yBAAyB;IAClC,CAAC;YAEGG,YAAI,aAAa,aAAa,CAInC,iBAHkBF,gBAAQ,YAAY,WAAW,GAC3C,YAAY,aACZ,CAAC,YAAY,WAAW,GACV,kBAAkB;AAClC,QAAI,CAACD,oBAAY,cAAc,IAC3B,CAACH,iBAAS,eAAe,cAAc,CACvC,QAAO,KAAK;KACR,SAAS,8DAA8D,cAAc,KAAK,cAAc,YAAY,KAAK,qBAAqB,aAAa;KAC3J,MAAM,yBAAyB;KAClC,CAAC;KAER;IAER;GACJ;AAEN,QAAO;;AAEX,SAAgB,4BAA4B,iBAAiB,YAAY,0BAA0B;CAC/F,MAAM,WAAW,EAAE;CACnB,IAAI,kBAAkB;CAEtB,MAAM,qBAAqBH,eADLc,gBAAQI,gBAAQC,eAAO,gBAAgB,MAAM,CAAC,CAAC,GACnB,aAAa,SAAS,aAAa,MAAM,GAAG;CAC9F,MAAM,sBAAsB,aAAa,yBAAyB;AAClE,KAAI,WACA,iBAAQ,qBAAqB,YAAY;EACrC,MAAM,YAAY,sBAAsB,SAAS,oBAAoB;AACrE,MAAI,cAAc,OAAO;GAErB,MAAM,oBAAoB;IACtB,SAFY,2BAA2B,SAAS,UAAU;IAG1D,MAAM,UAAU;IAChB,WAAW;IACd;AACD,YAAS,KAAK,kBAAkB;aAI5BV,YAAI,SAAS,cAAc,EAC3B;OAAI,QAAQ,gBAAgB,KACxB,mBAAkB;aAIlB,iBAAiB,qBAAqB,QAAQ,QAAQ,CACtD,mBAAkB;GAIhC;AAEN,KAAI,cAAc,CAAC,gBACf,UAAS,KAAK;EACV,SAAS;EAKT,MAAM,yBAAyB;EAClC,CAAC;AAEN,QAAO;;AAEX,SAAgB,iBAAiB,aAAa;CAC1C,MAAM,eAAe,EAAE;AAEvB,iBADkBW,aAAK,YAAY,GACf,YAAY;EAC5B,MAAM,iBAAiB,YAAY;;AAEnC,MAAIb,gBAAQ,eAAe,CACvB,cAAa,WAAW,EAAE;MAG1B,OAAM,MAAM,uBAAuB;GAEzC;AACF,QAAO;;AAGX,SAAgB,gBAAgB,WAAW;CACvC,MAAM,UAAU,UAAU;;AAE1B,KAAIL,iBAAS,QAAQ,CACjB,QAAO;UAEFE,mBAAW,QAAQ,CAExB,QAAO;UAEFK,YAAI,SAAS,OAAO,CAEzB,QAAO;UAEFJ,iBAAS,QAAQ,CACtB,QAAO;KAGP,OAAM,MAAM,uBAAuB;;AAG3C,SAAgB,eAAe,SAAS;AACpC,KAAIA,iBAAS,QAAQ,IAAI,QAAQ,WAAW,EACxC,QAAO,QAAQ,WAAW,EAAE;KAG5B,QAAO;;;;;AAMf,MAAa,gCAAgC;CAEzC,MAAM,SAAU,MAAM;EAClB,MAAM,MAAM,KAAK;AACjB,OAAK,IAAI,IAAI,KAAK,WAAW,IAAI,KAAK,KAAK;GACvC,MAAM,IAAI,KAAK,WAAW,EAAE;AAC5B,OAAI,MAAM,IAAI;AACV,SAAK,YAAY,IAAI;AACrB,WAAO;cAEF,MAAM,IAAI;AACf,QAAI,KAAK,WAAW,IAAI,EAAE,KAAK,GAC3B,MAAK,YAAY,IAAI;QAGrB,MAAK,YAAY,IAAI;AAEzB,WAAO;;;AAGf,SAAO;;CAEX,WAAW;CACd;AACD,SAAS,sBAAsB,SAAS,yBAAyB;AAC7D,KAAII,YAAI,SAAS,cAAc,CAG3B,QAAO;UAIHP,iBAAS,QAAQ,QAAQ,EAAE;AAC3B,MAAI;AAEA,oBAAiB,yBAAyB,QAAQ,QAAQ;WAEvD,GAAG;;AAEN,UAAO;IACH,OAAO,yBAAyB;IAChC,QAAQ,EAAE;IACb;;AAEL,SAAO;YAEFG,iBAAS,QAAQ,QAAQ,CAE9B,QAAO;UAEF,gBAAgB,QAAQ,CAE7B,QAAO,EAAE,OAAO,yBAAyB,mBAAmB;KAG5D,OAAM,MAAM,uBAAuB;;AAI/C,SAAgB,2BAA2B,SAAS,SAAS;;AAEzD,KAAI,QAAQ,UAAU,yBAAyB,oBAC3C,QAAQ;2BACwB,QAAQ,KAAK,+BACvB,QAAQ,OAAO;UAGhC,QAAQ,UAAU,yBAAyB,kBAChD,QAAQ;2BACwB,QAAQ,KAAK;KAI7C,OAAM,MAAM,uBAAuB;;AAG3C,SAAS,aAAa,cAAc;AAShC,QARkBJ,YAAI,eAAe,gBAAgB;AACjD,MAAII,iBAAS,YAAY,CACrB,QAAO,YAAY,WAAW,EAAE;MAGhC,QAAO;GAEb;;AAGN,SAAS,iBAAiB,OAAK,KAAK,OAAO;AACvC,KAAIJ,MAAI,SAAS,OACb,OAAI,OAAO,CAAC,MAAM;KAGlB,OAAI,KAAK,KAAK,MAAM;;AAG5B,MAAa,qBAAqB;;;;;;;;;;;;;;;;AAgBlC,IAAI,4BAA4B,EAAE;AAClC,SAAgB,yBAAyB,UAAU;AAC/C,QAAO,WAAW,qBACZ,WACA,0BAA0B;;;;;;;;;;AAUpC,SAAS,kCAAkC;AACvC,KAAIU,gBAAQ,0BAA0B,EAAE;AACpC,8BAA4B,IAAI,MAAM,MAAM;AAC5C,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,IACvB,2BAA0B,KAAK,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,OAAO;;;;;;ACr2BzE,SAAgB,uBAAuB,aAAa,gBAAgB;CAChE,MAAM,eAAe,YAAY;AACjC,KAAI,iBAAiB,eAAe,aAChC,QAAO;KAGP,QAAQ,eAAe,aAAa,QAChC,eAAe,mBAAmB,kBAAkB;;AAKhE,SAAgB,mCAAmC,OAAO,SAAS;AAC/D,QAAO,MAAM,iBAAiB,QAAQ;;AAE1C,IAAW,oBAAoB;AAC/B,MAAa,kBAAkB,EAAE;AACjC,SAAgB,kBAAkB,YAAY;CAE1C,MAAM,uBAAuB,iBAAiB,WAAW;AAEzD,yBAAwB,qBAAqB;AAE7C,yBAAwB,qBAAqB;AAC7C,4BAA2B,qBAAqB;AAChD,iBAAQ,uBAAuB,YAAY;AACvC,UAAQ,WAAW,QAAQ,gBAAgB,SAAS;GACtD;;AAEN,SAAgB,iBAAiB,YAAY;CACzC,IAAI,SAASU,cAAM,WAAW;CAC9B,IAAI,aAAa;CACjB,IAAI,YAAY;AAChB,QAAO,WAAW;AACd,eAAaC,gBAAQC,gBAAQC,YAAI,aAAa,gBAAgB,YAAY,WAAW,CAAC,CAAC;EACvF,MAAM,gBAAgBC,mBAAW,YAAY,OAAO;AACpD,WAAS,OAAO,OAAO,cAAc;AACrC,MAAIC,gBAAQ,cAAc,CACtB,aAAY;MAGZ,cAAa;;AAGrB,QAAO;;AAEX,SAAgB,wBAAwB,YAAY;AAChD,iBAAQ,aAAa,gBAAgB;AACjC,MAAI,CAAC,oBAAoB,YAAY,EAAE;AACnC,mBAAgB,qBAAqB;AACrC,eAAY,eAAe;;AAG/B,MAAI,sBAAsB,YAAY,IAClC,CAACC,gBAAQ,YAAY,WAAW,CAIhC,aAAY,aAAa,CAAC,YAAY,WAAW;AAErD,MAAI,CAAC,sBAAsB,YAAY,CACnC,aAAY,aAAa,EAAE;AAE/B,MAAI,CAAC,gCAAgC,YAAY,CAC7C,aAAY,kBAAkB,EAAE;AAEpC,MAAI,CAAC,mCAAmC,YAAY,CAChD,aAAY,qBAAqB,EAAE;GAEzC;;AAEN,SAAgB,2BAA2B,YAAY;AACnD,iBAAQ,aAAa,gBAAgB;AAEjC,cAAY,kBAAkB,EAAE;AAChC,kBAAQ,YAAY,qBAAqB,KAAK,QAAQ;AAClD,eAAY,gBAAgB,KAAK,gBAAgB,KAAK,aAAa;IACrE;GACJ;;AAEN,SAAgB,wBAAwB,YAAY;AAChD,iBAAQ,aAAa,gBAAgB;AACjC,gCAA8B,EAAE,EAAE,YAAY;GAChD;;AAEN,SAAgB,8BAA8B,MAAM,UAAU;AAC1D,iBAAQ,OAAO,aAAa;AACxB,WAAS,mBAAmB,SAAS,gBAAgB;GACvD;AACF,iBAAQ,SAAS,aAAa,iBAAiB;EAC3C,MAAM,UAAU,KAAK,OAAO,SAAS;AAErC,MAAI,CAACC,iBAAS,SAAS,aAAa,CAChC,+BAA8B,SAAS,aAAa;GAE1D;;AAEN,SAAgB,oBAAoB,SAAS;AACzC,QAAOC,YAAI,SAAS,eAAe;;AAEvC,SAAgB,sBAAsB,SAAS;AAC3C,QAAOA,YAAI,SAAS,aAAa;;AAErC,SAAgB,gCAAgC,SAAS;AACrD,QAAOA,YAAI,SAAS,kBAAkB;;AAE1C,SAAgB,mCAAmC,SAAS;AACxD,QAAOA,YAAI,SAAS,qBAAqB;;AAE7C,SAAgB,YAAY,SAAS;AACjC,QAAOA,YAAI,SAAS,eAAe;;;;;AC/GvC,MAAa,4BAA4B;CACrC,iCAAiC,OAAO;AACpC,SAAO,uDAAuD,MAAM,MAAM;;CAE9E,iCAAiC,UAAU,aAAa,QAAQ,QAAM,QAAQ;AAC1E,SAAQ,2BAA2B,SAAS,OAAO,YAAY,CAAC,gBAAgB,YAAY,YAAiB,OAAO;;CAE3H;;;;ACDD,IAAW;CACV,SAAU,4BAA0B;AACjC,4BAAyB,2BAAyB,qBAAqB,KAAK;AAC5E,4BAAyB,2BAAyB,qBAAqB,KAAK;AAC5E,4BAAyB,2BAAyB,sBAAsB,KAAK;AAC7E,4BAAyB,2BAAyB,6BAA6B,KAAK;AACpF,4BAAyB,2BAAyB,8BAA8B,KAAK;AACrF,4BAAyB,2BAAyB,8BAA8B,KAAK;AACrF,4BAAyB,2BAAyB,8BAA8B,KAAK;AACrF,4BAAyB,2BAAyB,2CAA2C,KAAK;AAClG,4BAAyB,2BAAyB,6CAA6C,KAAK;AACpG,4BAAyB,2BAAyB,wDAAwD,KAAK;AAC/G,4BAAyB,2BAAyB,+CAA+C,MAAM;AACvG,4BAAyB,2BAAyB,sBAAsB,MAAM;AAC9E,4BAAyB,2BAAyB,yBAAyB,MAAM;AACjF,4BAAyB,2BAAyB,0BAA0B,MAAM;AAClF,4BAAyB,2BAAyB,yBAAyB,MAAM;AACjF,4BAAyB,2BAAyB,yBAAyB,MAAM;AACjF,4BAAyB,2BAAyB,uBAAuB,MAAM;AAC/E,4BAAyB,2BAAyB,qDAAqD,MAAM;GAC9G,6BAA6B,2BAA2B,EAAE,EAAE;AAC/D,MAAM,uBAAuB;CACzB,+BAA+B;CAC/B,kBAAkB;CAClB,wBAAwB;CACxB,0BAA0B,CAAC,MAAM,KAAK;CACtC,qBAAqB;CACrB,UAAU;CACV,sBAAsB;CACtB,eAAe;CACf,iBAAiB;CACjB,iBAAiB;CACpB;AACD,OAAO,OAAO,qBAAqB;AACnC,IAAa,QAAb,MAAmB;CACf,YAAY,iBAAiB,SAAS,sBAAsB;AACxD,OAAK,kBAAkB;AACvB,OAAK,wBAAwB,EAAE;AAC/B,OAAK,yBAAyB,EAAE;AAChC,OAAK,qBAAqB,EAAE;AAC5B,OAAK,+BAA+B,EAAE;AACtC,OAAK,QAAQ,EAAE;AACf,OAAK,cAAc,EAAE;AACrB,OAAK,kBAAkB;AACvB,OAAK,gBAAgB;AACrB,OAAK,YAAY;AACjB,OAAK,qBAAqB,EAAE;AAG5B,OAAK,cAAc,WAAW,cAAc;AAGxC,OAAI,KAAK,kBAAkB,MAAM;AAC7B,SAAK;IACL,MAAMC,WAAS,IAAI,MAAM,KAAK,kBAAkB,EAAE,CAAC,KAAK,IAAK;AAC7D,QAAI,KAAK,kBAAkB,KAAK,kBAC5B,SAAQ,IAAI,GAAGA,SAAO,OAAO,UAAU,GAAG;IAE9C,MAAM,EAAE,MAAM,UAAU,MAAM,UAAU;;IAExC,MAAM,cAAc,OAAO,KAAK,QAAQ,OAAO,QAAQ;AACvD,QAAI,KAAK,kBAAkB,KAAK,kBAC5B,aAAY,GAAGA,SAAO,OAAO,UAAU,UAAU,KAAK,IAAI;AAE9D,SAAK;AACL,WAAO;SAGP,QAAO,WAAW;;AAG1B,MAAI,OAAO,WAAW,UAClB,OAAM,MAAM,6HACwC;AAGxD,OAAK,SAASC,eAAO,EAAE,EAAE,sBAAsB,OAAO;EACtD,MAAM,eAAe,KAAK,OAAO;AACjC,MAAI,iBAAiB,MAAM;AACvB,QAAK,oBAAoB;AACzB,QAAK,gBAAgB;aAEhB,OAAO,iBAAiB,UAAU;AACvC,QAAK,oBAAoB;AACzB,QAAK,gBAAgB;;AAEzB,OAAK,kBAAkB;AACvB,OAAK,WAAW,2BAA2B;GACvC,IAAI;GACJ,IAAI,oBAAoB;AACxB,QAAK,WAAW,+BAA+B;AAC3C,QAAI,KAAK,OAAO,2BACZ,qBAAqB,uBAErB,MAAK,OAAO,yBAAyB;aAGjC,KAAK,OAAO,6BACZ,qBAAqB,yBACrB,OAAM,MAAM,kLACkG;AAGtH,QAAI,OAAO,YAAY,OAAO,oBAC1B,OAAM,MAAM,yEAAqE;AAErF,SAAK,kBAAkB,kBAAkB,KAAK,KAAK,OAAO,iBAAiB;AAC3E,SAAK,gBAAgB,QAAQ,KAAK,KAAK,OAAO,iBAAiB;AAE/D,QAAIC,gBAAQ,gBAAgB,CACxB,oBAAmB;KACf,OAAO,EAAE,aAAaC,cAAM,gBAAgB,EAAE;KAC9C,aAAa;KAChB;SAEA;AAED,yBAAoB;AACpB,wBAAmBA,cAAM,gBAAgB;;KAE/C;AACF,OAAI,KAAK,OAAO,oBAAoB,OAAO;AACvC,SAAK,WAAW,8BAA8B;AAC1C,UAAK,wBAAwB,KAAK,sBAAsB,OAAO,qBAAqB,kBAAkB,KAAK,iBAAiB,KAAK,OAAO,yBAAyB,CAAC;MACpK;AACF,SAAK,WAAW,qCAAqC;AACjD,UAAK,yBAAyB,KAAK,uBAAuB,OAAO,4BAA4B,kBAAkB,KAAK,iBAAiB,KAAK,OAAO,yBAAyB,CAAC;MAC7K;;AAGN,oBAAiB,QAAQ,iBAAiB,QACpC,iBAAiB,QACjB,EAAE;AAGR,mBAAQ,iBAAiB,QAAQ,eAAe,iBAAiB;AAC7D,qBAAiB,MAAM,gBAAgBC,eAAO,gBAAgB,gBAAgBC,oBAAY,YAAY,CAAC;KACzG;GACF,MAAM,eAAeC,aAAK,iBAAiB,MAAM;AACjD,mBAAQ,iBAAiB,QAAQ,YAAY,gBAAgB;AACzD,SAAK,WAAW,UAAU,YAAY,qBAAqB;AACvD,UAAK,MAAM,KAAK,YAAY;AAC5B,SAAI,KAAK,OAAO,oBAAoB,MAChC,MAAK,WAAW,0BAA0B;AACtC,WAAK,wBAAwB,KAAK,sBAAsB,OAAO,iBAAiB,YAAY,aAAa,CAAC;OAC5G;AAKN,SAAIC,gBAAQ,KAAK,sBAAsB,EAAE;AACrC,wBAAkB,WAAW;MAC7B,IAAI;AACJ,WAAK,WAAW,2BAA2B;AACvC,2BAAoB,kBAAkB,YAAY;QAC9C,0BAA0B,KAAK,OAAO;QACtC,kBAAkB,OAAO;QACzB,qBAAqB,OAAO;QAC5B,UAAU,OAAO;QACjB,QAAQ,KAAK;QAChB,CAAC;QACJ;AACF,WAAK,mBAAmB,eACpB,kBAAkB;AACtB,WAAK,6BAA6B,eAC9B,kBAAkB;AACtB,WAAK,cAAcN,eAAO,EAAE,EAAE,KAAK,aAAa,kBAAkB,YAAY;AAC9E,WAAK,YAAY,kBAAkB,aAAa,KAAK;AACrD,WAAK,mBAAmB,eACpB,kBAAkB;;MAE5B;KACJ;AACF,QAAK,cAAc,iBAAiB;AACpC,OAAI,CAACM,gBAAQ,KAAK,sBAAsB,IACpC,CAAC,KAAK,OAAO,+BAA+B;IAI5C,MAAM,uBAHiBC,YAAI,KAAK,wBAAwB,UAAU;AAC9D,YAAO,MAAM;MACf,CAC0C,KAAK,4BAA4B;AAC7E,UAAM,IAAI,MAAM,8CAA8C,qBAAqB;;AAGvF,mBAAQ,KAAK,yBAAyB,sBAAsB;AACxD,kBAAc,kBAAkB,QAAQ;KAC1C;AACF,QAAK,WAAW,8CAA8C;AAI1D,QAAI,gBAAgB;AAChB,UAAK,YAAYC;AACjB,UAAK,QAAQ,KAAK;WAEjB;AACD,UAAK,kBAAkBC;AACvB,UAAK,QAAQ,KAAK;;AAEtB,QAAI,kBACA,MAAK,cAAcA;AAEvB,QAAI,KAAK,oBAAoB,MACzB,MAAK,mBAAmBD;AAE5B,QAAI,KAAK,kBAAkB,MACvB,MAAK,mCAAmCC;AAE5C,QAAI,QAAQ,KAAK,KAAK,OAAO,iBAAiB,CAC1C,MAAK,sBAAsB,KAAK;aAE3B,aAAa,KAAK,KAAK,OAAO,iBAAiB,CACpD,MAAK,sBAAsB,KAAK;aAE3B,cAAc,KAAK,KAAK,OAAO,iBAAiB,CACrD,MAAK,sBAAsB,KAAK;QAGhC,OAAM,MAAM,8CAA8C,KAAK,OAAO,iBAAiB,GAAG;AAE9F,QAAI,KAAK,WAAW;AAChB,UAAK,WAAW,KAAK;AACrB,UAAK,gBAAgB,KAAK;WAEzB;AACD,UAAK,WAAW,KAAK;AACrB,UAAK,gBAAgB,KAAK;;KAEhC;AACF,QAAK,WAAW,sCAAsC;IAClD,MAAM,mBAAmBC,eAAO,KAAK,qBAAqB,mBAAmB,gBAAgB,aAAa;AACtG,SAAI,mBAAmB,MACnB,mBAAkB,KAAK,SAAS;AAEpC,YAAO;OACR,EAAE,CAAC;AACN,QAAI,OAAO,uBAAuB,CAACJ,gBAAQ,iBAAiB,CACxD,OAAM,MAAM,kBAAkB,iBAAiB,KAAK,KAAK,CAAC;0EAEsB;KAEtF;AACF,QAAK,WAAW,gCAAgC;AAC5C,4BAAwB;KAC1B;AACF,QAAK,WAAW,0BAA0B;AACtC,qBAAiB,KAAK;KACxB;IACJ;;CAEN,SAAS,MAAM,cAAc,KAAK,aAAa;AAC3C,MAAI,CAACA,gBAAQ,KAAK,sBAAsB,EAAE;GAItC,MAAM,uBAHiBC,YAAI,KAAK,wBAAwB,UAAU;AAC9D,WAAO,MAAM;KACf,CAC0C,KAAK,4BAA4B;AAC7E,SAAM,IAAI,MAAM,yEACZ,qBAAqB;;AAE7B,SAAO,KAAK,iBAAiB,MAAM,YAAY;;CAMnD,iBAAiB,MAAM,aAAa;EAChC,IAAI,GAAG,GAAG,GAAG,eAAe,WAAW,cAAc,SAAS,YAAY,aAAaI,SAAO,SAAS,UAAU,WAAwB,KAAK;EAC9I,MAAM,UAAU;EAChB,MAAM,YAAY,QAAQ;EAC1B,IAAI,SAAS;EACb,IAAI,qBAAqB;EAKzB,MAAM,wBAAwB,KAAK,YAC7B,IACA,KAAK,MAAM,KAAK,SAAS,GAAG;EAClC,MAAM,gBAAgB,IAAI,MAAM,sBAAsB;EACtD,MAAM,SAAS,EAAE;EACjB,IAAIC,SAAO,KAAK,kBAAkB,IAAI;EACtC,IAAI,SAAS,KAAK,kBAAkB,IAAI;EACxC,MAAM,SAAS,iBAAiB,KAAK,YAAY;EACjD,MAAM,aAAa,KAAK;EACxB,MAAM,wBAAwB,KAAK,OAAO;EAC1C,IAAI,yBAAyB;EAC7B,IAAI,qBAAqB,EAAE;EAC3B,IAAI,mCAAmC,EAAE;EACzC,MAAM,YAAY,EAAE;EACpB,MAAM,aAAa,EAAE;AACrB,SAAO,OAAO,WAAW;EACzB,IAAI;EACJ,SAAS,0BAA0B;AAC/B,UAAO;;EAEX,SAAS,6BAA6B,UAAU;GAC5C,MAAM,mBAAmB,yBAAyB,SAAS;GAC3D,MAAM,mBAAmB,iCAAiC;AAC1D,OAAI,qBAAqB,OACrB,QAAO;OAGP,QAAO;;EAGf,MAAM,YAAY,aAAa;AAE3B,OAAI,UAAU,WAAW,KAGrB,SAAS,UAAU,cAAc,QAAW;IAG5C,MAAMC,QAAM,KAAK,OAAO,qBAAqB,iCAAiC,SAAS;AACvF,WAAO,KAAK;KACR,QAAQ,SAAS;KACjB,MAAM,SAAS;KACf,QAAQ,SAAS;KACjB,QAAQ,SAAS,MAAM;KACvB,SAASA;KACZ,CAAC;UAED;AACD,cAAU,KAAK;IACf,MAAM,UAAUC,aAAK,UAAU;AAC/B,yBAAqB,KAAK,mBAAmB;AAC7C,uCACI,KAAK,6BAA6B;AACtC,6BAAyB,mBAAmB;IAC5C,MAAM,qBAAqB,KAAK,mBAAmB,YAAY,KAAK,OAAO,aAAa;AACxF,QAAI,oCAAoC,mBACpC,uBAAsB;QAGtB,uBAAsB;;;EAIlC,SAAS,UAAU,SAAS;AACxB,aAAU,KAAK,QAAQ;AACvB,sCACI,KAAK,6BAA6B;AACtC,wBAAqB,KAAK,mBAAmB;AAC7C,4BAAyB,mBAAmB;AAC5C,4BAAyB,mBAAmB;GAC5C,MAAM,qBAAqB,KAAK,mBAAmB,YAAY,KAAK,OAAO,aAAa;AACxF,OAAI,oCAAoC,mBACpC,uBAAsB;OAGtB,uBAAsB;;AAK9B,YAAU,KAAK,MAAM,YAAY;EACjC,IAAI;EACJ,MAAM,kBAAkB,KAAK,OAAO;AACpC,SAAO,SAAS,WAAW;AACvB,kBAAe;GACf,MAAM,eAAe,QAAQ,WAAW,OAAO;GAC/C,MAAM,2BAA2B,oBAAoB,aAAa;GAClE,MAAM,uBAAuB,yBAAyB;AACtD,QAAK,IAAI,GAAG,IAAI,sBAAsB,KAAK;AACvC,iBAAa,yBAAyB;IACtC,MAAM,cAAc,WAAW;AAC/B,cAAU;IAEV,MAAM,iBAAiB,WAAW;AAClC,QAAI,mBAAmB,OACnB;SAAI,iBAAiB,eAEjB,gBAAe;eAGd,WAAW,aAAa,MAAM;AACnC,aAAQ,YAAY,KAAK,SAAS,QAAQ,eAAe,OAAO;AAChE,SAAI,UAAU,MAAM;AAChB,qBAAe,MAAM;AACrB,UAAI,MAAM,YAAY,OAClB,WAAU,MAAM;WAIpB,gBAAe;WAGlB;AACD,UAAK,gBAAgB,aAAa,OAAO;AACzC,oBAAe,KAAK,MAAM,aAAa,MAAM,OAAO;;AAExD,QAAI,iBAAiB,MAAM;AAGvB,iBAAY,WAAW;AACvB,SAAI,cAAc,QAAW;MAGzB,MAAM,kBAAkB,UAAU;AAClC,WAAK,IAAI,GAAG,IAAI,iBAAiB,KAAK;OAClC,MAAM,kBAAkB,mBAAmB,UAAU;OACrD,MAAM,mBAAmB,gBAAgB;AACzC,oBAAa;AAGb,WAAI,gBAAgB,aAAa,MAAM;AACnC,gBAAQ,iBAAiB,KAAK,SAAS,QAAQ,eAAe,OAAO;AACrE,YAAI,UAAU,MAAM;AAChB,yBAAgB,MAAM;AACtB,aAAI,MAAM,YAAY,OAClB,cAAa,MAAM;cAIvB,iBAAgB;cAGnB;AACD,aAAK,gBAAgB,kBAAkB,OAAO;AAC9C,wBAAgB,KAAK,MAAM,kBAAkB,MAAM,OAAO;;AAE9D,WAAI,iBAAiB,cAAc,SAAS,aAAa,QAAQ;AAC7D,uBAAe;AACf,kBAAU;AACV,qBAAa;AAGb;;;;AAIZ;;;AAIR,OAAI,iBAAiB,MAAM;AACvB,kBAAc,aAAa;AAC3B,cAAQ,WAAW;AACnB,QAAIH,YAAU,QAAW;AACrB,eAAU,WAAW;AAGrB,gBAAW,KAAK,oBAAoB,cAAc,QAAQ,SAAS,WAAW,WAAWC,QAAM,QAAQ,YAAY;AACnH,UAAK,cAAc,UAAU,QAAQ;AAErC,SAAID,YAAU,MACV,sBAAqB,KAAK,SAAS,eAAe,oBAAoB,SAAS;SAG/E,QAAOA,SAAO,KAAK,SAAS;;AAGpC,WAAO,KAAK,UAAU,MAAM,YAAY;AACxC,aAAS,SAAS;AAElB,aAAS,KAAK,iBAAiB,QAAQ,YAAY;AACnD,QAAI,eAAe,QAAQ,WAAW,sBAAsB,MAAM;KAC9D,IAAI,kBAAkB;KACtB,IAAI;KACJ,IAAI;AACJ,2BAAsB,YAAY;AAClC,QAAG;AACC,wBAAkB,sBAAsB,KAAK,aAAa;AAC1D,UAAI,oBAAoB,MAAM;AAC1B,yBAAkB,sBAAsB,YAAY;AACpD;;cAEC,oBAAoB;AAC7B,SAAI,oBAAoB,GAAG;AACvB,eAAOC,SAAO;AACd,eAAS,cAAc;AACvB,WAAK,iCAAiC,UAAUD,SAAO,iBAAiB,iBAAiBC,QAAM,QAAQ,YAAY;;;AAI3H,SAAK,YAAY,YAAY,UAAU,WAAW,SAAS;UAE1D;IAED,MAAM,mBAAmB;IACzB,MAAM,YAAYA;IAClB,MAAM,cAAc;IACpB,IAAI,mBAAmB,oBAAoB;AAC3C,WAAO,qBAAqB,SAAS,SAAS,WAAW;AAErD,YAAO,KAAK,UAAU,MAAM,EAAE;AAC9B;AACA,UAAK,IAAI,GAAG,IAAI,wBAAwB,KAAK;MACzC,MAAMG,eAAa,mBAAmB;MACtC,MAAM,cAAcA,aAAW;MAE/B,MAAM,iBAAiBA,aAAW;AAClC,UAAI,mBAAmB,OACnB;WAAI,QAAQ,WAAW,OAAO,KAAK,eAE/B,oBAAmB;iBAGlBA,aAAW,aAAa,KAC7B,oBACI,YAAY,KAAK,SAAS,QAAQ,eAAe,OAAO,KAAK;WAEhE;AACD,YAAK,gBAAgB,aAAa,OAAO;AACzC,0BAAmB,YAAY,KAAK,KAAK,KAAK;;AAElD,UAAI,qBAAqB,KACrB;;;AAIZ,gBAAY,SAAS;AACrB,aAAS,KAAK,iBAAiB,QAAQ,UAAU;AAEjD,UAAM,KAAK,OAAO,qBAAqB,iCAAiC,SAAS,kBAAkB,WAAW,WAAW,YAAY;AACrI,WAAO,KAAK;KACR,QAAQ;KACR,MAAM;KACN,QAAQ;KACR,QAAQ;KACR,SAAS;KACZ,CAAC;AACF,QAAI,oBAAoB,MACpB;;;AAMZ,MAAI,CAAC,KAAK,UAEN,eAAc,SAAS;AAE3B,SAAO;GACH,QAAQ;GACA;GACA;GACX;;CAEL,YAAY,QAAQ,UAAU,WAAW,UAAU;AAC/C,MAAI,OAAO,QAAQ,MAAM;GAGrB,MAAM,WAAW,OAAO;AACxB,YAAS,SAAS;AAClB,OAAI,aAAa,OACb,WAAU,KAAK,MAAM,SAAS;aAG7B,OAAO,SAAS,OACrB,WAAU,KAAK,MAAM,OAAO,KAAK;;CAGzC,UAAU,MAAM,QAAQ;AACpB,SAAO,KAAK,UAAU,OAAO;;CAEjC,gBAAgB,QAAQ,cAAc;AAClC,SAAO,YAAY;;CAGvB,iCAAiC,UAAU,SAAO,WAAW,iBAAiB,QAAM,QAAQ,aAAa;EACrG,IAAI,cAAc;AAClB,MAAIJ,YAAU,QAAW;AAErB,kBAAe,cAAc,cAAc;AAC3C,sBAAmB,eAAe,KAAK;AACvC,OAAI,EAAE,oBAAoB,KAAK,iBAAiB,OAAO;AAEnD,aAAS,UAAUC,SAAO;AAG1B,aAAS,YAAY,SAAS,IAAI,CAAC;;;;CAK/C,iBAAiB,WAAW,aAAa;AACrC,SAAO,YAAY;;CAEvB,sBAAsB,OAAO,aAAa,cAAc,WAAW;AAC/D,SAAO;GACH;GACA;GACA;GACA;GACH;;CAEL,qBAAqB,OAAO,aAAa,cAAc,WAAW,WAAW,aAAa;AACtF,SAAO;GACH;GACA;GACA;GACA;GACA;GACA;GACH;;CAEL,gBAAgB,OAAO,aAAa,cAAc,WAAW,WAAW,aAAa,aAAa;AAC9F,SAAO;GACH;GACA;GACA,WAAW,cAAc,cAAc;GACvC;GACA,SAAS;GACT;GACA,WAAW,cAAc,cAAc;GACvC;GACA;GACH;;CAEL,kBAAkB,aAAa,OAAO,YAAY;AAC9C,cAAY,KAAK,WAAW;AAC5B,SAAO;;CAEX,0BAA0B,aAAa,OAAO,YAAY;AACtD,cAAY,SAAS;AACrB;AACA,SAAO;;CAEX,sBAAsB,OAAO,SAAS;CACtC,wBAAwB,OAAO,SAAS;AACpC,MAAI,YAAY,KACZ,OAAM,UAAU;;CAGxB,cAAc,SAAS,MAAM,QAAQ;AAEjC,MADc,QAAQ,KAAK,KAAK,KAClB,KACV,QAAO,KAAK,UAAU,QAAQ,QAAQ,UAAU;AAEpD,SAAO;;CAEX,cAAc,SAAS,MAAM;EACzB,MAAM,cAAc,QAAQ,KAAK,KAAK;AACtC,SAAO,gBAAgB,OAAO,YAAY,KAAK;;;AAGvD,MAAM,UAAU;AAEhB,MAAM,KAAK;;;;ACjoBX,SAAgB,WAAW,SAAS;AAChC,KAAI,cAAc,QAAQ,CACtB,QAAO,QAAQ;KAGf,QAAO,QAAQ;;AAMvB,SAAgB,cAAc,KAAK;AAC/B,QAAOI,iBAAS,IAAI,MAAM,IAAI,IAAI,UAAU;;AAEhD,MAAM,SAAS;AACf,MAAM,aAAa;AACnB,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,YAAY;AAClB,MAAM,WAAW;AACjB,MAAM,aAAa;AACnB,MAAM,cAAc;AACpB,MAAM,mBAAmB;AACzB,SAAgBC,cAAY,QAAQ;AAChC,QAAO,oBAAoB,OAAO;;AAEtC,SAAS,oBAAoB,QAAQ;CACjC,MAAM,UAAU,OAAO;CACvB,MAAM,YAAY,EAAE;AACpB,WAAU,OAAO,OAAO;AACxB,KAAI,CAACC,oBAAY,QAAQ,CACrB,WAAU,UAAU;AAExB,KAAIC,YAAI,QAAQ,OAAO,CACnB,OAAO;AAGX,KAAIA,YAAI,QAAQ,WAAW,CAEvB,WAAU,aAAa,OAAO;AAElC,mBAAkB,CAAC,UAAU,CAAC;AAC9B,KAAIA,YAAI,QAAQ,MAAM,CAClB,WAAU,QAAQ,OAAO;AAE7B,KAAIA,YAAI,QAAQ,MAAM,CAClB,WAAU,QAAQ,OAAO;AAE7B,KAAIA,YAAI,QAAQ,SAAS,CACrB,WAAU,WAAW,OAAO;AAEhC,KAAIA,YAAI,QAAQ,UAAU,CACtB,WAAU,YAAY,OAAO;AAEjC,KAAIA,YAAI,QAAQ,WAAW,CACvB,WAAU,aAAa,OAAO;AAElC,KAAIA,YAAI,QAAQ,YAAY,CACxB,WAAU,cAAc,OAAO;AAEnC,KAAIA,YAAI,QAAQ,iBAAiB,CAC7B,WAAU,mBAAmB,OAAO;AAExC,QAAO;;AAEX,MAAa,MAAMF,cAAY;CAAE,MAAM;CAAO,SAAS,MAAM;CAAI,CAAC;AAClE,kBAAkB,CAAC,IAAI,CAAC;AACxB,SAAgB,oBAAoB,SAAS,OAAO,aAAa,WAAW,WAAW,SAAS,aAAa,WAAW;AACpH,QAAO;EACH;EACA;EACA;EACA;EACA;EACA;EACA;EACA,cAAc,QAAQ;EACtB,WAAW;EACd;;AAEL,SAAgB,aAAa,OAAO,SAAS;AACzC,QAAO,uBAAuB,OAAO,QAAQ;;;;;ACjFjD,MAAa,6BAA6B;CACtC,0BAA0B,EAAE,UAAU,QAAQ,UAAU,YAAY;AAMhE,SADY,aAJK,cAAc,SAAS,GAElC,OAAO,WAAW,SAAS,CAAC,QAC5B,qBAAqB,SAAS,KAAK,MACJ,kBAAkB,OAAO,MAAM;;CAGxE,8BAA8B,EAAE,gBAAgB,YAAY;AACxD,SAAO,+CAA+C,eAAe;;CAEzE,wBAAwB,EAAE,qBAAqB,QAAQ,UAAU,uBAAuB,YAAa;EACjG,MAAM,YAAY;EAGlB,MAAM,YAAY,mBADCG,aAAM,OAAO,CAAC,QACiB;AAClD,MAAI,sBACA,QAAO,YAAY,wBAAwB;MAO3C,8DAF+BC,YADCA,YADNC,eAAO,sBAAsB,QAAQ,iBAAiB,OAAO,OAAO,aAAa,EAAE,EAAE,CAAC,GACxD,aAAa,IAAID,YAAI,WAAW,kBAAkB,WAAW,cAAc,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,GACtF,SAAS,QAAQ,KAAK,MAAM,EAAE,IAAI,UAAU,CACT,KAAK,KAAK,KAC/D;;CAGnD,sBAAsB,EAAE,wBAAwB,QAAQ,uBAAuB,YAAa;EACxF,MAAM,YAAY;EAGlB,MAAM,YAAY,mBADCD,aAAM,OAAO,CAAC,QACiB;AAClD,MAAI,sBACA,QAAO,YAAY,wBAAwB;MAM3C,qHAHgCC,YAAI,yBAAyB,aAAa,IAAIA,YAAI,WAAW,kBAAkB,WAAW,cAAc,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAEvH,KAAK,KAAK,CAAC,KACA;;CAGtD;AACD,OAAO,OAAO,2BAA2B;AACzC,MAAa,sCAAsC,EAC/C,uBAAuB,cAAc,eAAe;AAOhD,QANY,kEACR,cAAc,kBACd,kCAEA,aAAa,OACb;GAGX;AACD,MAAa,uCAAuC;CAChD,yBAAyB,cAAc,gBAAgB;EACnD,SAASE,6BAA2B,MAAM;AACtC,OAAI,gBAAgB,SAChB,QAAO,KAAK,aAAa;YAEpB,gBAAgB,YACrB,QAAO,KAAK;OAGZ,QAAO;;EAGf,MAAM,eAAe,aAAa;EAClC,MAAM,gBAAgBH,aAAM,eAAe;EAC3C,MAAM,QAAQ,cAAc;EAC5B,MAAM,UAAUI,uBAAqB,cAAc;EACnD,MAAM,gBAAgBD,6BAA2B,cAAc;EAE/D,IAAI,MAAM,KAAK,UADU,QAAQ,IACW,QAAQ,GAAG,KAAK,gBAAgB,oBAAoB,cAAc,MAAM,GAAG;4CACnF,eAAe,OAAO,mCAAmC,aAAa;;;AAI1G,QAAM,IAAI,QAAQ,WAAW,IAAI;AACjC,QAAM,IAAI,QAAQ,UAAU,KAAK;AACjC,SAAO;;CAEX,4BAA4B,MAAM;AAM9B,SALe,iHACgE,KAAK,KAAK;;CAM7F,qCAAqC,SAAS;EAC1C,MAAM,UAAUF,YAAI,QAAQ,aAAa,YAAY,WAAW,QAAQ,CAAC,CAAC,KAAK,KAAK;EACpF,MAAM,aAAa,QAAQ,YAAY,QAAQ,IAAI,KAAK,QAAQ,YAAY;AAM5E,SALe,4BAA4B,QAAQ,iBAAiB,KAAK,KAAK,CAAC,0CAClE,WAAW,YAAY,QAAQ,aAAa,KAAK,YACtD,QAAQ;;CAKpB,+BAA+B,SAAS;EACpC,MAAM,UAAUA,YAAI,QAAQ,aAAa,YAAY,WAAW,QAAQ,CAAC,CAAC,KAAK,KAAK;EACpF,MAAM,aAAa,QAAQ,YAAY,QAAQ,IAAI,KAAK,QAAQ,YAAY;EAC5E,IAAI,cAAc,qCAAqC,QAAQ,iBAAiB,KAAK,KAAK,CAAC,UAAU,WAAW,YAChG,QAAQ,aAAa,KAAK,YAClC,QAAQ;AAChB,gBACI,cACI;AAER,SAAO;;CAEX,0BAA0B,SAAS;EAC/B,IAAI,UAAUG,uBAAqB,QAAQ,WAAW;AACtD,MAAI,QAAQ,WAAW,QAAQ,EAC3B,YAAW,QAAQ,WAAW;AAIlC,SAFe,mBAAmB,QAAQ,iBAAiB,QAAQ,aAAa,KAAK;;CAMzF,oBAAoB,SAAS;;AAEzB,SAAO;;CAEX,2BAA2B,SAAS;AAIhC,SAHe,iCAAiC,QAAQ,iBAAiB,EAAE,UAC7D,QAAQ,YAAY,IAAI,YAAY,QAAQ,aAAa,KAAK;;CAIhF,8BAA8B,SAAS;AAGnC,SAFe,8DACL,QAAQ,YAAY,IAAI,YAAY,QAAQ,aAAa,KAAK,gBAAgB,QAAQ,YAAY,WAAW,SAAS,EAAE;;CAGtI,wBAAwB,SAAS;EAC7B,MAAM,WAAW,QAAQ,aAAa;AAUtC,SALe,4CACD,SAAS,gIAJG,GAAG,SAAS,OADpBH,YAAI,QAAQ,oBAAoB,aAAa,SAAS,KAAK,CAExE,OAAO,CAAC,SAAS,CAAC,CAClB,KAAK,QAAQ,GAG8E;;CAOpG,0BAA0B,SAAS;;AAE/B,SAAO;;CAEX,4BAA4B,SAAS;EACjC,IAAI;AACJ,MAAI,QAAQ,wBAAwB,KAChC,YAAW,QAAQ,aAAa;MAGhC,YAAW,QAAQ;AAGvB,SADe,iCAAiC,SAAS,0CAA0C,QAAQ,YAAY;;CAG9H;;;;AC1KD,SAAgBI,iBAAe,WAAW,gBAAgB;CACtD,MAAM,cAAc,IAAI,uBAAuB,WAAW,eAAe;AACzE,aAAY,aAAa;AACzB,QAAO,YAAY;;AAEvB,IAAa,yBAAb,cAA4C,YAAY;CACpD,YAAY,eAAe,gBAAgB;AACvC,SAAO;AACP,OAAK,gBAAgB;AACrB,OAAK,iBAAiB;AACtB,OAAK,SAAS,EAAE;;CAEpB,cAAc;AACV,kBAAQC,eAAO,KAAK,cAAc,GAAG,SAAS;AAC1C,QAAK,eAAe;AACpB,QAAK,OAAO,KAAK;IACnB;;CAEN,iBAAiB,MAAM;EACnB,MAAM,MAAM,KAAK,cAAc,KAAK;AACpC,MAAI,CAAC,KAAK;GACN,MAAM,MAAM,KAAK,eAAe,uBAAuB,KAAK,cAAc,KAAK;AAC/E,QAAK,OAAO,KAAK;IACb,SAAS;IACT,MAAM,0BAA0B;IAChC,UAAU,KAAK,aAAa;IAC5B,mBAAmB,KAAK;IAC3B,CAAC;QAGF,MAAK,iBAAiB;;;;;;AC7BlC,IAAa,mCAAb,cAAsD,WAAW;CAC7D,YAAY,SAAS,MAAM;AACvB,SAAO;AACP,OAAK,UAAU;AACf,OAAK,OAAO;AACZ,OAAK,mBAAmB,EAAE;AAC1B,OAAK,qBAAqB;AAC1B,OAAK,2BAA2B;AAChC,OAAK,QAAQ;AACb,OAAK,gBAAgB;;CAEzB,eAAe;AACX,OAAK,QAAQ;AACb,MAAI,KAAK,KAAK,UAAU,OAAO,KAAK,QAAQ,KACxC,OAAM,MAAM,sDAAsD;AAGtE,OAAK,YAAYC,cAAM,KAAK,KAAK,UAAU,CAAC,SAAS;AACrD,OAAK,kBAAkBA,cAAM,KAAK,KAAK,gBAAgB,CAAC,SAAS;AAEjE,OAAK,UAAU,KAAK;AACpB,OAAK,gBAAgB,KAAK;AAC1B,OAAK,oBAAoB;AACzB,OAAK,KAAK,KAAK,QAAQ;AACvB,SAAO,KAAK;;CAEhB,KAAK,MAAM,WAAW,EAAE,EAAE;AAEtB,MAAI,CAAC,KAAK,MACN,OAAM,KAAK,MAAM,SAAS;;CAGlC,YAAY,SAAS,UAAU,UAAU;AAErC,MAAI,QAAQ,eAAe,SAAS,KAAK,sBACrC,QAAQ,QAAQ,KAAK,0BAA0B;GAC/C,MAAM,WAAW,SAAS,OAAO,SAAS;AAC1C,QAAK,oBAAoB;AACzB,QAAK,KAAK,QAAQ,gBAAgB,SAAS;;;CAGnD,qBAAqB;AAEjB,MAAIC,gBAAQ,KAAK,UAAU,EAAE;AAGzB,QAAK,qBAAqB;AAC1B,QAAK,2BAA2B;AAChC,QAAK,gBAAgB;SAEpB;AACD,QAAK,qBAAqB,KAAK,UAAU,KAAK;AAC9C,QAAK,2BAA2B,KAAK,gBAAgB,KAAK;;;;AAItE,IAAa,uBAAb,cAA0C,iCAAiC;CACvE,YAAY,SAAS,MAAM;AACvB,QAAM,SAAS,KAAK;AACpB,OAAK,OAAO;AACZ,OAAK,mBAAmB;AACxB,OAAK,yBAAyB;AAC9B,OAAK,mBAAmB,KAAK,KAAK,QAAQ;AAC1C,OAAK,yBAAyB,KAAK,KAAK;;CAE5C,aAAa,UAAU,UAAU,UAAU;AACvC,MAAI,KAAK,iBACL,SAAS,aAAa,SAAS,KAAK,oBACpC,SAAS,QAAQ,KAAK,0BACtB,CAAC,KAAK,OAAO;AAGb,QAAK,mBAAmB,MADP,IAAI,YAAY,EAAE,YADlB,SAAS,OAAO,SAAS,EACe,CAAC,CACnB;AACvC,QAAK,QAAQ;;;;;;;;AAQzB,IAAa,4CAAb,cAA+D,WAAW;CACtE,YAAY,SAAS,YAAY;AAC7B,SAAO;AACP,OAAK,UAAU;AACf,OAAK,aAAa;AAClB,OAAK,SAAS;GACV,OAAO;GACP,YAAY;GACZ,aAAa;GAChB;;CAEL,eAAe;AACX,OAAK,KAAK,KAAK,QAAQ;AACvB,SAAO,KAAK;;;AAGpB,IAAa,8BAAb,cAAiD,0CAA0C;CACvF,SAAS,UAAU,UAAU,UAAU;AACnC,MAAI,SAAS,QAAQ,KAAK,YAAY;GAClC,MAAM,iBAAiBC,aAAO,SAAS,OAAO,SAAS,CAAC;AACxD,QAAK,OAAO,cAAc,mBAAmB;AAC7C,OAAI,0BAA0B,UAAU;AACpC,SAAK,OAAO,QAAQ,eAAe;AACnC,SAAK,OAAO,aAAa,eAAe;;QAI5C,OAAM,SAAS,UAAU,UAAU,SAAS;;;AAIxD,IAAa,iCAAb,cAAoD,0CAA0C;CAC1F,YAAY,aAAa,UAAU,UAAU;AACzC,MAAI,YAAY,QAAQ,KAAK,YAAY;GACrC,MAAM,oBAAoBA,aAAO,SAAS,OAAO,SAAS,CAAC;AAC3D,QAAK,OAAO,cAAc,sBAAsB;AAChD,OAAI,6BAA6B,UAAU;AACvC,SAAK,OAAO,QAAQ,kBAAkB;AACtC,SAAK,OAAO,aAAa,kBAAkB;;QAI/C,OAAM,YAAY,aAAa,UAAU,SAAS;;;AAI9D,IAAa,oCAAb,cAAuD,0CAA0C;CAC7F,eAAe,gBAAgB,UAAU,UAAU;AAC/C,MAAI,eAAe,QAAQ,KAAK,YAAY;GACxC,MAAM,uBAAuBA,aAAO,SAAS,OAAO,SAAS,CAAC;AAC9D,QAAK,OAAO,cAAc,yBAAyB;AACnD,OAAI,gCAAgC,UAAU;AAC1C,SAAK,OAAO,QAAQ,qBAAqB;AACzC,SAAK,OAAO,aAAa,qBAAqB;;QAIlD,OAAM,eAAe,gBAAgB,UAAU,SAAS;;;AAKpE,IAAa,uCAAb,cAA0D,0CAA0C;CAChG,kBAAkB,mBAAmB,UAAU,UAAU;AACrD,MAAI,kBAAkB,QAAQ,KAAK,YAAY;GAC3C,MAAM,oCAAoCA,aAAO,SAAS,OAAO,SAAS,CAAC;AAC3E,QAAK,OAAO,cAAc,sCAAsC;AAChE,OAAI,6CAA6C,UAAU;AACvD,SAAK,OAAO,QAAQ,kCAAkC;AACtD,SAAK,OAAO,aAAa,kCAAkC;;QAI/D,OAAM,kBAAkB,mBAAmB,UAAU,SAAS;;;AAI1E,SAAgB,kBAAkB,WAAW,WAAW,WAAW,EAAE,EAAE;AAEnE,YAAWF,cAAM,SAAS;CAC1B,IAAI,SAAS,EAAE;CACf,IAAI,IAAI;CAER,SAAS,kBAAkB,SAAS;AAChC,SAAO,QAAQ,OAAOG,aAAK,WAAW,IAAI,EAAE,CAAC;;CAGjD,SAAS,uBAAuB,YAAY;EACxC,MAAM,eAAe,kBAAkB,kBAAkB,WAAW,EAAE,WAAW,SAAS;AAC1F,SAAO,OAAO,OAAO,aAAa;;;;;;;;;AAStC,QAAO,SAAS,SAAS,aAAa,IAAI,UAAU,QAAQ;EACxD,MAAM,OAAO,UAAU;;AAEvB,MAAI,gBAAgB,YAChB,QAAO,uBAAuB,KAAK,WAAW;WAEzC,gBAAgB,YACrB,QAAO,uBAAuB,KAAK,WAAW;WAEzC,gBAAgB,OACrB,UAAS,uBAAuB,KAAK,WAAW;WAE3C,gBAAgB,oBAMrB,QAAO,uBALQ,KAAK,WAAW,OAAO,CAClC,IAAI,WAAW,EACX,YAAY,KAAK,YACpB,CAAC,CACL,CAAC,CACmC;WAEhC,gBAAgB,iCAOrB,QAAO,uBANQ,CACX,IAAI,YAAY,EAAE,YAAY,KAAK,YAAY,CAAC,EAChD,IAAI,WAAW,EACX,YAAY,CAAC,IAAI,SAAS,EAAE,cAAc,KAAK,WAAW,CAAC,CAAC,CAAC,OAAO,KAAK,WAAW,EACvF,CAAC,CACL,CACoC;WAEhC,gBAAgB,wBAMrB,UAAS,uBALM,KAAK,WAAW,OAAO,CAClC,IAAI,WAAW,EACX,YAAY,CAAC,IAAI,SAAS,EAAE,cAAc,KAAK,WAAW,CAAC,CAAC,CAAC,OAAO,KAAK,WAAW,EACvF,CAAC,CACL,CAAC,CACqC;WAElC,gBAAgB,WAMrB,UAAS,uBALM,KAAK,WAAW,OAAO,CAClC,IAAI,WAAW,EACX,YAAY,KAAK,YACpB,CAAC,CACL,CAAC,CACqC;WAElC,gBAAgB,aAAa;AAClC,mBAAQ,KAAK,aAAa,YAAY;AAIlC,QAAIF,gBAAQ,QAAQ,WAAW,KAAK,MAChC,UAAS,uBAAuB,QAAQ,WAAW;KAEzD;AACF,UAAO;aAEF,gBAAgB,SACrB,UAAS,KAAK,KAAK,aAAa;MAGhC,OAAM,MAAM,uBAAuB;AAEvC;;AAEJ,QAAO,KAAK;EACR,aAAa;EACb,WAAWE,aAAK,WAAW,EAAE;EAChC,CAAC;AACF,QAAO;;AAEX,SAAgB,wBAAwB,YAAY,aAAa,YAAY,cAAc;CACvF,MAAM,oBAAoB;CAE1B,MAAM,wBAAwB,CAAC,kBAAkB;CACjD,MAAM,mBAAmB;CACzB,IAAI,oBAAoB;CACxB,MAAM,oBAAoB,YAAY;CACtC,MAAM,2BAA2B,oBAAoB,eAAe;CACpE,MAAM,SAAS,EAAE;CACjB,MAAM,gBAAgB,EAAE;AACxB,eAAc,KAAK;EACf,KAAK;EACL,KAAK;EACL,WAAW,EAAE;EACb,iBAAiB,EAAE;EACtB,CAAC;AACF,QAAO,CAACF,gBAAQ,cAAc,EAAE;EAC5B,MAAM,WAAW,cAAc,KAAK;AAEpC,MAAI,aAAa,kBAAkB;AAC/B,OAAI,qBACAG,aAAK,cAAc,CAAC,OAAO,yBAE3B,eAAc,KAAK;AAEvB;;EAEJ,MAAM,UAAU,SAAS;EACzB,MAAM,UAAU,SAAS;EACzB,MAAM,gBAAgB,SAAS;EAC/B,MAAM,sBAAsB,SAAS;AAErC,MAAIH,gBAAQ,QAAQ,CAChB;EAEJ,MAAM,OAAO,QAAQ;;AAErB,MAAI,SAAS,mBAAmB;GAC5B,MAAM,WAAW;IACb,KAAK;IACL,KAAKE,aAAK,QAAQ;IAClB,WAAWE,kBAAU,cAAc;IACnC,iBAAiBA,kBAAU,oBAAoB;IAClD;AACD,iBAAc,KAAK,SAAS;aAEvB,gBAAgB;;AAErB,MAAI,UAAU,oBAAoB,GAAG;GACjC,MAAM,UAAU,UAAU;GAC1B,MAAM,cAAc,YAAY;AAChC,OAAI,WAAW,aAAa,KAAK,aAAa,EAAE;IAC5C,MAAM,WAAW;KACb,KAAK;KACL,KAAKF,aAAK,QAAQ;KAClB,WAAW;KACX,iBAAiB;KACpB;AACD,kBAAc,KAAK,SAAS;;aAI3B,YAAY,oBAAoB,GAAG;AAExC,UAAO,KAAK;IACR,eAAe,KAAK;IACpB,qBAAqB,KAAK;IAC1B,WAAW;IACX,iBAAiB;IACpB,CAAC;AACF,uBAAoB;QAGpB,OAAM,MAAM,uBAAuB;WAGlC,gBAAgB,aAAa;GAClC,MAAM,eAAeH,cAAM,cAAc;AACzC,gBAAa,KAAK,KAAK,gBAAgB;GACvC,MAAM,qBAAqBA,cAAM,oBAAoB;AACrD,sBAAmB,KAAK,KAAK,IAAI;GACjC,MAAM,WAAW;IACb,KAAK;IACL,KAAK,KAAK,WAAW,OAAO,uBAAuBG,aAAK,QAAQ,CAAC;IACjE,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,SAAS;aAEvB,gBAAgB,QAAQ;GAE7B,MAAM,kBAAkB;IACpB,KAAK;IACL,KAAKA,aAAK,QAAQ;IAClB,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,gBAAgB;AAEnC,iBAAc,KAAK,iBAAiB;GACpC,MAAM,eAAe;IACjB,KAAK;IACL,KAAK,KAAK,WAAW,OAAOA,aAAK,QAAQ,CAAC;IAC1C,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,aAAa;aAE3B,gBAAgB,qBAAqB;GAE1C,MAAM,kBAAkB,IAAI,WAAW;IACnC,YAAY,KAAK;IACjB,KAAK,KAAK;IACb,CAAC;GAEF,MAAM,WAAW;IACb,KAAK;IACL,KAHY,KAAK,WAAW,OAAO,CAAC,gBAAgB,EAAEA,aAAK,QAAQ,CAAC;IAIpE,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,SAAS;aAEvB,gBAAgB,kCAAkC;GAKvD,MAAM,kBAAkB,IAAI,WAAW;IACnC,YAAY,CAJM,IAAI,SAAS,EAC/B,cAAc,KAAK,WACtB,CAAC,CAE6B,CAAC,OAAO,KAAK,WAAW;IACnD,KAAK,KAAK;IACb,CAAC;GAEF,MAAM,WAAW;IACb,KAAK;IACL,KAHY,KAAK,WAAW,OAAO,CAAC,gBAAgB,EAAEA,aAAK,QAAQ,CAAC;IAIpE,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,SAAS;aAEvB,gBAAgB,yBAAyB;GAE9C,MAAM,kBAAkB;IACpB,KAAK;IACL,KAAKA,aAAK,QAAQ;IAClB,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,gBAAgB;AAEnC,iBAAc,KAAK,iBAAiB;GAIpC,MAAM,gBAAgB,IAAI,WAAW;IACjC,YAAY,CAJM,IAAI,SAAS,EAC/B,cAAc,KAAK,WACtB,CAAC,CAE6B,CAAC,OAAO,KAAK,WAAW;IACnD,KAAK,KAAK;IACb,CAAC;GAEF,MAAM,eAAe;IACjB,KAAK;IACL,KAHY,KAAK,WAAW,OAAO,CAAC,cAAc,EAAEA,aAAK,QAAQ,CAAC;IAIlE,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,aAAa;aAE3B,gBAAgB,YAAY;GAEjC,MAAM,kBAAkB;IACpB,KAAK;IACL,KAAKA,aAAK,QAAQ;IAClB,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,gBAAgB;AAEnC,iBAAc,KAAK,iBAAiB;GAEpC,MAAM,gBAAgB,IAAI,WAAW;IACjC,YAAY,KAAK;IACjB,KAAK,KAAK;IACb,CAAC;GAEF,MAAM,eAAe;IACjB,KAAK;IACL,KAHY,KAAK,WAAW,OAAO,CAAC,cAAc,EAAEA,aAAK,QAAQ,CAAC;IAIlE,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,aAAa;aAE3B,gBAAgB,YAErB,MAAK,IAAI,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;GAElD,MAAM,cAAc;IAChB,KAAK;IACL,KAHY,KAAK,WAAW,GAGf,WAAW,OAAOA,aAAK,QAAQ,CAAC;IAC7C,WAAW;IACX,iBAAiB;IACpB;AACD,iBAAc,KAAK,YAAY;AAC/B,iBAAc,KAAK,iBAAiB;;WAGnC,gBAAgB,YACrB,eAAc,KAAK;GACf,KAAK;GACL,KAAK,KAAK,WAAW,OAAOA,aAAK,QAAQ,CAAC;GAC1C,WAAW;GACX,iBAAiB;GACpB,CAAC;WAEG,gBAAgB,KAErB,eAAc,KAAK,mBAAmB,MAAM,SAAS,eAAe,oBAAoB,CAAC;MAGzF,OAAM,MAAM,uBAAuB;;AAG3C,QAAO;;AAEX,SAAS,mBAAmB,SAAS,SAAS,eAAe,qBAAqB;CAC9E,MAAM,eAAeH,cAAM,cAAc;AACzC,cAAa,KAAK,QAAQ,KAAK;CAC/B,MAAM,yBAAyBA,cAAM,oBAAoB;AAEzD,wBAAuB,KAAK,EAAE;AAC9B,QAAO;EACH,KAAK;EACL,KAAK,QAAQ;EACb,WAAW;EACX,iBAAiB;EACpB;;;;;ACpeL,IAAW;CACV,SAAU,aAAW;AAClB,aAAU,YAAU,YAAY,KAAK;AACrC,aAAU,YAAU,gBAAgB,KAAK;AACzC,aAAU,YAAU,0BAA0B,KAAK;AACnD,aAAU,YAAU,yCAAyC,KAAK;AAClE,aAAU,YAAU,+BAA+B,KAAK;AACxD,aAAU,YAAU,iBAAiB,KAAK;GAC3C,cAAc,YAAY,EAAE,EAAE;AACjC,SAAgBM,cAAY,MAAM;;AAE9B,KAAI,gBAAgB,UAAU,SAAS,SACnC,QAAO,UAAU;UAEZ,gBAAgB,cAAc,SAAS,aAC5C,QAAO,UAAU;UAEZ,gBAAgB,uBACrB,SAAS,sBACT,QAAO,UAAU;UAEZ,gBAAgB,oCACrB,SAAS,mCACT,QAAO,UAAU;UAEZ,gBAAgB,2BACrB,SAAS,0BACT,QAAO,UAAU;UAEZ,gBAAgB,eAAe,SAAS,cAC7C,QAAO,UAAU;KAGjB,OAAM,MAAM,uBAAuB;;AAG3C,SAAgB,kBAAkB,SAAS;CACvC,MAAM,EAAE,YAAY,MAAM,UAAU,iBAAiB;CACrD,MAAM,OAAOA,cAAY,SAAS;AAClC,KAAI,SAAS,UAAU,YACnB,QAAO,uBAAuB,YAAY,MAAM,aAAa;KAG7D,QAAO,iCAAiC,YAAY,MAAM,MAAM,aAAa;;AAGrF,SAAgB,wBAAwB,YAAY,aAAa,cAAc,eAAe,sBAAsB,eAAe;CAC/H,MAAM,iBAAiB,uBAAuB,YAAY,aAAa,aAAa;AAIpF,QAAO,cAAc,gBAAgB,eAHhB,0BAA0B,eAAe,GACxD,qCACA,wBAC4D,qBAAqB;;;;;;;;;;;;;;AAc3F,SAAgB,kCAAkC,YAAY,aAAa,GAAG,sBAAsB,UAAU,kBAAkB;CAC5H,MAAM,iBAAiB,iCAAiC,YAAY,aAAa,UAAU,EAAE;CAC7F,MAAMC,iBAAe,0BAA0B,eAAe,GACxD,qCACA;AACN,QAAO,iBAAiB,eAAe,IAAIA,gBAAc,qBAAqB;;AAElF,SAAgB,+BAA+B,MAAM,eAAe,gBAAc,sBAAsB;CACpG,MAAM,YAAY,KAAK;CACvB,MAAM,0BAA0BC,cAAM,OAAO,YAAY;AACrD,SAAOA,cAAM,UAAU,aAAa;AAChC,UAAO,SAAS,WAAW;IAC7B;GACJ;AAEF,KAAI;;;;AAIA,QAAO,SAAU,QAAQ;EAIrB,MAAM,aAAaC,YAAI,SAAS,YAAY,QAAQ,KAAK;AACzD,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAChC,MAAM,UAAU,KAAK;GACrB,MAAM,iBAAiB,QAAQ;GAC/B,MAAM,gBAAgB,WAAW;AACjC,OAAI,kBAAkB,UAAa,cAAc,KAAK,KAAK,KAAK,MAE5D;AAEJ,YAAU,MAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,KAAK;IAC/C,MAAM,WAAW,QAAQ;IACzB,MAAM,iBAAiB,SAAS;AAChC,SAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,IAEhC,KAAIF,eADc,KAAK,GAAG,IAAI,EAAE,EACJ,SAAS,GAAG,KAAK,MAGzC,UAAS;AAKjB,WAAO;;;;UASd,2BAA2B,CAAC,sBAAsB;EAMvD,MAAM,cAAcG,eAHID,YAAI,OAAO,YAAY;AAC3C,UAAOE,gBAAQ,QAAQ;IACzB,GAC2C,QAAQ,SAAS,QAAQ;AAClE,mBAAQ,UAAU,gBAAgB;AAC9B,QAAI,CAACC,YAAI,QAAQ,YAAY,aAAa,CACtC,QAAO,YAAY,gBAAgB;AAEvC,oBAAQ,YAAY,kBAAkB,sBAAsB;AACxD,SAAI,CAACA,YAAI,QAAQ,kBAAkB,CAC/B,QAAO,qBAAqB;MAElC;KACJ;AACF,UAAO;KACR,EAAE,CAAC;;;;AAIN,SAAO,WAAY;AAEf,UAAO,YADW,KAAK,GAAG,EAAE,CACC;;;;;;AASjC,QAAO,WAAY;AACf,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAChC,MAAM,UAAU,KAAK;GACrB,MAAM,iBAAiB,QAAQ;AAC/B,YAAU,MAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,KAAK;IAC/C,MAAM,WAAW,QAAQ;IACzB,MAAM,iBAAiB,SAAS;AAChC,SAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,IAEhC,KAAIL,eADc,KAAK,GAAG,IAAI,EAAE,EACJ,SAAS,GAAG,KAAK,MAGzC,UAAS;AAKjB,WAAO;;;;;AAU3B,SAAgB,wCAAwC,KAAK,gBAAc,sBAAsB;CAC7F,MAAM,0BAA0BC,cAAM,MAAM,aAAa;AACrD,SAAO,SAAS,WAAW;GAC7B;CACF,MAAM,aAAa,IAAI;AAGvB,KAAI,2BAA2B,CAAC,sBAAsB;EAClD,MAAM,oBAAoBG,gBAAQ,IAAI;AACtC,MAAI,kBAAkB,WAAW,KAC7BE,gBAAQ,kBAAkB,GAAG,gBAAgB,EAAE;GAE/C,MAAM,yBADoB,kBAAkB,GACK;AACjD,UAAO,WAAY;AACf,WAAO,KAAK,GAAG,EAAE,CAAC,iBAAiB;;SAGtC;GACD,MAAM,cAAcH,eAAO,oBAAoB,QAAQ,aAAa,QAAQ;AACxE,WAAO,YAAY,gBAAgB;AACnC,oBAAQ,YAAY,kBAAkB,sBAAsB;AACxD,YAAO,qBAAqB;MAC9B;AACF,WAAO;MACR,EAAE,CAAC;AACN,UAAO,WAAY;AAEf,WAAO,YADW,KAAK,GAAG,EAAE,CACC,kBAAkB;;;OAKvD,QAAO,WAAY;AACf,WAAU,MAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GAC3C,MAAM,WAAW,IAAI;GACrB,MAAM,iBAAiB,SAAS;AAChC,QAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,IAEhC,KAAIH,eADc,KAAK,GAAG,IAAI,EAAE,EACJ,SAAS,GAAG,KAAK,MAGzC,UAAS;AAIjB,UAAO;;AAGX,SAAO;;;AAInB,IAAM,6BAAN,cAAyC,WAAW;CAChD,YAAY,SAAS,kBAAkB,gBAAgB;AACnD,SAAO;AACP,OAAK,UAAU;AACf,OAAK,mBAAmB;AACxB,OAAK,iBAAiB;;CAE1B,eAAe;AACX,OAAK,KAAK,KAAK,QAAQ;AACvB,SAAO,KAAK;;CAEhB,cAAc,MAAM,kBAAkB,UAAU,UAAU;AACtD,MAAI,KAAK,QAAQ,KAAK,oBAClB,KAAK,mBAAmB,kBAAkB;AAC1C,QAAK,UAAU,SAAS,OAAO,SAAS;AACxC,UAAO;;AAGX,SAAO;;CAEX,WAAW,YAAY,UAAU,UAAU;AACvC,MAAI,CAAC,KAAK,cAAc,YAAY,UAAU,QAAQ,UAAU,SAAS,CACrE,OAAM,WAAW,YAAY,UAAU,SAAS;;CAGxD,eAAe,gBAAgB,UAAU,UAAU;AAC/C,MAAI,CAAC,KAAK,cAAc,gBAAgB,UAAU,sBAAsB,UAAU,SAAS,CACvF,OAAM,WAAW,gBAAgB,UAAU,SAAS;;CAG5D,kBAAkB,mBAAmB,UAAU,UAAU;AACrD,MAAI,CAAC,KAAK,cAAc,mBAAmB,UAAU,qCAAqC,UAAU,SAAS,CACzG,OAAM,WAAW,mBAAmB,UAAU,SAAS;;CAG/D,SAAS,UAAU,UAAU,UAAU;AACnC,MAAI,CAAC,KAAK,cAAc,UAAU,UAAU,YAAY,UAAU,SAAS,CACvE,OAAM,WAAW,UAAU,UAAU,SAAS;;CAGtD,YAAY,aAAa,UAAU,UAAU;AACzC,MAAI,CAAC,KAAK,cAAc,aAAa,UAAU,2BAA2B,UAAU,SAAS,CACzF,OAAM,WAAW,aAAa,UAAU,SAAS;;;;;;AAO7D,IAAM,gCAAN,cAA4C,YAAY;CACpD,YAAY,kBAAkB,gBAAgB,WAAW;AACrD,SAAO;AACP,OAAK,mBAAmB;AACxB,OAAK,iBAAiB;AACtB,OAAK,YAAY;AACjB,OAAK,SAAS,EAAE;;CAEpB,cAAc,MAAM,kBAAkB;AAClC,MAAI,KAAK,QAAQ,KAAK,oBAClB,KAAK,mBAAmB,qBACvB,KAAK,cAAc,UAAa,SAAS,KAAK,WAC/C,MAAK,SAAS,KAAK;;CAG3B,YAAY,MAAM;AACd,OAAK,cAAc,MAAM,UAAU,OAAO;;CAE9C,gBAAgB,MAAM;AAClB,OAAK,cAAc,MAAM,UAAU,WAAW;;CAElD,yBAAyB,MAAM;AAC3B,OAAK,cAAc,MAAM,UAAU,qBAAqB;;CAE5D,sCAAsC,MAAM;AACxC,OAAK,cAAc,MAAM,UAAU,oCAAoC;;CAE3E,6BAA6B,MAAM;AAC/B,OAAK,cAAc,MAAM,UAAU,0BAA0B;;CAEjE,iBAAiB,MAAM;AACnB,OAAK,cAAc,MAAM,UAAU,YAAY;;;AAGvD,SAAS,wBAAwB,MAAM;CACnC,MAAM,SAAS,IAAI,MAAM,KAAK;AAC9B,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IACtB,QAAO,KAAK,EAAE;AAElB,QAAO;;;;;;;AAOX,SAAS,eAAe,MAAM;CAC1B,IAAIO,SAAO,CAAC,GAAG;AACf,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EAClC,MAAM,UAAU,KAAK;EACrB,MAAM,aAAa,EAAE;AACrB,OAAK,IAAI,IAAI,GAAG,IAAIA,OAAK,QAAQ,KAAK;GAClC,MAAM,iBAAiBA,OAAK;AAC5B,cAAW,KAAK,iBAAiB,MAAM,QAAQ,aAAa;AAC5D,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,gBAAgB,QAAQ,KAAK;IACrD,MAAM,sBAAsB,MAAM,QAAQ,gBAAgB;AAC1D,eAAW,KAAK,iBAAiB,oBAAoB;;;AAG7D,WAAO;;AAEX,QAAOA;;;;;AAKX,SAAS,mBAAmB,mBAAmB,gBAAgB,KAAK;AAChE,MAAK,IAAI,aAAa,GAAG,aAAa,kBAAkB,QAAQ,cAAc;AAE1E,MAAI,eAAe,IACf;EAEJ,MAAM,yBAAyB,kBAAkB;AACjD,OAAK,IAAI,YAAY,GAAG,YAAY,eAAe,QAAQ,YAEvD,KAAI,uBADc,eAAe,gBACS,KACtC,QAAO;;AAKnB,QAAO;;AAEX,SAAgB,kCAAkC,UAAU,GAAG;CAC3D,MAAM,cAAcL,YAAI,WAAW,YAAY,kBAAkB,CAAC,QAAQ,EAAE,EAAE,CAAC;CAC/E,MAAM,cAAc,wBAAwB,YAAY,OAAO;CAC/D,MAAM,aAAaA,YAAI,cAAc,iBAAiB;EAClD,MAAM,OAAO,EAAE;AACf,kBAAQ,eAAe,SAAS;AAE5B,mBADa,eAAe,KAAK,YAAY,GAC9B,YAAY;AACvB,SAAK,WAAW;KAClB;IACJ;AACF,SAAO;GACT;CACF,IAAI,UAAU;AAEd,MAAK,IAAI,aAAa,GAAG,cAAc,GAAG,cAAc;EACpD,MAAM,cAAc;AACpB,YAAU,wBAAwB,YAAY,OAAO;AAErD,OAAK,IAAI,SAAS,GAAG,SAAS,YAAY,QAAQ,UAAU;GACxD,MAAM,0BAA0B,YAAY;AAE5C,QAAK,IAAI,cAAc,GAAG,cAAc,wBAAwB,QAAQ,eAAe;IACnF,MAAM,iBAAiB,wBAAwB,aAAa;IAC5D,MAAM,YAAY,wBAAwB,aAAa;IACvD,MAAM,aAAa,eAAe,eAAe;AAGjD,QAFiB,mBAAmB,YAAY,YAAY,OAAO,IAEnDI,gBAAQ,UAAU,IAAI,eAAe,WAAW,GAAG;KAC/D,MAAM,gBAAgB,YAAY;AAElC,SAAI,aAAa,eAAe,eAAe,KAAK,OAAO;AACvD,oBAAc,KAAK,eAAe;AAElC,WAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;OACxC,MAAM,UAAU,WAAW;AAC3B,kBAAW,QAAQ,WAAW;;;WAKrC;KACD,MAAM,6BAA6B,kBAAkB,WAAW,aAAa,GAAG,eAAe;AAC/F,aAAQ,UAAU,QAAQ,QAAQ,OAAO,2BAA2B;AAEpE,qBAAQ,6BAA6B,SAAS;AAE1C,sBADmB,eAAe,KAAK,YAAY,GAC9B,QAAQ;AACzB,kBAAW,QAAQ,OAAO;QAC5B;OACJ;;;;;AAKlB,QAAO;;AAEX,SAAgB,uBAAuB,YAAY,aAAa,GAAG,QAAQ;CACvE,MAAM,UAAU,IAAI,8BAA8B,YAAY,UAAU,aAAa,OAAO;AAC5F,aAAY,OAAO,QAAQ;AAC3B,QAAO,kCAAkC,QAAQ,QAAQ,EAAE;;AAE/D,SAAgB,iCAAiC,YAAY,aAAa,UAAU,GAAG;CACnF,MAAM,mBAAmB,IAAI,8BAA8B,YAAY,SAAS;AAChF,aAAY,OAAO,iBAAiB;CACpC,MAAM,YAAY,iBAAiB;CAEnC,MAAM,WADiB,IAAI,2BAA2B,aAAa,YAAY,SAAS,CACxD,cAAc;AAG9C,QAAO,kCAAkC,CAFtB,IAAIE,YAAgB,EAAE,YAAY,WAAW,CAAC,EAC/C,IAAIA,YAAgB,EAAE,YAAY,UAAU,CAAC,CACC,EAAE,EAAE;;AAExE,SAAgB,aAAa,aAAa,YAAY;AAClD,kBAAkB,MAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;EAC3D,MAAM,YAAY,YAAY;AAC9B,MAAI,UAAU,WAAW,WAAW,OAChC;AAEJ,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;GACvC,MAAM,YAAY,WAAW;GAC7B,MAAM,WAAW,UAAU;AAG3B,QAFuB,cAAc,YACjC,SAAS,mBAAmB,UAAU,kBAAkB,YACrC,MACnB,UAAS;;AAGjB,SAAO;;AAEX,QAAO;;AAEX,SAAgB,qBAAqB,QAAQ,OAAO;AAChD,QAAQ,OAAO,SAAS,MAAM,UAC1BP,cAAM,SAAS,SAAS,QAAQ;EAC5B,MAAM,eAAe,MAAM;AAC3B,SAAQ,YAAY,gBAChB,aAAa,mBAAmB,QAAQ;GAC9C;;AAEV,SAAgB,0BAA0B,gBAAgB;AACtD,QAAOA,cAAM,iBAAiB,mBAAmBA,cAAM,iBAAiB,eAAeA,cAAM,aAAa,UAAUK,gBAAQ,MAAM,gBAAgB,CAAC,CAAC,CAAC;;;;;AC9czJ,SAAgB,kBAAkB,SAAS;AAMvC,QAAOG,YALkC,QAAQ,kBAAkB,SAAS;EACxE,OAAO,QAAQ;EACf,YAAY,QAAQ;EACpB,aAAa,QAAQ;EACxB,CAAC,GAC4C,iBAAkB,OAAO,OAAO,EAAE,MAAM,0BAA0B,6BAA6B,EAAE,aAAa,CAAE;;AAElK,SAAgBC,kBAAgB,WAAW,YAAY,gBAAgB,aAAa;CAChF,MAAM,kBAAkBC,gBAAQ,YAAY,iBAAiB,6BAA6B,cAAc,eAAe,CAAC;CACxH,MAAM,+BAA+B,uCAAuC,WAAW,YAAY,eAAe;CAClH,MAAM,oBAAoBA,gBAAQ,YAAY,YAAY,oBAAoB,SAAS,eAAe,CAAC;CACvG,MAAM,sBAAsBA,gBAAQ,YAAY,YAAY,gCAAgC,SAAS,WAAW,aAAa,eAAe,CAAC;AAC7I,QAAO,gBAAgB,OAAO,8BAA8B,mBAAmB,oBAAoB;;AAEvG,SAAS,6BAA6B,cAAc,gBAAgB;CAChE,MAAMC,qBAAmB,IAAI,+BAA+B;AAC5D,cAAa,OAAOA,mBAAiB;CACrC,MAAM,qBAAqBA,mBAAiB;AAsB5C,QAjBeH,YAAII,eAHAC,eADMC,gBAAQ,oBAAoB,gCAAgC,GACxC,cAAc;AACvD,SAAO,UAAU,SAAS;GAC5B,CACmC,GAAG,mBAAmB;EACvD,MAAM,YAAYC,aAAM,eAAe;EACvC,MAAM,MAAM,eAAe,yBAAyB,cAAc,eAAe;EACjF,MAAM,UAAUC,uBAAqB,UAAU;EAC/C,MAAM,WAAW;GACb,SAAS;GACT,MAAM,0BAA0B;GAChC,UAAU,aAAa;GACd;GACT,YAAY,UAAU;GACzB;EACD,MAAM,QAAQ,2BAA2B,UAAU;AACnD,MAAI,MACA,UAAS,YAAY;AAEzB,SAAO;GACT;;AAGN,SAAgB,gCAAgC,MAAM;AAClD,QAAO,GAAGA,uBAAqB,KAAK,CAAC,KAAK,KAAK,IAAI,KAAK,2BAA2B,KAAK;;AAE5F,SAAS,2BAA2B,MAAM;AACtC,KAAI,gBAAgB,SAChB,QAAO,KAAK,aAAa;UAEpB,gBAAgB,YACrB,QAAO,KAAK;KAGZ,QAAO;;AAGf,IAAa,gCAAb,cAAmD,YAAY;CAC3D,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,iBAAiB,EAAE;;CAE5B,iBAAiB,SAAS;AACtB,OAAK,eAAe,KAAK,QAAQ;;CAErC,YAAY,UAAQ;AAChB,OAAK,eAAe,KAAKC,SAAO;;CAEpC,6BAA6B,SAAS;AAClC,OAAK,eAAe,KAAK,QAAQ;;CAErC,yBAAyB,YAAY;AACjC,OAAK,eAAe,KAAK,WAAW;;CAExC,sCAAsC,eAAe;AACjD,OAAK,eAAe,KAAK,cAAc;;CAE3C,gBAAgB,MAAM;AAClB,OAAK,eAAe,KAAK,KAAK;;CAElC,iBAAiB,IAAI;AACjB,OAAK,eAAe,KAAK,GAAG;;CAEhC,cAAc,UAAU;AACpB,OAAK,eAAe,KAAK,SAAS;;;AAG1C,SAAgB,gCAAgC,MAAM,UAAU,WAAW,gBAAgB;CACvF,MAAM,SAAS,EAAE;AAOjB,KANoBC,eAAO,WAAW,QAAQ,YAAY;AACtD,MAAI,QAAQ,SAAS,KAAK,KACtB,QAAO,SAAS;AAEpB,SAAO;IACR,EAAE,GACa,GAAG;EACjB,MAAM,SAAS,eAAe,4BAA4B;GACtD,cAAc;GACd,aAAa;GAChB,CAAC;AACF,SAAO,KAAK;GACR,SAAS;GACT,MAAM,0BAA0B;GAChC,UAAU,KAAK;GAClB,CAAC;;AAEN,QAAO;;AAKX,SAAgB,yBAAyB,UAAU,mBAAmB,WAAW;CAC7E,MAAM,SAAS,EAAE;CACjB,IAAI;AACJ,KAAI,CAACC,iBAAS,mBAAmB,SAAS,EAAE;AACxC,WACI,kCAAkC,SAAS,4CAA4C,UAAU;AAErG,SAAO,KAAK;GACR,SAAS;GACT,MAAM,0BAA0B;GACtB;GACb,CAAC;;AAEN,QAAO;;AAEX,SAAgB,wBAAwB,SAAS,UAAU,gBAAgB,OAAO,EAAE,EAAE;CAClF,MAAM,SAAS,EAAE;CACjB,MAAM,mBAAmB,qBAAqB,SAAS,WAAW;AAClE,KAAIC,gBAAQ,iBAAiB,CACzB,QAAO,EAAE;MAER;EACD,MAAM,WAAW,QAAQ;AAEzB,MAD2BD,iBAAS,kBAAkB,QAAQ,CAE1D,QAAO,KAAK;GACR,SAAS,eAAe,wBAAwB;IAC5C,cAAc;IACd,mBAAmB;IACtB,CAAC;GACF,MAAM,0BAA0B;GACtB;GACb,CAAC;EAKN,MAAM,sBAAsBT,gBADLW,mBAAW,kBAAkB,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,GACtB,gBAAgB;GACjE,MAAM,UAAUC,cAAM,KAAK;AAC3B,WAAQ,KAAK,YAAY;AACzB,UAAO,wBAAwB,SAAS,aAAa,gBAAgB,QAAQ;IAC/E;AACF,SAAO,OAAO,OAAO,oBAAoB;;;AAGjD,SAAgB,qBAAqB,YAAY;CAC7C,IAAI,SAAS,EAAE;AACf,KAAIF,gBAAQ,WAAW,CACnB,QAAO;CAEX,MAAM,YAAYL,aAAM,WAAW;;AAEnC,KAAI,qBAAqB,YACrB,QAAO,KAAK,UAAU,eAAe;UAEhC,qBAAqBQ,eAC1B,qBAAqB,UACrB,qBAAqB,uBACrB,qBAAqB,oCACrB,qBAAqB,2BACrB,qBAAqB,WACrB,UAAS,OAAO,OAAO,qBAAqB,UAAU,WAAW,CAAC;UAE7D,qBAAqB,YAE1B,UAASC,gBAAQhB,YAAI,UAAU,aAAa,eAAe,qBAAqB,WAAW,WAAW,CAAC,CAAC;UAEnG,qBAAqB,UAAU,OAIpC,OAAM,MAAM,uBAAuB;CAEvC,MAAM,kBAAkB,eAAe,UAAU;CACjD,MAAM,UAAU,WAAW,SAAS;AACpC,KAAI,mBAAmB,SAAS;EAC5B,MAAM,OAAOiB,aAAK,WAAW;AAC7B,SAAO,OAAO,OAAO,qBAAqB,KAAK,CAAC;OAGhD,QAAO;;AAGf,IAAM,cAAN,cAA0B,YAAY;CAClC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,eAAe,EAAE;;CAE1B,iBAAiB,MAAM;AACnB,OAAK,aAAa,KAAK,KAAK;;;AAGpC,SAAgB,2BAA2B,cAAc,gBAAgB;CACrE,MAAM,cAAc,IAAI,aAAa;AACrC,cAAa,OAAO,YAAY;CAChC,MAAM,MAAM,YAAY;AAyBxB,QAxBef,gBAAQ,MAAM,WAAW;AAEpC,SAAOA,gBADYgB,kBAAU,OAAO,WAAW,GACnB,iBAAiB,eAAe;AAExD,OAAIN,gBADuB,wBAAwB,CAAC,gBAAgB,EAAE,EAAE,EAAE,wBAAwB,EAAE,CACrE,CAC3B,QAAO,CACH;IACI,SAAS,eAAe,2BAA2B;KACjC;KACd,aAAa;KACb,gBAAgB;KACnB,CAAC;IACF,MAAM,0BAA0B;IAChC,UAAU,aAAa;IACvB,YAAY,OAAO;IACnB,aAAa,aAAa;IAC7B,CACJ;OAGD,QAAO,EAAE;IAEf;GACJ;;AAGN,SAAgB,yCAAyC,cAAc,oBAAoB,gBAAgB;CACvG,MAAM,cAAc,IAAI,aAAa;AACrC,cAAa,OAAO,YAAY;CAChC,IAAI,MAAM,YAAY;AAGtB,OAAMO,eAAO,MAAM,WAAW,OAAO,sBAAsB,KAAK;AAShE,QARejB,gBAAQ,MAAM,WAAW;EACpC,MAAM,iBAAiB,OAAO;EAE9B,MAAM,eAAe,uBAAuB,gBAAgB,cADjC,OAAO,gBAAgB,oBAC4C,OAAO;EACrG,MAAM,sBAAsB,6BAA6B,cAAc,QAAQ,cAAc,eAAe;EAC5G,MAAM,4BAA4B,mCAAmC,cAAc,QAAQ,cAAc,eAAe;AACxH,SAAO,oBAAoB,OAAO,0BAA0B;GAC9D;;AAGN,IAAa,sBAAb,cAAyC,YAAY;CACjD,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,iBAAiB,EAAE;;CAE5B,6BAA6B,SAAS;AAClC,OAAK,eAAe,KAAK,QAAQ;;CAErC,yBAAyB,YAAY;AACjC,OAAK,eAAe,KAAK,WAAW;;CAExC,sCAAsC,eAAe;AACjD,OAAK,eAAe,KAAK,cAAc;;CAE3C,gBAAgB,MAAM;AAClB,OAAK,eAAe,KAAK,KAAK;;;AAGtC,SAAgB,oBAAoB,cAAc,gBAAgB;CAC9D,MAAM,cAAc,IAAI,aAAa;AACrC,cAAa,OAAO,YAAY;CAChC,MAAM,MAAM,YAAY;AAmBxB,QAlBeA,gBAAQ,MAAM,WAAW;AACpC,MAAI,OAAO,WAAW,SAAS,IAC3B,QAAO,CACH;GACI,SAAS,eAAe,8BAA8B;IACpC;IACd,aAAa;IAChB,CAAC;GACF,MAAM,0BAA0B;GAChC,UAAU,aAAa;GACvB,YAAY,OAAO;GACtB,CACJ;MAGD,QAAO,EAAE;GAEf;;AAGN,SAAgB,kCAAkC,eAAe,cAAc,gBAAgB;CAC3F,MAAM,SAAS,EAAE;AACjB,iBAAQ,gBAAgB,gBAAgB;EACpC,MAAMC,qBAAmB,IAAI,qBAAqB;AAClD,cAAY,OAAOA,mBAAiB;EACpC,MAAM,qBAAqBA,mBAAiB;AAC5C,kBAAQ,qBAAqB,aAAa;GACtC,MAAM,WAAWiB,cAAY,SAAS;GACtC,MAAM,qBAAqB,SAAS,gBAAgB;GACpD,MAAM,iBAAiB,SAAS;GAEhC,MAAM,wBADQ,iCAAiC,gBAAgB,aAAa,UAAU,mBAAmB,CACrE;AACpC,OAAIR,gBAAQI,gBAAQ,sBAAsB,CAAC,EAAE;IACzC,MAAM,SAAS,eAAe,0BAA0B;KACpD,cAAc;KACd,YAAY;KACf,CAAC;AACF,WAAO,KAAK;KACR,SAAS;KACT,MAAM,0BAA0B;KAChC,UAAU,YAAY;KACzB,CAAC;;IAER;GACJ;AACF,QAAO;;AAEX,SAAS,6BAA6B,cAAc,eAAa,MAAM,gBAAgB;CACnF,MAAM,sBAAsB,EAAE;AA2C9B,QAhBmBhB,YA1BUU,eAAO,eAAe,QAAQ,SAAS,eAAe;AAE/E,MAAIW,cAAY,WAAW,YAAY,sBAAsB,KACzD,QAAO;AAEX,kBAAQ,UAAU,aAAa;GAC3B,MAAM,wBAAwB,CAAC,WAAW;AAC1C,mBAAQ,eAAe,cAAc,oBAAoB;AACrD,QAAI,eAAe,mBACf,aAAa,cAAc,SAAS,IAEpCA,cAAY,WAAW,iBAAiB,sBAAsB,KAC9D,uBAAsB,KAAK,gBAAgB;KAEjD;AACF,OAAI,sBAAsB,SAAS,KAC/B,CAAC,aAAa,qBAAqB,SAAS,EAAE;AAC9C,wBAAoB,KAAK,SAAS;AAClC,WAAO,KAAK;KACR,MAAM;KACN,MAAM;KACT,CAAC;;IAER;AACF,SAAO;IACR,EAAE,CAAC,GACwC,sBAAsB;EAChE,MAAM,cAAcrB,YAAI,kBAAkB,OAAO,eAAe,aAAa,EAAE;AAO/E,SAAO;GACH,SAPgB,eAAe,+BAA+B;IAC9D,cAAc;IACd,aAAaqB;IACb,kBAAkB;IAClB,YAAY,kBAAkB;IACjC,CAAC;GAGE,MAAM,0BAA0B;GAChC,UAAU,KAAK;GACf,YAAYA,cAAY;GACxB,cAAc,kBAAkB;GACnC;GACH;;AAGN,SAAgB,mCAAmC,cAAc,eAAa,MAAM,gBAAgB;CAEhG,MAAM,kBAAkBX,eAAO,eAAe,QAAQ,SAAS,QAAQ;EACnE,MAAM,kBAAkBV,YAAI,UAAU,aAAa;AAC/C,UAAO;IAAO;IAAK,MAAM;IAAU;IACrC;AACF,SAAO,OAAO,OAAO,gBAAgB;IACtC,EAAE,CAAC;AAuCN,QAtCesB,gBAAQpB,gBAAQ,kBAAkB,mBAAmB;AAGhE,MAFwBmB,cAAY,WAAW,eAAe,KAE1C,sBAAsB,KACtC,QAAO,EAAE;EAEb,MAAM,YAAY,eAAe;EACjC,MAAM,aAAa,eAAe;AA6BlC,SAjB6BrB,YAXYuB,eAAO,kBAAkB,qBAAqB;AAEnF,UAEAF,cAAY,WAAW,iBAAiB,KAAK,sBACzC,QACA,iBAAiB,MAAM,aAGvB,qBAAqB,iBAAiB,MAAM,WAAW;IAC7D,GACkE,sBAAsB;GACtF,MAAM,cAAc,CAAC,kBAAkB,MAAM,GAAG,YAAY,EAAE;GAC9D,MAAM,aAAaA,cAAY,QAAQ,IAAI,KAAKA,cAAY;AAO5D,UAAO;IACH,SAPY,eAAe,qCAAqC;KAChE,cAAc;KACd,aAAaA;KACb,kBAAkB;KAClB,YAAY,kBAAkB;KACjC,CAAC;IAGE,MAAM,0BAA0B;IAChC,UAAU,KAAK;IACH;IACZ,cAAc;IACjB;IACH;GAEJ,CAAC;;AAGP,SAAS,uCAAuC,WAAW,YAAY,gBAAgB;CACnF,MAAM,SAAS,EAAE;CACjB,MAAM,aAAarB,YAAI,aAAa,cAAc,UAAU,KAAK;AACjE,iBAAQ,YAAY,aAAa;EAC7B,MAAM,eAAe,SAAS;AAC9B,MAAIW,iBAAS,YAAY,aAAa,EAAE;GACpC,MAAM,SAAS,eAAe,4BAA4B,SAAS;AACnE,UAAO,KAAK;IACR,SAAS;IACT,MAAM,0BAA0B;IAChC,UAAU;IACb,CAAC;;GAER;AACF,QAAO;;;;;AC5aX,SAAgB,eAAe,SAAS;CACpC,MAAM,gBAAgBa,iBAAS,SAAS,EACpC,gBAAgB,qCACnB,CAAC;CACF,MAAM,gBAAgB,EAAE;AACxB,iBAAQ,QAAQ,QAAQ,SAAS;AAC7B,gBAAc,KAAK,QAAQ;GAC7B;AACF,QAAOC,iBAAkB,eAAe,cAAc,eAAe;;AAEzE,SAAgB,gBAAgB,SAAS;AACrC,WAAUD,iBAAS,SAAS,EACxB,gBAAgB,sCACnB,CAAC;AACF,QAAOE,kBAAmB,QAAQ,OAAO,QAAQ,YAAY,QAAQ,gBAAgB,QAAQ,YAAY;;;;;ACjB7G,MAAM,6BAA6B;AACnC,MAAM,0BAA0B;AAChC,MAAM,uBAAuB;AAC7B,MAAM,iCAAiC;AACvC,MAAM,8BAA8B;CAChC;CACA;CACA;CACA;CACH;AACD,OAAO,OAAO,4BAA4B;AAE1C,SAAgB,uBAAuB,OAAO;AAE1C,QAAOC,iBAAS,6BAA6B,MAAM,KAAK;;AAE5D,IAAM,uBAAN,cAAmC,MAAM;CACrC,YAAY,SAAS,OAAO;AACxB,QAAM,QAAQ;AACd,OAAK,QAAQ;AACb,OAAK,iBAAiB,EAAE;AAExB,SAAO,eAAe,MAAM,IAAI,OAAO,UAAU;;AAEjD,MAAI,MAAM,kBACN,OAAM,kBAAkB,MAAM,KAAK,YAAY;;;AAI3D,IAAa,2BAAb,cAA8C,qBAAqB;CAC/D,YAAY,SAAS,OAAO,eAAe;AACvC,QAAM,SAAS,MAAM;AACrB,OAAK,gBAAgB;AACrB,OAAK,OAAO;;;AAGpB,IAAa,uBAAb,cAA0C,qBAAqB;CAC3D,YAAY,SAAS,OAAO,eAAe;AACvC,QAAM,SAAS,MAAM;AACrB,OAAK,gBAAgB;AACrB,OAAK,OAAO;;;AAGpB,IAAa,6BAAb,cAAgD,qBAAqB;CACjE,YAAY,SAAS,OAAO;AACxB,QAAM,SAAS,MAAM;AACrB,OAAK,OAAO;;;AAGpB,IAAa,qBAAb,cAAwC,qBAAqB;CACzD,YAAY,SAAS,OAAO,eAAe;AACvC,QAAM,SAAS,MAAM;AACrB,OAAK,gBAAgB;AACrB,OAAK,OAAO;;;;;;ACjDpB,MAAa,iBAAiB,EAAE;AAChC,MAAa,6BAA6B;AAC1C,IAAa,0BAAb,cAA6C,MAAM;CAC/C,YAAY,SAAS;AACjB,QAAM,QAAQ;AACd,OAAK,OAAO;;;;;;AAMpB,IAAa,cAAb,MAAyB;CACrB,gBAAgB,QAAQ;AACpB,OAAK,mBAAmB,EAAE;AAC1B,OAAK,gBAAgB,EAAE;AACvB,OAAK,kBAAkBC,YAAI,QAAQ,kBAAkB,GAC/C,OAAO,kBACP,sBAAsB;AAI5B,MAAI,KAAK,gBACL,MAAK,8BAA8B;;CAG3C,iBAAiB,SAAS;EACtB,MAAM,cAAc,oBAAoB,SAAS,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAClF,cAAY,uBAAuB;AACnC,SAAO;;CAEX,iCAAiC,SAAS;AACtC,SAAO;;CAEX,gCAAgC,SAAS;AACrC,SAAO;;CAEX,wBAAwB,aAAa,iBAAiB,eAAe,iBAAiB;EAElF,MAAM,gBAAgB,KAAK,qBAAqB;EAChD,MAAM,kBAAkB,KAAK,kBAAkB;EAC/C,MAAM,iBAAiB,EAAE;EACzB,IAAI,oBAAoB;EACxB,MAAM,yBAAyB,KAAK,GAAG,EAAE;EACzC,IAAI,YAAY,KAAK,GAAG,EAAE;EAC1B,MAAM,6BAA6B;GAC/B,MAAM,gBAAgB,KAAK,GAAG,EAAE;GAShC,MAAM,QAAQ,IAAI,yBANN,KAAK,qBAAqB,0BAA0B;IAC5D,UAAU;IACV,QAAQ;IACR,UAAU;IACV,UAAU,KAAK,qBAAqB;IACvC,CAAC,EAC8C,wBAAwB,KAAK,GAAG,EAAE,CAAC;AAEnF,SAAM,iBAAiBC,kBAAU,eAAe;AAChD,QAAK,WAAW,MAAM;;AAE1B,SAAO,CAAC,kBAEJ,KAAI,KAAK,aAAa,WAAW,gBAAgB,EAAE;AAC/C,yBAAsB;AACtB;aAEK,cAAc,KAAK,KAAK,EAAE;AAE/B,yBAAsB;AAEtB,eAAY,MAAM,MAAM,gBAAgB;AACxC;aAEK,KAAK,aAAa,WAAW,cAAc,CAChD,qBAAoB;OAEnB;AACD,eAAY,KAAK,YAAY;AAC7B,QAAK,kBAAkB,WAAW,eAAe;;AAMzD,OAAK,iBAAiB,gBAAgB;;CAE1C,kCAAkC,yBAAyB,YAAY,UAAU;AAG7E,MAAI,aAAa,MACb,QAAO;AAGX,MAAI,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,wBAAwB,CACtD,QAAO;AAIX,MAAI,KAAK,gBAAgB,CACrB,QAAO;AAKX,MAAI,KAAK,yBAAyB,yBAAyB,KAAK,4BAA4B,yBAAyB,WAAW,CAAC,CAC7H,QAAO;AAEX,SAAO;;CAGX,4BAA4B,SAAS,cAAc;EAC/C,MAAM,cAAc,KAAK,sBAAsB,SAAS,aAAa;AAErE,SADgB,KAAK,0BAA0B,YAAY;;CAG/D,kBAAkB,iBAAiB,SAAS;AACxC,MAAI,KAAK,mCAAmC,iBAAiB,QAAQ,CAEjE,QADoB,KAAK,iBAAiB,gBAAgB;AAG9D,MAAI,KAAK,kCAAkC,gBAAgB,EAAE;GACzD,MAAM,UAAU,KAAK,YAAY;AACjC,QAAK,cAAc;AACnB,UAAO;;AAEX,QAAM,IAAI,wBAAwB,gBAAgB;;CAEtD,yBAAyB,eAAe,SAAS;AAC7C,SAAQ,KAAK,mCAAmC,eAAe,QAAQ,IACnE,KAAK,kCAAkC,cAAc;;CAE7D,mCAAmC,iBAAiB,SAAS;AACzD,MAAI,CAAC,KAAK,iCAAiC,gBAAgB,CACvD,QAAO;AAGX,MAAIC,gBAAQ,QAAQ,CAChB,QAAO;EAEX,MAAM,gBAAgB,KAAK,GAAG,EAAE;AAIhC,SAHiCC,aAAK,UAAU,2BAA2B;AACvE,UAAO,KAAK,aAAa,eAAe,uBAAuB;IACjE,KAAK;;CAGX,kCAAkC,iBAAiB;AAC/C,MAAI,CAAC,KAAK,gCAAgC,gBAAgB,CACtD,QAAO;AAGX,SADkC,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,gBAAgB;;CAGpF,yBAAyB,cAAc;EACnC,MAAM,YAAY,KAAK,kBAAkB;AAEzC,SAAOC,iBADsB,KAAK,0BAA0B,UAAU,EAChC,aAAa;;CAEvD,sBAAsB;EAClB,MAAM,4BAA4B,KAAK,kBAAkB;EAEzD,IAAI,YAAY,KAAK,GAAG,EAAE;EAC1B,IAAI,IAAI;AACR,SAAO,MAAM;GACT,MAAM,aAAaD,aAAK,4BAA4B,kBAAkB;AAElE,WADiB,aAAa,WAAW,cAAc;KAEzD;AACF,OAAI,eAAe,OACf,QAAO;AAEX,eAAY,KAAK,GAAG,EAAE;AACtB;;;CAGR,mBAAmB;AAEf,MAAI,KAAK,WAAW,WAAW,EAC3B,QAAO;EAEX,MAAM,oBAAoB,KAAK,8BAA8B;EAC7D,MAAM,cAAc,KAAK,oCAAoC;EAC7D,MAAM,oBAAoB,KAAK,kCAAkC;AACjE,SAAO;GACH,UAAU,KAAK,wBAAwB,kBAAkB;GACzD,kBAAkB;GAClB,QAAQ,KAAK,wBAAwB,kBAAkB;GAC1D;;CAEL,0BAA0B;EACtB,MAAM,oBAAoB,KAAK;EAC/B,MAAM,0BAA0B,KAAK;AACrC,SAAOE,YAAI,oBAAoB,UAAU,QAAQ;AAC7C,OAAI,QAAQ,EACR,QAAO;AAEX,UAAO;IACH,UAAU,KAAK,wBAAwB,SAAS;IAChD,kBAAkB,wBAAwB;IAC1C,QAAQ,KAAK,wBAAwB,kBAAkB,MAAM,GAAG;IACnE;IACH;;CAEN,mBAAmB;AAIf,SAAOC,gBAHaD,YAAI,KAAK,yBAAyB,GAAG,YAAY;AACjE,UAAO,KAAK,0BAA0B,QAAQ;IAChD,CACyB;;CAE/B,0BAA0B,WAAW;AACjC,MAAI,cAAc,eACd,QAAO,CAAC,IAAI;EAEhB,MAAM,aAAa,UAAU,WAAW,UAAU,mBAAmB,KAAK,UAAU;AACpF,SAAO,KAAK,cAAc;;CAI9B,kBAAkB,OAAO,cAAc;AACnC,MAAI,CAAC,KAAK,aAAa,OAAO,IAAI,CAC9B,cAAa,KAAK,MAAM;AAE5B,SAAO;;CAEX,SAAS,SAAS;EACd,MAAM,iBAAiB,EAAE;EACzB,IAAI,UAAU,KAAK,GAAG,EAAE;AACxB,SAAO,KAAK,aAAa,SAAS,QAAQ,KAAK,OAAO;AAClD,aAAU,KAAK,YAAY;AAC3B,QAAK,kBAAkB,SAAS,eAAe;;AAGnD,SAAOJ,kBAAU,eAAe;;CAEpC,4BAA4B,UAAU,MAAM,eAAe,cAAc,gBAAgB,gBAAgB,UAAU;CAInH,sBAAsB,SAAS,cAAc;AASzC,SANoB;GAChB,WAHkB,KAAK,2BAA2B;GAIlD,iBAHwBM,cAAM,KAAK,sBAAsB;GAIzD,SAAS;GACT,mBAAmB;GACtB;;CAGL,4BAA4B;AACxB,SAAOF,YAAI,KAAK,aAAa,kBAAkB,KAAK,wBAAwB,cAAc,CAAC;;;AAGnG,SAAgB,4BAA4B,UAAU,MAAM,eAAe,cAAc,gBAAgB,gBAAgB,UAAU;CAC/H,MAAM,MAAM,KAAK,4BAA4B,cAAc,eAAe;CAC1E,IAAI,oBAAoB,KAAK,iBAAiB;AAC9C,KAAI,sBAAsB,QAAW;EACjC,MAAM,eAAe,KAAK,qBAAqB;EAC/C,MAAM,cAAc,KAAK,oBAAoB,CAAC;AAE9C,sBADe,IAAI,eAAe,aAAa,eAAe,CACnC,cAAc;AACzC,OAAK,iBAAiB,OAAO;;CAEjC,IAAI,0BAA0B,kBAAkB;CAChD,IAAI,aAAa,kBAAkB;CACnC,MAAM,cAAc,kBAAkB;AAGtC,KAAI,KAAK,WAAW,WAAW,KAC3B,eACA,4BAA4B,QAAW;AACvC,4BAA0B;AAC1B,eAAa;;AAIjB,KAAI,4BAA4B,UAAa,eAAe,OACxD;AAEJ,KAAI,KAAK,kCAAkC,yBAAyB,YAAY,SAAS,CAIrF,MAAK,wBAAwB,UAAU,MAAM,eAAe,wBAAwB;;;;;ACxR5F,MAAa,uBAAuB;AACpC,MAAa,0BAA0B;AAGvC,MAAa,mBAAmB;AAIhC,MAAa,SAAS,KAAK;AAC3B,MAAa,aAAa,KAAK;AAC/B,MAAa,WAAW,KAAK;AAC7B,MAAa,mBAAmB,KAAK;AACrC,MAAa,eAAe,KAAK;AACjC,MAAa,uBAAuB,KAAK;AAEzC,SAAgB,4BAA4B,SAAS,cAAc,YAAY;AAC3E,QAAO,aAAa,eAAe;;AAER,KAAK;;;;ACnBpC,IAAa,uBAAb,MAAkC;CAC9B,YAAY,SAAS;EACjB,IAAI;AACJ,OAAK,gBACA,KAAK,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,kBAAkB,QAAQ,OAAO,KAAK,IAAI,KAAK,sBAAsB;;CAE7I,SAAS,SAAS;EACd,MAAM,sBAAsB,KAAK,wBAAwB,QAAQ,MAAM;AACvE,MAAIG,gBAAQ,oBAAoB,EAAE;GAC9B,MAAM,iBAAiB,KAAK,4BAA4B,QAAQ,MAAM;GACtE,MAAM,sBAAsB,KAAK,yCAAyC,QAAQ,OAAO,KAAK,aAAa;GAC3G,MAAM,wBAAwB,KAAK,kCAAkC,QAAQ,OAAO,KAAK,aAAa;AAOtG,UANkB;IACd,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACN;;AAGL,SAAO;;CAEX,wBAAwB,OAAO;AAC3B,SAAOC,gBAAQ,QAAQ,gBAAgB,wBAAwB,aAAa,aAAa,qCAAqC,CAAC;;CAEnI,4BAA4B,OAAO;AAC/B,SAAOA,gBAAQ,QAAQ,gBAAgB,2BAA2B,aAAa,qCAAqC,CAAC;;CAEzH,yCAAyC,OAAO,cAAc;AAC1D,SAAOA,gBAAQ,QAAQ,gBAAgB,yCAAyC,aAAa,cAAc,qCAAqC,CAAC;;CAErJ,kCAAkC,OAAO,cAAc;AACnD,SAAO,kCAAkC,OAAO,cAAc,qCAAqC;;CAEvG,6BAA6B,SAAS;AAClC,SAAO,wBAAwB,QAAQ,gBAAgB,QAAQ,MAAM,QAAQ,cAAc,QAAQ,eAAe,QAAQ,sBAAsB,+BAA+B;;CAEnL,0BAA0B,SAAS;AAC/B,SAAO,kCAAkC,QAAQ,gBAAgB,QAAQ,MAAM,QAAQ,cAAc,QAAQ,sBAAsBC,cAAY,QAAQ,SAAS,EAAE,wCAAwC;;;;;;;;;ACnClN,IAAa,aAAb,MAAwB;CACpB,eAAe,QAAQ;AACnB,OAAK,uBAAuBC,YAAI,QAAQ,uBAAuB,GACzD,OAAO,uBACP,sBAAsB;AAC5B,OAAK,eAAeA,YAAI,QAAQ,eAAe,GACzC,OAAO,eACP,sBAAsB;AAC5B,OAAK,oBAAoBA,YAAI,QAAQ,oBAAoB,GACnD,OAAO,oBACP,IAAI,qBAAqB,EAAE,cAAc,KAAK,cAAc,CAAC;AACnE,OAAK,sCAAsB,IAAI,KAAK;;CAExC,6BAA6B,OAAO;AAChC,kBAAQ,QAAQ,aAAa;AACzB,QAAK,WAAW,GAAG,SAAS,KAAK,wBAAwB;IACrD,MAAM,EAAE,4BAAa,0BAAY,kBAAQ,4CAAqB,kCAAkC,4BAA6B,eAAe,SAAS;AACrJ,oBAAQC,gBAAc,aAAa;KAC/B,MAAM,UAAU,SAAS,QAAQ,IAAI,KAAK,SAAS;AACnD,UAAK,WAAW,GAAGC,uBAAqB,SAAS,GAAG,iBAAiB;MACjE,MAAM,SAAS,KAAK,kBAAkB,6BAA6B;OAC/D,gBAAgB,SAAS;OACzB,MAAM;OACN,cAAc,SAAS,gBAAgB,KAAK;OAC5C,eAAe,SAAS;OACxB,sBAAsB,KAAK;OAC9B,CAAC;MACF,MAAM,MAAM,4BAA4B,KAAK,oBAAoB,SAAS,OAAO,QAAQ,SAAS,IAAI;AACtG,WAAK,eAAe,KAAK,OAAO;OAClC;MACJ;AACF,oBAAQC,eAAa,aAAa;AAC9B,UAAK,qBAAqB,UAAU,SAAS,KAAK,UAAU,cAAc,SAAS,cAAcD,uBAAqB,SAAS,CAAC;MAClI;AACF,oBAAQE,WAAS,aAAa;AAC1B,UAAK,qBAAqB,UAAU,SAAS,KAAK,YAAY,UAAU,SAAS,cAAcF,uBAAqB,SAAS,CAAC;MAChI;AACF,oBAAQG,wBAAsB,aAAa;AACvC,UAAK,qBAAqB,UAAU,SAAS,KAAK,kBAAkB,uBAAuB,SAAS,cAAcH,uBAAqB,SAAS,CAAC;MACnJ;AACF,oBAAQ,mCAAmC,aAAa;AACpD,UAAK,qBAAqB,UAAU,SAAS,KAAK,sBAAsB,oCAAoC,SAAS,cAAcA,uBAAqB,SAAS,CAAC;MACpK;AACF,oBAAQ,0BAA0B,aAAa;AAC3C,UAAK,qBAAqB,UAAU,SAAS,KAAK,cAAc,2BAA2B,SAAS,cAAcA,uBAAqB,SAAS,CAAC;MACnJ;KACJ;IACJ;;CAEN,qBAAqB,MAAM,gBAAgB,SAAS,UAAU,kBAAkB,eAAe;AAC3F,OAAK,WAAW,GAAG,gBAAgB,mBAAmB,IAAI,KAAK,wBAAwB;GACnF,MAAM,SAAS,KAAK,kBAAkB,0BAA0B;IAC5D;IACA;IACA,cAAc,oBAAoB,KAAK;IACvC,sBAAsB,KAAK;IAC3B;IACH,CAAC;GACF,MAAM,MAAM,4BAA4B,KAAK,oBAAoB,KAAK,OAAO,SAAS,eAAe;AACrG,QAAK,eAAe,KAAK,OAAO;IAClC;;CAGN,4BAA4B,cAAc,YAAY;AAElD,SAAO,4BADmB,KAAK,8BAA8B,EACP,cAAc,WAAW;;CAEnF,mBAAmB,KAAK;AACpB,SAAO,KAAK,oBAAoB,IAAI,IAAI;;;CAG5C,eAAe,KAAK,OAAO;AACvB,OAAK,oBAAoB,IAAI,KAAK,MAAM;;;AAGhD,IAAM,6BAAN,cAAyC,YAAY;CACjD,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,aAAa;GACd,QAAQ,EAAE;GACV,aAAa,EAAE;GACf,YAAY,EAAE;GACd,yBAAyB,EAAE;GAC3B,qBAAqB,EAAE;GACvB,kCAAkC,EAAE;GACvC;;CAEL,QAAQ;AACJ,OAAK,aAAa;GACd,QAAQ,EAAE;GACV,aAAa,EAAE;GACf,YAAY,EAAE;GACd,yBAAyB,EAAE;GAC3B,qBAAqB,EAAE;GACvB,kCAAkC,EAAE;GACvC;;CAEL,YAAY,UAAQ;AAChB,OAAK,WAAW,OAAO,KAAKE,SAAO;;CAEvC,6BAA6B,SAAS;AAClC,OAAK,WAAW,wBAAwB,KAAK,QAAQ;;CAEzD,yBAAyB,YAAY;AACjC,OAAK,WAAW,oBAAoB,KAAK,WAAW;;CAExD,sCAAsC,eAAe;AACjD,OAAK,WAAW,iCAAiC,KAAK,cAAc;;CAExE,gBAAgB,MAAM;AAClB,OAAK,WAAW,WAAW,KAAK,KAAK;;CAEzC,iBAAiB,IAAI;AACjB,OAAK,WAAW,YAAY,KAAK,GAAG;;;AAG5C,MAAM,mBAAmB,IAAI,4BAA4B;AACzD,SAAgB,eAAe,MAAM;AACjC,kBAAiB,OAAO;AACxB,MAAK,OAAO,iBAAiB;CAC7B,MAAM,aAAa,iBAAiB;AAEpC,kBAAiB,OAAO;AACxB,QAAO;;;;;;;;;;;;AC5HX,SAAgB,0BAA0B,kBAAkB,iBAAiB;AAEzE,KAAI,MAAM,iBAAiB,YAAY,KAAK,MAAM;AAI9C,mBAAiB,cAAc,gBAAgB;AAC/C,mBAAiB,YAAY,gBAAgB;YAMxC,iBAAiB,YAAY,gBAAgB,cAAc,KAChE,kBAAiB,YAAY,gBAAgB;;;;;;;;;AAUrD,SAAgB,oBAAoB,kBAAkB,iBAAiB;AAEnE,KAAI,MAAM,iBAAiB,YAAY,KAAK,MAAM;AAI9C,mBAAiB,cAAc,gBAAgB;AAC/C,mBAAiB,cAAc,gBAAgB;AAC/C,mBAAiB,YAAY,gBAAgB;AAC7C,mBAAiB,YAAY,gBAAgB;AAC7C,mBAAiB,YAAY,gBAAgB;AAC7C,mBAAiB,UAAU,gBAAgB;YAMtC,iBAAiB,YAAY,gBAAgB,cAAc,MAAM;AACtE,mBAAiB,YAAY,gBAAgB;AAC7C,mBAAiB,YAAY,gBAAgB;AAC7C,mBAAiB,UAAU,gBAAgB;;;AAGnD,SAAgB,iBAAiB,MAAM,OAAO,eAAe;AACzD,KAAI,KAAK,SAAS,mBAAmB,OACjC,MAAK,SAAS,iBAAiB,CAAC,MAAM;KAGtC,MAAK,SAAS,eAAe,KAAK,MAAM;;AAGhD,SAAgB,qBAAqB,MAAM,UAAU,YAAY;AAC7D,KAAI,KAAK,SAAS,cAAc,OAC5B,MAAK,SAAS,YAAY,CAAC,WAAW;KAGtC,MAAK,SAAS,UAAU,KAAK,WAAW;;;;;ACnEhD,MAAM,OAAO;AACb,SAAgB,eAAe,KAAK,WAAW;AAC3C,QAAO,eAAe,KAAK,MAAM;EAC7B,YAAY;EACZ,cAAc;EACd,UAAU;EACV,OAAO;EACV,CAAC;;;;;ACLN,SAAgB,aAAa,KAAK,OAAO;CACrC,MAAM,gBAAgBE,aAAK,IAAI;CAC/B,MAAM,sBAAsB,cAAc;AAC1C,MAAK,IAAI,IAAI,GAAG,IAAI,qBAAqB,KAAK;EAE1C,MAAM,iBAAiB,IADD,cAAc;EAEpC,MAAM,uBAAuB,eAAe;AAC5C,OAAK,IAAI,IAAI,GAAG,IAAI,sBAAsB,KAAK;GAC3C,MAAM,YAAY,eAAe;AAEjC,OAAI,UAAU,iBAAiB,OAC3B,MAAK,UAAU,MAAM,UAAU,UAAU,MAAM;;;;AAM/D,SAAgB,qCAAqC,aAAa,WAAW;CACzE,MAAM,qBAAqB,WAAY;AAIvC,gBAAe,oBAAoB,cAAc,gBAAgB;AAwBjE,oBAAmB,YAvBG;EAClB,OAAO,SAAU,SAAS,OAAO;AAE7B,OAAIC,gBAAQ,QAAQ,CAGhB,WAAU,QAAQ;AAGtB,OAAIC,oBAAY,QAAQ,CACpB;AAEJ,UAAO,KAAK,QAAQ,MAAM,QAAQ,UAAU,MAAM;;EAEtD,iBAAiB,WAAY;GACzB,MAAM,2BAA2B,gBAAgB,MAAM,UAAU;AACjE,OAAI,CAACC,gBAAQ,yBAAyB,EAAE;IACpC,MAAM,gBAAgBC,YAAI,2BAA2B,iBAAiB,aAAa,IAAI;AACvF,UAAM,MAAM,mCAAmC,KAAK,YAAY,KAAK,QAC9D,cAAc,KAAK,OAAO,CAAC,QAAQ,OAAO,MAAO,GAAG;;;EAGtE;AAED,oBAAmB,UAAU,cAAc;AAC3C,oBAAmB,cAAc;AACjC,QAAO;;AAEX,SAAgB,yCAAyC,aAAa,WAAW,iBAAiB;CAC9F,MAAM,qBAAqB,WAAY;AAIvC,gBAAe,oBAAoB,cAAc,4BAA4B;CAC7E,MAAM,oBAAoB,OAAO,OAAO,gBAAgB,UAAU;AAClE,iBAAQ,YAAY,aAAa;AAC7B,oBAAkB,YAAY;GAChC;AACF,oBAAmB,YAAY;AAC/B,oBAAmB,UAAU,cAAc;AAC3C,QAAO;;AAEX,IAAW;CACV,SAAU,6BAA2B;AAClC,6BAA0B,4BAA0B,sBAAsB,KAAK;AAC/E,6BAA0B,4BAA0B,oBAAoB,KAAK;GAC9E,8BAA8B,4BAA4B,EAAE,EAAE;AACjE,SAAgB,gBAAgB,iBAAiB,WAAW;AAExD,QADsB,0BAA0B,iBAAiB,UAAU;;AAG/E,SAAgB,0BAA0B,iBAAiB,WAAW;AAWlE,QAAOC,gBAPQD,YAHUE,eAAO,YAAY,iBAAiB;AACzD,SAAOC,mBAAW,gBAAgB,cAAc,KAAK;GACvD,GACoC,iBAAiB;AACnD,SAAO;GACH,KAAK,4BAA4B,aAAa,OAAQ,gBAAgB,YAAY,KAAM;GACxF,MAAM,0BAA0B;GAChC,YAAY;GACf;GACH,CACoB;;;;;;;;AChF1B,IAAa,cAAb,MAAyB;CACrB,gBAAgB,QAAQ;AACpB,OAAK,YAAY,EAAE;AAEnB,OAAK,YAAY,OAAO;AACxB,OAAK,uBAAuBC,YAAI,QAAQ,uBAAuB,GACzD,OAAO,uBACP,sBAAsB;AAC5B,MAAI,CAAC,KAAK,WAAW;AACjB,QAAK,2BAA2BC;AAChC,QAAK,wBAAwBA;AAC7B,QAAK,kBAAkBA;AACvB,QAAK,qBAAqBA;AAC1B,QAAK,cAAcA;aAGf,QAAQ,KAAK,KAAK,qBAAqB,CACvC,KAAI,KAAK,iBAAiB;AACtB,QAAK,2BAA2B;AAChC,QAAK,0BAA0B;AAC/B,QAAK,cAAcA;AACnB,QAAK,yBAAyB,KAAK;SAElC;AACD,QAAK,2BAA2BA;AAChC,QAAK,0BAA0BA;AAC/B,QAAK,cAAc,KAAK;AACxB,QAAK,yBAAyB,KAAK;;WAGlC,cAAc,KAAK,KAAK,qBAAqB,CAClD,KAAI,KAAK,iBAAiB;AACtB,QAAK,2BAA2B;AAChC,QAAK,0BAA0B;AAC/B,QAAK,cAAcA;AACnB,QAAK,yBACD,KAAK;SAER;AACD,QAAK,2BAA2BA;AAChC,QAAK,0BAA0BA;AAC/B,QAAK,cAAc,KAAK;AACxB,QAAK,yBACD,KAAK;;WAGR,QAAQ,KAAK,KAAK,qBAAqB,EAAE;AAC9C,QAAK,2BAA2BA;AAChC,QAAK,0BAA0BA;AAC/B,QAAK,cAAcA;AACnB,QAAK,yBAAyBA;QAG9B,OAAM,MAAM,kDAAkD,OAAO,qBAAqB,GAAG;;CAIzG,yCAAyC,SAAS;AAC9C,UAAQ,WAAW;GACf,aAAa;GACb,WAAW;GACd;;CAEL,wCAAwC,SAAS;AAC7C,UAAQ,WAAW;GAKf,aAAa,KAAK,GAAG,EAAE,CAAC;GACxB,WAAW;GACd;;CAEL,mCAAmC,SAAS;AACxC,UAAQ,WAAW;GACf,aAAa;GACb,WAAW;GACX,aAAa;GACb,WAAW;GACX,SAAS;GACT,WAAW;GACd;;;;;;;CAOL,kCAAkC,SAAS;EACvC,MAAM,YAAY,KAAK,GAAG,EAAE;AAC5B,UAAQ,WAAW;GACf,aAAa,UAAU;GACvB,WAAW,UAAU;GACrB,aAAa,UAAU;GACvB,WAAW;GACX,SAAS;GACT,WAAW;GACd;;CAEL,yBAAyB,cAAc;EACnC,MAAM,UAAU;GACZ,MAAM;GACN,UAAU,OAAO,OAAO,KAAK;GAChC;AACD,OAAK,uBAAuB,QAAQ;AACpC,OAAK,UAAU,KAAK,QAAQ;;CAEhC,wBAAwB;AACpB,OAAK,UAAU,KAAK;;CAExB,gBAAgB,aAAa;EAEzB,MAAM,YAAY,KAAK,GAAG,EAAE;EAC5B,MAAM,MAAM,YAAY;AAGxB,MAAI,IAAI,eAAe,UAAU,gBAAgB,MAAM;AACnD,OAAI,YAAY,UAAU;AAC1B,OAAI,UAAU,UAAU;AACxB,OAAI,YAAY,UAAU;SAGzB;AACD,OAAI,cAAc;AAClB,OAAI,YAAY;AAChB,OAAI,cAAc;;;CAG1B,sBAAsB,aAAa;EAC/B,MAAM,YAAY,KAAK,GAAG,EAAE;EAE5B,MAAM,MAAM,YAAY;AAGxB,MAAI,IAAI,eAAe,UAAU,gBAAgB,KAC7C,KAAI,YAAY,UAAU;MAI1B,KAAI,cAAc;;CAG1B,gBAAgB,KAAK,eAAe;EAChC,MAAM,UAAU,KAAK,UAAU,KAAK,UAAU,SAAS;AACvD,mBAAiB,SAAS,eAAe,IAAI;AAE7C,OAAK,yBAAyB,QAAQ,UAAU,cAAc;;CAElE,mBAAmB,eAAe,UAAU;EACxC,MAAM,aAAa,KAAK,UAAU,KAAK,UAAU,SAAS;AAC1D,uBAAqB,YAAY,UAAU,cAAc;AAEzD,OAAK,wBAAwB,WAAW,UAAU,cAAc,SAAS;;CAE7E,+BAA+B;AAC3B,MAAIC,oBAAY,KAAK,0BAA0B,EAAE;GAC7C,MAAM,+BAA+B,qCAAqC,KAAK,WAAWC,aAAK,KAAK,qBAAqB,CAAC;AAC1H,QAAK,4BAA4B;AACjC,UAAO;;AAEX,SAAO,KAAK;;CAEhB,2CAA2C;AACvC,MAAID,oBAAY,KAAK,sCAAsC,EAAE;GACzD,MAAM,iBAAiB,yCAAyC,KAAK,WAAWC,aAAK,KAAK,qBAAqB,EAAE,KAAK,8BAA8B,CAAC;AACrJ,QAAK,wCAAwC;AAC7C,UAAO;;AAEX,SAAO,KAAK;;CAEhB,+BAA+B;EAC3B,MAAM,YAAY,KAAK;AACvB,SAAO,UAAU,UAAU,SAAS;;CAExC,mCAAmC;EAC/B,MAAM,YAAY,KAAK;AACvB,SAAO,UAAU,UAAU,SAAS;;CAExC,qCAAqC;EACjC,MAAM,kBAAkB,KAAK;AAC7B,SAAO,gBAAgB,gBAAgB,SAAS;;;;;;;;;;;;;ACnLxD,IAAa,eAAb,MAA0B;CACtB,mBAAmB;AACf,OAAK,YAAY,EAAE;AACnB,OAAK,kBAAkB;AACvB,OAAK,UAAU;;CAEnB,IAAI,MAAM,UAAU;AAGhB,MAAI,KAAK,qBAAqB,KAC1B,OAAM,MAAM,mFAAmF;AAInG,OAAK,OAAO;AACZ,OAAK,YAAY;AACjB,OAAK,kBAAkB,SAAS;;CAEpC,IAAI,QAAQ;AACR,SAAO,KAAK;;CAGhB,aAAa;AACT,MAAI,KAAK,WAAW,KAAK,UAAU,SAAS,GAAG;AAC3C,QAAK,cAAc;AACnB,UAAO,KAAK,GAAG,EAAE;QAGjB,QAAO;;CAKf,GAAG,SAAS;EACR,MAAM,YAAY,KAAK,UAAU;AACjC,MAAI,YAAY,KAAK,KAAK,mBAAmB,UACzC,QAAO;MAGP,QAAO,KAAK,UAAU;;CAG9B,eAAe;AACX,OAAK;;CAET,mBAAmB;AACf,SAAO,KAAK;;CAEhB,iBAAiB,YAAU;AACvB,OAAK,UAAUC;;CAEnB,kBAAkB;AACd,OAAK,UAAU;;CAEnB,wBAAwB;AACpB,OAAK,UAAU,KAAK,UAAU,SAAS;;CAE3C,mBAAmB;AACf,SAAO,KAAK,kBAAkB;;;;;;;;;;;;;;ACpDtC,IAAa,gBAAb,MAA2B;CACvB,OAAO,MAAM;AACT,SAAO,KAAK,KAAK,KAAK;;CAE1B,QAAQ,KAAK,SAAS,SAAS;AAC3B,SAAO,KAAK,gBAAgB,SAAS,KAAK,QAAQ;;CAEtD,QAAQ,KAAK,YAAY,SAAS;AAC9B,SAAO,KAAK,gBAAgB,YAAY,KAAK,QAAQ;;CAEzD,OAAO,KAAK,mBAAmB;AAC3B,SAAO,KAAK,eAAe,mBAAmB,IAAI;;CAEtD,GAAG,KAAK,YAAY;AAChB,SAAO,KAAK,WAAW,YAAY,IAAI;;CAE3C,KAAK,KAAK,mBAAmB;AACzB,SAAO,KAAK,aAAa,KAAK,kBAAkB;;CAEpD,WAAW,KAAK,mBAAmB;AAC/B,SAAO,KAAK,mBAAmB,KAAK,kBAAkB;;CAE1D,QAAQ,SAAS,SAAS;AACtB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,SAAS,SAAS,SAAS;AACvB,SAAO,KAAK,gBAAgB,SAAS,GAAG,QAAQ;;CAEpD,QAAQ,YAAY,SAAS;AACzB,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,SAAS,YAAY,SAAS;AAC1B,SAAO,KAAK,gBAAgB,YAAY,GAAG,QAAQ;;CAEvD,OAAO,mBAAmB;AACtB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,QAAQ,mBAAmB;AACvB,SAAO,KAAK,eAAe,mBAAmB,EAAE;;CAEpD,GAAG,YAAY;AACX,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,IAAI,YAAY;AACZ,SAAO,KAAK,WAAW,YAAY,EAAE;;CAEzC,KAAK,mBAAmB;AACpB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,MAAM,mBAAmB;AACrB,OAAK,aAAa,GAAG,kBAAkB;;CAE3C,SAAS,SAAS;AACd,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,UAAU,SAAS;AACf,OAAK,qBAAqB,GAAG,QAAQ;;CAEzC,aAAa,mBAAmB;AAC5B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,SAAO,KAAK,mBAAmB,GAAG,kBAAkB;;CAExD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,cAAc,mBAAmB;AAC7B,OAAK,mBAAmB,GAAG,kBAAkB;;CAEjD,iBAAiB,SAAS;AACtB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,kBAAkB,SAAS;AACvB,OAAK,2BAA2B,GAAG,QAAQ;;CAE/C,KAAK,MAAM,gBAAgB,SAAS,qBAAqB;AACrD,MAAIC,iBAAS,KAAK,mBAAmB,KAAK,EAAE;GAKxC,MAAM,QAAQ;IACV,SALW,qCAAqC,4BAA4B;KAC5E,cAAc;KACd,aAAa,KAAK;KACrB,CAAC;IAGE,MAAM,0BAA0B;IAChC,UAAU;IACb;AACD,QAAK,iBAAiB,KAAK,MAAM;;AAErC,OAAK,kBAAkB,KAAK,KAAK;EACjC,MAAM,qBAAqB,KAAK,WAAW,MAAM,gBAAgB,OAAO;AACxE,OAAK,QAAQ;AACb,SAAO;;CAEX,cAAc,MAAM,MAAM,SAAS,qBAAqB;EACpD,MAAM,aAAa,yBAAyB,MAAM,KAAK,mBAAmB,KAAK,UAAU;AACzF,OAAK,mBAAmB,KAAK,iBAAiB,OAAO,WAAW;EAChE,MAAM,qBAAqB,KAAK,WAAW,MAAM,MAAM,OAAO;AAC9D,OAAK,QAAQ;AACb,SAAO;;CAEX,UAAU,aAAa,MAAM;AACzB,SAAO,WAAY;AAEf,QAAK,oBAAoB,KAAK,EAAE;GAChC,MAAM,WAAW,KAAK,gBAAgB;AACtC,OAAI;AACA,gBAAY,MAAM,MAAM,KAAK;AAE7B,WAAO;YAEJ,GAAG;AACN,QAAI,uBAAuB,EAAE,CACzB,QAAO;QAGP,OAAM;aAGN;AACJ,SAAK,iBAAiB,SAAS;AAC/B,SAAK,oBAAoB,KAAK;;;;CAK1C,qBAAqB;AACjB,SAAO,KAAK;;CAEhB,+BAA+B;AAC3B,SAAO,iBAAiBC,eAAO,KAAK,qBAAqB,CAAC;;;;;;;;;;AC7TlE,IAAa,mBAAb,MAA8B;CAC1B,qBAAqB,iBAAiB,QAAQ;AAC1C,OAAK,YAAY,KAAK,YAAY;AAElC,OAAK,sBAAsB,EAAE;AAC7B,OAAK,sBAAsB,EAAE;AAC7B,OAAK,mBAAmB;AACxB,OAAK,eAAe;AACpB,OAAK,aAAa;AAClB,OAAK,oBAAoB,EAAE;AAC3B,OAAK,YAAY,EAAE;AACnB,OAAK,sBAAsB,EAAE;AAC7B,OAAK,aAAa,EAAE;AACpB,OAAK,wBAAwB,EAAE;AAC/B,OAAK,uBAAuB,EAAE;AAC9B,MAAIC,YAAI,QAAQ,oBAAoB,CAChC,OAAM,MAAM,iLAEiB;AAEjC,MAAIC,gBAAQ,gBAAgB,EAAE;AAI1B,OAAIC,gBAAQ,gBAAgB,CACxB,OAAM,MAAM,4IAEsC;AAEtD,OAAI,OAAO,gBAAgB,GAAG,gBAAgB,SAC1C,OAAM,MAAM,+KAEiB;;AAGrC,MAAID,gBAAQ,gBAAgB,CACxB,MAAK,YAAYE,eAAO,kBAAkB,KAAK,YAAY;AACvD,OAAI,QAAQ,QAAQ;AACpB,UAAO;KACR,EAAE,CAAC;WAEDH,YAAI,iBAAiB,QAAQ,IAClCI,cAAMC,gBAAQC,eAAO,gBAAgB,MAAM,CAAC,EAAE,YAAY,CAG1D,MAAK,YAAYH,eADII,aADCF,gBAAQC,eAAO,gBAAgB,MAAM,CAAC,CACpB,GACD,KAAK,YAAY;AACpD,OAAI,QAAQ,QAAQ;AACpB,UAAO;KACR,EAAE,CAAC;WAEDE,iBAAS,gBAAgB,CAC9B,MAAK,YAAYC,cAAM,gBAAgB;MAGvC,OAAM,IAAI,MAAM,yIAC0D;AAI9E,OAAK,UAAU,SAAS;AAKxB,OAAK,eADyBL,cAHRJ,YAAI,iBAAiB,QAAQ,GAC7CK,gBAAQC,eAAO,gBAAgB,MAAM,CAAC,GACtCA,eAAO,gBAAgB,GACuB,qBAAqBJ,gBAAQ,iBAAiB,gBAAgB,CAAC,GAE7G,qCACA;AAIN,oBAAkBI,eAAO,KAAK,UAAU,CAAC;;CAE7C,WAAW,UAAU,MAAM,QAAQ;AAC/B,MAAI,KAAK,iBACL,OAAM,MAAM,iBAAiB,SAAS,4KAC6D;EAEvG,MAAM,gBAAgBN,YAAI,QAAQ,gBAAgB,GAC5C,OAAO,gBACP,oBAAoB;EAC1B,MAAM,oBAAoBA,YAAI,QAAQ,oBAAoB,GACpD,OAAO,oBACP,oBAAoB;EAG1B,MAAM,YAAY,KAAK,oBAAqB,uBAAuB;AACnE,OAAK;AACL,OAAK,oBAAoB,aAAa;AACtC,OAAK,oBAAoB,YAAY;EACrC,IAAI;AAGJ,MAAI,KAAK,cAAc,KACnB,qBAAoB,SAASU,oBAAkB,GAAG,MAAM;AACpD,OAAI;AACA,SAAK,0BAA0B,WAAW,UAAU,KAAK,WAAW;AACpE,SAAK,MAAM,MAAM,KAAK;IACtB,MAAM,MAAM,KAAK,UAAU,KAAK,UAAU,SAAS;AACnD,SAAK,YAAY,IAAI;AACrB,WAAO;YAEJ,GAAG;AACN,WAAO,KAAK,gBAAgB,GAAG,eAAe,kBAAkB;aAE5D;AACJ,SAAK,wBAAwB;;;MAKrC,qBAAoB,SAAS,qBAAqB,GAAG,MAAM;AACvD,OAAI;AACA,SAAK,0BAA0B,WAAW,UAAU,KAAK,WAAW;AACpE,WAAO,KAAK,MAAM,MAAM,KAAK;YAE1B,GAAG;AACN,WAAO,KAAK,gBAAgB,GAAG,eAAe,kBAAkB;aAE5D;AACJ,SAAK,wBAAwB;;;AAKzC,SAD2B,OAAO,OAAO,mBAAmB;GAAE;GAAU,uBAAuB;GAAM,CAAC;;CAG1G,gBAAgB,GAAG,qBAAqB,mBAAmB;EACvD,MAAM,qBAAqB,KAAK,WAAW,WAAW;EAKtD,MAAM,gBAAgB,uBAAuB,CAAC,KAAK,gBAAgB,IAAI,KAAK;AAC5E,MAAI,uBAAuB,EAAE,EAAE;GAC3B,MAAM,aAAa;AACnB,OAAI,eAAe;IACf,MAAM,gBAAgB,KAAK,qBAAqB;AAChD,QAAI,KAAK,yBAAyB,cAAc,EAAE;AAC9C,gBAAW,iBAAiB,KAAK,SAAS,cAAc;AACxD,SAAI,KAAK,WAAW;MAChB,MAAM,mBAAmB,KAAK,UAAU,KAAK,UAAU,SAAS;AAChE,uBAAiB,gBAAgB;AACjC,aAAO;WAGP,QAAO,kBAAkB,EAAE;WAG9B;AACD,SAAI,KAAK,WAAW;MAChB,MAAM,mBAAmB,KAAK,UAAU,KAAK,UAAU,SAAS;AAChE,uBAAiB,gBAAgB;AACjC,iBAAW,mBAAmB;;AAGlC,WAAM;;cAGL,oBAAoB;AAEzB,SAAK,uBAAuB;AAG5B,WAAO,kBAAkB,EAAE;SAI3B,OAAM;QAKV,OAAM;;CAId,eAAe,mBAAmB,YAAY;EAC1C,MAAM,MAAM,KAAK,4BAA4B,YAAY,WAAW;AACpE,SAAO,KAAK,oBAAoB,mBAAmB,YAAY,IAAI;;CAEvE,oBAAoB,mBAAmB,YAAY,KAAK;EACpD,IAAI,gBAAgB,KAAK,mBAAmB,IAAI;EAChD,IAAI;AACJ,MAAI,OAAO,sBAAsB,YAAY;AACzC,YAAS,kBAAkB;GAC3B,MAAM,YAAY,kBAAkB;AAEpC,OAAI,cAAc,QAAW;IACzB,MAAM,uBAAuB;AAC7B,0BAAsB;AAClB,YAAO,UAAU,KAAK,KAAK,IAAI,qBAAqB,KAAK,KAAK;;;QAKtE,UAAS;AAEb,MAAI,cAAc,KAAK,KAAK,KAAK,KAC7B,QAAO,OAAO,KAAK,KAAK;;CAIhC,mBAAmB,gBAAgB,mBAAmB;EAClD,MAAM,QAAQ,KAAK,4BAA4B,kBAAkB,eAAe;AAChF,SAAO,KAAK,wBAAwB,gBAAgB,mBAAmB,MAAM;;CAEjF,wBAAwB,gBAAgB,mBAAmB,KAAK;EAC5D,IAAI,gBAAgB,KAAK,mBAAmB,IAAI;EAChD,IAAI;AACJ,MAAI,OAAO,sBAAsB,YAAY;AACzC,YAAS,kBAAkB;GAC3B,MAAM,YAAY,kBAAkB;AAEpC,OAAI,cAAc,QAAW;IACzB,MAAM,uBAAuB;AAC7B,0BAAsB;AAClB,YAAO,UAAU,KAAK,KAAK,IAAI,qBAAqB,KAAK,KAAK;;;QAKtE,UAAS;AAEb,MAAI,cAAc,KAAK,KAAK,KAAK,MAAM;GACnC,IAAI,WAAW,KAAK,mBAAmB,OAAO;AAC9C,UAAO,cAAc,KAAK,KAAK,KAAK,QAChC,aAAa,KACb,YAAW,KAAK,mBAAmB,OAAO;QAI9C,OAAM,KAAK,wBAAwB,gBAAgB,UAAU,sBAAsB,kBAAkB,QAAQ;AAMjH,OAAK,4BAA4B,KAAK,oBAAoB,CAAC,gBAAgB,kBAAkB,EAAE,eAAe,kBAAkB,gBAAgB,kCAAkC;;CAEtL,2BAA2B,gBAAgB,SAAS;EAChD,MAAM,QAAQ,KAAK,4BAA4B,sBAAsB,eAAe;AACpF,OAAK,gCAAgC,gBAAgB,SAAS,MAAM;;CAExE,gCAAgC,gBAAgB,SAAS,KAAK;EAC1D,MAAM,SAAS,QAAQ;EACvB,MAAM,YAAY,QAAQ;AAG1B,MAFoC,KAAK,mBAAmB,IAAI,CAEhC,KAAK,KAAK,KAAK,MAAM;AACjD,UAAO,KAAK,KAAK;GAGjB,MAAM,+BAA+B;AACjC,WAAO,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,UAAU;;AAGnD,UAAO,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,UAAU,KAAK,MAAM;AAGtD,SAAK,QAAQ,UAAU;AAEvB,WAAO,KAAK,KAAK;;AAGrB,QAAK,4BAA4B,KAAK,6BAA6B;IAC/D;IACA;IACA;IACA;IACA;IACH,EAAE,wBAAwB,sBAAsB,gBAAgB,qCAAqC;QAGtG,OAAM,KAAK,wBAAwB,gBAAgB,UAAU,qCAAqC,QAAQ,QAAQ;;CAG1H,aAAa,gBAAgB,mBAAmB;EAC5C,MAAM,QAAQ,KAAK,4BAA4B,UAAU,eAAe;AACxE,SAAO,KAAK,kBAAkB,gBAAgB,mBAAmB,MAAM;;CAE3E,kBAAkB,gBAAgB,mBAAmB,KAAK;EACtD,IAAI,oBAAoB,KAAK,mBAAmB,IAAI;EACpD,IAAI;AACJ,MAAI,OAAO,sBAAsB,YAAY;AACzC,YAAS,kBAAkB;GAC3B,MAAM,YAAY,kBAAkB;AAEpC,OAAI,cAAc,QAAW;IACzB,MAAM,uBAAuB;AAC7B,8BAA0B;AACtB,YAAO,UAAU,KAAK,KAAK,IAAI,qBAAqB,KAAK,KAAK;;;QAKtE,UAAS;EAEb,IAAI,WAAW;AACf,SAAO,kBAAkB,KAAK,KAAK,KAAK,QAAQ,aAAa,KACzD,YAAW,KAAK,mBAAmB,OAAO;AAG9C,OAAK,4BAA4B,KAAK,cAAc,CAAC,gBAAgB,kBAAkB,EAAE,mBAAmB,UAAU,gBAAgB,6BAMtI,SAAS;;CAEb,qBAAqB,gBAAgB,SAAS;EAC1C,MAAM,QAAQ,KAAK,4BAA4B,cAAc,eAAe;AAC5E,OAAK,0BAA0B,gBAAgB,SAAS,MAAM;;CAElE,0BAA0B,gBAAgB,SAAS,KAAK;EACpD,MAAM,SAAS,QAAQ;EACvB,MAAM,YAAY,QAAQ;AAG1B,MAF6B,KAAK,mBAAmB,IAAI,CAEhC,KAAK,KAAK,KAAK,MAAM;AAC1C,UAAO,KAAK,KAAK;GACjB,MAAM,+BAA+B;AACjC,WAAO,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,UAAU;;AAGnD,UAAO,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,UAAU,KAAK,MAAM;AAGtD,SAAK,QAAQ,UAAU;AAEvB,WAAO,KAAK,KAAK;;AAGrB,QAAK,4BAA4B,KAAK,6BAA6B;IAC/D;IACA;IACA;IACA;IACA;IACH,EAAE,wBAAwB,cAAc,gBAAgB,+BAA+B;;;CAGhG,4BAA4B,gBAAgB,WAAW,wBAAwB,QAAQ,yBAAyB;AAC5G,SAAO,wBAAwB,EAAE;AAG7B,QAAK,QAAQ,UAAU;AACvB,UAAO,KAAK,KAAK;;;AAQrB,OAAK,4BAA4B,KAAK,6BAA6B;GAC/D;GACA;GACA;GACA;GACA;GACH,EAAE,wBAAwB,sBAAsB,gBAAgB,wBAAwB;;CAE7F,mBAAmB,QAAQ;EACvB,MAAM,kBAAkB,KAAK,kBAAkB;AAC/C,SAAO,KAAK,KAAK;AAIjB,SAHuB,KAAK,kBAAkB,GAGtB;;CAE5B,WAAW,YAAY,YAAY;EAC/B,MAAM,QAAQ,KAAK,4BAA4B,QAAQ,WAAW;EAClE,MAAM,OAAOT,gBAAQ,WAAW,GAAG,aAAa,WAAW;EAE3D,MAAM,eADS,KAAK,mBAAmB,MAAM,CACjB,KAAK,MAAM,KAAK;AAC5C,MAAI,iBAAiB,OAEjB,QAD0B,KAAK,cACN,IAAI,KAAK,KAAK;AAE3C,OAAK,oBAAoB,YAAY,WAAW,QAAQ;;CAE5D,yBAAyB;AACrB,OAAK,WAAW,KAAK;AACrB,OAAK,sBAAsB,KAAK;AAEhC,OAAK,uBAAuB;AAC5B,MAAI,KAAK,WAAW,WAAW,KAAK,KAAK,gBAAgB,KAAK,OAAO;GACjE,MAAM,oBAAoB,KAAK,GAAG,EAAE;GACpC,MAAM,SAAS,KAAK,qBAAqB,8BAA8B;IACnE,gBAAgB;IAChB,UAAU,KAAK,qBAAqB;IACvC,CAAC;AACF,QAAK,WAAW,IAAI,2BAA2B,QAAQ,kBAAkB,CAAC;;;CAGlF,gBAAgB,YAAY,KAAK,SAAS;EACtC,IAAI;AACJ,MAAI;GACA,MAAM,OAAO,YAAY,SAAY,QAAQ,OAAO;AACpD,QAAK,aAAa;AAClB,gBAAa,WAAW,MAAM,MAAM,KAAK;AACzC,QAAK,mBAAmB,YAAY,YAAY,UAAa,QAAQ,UAAU,SACzE,QAAQ,QACR,WAAW,SAAS;AAC1B,UAAO;WAEJ,GAAG;AACN,SAAM,KAAK,qBAAqB,GAAG,SAAS,WAAW,SAAS;;;CAGxE,qBAAqB,GAAG,SAAS,UAAU;AACvC,MAAI,uBAAuB,EAAE,IAAI,EAAE,qBAAqB,QAAW;AAC/D,QAAK,mBAAmB,EAAE,kBAAkB,YAAY,UAAa,QAAQ,UAAU,SACjF,QAAQ,QACR,SAAS;AACf,UAAO,EAAE;;AAEb,QAAM;;CAEV,gBAAgB,SAAS,KAAK,SAAS;EACnC,IAAI;AACJ,MAAI;GACA,MAAM,YAAY,KAAK,GAAG,EAAE;AAC5B,OAAI,KAAK,aAAa,WAAW,QAAQ,KAAK,MAAM;AAChD,SAAK,cAAc;AACnB,oBAAgB;SAGhB,MAAK,qBAAqB,SAAS,WAAW,QAAQ;WAGvD,kBAAkB;AACrB,mBAAgB,KAAK,wBAAwB,SAAS,KAAK,iBAAiB;;AAEhF,OAAK,gBAAgB,YAAY,UAAa,QAAQ,UAAU,SAC1D,QAAQ,QACR,QAAQ,MAAM,cAAc;AAClC,SAAO;;CAEX,qBAAqB,SAAS,WAAW,SAAS;EAC9C,IAAI;EACJ,MAAM,gBAAgB,KAAK,GAAG,EAAE;AAChC,MAAI,YAAY,UAAa,QAAQ,QACjC,OAAM,QAAQ;MAGd,OAAM,KAAK,qBAAqB,0BAA0B;GACtD,UAAU;GACV,QAAQ;GACR,UAAU;GACV,UAAU,KAAK,qBAAqB;GACvC,CAAC;AAEN,QAAM,KAAK,WAAW,IAAI,yBAAyB,KAAK,WAAW,cAAc,CAAC;;CAEtF,wBAAwB,SAAS,KAAK,kBAAkB;AAGpD,MAAI,KAAK,mBAEL,iBAAiB,SAAS,8BAC1B,CAAC,KAAK,gBAAgB,EAAE;GACxB,MAAM,UAAU,KAAK,4BAA4B,SAAS,IAAI;AAC9D,OAAI;AACA,WAAO,KAAK,kBAAkB,SAAS,QAAQ;YAE5C,qBAAqB;AACxB,QAAI,oBAAoB,SAAS,2BAG7B,OAAM;QAGN,OAAM;;QAKd,OAAM;;CAGd,iBAAiB;EAEb,MAAM,cAAc,KAAK;EACzB,MAAM,iBAAiBQ,cAAM,KAAK,WAAW;AAC7C,SAAO;GACH,QAAQ;GACR,YAAY,KAAK,kBAAkB;GACnC,YAAY;GACZ,WAAW,KAAK;GACnB;;CAEL,iBAAiB,YAAU;AACvB,OAAK,SAASE,WAAS;AACvB,OAAK,iBAAiBA,WAAS,WAAW;AAC1C,OAAK,aAAaA,WAAS;;CAE/B,0BAA0B,WAAW,UAAU,kBAAkB;AAC7D,OAAK,sBAAsB,KAAK,iBAAiB;AACjD,OAAK,WAAW,KAAK,UAAU;AAE/B,OAAK,yBAAyB,SAAS;;CAE3C,iBAAiB;AACb,SAAO,KAAK,oBAAoB,WAAW;;CAE/C,sBAAsB;EAClB,MAAM,YAAY,KAAK,8BAA8B;AACrD,SAAO,KAAK,oBAAoB;;CAEpC,wBAAwB,WAAW;AAC/B,SAAO,KAAK,oBAAoB;;CAEpC,iBAAiB;AACb,SAAO,KAAK,aAAa,KAAK,GAAG,EAAE,EAAE,IAAI;;CAE7C,QAAQ;AACJ,OAAK,iBAAiB;AACtB,OAAK,aAAa;AAClB,OAAK,sBAAsB,EAAE;AAC7B,OAAK,SAAS,EAAE;AAChB,OAAK,aAAa,EAAE;AAEpB,OAAK,YAAY,EAAE;AACnB,OAAK,wBAAwB,EAAE;;;;;;;;;ACnhBvC,IAAa,eAAb,MAA0B;CACtB,iBAAiB,QAAQ;AACrB,OAAK,UAAU,EAAE;AACjB,OAAK,uBAAuBC,YAAI,QAAQ,uBAAuB,GACzD,OAAO,uBACP,sBAAsB;;CAEhC,WAAW,OAAO;AACd,MAAI,uBAAuB,MAAM,EAAE;AAC/B,SAAM,UAAU;IACZ,WAAW,KAAK,2BAA2B;IAC3C,qBAAqBC,cAAM,KAAK,sBAAsB;IACzD;AACD,QAAK,QAAQ,KAAK,MAAM;AACxB,UAAO;QAGP,OAAM,MAAM,8DAA8D;;CAGlF,IAAI,SAAS;AACT,SAAOA,cAAM,KAAK,QAAQ;;CAE9B,IAAI,OAAO,WAAW;AAClB,OAAK,UAAU;;CAGnB,wBAAwB,YAAY,UAAU,mBAAmB;EAC7D,MAAM,WAAW,KAAK,qBAAqB;EAC3C,MAAM,cAAc,KAAK,oBAAoB,CAAC;EAE9C,MAAM,kBAD+B,iCAAiC,YAAY,aAAa,UAAU,KAAK,aAAa,CACtE;EACrD,MAAM,eAAe,EAAE;AACvB,OAAK,IAAI,IAAI,GAAG,KAAK,KAAK,cAAc,IACpC,cAAa,KAAK,KAAK,GAAG,EAAE,CAAC;EAEjC,MAAM,MAAM,KAAK,qBAAqB,sBAAsB;GACxD,wBAAwB;GACxB,QAAQ;GACR,UAAU,KAAK,GAAG,EAAE;GACpB,uBAAuB;GACb;GACb,CAAC;AACF,QAAM,KAAK,WAAW,IAAI,mBAAmB,KAAK,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;;CAG9E,oBAAoB,YAAY,aAAa;EACzC,MAAM,WAAW,KAAK,qBAAqB;EAC3C,MAAM,cAAc,KAAK,oBAAoB,CAAC;EAE9C,MAAM,+BAA+B,uBAAuB,YAAY,aAAa,KAAK,aAAa;EACvG,MAAM,eAAe,EAAE;AACvB,OAAK,IAAI,IAAI,GAAG,KAAK,KAAK,cAAc,IACpC,cAAa,KAAK,KAAK,GAAG,EAAE,CAAC;EAEjC,MAAM,gBAAgB,KAAK,GAAG,EAAE;EAChC,MAAM,SAAS,KAAK,qBAAqB,wBAAwB;GAC7D,qBAAqB;GACrB,QAAQ;GACR,UAAU;GACV,uBAAuB;GACvB,UAAU,KAAK,qBAAqB;GACvC,CAAC;AACF,QAAM,KAAK,WAAW,IAAI,qBAAqB,QAAQ,KAAK,GAAG,EAAE,EAAE,cAAc,CAAC;;;;;;ACpE1F,IAAa,gBAAb,MAA2B;CACvB,oBAAoB;CACpB,qBAAqB,eAAe,gBAAgB;EAChD,MAAM,gBAAgB,KAAK,qBAAqB;AAChD,MAAIC,oBAAY,cAAc,CAC1B,OAAM,MAAM,UAAU,cAAc,oCAAoC;AAE5E,SAAO,wBAAwB,CAAC,cAAc,EAAE,gBAAgB,KAAK,cAAc,KAAK,aAAa;;CAIzG,0BAA0B,aAAa;EACnC,MAAM,cAAcC,aAAM,YAAY,UAAU;EAEhD,MAAM,gBADkB,KAAK,oBAAoB,CACX;AAEtC,SAD+B,IAAI,qBAAqB,eAAe,YAAY,CAAC,cAAc;;;;;;ACV1G,MAAM,wBAAwB,EAC1B,aAAa,8DAChB;AACD,OAAO,OAAO,sBAAsB;AACpC,MAAM,mBAAmB;AACzB,MAAM,iBAAiB,KAAK,IAAI,GAAG,wBAAwB,GAAG;AAC9D,MAAM,MAAMC,cAAY;CAAE,MAAM;CAAyB,SAAS,MAAM;CAAI,CAAC;AAC7E,kBAAkB,CAAC,IAAI,CAAC;AACxB,MAAM,wBAAwB,oBAAoB,KAAK,+IAKvD,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;AACvB,OAAO,OAAO,sBAAsB;AACpC,MAAM,0BAA0B;CAC5B,MAAM;CAEN,UAAU,EAAE;CACf;;;;AAID,IAAa,eAAb,MAA0B;CACtB,iBAAiB,QAAQ;AACrB,OAAK,qBAAqB,EAAE;AAC5B,OAAK,kBAAkB;;CAE3B,kBAAkB;AACd,OAAK,kBAAkB;AACvB,OAAK,WAAW,0BAA0B;;;;;;;;;;AAUtC,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;IACzB,MAAM,MAAM,IAAI,IAAI,IAAI;AACxB,SAAK,UAAU,SAAS,SAAU,MAAM,MAAM;AAC1C,YAAO,KAAK,sBAAsB,MAAM,GAAG,KAAK;;AAEpD,SAAK,UAAU,SAAS,SAAU,MAAM,MAAM;AAC1C,YAAO,KAAK,sBAAsB,MAAM,GAAG,KAAK;;AAEpD,SAAK,SAAS,SAAS,SAAU,MAAM;AACnC,YAAO,KAAK,qBAAqB,MAAM,EAAE;;AAE7C,SAAK,KAAK,SAAS,SAAU,MAAM;AAC/B,YAAO,KAAK,iBAAiB,MAAM,EAAE;;AAEzC,SAAK,OAAO,SAAS,SAAU,MAAM;AACjC,UAAK,mBAAmB,GAAG,KAAK;;AAEpC,SAAK,WAAW,SAAS,SAAU,MAAM;AACrC,UAAK,2BAA2B,GAAG,KAAK;;AAE5C,SAAK,eAAe,SAAS,SAAU,MAAM;AACzC,UAAK,yBAAyB,GAAG,KAAK;;AAE1C,SAAK,mBAAmB,SAAS,SAAU,MAAM;AAC7C,UAAK,iCAAiC,GAAG,KAAK;;;AAItD,QAAK,aAAa,SAAU,KAAK,MAAM,MAAM;AACzC,WAAO,KAAK,sBAAsB,MAAM,KAAK,KAAK;;AAEtD,QAAK,aAAa,SAAU,KAAK,MAAM,MAAM;AACzC,WAAO,KAAK,sBAAsB,MAAM,KAAK,KAAK;;AAEtD,QAAK,YAAY,SAAU,KAAK,MAAM;AAClC,WAAO,KAAK,qBAAqB,MAAM,IAAI;;AAE/C,QAAK,QAAQ,SAAU,KAAK,MAAM;AAC9B,WAAO,KAAK,iBAAiB,MAAM,IAAI;;AAE3C,QAAK,UAAU,SAAU,KAAK,MAAM;AAChC,SAAK,mBAAmB,KAAK,KAAK;;AAEtC,QAAK,gBAAgB,SAAU,KAAK,MAAM;AACtC,SAAK,yBAAyB,KAAK,KAAK;;AAE5C,QAAK,SAAS,KAAK;AACnB,QAAK,YAAY,KAAK;AACtB,QAAK,KAAK,KAAK;IACjB;;CAEN,mBAAmB;AACf,OAAK,kBAAkB;AAKvB,OAAK,WAAW,oCAAoC;GAChD,MAAM,OAAO;AACb,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;IACzB,MAAM,MAAM,IAAI,IAAI,IAAI;AACxB,WAAO,KAAK,UAAU;AACtB,WAAO,KAAK,UAAU;AACtB,WAAO,KAAK,SAAS;AACrB,WAAO,KAAK,KAAK;AACjB,WAAO,KAAK,OAAO;AACnB,WAAO,KAAK,WAAW;AACvB,WAAO,KAAK,eAAe;AAC3B,WAAO,KAAK,mBAAmB;;AAEnC,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;AACZ,UAAO,KAAK;IACd;;CAKN,cAAc,MAAM;CAIpB,iBAAiB,aAAa,MAAM;AAChC,eAAa;;CAIjB,UAAU,SAAS;AAGf,SAAO;;CAEX,mBAAmB,MAAM,KAAK;AAC1B,MAAI;GACA,MAAM,kBAAkB,IAAI,KAAK;IAAE,YAAY,EAAE;IAAQ;IAAM,CAAC;AAChE,mBAAgB,OAAO;AACvB,QAAK,mBAAmB,KAAK,gBAAgB;AAC7C,OAAI,KAAK,KAAK;AACd,QAAK,mBAAmB,KAAK;AAC7B,UAAO;WAEJ,eAAe;AAClB,OAAI,cAAc,yBAAyB,KACvC,KAAI;AACA,kBAAc,UACV,cAAc,UACV;YAGL,iBAAiB;AAEpB,UAAM;;AAGd,SAAM;;;CAId,qBAAqB,mBAAmB,YAAY;AAChD,SAAO,WAAW,KAAK,MAAM,QAAQ,mBAAmB,WAAW;;CAEvE,yBAAyB,YAAY,mBAAmB;AACpD,aAAW,KAAK,MAAM,qBAAqB,mBAAmB,WAAW;;CAE7E,iCAAiC,YAAY,SAAS;AAClD,aAAW,KAAK,MAAM,kCAAkC,SAAS,YAAY,iBAAiB;;CAElG,mBAAmB,YAAY,mBAAmB;AAC9C,aAAW,KAAK,MAAM,YAAY,mBAAmB,WAAW;;CAEpE,2BAA2B,YAAY,SAAS;AAC5C,aAAW,KAAK,MAAM,yBAAyB,SAAS,YAAY,iBAAiB;;CAEzF,iBAAiB,YAAY,YAAY;AACrC,SAAO,aAAa,KAAK,MAAM,YAAY,WAAW;;CAE1D,sBAAsB,YAAY,YAAY,SAAS;AACnD,yBAAuB,WAAW;AAClC,MAAI,CAAC,cAAcC,YAAI,YAAY,WAAW,KAAK,OAAO;GACtD,MAAM,wBAAQ,IAAI,MAAM,WAAW,aAAa,WAAW,CAAC,sEACN,KAAK,UAAU,WAAW,CAAC,8BAC/C,KAAK,mBAAmB,GAAG,KAAK,GAAG;AACrE,SAAM,uBAAuB;AAC7B,SAAM;;EAEV,MAAM,WAAWC,aAAK,KAAK,mBAAmB;EAC9C,MAAM,WAAW,WAAW;EAC5B,MAAM,kBAAkB,IAAI,YAAY;GACpC,KAAK;GACL,iBAAiB;GACjB,OAAO,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;GAEjE,gBAAgB;GACnB,CAAC;AACF,WAAS,WAAW,KAAK,gBAAgB;AACzC,SAAO,KAAK,YACN,0BACA;;CAEV,sBAAsB,SAAS,YAAY,SAAS;AAChD,yBAAuB,WAAW;AAClC,MAAI,CAAC,oBAAoB,QAAQ,EAAE;GAC/B,MAAM,wBAAQ,IAAI,MAAM,WAAW,aAAa,WAAW,CAAC,kEACV,KAAK,UAAU,QAAQ,CAAC,8BACxC,KAAK,mBAAmB,GAAG,KAAK,GAAG;AACrE,SAAM,uBAAuB;AAC7B,SAAM;;EAEV,MAAM,WAAWA,aAAK,KAAK,mBAAmB;EAC9C,MAAM,kBAAkB,IAAI,SAAS;GACjC,KAAK;GACL,cAAc;GACd,OAAO,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;GACpE,CAAC;AACF,WAAS,WAAW,KAAK,gBAAgB;AACzC,SAAO;;;AAGf,SAAS,WAAW,iBAAiB,aAAa,YAAY,YAAY,OAAO;AAC7E,wBAAuB,WAAW;CAClC,MAAM,WAAWA,aAAK,KAAK,mBAAmB;CAC9C,MAAM,gBAAgBC,mBAAW,YAAY,GAAG,cAAc,YAAY;CAC1E,MAAM,UAAU,IAAI,gBAAgB;EAAE,YAAY,EAAE;EAAE,KAAK;EAAY,CAAC;AACxE,KAAI,UACA,SAAQ,YAAY,YAAY;AAEpC,KAAIF,YAAI,aAAa,gBAAgB,CACjC,SAAQ,eAAe,YAAY;AAEvC,MAAK,mBAAmB,KAAK,QAAQ;AACrC,eAAc,KAAK,KAAK;AACxB,UAAS,WAAW,KAAK,QAAQ;AACjC,MAAK,mBAAmB,KAAK;AAC7B,QAAO;;AAEX,SAAS,aAAa,aAAa,YAAY;AAC3C,wBAAuB,WAAW;CAClC,MAAM,WAAWC,aAAK,KAAK,mBAAmB;CAE9C,MAAM,aAAaE,gBAAQ,YAAY,KAAK;CAC5C,MAAM,OAAO,eAAe,QAAQ,cAAc,YAAY;CAC9D,MAAM,YAAY,IAAI,YAAY;EAC9B,YAAY,EAAE;EACd,KAAK;EACL,mBAAmB,cAAc,YAAY,uBAAuB;EACvE,CAAC;AACF,KAAIH,YAAI,aAAa,gBAAgB,CACjC,WAAU,eAAe,YAAY;AAGzC,WAAU,gBADYI,aAAK,OAAO,YAAYF,mBAAW,QAAQ,KAAK,CAAC;AAEvE,UAAS,WAAW,KAAK,UAAU;AACnC,iBAAQ,OAAO,YAAY;EACvB,MAAM,cAAc,IAAI,YAAY,EAAE,YAAY,EAAE,EAAE,CAAC;AACvD,YAAU,WAAW,KAAK,YAAY;AACtC,MAAIF,YAAI,SAAS,qBAAqB,CAClC,aAAY,oBAAoB,QAAQ;WAGnCA,YAAI,SAAS,OAAO,CACzB,aAAY,oBAAoB;AAEpC,OAAK,mBAAmB,KAAK,YAAY;AACzC,UAAQ,IAAI,KAAK,KAAK;AACtB,OAAK,mBAAmB,KAAK;GAC/B;AACF,QAAO;;AAEX,SAAS,aAAa,KAAK;AACvB,QAAO,QAAQ,IAAI,KAAK,GAAG;;AAE/B,SAAS,uBAAuB,KAAK;AACjC,KAAI,MAAM,KAAK,MAAM,gBAAgB;EACjC,MAAM,wBAAQ,IAAI,MAElB,kCAAkC,IAAI,4DACsB,iBAAiB,IAAI;AACjF,QAAM,uBAAuB;AAC7B,QAAM;;;;;;;;;AC7Rd,IAAa,oBAAb,MAA+B;CAC3B,sBAAsB,QAAQ;AAC1B,MAAIK,YAAI,QAAQ,gBAAgB,EAAE;GAC9B,MAAM,oBAAoB,OAAO;GACjC,MAAM,gBAAgB,OAAO,sBAAsB;AACnD,QAAK,oBAAoB,gBACnB,oBACA;AACN,QAAK,gBAAgB,gBACf,oBAAoB,IACpB;SAEL;AACD,QAAK,oBAAoB;AACzB,QAAK,gBAAgB,sBAAsB;;AAE/C,OAAK,kBAAkB;;CAE3B,WAAW,WAAW,WAAW;AAG7B,MAAI,KAAK,kBAAkB,MAAM;AAC7B,QAAK;GACL,MAAMC,WAAS,IAAI,MAAM,KAAK,kBAAkB,EAAE,CAAC,KAAK,IAAK;AAC7D,OAAI,KAAK,kBAAkB,KAAK,kBAC5B,SAAQ,IAAI,GAAGA,SAAO,OAAO,UAAU,GAAG;GAE9C,MAAM,EAAE,MAAM,UAAU,MAAM,UAAU;;GAExC,MAAM,cAAc,OAAO,KAAK,QAAQ,OAAO,QAAQ;AACvD,OAAI,KAAK,kBAAkB,KAAK,kBAC5B,aAAY,GAAGA,SAAO,OAAO,UAAU,UAAU,KAAK,IAAI;AAE9D,QAAK;AACL,UAAO;QAGP,QAAO,WAAW;;;;;;AC3C9B,SAAgB,YAAY,aAAa,WAAW;AAChD,WAAU,SAAS,aAAa;EAC5B,MAAM,YAAY,SAAS;AAC3B,SAAO,oBAAoB,UAAU,CAAC,SAAS,aAAa;AACxD,OAAI,aAAa,cACb;GAEJ,MAAM,qBAAqB,OAAO,yBAAyB,WAAW,SAAS;AAE/E,OAAI,uBACC,mBAAmB,OAAO,mBAAmB,KAC9C,QAAO,eAAe,YAAY,WAAW,UAAU,mBAAmB;OAG1E,aAAY,UAAU,YAAY,SAAS,UAAU;IAE3D;GACJ;;;;;ACCN,MAAa,cAAc,oBAAoB,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AACrF,OAAO,OAAO,YAAY;AAC1B,MAAa,wBAAwB,OAAO,OAAO;CAC/C,iBAAiB;CACjB,cAAc;CACd,sBAAsB;CACtB,WAAW;CACX,sBAAsB;CACtB,sBAAsB;CACtB,eAAe;CACf,iBAAiB;CACpB,CAAC;AACF,MAAa,sBAAsB,OAAO,OAAO;CAC7C,yBAAyB;CACzB,eAAe;CAClB,CAAC;AACF,IAAW;CACV,SAAU,6BAA2B;AAClC,6BAA0B,4BAA0B,uBAAuB,KAAK;AAChF,6BAA0B,4BAA0B,yBAAyB,KAAK;AAClF,6BAA0B,4BAA0B,2BAA2B,KAAK;AACpF,6BAA0B,4BAA0B,2BAA2B,KAAK;AACpF,6BAA0B,4BAA0B,4BAA4B,KAAK;AACrF,6BAA0B,4BAA0B,oBAAoB,KAAK;AAC7E,6BAA0B,4BAA0B,yBAAyB,KAAK;AAClF,6BAA0B,4BAA0B,oBAAoB,KAAK;AAC7E,6BAA0B,4BAA0B,qCAAqC,KAAK;AAC9F,6BAA0B,4BAA0B,wBAAwB,KAAK;AACjF,6BAA0B,4BAA0B,4BAA4B,MAAM;AACtF,6BAA0B,4BAA0B,2BAA2B,MAAM;AACrF,6BAA0B,4BAA0B,mBAAmB,MAAM;AAC7E,6BAA0B,4BAA0B,iCAAiC,MAAM;GAC5F,8BAA8B,4BAA4B,EAAE,EAAE;AAMjE,IAAa,SAAb,MAAa,OAAO;;;;CAIhB,OAAO,oBAAoB,gBAAgB;AACvC,QAAM,MAAM,6HACsD;;CAEtE,sBAAsB;AAClB,OAAK,WAAW,6BAA6B;GACzC,IAAI;AACJ,QAAK,mBAAmB;GACxB,MAAM,YAAY,KAAK;AACvB,QAAK,WAAW,qBAAqB;AAIjC,qBAAiB,KAAK;KACxB;AACF,QAAK,WAAW,2BAA2B;AACvC,QAAI;AACA,UAAK,iBAAiB;AAEtB,qBAAQ,KAAK,oBAAoB,iBAAiB;MAE9C,MAAM,wBADc,KAAK,cACiB;MAC1C,IAAI;AACJ,WAAK,WAAW,GAAG,aAAa,cAAc;AAC1C,0BAAmB,KAAK,mBAAmB,cAAc,sBAAsB;QACjF;AACF,WAAK,qBAAqB,gBAAgB;OAC5C;cAEE;AACJ,UAAK,kBAAkB;;KAE7B;GACF,IAAI,iBAAiB,EAAE;AACvB,QAAK,WAAW,2BAA2B;AACvC,qBAAiB,eAAe,EAC5B,OAAOC,eAAO,KAAK,qBAAqB,EAC3C,CAAC;AACF,SAAK,mBAAmB,KAAK,iBAAiB,OAAO,eAAe;KACtE;AACF,QAAK,WAAW,6BAA6B;AAGzC,QAAIC,gBAAQ,eAAe,IAAI,KAAK,oBAAoB,OAAO;KAC3D,MAAM,mBAAmB,gBAAgB;MACrC,OAAOD,eAAO,KAAK,qBAAqB;MACxC,YAAYA,eAAO,KAAK,UAAU;MAClC,gBAAgB;MAChB,aAAa;MAChB,CAAC;KACF,MAAM,4BAA4B,kBAAkB;MAChD,mBAAmB,KAAK;MACxB,OAAOA,eAAO,KAAK,qBAAqB;MACxC,YAAYA,eAAO,KAAK,UAAU;MAClC,aAAa;MAChB,CAAC;AACF,UAAK,mBAAmB,KAAK,iBAAiB,OAAO,kBAAkB,0BAA0B;;KAEvG;AAEF,OAAIC,gBAAQ,KAAK,iBAAiB,EAAE;AAEhC,QAAI,KAAK,gBACL,MAAK,WAAW,gCAAgC;AAE5C,UAAK,gBADc,uBAAuBD,eAAO,KAAK,qBAAqB,CAAC;MAE9E;AAEN,SAAK,WAAW,mCAAmC;KAC/C,IAAI,IAAI;AACR,MAAC,MAAM,KAAK,KAAK,mBAAmB,gBAAgB,QAAQ,OAAO,KAAK,KAAa,GAAG,KAAK,IAAI,EAC7F,OAAOA,eAAO,KAAK,qBAAqB,EAC3C,CAAC;AACF,UAAK,6BAA6BA,eAAO,KAAK,qBAAqB,CAAC;MACtE;;AAEN,OAAI,CAAC,OAAO,oCACR,CAACC,gBAAQ,KAAK,iBAAiB,EAAE;AACjC,oBAAgBC,YAAI,KAAK,mBAAmB,aAAa,SAAS,QAAQ;AAC1E,UAAM,IAAI,MAAM,wCAAwC,cAAc,KAAK,sCAAsC,GAAG;;IAE1H;;CAEN,YAAY,iBAAiB,QAAQ;AACjC,OAAK,mBAAmB,EAAE;AAC1B,OAAK,mBAAmB;EACxB,MAAM,OAAO;AACb,OAAK,iBAAiB,OAAO;AAC7B,OAAK,kBAAkB;AACvB,OAAK,eAAe,OAAO;AAC3B,OAAK,qBAAqB,iBAAiB,OAAO;AAClD,OAAK,gBAAgB,OAAO;AAC5B,OAAK,gBAAgB,OAAO;AAC5B,OAAK,mBAAmB;AACxB,OAAK,iBAAiB,OAAO;AAC7B,OAAK,sBAAsB,OAAO;AAClC,MAAIC,YAAI,QAAQ,gBAAgB,CAC5B,OAAM,IAAI,MAAM,mQAGW;AAE/B,OAAK,kBAAkBA,YAAI,QAAQ,kBAAkB,GAC/C,OAAO,kBACP,sBAAsB;;;AASpC,OAAO,mCAAmC;AAC1C,YAAY,QAAQ;CAChB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH,CAAC;AACF,IAAa,YAAb,cAA+B,OAAO;CAClC,YAAY,iBAAiB,SAAS,uBAAuB;EACzD,MAAM,cAAcC,cAAM,OAAO;AACjC,cAAY,YAAY;AACxB,QAAM,iBAAiB,YAAY;;;;;;;;CC7L3C,IAAI,aAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU;AAEpF,QAAO,UAAU;;;;;;CCHjB,IAAI;;CAGJ,IAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;;CAG5E,IAAI,OAAO,cAAc,YAAY,SAAS,cAAc,EAAE;AAE9D,QAAO,UAAU;;;;;;;CCLjB,IAAI,yBAAc;AAElB,QAAO,UAAU;;;;;;;;;;;;;;;CCIjB,SAAS,SAAS,OAAO,UAAU;EACjC,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,SAAS,MAAM,OAAO;AAE1B,SAAO,EAAE,QAAQ,OACf,QAAO,SAAS,SAAS,MAAM,QAAQ,OAAO,MAAM;AAEtD,SAAO;;AAGT,QAAO,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CCGjB,IAAI,UAAU,MAAM;AAEpB,QAAO,UAAU;;;;;;CCzBjB,IAAI;;CAGJ,IAAI,cAAc,OAAO;;CAGzB,IAAI,iBAAiB,YAAY;;;;;;CAOjC,IAAI,uBAAuB,YAAY;;CAGvC,IAAI,iBAAiB,SAAS,OAAO,cAAc;;;;;;;;CASnD,SAAS,UAAU,OAAO;EACxB,IAAI,QAAQ,eAAe,KAAK,OAAO,eAAe,EAClD,MAAM,MAAM;AAEhB,MAAI;AACF,SAAM,kBAAkB;GACxB,IAAI,WAAW;WACR,GAAG;EAEZ,IAAI,SAAS,qBAAqB,KAAK,MAAM;AAC7C,MAAI,SACF,KAAI,MACF,OAAM,kBAAkB;MAExB,QAAO,MAAM;AAGjB,SAAO;;AAGT,QAAO,UAAU;;;;;;;;;;;CCrCjB,IAAI,uBAPc,OAAO,UAOc;;;;;;;;CASvC,SAAS,eAAe,OAAO;AAC7B,SAAO,qBAAqB,KAAK,MAAM;;AAGzC,QAAO,UAAU;;;;;;CCrBjB,IAAI,4BACA,kCACA;;CAGJ,IAAI,UAAU,iBACV,eAAe;;CAGnB,IAAI,iBAAiB,SAAS,OAAO,cAAc;;;;;;;;CASnD,SAAS,WAAW,OAAO;AACzB,MAAI,SAAS,KACX,QAAO,UAAU,SAAY,eAAe;AAE9C,SAAQ,kBAAkB,kBAAkB,OAAO,MAAM,GACrD,UAAU,MAAM,GAChB,eAAe,MAAM;;AAG3B,QAAO,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CCHjB,SAAS,aAAa,OAAO;AAC3B,SAAO,SAAS,QAAQ,OAAO,SAAS;;AAG1C,QAAO,UAAU;;;;;;CC5BjB,IAAI,oCACA;;CAGJ,IAAI,YAAY;;;;;;;;;;;;;;;;;;CAmBhB,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACpB,aAAa,MAAM,IAAI,WAAW,MAAM,IAAI;;AAGjD,QAAO,UAAU;;;;;;CC5BjB,IAAI,4BACA,gCACA,6BACA;;CAGJ,IAAI,WAAW;;CAGf,IAAI,cAAc,SAAS,OAAO,YAAY,QAC1C,iBAAiB,cAAc,YAAY,WAAW;;;;;;;;;CAU1D,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,SAClB,QAAO;AAET,MAAI,QAAQ,MAAM,CAEhB,QAAO,SAAS,OAAO,aAAa,GAAG;AAEzC,MAAI,SAAS,MAAM,CACjB,QAAO,iBAAiB,eAAe,KAAK,MAAM,GAAG;EAEvD,IAAI,SAAU,QAAQ;AACtB,SAAQ,UAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAO;;AAG9D,QAAO,UAAU;;;;;;CCpCjB,IAAI;;;;;;;;;;;;;;;;;;;;;;CAuBJ,SAAS,SAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,aAAa,MAAM;;AAGjD,QAAO,UAAU;;;;;;;;;;;;;;;CClBjB,SAAS,UAAU,OAAO,OAAO,KAAK;EACpC,IAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,MAAI,QAAQ,EACV,SAAQ,CAAC,QAAQ,SAAS,IAAK,SAAS;AAE1C,QAAM,MAAM,SAAS,SAAS;AAC9B,MAAI,MAAM,EACR,QAAO;AAET,WAAS,QAAQ,MAAM,IAAM,MAAM,UAAW;AAC9C,aAAW;EAEX,IAAI,SAAS,MAAM,OAAO;AAC1B,SAAO,EAAE,QAAQ,OACf,QAAO,SAAS,MAAM,QAAQ;AAEhC,SAAO;;AAGT,QAAO,UAAU;;;;;;CC9BjB,IAAI;;;;;;;;;;CAWJ,SAAS,UAAU,OAAO,OAAO,KAAK;EACpC,IAAI,SAAS,MAAM;AACnB,QAAM,QAAQ,SAAY,SAAS;AACnC,SAAQ,CAAC,SAAS,OAAO,SAAU,QAAQ,UAAU,OAAO,OAAO,IAAI;;AAGzE,QAAO,UAAU;;;;;;;CCLjB,IAAI,eAAe,OAAO,sFAA+D;;;;;;;;CASzF,SAAS,WAAW,QAAQ;AAC1B,SAAO,aAAa,KAAK,OAAO;;AAGlC,QAAO,UAAU;;;;;;;;;;;;;CClBjB,SAAS,aAAa,QAAQ;AAC5B,SAAO,OAAO,MAAM,GAAG;;AAGzB,QAAO,UAAU;;;;;;;CCVjB,IAAI,gBAAgB,mBAIhB,eAAe,iDACf,aAAa;;CAGjB,IAAI,WAAW,MAAM,gBAAgB,KACjC,UAAU,MAAM,eAAe,KAC/B,SAAS,4BACT,aAAa,QAAQ,UAAU,MAAM,SAAS,KAC9C,cAAc,OAAO,gBAAgB,KACrC,aAAa,mCACb,aAAa,sCACb,QAAQ;;CAGZ,IAAI,WAAW,aAAa,KACxB,WAAW,MAAM,aAAa,MAC9B,YAAY,QAAQ,QAAQ,QAAQ;EAAC;EAAa;EAAY;EAAW,CAAC,KAAK,IAAI,GAAG,MAAM,WAAW,WAAW,MAClH,QAAQ,WAAW,WAAW,WAC9B,WAAW,QAAQ;EAAC,cAAc,UAAU;EAAK;EAAS;EAAY;EAAY;EAAS,CAAC,KAAK,IAAI,GAAG;;CAG5G,IAAI,YAAY,OAAO,SAAS,QAAQ,SAAS,OAAO,WAAW,OAAO,IAAI;;;;;;;;CAS9E,SAAS,eAAe,QAAQ;AAC9B,SAAO,OAAO,MAAM,UAAU,IAAI,EAAE;;AAGtC,QAAO,UAAU;;;;;;CCvCjB,IAAI,wCACA,oCACA;;;;;;;;CASJ,SAAS,cAAc,QAAQ;AAC7B,SAAO,WAAW,OAAO,GACrB,eAAe,OAAO,GACtB,aAAa,OAAO;;AAG1B,QAAO,UAAU;;;;;;CCjBjB,IAAI,kCACA,oCACA,0CACA;;;;;;;;CASJ,SAAS,gBAAgB,YAAY;AACnC,SAAO,SAAS,QAAQ;AACtB,YAAS,SAAS,OAAO;GAEzB,IAAI,aAAa,WAAW,OAAO,GAC/B,cAAc,OAAO,GACrB;GAEJ,IAAI,MAAM,aACN,WAAW,KACX,OAAO,OAAO,EAAE;GAEpB,IAAI,WAAW,aACX,UAAU,YAAY,EAAE,CAAC,KAAK,GAAG,GACjC,OAAO,MAAM,EAAE;AAEnB,UAAO,IAAI,aAAa,GAAG;;;AAI/B,QAAO,UAAU;;;;;;;;;;;;;;;;;;;;;;;CCbjB,IAAI,wCAA6B,cAAc;AAE/C,QAAO,UAAU;;;;;;CCrBjB,IAAI,+BACA;;;;;;;;;;;;;;;;CAiBJ,SAAS,WAAW,QAAQ;AAC1B,SAAO,WAAW,SAAS,OAAO,CAAC,aAAa,CAAC;;AAGnD,QAAO,UAAU;;;;;;;;;;;;;;;;;;CCVjB,SAAS,YAAY,OAAO,UAAU,aAAa,WAAW;EAC5D,IAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,MAAI,aAAa,OACf,eAAc,MAAM,EAAE;AAExB,SAAO,EAAE,QAAQ,OACf,eAAc,SAAS,aAAa,MAAM,QAAQ,OAAO,MAAM;AAEjE,SAAO;;AAGT,QAAO,UAAU;;;;;;;;;;;;;CClBjB,SAAS,eAAe,QAAQ;AAC9B,SAAO,SAAS,KAAK;AACnB,UAAO,UAAU,OAAO,SAAY,OAAO;;;AAI/C,QAAO,UAAU;;;;;;;;;;;;;;CCuDjB,IAAI,yCAjEkB;EAEpB,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EACnC,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAER,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACtF,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACtF,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAC3B,CAUiD;AAElD,QAAO,UAAU;;;;;;CCtEjB,IAAI,wCACA;;CAGJ,IAAI,UAAU;;;;;CAed,IAAI,cAAc,OANJ,mDAMoB,IAAI;;;;;;;;;;;;;;;;;;;CAoBtC,SAAS,OAAO,QAAQ;AACtB,WAAS,SAAS,OAAO;AACzB,SAAO,UAAU,OAAO,QAAQ,SAAS,aAAa,CAAC,QAAQ,aAAa,GAAG;;AAGjF,QAAO,UAAU;;;;;;;CC3CjB,IAAI,cAAc;;;;;;;;CASlB,SAAS,WAAW,QAAQ;AAC1B,SAAO,OAAO,MAAM,YAAY,IAAI,EAAE;;AAGxC,QAAO,UAAU;;;;;;;CCbjB,IAAI,mBAAmB;;;;;;;;CASvB,SAAS,eAAe,QAAQ;AAC9B,SAAO,iBAAiB,KAAK,OAAO;;AAGtC,QAAO,UAAU;;;;;;;CCbjB,IAAI,gBAAgB,mBAIhB,eAAe,iDACf,iBAAiB,mBACjB,eAAe,6BACf,gBAAgB,wBAChB,iBAAiB,gDACjB,qBAAqB,mBACrB,eAAe,gKACf,eAAe,6BACf,aAAa,kBACb,eAAe,gBAAgB,iBAAiB,qBAAqB;;CAGzE,IAAI,SAAS,QACT,UAAU,MAAM,eAAe,KAC/B,UAAU,MAAM,eAAe,KAC/B,WAAW,QACX,YAAY,MAAM,iBAAiB,KACnC,UAAU,MAAM,eAAe,KAC/B,SAAS,OAAO,gBAAgB,eAAe,WAAW,iBAAiB,eAAe,eAAe,KAEzG,aAAa,QAAQ,wCACrB,cAAc,OAAO,gBAAgB,KACrC,aAAa,mCACb,aAAa,sCACb,UAAU,MAAM,eAAe,KAC/B,QAAQ;;CAGZ,IAAI,cAAc,QAAQ,UAAU,MAAM,SAAS,KAC/C,cAAc,QAAQ,UAAU,MAAM,SAAS,KAC/C,kBAAkB,QAAQ,SAAS,0BACnC,kBAAkB,QAAQ,SAAS,0BACnC,WAAW,aAAa,KACxB,WAAW,MAAM,aAAa,MAC9B,YAAY,QAAQ,QAAQ,QAAQ;EAAC;EAAa;EAAY;EAAW,CAAC,KAAK,IAAI,GAAG,MAAM,WAAW,WAAW,MAClH,aAAa,oDACb,aAAa,oDACb,QAAQ,WAAW,WAAW,WAC9B,UAAU,QAAQ;EAAC;EAAW;EAAY;EAAW,CAAC,KAAK,IAAI,GAAG,MAAM;;CAG5E,IAAI,gBAAgB,OAAO;EACzB,UAAU,MAAM,UAAU,MAAM,kBAAkB,QAAQ;GAAC;GAAS;GAAS;GAAI,CAAC,KAAK,IAAI,GAAG;EAC9F,cAAc,MAAM,kBAAkB,QAAQ;GAAC;GAAS,UAAU;GAAa;GAAI,CAAC,KAAK,IAAI,GAAG;EAChG,UAAU,MAAM,cAAc,MAAM;EACpC,UAAU,MAAM;EAChB;EACA;EACA;EACA;EACD,CAAC,KAAK,IAAI,EAAE,IAAI;;;;;;;;CASjB,SAAS,aAAa,QAAQ;AAC5B,SAAO,OAAO,MAAM,cAAc,IAAI,EAAE;;AAG1C,QAAO,UAAU;;;;;;CCpEjB,IAAI,oCACA,4CACA,+BACA;;;;;;;;;;;;;;;;;;;;CAqBJ,SAAS,MAAM,QAAQ,SAAS,OAAO;AACrC,WAAS,SAAS,OAAO;AACzB,YAAU,QAAQ,SAAY;AAE9B,MAAI,YAAY,OACd,QAAO,eAAe,OAAO,GAAG,aAAa,OAAO,GAAG,WAAW,OAAO;AAE3E,SAAO,OAAO,MAAM,QAAQ,IAAI,EAAE;;AAGpC,QAAO,UAAU;;;;;;CClCjB,IAAI,sCACA,2BACA;;CAMJ,IAAI,SAAS,OAHA,QAGe,IAAI;;;;;;;;CAShC,SAAS,iBAAiB,UAAU;AAClC,SAAO,SAAS,QAAQ;AACtB,UAAO,YAAY,MAAM,OAAO,OAAO,CAAC,QAAQ,QAAQ,GAAG,CAAC,EAAE,UAAU,GAAG;;;AAI/E,QAAO,UAAU;;;;;;CCvBjB,IAAI;;;;;;;;;;;;;;;;;;;;;CAuBJ,IAAI,wCAA6B,SAAS,QAAQ,MAAM,OAAO;AAC7D,SAAO,KAAK,aAAa;AACzB,SAAO,UAAU,QAAQ,WAAW,KAAK,GAAG;GAC5C;AAEF,QAAO,UAAU;;;;;;AClBjB;AACE;;;;AAIE;;;AAKJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAktBA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8OA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAYA;;;;;;;;;;;AACA;AAEI;AACA;;;;;ACh+BJ,MAAM,YAAY,EAAE;AAEpB,SAAS,gBAAgB,KAAK;CAC5B,IAAI,aAAa;AACjB,QAAO,KAAK,UAAU,CAAC,SAAQ,qBAAoB;EACjD,MAAM,kBAAkB,UAAU;EAClC,MAAM,iBAAiB,IAAI,OAAO,KAAK,iBAAiB,KAAK,IAAI;AACjE,eAAa,WAAW,QAAQ,gBAAgB,gBAAgB;GAChE;AACF,QAAO;;AAGT,SAAS,SAAS,MAAM,KAAK;AAC3B,WAAU,QAAQ,gBAAgB,IAAI;;AAGxC,SAAS,aAAa,KAAK,OAAO;CAChC,MAAM,aAAa,gBAAgB,IAAI;AACvC,QAAO,IAAI,OAAO,YAAY,MAAM;;AAItC,SAAS,UAAU,uBAAuB;AAC1C,SAAS,gBAAgB,sBAAsB;AAC/C,SAAS,YAAY,cAAc;AACnC,SAAS,aAAa,iDAAiD;AACvE,SAAS,mBAAmB,SAAS;AACrC,SAAS,kBAAkB,0BAA0B;AACrD,SAAS,iBAAiB,MAAM;AAChC,SAAS,iBAAiB,uCAAuC;AACjE,SAAS,qBAAqB,sCAAsC;AACpE,SAAS,yBAAyB,4CAA4C;AAC9E,SAAS,cAAc,QAAQ;AAC/B,SAAS,eAAe,QAAQ;AAChC,SACE,eACA,yDACD;AACD,SAAS,kBAAkB,sCAAsC;AAEjE,SACE,mBACA,6DACD;AACD,SACE,sBACA,iFACD;AAED,SAAS,oBAAoB,MAAM,aAAa;CAC9C,IAAI,YAAY;CAChB,IAAI,WAAW,KAAK,YAAY,UAAU;AAI1C,SAAyB,IAAI,SAAS,EAAE;AACtC;AAGA,MAAI,WAAW,MACb;AAEF,aAAW,KAAK,YAAY,UAAU;;AAKxC,YAA2B,IAAI,SAAS,EAAE;AACxC;AAEA,MAAI,WAAW,MACb;AAEF,aAAW,KAAK,YAAY,UAAU;;AAIxC,KAAI,cAAc,YAChB,QAAO;AAIT,QAAO,CAFe,KAAK,UAAU,aAAa,UAAU,CAEtC;;AAGxB,MAAM,aAAaC,cAAe;CAChC,MAAM;CACN,SAAS,EAAE,MAAM,qBAAqB;CACtC,aAAa;CACb,kBAAkB,MAAM,KAAKC,MAAsB,MACjD,OAAO,aAAa,EAAE,CACvB;CACF,CAAC;AAEF,MAAM,YAAY;CAChB,OAAO;EACL,QAAQ,EAAE;EACV,gBAAgB,EAAE;EAClB,mBAAmB,EAAE;EACtB;CACD,aAAa;CACd;AACD,MAAM,WAAW,OAAO,KAAK,UAAU,MAAM;AAC7C,MAAM,kBAAkB,EAAE;AAE1B,SAAS,YAAY,SAAS,QAAQ,UAAU;AAE9C,KAAI,CAAC,QAAQ,OAEX;MAAI,OAAO,QAAQ,YAAY,SAC7B,SAAQ,QAAQ,IAAI,QAAQ,QAAQ;WAG7B,QAAQ,mBAAmB,OAClC,SAAQ,QAAQ,IAAI,QAAQ,KAAK;;CAIrC,MAAM,eAAeD,cAAe,QAAQ;AAC5C,OAAM,SAAQ,SAAQ,UAAU,MAAM,MAAM,KAAK,aAAa,CAAC;AAC/D,iBAAgB,QAAQ,QAAQ;AAChC,QAAO;;AAGT,SAAS,uBAAuB,SAAS;AAGvC,SAAQ,aAAa;AACrB,QAAO,YAAY,QAAQ;;AAM7B,MAAM,oBAAoB,YAAY;CACpC,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAIF,MAAM,UAAU,YAAY;CAC1B,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAEF,MAAM,qBAAqB,YAAY;CACrC,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAEF,MAAM,iBAAiB,YAAY;CACjC,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAEF,MAAM,sBAAsB,YAAY;CACtC,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AACF,MAAM,kCAAkC,YAAY;CAClD,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAEF,MAAM,sBAAsB,YAAY;CACtC,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAGF,MAAM,aAAa,YAAY;CAC7B,MAAM;CACN,SAAS,MAAM;CAChB,CAAC;AAKF,YAAY;CACV,MAAM;CACN,SAAS,aAAa,uCAAuC;CAC7D,OAAO,MAAM;CACd,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,OAAO;CACR,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,OAAO;CACR,CAAC;AACF,YAAY;CAAE,MAAM;CAAiB,SAAS;CAA+B,CAAC;AAC9E,YAAY;CACV,MAAM;CACN,SAAS,aACP,+NAID;CACF,CAAC;AACF,YAAY;CAAE,MAAM;CAAgB,SAAS;CAAgC,CAAC;AAC9E,YAAY;CACV,MAAM;CACN,SAAS,aACP,sFACD;CACF,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACV,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS,aAAa,6CAA6C;CACpE,CAAC;AAEF,YAAY;CACV,MAAM;CAEN,SAAS,aACP,sEACD;CACF,CAAC;AAEF,YAAY;CACV,MAAM;CACN,SAAS,aACP,2EACD;CACF,CAAC;AAEF,YAAY;CACV,MAAM;CACN,SAAS,aAAa,0DAAuD;CAC7E,WAAW;CACZ,CAAC;AAEF,YACE;CACE,MAAM;CACN,SAAS,aAAa,oCAAiC;CACvD,UAAU;CACX,EACD,CAAC,oBAAoB,CACtB;AAED,YAAY;CACV,MAAM;CACN,SAAS,aAAa,4BAA0B;CACjD,CAAC;AAEF,YAAY;CACV,MAAM;CACN,SAAS,aAAa,iCAAgC;CACtD,WAAW;CACZ,CAAC;AAEF,YACE;CACE,MAAM;CACN,SAAS,aAAa,6BAA4B;CAClD,UAAU;CACX,EACD,CAAC,iBAAiB,CACnB;AAED,YACE;CACE,MAAM;CACN,SAAS,aAAa,kCAAkC;CACzD,EACD,CAAC,iBAAiB,CACnB;AAED,YACE;CACE,MAAM;CACN,SAAS,aAAa,qCAAqC;CAC5D,EACD,CAAC,oBAAoB,CACtB;AAuBD,eAnB2B;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAIiC,CAAC,SAAQ,SAAQ;AACjD,wBAAuB;EACrB,MAAM,KAAK,GAAG,aAAa,iCAAa,KAAK,OAAO,EAAE,CAAC;EACvD,SAAS;EAGT,YAAY,CAAC,YAAY,kBAAkB;EAC5C,CAAC;EACF;AAyDF,eAtDiB;CACf;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,CAAC,KAAK,aAAa;CACpB,CAEuB,CAAC,SAAQ,SAAQ;CAEvC,MAAM,SAAS,MAAM,QAAQ,KAAK;CAClC,MAAM,aAAa,SAAS,KAAK,KAAK;CACtC,MAAM,gBAAgB,SAAS,KAAK,KAAK;CAEzC,MAAM,UAAU;EACd,MAAM,WAAW,GAAG,aAAa,GAAG,WAAW,OAAO,EAAE;EACxD,SAAS;EACT,YAAY;EACb;AAED,KAAI,OACF,SAAQ,QAAQ,IAAI,WAAW;AAEjC,wBAAuB,QAAQ;EAC/B;AAEF,uBAAuB;CACrB,MAAM;CACN,SAAS;CACT,YAAY,CAAC,SAAS,eAAe;CACtC,CAAC;AAEF,uBAAuB;CACrB,MAAM;CACN,SAAS;CAGT,YAAY;CACb,CAAC;AACF,uBAAuB;CACrB,MAAM;CACN,SAAS;CAGT,YAAY;CACb,CAAC;AACF,uBAAuB;CACrB,MAAM;CACN,SAAS;CAGT,YAAY;CACb,CAAC;AACF,uBAAuB;CAAE,MAAM;CAAQ,SAAS;CAAQ,CAAC;AACzD,uBAAuB;CAAE,MAAM;CAAS,SAAS;CAAS,CAAC;AAC3D,uBAAuB;CAAE,MAAM;CAAQ,SAAS;CAAQ,CAAC;AAGzD,YAAY;CAAE,MAAM;CAAM,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AACnE,YAAY;CAAE,MAAM;CAAS,SAAS;CAAM,CAAC;AAC7C,YAAY;CAAE,MAAM;CAAa,SAAS;CAAO,YAAY,CAAC,WAAW;CAAE,CAAC;AAC5E,YAAY;CAAE,MAAM;CAAO,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AACpE,YAAY;CAAE,MAAM;CAAS,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AACtE,YAAY;CAAE,MAAM;CAAa,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AAC1E,YAAY;CAAE,MAAM;CAAc,SAAS;CAAM,YAAY,CAAC,WAAW;CAAE,CAAC;AAC5E,YAAY;CAAE,MAAM;CAAS,SAAS;CAAK,CAAC;AAC5C,YAAY;CAAE,MAAM;CAAgB,SAAS;CAAK,CAAC;AACnD,YAAY;CAAE,MAAM;CAAU,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AACvE,YAAY;CAAE,MAAM;CAAU,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AACvE,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,WAAW;CACxB,WAAW,UAAU;CACtB,CAAC;AACF,YACE;CAAE,MAAM;CAAU,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,UAAU;CAAM,EAC1E,CAAC,UAAU,YAAY,CACxB;AACD,YAAY;CAAE,MAAM;CAAW,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AACxE,YAAY;CAAE,MAAM;CAAW,SAAS;CAAK,YAAY,CAAC,WAAW;CAAE,CAAC;AAIxE,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY;EACV;EACA;EACA;EACD;CACF,CAAC;AAEF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY;EACV;EACA;EACA;EACD;CACF,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,qBAAqB,gCAAgC;CACnE,CAAC;AAEF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,eAAe;CAC7B,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAQ,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AACzE,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,eAAe;CAC7B,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAW,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AAC5E,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,eAAe;CAC7B,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,gBAAgB,mBAAmB;CACjD,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,gBAAgB,oBAAoB;CAClD,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,gBAAgB,oBAAoB;CAClD,CAAC;AACF,YAAY;CAAE,MAAM;CAAU,SAAS;CAAM,YAAY,CAAC,eAAe;CAAE,CAAC;AAC5E,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAO,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AACxE,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAO,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AACxE,YAAY;CAAE,MAAM;CAAa,SAAS;CAAM,YAAY,CAAC,eAAe;CAAE,CAAC;AAC/E,YAAY;CAAE,MAAM;CAAQ,SAAS;CAAM,YAAY,CAAC,eAAe;CAAE,CAAC;AAC1E,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAM,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AACvE,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAQ,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AACzE,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAU,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AAC3E,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,mBAAmB;CACjC,CAAC;AACF,YAAY;CAAE,MAAM;CAAU,SAAS;CAAK,YAAY,CAAC,eAAe;CAAE,CAAC;AAG3E,YAAY;CACV,MAAM;CACN,SAAS;CACT,YAAY,CAAC,qBAAqB,gCAAgC;CACnE,CAAC;AAIF,SAAS,SAAQ,SAAQ,UAAU,MAAM,MAAM,KAAK,WAAW,CAAC;AAChE,gBAAgB,gBAAgB;AAEhC,SAAS,eAAe,KAAK;AAE3B,QAAO,IAAI,MAAM,GAAG,MAAM;AACxB,SAAO,EAAE,SAAS,EAAE;GACpB;;;;;;;;;;;;;ACvkBJ,SAAgB,qBAAqB;AACnC,SACG,OAAO,YAAY,eAClB,QAAQ,OACR,QAAQ,IAAI,sCAAsC,eAAe;;;;;ACRvE,oBAAe,IAAI,MAAM,WAAW;CAClC,qBAAqB;CACrB,iBAAiB,oBAAoB;CACtC,CAAC;;;;;;;;;ACCF,SAAgB,YAAY,MAAM,MAAM,YAAY;AAChD,QAAO,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG;;AAGnC,MAAa,YAAY;AACzB,MAAa,iBAAiB;AAC9B,MAAa,uBAAuB;AACpC,MAAa,uBAAuB;AAGpC,MAAa,gBAAgB;AAC7B,MAAa,gBAAgB;AAC7B,MAAa,qBAAqB;AAClC,MAAa,sBAAsB;AACnC,MAAa,qBAAqB;AAClC,MAAa,eAAe;AAC5B,IAAa,qBAAb,MAAgC;CAC5B,YAAY,QAAQ;AAChB,OAAK,SAAS;;CAElB,YAAY;AACR,SAAO;;;AAGf,IAAa,iBAAb,cAAoC,mBAAmB;CACnD,YAAY,QAAQ,WAAW;AAC3B,QAAM,OAAO;AACb,OAAK,YAAY;;;AAGzB,IAAa,oBAAb,cAAuC,mBAAmB;CACtD,YAAY,QAAQ;AAChB,QAAM,OAAO;;CAEjB,YAAY;AACR,SAAO;;;AAGf,IAAa,iBAAb,cAAoC,mBAAmB;CACnD,YAAY,WAAW,MAAM,aAAa;AACtC,QAAM,UAAU;AAChB,OAAK,OAAO;AACZ,OAAK,cAAc;;CAEvB,YAAY;AACR,SAAO;;;AAGf,SAAgB,UAAU,OAAO;CAC7B,MAAM,MAAM;EACR,aAAa,EAAE;EACf,gBAAgB,EAAE;EAClB,kCAAkB,IAAI,KAAK;EAC3B,iCAAiB,IAAI,KAAK;EAC1B,QAAQ,EAAE;EACb;AACD,iCAAgC,KAAK,MAAM;CAC3C,MAAM,aAAa,MAAM;AACzB,MAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACjC,MAAM,OAAO,MAAM;EACnB,MAAM,YAAY,MAAM,KAAK,MAAM,KAAK;AACxC,MAAI,cAAc,OACd;AAEJ,kBAAgB,KAAK,MAAM,UAAU;;AAEzC,QAAO;;AAEX,SAAS,gCAAgC,KAAK,OAAO;CACjD,MAAM,aAAa,MAAM;AACzB,MAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACjC,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,SAAS,KAAK,MAAM,QAAW,EACzC,MAAM,gBACT,CAAC;EACF,MAAM,OAAO,SAAS,KAAK,MAAM,QAAW,EACxC,MAAM,eACT,CAAC;AACF,QAAM,OAAO;AACb,MAAI,iBAAiB,IAAI,MAAM,MAAM;AACrC,MAAI,gBAAgB,IAAI,MAAM,KAAK;;;AAG3C,SAAS,KAAK,KAAK,MAAM,YAAY;AACjC,KAAI,sBAAsB,SACtB,QAAO,SAAS,KAAK,MAAM,WAAW,cAAc,WAAW;UAE1D,sBAAsB,YAC3B,QAAO,QAAQ,KAAK,MAAM,WAAW;UAEhC,sBAAsB,YAC3B,QAAO,YAAY,KAAK,MAAM,WAAW;UAEpC,sBAAsB,OAC3B,QAAO,OAAO,KAAK,MAAM,WAAW;UAE/B,sBAAsB,WAC3B,QAAO,WAAW,KAAK,MAAM,WAAW;UAEnC,sBAAsB,wBAC3B,QAAO,cAAc,KAAK,MAAM,WAAW;UAEtC,sBAAsB,oBAC3B,QAAO,oBAAoB,KAAK,MAAM,WAAW;UAE5C,sBAAsB,iCAC3B,QAAO,uBAAuB,KAAK,MAAM,WAAW;KAGpD,QAAO,MAAM,KAAK,MAAM,WAAW;;AAG3C,SAAS,WAAW,KAAK,MAAM,cAAY;CACvC,MAAM,YAAY,SAAS,KAAK,MAAME,cAAY,EAC9C,MAAM,sBACT,CAAC;AACF,qBAAoB,KAAK,UAAU;AAEnC,QAAO,KAAK,KAAK,MAAMA,cADR,SAAS,KAAK,MAAM,WAAWA,cAAY,MAAM,KAAK,MAAMA,aAAW,CAAC,CAC7C;;AAE9C,SAAS,cAAc,KAAK,MAAM,cAAY;CAC1C,MAAM,YAAY,SAAS,KAAK,MAAMA,cAAY,EAC9C,MAAM,sBACT,CAAC;AACF,qBAAoB,KAAK,UAAU;AAGnC,QAAO,KAAK,KAAK,MAAMA,cAFR,SAAS,KAAK,MAAM,WAAWA,cAAY,MAAM,KAAK,MAAMA,aAAW,CAAC,EAC3E,SAAS,KAAK,MAAMA,aAAW,WAAWA,aAAW,CAClB;;AAEnD,SAAS,oBAAoB,KAAK,MAAM,cAAY;CAChD,MAAM,YAAY,SAAS,KAAK,MAAMA,cAAY,EAC9C,MAAM,sBACT,CAAC;AACF,qBAAoB,KAAK,UAAU;AAEnC,QAAO,KAAK,KAAK,MAAMA,cADR,SAAS,KAAK,MAAM,WAAWA,cAAY,MAAM,KAAK,MAAMA,aAAW,CAAC,CAC7C;;AAE9C,SAAS,uBAAuB,KAAK,MAAM,cAAY;CACnD,MAAM,YAAY,SAAS,KAAK,MAAMA,cAAY,EAC9C,MAAM,sBACT,CAAC;AACF,qBAAoB,KAAK,UAAU;AAGnC,QAAO,KAAK,KAAK,MAAMA,cAFR,SAAS,KAAK,MAAM,WAAWA,cAAY,MAAM,KAAK,MAAMA,aAAW,CAAC,EAC3E,SAAS,KAAK,MAAMA,aAAW,WAAWA,aAAW,CAClB;;AAEnD,SAAS,YAAY,KAAK,MAAM,eAAa;CACzC,MAAM,QAAQ,SAAS,KAAK,MAAMC,eAAa,EAC3C,MAAM,WACT,CAAC;AACF,qBAAoB,KAAK,MAAM;AAG/B,QADe,SAAS,KAAK,MAAM,OAAOA,eAAa,GAD1CC,YAAID,cAAY,aAAa,MAAM,KAAK,KAAK,MAAM,EAAE,CAAC,CACJ;;AAGnE,SAAS,OAAO,KAAK,MAAM,UAAQ;CAC/B,MAAM,QAAQ,SAAS,KAAK,MAAME,UAAQ,EACtC,MAAM,WACT,CAAC;AACF,qBAAoB,KAAK,MAAM;AAE/B,QAAO,SAAS,KAAK,MAAMA,UADZ,SAAS,KAAK,MAAM,OAAOA,UAAQ,MAAM,KAAK,MAAMA,SAAO,CAAC,CACjC;;AAE9C,SAAS,MAAM,KAAK,MAAM,SAAO;CAC7B,MAAM,UAAUC,eAAOF,YAAIG,QAAM,aAAa,MAAM,KAAK,KAAK,MAAM,EAAE,CAAC,GAAG,MAAM,MAAM,OAAU;AAChG,KAAI,QAAQ,WAAW,EACnB,QAAO,QAAQ;UAEV,QAAQ,WAAW,EACxB;KAGA,QAAO,UAAU,KAAK,QAAQ;;AAGtC,SAAS,KAAK,KAAK,MAAM,QAAM,QAAQ,KAAK;CACxC,MAAM,WAAW,OAAO;CACxB,MAAM,SAAS,OAAO;CACtB,MAAM,OAAO,SAAS,KAAK,MAAMC,QAAM,EACnC,MAAM,oBACT,CAAC;AACF,qBAAoB,KAAK,KAAK;CAC9B,MAAM,MAAM,SAAS,KAAK,MAAMA,QAAM,EAClC,MAAM,cACT,CAAC;AACF,UAAS,WAAW;AACpB,KAAI,WAAW;AACf,KAAI,YAAY,YAAY,MAAM,MAAM,qCAAqC,uBAAuBA,OAAK,IAAI,IAAI;AACjH,SAAQ,QAAQ,KAAK;AAGrB,KAAI,QAAQ,QAAW;AACnB,UAAQ,MAAM,SAAS;AACvB,UAAQ,MAAM,IAAI;QAEjB;AACD,UAAQ,MAAM,IAAI;AAElB,UAAQ,MAAM,IAAI,KAAK;AACvB,UAAQ,IAAI,OAAO,SAAS;;AAEhC,QAAO;EACH,MAAM;EACN,OAAO;EACV;;AAEL,SAAS,KAAK,KAAK,MAAM,QAAM,QAAQ,KAAK;CACxC,MAAM,QAAQ,OAAO;CACrB,MAAM,MAAM,OAAO;CACnB,MAAM,QAAQ,SAAS,KAAK,MAAMC,QAAM,EACpC,MAAM,qBACT,CAAC;AACF,qBAAoB,KAAK,MAAM;CAC/B,MAAM,UAAU,SAAS,KAAK,MAAMA,QAAM,EACtC,MAAM,cACT,CAAC;CACF,MAAM,OAAO,SAAS,KAAK,MAAMA,QAAM,EACnC,MAAM,oBACT,CAAC;AACF,OAAM,WAAW;AACjB,SAAQ,WAAW;AACnB,SAAQ,OAAO,MAAM;AACrB,SAAQ,OAAO,QAAQ;AACvB,SAAQ,KAAK,KAAK;AAClB,KAAI,QAAQ,QAAW;AACnB,UAAQ,MAAM,QAAQ;AAEtB,UAAQ,MAAM,IAAI,KAAK;AACvB,UAAQ,IAAI,OAAO,MAAM;OAGzB,SAAQ,MAAM,MAAM;AAExB,KAAI,YAAY,YAAY,MAAM,MAAM,4BAA4B,cAAcA,OAAK,IAAI,IAAI;AAC/F,QAAO;EACH,MAAM;EACN,OAAO;EACV;;AAEL,SAAS,SAAS,KAAK,MAAM,YAAU,QAAQ;CAC3C,MAAM,QAAQ,OAAO;CACrB,MAAM,MAAM,OAAO;AACnB,SAAQ,OAAO,IAAI;AACnB,KAAI,YAAY,YAAY,MAAM,UAAUC,WAAS,IAAI,IAAI;AAC7D,QAAO;;AAEX,SAAS,oBAAoB,KAAK,OAAO;AACrC,KAAI,eAAe,KAAK,MAAM;AAC9B,OAAM,WAAW,IAAI,eAAe,SAAS;AAC7C,QAAO,MAAM;;AAEjB,SAAS,SAAS,KAAK,MAAM,OAAO,YAAY,GAAG,MAAM;CACrD,MAAM,MAAM,SAAS,KAAK,MAAM,YAAY;EACxC,MAAM;EACN;EACH,CAAC;AACF,OAAM,MAAM;AACZ,MAAK,MAAM,OAAO,KACd,KAAI,QAAQ,QAAW;AAEnB,UAAQ,OAAO,IAAI,KAAK;AACxB,UAAQ,IAAI,OAAO,IAAI;OAGvB,SAAQ,OAAO,IAAI;CAG3B,MAAM,SAAS;EACX,MAAM;EACN,OAAO;EACV;AACD,KAAI,YAAY,YAAY,MAAM,YAAY,WAAW,EAAE,WAAW,IAAI,IAAI;AAC9E,QAAO;;AAEX,SAAS,YAAY,YAAY;AAC7B,KAAI,sBAAsB,YACtB,QAAO;UAEF,sBAAsB,OAC3B,QAAO;UAEF,sBAAsB,WAC3B,QAAO;UAEF,sBAAsB,wBAC3B,QAAO;UAEF,sBAAsB,oBAC3B,QAAO;UAEF,sBAAsB,iCAC3B,QAAO;KAGP,OAAM,IAAI,MAAM,sCAAsC;;AAG9D,SAAS,UAAU,KAAK,MAAM;CAC1B,MAAM,aAAa,KAAK;AACxB,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,GAAG,KAAK;EACrC,MAAM,SAAS,KAAK;EACpB,IAAI;AACJ,MAAI,OAAO,KAAK,YAAY,WAAW,EACnC,cAAa,OAAO,KAAK,YAAY;EAEzC,MAAM,mBAAmB,sBAAsB;EAC/C,MAAM,iBAAiB;EACvB,MAAM,OAAO,KAAK,IAAI,GAAG;AACzB,MAAI,OAAO,KAAK,SAAS,aACrB,OAAO,MAAM,SAAS,aACtB,eAAe,WACb,oBAAoB,eAAe,gBAAgB,OAAO,SACxD,WAAW,WAAW,OAAO,QAAQ;AAEzC,OAAI,iBACA,gBAAe,cAAc;OAG7B,YAAW,SAAS;AAExB,eAAY,KAAK,OAAO,MAAM;QAI9B,SAAQ,OAAO,OAAO,KAAK;;CAGnC,MAAMC,UAAQ,KAAK;CACnB,MAAMC,SAAO,KAAK,aAAa;AAC/B,QAAO;EACH,MAAMD,QAAM;EACZ,OAAOC,OAAK;EACf;;AAEL,SAAS,SAAS,KAAK,MAAM,WAAW,YAAY;CAChD,MAAM,OAAO,SAAS,KAAK,MAAM,YAAY,EACzC,MAAM,WACT,CAAC;CACF,MAAM,QAAQ,SAAS,KAAK,MAAM,YAAY,EAC1C,MAAM,WACT,CAAC;AACF,eAAc,MAAM,IAAI,eAAe,OAAO,UAAU,CAAC;AACzD,QAAO;EACH;EACA;EACH;;AAEL,SAAS,QAAQ,KAAK,aAAa,aAAa;CAC5C,MAAM,OAAO,YAAY;CACzB,MAAM,QAAQ,IAAI,iBAAiB,IAAI,KAAK;CAC5C,MAAM,OAAO,SAAS,KAAK,aAAa,aAAa,EACjD,MAAM,WACT,CAAC;CACF,MAAM,QAAQ,SAAS,KAAK,aAAa,aAAa,EAClD,MAAM,WACT,CAAC;AAEF,eAAc,MADD,IAAI,eAAe,OAAO,MAAM,MAAM,CAC1B;AACzB,QAAO;EACH;EACA;EACH;;AAEL,SAAS,gBAAgB,KAAK,MAAM,SAAO;CACvC,MAAM,QAAQ,IAAI,iBAAiB,IAAI,KAAK;AAC5C,SAAQ,OAAOL,QAAM,KAAK;CAC1B,MAAM,OAAO,IAAI,gBAAgB,IAAI,KAAK;AAC1C,SAAQA,QAAM,OAAO,KAAK;AAK1B,QAJe;EACX,MAAM;EACN,OAAO;EACV;;AAGL,SAAS,QAAQ,GAAG,GAAG;AAEnB,eAAc,GADK,IAAI,kBAAkB,EAAE,CACf;;AAEhC,SAAS,SAAS,KAAK,MAAM,YAAY,SAAS;CAC9C,MAAM,IAAI,OAAO,OAAO;EAAE;EACtB;EAAY,wBAAwB;EAAO;EAAM,aAAa,EAAE;EAAE,qBAAqB,EAAE;EAAE,aAAa,IAAI,OAAO;EAAQ,EAAE,QAAQ;AACzI,KAAI,OAAO,KAAK,EAAE;AAClB,QAAO;;AAEX,SAAS,cAAc,OAAO,YAAY;AAGtC,KAAI,MAAM,YAAY,WAAW,EAC7B,OAAM,yBAAyB,WAAW,WAAW;AAEzD,OAAM,YAAY,KAAK,WAAW;;AAEtC,SAAS,YAAY,KAAK,OAAO;AAC7B,KAAI,OAAO,OAAO,IAAI,OAAO,QAAQ,MAAM,EAAE,EAAE;;;;;;;;;;AC3YnD,MAAa,YAAY,EAAE;AAC3B,IAAa,eAAb,MAA0B;CACtB,cAAc;AACV,OAAK,MAAM,EAAE;AACb,OAAK,UAAU,EAAE;;CAErB,IAAI,OAAO;AACP,SAAO,KAAK,QAAQ;;CAExB,WAAW;AAEP,OAAK,MAAM,EAAE;;CAEjB,IAAI,QAAQ;EACR,MAAM,MAAM,gBAAgB,OAAO;AAGnC,MAAI,EAAE,OAAO,KAAK,MAAM;AACpB,QAAK,IAAI,OAAO,KAAK,QAAQ;AAC7B,QAAK,QAAQ,KAAK,OAAO;;;CAGjC,IAAI,WAAW;AACX,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAOM,YAAI,KAAK,UAAU,MAAM,EAAE,IAAI;;CAE1C,IAAI,MAAM;EACN,IAAI,QAAQ;AACZ,OAAK,MAAM,KAAK,KAAK,IACjB,UAAS,IAAI;AAEjB,SAAO;;;AAGf,SAAgB,gBAAgB,QAAQ,MAAM,MAAM;AAChD,QAAO,GAAG,MAAM,IAAI,OAAO,QAAQ,GAAG,GAAG,OAAO,MAAM,YAAY,GAAG,OAAO,MAAM,KAAK,MAAM,EAAE,YAAY,UAAU,CAAC,CAAC,KAAK,IAAI;;;;;;;;;;AC3BpI,SAAS,eAAe,YAAY,UAAU;CAC1C,MAAMC,QAAM,EAAE;AACd,SAAQ,iBAAiB;EACrB,MAAM,MAAM,aAAa,UAAU;EACnC,IAAI,WAAWA,MAAI;AACnB,MAAI,aAAa,OACb,QAAO;OAEN;AACD,cAAW;IACP,eAAe;IACf;IACA,QAAQ,EAAE;IACb;AACD,SAAI,OAAO;AACX,UAAO;;;;AAInB,IAAM,eAAN,MAAmB;CACf,cAAc;AACV,OAAK,aAAa,EAAE;;CAExB,GAAG,OAAO;AACN,SAAO,SAAS,KAAK,WAAW,UAAU,KAAK,WAAW;;CAE9D,IAAI,OAAO,OAAO;AACd,OAAK,WAAW,SAAS;;CAE7B,WAAW;EACP,IAAI,QAAQ;EACZ,MAAM,OAAO,KAAK,WAAW;AAC7B,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IACtB,UAAS,KAAK,WAAW,OAAO,OAAO,MAAM;AAEjD,SAAO;;;AAGf,MAAM,mBAAmB,IAAI,cAAc;AAC3C,IAAa,0BAAb,cAA6C,qBAAqB;CAC9D,YAAY,SAAS;EACjB,IAAI;AACJ,SAAO;AACP,OAAK,WAAW,KAAK,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAa,QAAQ,OAAO,KAAK,IAAI,OAAO,YAAY,QAAQ,IAAI,QAAQ;;CAE/J,WAAW,SAAS;AAChB,OAAK,MAAM,UAAU,QAAQ,MAAM;AACnC,OAAK,OAAO,iBAAiB,KAAK,IAAI;;CAE1C,2CAA2C;AACvC,SAAO,EAAE;;CAEb,8BAA8B;AAC1B,SAAO,EAAE;;CAEb,6BAA6B,SAAS;EAClC,MAAM,EAAE,gBAAgB,MAAM,eAAe,yBAAyB;EACtE,MAAM,OAAO,KAAK;EAClB,MAAM,UAAU,KAAK;EACrB,MAAM,MAAM,YAAY,MAAM,eAAe,eAAe;EAE5D,MAAM,gBADgB,KAAK,IAAI,YAAY,KACP;EACpC,MAAM,cAAcA,YAAI,kBAAkB;GACtC,cAAc;GACd,YAAY;GACZ,UAAU;GACJ;GACT,CAAC,GAAG,YAAYA,YAAI,UAAU,SAAS,KAAK,GAAG,CAAC;AACjD,MAAI,cAAc,aAAa,MAAM,IAAI,CAAC,sBAAsB;GAC5D,MAAM,cAAcC,eAAO,cAAc,QAAQ,SAAS,QAAQ;AAC9D,oBAAQ,UAAU,gBAAgB;AAC9B,SAAI,aAAa;AACb,aAAO,YAAY,gBAAgB;AACnC,sBAAQ,YAAY,kBAAkB,sBAAsB;AACxD,cAAO,qBAAqB;QAC9B;;MAER;AACF,WAAO;MACR,EAAE,CAAC;AACN,OAAI,cACA,QAAO,SAAU,QAAQ;IACrB,IAAI;IAEJ,MAAM,aAAa,YADD,KAAK,GAAG,EAAE,CACa;AACzC,QAAI,WAAW,UAAa,eAAe,QAAW;KAClD,MAAM,QAAQ,KAAK,OAAO,iBAAiB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;AAC/E,SAAI,SAAS,UAAa,KAAK,KAAK,KAAK,KAAK,MAC1C;;AAGR,WAAO;;OAIX,QAAO,WAAY;AAEf,WAAO,YADW,KAAK,GAAG,EAAE,CACC;;aAIhC,cACL,QAAO,SAAU,QAAQ;GACrB,MAAM,aAAa,IAAI,cAAc;GACrC,MAAM,SAAS,WAAW,SAAY,IAAI,OAAO;AACjD,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC7B,MAAM,OAAO,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG;AACvE,eAAW,IAAI,GAAG,SAAS,UAAa,KAAK,KAAK,KAAK,CAAC;;GAE5D,MAAM,SAAS,gBAAgB,KAAK,MAAM,MAAM,eAAe,YAAY,QAAQ;AACnF,UAAO,OAAO,WAAW,WAAW,SAAS;;MAIjD,QAAO,WAAY;GACf,MAAM,SAAS,gBAAgB,KAAK,MAAM,MAAM,eAAe,kBAAkB,QAAQ;AACzF,UAAO,OAAO,WAAW,WAAW,SAAS;;;CAIzD,0BAA0B,SAAS;EAC/B,MAAM,EAAE,gBAAgB,MAAM,UAAU,yBAAyB;EACjE,MAAM,OAAO,KAAK;EAClB,MAAM,UAAU,KAAK;EACrB,MAAM,MAAM,YAAY,MAAM,UAAU,eAAe;EAEvD,MAAM,gBADgB,KAAK,IAAI,YAAY,KACP;EACpC,MAAM,OAAOD,YAAI,kBAAkB;GAC/B,cAAc;GACd,YAAY;GACZ;GACA;GACH,CAAC,GAAG,MAAM;AACP,UAAOA,YAAI,IAAI,MAAM,EAAE,GAAG;IAC5B;AACF,MAAI,cAAc,KAAK,IAAI,KAAK,GAAG,MAAM,CAAC,sBAAsB;GAC5D,MAAM,MAAM,KAAK;GACjB,MAAM,oBAAoBE,gBAAQ,IAAI;AACtC,OAAI,kBAAkB,WAAW,KAC7BC,gBAAQ,kBAAkB,GAAG,gBAAgB,EAAE;IAE/C,MAAM,yBADoB,kBAAkB,GACK;AACjD,WAAO,WAAY;AACf,YAAO,KAAK,GAAG,EAAE,CAAC,iBAAiB;;UAGtC;IACD,MAAM,cAAcF,eAAO,oBAAoB,QAAQ,gBAAgB;AACnE,SAAI,gBAAgB,QAAW;AAC3B,aAAO,YAAY,gBAAgB;AACnC,sBAAQ,YAAY,kBAAkB,sBAAsB;AACxD,cAAO,qBAAqB;QAC9B;;AAEN,YAAO;OACR,EAAE,CAAC;AACN,WAAO,WAAY;AAEf,YAAO,YADW,KAAK,GAAG,EAAE,CACC,kBAAkB;;;;AAI3D,SAAO,WAAY;GACf,MAAM,SAAS,gBAAgB,KAAK,MAAM,MAAM,eAAe,kBAAkB,QAAQ;AACzF,UAAO,OAAO,WAAW,WAAW,QAAQ,WAAW;;;;AAInE,SAAS,cAAc,WAAW,aAAa,MAAM;CACjD,MAAM,0BAAU,IAAI,KAAK;AACzB,MAAK,MAAM,OAAO,WAAW;EACzB,MAAM,yBAAS,IAAI,KAAK;AACxB,OAAK,MAAM,WAAW,KAAK;AACvB,OAAI,YAAY,OACZ,KAAI,WAEA;OAGA,QAAO;GAGf,MAAM,UAAU,CAAC,QAAQ,aAAa,CAAC,OAAO,QAAQ,gBAAgB;AACtE,QAAK,MAAM,SAAS,QAChB,KAAI,QAAQ,IAAI,MAAM,EAClB;QAAI,CAAC,OAAO,IAAI,MAAM,CAClB,QAAO;UAGV;AACD,YAAQ,IAAI,MAAM;AAClB,WAAO,IAAI,MAAM;;;;AAKjC,QAAO;;AAEX,SAAS,iBAAiB,KAAK;CAC3B,MAAM,iBAAiB,IAAI,eAAe;CAC1C,MAAM,gBAAgB,MAAM,eAAe;AAC3C,MAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,IAChC,eAAc,KAAK,eAAe,IAAI,eAAe,IAAI,EAAE;AAE/D,QAAO;;AAEX,SAAS,gBAAgB,WAAW,UAAU,cAAc,SAAS;CACjE,MAAM,MAAM,UAAU,UAAU,aAAa;CAC7C,IAAI,QAAQ,IAAI;AAChB,KAAI,UAAU,QAAW;AAErB,UAAQ,YAAY,KAAK,YADT,kBAAkB,IAAI,cAAc,CACP,CAAC;AAC9C,MAAI,QAAQ;;AAGhB,QADY,iBAAiB,MAAM,MAAM;EAAC;EAAK;EAAO;EAAc;EAAQ,CAAC;;AAGjF,SAAS,iBAAiB,KAAK,IAAI,cAAc,SAAS;CACtD,IAAI,YAAY;CAChB,IAAI,IAAI;CACR,MAAM,OAAO,EAAE;CACf,IAAI,IAAI,KAAK,GAAG,IAAI;AACpB,QAAO,MAAM;EACT,IAAI,IAAI,uBAAuB,WAAW,EAAE;AAC5C,MAAI,MAAM,OACN,KAAI,uBAAuB,MAAM,MAAM;GAAC;GAAK;GAAW;GAAG;GAAG;GAAc;GAAQ,CAAC;AAEzF,MAAI,MAAM,UACN,QAAO,0BAA0B,MAAM,WAAW,EAAE;AAExD,MAAI,EAAE,kBAAkB,KACpB,QAAO,EAAE;AAEb,cAAY;AACZ,OAAK,KAAK,EAAE;AACZ,MAAI,KAAK,GAAG,IAAI;;;AAGxB,SAAS,uBAAuB,KAAK,WAAW,OAAO,WAAW,cAAc,SAAS;CACrF,MAAM,QAAQ,gBAAgB,UAAU,SAAS,OAAO,aAAa;AACrE,KAAI,MAAM,SAAS,GAAG;AAClB,aAAW,KAAK,WAAW,OAAO,UAAU;AAC5C,SAAO;;CAEX,IAAIG,aAAW,YAAY,MAAM;CACjC,MAAM,eAAe,aAAa,OAAO,aAAa;AACtD,KAAI,iBAAiB,QAAW;AAC5B,aAAS,gBAAgB;AACzB,aAAS,aAAa;AACtB,aAAS,QAAQ,YAAY;YAExB,iCAAiC,MAAM,EAAE;EAC9C,MAAM,aAAaC,YAAI,MAAM,KAAK;AAClC,aAAS,gBAAgB;AACzB,aAAS,aAAa;AACtB,aAAS,QAAQ,YAAY;AAC7B,2BAAyB,MAAM,MAAM;GAAC;GAAK;GAAW,MAAM;GAAM;GAAQ,CAAC;;AAE/E,cAAW,WAAW,KAAK,WAAW,OAAOD,WAAS;AACtD,QAAOA;;AAEX,SAAS,yBAAyB,KAAK,WAAW,kBAAkB,SAAS;CACzE,MAAM,aAAa,EAAE;AACrB,MAAK,IAAI,IAAI,GAAG,KAAK,WAAW,IAC5B,YAAW,KAAK,KAAK,GAAG,EAAE,CAAC,UAAU;CAEzC,MAAM,WAAW,IAAI;CACrB,MAAM,eAAe,SAAS;CAC9B,MAAM,aAAa,SAAS;AAO5B,SANgB,oBAAoB;EAChC;EACA;EACA;EACA;EACH,CAAC,CACc;;AAEpB,SAAS,oBAAoB,SAAS;CAClC,MAAM,UAAUJ,YAAI,QAAQ,aAAa,YAAY,WAAW,QAAQ,CAAC,CAAC,KAAK,KAAK;CACpF,MAAM,aAAa,QAAQ,WAAW,QAAQ,IAAI,KAAK,QAAQ,WAAW;CAC1E,IAAI,cAAc,qCAAqC,QAAQ,iBAAiB,KAAK,KAAK,CAAC,QAAQ,qBAAqB,QAAQ,WAAW,GAAG,WAAW,YACzI,QAAQ,aAAa,KAAK,YAClC,QAAQ;AAChB,eACI,cACI;AAER,QAAO;;AAEX,SAAS,qBAAqB,MAAM;AAChC,KAAI,gBAAgB,YAChB,QAAO;UAEF,gBAAgB,OACrB,QAAO;UAEF,gBAAgB,YACrB,QAAO;UAEF,gBAAgB,oBACrB,QAAO;UAEF,gBAAgB,iCACrB,QAAO;UAEF,gBAAgB,wBACrB,QAAO;UAEF,gBAAgB,WACrB,QAAO;UAEF,gBAAgB,SACrB,QAAO;KAGP,OAAM,MAAM,uBAAuB;;AAG3C,SAAS,0BAA0B,MAAM,UAAU,SAAS;AAKxD,QAAO;EACH,aAAa;EACb,oBALmBM,eADCC,gBAAQ,SAAS,QAAQ,WAAW,MAAM,EAAE,MAAM,YAAY,CAEjF,QAAQ,MAAM,aAAa,eAAe,CAC1C,KAAK,MAAM,EAAE,UAAU,GAAG,MAAM,EAAE,aAAa;EAIhD,WAAW;EACd;;AAEL,SAAS,uBAAuB,OAAO,OAAO;AAC1C,QAAO,MAAM,MAAM,MAAM;;AAE7B,SAAS,gBAAgB,SAAS,OAAO,cAAc;CACnD,MAAM,eAAe,IAAI,cAAc;CACvC,MAAM,oBAAoB,EAAE;AAC5B,MAAK,MAAM,KAAK,QAAQ,UAAU;AAC9B,MAAI,aAAa,GAAG,EAAE,IAAI,KAAK,MAC3B;AAEJ,MAAI,EAAE,MAAM,SAAS,eAAe;AAChC,qBAAkB,KAAK,EAAE;AACzB;;EAEJ,MAAM,mBAAmB,EAAE,MAAM,YAAY;AAC7C,OAAK,IAAI,IAAI,GAAG,IAAI,kBAAkB,KAAK;GACvC,MAAM,aAAa,EAAE,MAAM,YAAY;GACvC,MAAM,SAAS,mBAAmB,YAAY,MAAM;AACpD,OAAI,WAAW,OACX,cAAa,IAAI;IACb,OAAO;IACP,KAAK,EAAE;IACP,OAAO,EAAE;IACZ,CAAC;;;CAId,IAAI;AACJ,KAAI,kBAAkB,WAAW,KAAK,aAAa,SAAS,EACxD,SAAQ;AAEZ,KAAI,UAAU,QAAW;AACrB,UAAQ,IAAI,cAAc;AAC1B,OAAK,MAAM,KAAK,aAAa,SACzB,SAAQ,GAAG,MAAM;;AAGzB,KAAI,kBAAkB,SAAS,KAAK,CAAC,yBAAyB,MAAM,CAChE,MAAK,MAAM,KAAK,kBACZ,OAAM,IAAI,EAAE;AAGpB,QAAO;;AAEX,SAAS,mBAAmB,YAAY,OAAO;AAC3C,KAAI,sBAAsB,kBACtB,aAAa,OAAO,WAAW,UAAU,CACzC,QAAO,WAAW;;AAI1B,SAAS,aAAa,SAAS,cAAc;CACzC,IAAI;AACJ,MAAK,MAAM,KAAK,QAAQ,SACpB,KAAI,aAAa,GAAG,EAAE,IAAI,KAAK,MAC3B;MAAI,QAAQ,OACR,OAAM,EAAE;WAEH,QAAQ,EAAE,IACf;;AAIZ,QAAO;;AAEX,SAAS,YAAY,WAAS;AAC1B,QAAO;EACH,SAASC;EACT,OAAO,EAAE;EACT,eAAe;EACf,YAAY;EACf;;AAEL,SAAS,WAAW,KAAK,MAAM,OAAO,IAAI;AACtC,MAAK,YAAY,KAAK,GAAG;AACzB,MAAK,MAAM,MAAM,gBAAgB;AACjC,QAAO;;AAEX,SAAS,YAAY,KAAK,OAAO;AAC7B,KAAI,UAAU,UACV,QAAO;CAIX,MAAM,SAAS,MAAM,QAAQ;CAC7B,MAAM,WAAW,IAAI,OAAO;AAC5B,KAAI,aAAa,OACb,QAAO;AAEX,OAAM,QAAQ,UAAU;AACxB,KAAI,OAAO,UAAU;AACrB,QAAO;;AAEX,SAAS,kBAAkB,UAAU;CACjC,MAAM,UAAU,IAAI,cAAc;CAClC,MAAM,sBAAsB,SAAS,YAAY;AACjD,MAAK,IAAI,IAAI,GAAG,IAAI,qBAAqB,IAOrC,SALe;EACX,OAFW,SAAS,YAAY,GAAG;EAGnC,KAAK;EACL,OAAO,EAAE;EACZ,EACe,QAAQ;AAE5B,QAAO;;AAEX,SAAS,QAAQ,QAAQ,SAAS;CAC9B,MAAM,IAAI,OAAO;AACjB,KAAI,EAAE,SAAS,eAAe;AAC1B,MAAI,OAAO,MAAM,SAAS,GAAG;GACzB,MAAM,WAAW,CAAC,GAAG,OAAO,MAAM;AAOlC,WALqB;IACjB,OAFgB,SAAS,KAAK;IAG9B,KAAK,OAAO;IACZ,OAAO;IACV,EACqB,QAAQ;QAK9B,SAAQ,IAAI,OAAO;AAEvB;;AAEJ,KAAI,CAAC,EAAE,uBACH,SAAQ,IAAI,OAAO;CAEvB,MAAM,mBAAmB,EAAE,YAAY;AACvC,MAAK,IAAI,IAAI,GAAG,IAAI,kBAAkB,KAAK;EACvC,MAAM,aAAa,EAAE,YAAY;EACjC,MAAM,IAAI,iBAAiB,QAAQ,WAAW;AAC9C,MAAI,MAAM,OACN,SAAQ,GAAG,QAAQ;;;AAI/B,SAAS,iBAAiB,QAAQ,YAAY;AAC1C,KAAI,sBAAsB,kBACtB,QAAO;EACH,OAAO,WAAW;EAClB,KAAK,OAAO;EACZ,OAAO,OAAO;EACjB;UAEI,sBAAsB,gBAAgB;EAC3C,MAAM,QAAQ,CAAC,GAAG,OAAO,OAAO,WAAW,YAAY;AACvD,SAAO;GACH,OAAO,WAAW;GAClB,KAAK,OAAO;GACZ;GACH;;;AAIT,SAAS,yBAAyB,SAAS;AACvC,MAAK,MAAM,KAAK,QAAQ,SACpB,KAAI,EAAE,MAAM,SAAS,cACjB,QAAO;AAGf,QAAO;;AAEX,SAAS,2BAA2B,SAAS;AACzC,MAAK,MAAM,KAAK,QAAQ,SACpB,KAAI,EAAE,MAAM,SAAS,cACjB,QAAO;AAGf,QAAO;;AAEX,SAAS,iCAAiC,SAAS;AAC/C,KAAI,2BAA2B,QAAQ,CACnC,QAAO;CAEX,MAAM,UAAU,sBAAsB,QAAQ,SAAS;AAEvD,QADkB,qBAAqB,QAAQ,IAAI,CAAC,6BAA6B,QAAQ;;AAG7F,SAAS,sBAAsB,SAAS;CACpC,MAAM,+BAAe,IAAI,KAAK;AAC9B,MAAK,MAAM,KAAK,SAAS;EACrB,MAAM,MAAM,gBAAgB,GAAG,MAAM;EACrC,IAAI,OAAO,aAAa,IAAI,IAAI;AAChC,MAAI,SAAS,QAAW;AACpB,UAAO,EAAE;AACT,gBAAa,IAAI,KAAK,KAAK;;AAE/B,OAAK,EAAE,OAAO;;AAElB,QAAO;;AAEX,SAAS,qBAAqB,SAAS;AACnC,MAAK,MAAM,SAAS,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAC5C,KAAI,OAAO,KAAK,MAAM,CAAC,SAAS,EAC5B,QAAO;AAGf,QAAO;;AAEX,SAAS,6BAA6B,SAAS;AAC3C,MAAK,MAAM,SAAS,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAC5C,KAAI,OAAO,KAAK,MAAM,CAAC,WAAW,EAC9B,QAAO;AAGf,QAAO;;;;;ACziBX,SAAgBC,cAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,iBAAiB;AACtB,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;GAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;GAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;GAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE;GACvC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE;GACzC,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;GACjC,CAAC;GACF;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;GAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE;GACxC,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE;GAC1C,CAAC;GACF;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE,EACxC,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAC5C,CAAC;GACF;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,GAAG,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;GAC3E;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,GAAG,CACH;GACE,YAAY,EAAE,GAAG,EAAE,CAAC,cAAc,MAAM,EAAE,GAAG,EAAE,CAAC;GAChD,WAAW;AACT,MAAE,QAAQ,EAAE,KAAK;AACjB,MAAE,SAAS,EAAE,KAAK;;GAErB,EACD;GACE,YAAY,EAAE,GAAG,EAAE,CAAC,cAAc,MAAM,EAAE,GAAG,EAAE,CAAC;GAChD,WAAW;AACT,MAAE,QAAQ,EAAE,QAAQ;AACpB,MAAE,SAAS,EAAE,QAAQ;AACrB,MAAE,OAAO;KACP,YAAY,EAAE,GAAG,EAAE,CAAC,cAAc,MAAM,EAAE,GAAG,EAAE,CAAC;KAChD,WAAW,EAAE,SAAS,EAAE,QAAQ;KACjC,CAAC;;GAEL,CACF,CAAC;GACF;;;;;AC3DJ,SAAgBC,cAAY,GAAG,GAAG;AAMhC,GAAE,KAAK,uBAAuB;AAC5B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,EACvC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,CACpC,CAAC;GACF;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE,EACxC,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAC9C,CAAC;GACF;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;GAChC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;GACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAI,EAAE;GAC/B,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;GAChC,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;GACjC,CAAC;GACF;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,EACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,CACnC,CAAC;GACF;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,WAAW;AAKX,KAAE,QAAQ,EAAE,WAAW;IACvB;AAGF,IAAE,GAAG;GACH,KAAK,CACH,EACE,WAAW;AACT,MAAE,QAAQ,EAAE,cAAc;AAC1B,MAAE,QAAQ,EAAE,KAAK;MAEpB,EACD,EAGE,WAAW;AACT,MAAE,QAAQ,EAAE,qBAAqB;AACjC,MAAE,aAAa;AACb,OAAE,SAAS,EAAE,KAAK;MAClB;MAEL,CACF;GACD,oBAAoB;GACrB,CAAC;GACF;AAGF,GAAE,KAAK,8BAA8B;AAInC,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,mBAAmB;AAExB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,YAAY;AACZ,MAAE,SAAS,EAAE,WAAW;KACxB;AAEF,KAAE,SAAS,EAAE,WAAW;AACxB,KAAE,cAAc,EAAE,SAAS,EAAE,cAAc,CAAC;IAC5C;GACF;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AAEF,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,cAAc;AACnB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,MAAM;GACN,YAAY,EAAE,oBAAoB,EAAE,OAAO;GAC3C,WAAW;AACT,MAAE,YAAY;AACZ,OAAE,SAAS,EAAE,WAAW;MACxB;AACF,MAAE,SAAS,EAAE,QAAQ;AACrB,MAAE,SAAS,EAAE,QAAQ;;GAExB,CAAC;GACF;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,sBAAsB;IAClC;AACF,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,UAAU;IACtB;GACF;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,mBAAmB;AACxB,IAAE,QAAQ,EAAE,QAAQ;AAGpB,IAAE,QAAQ,EAAE,qBAAqB;AACjC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;GACF;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,QAAQ,EAAE,cAAc;GAC1B;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,iBAAiB;AAC7B,IAAE,QAAQ,EAAE,QAAQ;GACpB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,aAAa;IAC1B;GACF;AAGF,GAAE,KAAK,sBAAsB;AAE3B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,EACzC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,CACrC,CAAC;GACF;AAGF,GAAE,KAAK,kBAAkB;AACvB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,eAAe;IAC3B;GACF;AAGF,GAAE,KAAK,wBAAwB;AAE7B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,EACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,CAClC,CAAC;AACF,IAAE,QAAQ,EAAE,cAAc;GAC1B;;;;;ACvNJ,SAAgBC,cAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,oBAAoB;AACzB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,SAAS,EAAE,WAAW;IACxB;GACF;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,SAAS,EAAE,WAAW;IACxB;GACF;AAGF,GAAE,KAAK,kBAAkB;AAMvB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,SAAS,EAAE,WAAW;IACxB;GACF;AAGF,GAAE,KAAK,wBAAwB;AAE7B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,KAAK;GAIL,YAAY,aAAa,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,WAAW;GAC5D,WAAW;AACT,MAAE,QAAQ,EAAE,IAAI;AAChB,MAAE,SAAS,EAAE,WAAW;;GAE3B,CAAC;GACF;AAGF,GAAE,KAAK,oBAAoB;AACzB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,KAAK;GAML,YAAY,aAAa,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,KAAK,KAAK;GAC3D,WAAW;AACT,MAAE,QAAQ,EAAE,IAAI;AAChB,MAAE,SAAS,EAAE,WAAW;;GAE3B,CAAC;GACF;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,SAAS,EAAE,WAAW;IACxB;GACF;;;;;AC7EJ,SAAgBC,cAAY,GAAG,GAAG;;;;;;;;;AAShC,GAAE,KAAK,yBAAyB;AAC9B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,wBAAwB,EAAE;GACnD,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE;GAClD,EAAE,WAAW,EAAE,QAAQ,IAAI,EAAE;GAC9B,CAAC;GACF;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,aAAa,EAAE,QAAQ,EAAE,mBAAmB,CAAC;AAC/C,IAAE,WAAW;AACX,KAAE,SAAS,EAAE,kBAAkB;IAC/B;AACF,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;GACF;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,kBAAkB;IAC9B;AACF,IAAE,QAAQ,EAAE,kBAAkB;GAC9B;AAGF,GAAE,KAAK,4BAA4B;AACjC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,SAAS,EAAE,WAAW;IACxB;AACF,IAAE,SAAS,EAAE,UAAU;GACvB;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,2BAA2B;AAMhC,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,OAAO;AACnB,KAAE,aAAa;AACb,MAAE,QAAQ,EAAE,OAAO;KACnB;AACF,KAAE,QAAQ,EAAE,kBAAkB;AAC9B,KAAE,cAAc;AACd,MAAE,QAAQ,EAAE,IAAI;AAChB,MAAE,QAAQ,EAAE,KAAK;KACjB;AACF,KAAE,QAAQ,EAAE,UAAU;KAEzB,EAKD,EACE,WAAW,EAAE,QAAQ,EAAE,eAAe,EACvC,CACF,CAAC;GACF;;;;;;;;;;;;AAaF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;GAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE;GAC9C,CAAC;GACF;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,KAAK;IACjB;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,SAAS,EAAE,WAAW;IACxB;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,yBAAyB;AAG9B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,wBAAwB,EAAE;GACnD,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE;GAClD,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;GAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,oBAAoB,EAAE;GAC/C,EAAE,WAAW,EAAE,QAAQ,EAAE,wBAAwB,EAAE;GACpD,CAAC;GACF;AAEF,GAAE,KAAK,iCAAiC;AAEtC,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,KAAK;GACL,YAAY;;;;;;;AAOV,YACG,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,WAAW,IAC5C,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,WAAW,MAAM;;GAGzD,WAAW;AACT,MAAE,QAAQ,EAAE,iBAAiB;;GAEhC,CAAC;AACF,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAEF,GAAE,KAAK,gCAAgC;AAErC,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,YAAY;AACxB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,GAAG;AACf,KAAE,QAAQ,EAAE,WAAW;AACvB,KAAE,WAAW;AACX,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,SAAS,EAAE,WAAW;KACxB;IACF;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAEF,GAAE,KAAK,8BAA8B;AAEnC,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,YAAY;AACxB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,GAAG;AACf,KAAE,QAAQ,EAAE,WAAW;AACvB,KAAE,WAAW;AACX,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,SAAS,EAAE,WAAW;KACxB;IACF;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAEF,GAAE,KAAK,6BAA6B;AAElC,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAEF,GAAE,KAAK,iCAAiC;AAEtC,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,SAAS,EAAE,SAAS;AACtB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,SAAS;IACtB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,CACnC,CAAC;GACF;;;;;AC9NJ,SAAgBC,cAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,0BAA0B;AAI/B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE;GAClD,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE;GAC3C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE;GAC9C,CAAC;GACF;AAGF,GAAE,KAAK,gCAAgC;AAErC,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,eAAe;IAC3B;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACpC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;GACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACrC,CAAC;GACF;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,kBAAkB;AAC9B,IAAE,QAAQ,EAAE,QAAQ;GACpB;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,cAAc;IAC3B;GACF;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,kBAAkB;GAC9B;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,cAAc;IAC3B;GACF;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,SAAS;IACtB;GACF;AAGF,GAAE,KAAK,mBAAmB;AACxB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,qBAAqB;IACjC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE;GAClD,EAAE,WAAW,EAAE,QAAQ,EAAE,oBAAoB,EAAE;GAC/C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE;GAC7C,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE;GACnD,CAAC;GACF;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE;GAC7C,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;GAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACtC,CAAC;GACF;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,uBAAuB;AACnC,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;GACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACrC,CAAC;GACF;AAGF,GAAE,KAAK,2BAA0B,uBAAsB;AACrD,IAAE,QAAQ,EAAE,mBAAmB;AAC/B,IAAE,KAAK;GAGL,YAAY,CAAC;GACb,WAAW;AACT,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,SAAS,EAAE,mBAAmB;;GAEnC,CAAC;GACF;AAGF,GAAE,KAAK,4BAA4B;AACjC,IAAE,QAAQ,EAAE,qBAAqB;AACjC,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,OAAO;AACnB,KAAE,QAAQ,EAAE,oBAAoB;IAChC;GACF;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,WAAW;AACvB,KAAE,aAAa;AACb,MAAE,QAAQ,EAAE,KAAK;KACjB;KAEL,EACD,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,CACvC,CAAC;GACF;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAC7C,CAAC;GACF;AAGF,GAAE,KAAK,mBAAmB;AACxB,IAAE,GAAG,CAGH,EAAE,WAAW,EAAE,QAAQ,EAAE,yCAAyC,EAAE,EACpE,EAAE,WAAW,EAAE,QAAQ,EAAE,mBAAmB,EAAE,CAC/C,CAAC;GACF;AAEF,GAAE,KAAK,kDAAkD;AACvD,IAAE,QAAQ,EAAE,mBAAmB;AAC/B,IAAE,OAAO;GACP,YAAY,KAAK,oBAAoB,EAAE,OAAO;GAC9C,WAAW,EAAE,SAAS,EAAE,KAAK;GAC9B,CAAC;GACF;AAGF,GAAE,KAAK,4BAA4B;AACjC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,EACvC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,CACpC,CAAC;GACF;AAGF,GAAE,KAAK,4BAA4B;AACjC,IAAE,QAAQ,EAAE,0BAA0B;AACtC,IAAE,OAAO;GACP,YAAY,KAAK,oBAAoB,EAAE,OAAO;GAC9C,WAAW,EAAE,SAAS,EAAE,KAAK;GAC9B,CAAC;GACF;AAEF,GAAE,KAAK,mCAAmC;AAIxC,IAAE,QAAQ,EAAE,eAAe;GAC3B;AAGF,GAAE,KAAK,wBAAwB;AAE7B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,YAAY;AACZ,MAAE,SAAS,EAAE,WAAW;KACxB;AAEF,KAAE,SAAS,EAAE,WAAW;AACxB,KAAE,cAAc;AACd,MAAE,SAAS,EAAE,cAAc;KAC3B;IACF;GACF;AAGF,GAAE,KAAK,4BAA4B;AACjC,IAAE,QAAQ,EAAE,eAAe;GAC3B;AAGF,GAAE,KAAK,2BAA2B;AAGhC,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,eAAe;IAC3B;AACF,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACpC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;GACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE;GACxC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACrC,CAAC;GACF;AAGF,GAAE,KAAK,sBAAsB;AAE3B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,eAAe;AAC3B,KAAE,WAAW;AACX,MAAE,QAAQ,EAAE,WAAW;KACvB;IACF;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,iBAAiB;AAC7B,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,OAAO;IACnB;GACF;AAGF,GAAE,KAAK,gBAAgB;AACrB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,EACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE,CACjC,CAAC;GACF;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,kBAAkB;AAC9B,KAAE,aAAa;AACb,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,QAAQ,EAAE,oBAAoB;KAChC;KAEL,EACD,EAAE,WAAW,EAAE,cAAc,EAAE,SAAS,EAAE,oBAAoB,CAAC,EAAE,CAClE,CAAC;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,KAAK;IACjB;GACF;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,WAAW;AACvB,KAAE,QAAQ,EAAE,IAAI;IAChB;AACF,IAAE,QAAQ,EAAE,KAAK;GACjB;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,QAAQ,EAAE,gBAAgB;AAC5B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,gBAAgB;IAC7B;GACF;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,GAAG,CAEH,EAAE,WAAW,EAAE,QAAQ,EAAE,6BAA6B,EAAE,EACxD,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE,CACnD,CAAC;GACF;AAGF,GAAE,KAAK,sCAAsC;AAC3C,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,qBAAqB;GACjC;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,CAClC,CAAC;GACF;AAGF,GAAE,KAAK,gBAAgB;AACrB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,kBAAkB;GAC9B;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,cAAc;IAC3B;GACF;AAGF,GAAE,KAAK,uBAAuB;AAG5B,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,oBAAoB;AACzB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,EACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,CACtC,CAAC;GACF;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,QAAQ,EAAE,MAAM;GAClB;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,MAAM;GAClB;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,oBAAoB;IAChC;AACF,IAAE,QAAQ,EAAE,sBAAsB;AAClC,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,OAAO;IACnB;AACF,IAAE,QAAQ,EAAE,gBAAgB;GAC5B;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACpC,CAAC;GACF;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,eAAe;IAC3B;AACF,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,kBAAkB;AAC9B,KAAE,cAAc;AACd,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,QAAQ,EAAE,oBAAoB;KAChC;KAEL,EACD,EAAE,WAAW,EAAE,cAAc,EAAE,SAAS,EAAE,oBAAoB,CAAC,EAAE,CAClE,CAAC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,wBAAwB;AAE7B,IAAE,QAAQ,EAAE,eAAe;GAC3B;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,8BAA8B;IAC1C;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,uCAAuC;AAE5C,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,yCAAyC,EAAE,EACpE,EAAE,WAAW,EAAE,QAAQ,EAAE,uCAAuC,EAAE,CACnE,CAAC;GACF;AAEF,GAAE,KAAK,kDAAkD;AACvD,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,GAAG,CACH,EACE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAC7B,EACD,EACE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAC9B,CACF,CAAC;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAEF,GAAE,KAAK,gDAAgD;AASrD,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,SAAS;GACrB;AAGF,GAAE,KAAK,kBAAkB;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,MAAM;IAClB;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,qBAAqB;IACjC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,KAAK;GACL,YAAY;IACV,MAAM,YAAY,EAAE,GAAG,EAAE;AACzB,WACE,aAAa,WAAW,EAAE,WAAW,IAAI,aAAa,WAAW,EAAE,GAAG;;GAG1E,WAAW;AACT,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,SAAS,EAAE,aAAa;;GAE7B,CAAC;GACF;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,qBAAqB;IACjC;AACF,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,OAAO;AACnB,KAAE,cAAc;AACd,MAAE,QAAQ,EAAE,aAAa;KACzB;AACF,KAAE,QAAQ,EAAE,OAAO;IACnB;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,UAAU;IACtB;GACF;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,qBAAqB;IACjC;GACF;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,eAAe;IAC3B;AACF,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,oBAAoB;IAChC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,QAAQ,EAAE,gBAAgB;AAC5B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,gBAAgB;IAC7B;GACF;AAGF,GAAE,KAAK,yBAAyB;AAI9B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,wBAAwB;IACpC;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,6BAA6B,EAAE,CACzD,CAAC;GACF;AAIF,GAAE,KAAK,sCAAsC;AAC3C,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,oBAAoB;AACzB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,sBAAsB;IAClC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,8BAA8B,EAAE,EACzD,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CACjD,CAAC;GACF;AAGF,GAAE,KAAK,uCAAuC;AAC5C,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,oBAAoB;IAChC;AACF,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,QAAQ,EAAE,gBAAgB;GAC5B;AAEF,GAAE,KAAK,gBAAgB;AACrB,IAAE,KAAK,EAAE,WAAW;AACpB,SACE,aAAa,KAAK,GAAG,EAAE,EAAE,EAAE,QAAQ,IAAI,aAAa,KAAK,GAAG,EAAE,EAAE,EAAE,QAAQ;GAE5E;;;;;ACztBJ,SAAgBC,cAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,8BAA8B;AAEnC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,kBAAkB;IAC9B;AAEF,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,2BAA2B,EAAE,EACtD,EAAE,WAAW,EAAE,QAAQ,EAAE,+BAA+B,EAAE,CAC3D,CAAC;GACF;AAGF,GAAE,KAAK,oCAAoC;AAEzC,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,eAAe;IAC3B;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,cAAc;GAC1B;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACpC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACrC,CAAC;GACF;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,kBAAkB;GAC9B;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,SAAS;IACtB;GACF;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,2BAA2B;IACvC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,oCAAoC;AACzC,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,oBAAoB,EAAE;GAC/C,EAAE,WAAW,EAAE,QAAQ,EAAE,2BAA2B,EAAE;GACtD,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;GAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACtC,CAAC;GACF;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,uBAAuB;AACnC,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;GAClC,CAAC;GACF;AAGF,GAAE,KAAK,oCAAoC;AACzC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,wBAAwB;IACpC;AACF,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACpC,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACrC,CAAC;GACF;AAGF,GAAE,KAAK,wCAAwC;AAE7C,IAAE,QAAQ,EAAE,GAAG;AACf,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,QAAQ,EAAE,wBAAwB;GACpC;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,qCAAqC;IACjD;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,8CAA8C;AACnD,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,sCAAsC,EAAE;GACjE,EAAE,WAAW,EAAE,QAAQ,EAAE,oBAAoB,EAAE;GAC/C,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;GAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACtC,CAAC;GACF;AAGF,GAAE,KAAK,+CAA+C;AACpD,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,mCAAmC;IAC/C;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,KAAK;IACjB;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,4CAA4C;AACjD,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;GAClC,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACrC,CAAC;GACF;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,aAAa;GACzB;AAGF,GAAE,KAAK,oBAAoB;AAGzB,IAAE,QAAQ,EAAE,GAAG;AACf,IAAE,QAAQ,EAAE,SAAS;AAIrB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,OAAO;AACnB,KAAE,GAAG;IACH,KAAK;KAEH,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;KAEhD,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE;KACxC,EACE,WAAW,IAGZ;KACF;IACD,oBAAoB;IACrB,CAAC;AACF,KAAE,QAAQ,EAAE,OAAO;IACnB;GACF;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,QAAQ,EAAE,iBAAiB;AAC7B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,iBAAiB;IAC9B;GACF;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,aAAa;GACzB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,sBAAsB,EAAE;GACjD,EAAE,WAAW,EAAE,QAAQ,EAAE,6BAA6B,EAAE;GACxD,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACvC,CAAC;GACF;AAGF,GAAE,KAAK,sCAAsC;AAC3C,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,MAAM;IAClB;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,KAAK;GACL,YAAY,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,OAAO,KAAK;GAC1D,WAAW;AACT,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,SAAS,EAAE,aAAa;;GAE7B,CAAC;GACF;;;;;ACtQJ,SAAgBC,cAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,wBAAwB;IACpC;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,MAAM;IAClB;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,QAAQ,EAAE,oBAAoB;AAChC,IAAE,KAAK;GAEL,YAAY,aAAa,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,OAAO,KAAK;GAC7D,WAAW;AACT,MAAE,QAAQ,EAAE,MAAM;AAClB,MAAE,SAAS,EAAE,oBAAoB;;GAEpC,CAAC;GACF;;;;;ACrBJ,SAAgBC,cAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,eAAe;AACpB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,WAAW;AACX,KAAE,SAAS,EAAE,eAAe;IAC5B;GACF;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,GAAG;GACH,KAAK;IACH,EAAE,WAAW,EAAE,QAAQ,EAAE,kCAAkC,EAAE;IAC7D,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;IAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE;IAChD,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;IACtC;GACD,oBAAoB;GACrB,CAAC;GACF;AAGF,GAAE,KAAK,2CAA2C;AAChD,IAAE,QAAQ,EAAE,yBAAyB;AACrC,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,6BAA4B,uBAAsB;AACvD,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,kBAAkB;AAC9B,IAAE,QAAQ,EAAE,wBAAwB,EAAE,MAAM,CAAC,mBAAmB,EAAE,CAAC;GACnE;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,GAAG;GACH,KAAK,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,EACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAI,EAAE,CAChC;GACD,oBAAoB;GACrB,CAAC;GACF;AAGF,GAAE,KAAK,mBAAmB;AACxB,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,qCAAqC,EAAE;GAChE,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;GAE5C,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE;GACvC,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;GAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE;GACzC,CAAC;GACF;AAGF,GAAE,KAAK,8CAA8C;AACnD,IAAE,GAAG;GACH,KAAK;IACH,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;IACjC,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;IAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;IAC1C;KACE,YAAY,CAAC,aAAa,KAAK,GAAG,EAAE,CAAC,WAAW,EAAE,OAAO;KACzD,WAAW,EAAE,QAAQ,EAAE,oBAAoB;KAC5C;IACD,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE;IAC3C,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE;IAC3C,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE;IACvC,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;IAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE;IAC7C,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE;IAC3C,EAAE,WAAW,EAAE,QAAQ,EAAE,sBAAsB,EAAE;IACjD,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;IAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE;IACzC;GACD,oBAAoB;GACrB,CAAC;GACF;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,QAAQ,EAAE,oBAAoB;AAChC,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,6BAA6B;AAMlC,IAAE,QAAQ,EAAE,WAAW;GACvB;AAKF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,GAAG;AACf,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,KAAK;AACjB,KAAE,SAAS,EAAE,UAAU;IACvB;GACF;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,WAAW;IACxB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,YAAY;GACxB;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,WAAW;AACvB,KAAE,WAAW,EAAE,SAAS,EAAE,WAAW,CAAC;KAEzC,EACD,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,0BAA0B,CAAC,EAAE,CACrE,CAAC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,mCAAmC;AACxC,IAAE,QAAQ,EAAE,YAAY;AACxB,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;GACF;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,KAAK;AACjB,KAAE,IAAI;IACJ,EACE,WAAW;AACT,OAAE,QAAQ,EAAE,KAAK;AACjB,OAAE,cAAc;AACd,QAAE,SAAS,EAAE,MAAM;AACnB,QAAE,QAAQ,EAAE,QAAQ;OACpB;OAEL;IACD,EACE,WAAW;AACT,OAAE,QAAQ,EAAE,YAAY;AACxB,OAAE,WAAW;AACX,QAAE,QAAQ,EAAE,MAAM;AAClB,QAAE,SAAS,EAAE,YAAY;OACzB;AACF,OAAE,aAAa;AACb,QAAE,QAAQ,EAAE,MAAM;OAClB;OAEL;IACD;KACE,YAAY,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,KAAK;KACpD,WAAW;AACT,QAAE,QAAQ,EAAE,aAAa;AACzB,QAAE,YAAY;AACZ,SAAE,SAAS,EAAE,MAAM;AACnB,SAAE,SAAS,EAAE,aAAa;QAC1B;;KAEL;IACF,CAAC;KAEL,EACD,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,CACrC,CAAC;GACF;AAGF,GAAE,KAAK,oBAAoB;AACzB,IAAE,QAAQ,EAAE,YAAY;AACxB,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;GAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE;GACjC,EACE,WAAW;AACT,MAAE,QAAQ,EAAE,WAAW;AACvB,MAAE,QAAQ,EAAE,UAAU;MAEzB;GACF,CAAC;GACF;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,sBAAsB;GAClC;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,QAAQ;GACpB;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,GAAG;AACf,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE,EAC7C,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CACjD,CAAC;GACF;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,QAAQ;IACpB;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,SAAS,EAAE,UAAU;AACvB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,UAAU;IACtB;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,iBAAiB;AACtB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,yBAAyB,EAAE,EACpD,EAAE,WAAW,EAAE,QAAQ,EAAE,wBAAwB,EAAE,CACpD,CAAC;GACF;AAGF,GAAE,KAAK,mBAAmB;AACxB,IAAE,QAAQ,EAAE,wBAAwB;GACpC;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,QAAQ,EAAE,oBAAoB;AAChC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,oBAAoB;IACjC;GACF;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,yBAAyB;AACrC,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,MAAM;GAClB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,GAAG,CACH,EACE,WAAW;AACT,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,IAAI,CACJ,EACE,WAAW;AACT,MAAE,QAAQ,EAAE,QAAQ;AACpB,MAAE,aAAa;AACb,OAAE,QAAQ,EAAE,QAAQ;MACpB;MAEL,EACD,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,CACrC,CAAC;KAEL,EACD,EAAE,WAAW,EAAE,QAAQ,EAAE,0BAA0B,EAAE,CACtD,CAAC;GACF;AAGF,GAAE,KAAK,iBAAiB;AACtB,IAAE,QAAQ,EAAE,YAAY;AACxB,IAAE,WAAW;AACX,KAAE,SAAS,EAAE,YAAY;IACzB;GACF;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,qBAAqB;AACjC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,MAAM;GAClB;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,UAAU;AACtB,IAAE,QAAQ,EAAE,qBAAqB;GACjC;AAGF,GAAE,KAAK,mBAAmB;AACxB,IAAE,QAAQ,EAAE,eAAe;AAC3B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,GAAG;AACf,KAAE,SAAS,EAAE,UAAU;IACvB;GACF;AAGF,GAAE,KAAK,iBAAiB;AACtB,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,MAAM;GAClB;AAGF,GAAE,KAAK,mCAAmC;AACxC,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,QAAQ,EAAE,sBAAsB;AAClC,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,QAAQ;IACpB;AACF,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,QAAQ;IACpB;GACF;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,aAAa;AACzB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,UAAU;IACtB;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,KAAK;GACL,YAAY,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,OAAO,KAAK;GAC1D,WAAW;AACT,MAAE,QAAQ,EAAE,UAAU;AACtB,MAAE,SAAS,EAAE,SAAS;;GAEzB,CAAC;GACF;AAGF,GAAE,KAAK,kBAAkB;AACvB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,yBAAyB,EAAE,EACpD,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE,CAC3C,CAAC;GACF;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,UAAU;GACtB;AAGF,GAAE,KAAK,wBAAwB;AAI7B,IAAE,QAAQ,EAAE,QAAQ;GACpB;;;;;ACpfJ,SAAgB,YAAY,GAAG,GAAG;AAEhC,GAAE,KAAK,oBAAoB;AACzB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE,EAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,sBAAsB,EAAE,CAClD,CAAC;GACF;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,iBAAiB;AAC7B,IAAE,QAAQ,EAAE,MAAM;AAClB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,2BAA2B,EAAE;GACtD,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE;GACvC,CAAC;GACF;AAEF,GAAE,KAAK,oCAAoC;AACzC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,oBAAoB;IAChC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,GAAG,CACH;GACE,YAAY;IACV,MAAM,cAAc,KAAK,GAAG,EAAE,CAAC;IAC/B,MAAM,kBAAkB,KAAK,GAAG,EAAE,CAAC;AACnC,YACG,aAAa,aAAa,EAAE,WAAW,IACtC,aAAa,aAAa,EAAE,WAAW,MACxC,aAAa,iBAAiB,EAAE,OAAO,IACtC,aAAa,iBAAiB,EAAE,MAAM;;GAG5C,WAAW,EAAE,QAAQ,EAAE,2BAA2B;GACnD,EACD,EAAE,WAAW,EAAE,QAAQ,EAAE,0BAA0B,EAAE,CACtD,CAAC;GACF;AAEF,GAAE,KAAK,oCAAoC;AACzC,IAAE,QAAQ,EAAE,uBAAuB;AACnC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,uBAAuB;IACpC;GACF;AAEF,GAAE,KAAK,mCAAmC;AACxC,IAAE,QAAQ,EAAE,sBAAsB;AAClC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,sBAAsB;IACnC;GACF;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE,EAClD,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE,CACnD,CAAC;GACF;AAEF,GAAE,KAAK,gCAAgC;AACrC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,iBAAiB;IAC7B;AACF,IAAE,QAAQ,EAAE,oBAAoB;AAChC,IAAE,QAAQ,EAAE,qBAAqB;GACjC;AAGF,GAAE,KAAK,6BAA6B;AAClC,IAAE,GAAG;GACH,KAAK,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,EACrC,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAI,EAAE,CAChC;GACD,oBAAoB;GACrB,CAAC;GACF;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,CACvC,CAAC;GACF;AAGF,GAAE,KAAK,oBAAoB;AACzB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,CAClC,CAAC;GACF;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,QAAQ,EAAE,iBAAiB;AAC7B,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,aAAa;AACzB,KAAE,QAAQ,EAAE,WAAW;AACvB,KAAE,QAAQ,EAAE,MAAM;AAElB,KAAE,SAAS,EAAE,WAAW;IACxB;GACF;AAEF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,QAAQ,EAAE,gBAAgB;AAC5B,IAAE,WAAW;AACX,KAAE,GAAG;IACH,KAAK;KACH,EACE,WAAW;AACT,QAAE,QAAQ,EAAE,WAAW;AACvB,QAAE,IAAI,CACJ,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,EACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,CAC1C,CAAC;QAEL;KACD,EACE,WAAW;AACT,QAAE,QAAQ,EAAE,mBAAmB;AAC/B,QAAE,SAAS,EAAE,WAAW;QAE3B;KAGD;MAGE,YACE,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,KAAK,IACvC,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,QAAQ;MAC5C,WAAW;AACT,SAAE,QAAQ,EAAE,cAAc;AAC1B,SAAE,SAAS,EAAE,gBAAgB;;MAEhC;KACD,EACE,WAAW;AACT,QAAE,QAAQ,EAAE,eAAe;AAC3B,QAAE,SAAS,EAAE,gBAAgB;QAEhC;KACF;IACD,oBAAoB;IACrB,CAAC;IACF;GACF;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,oBAAoB;IAChC;AACF,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,oBAAoB;IAChC;GACF;AAGF,GAAE,KAAK,qCAAqC;AAC1C,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,gCAAgC;IAC5C;AACF,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,oBAAoB;IAChC;GACF;AAGF,GAAE,KAAK,iBAAiB;AACtB,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,cAAc;IAC1B;GACF;AAEF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE;GACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;GAChC,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;GAChC,EAAE,WAAW,EAAE,QAAQ,EAAE,yCAAyC,EAAE;GACpE,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE;GACxC,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE;GAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,sBAAsB,EAAE;GACjD,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE;GACzC,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE;GAC5C,CAAC;GACF;AAEF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,GAAG;GACH,EACE,WAAW;AACT,MAAE,QAAQ,EAAE,IAAI;AAChB,MAAE,IAAI;KACJ,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE;KAChC,EACE,WAAW,EAAE,QAAQ,EAAE,2CAA2C,EACnE;KACD,EACE,WAAW;AACT,QAAE,aAAa;AACb,SAAE,QAAQ,EAAE,cAAc;QAC1B;AACF,QAAE,QAAQ,EAAE,WAAW;QAE1B;KACD,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE;KAC7C,CAAC;MAEL;GACD,EAAE,WAAW,EAAE,QAAQ,EAAE,uBAAuB,EAAE;GAClD,EAAE,WAAW,EAAE,QAAQ,EAAE,mBAAmB,EAAE;GAC9C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE;GAC7C,EAAE,WAAW,EAAE,QAAQ,EAAE,sBAAsB,EAAE;GAClD,CAAC;GACF;AAIF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,sBAAsB;AAElC,IAAE,KAAK;GAEL,YAAY;IACV,MAAM,gBAAgB,EAAE,GAAG,EAAE;AAC7B,WAAO,EACL,aAAa,eAAe,EAAE,MAAM,IACpC,aAAa,eAAe,EAAE,KAAK,IACnC,aAAa,eAAe,EAAE,IAAI,IAClC,aAAa,eAAe,EAAE,cAAc,IAC5C,aAAa,eAAe,EAAE,UAAU,IACxC,aAAa,eAAe,EAAE,oBAAoB,IAClD,aAAa,eAAe,EAAE,uBAAuB;;GAGzD,WAAW;AACT,MAAE,QAAQ,EAAE,IAAI;AAChB,MAAE,SAAS,EAAE,qBAAqB;;GAErC,CAAC;AAGF,IAAE,OAAO;GAGP,YACE,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,GAAG,IACrC,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,QAAQ;GAC5C,WAAW;AACT,MAAE,QAAQ,EAAE,KAAK;;GAEpB,CAAC;GACF;AAQF,GAAE,KAAK,8BAA8B;AACnC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AAEF,IAAE,aAAa,EAAE,SAAS,EAAE,cAAc,CAAC;AAE3C,IAAE,QAAQ,EAAE,uBAAuB;GACnC;AAEF,GAAE,KAAK,gCAAgC;AACrC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EACtC,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,CAClC,CAAC;EAEF,IAAI,uBAAuB;AAK3B,MAAI,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,KAAK,CACzC,wBAAuB,KAAK,oBAAoB,EAAE,qBAAqB;AAGzE,IAAE,QAAQ;GAKR,YAAY;GACZ,WAAW;AACT,MAAE,SAAS,EAAE,cAAc;;GAE9B,CAAC;GACF;AAEF,GAAE,KAAK,+BAA+B;AACpC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AAEF,IAAE,QAAQ,EAAE,uBAAuB;GACnC;AAEF,GAAE,KAAK,+BAA+B;AACpC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,wBAAwB,EAAE,EACnD,EAAE,WAAW,EAAE,QAAQ,EAAE,4BAA4B,EAAE,CACxD,CAAC;GACF;AAEF,GAAE,KAAK,iCAAiC;AACtC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,gBAAgB;GAC5B;AAEF,GAAE,KAAK,qCAAqC;AAC1C,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,gBAAgB;IAC5B;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE,EAC5C,EAAE,WAAW,EAAE,QAAQ,EAAE,4BAA4B,EAAE,CACxD,CAAC;GACF;AAEF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,wBAAwB,EAAE,EACnD,EAAE,WAAW,EAAE,QAAQ,EAAE,2CAA2C,EAAE,CACvE,CAAC;GACF;AAGF,GAAE,KAAK,oDAAoD;AACzD,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,cAAc;IAC1B;AACF,IAAE,QAAQ,EAAE,kCAAkC;AAC9C,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,UAAU;IACtB;GACF;AAGF,GAAE,KAAK,2CAA2C;AAChD,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,YAAY;AACZ,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,YAAY;AACZ,MAAE,SAAS,EAAE,WAAW;KACxB;AACF,KAAE,SAAS,EAAE,WAAW;IACxB;AACF,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,uBAAuB;IACnC;GACF;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,EACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,CAC1C,CAAC;GACF;AAEF,GAAE,KAAK,iBAAiB;AACtB,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,QAAQ;GACpB;AAGF,GAAE,KAAK,gCAAgC;AACrC,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,aAAa;IACzB;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,sBAAsB;AAC3B,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,WAAW;IACxB;GACF;AAGF,GAAE,KAAK,iCAAiC;AACtC,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,EACzC,EAAE,WAAW,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CACjD,CAAC;AAEF,IAAE,IAAI,CACJ,EACE,WAAW,EAAE,QAAQ,EAAE,gDAAgD,EACxE,EACD,EAAE,WAAW,EAAE,QAAQ,EAAE,mCAAmC,EAAE,CAC/D,CAAC;GACF;AAGF,GAAE,KAAK,yDAAyD;AAC9D,IAAE,QAAQ,EAAE,SAAS;AACrB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,KAAK;IACjB;GACF;AAGF,GAAE,KAAK,4CAA4C;AACjD,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,iBAAiB;GAC7B;AAGF,GAAE,KAAK,kBAAkB;AACvB,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,KAAK;GAKL,YAAY,aAAa,EAAE,GAAG,EAAE,CAAC,WAAW,EAAE,QAAQ,KAAK;GAC3D,WAAW,EAAE,SAAS,EAAE,QAAQ;GACjC,CAAC;GACF;AAGF,GAAE,KAAK,iBAAiB;AACtB,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,WAAW;IACvB;AACF,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,QAAQ;GACpB;AAGF,GAAE,KAAK,4BAA4B;AACjC,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,QAAQ;AACpB,KAAE,QAAQ,EAAE,QAAQ;IACpB;AACF,IAAE,QAAQ,EAAE,IAAI;AAChB,IAAE,QAAQ,EAAE,MAAM;GAClB;AAGF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,QAAQ;AACpB,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,QAAQ,EAAE,QAAQ;GACpB;AAGF,GAAE,KAAK,+BAA+B;AACpC,IAAE,QAAQ,EAAE,WAAW;AACvB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,cAAc;IAC1B;AAEF,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,EAItC,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAI,EAAE,CAChC,CAAC;GACF;AAEF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,GAAG;GACH,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE;GACpC,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE;GACzC,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE;GACtC,CAAC;GACF;AAEF,GAAE,KAAK,kBAAkB;AACvB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE,EAC1C,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAC9C,CAAC;GACF;AAEF,GAAE,KAAK,wBAAwB;AAC7B,IAAE,QAAQ,EAAE,oBAAoB;AAChC,IAAE,QAAQ,EAAE,mBAAmB;AAC/B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,kBAAkB;AAC9B,KAAE,SAAS,EAAE,mBAAmB;IAChC;AACF,IAAE,QAAQ,EAAE,kBAAkB;GAC9B;AAEF,GAAE,KAAK,2BAA2B;AAChC,IAAE,QAAQ,EAAE,uBAAuB;AACnC,IAAE,QAAQ,EAAE,mBAAmB;AAC/B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,qBAAqB;AACjC,KAAE,SAAS,EAAE,mBAAmB;IAChC;AACF,IAAE,QAAQ,EAAE,qBAAqB;GACjC;AAEF,GAAE,KAAK,4BAA4B;AACjC,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,WAAW;IACvB;GACF;AAGF,GAAE,KAAK,iBAAiB;AACtB,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,EACvC,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,CAC1C,CAAC;GACF;AAGF,GAAE,KAAK,qBAAqB;AAC1B,IAAE,QAAQ,EAAE,0BAA0B,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;GACvD;AAGF,GAAE,KAAK,uBAAuB;AAC5B,IAAE,QAAQ,EAAE,cAAc;AAC1B,IAAE,QAAQ,EAAE,OAAO;AACnB,IAAE,aAAa;AACb,KAAE,QAAQ,EAAE,qBAAqB;IACjC;AACF,IAAE,QAAQ,EAAE,OAAO;GACnB;AAGF,GAAE,KAAK,8BAA8B;AACnC,IAAE,QAAQ,EAAE,iBAAiB;AAC7B,IAAE,WAAW;AACX,KAAE,QAAQ,EAAE,MAAM;AAClB,KAAE,SAAS,EAAE,iBAAiB;IAC9B;GACF;AAGF,GAAE,KAAK,0BAA0B;AAC/B,IAAE,GAAG,CACH,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,EACnC,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAC5C,CAAC;GACF;AAGF,GAAE,KAAK,yBAAyB;AAC9B,IAAE,QAAQ,EAAE,WAAW;GACvB;AAGF,GAAE,KAAK,eAAe;AACpB,IAAE,QAAQ,EAAE,KAAK;AACjB,IAAE,QAAQ,EAAE,WAAW;GACvB;AAEF,GAAE,KAAK,8BAA8B;EACnC,IAAI,SAAS;AACb,IAAE,QAAQ,EAAE,cAAc;EAG1B,MAAM,UAAU,EAAE,aAAa;AAC7B,KAAE,QAAQ,EAAE,KAAK;IACjB;EAEF,MAAM,4BAA4B,KAAK,GAAG,EAAE,CAAC;AAC7C,MAAI,aAAa,2BAA2B,EAAE,WAAW,CACvD,UAAS;WAIF,QACP,UAAS;AAIX,IAAE,cAAc;AACd,KAAE,QAAQ,EAAE,IAAI;AAChB,KAAE,QAAQ,EAAE,qBAAqB;IACjC;AAEF,MAAI,WAAW,OACb,QAAO;EAGT,MAAM,2BAA2B,KAAK,GAAG,EAAE,CAAC;AAC5C,SAAO,aAAa,0BAA0B,EAAE,WAAW;GAC3D;;AAGJ,SAAgB,6CAA6C;AAS3D,QARyC,KAAK,qBAC5C,+BACA,EAAE,CACH,CACqD,KACpD,MAAK,EAAE,cACR,CAEmB,QAAQ,GAAG,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/mB7D,IAAqB,aAArB,cAAwC,UAAU;CAChD,cAAc;AACZ,QAAM,WAAW;GACf,mBAAmB,IAAI,wBAAwB,EAC7C,SAAS,oBAAoB,SAAS,KAAK,QAC5C,CAAC;GACF,sBAAsB;GAEtB,iBAAiB,oBAAoB;GACtC,CAAC;EAEF,MAAM,IAAI;AAMV,IAAE,KAAK,wBAAwB;AAE7B,KAAE,QAAQC,gBAAE,WAAW;IACvB;AAGF,gBAA6B,KAAK,MAAM,GAAGA,gBAAE;AAC7C,gBAAiC,KAAK,MAAM,GAAGA,gBAAE;AACjD,gBAAkB,KAAK,MAAM,GAAGA,gBAAE;AAClC,gBAAoB,KAAK,MAAM,GAAGA,gBAAE;AACpC,gBAA4B,KAAK,MAAM,GAAGA,gBAAE;AAC5C,gBAAuB,KAAK,MAAM,GAAGA,gBAAE;AACvC,gBAAmB,KAAK,MAAM,GAAGA,gBAAE;AACnC,gBAA6B,KAAK,MAAM,GAAGA,gBAAE;AAC7C,cAAwB,KAAK,MAAM,GAAGA,gBAAE;AAExC,OAAK,sCAAsC,EAAE;AAC7C,OAAK,qBAAqB;AAC1B,OAAK,iFACoD,KAAK,KAAK;;CAGrE,mBAAmB,eAAe,UAAU;AAC1C,MAAI,KAAK,gBAAgB,CACvB;AAEF,QAAM,mBAAmB,eAAe,SAAS;;CAGnD,oBAAoB,YAAY,WAAW,OAAO;AAChD,SAAO,KAAK,aAAa;AACvB,QAAK,oBAAoB,KAAK,EAAE;GAEhC,MAAM,WAAW,KAAK,gBAAgB;AACtC,OAAI;IAEF,MAAM,EAAE,UAAU,0BAA0B;AAC5C,QAAI;AACF,UAAK,0BACH,KAAK,oBAAoB,WACzB,UACA,KAAK,WACN;AACD,YAAO,sBAAsB,KAAK,KAAK;aAChC,GAAG;AACV,YAAO,KAAK,gBAAgB,GAAG,YAAY,OAAU;cAC7C;AACR,UAAK,wBAAwB;;YAExB,GAAG;AACV,QAAI,uBAAuB,EAAE,CAC3B,QAAO;AAET,UAAM;aACE;AACR,SAAK,iBAAiB,SAAS;AAC/B,SAAK,oBAAoB,KAAK;;IAEhC;;;;;;AC7GN,MAAM,SAAS,IAAI,YAAY;AAE/B,MAAa,qBAAqB,OAAO,8BAA8B;AACvE,MAAa,iCACX,OAAO,0CAA0C;AAEnD,SAAgB,YAAY,WAAW,aAAa,mBAAmB;CAErE,MAAM,YAAYC,cAAU,SAAS,UAAU;AAE/C,KAAI,UAAU,OAAO,SAAS,GAAG;EAC/B,MAAM,aAAa,UAAU,OAAO;AACpC,QAAM,MACJ,oDACE,WAAW,OACX,eACA,WAAW,SACX,QACA,WAAW,QACd;;CAGH,MAAM,SAAS,UAAU;AACzB,QAAO,QAAQ;CAGf,MAAM,MAAM,OAAO,aAAa;AAEhC,KAAI,OAAO,OAAO,SAAS,GAAG;EAC5B,MAAM,QAAQ,OAAO,OAAO;AAC5B,QAAM,MACJ,qDACE,MAAM,MAAM,YACZ,eACA,MAAM,MAAM,cACZ,QACA,MAAM,UACN,WACA,MAAM,QAAQ,UAAU,KAAK,QAAS,CACzC;;AAGH,KAAI,WAAW,UAAU,OAAO;AAEhC,QAAO;EAAE;EAAK;EAAQ;;AAGxB,SAAgB,MAAM,WAAW,aAAa,mBAAmB;AAC/D,QAAO,YAAY,WAAW,WAAW,CAAC;;;;;AClC5C,MAAM,EAAE,gBAAO,sBAAU,oBAAS,kBAAQ,cAAM,cAAM,yBAAa;AAEnE,SAAgB,eAGd,KAAQ,SAAe;CACvB,MAAMC,SAAO,YAAY,KAAK,QAAQ;AACtC,KAAIA,OAAK,WAAW,EAClB,QAAOA,OAAK;AAEd,OAAM,IAAI,MACRA,OAAK,SAAS,IACV,oCAAoCA,WACpC,wBACL;;AAGH,SAAgB,YAGd,KAAQ,SAAe;AACvB,SAAQ,WAAY,OAAO,KAAK,IAAI,EAAU,QAC5C,QAAO,IAAI,SAAS,OACrB;;AAGH,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC,QAAQ,OAAK,MAAM,UAAUC,MAAI,IAAI,MAAM,MAAM,kBAAE,IAAI,KAAqB,CAAC;AAE/E,SAAgB,mBAId,MACA,OACA,eACA,UACA,oBAAoB,OACpB;CACA,MAAM,yBAAgC,EAAE;CACxC,MAAM,iBAA2B,EAAE;CACnC,MAAM,kBAAyB,EAAE;AACjC,MACE,OACA,iBAAgB;EACd,MAAM,EAAE,aAAa,aAAa;EAClC,MAAM,WAAW,MAAM,aAAa;AACpC,MAAI,SAAS,WACX,EAAC,eAAe,SAAS,kBAAkB,wBAAwB,KACjE,SACD;OACI;AACL,kBAAe,KAAK,SAAmB;AACvC,0BAAuB,KAAK,GAAG,gBAAgB;AAC/C,mBAAgB,SAAS;;IAG7B,cACD;AACD,KAAI,mBAAmB;AACrB,yBAAuB,KAAK,GAAG,gBAAgB;AAC/C,kBAAgB,SAAS;;AAE3B,gBAAe,MACZ,GAAG,MAAM,gBAAgB,IAAI,EAAE,GAAI,gBAAgB,IAAI,EAAE,CAC3D;AACD,QAAOC,OAAKC,YAAU,CACpB,GAAG,wBACHD,OAAK,KAAK;EAAC,GAAG;EAAgB,GAAG;EAAiB;EAAS,CAAC,CAC7D,CAAC;;AAGJ,SAAgB,0BAA0B,WAA2B;CACnE,IAAI,gBAAgB;CACpB,IAAI,mBAAmB;AACvB,MAAK,MAAM,YAAY,UACrB,KAAI,SAAS,SAAS,WACpB,iBAAgB;UACP,cACT,QAAO;KAEP,oBAAmB;AAGvB,QAAO,iBAAiB,CAAC;;AAG3B,SAAgB,KAKd,MACA,UACA,OACA;AACA,QAAO,KAAK,IAAI,UAAU,YAAY,MAAM,CAAC;;AAG/C,SAAgB,KAId,MACA,UACA,OACA;AACA,KAAI,KAAK,KAAK,SAAS,OACrB,MAAK,KAAK,UAAU,YAAY,MAAM;;AAI1C,SAAgB,IAKd,MACA,UACA,OACA;AACA,QAAO,KAAK,KAAK,SAAS,SAAS,KAAK,IAAI,UAAU,YAAY,MAAM,GAAG,EAAE;;AAG/E,SAAgB,QAKd,MACA,UACA,UACA;AACA,QAAO,SACJ,SAAQ,UACP,IAAI,MAAM,UAAU,MAAM,CAAC,KAAK,KAAK,UAAU;EAC7C,MAAM,OAAO,KAAK,KAAK,SAAS,OAAO;AACvC,SAAO;GACL;GACA,aAAaE,eAAO,SAAS,KAAK;GACnC;GACD,CACH,CACA,MAAM,GAAG,MAAM,EAAE,cAAc,EAAE,YAAY,CAC7C,KAAK,EAAE,UAAU,IAAI;;AAG1B,SAAgB,YACd,MACA,OACA,GACA,MACA;AACA,QAAO,KACL,OACA,cAAa,MAAM,WAAW,KAAK,EACnC,eAAe,KAAK,KAAK,SAAS,CACnC;;AAGH,SAAgB,sBAAsB,MAAuB;CAC3D,MAAM,EAAE,UAAU,aAAa;AAC/B,QAAO,WACH,KAAK,IAAI,SAAS,WAAW,SAAS,GAAG,UAAU,GACnD,SAAS;;AAGf,SAAgB,oBAAoB,MAAuB;CACzD,MAAM,EAAE,UAAU,aAAa;AAC/B,QAAO,WACH,KAAK,IAAI,SAAS,SAAS,SAAS,GAAG,GAAG,CAAE,QAAQ,GACpD,SAAS;;AAGf,SAAgB,sBAAsB,MAAgC;AACpE,KAAI,CAAC,KAAK,KAAK,SACb,QAAO,EAAE;CAEX,MAAM,WAAkB,EAAE;AAC1B,MAAK,MAAK,gBAAe;EACvB,MAAM,UAAU,YAAY;AAC5B,MAAI,QAAQ,WAAW,QAAQ,SAC7B;AAEF,UAAQ,UAAU;AAClB,WAAS,KAAK,aAAa,QAAQ,CAAC;IACnC,WAAW;AACd,QAAOF,OAAKC,YAAU,SAAS;;AAGjC,SAAgB,aAAa,MAAoB;CAC/C,MAAM,EAAE,UAAU;CAClB,MAAM,QAAQ,MAAM,MAAM,KAAK,CAAC,KAAI,WAAQE,OAAK,MAAM,CAAC;AACxD,QAAO,MAAM,SAAS,KACpB,MAAM,GAAG,WAAW,KAAK,IACzB,MAAM,MAAM,EAAE,CAAC,OAAM,WAAQA,OAAK,WAAW,IAAI,CAAC,IAClD,MAAM,GAAG,GAAG,CAAE,SAAS,KAAK,GAC1BH,OACEC,YACA,MAAM,KAAK,QAAM,UAAW,UAAU,IAAIE,SAAO,IAAIA,SAAQ,CAC9D,GACD;;AAGN,SAAgB,mBAAmB,MAAgB;AACjD,QAAO,KAAK,UAAU,MAAM,EAAE,cAAc,QAAQ,IAAI;;AAG1D,SAAgB,oBACd,UACA,MACA;AACA,QAAO,CAAC,MAAM,QAAQ,SAAS,IAAI,SAAS,SACxCC,QAAM;EAAC;EAAKC,SAAO,CAACC,YAAU,SAAS,CAAC;EAAEA;EAAU;EAAI,EAAE,KAAK,GAC/D;;AAGN,SAAgB,sBAGd,MAAkB,OAAoB,SAA4B,OAAU;AAC5E,KAAI,EAAE,SAAS,SAAS,KAAK,KAAK,WAAW;EAC3C,MAAM,mBAAmB,sBAAsB,KAAK;AACpD,SAAO,iBAAiB,SACpB;GAAC;GAAKD,SAAO,CAACJ,YAAU,GAAG,iBAAiB,CAAC;GAAEA;GAAU;GAAI,GAC7D;;CAEN,MAAM,OAAO,CAAC,KAAK,MAAM,OAAO,MAAM,CAAC;AACvC,KAAI,QAAQ,kBAAkB,OAC5B,MAAK,KAAKM,UAAQ,IAAI,CAAC;AAEzB,QAAO,KAAK,SAASH,QAAM;EAAC;EAAKC,SAAO,CAACF,QAAM,GAAG,KAAK,CAAC;EAAEA;EAAM;EAAI,CAAC,GAAG;;AAG1E,SAAgB,WAAW,MAAgC,UAAiB;AAC1E,KAAI,SAAS,OACX,QAAOC,QAAM;EACX;EACAC,SAAO,CAACJ,YAAU,GAAGD,OAAKC,YAAU,SAAS,CAAC,CAAC;EAC/CA;EACA;EACD,CAAC;CAEJ,MAAM,mBAAmB,sBAAsB,KAAK;AACpD,KAAI,iBAAiB,OACnB,QAAO;EAAC;EAAKI,SAAO,CAACJ,YAAU,GAAG,iBAAiB,CAAC;EAAEA;EAAU;EAAI;CAEtE,MAAM,SAAS,KAAK;CACpB,MAAM,cAAc,KAAK,QAAQ,EAAE;CACnC,MAAM,mBAAmB,KAAK,QAAQ,EAAE;AACxC,QAAQ,aAAa,SAAS,aAC5B,YAAY,SAAS,YAAY,WAAW,MAC3C,kBAAkB,SAAS,kBAC1B,kBAAkB,SAAS,gCAC7B,CAAC,iBAAiB,SAAS,WAC1B,oBACC;EACE;EACA;EACA;EACA;EACD,CAAC,SAAS,iBAAiB,KAAK,IACnC;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC,SAAS,KAAK,KAAK,KAAK,IACzB,UACC;EACE;EACA;EACA;EACA;EACA;EACD,CAAC,SAAS,OAAO,KAAK,GACvB,OACA;EAAC;EAAKA;EAAU;EAAI;;AAG1B,SAAgB,UACd,MACA,OACA;AACA,QAAOD,OAAK,KAAK,IAAI,MAAM,OAAO,aAAa,CAAC;;AAGlD,SAAgB,UAGd,MAAkB,OAAoB,OAAU;AAChD,QAAOA,OAAK,CAAC,KAAKG,OAAK,EAAE,IAAI,MAAM,OAAO,MAAM,CAAC;;AAGnD,SAAgB,kBACd,MACA,OACA;AACA,QAAOC,QAAM,CAAC,WAAWC,SAAO,CAACF,QAAM,UAAU,MAAM,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC;;AAG/E,SAAgB,eACd,MACA,OACA;CACA,MAAM,EAAE,aAAa,KAAK;AAC1B,QAAO,YAAY,UAAU;EAAC;EAAc;EAAc;EAAgB,CAAC,CACxE,SAAQ,UACP,SAAS,OAAQ,KAAK,MAAM,WAAW;EACrC;EACA;EACA,aAAaD,eAAO,SAAS,KAAK;EACnC,EAAE,CACJ,CACA,MAAM,GAAG,MAAM,EAAE,cAAc,EAAE,YAAY,CAC7C,SAAS,EAAE,OAAO,OAAO,cAAc,OAAO,UAAU;EACvD,MAAM,OAAO,SAAS,OAAQ;EAC9B,MAAM,OAAO,MAAM,GAAG,QAAQ,EAAE;EAChC,MAAM,WAAW,QAAQ,SAAS,KAAK,OAAQ,KAAK;EACpD,MAAM,OAAO,CAAC,KAAK,KAAK,OAAO,YAAY,OAAO,WAAW,CAAC;AAC9D,MAAI,UACF;OAAI,cAAc,KAAK,CACrB,MAAK,KAAK,KAAK,SAAS,eAAe,MAAM,IAAI;YACxC,WAAW,SAAS,IAAI,SAAS,SAAS,aACnD,MAAK,KAAK,IAAI;;AAGlB,SAAO;GACP;;AAGN,SAAgB,mBAAmB,YAA+B;CAChE,MAAM,wBACJ,WAAW,SAAS,wBAAwB,GAAG;AACjD,KAAI,CAAC,sBACH,QAAO;AAGT,KADkB,sBAAsB,iBAAiB,OAEvD,QAAO;AAET,QAAO,0BAA0B,sBAAsB,iBAAiB,GAAG;;AAG7E,SAAgB,uBACd,kBACA;AACA,QAAO,iBAAiB,SAAS,uBAAuB;;AAG1D,SAAgB,0BACd,kBACA;AACA,QAAO,OAAO,KAAK,iBAAiB,SAAS,CAAC,MAAK,SACjD;EAAC;EAAkB;EAAc;EAAgB,CAAC,SAAS,KAAK,CACjE;;AAGH,SAAgB,eAAe,OAAiB;AAC9C,QAAO,MAAM,SACT,KAAK,IACH,GAAG,MAAM,KAAI,WAAQC,OAAK,OAAO,KAAK,CAAC,CAAC,QAAO,aAAUE,YAAU,EAAE,CACtE,GACD;;AAGN,SAAgB,iBAAiB,WAA6B;AAC5D,QACE,UAAU,SAAS,uCAAuC,GAAG,SAC1D,mBAAmB;;AAI1B,SAAgB,cAAc,MAA2C;AACvE,QAAO,CAAC,WAAW,KAAK;;AAG1B,SAAgB,WAAW,MAAkC;AAC3D,QAAO,eAAe;;;;;AChZxB,MAAM,4CAA4B,IAAI,SAGnC;AAEH,SAAgB,8BAA8B,KAAsB;CAClE,MAAM,EAAE,aAAa;AACrB,KAAI,CAAC,SACH;CAEF,MAAM,SAAS,SACZ,QAAQ,EAAE,YACT,8IAA8I,KAC5I,MACD,CACF,CACA,QAAQ,UAAQ,EAAE,OAAO,kBAAkB;EAC1C,MAAM,WAAWG,SAAO,GAAG,GAAG;AAC9B,MAAI,MAAM,SAAS,QAAQ,IAAI,MAAM,SAAS,MAAM,EAClD;OAAI,UAAU,QAAQ,SACpB,UAAO,KAAK;IAAE,OAAO;IAAa,KAAK;IAAU,CAAC;aAE3C,UAAU,QAAQ,SAC3B,UAAS,MAAM;AAEjB,SAAOA;IACN,IAAI,OAA4B,CAAC;AACtC,2BAA0B,IAAI,KAAK,OAAO;;AAG5C,SAAgB,6BAA6B,MAAyB;CACpE,MAAM,EAAE,MAAM,iBAAS;CACvB,MAAM,QAAQC,eAAO,SAAS,KAAK;CACnC,MAAM,MAAMA,eAAO,OAAO,KAAK;AAC/B,QACE,0BACG,IAAIC,OAAK,EACR,MAAK,UAAS,MAAM,QAAQ,SAAS,MAAM,MAAM,IAAI,KAAK;;AAIlE,SAAgB,iBAAiB,MAAgB;AAC/C,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,EAAE,cAAM,6BAAe,KAAK;AAClC,SACEC,WAAS,gBACTC,cAAY,MAAM,EAAE,mBAAWD,WAAS,iBAAiB,KAAK;;CAGlE,MAAM,EAAE,UAAU,SAAS;AAC3B,SAAQ,MAAR;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,uBACH,QAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aACH,QAAO,CAAC,SAAS;EACnB,KAAK,iBACH,QAAO,CAAC,SAAS,aAAa,CAAC,iBAAiB,SAAS,UAAU,GAAG;EACxE,KAAK,uBACH,QAAO,CAAC,SAAS,yBAAyB,GAAG,SAAS;EACxD,KAAK,wBACH,QAAO,CAAC,SAAS,uBAAuB,GAAG,SACxC,yBAAyB,GAAG,SAAS;EAC1C,KAAK,YACH,QAAO,CAAC,iBAAiB,KAAK;EAChC,KAAK,uCACH,QAAO,CAAC,SAAS;EACnB,QACE,QAAO;;;AAIb,SAAgB,kBACd,aACA,GACA,SACA;AACA,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC,MAAK,OAAM,GAAG,aAAa,QAAQ,CAAC;;AAGxC,SAAgB,uBAAuB,aAA0B;AAC/D,QAAO;EACL;EACA;EACA;EACA;EACD,CAAC,MAAK,OAAM,GAAG,YAAY,CAAC;;AAG/B,SAAS,+BACP,aACA,SACA;CACA,MAAM,EAAE,eAAe,eAAe,kBAAkB;AACxD,KAAI,eAAe,SAAS,oBAC1B;MAAI,iBAAiB,cAAc,EAAE;AACnC,OAAI,QAAQ,iCAAiC,QAC3C,MAAK,kBAAkB,eAAe,YAAY;OAElD,MAAK,mBAAmB,eAAe,YAAY;AAErD,UAAO;aAEP,QAAQ,iCAAiC,WACzC,iBAAiB,cAAc,EAC/B;AACA,QAAK,kBAAkB,eAAe,YAAY;AAClD,UAAO;;;AAGX,QAAO;;AAGT,SAAS,oCAAoC,aAA0B;CACrE,MAAM,EAAE,WAAW,SAAS,eAAe,eAAe,kBACxD;AACF,KACE,eAAe,SAAS,2BACxB,iBACA,iBACA,cAAc,cAAc,IAC5B,cAAc,cAAc,IAC5B,cAAc,SAAS,UAAU,aACjC,UAAU,cAAc,SAAS,WACjC;AACA,OAAK,kBAAkB,eAAe,YAAY;AAClD,SAAO;;AAET,QAAO;;AAGT,SAAS,2BAA2B,aAA0B;CAC5D,MAAM,EAAE,eAAe,kBAAkB;AACzC,KAAI,eAAe,SAAS,kBAAkB,eAAe;AAC3D,OAAK,kBAAkB,eAAe,YAAY;AAClD,SAAO;;AAET,QAAO;;AAGT,SAAS,0BAA0B,aAA0B;CAC3D,MAAM,EAAE,eAAe,kBAAkB;AACzC,KACE,eAAe,SAAS,iBACxB,iBACA,cAAc,cAAc,IAC5B,cAAc,SAAS,aACvB;AACA,OAAK,mBAAmB,eAAe,aAAa,OAAU;AAC9D,SAAO;;AAET,QAAO;;AAGT,SAAS,4BAA4B,aAA0B;CAC7D,MAAM,EAAE,eAAe,eAAe,kBAAkB;AACxD,KACE,iBACA,CAAC,iBACD,CAAC,iBACD;EAAC;EAAkB;EAAqB;EAAkB,CAAC,SACzD,cAAc,KACf,EACD;AACA,OAAK,mBAAmB,eAAe,YAAY;AACnD,SAAO;;AAET,QAAO;;AAGT,SAAS,+BAA+B,aAA0B;CAChE,MAAM,EAAE,eAAe,kBAAkB;AACzC,KACE,eAAe,SAAS,sBACxB,iBACA,WAAW,cAAc,IACzB,cAAc,UAAU,SAAS,cACjC;AACA,OAAK,kBAAkB,eAAe,YAAY;AAClD,SAAO;;AAET,QAAO;;AAGT,SAAS,+BAA+B,aAA0B;CAChE,MAAM,EAAE,kBAAkB;AAC1B,KACE,eAAe,SAAS,sBACxB,CAAC,cAAc,SAAS,qBACxB,CAAC,cAAc,SAAS,uBACxB,cAAc,SAAS,OAAO,GAAG,cAAc,YAAY,eAC3D,YAAY,cAAc,cAAc,SAAS,OAAO,GAAG,aAC3D;AACA,OAAK,mBAAmB,eAAe,aAAa,OAAU;AAC9D,SAAO;;AAET,QAAO;;AAGT,SAAS,mBAAmB,aAA0B;CACpD,MAAM,EAAE,eAAe,kBAAkB;AACzC,KACE,iBACA,iBACA,WAAW,cAAc,IACzB,cAAc,UAAU,SAAS,gBACjC;EACE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC,SAAS,cAAc,KAAK,EAC9B;AACA,OAAK,mBAAmB,eAAe,YAAY;AACnD,SAAO;;AAET,QAAO;;AAGT,SAAS,2BAA2B,aAA0B;CAC5D,MAAM,EAAE,eAAe,kBAAkB;AACzC,KACE,iBACA,CAAC,WAAW,eAAe,CAAC,SAAS,cAAc,KAAK,IACxD,iBACA,cAAc,cAAc,EAC5B;EACA,MAAME,WACJ,cAAc,SAAS,YACnB,cAAc,SAAS,YAAY,KACnC,cAAc,SAAS,iBACrB,cAAc,SAAS,YACvB,gBACA,OACL,SAAS,MAAM;AAClB,MAAI,CAACA,QACH,QAAO;EAET,MAAM,iBACJA,QAAM,SAAS,kBAAkB,GAAG,SAAS,eAAe;AAC9D,MAAI,eACF,MAAK,kBAAkB,gBAAgB,YAAY;MAEnD,MAAK,mBAAmBA,SAAO,aAAa,OAAU;AAExD,SAAO;;AAET,QAAO;;AAGT,SAAS,iBAAiB,MAAiB;AACzC,QACE,SAAS,WACR,cAAc,KAAK,GAChB,KAAK,SAAS,kBACd,KAAK,UAAU,YAAY,MACxB,EAAE,WAAW,SAAS,iBACxB;;;;;ACtRT,qBAAe;CACb,MAAM,MAAM,SAA4B;EACtC,MAAM,MAAM,MAAM,MAAM,QAAQ,WAAW;AAC3C,MAAI,UAAU,SAAQ,YAAW;AAC/B,WAAQ,QAAQ,QAAQ;IACxB;AACF,gCAA8B,IAAI;AAClC,SAAO;;CAET,WAAW;CACX,UAAU,MAAM;AACd,SAAO,8CAA8C,KAAK,KAAK;;CAEjE,SAAS,MAAM;AACb,SAAO,WAAW,KAAK,GAAG,KAAK,cAAc,KAAK,SAAS;;CAE7D,OAAO,MAAM;AACX,UAAQ,WAAW,KAAK,GAAG,KAAK,YAAY,KAAK,SAAS,aAAa;;CAE1E;;;;ACvBD,qBAAe;CACb,iBAAiB,MAAM,OAAO,SAAS;AACrC,SAAO,sBACL,MACA,OACA,SACA,0BACD;;CAGH,wBAAwB,MAAM,OAAO;AACnC,SAAO,UAAU,MAAM,OAAO,sBAAsB;;CAEvD;;;;ACCD,MAAM,EAAE,gBAAO,sBAAU,oBAAS,kBAAQ,cAAM,cAAM,yBAAa;AAEnE,oCAAe;CACb,MAAM,MAAM,OAAO;EACjB,MAAM,aAAa,KAAK,KAAK,SAAS,kBACjC,KAAK,MAAM,OAAO,kBAAkB,GACrC,EAAE;AACN,SAAO,WAAW,MAAM,WAAW,SAAS,CAAC,WAAW,GAAG,EAAE,CAAC;;CAGhE,gBAAgB,MAAM,OAAO;AAC3B,SAAOC,OACLC,YACA,IACE,OACA,kBAAiB;GACf,MAAM,EAAE,MAAM,aAAa;GAC3B,MAAM,YAAY,MAAM,cAAc;AACtC,UAAO,YACL,sBAAsB,KAAK,GAAG,oBAAoB,SAAS,GAAG,IAC5D,CAACA,YAAU,UAAU,GACrB;KAEN,iBACD,CAAC,QAAO,QAAO,QAAQ,GAAG,CAC5B;;CAGH,gBAAgB;CAEhB,kCAAkC,MAAM,OAAO;AAC7C,SAAO,CAAC,KAAK,MAAM,OAAO,2BAA2B,EAAE,IAAI;;CAG7D,yBAAyB,MAAM,OAAO;AAKpC,SAAO,mBAAmB,MAAM,OAAO,oBAJnBD,OAAK,KAAK,CAC5B,KAAK,MAAM,OAAO,oBAAoB,EACtC,KAAK,MAAM,OAAO,yBAAyB,CAC5C,CAAC,CACqE;;CAGzE,mBAAmB;CACnB,WAAW;CACX,sCAAsC;CAEtC,iBAAiB;AACf,SAAO;;CAGT,iBAAiB,MAAM,OAAO;AAC5B,SAAO;GACL,KAAK,MAAM,OAAO,aAAa;GAC/B;GACA,KAAK,MAAM,OAAO,YAAY;GAC/B;;CAGH,oBAAoB,MAAM,OAAO;AAC/B,SAAO,CAAC,KAAK,MAAM,OAAO,sBAAsB,EAAE,IAAI;;CAGxD,qBAAqB;CAErB,YAAY,MAAM,OAAO;EACvB,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,oBAAoB,iBAAiB,SAAS,UAAU,GAAG;EACjE,MAAM,aAAa,IAAI,MAAM,OAAO,YAAY;EAChD,MAAM,YAAmB;GACvB;GACA,oBAAoB,KAAK,MAAM,OAAO,aAAa,CAAC;GACpD,oBAAoB,MAAM,CAAC,KAAK,WAAW,GAAG;GAC/C;AACD,MAAI,SAAS,MAAM;GACjB,MAAM,mBAAmB,sBAAsB,KAAK;AACpD,OAAI,iBAAiB,OACnB,WAAU,KAAKC,YAAU,GAAG,kBAAkBA,WAAS;QAClD;IACL,MAAM,eACJ,SAAS,UAAU,GAAG,SACnB,uCAAuC,GAAG,SAAS,UACtD;AACF,cAAU,KAAK,eAAe,MAAMA,WAAS;;GAE/C,MAAM,wBAAwB,iBAAiB,SAAS,UAAU,GAAG;AACrE,aAAU,KACR,QACA,wBAAwB,MAAM,CAAC,KAAK,WAAW,GAAG,CACnD;;AAEH,SAAO;;CAGT,gBAAgB,MAAM,OAAO;AAC3B,SAAO;GAAC;GAAW,GAAGD,OAAK,CAAC,MAAM,EAAE,IAAI,MAAM,OAAO,aAAa,CAAC;GAAE;GAAI;;CAG3E,gBAAgB,MAAM,OAAO;AAC3B,SAAOA,OAAK,KAAK;GACf;GACA,oBAAoB,KAAK,MAAM,OAAO,aAAa,CAAC;GACpD,KAAK,MAAM,OAAO,cAAc;GACjC,CAAC;;CAGJ,YAAY,MAAM,OAAO;EACvB,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,WAAW,YAAY,UAAU,CACrC,6BACA,aACD,CAAC;AAEF,SAAO,WAAW,MADJ,SAAS,WAAW,IAAI,IAAI,MAAM,OAAO,SAAS,GAAG,GAAG,EAAE,CAC1C;;CAGhC,0BAA0B,MAAM,OAAO;EACrC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,cAAc,KAAK,MAAM,OAAO,cAAc;AACpD,MAAI,CAAC,SAAS,gBACZ,QAAO,CAAC,aAAa,IAAI;EAE3B,MAAM,kBAAkB,KAAK,MAAM,OAAO,kBAAkB;EAC5D,MAAM,aAAa,SAAS,gBAAgB,GAAG,SAAS;AAKxD,SAAO;GACL;GACA;GALA,WAAW,WAAW,KACtB,WAAW,GAAG,SAAS,YAAY,GAAG,SACnC,uCAAuC,GAAG,SAAS,UAAU,SAK5D,CAAC,KAAK,gBAAgB,GACtBE,SAAO,CAACD,YAAU,gBAAgB,CAAC;GACxC;;CAGH,YAAY,MAAM,OAAO;EACvB,MAAM,EAAE,aAAa,KAAK;AAC1B,MAAI,EAAE,SAAS,gBAAgB,SAAS,eAAe,SAAS,MAC9D,QAAO;EAET,MAAME,WAAgB,EAAE;AACxB,MAAI,SAAS,MAAM;AACjB,YAAO,KAAK,OAAO;AACnB,OAAI,SAAS,QACX,UAAO,KAAK,UAAU;SAEnB;GACL,MAAM,YAAY,eAAe,UAAU,CACzC,gBACA,cACD,CAAC;AACF,YAAO,KAAK,GAAG,IAAI,MAAM,OAAO,UAAU,CAAC;;EAE7C,MAAM,oBAAoBA,SAAO,SAAS;EAC1C,MAAM,QAAQ,oBACV,CAAC,QAAQD,SAAO,CAACE,QAAM,GAAGJ,OAAK,CAAC,KAAKI,OAAK,EAAED,SAAO,CAAC,CAAC,CAAC,GACtD,CAAC,SAASA,SAAO,GAAG;AACxB,SAAO,SAAS,QACZ,CACEE,QAAM,CAAC,GAAG,OAAO,oBAAoBD,SAAO,IAAI,CAAC,EACjD,KAAK,MAAM,OAAO,QAAQ,CAC3B,GACDC,QAAM,MAAM;;CAGlB,WAAW,MAAM,OAAO;EACtB,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,UAAU,eAAe,UAAU;GACvC;GACA;GACA;GACD,CAAC;EACF,MAAM,OAAO,KAAK,MAAM,OAAO,QAAQ;EACvC,MAAM,QAAQ,CAAC,KAAK,MAAM,OAAO,cAAc,EAAE,MAAM;AACvD,MAAI,YAAY,WAAW,mBAAmB,SAAS,SAAU,GAAG,CAClE,OAAM,KAAKH,SAAO,CAACD,YAAU,KAAK,CAAC,CAAC;MAEpC,OAAM,KAAK,KAAK,KAAK;AAEvB,MAAI,SAAS,UACX,OAAM,KAAK,IAAI;AAEjB,SAAO;;CAGT,cAAc;CACd,aAAa;CAEb,eAAe,MAAM,OAAO;EAC1B,MAAM,YAAY,KAAK,MAAM,OAAO,YAAY;EAChD,MAAM,oBAAoB,iBAAiB,KAAK,KAAK,SAAS,UAAU,GAAG;AAC3E,SAAO;GACL;GACA,oBAAoB,KAAK,MAAM,OAAO,aAAa,CAAC;GACpD,GAAG,CAAC,oBAAoB,MAAM,KAAK,UAAU;GAC9C;;CAGH,YAAY,MAAM,OAAO;AAEvB,SAAO;GACL;GAFwB,iBAAiB,KAAK,KAAK,SAAS,UAAU,GAAG,GAGrD,MAAM,CAAC,KAAK,KAAK,MAAM,OAAO,YAAY,CAAC;GAC/D;GACA,oBAAoB,KAAK,MAAM,OAAO,aAAa,CAAC;GACpD;GACD;;CAGH,cAAc;CAEd,kBAAkB,MAAM,OAAO;EAC7B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,mBAAmB,sBAAsB,KAAK;AACpD,MAAI,iBAAiB,OACnB,kBAAiB,KAAKA,WAAS;EAEjC,MAAM,cAAe;GAAC;GAAW;GAAc;GAAY,CAAW,KACpE,kBACE,iBAAiB,WAAW,KAAK,MAAM,OAAO,cAAc,GAAG,GAClE;EACD,MAAM,oBAAoB,iBAAiB,SAAS,UAAU,GAAG;AACjE,SAAO;GACL,GAAG;GACH;GACA,YAAY,MAAK,eAAc,eAAe,GAAG,GAC7C,oBAAoBD,OAAK,CAAC,KAAKI,OAAK,EAAE,YAAY,CAAC,GACnD;GACJ,oBAAoB,MAAM,CAAC,KAAK,KAAK,MAAM,OAAO,YAAY,CAAC;GAChE;;CAGH,SAAS;CACT,WAAW;CAEX,wBAAwB,MAAM,OAAO;AACnC,SAAOC,QACL,IAAI,MAAM,OAAO,sBAAsB,CAAC,KAAK,YAAY,UACvD,UAAU,IAAI,aAAa,CAAC,KAAKH,SAAO,CAACE,QAAM,WAAW,CAAC,CAAC,CAC7D,CACF;;CAGH,qBAAqB,MAAM,OAAO;EAChC,MAAM,gBAAgB,KAAK,KAAK,SAAS,UAAU;EACnD,MAAM,eAAe;GACnB,sBAAsB,KAAK;GAC3B;GACA;GACA,KAAK,MAAM,OAAO,2BAA2B;GAC7C;GACA,KAAK,MAAM,OAAO,aAAa;GAC/B;GACD;AACD,MAAI,iBAAiB,cAAc,CACjC,cAAa,KAAK,IAAI;OACjB;GACL,MAAM,oBACJ,cAAc,SAAS,uCAAuC,GAC3D,SAAS,UAAU;GACxB,MAAM,YAAY,KAAK,MAAM,OAAO,YAAY;AAChD,gBAAa,KACX,oBAAoB,CAAC,KAAK,UAAU,GAAGF,SAAO,CAACE,QAAM,UAAU,CAAC,CACjE;;AAEH,SAAOC,QAAM,aAAa;;CAG5B,eAAe,MAAM,OAAO;AAC1B,SAAO,KAAK,KAAK,SAAS,aACtB;GAAC;GAAU,KAAK,MAAM,OAAO,aAAa;GAAE;GAAI,GAChD;;CAGN,kBAAkB,MAAM,OAAO;AAC7B,SAAO,KAAK,KAAK,SAAS,aACtB;GAAC;GAAa,KAAK,MAAM,OAAO,aAAa;GAAE;GAAI,GACnD;;CAGN,gBAAgB,MAAM,OAAO;EAC3B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,YAAmB,CAAC,SAAS;AACnC,MAAI,SAAS,YAAY;AACvB,aAAU,KAAK,IAAI;GACnB,MAAM,aAAa,KAAK,MAAM,OAAO,aAAa;AAClD,OAAI,mBAAmB,SAAS,WAAW,GAAG,CAC5C,WAAU,KACRA,QAAM;IACJC,UAAQ,IAAI;IACZJ,SAAO,CAACK,YAAU,WAAW,CAAC;IAC9BA;IACAD,UAAQ,IAAI;IACb,CAAC,CACH;OAED,WAAU,KAAK,WAAW;;AAG9B,YAAU,KAAK,IAAI;AACnB,SAAO;;CAGT,eAAe,MAAM,OAAO;AAC1B,SAAO;GAAC;GAAU,KAAK,MAAM,OAAO,aAAa;GAAE;GAAI;;CAGzD,sBAAsB,MAAM,OAAO;AACjC,SAAO;GACL;GACA,oBAAoB,KAAK,MAAM,OAAO,aAAa,CAAC;GACpD;GACA,KAAK,MAAM,OAAO,QAAQ;GAC3B;;CAGH,aAAa,MAAM,OAAO;EACxB,MAAM,EAAE,aAAa,KAAK;AAC1B,MAAI,SAAS,0BACX,QAAO,KAAK,MAAM,OAAO,4BAA4B;EAEvD,MAAM,SAAS,CAAC,OAAO,KAAK,MAAM,OAAO,QAAQ,CAAC;AAClD,MAAI,SAAS,QACX,QAAO,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;AAE3C,MAAI,SAAS,QACX,QAAO,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;AAE3C,SAAON,OAAK,KAAK,OAAO;;CAG1B,QAAQ,MAAM,OAAO;AACnB,SAAOA,OAAK,KAAK,IAAI,MAAM,OAAO,cAAc,CAAC;;CAGnD,YAAY,MAAM,OAAO;AACvB,SAAO;GACL;GACA,oBAAoB,KAAK,MAAM,OAAO,uBAAuB,CAAC;GAC9D;GACA,KAAK,MAAM,OAAO,QAAQ;GAC3B;;CAGH,qBAAqB,MAAM,OAAO;AAChC,SAAOA,OAAK,KAAK;GACf,GAAG,IAAI,MAAM,OAAO,mBAAmB;GACvC,KAAK,MAAM,OAAO,YAAY;GAC9B,KAAK,MAAM,OAAO,uBAAuB;GAC1C,CAAC;;CAGJ,UAAU,MAAM,OAAO;AACrB,SAAOA,OACL,CAACI,QAAM,KAAK,EACZ,CAAC,KAAK,MAAM,OAAO,iBAAiB,EAAE,GAAG,IAAI,MAAM,OAAO,YAAY,CAAC,CACxE;;CAGH,QAAQ,MAAM,OAAO;AACnB,SAAO,CAAC,YAAY,KAAK,MAAM,OAAO,QAAQ,CAAC;;CAGjD,0BAA0B,MAAM,OAAO;EACrC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,SAAS;GACb;GACA,KAAK,MAAM,OAAO,wBAAwB;GAC1C,KAAK,MAAM,OAAO,QAAQ;GAC3B;AACD,MAAI,SAAS,QACX,QAAO,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;AAE3C,MAAI,SAAS,QACX,QAAO,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;AAE3C,SAAOJ,OAAK,KAAK,OAAO;;CAG1B,sBAAsB,MAAM,OAAO;EACjC,MAAM,YAAY,CAAC,KAAK,MAAM,OAAO,eAAe,CAAC;AACrD,MAAI,KAAK,KAAK,SAAS,UACrB,WAAU,KAAKM,UAAQ,IAAI,CAAC;AAE9B,SAAO,oBAAoB,UAAU;;CAGvC,aAAa,MAAM,OAAO;AACxB,SAAON,OAAK,CAAC,KAAKI,OAAK,EAAE,IAAI,MAAM,OAAO,WAAW,CAAC;;CAGxD,UAAU;CAEV,eAAe,MAAM,OAAO;AAC1B,SAAO;GAAC;GAAU,KAAK,MAAM,OAAO,aAAa;GAAE;GAAI;;CAGzD,gBAAgB;CACjB;;;;ACrYD,MAAM,EAAE,gBAAO,sBAAU,kBAAQ,gCAAe,cAAM,cAAM,yBAC1D;AAEF,sBAAe;CACb,iBAAiB,MAAM,OAAO;AAO5B,SAAO,mBAAmB,MAAM,OAAO,iBADnB,KAAK,MAAM,OALR,eAAe,KAAK,KAAK,UAAU;GACxD;GACA;GACA;GACD,CAAC,CACmD,EACgB,KAAK;;CAG5E,uBAAuB,MAAM,OAAO;EAClC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,iBAAiB,YAAY,UAAU;GAC3C;GACA;GACA;GACD,CAAC;EACF,MAAM,qBAAqB,eAAe,SAAS;EACnD,MAAM,oBAAoB,SAAS,mBAAmB;EACtD,MAAM,QAAQ,CAAC,UAAU,KAAK,MAAM,OAAO,iBAAiB,CAAC;AAC7D,MAAI,mBAAmB;GACrB,MAAM,iBAAiB,KAAK,MAAM,OAAO,iBAAiB;AAC1D,SAAM,KACJ,qBAAqBI,QAAMC,SAAO,eAAe,CAAC,GAAG,eACtD;;AAEH,MAAI,eAAe,QAAQ;GACzB,MAAM,YAAY,qBAAqB,CAAC,qBAAqB,MAAMC;GACnE,MAAM,UAAU,eAAe,SAAQ,WAAU,CAC/C,WACA,KAAK,MAAM,OAAO,OAAO,CAC1B,CAAC;GACF,MAAM,UACJ,SAAS,UAAU,GAAG,SAAS,yBAAyB;GAC1D,MAAM,cAAc,CAClB,qBAAqB,CAAC,qBAAqB,UAAUD,SAAO,QAAQ,EACpE,UAAU,YAAY,IACvB;AACD,SAAM,KAAK,qBAAqB,cAAcD,QAAM,YAAY,CAAC;QAEjE,OAAM,KAAK,IAAI;AAEjB,SAAO,CAACA,QAAM,MAAM,EAAE,KAAK,MAAM,OAAO,YAAY,CAAC;;CAGvD,eAAe;CAEf,eAAe,MAAM,OAAO;AAC1B,SAAO;GACL;GACAC,SAAO,CAACE,YAAU,KAAK,MAAM,OAAO,oBAAoB,CAAC,CAAC;GAC1DA;GACA;GACD;;CAGH,kBAAkB,MAAM,OAAO;AAC7B,SAAO,UAAU,MAAM,OAAO,gBAAgB;;CAGhD,aAAa,MAAM,OAAO;AACxB,SAAO,CAAC,YAAY,KAAK,MAAM,OAAO,YAAY,CAAC;;CAGrD,gBAAgB,MAAM,OAAO;AAC3B,SAAOH,QAAM,CACX,cACAC,SAAO,CAACC,QAAM,KAAK,MAAM,OAAO,oBAAoB,CAAC,CAAC,CACvD,CAAC;;CAGJ,cAAc;CAEd,kBAAkB,MAAM,OAAO;AAC7B,SAAO,UAAU,MAAM,OAAO,gBAAgB;;CAGhD,UAAU,MAAM,OAAO;AACrB,SAAO,WAAW,MAAM,2BAA2B,MAAM,MAAM,CAAC;;CAGlE,sBAAsB;CAEtB,uBAAuB,MAAM,OAAO;EAClC,MAAM,EAAE,aAAa,KAAK;AAC1B,SAAO,SAAS,YACZ,KACA,KAAK,MAAM,OAAO,eAAe,SAAS,CAAC;;CAGjD,iBAAiB,MAAM,OAAO;AAO5B,SAAO,mBAAmB,MAAM,OAAO,iBANnB;GAClB,KAAK,MAAM,OAAO,YAAY;GAC9B;GACA,KAAK,MAAM,OAAO,yBAAyB;GAC3C;GACD,CACmE;;CAGtE,eAAe;CAEf,uBAAuB,MAAM,OAAO;EAClC,MAAM,cAAc,IAAI,MAAM,OAAO,qBAAqB;AAC1D,SAAO,YAAY,SAAS,KAC1B,KAAK,KAAK,SAAS,mBAAmB,MACnC,EAAE,eAAe,SAAS,OAC5B,GACCF,QAAMC,SAAOG,OAAK,CAAC,KAAKF,OAAK,EAAE,YAAY,CAAC,EAAE,EAC5C,aACG,KAAK,QAAQ,EAAE,EAA6B,SAAS,WACzD,CAAC,GACFE,OAAK,MAAM,YAAY;;CAG7B,mBAAmB,MAAM,OAAO;EAC9B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,sBAAsB,SAAS,sBAAsB;EAC3D,MAAM,eAAe,KAAK,MAAM,OAAO,uBAAuB;AAC9D,MAAI,CAAC,oBACH,QAAO;EAET,MAAM,mBACJ,oBAAoB,SAAS,aAAa,GAAG,SAC1C,wBAAwB,GAAG,SAAS,iBAAiB;EAC1D,MAAM,aAAa;GAAC;GAAc;GAAK,KAAK,MAAM,OAAO,SAAS;GAAC;EACnE,MAAM,cAAc,KAAK,MAAM,OAAO,sBAAsB;AAC5D,MACE,mBAAmB,oBAAoB,IACtC,oBAAoB,0BAA0B,iBAAiB,CAEhE,YAAW,KAAKJ,QAAMC,SAAO,CAACC,QAAM,YAAY,CAAC,CAAC,CAAC;OAC9C;GACL,MAAM,UAAU,OAAO,aAAa;AACpC,cAAW,KACTF,QAAMC,SAAOC,OAAK,EAAE,EAAE,IAAI,SAAS,CAAC,EACpCG,gBAAc,aAAa,EAAE,SAAS,CAAC,CACxC;;AAEH,SAAOL,QAAM,WAAW;;CAG1B,qBAAqB,MAAM,OAAO;EAChC,MAAM,EAAE,MAAM,eAAe,KAAK,KAAK;AACvC,MAAI,WACF,QAAO;EAET,MAAM,aAAa,KAAK,MAAM,OAAO,aAAa;AAClD,SAAO,OAAO,CAAC,YAAY,KAAK,MAAM,OAAO,OAAO,CAAC,GAAG;;CAG1D,qBAAqB;CACrB,WAAW;CAEX,yCAAyC,MAAM,OAAO;EACpD,MAAM,OAAO,KAAK,MAAM,OAAO,qBAAqB;AACpD,SAAO,KAAK,KAAK,SAAS,OAAO,CAAC,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,GAAG;;CAGvE,oBAAoB;CAEpB,mBAAmB,MAAM,OAAO;EAC9B,MAAM,OAAO,KAAK,MAAM,OAAO,4BAA4B;AAC3D,SAAO,KAAK,KAAK,SAAS,OAAO,CAAC,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,GAAG;;CAGvE,2BAA2B;CAC3B,gBAAgB;CAChB,oBAAoB;CACpB,mBAAmB;CAEnB,kBAAkB,MAAM,OAAO;AAM7B,SAAO,mBAAmB,MAAM,OAAO,kBALnB;GAClB,KAAK,MAAM,OAAO,eAAe;GACjC,KAAK,KAAK,SAAS,WAAW,GAAG,SAAS,YAAY,KAAK;GAC3D,KAAK,MAAM,OAAO,aAAa;GAChC,CACoE;;CAGvE,gBAAgB;CAEhB,aAAa,MAAM,OAAO;EACxB,MAAM,EAAE,gBAAgB,YAAY,WAAW,KAAK,KAAK;EACzD,MAAM,SAAgB,EAAE;AACxB,MAAI,eACF,QAAO,KAAKA,QAAM,KAAK,MAAM,OAAO,iBAAiB,CAAC,CAAC;AAEzD,MAAI,WACF,QAAO,KAAKI,OAAKF,QAAM,IAAI,MAAM,OAAO,aAAa,CAAC,CAAC;AAEzD,SAAO,KACL,KAAK,MAAM,OAAO,SAAS,EAC3B,KAAK,MAAM,OAAO,mBAAmB,CACtC;AACD,SAAO,SACHF,QAAM,CACJ,GAAGI,OAAK,KAAK,OAAO,EACpBJ,QAAMC,SAAO,CAACC,QAAM,KAAK,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC,CACnD,CAAC,GACFF,QAAMI,OAAK,KAAK,OAAO,CAAC;;CAG9B,QAAQ;CAER,iBAAiB,MAAM,OAAO;EAC5B,MAAM,EAAE,MAAM,qBAAqB,sBAAsB,KAAK,KAAK;EACnE,MAAM,aAAa,CAAC,KAAK,MAAM,OAAO,aAAa,CAAC;EACpD,MAAM,aAAoB,EAAE;AAC5B,MAAI,kBACF,YAAW,KAAK,KAAK,MAAM,OAAO,oBAAoB,CAAC;AAEzD,MAAI,oBACF,YAAW,KAAK,KAAK,MAAM,OAAO,sBAAsB,CAAC;EAE3D,MAAM,QAAQ,WAAW,SACrBA,OAAK,CAAC,KAAKF,OAAK,EAAE,WAAW,GAC7B,sBAAsB,KAAK;AAC/B,aAAW,KAAK,MAAM,SAAS,oBAAoB,MAAM,GAAG,KAAK;AACjE,MAAI,KACF,YAAW,KAAK,KAAK,MAAM,OAAO,OAAO,CAAC;AAE5C,SAAO;;CAGT,kBAAkB,MAAM,OAAO;AAC7B,SAAOE,OAAK,KAAK;GACf,GAAG,IAAI,MAAM,OAAO,aAAa;GACjC,KAAK,MAAM,OAAO,YAAY;GAC9B,KAAK,KAAK,SAAS,aACf,CAAC,KAAK,MAAM,OAAO,aAAa,EAAE,QAAQ,GAC1C;GACL,CAAC;;CAGJ,oBAAoB,MAAM,OAAO;AAC/B,SAAO,UAAU,MAAM,OAAO,kBAAkB;;CAGlD,iBAAiB;CAEjB,6BAA6B,MAAM,OAAO;AACxC,SAAOA,OAAK,KAAK;GACf,GAAG,IAAI,MAAM,OAAO,mBAAmB;GACvC,KAAK,MAAM,OAAO,YAAY;GAC9B,KAAK,MAAM,OAAO,uBAAuB;GAC1C,CAAC;;CAGJ,uBAAuB,MAAM,OAAO;AAMlC,SAAO;GALMA,OAAK,KAAK;IACrB,GAAG,IAAI,MAAM,OAAO,mBAAmB;IACvC,KAAK,MAAM,OAAO,YAAY;IAC9B,GAAG,IAAI,MAAM,OAAO,aAAa;IAClC,CAAC;GACY;GAAQ,KAAK,MAAM,OAAO,aAAa;GAAC;;CAGxD,kBAAkB;CAElB,OAAO,MAAM,OAAO;AAClB,SAAO,CAAC,WAAW,KAAK,MAAM,OAAO,oBAAoB,CAAC;;CAG5D,kBAAkB,MAAM,OAAO;AAC7B,SAAOA,OAAK,MAAM,IAAI,MAAM,OAAO,gBAAgB,CAAC;;CAGtD,eAAe;CACf,YAAY;CACZ,qBAAqB;CAErB,kBAAkB,MAAM,OAAO;AAC7B,SAAO,CAAC,WAAW,KAAK,MAAM,OAAO,QAAQ,CAAC;;CAGhD,uBAAuB,MAAM,OAAO;EAClC,MAAM,cAAc,CAAC,KAAK,MAAM,OAAO,wBAAwB,CAAC;AAChE,MAAI,KAAK,KAAK,SAAS,OACrB,aAAY,KAAKJ,QAAMC,SAAO,CAACC,QAAM,KAAK,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AAEtE,cAAY,KAAK,KAAK,KAAK,MAAM,OAAO,kBAAkB,CAAC;AAC3D,SAAO,mBACL,MACA,OACA,uBACA,aACA,KACD;;CAGH,qBAAqB;CAErB,sBAAsB,MAAM,OAAO;EACjC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAoB,EAAE;AAC5B,MAAI,SAAS,kBACX,YAAW,KAAK,KAAK,MAAM,OAAO,oBAAoB,CAAC;AAEzD,MAAI,SAAS,oBACX,YAAW,KAAK,KAAK,MAAM,OAAO,sBAAsB,CAAC;EAE3D,MAAM,SAAS,CAAC,KAAK,MAAM,OAAO,iBAAiB,CAAC;AACpD,SAAO,KACL,WAAW,SACP,oBAAoBE,OAAK,CAAC,KAAKF,OAAK,EAAE,WAAW,CAAC,GAClD,KACL;AACD,SAAO,SAAS,iBACZ;GAACF,QAAM,KAAK,MAAM,OAAO,iBAAiB,CAAC;GAAE;GAAK,GAAG;GAAO,GAC5D;;CAGN,gBAAgB;CAEhB,gBAAgB,MAAM,OAAO;EAC3B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAoB,EAAE;AAC5B,MAAI,SAAS,8BACX,YAAW,KAAK,KAAK,MAAM,OAAO,gCAAgC,CAAC;AAErE,MAAI,SAAS,gBACX,YAAW,KAAK,KAAK,MAAM,OAAO,kBAAkB,CAAC;AAEvD,SAAO,WAAW,MAAM,WAAW;;CAGrC,+BAA+B;CAE/B,yCAAyC,MAAM,OAAO;EACpD,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAoB,EAAE;AAC5B,MAAI,SAAS,cACX,YAAW,KAAK,KAAK,MAAM,OAAO,gBAAgB,CAAC;AAErD,aAAW,KAAK,SAAS,QAAQ,UAAU,OAAO;AAClD,MAAI,SAAS,aACX,YAAW,KAAKA,QAAM;GAAC;GAAK,KAAK,MAAM,OAAO,eAAe;GAAE;GAAI,CAAC,CAAC;MAErE,YAAW,KACT,oBAAoB,sBAAsB,KAAK,EAAE,EAAE,aAAa,MAAM,CAAC,CACxE;AAEH,aAAW,KAAK,IAAI;AACpB,SAAO;;CAGT,uCAAuC,MAAM,OAAO;EAClD,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAa,CAAC,KAAK,MAAM,OAAO,iBAAiB,EAAE,IAAI;AAC7D,MAAI,SAAS,cACX,YAAW,KAAK,KAAK,MAAM,OAAO,gBAAgB,CAAC;AAErD,aAAW,KAAK,QAAQ;AACxB,MAAI,SAAS,aACX,YAAW,KAAKA,QAAM;GAAC;GAAK,KAAK,MAAM,OAAO,eAAe;GAAE;GAAI,CAAC,CAAC;MAErE,YAAW,KACT,oBAAoB,sBAAsB,KAAK,EAAE,EAAE,aAAa,MAAM,CAAC,CACxE;AAEH,aAAW,KAAK,IAAI;AACpB,SAAO;;CAGT,gBAAgB,MAAM,OAAO;EAC3B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,QAAQ,CAAC,SAAS,KAAK,MAAM,OAAO,iBAAiB,CAAC;AAC5D,MAAI,SAAS,iBAAiB;GAC5B,MAAM,OAAO,SAAS,SAAS,GAAG;GAClC,MAAM,UACJ,KAAK,yBAAyB,UAC9B,KAAK,qBAAqB;AAC5B,SAAM,KACJC,SAAO,CAACC,QAAM,KAAK,MAAM,OAAO,kBAAkB,CAAC,CAAC,EACpD,UAAUA,SAAO,IAClB;QAED,OAAM,KAAK,IAAI;AAEjB,SAAO,CAACF,QAAM,MAAM,EAAE,KAAK,MAAM,OAAO,WAAW,CAAC;;CAGtD,SAAS,MAAM,OAAO,SAAS;EAC7B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,WAAkB,EAAE;EAC1B,MAAM,0BAA0B,SAAS,wBAAwB,EAAE,EAChE,SAAS,EAAE,2BAAeM,WAAS,wBAAwB,EAAE,CAAC,CAC9D,MACE,EAAE,2BACD,CAACA,WAAS,yBAAyB,GAAG,SAAS,UAClD;AACH,MAAI,SAAS,kBAAkB;AAC7B,YAAS,KAAK,KAAK,MAAM,OAAO,mBAAmB,CAAC;AACpD,OAAI,CAAC,0BAA0B,QAAQ,kBAAkB,OACvD,UAAS,KAAK,IAAI;;AAGtB,MAAI,uBACF,UAAS,KAAK,KAAKC,YAAU,KAAK,MAAM,OAAO,uBAAuB,CAAC;AAEzE,SAAO,WAAW,MAAM,SAAS,SAAS,CAAC,SAAS,GAAG,EAAE,CAAC;;CAG5D,iBAAiB,MAAM,OAAO;AAC5B,SAAOH,OACL,CAAC,KAAKG,WAAS,EACf,IACE,OACA,iBAAgB;GACd,MAAMC,aAAW,MAAM,aAAa;GACpC,MAAM,EAAE,MAAM,aAAa;AAC3B,UAAO,CAAC,YACN,sBAAsB,KAAK,IAAI,oBAAoB,SAAS,GAAG,IAC7DA,aACA,CAACD,YAAUC,WAAS;KAE1B,eACD,CACF;;CAGH,aAAa,MAAM,OAAO;EACxB,MAAM,EAAE,cAAc,cAAc,KAAK,KAAK;EAC9C,MAAM,cAAc,CAAC,KAAK,MAAM,OAAO,aAAa,CAAC;AACrD,MAAI,aACF,aAAY,KAAKR,QAAM;GAAC;GAAK,KAAK,MAAM,OAAO,eAAe;GAAE;GAAI,CAAC,CAAC;AAExE,MAAI,UACF,aAAY,KAAK,KAAK,KAAK,MAAM,OAAO,YAAY,CAAC;AAEvD,SAAO,mBAAmB,MAAM,OAAO,wBAAwB,YAAY;;CAG7E,sBAAsB;CAEtB,qBAAqB,MAAM,OAAO;AAChC,SAAOI,OAAKG,YAAU,2BAA2B,MAAM,MAAM,CAAC;;CAGhE,kBAAkB,MAAM,OAAO;EAC7B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,QAAQ,CAAC,WAAW,KAAK,MAAM,OAAO,iBAAiB,CAAC;AAC9D,MAAI,SAAS,eACX,OAAM,KAAKP,QAAM,KAAK,MAAM,OAAO,iBAAiB,CAAC,CAAC;AAExD,QAAM,KAAK,KAAK,MAAM,OAAO,eAAe,CAAC;AAC7C,MAAI,SAAS,iBAAiB;GAC5B,MAAM,gBACJ,SAAS,aAAa,GAAG,SAAS,wBAAwB;GAC5D,MAAM,UACJ,SAAS,WAAW,GAAG,SAAS,0BAA0B;GAC5D,MAAM,kBAAkB,CACtB,gBAAgB,MAAME,QACtB,KAAK,MAAM,OAAO,kBAAkB,CACrC;AACD,SAAM,KACJF,QAAM,CACJ,gBAAgB,kBAAkBC,SAAO,gBAAgB,EACzD,UAAUC,SAAO,IAClB,CAAC,CACH;QAED,OAAM,KAAK,IAAI;AAEjB,SAAO,CAACF,QAAM,MAAM,EAAE,KAAK,MAAM,OAAO,aAAa,CAAC;;CAGxD,aAAa,MAAM,OAAO;AACxB,SAAO,KAAK,KAAK,SAAS,sBACtB;GACE;GACAC,SAAO,CAACE,YAAU,KAAK,MAAM,OAAO,sBAAsB,CAAC,CAAC;GAC5DA;GACA;GACD,GACD,oBAAoB,sBAAsB,KAAK,EAAE,EAAE,aAAa,MAAM,CAAC;;CAG7E,oBAAoB,MAAM,OAAO;AAC/B,SAAOC,OACL,CAAC,KAAKF,OAAK,EACX,IACE,OACA,kBAAiB;GACf,MAAM,EAAE,MAAM,aAAa;GAC3B,MAAM,YACJ,YACA,sBAAsB,KAAK,GAAG,oBAAoB,SAAS,GAAG;GAChE,MAAM,YAAY,MAAM,cAAc;AACtC,UAAO,YAAY,CAACC,YAAU,UAAU,GAAG;KAE7C,kBACD,CACF;;CAGH,gBAAgB,MAAM,OAAO;EAC3B,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,YAAY,CAAC,KAAK,MAAM,OAAO,YAAY,CAAC;AAClD,MACE,SAAS,cACT,SAAS,6BAA8B,GAAG,SAAS,WAEnD,WAAU,KAAK,IAAI;EAErB,MAAM,YAAY,eAAe,UAAU,CACzC,cACA,+BACD,CAAC;AACF,YAAU,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;AAC5C,SAAOH,QACLI,OAAKF,QAAM,CAAC,GAAG,IAAI,MAAM,OAAO,0BAA0B,EAAE,UAAU,CAAC,CACxE;;CAGH,6BAA6B,MAAM,OAAO;AACxC,SAAO;GACL,GAAGE,OAAK,KAAK,IAAI,MAAM,OAAO,aAAa,CAAC;GAC5C;GACA,KAAK,MAAM,OAAO,aAAa;GAChC;;CAGH,yBAAyB;CAEzB,WAAW,MAAM,OAAO;EACtB,MAAM,eAAsB,EAAE;EAC9B,IAAI,0BAA0B;AAC9B,OACE,OACA,oBAAmB;GACjB,MAAM,cAAc,MAAM,gBAAgB;AAC1C,OAAI,gBAAgB,GAClB;GAEF,MAAM,EAAE,MAAM,aAAa;GAC3B,MAAM,mBACJ,KAAK,SAAS,uBAAuB,GAAG,SACrC,yBAAyB,GAAG,SAAS,mBAAmB,GACxD;GACL,MAAM,yBACJ,CAAC,oBACD,0BAA0B,iBAAiB,iBAAiB,EAAE,CAAC;GACjE,MAAM,YACJ,aAAa,SAAS,MACrB,2BACC,0BACA,sBAAsB,KAAK,GAAG,oBAAoB,SAAU,GAAG;AACnE,gBAAa,KAAK,YAAY,CAACG,YAAU,YAAY,GAAG,YAAY;AACpE,6BAA0B;KAE5B,wBACD;AACD,SAAO,WAAW,MAAM,aAAa;;CAGvC,uBAAuB;CAEvB,8BAA8B,MAAM,OAAO;AAMzC,SAAO,mBACL,MACA,OACA,uBARkB;GAClB,KAAK,MAAM,OAAO,iBAAiB;GACnC;GACA,KAAK,MAAM,OAAO,kBAAkB;GACrC,EAMC,KACD;;CAEJ;AAED,SAAS,2BACP,MACA,OACA;AACA,KAAI,CAAC,KAAK,KAAK,SAAS,qBACtB,QAAO,EAAE;CAEX,MAAM,eAAsB,EAAE;CAC9B,IAAI,0BACF,KAAK,KAAK,SAAS,0BAClB,KAAK,aAAwC,SAC5C;AACJ,MACE,OACA,oBAAmB;EACjB,MAAM,cAAc,MAAM,gBAAgB;AAC1C,MAAI,gBAAgB,GAClB;EAEF,MAAM,EAAE,MAAM,aAAa;EAC3B,MAAM,mBACJ,KAAK,SAAS,yBAAyB,GAAG,SAAS,mBAAmB,GACnE;EACL,MAAM,yBAAyB,mBAC3B,0BAA0B,iBAAiB,iBAAiB,EAAE,CAAC,GAC/D;EACJ,MAAM,YACJ,2BACC,aAAa,SAAS,MACpB,0BACC,sBAAsB,KAAK,GAAG,oBAAoB,SAAU,GAAG;AACrE,eAAa,KAAK,YAAY,CAACA,YAAU,YAAY,GAAG,YAAY;AACpE,4BAA0B;IAE5B,uBACD;AACD,QAAO;;;;;ACnmBT,MAAM,EACJ,OACA,aACA,kBACA,gBACA,sBACA,SACA,kBACA,eACA,cACA,cACA,oBACA,yBACE;AACJ,MAAM,EAAE,aAAa,cAAc;AAEnC,0BAAe;CACb,YAAY;CAEZ,iBAAiB,MAAM,OAAO,GAAG,OAAO,EAAE,EAAE;EAC1C,MAAM,MAAO,KAA2B,OAAO;EAC/C,MAAM,aAAa,KAAK,MAAM,OAAO,mBAAmB;EACxD,MAAM,aAAa,CAAC,MAAM,YAAY,WAAW,GAAG,YAAY,MAAM;EACtE,MAAM,mBACJ,KAAK,KAAK,SAAS,WAAW,GAAG,SAAS;EAC5C,MAAM,OAAO,KAAK,MAAM,OAAO,aAAa;AAC5C,MAAI,kBAAkB;GACpB,MAAM,SAASE,SAAO,CAACC,QAAM,KAAK,CAAC;AACnC,cAAW,KAAKC,QAAM,MAAM,CAAC,QAAQC,WAAS,GAAG,OAAO,CAAC;QAEzD,YAAW,KAAK,KAAK,KAAK;AAE5B,SAAO;;CAGT,iBAAiB,MAAM,OAAO,SAAS;EACrC,MAAM,aAAa,YAAY,MAAM,MAAM;AAC3C,SAAO,CAAC,KAAK,KAAK,SAAS,8BACzB,QAAQ,gBAAgB,WACtB;GAAC;GAAK;GAAY;GAAI,GACtB;;CAGN,2BAA2B,MAAM,OAAO,SAAS;EAC/C,MAAM,EAAE,wBAAwB,KAAK,KAAK;AAC1C,MAAI,CAAC,oBACH,QAAO;EAET,MAAM,EAAE,4BAA4B,8BAClC,oBAAoB,GAAG;EACzB,MAAM,kBAAkB,6BAA6B,GAAG,SACrD,0BACD,4BAA4B,GAAG,SAAS,uBAAwB;EAClE,MAAM,aAAa,KAAK,MAAM,OAAO,sBAAsB;AAC3D,MAAI,iBAAiB,EACnB,QAAO,oBAAoB,WAAW;AAExC,SAAO,8BAA8B,QAAQ,gBAAgB,UACzD,aACA;GAAC;GAAK;GAAY;GAAI;;CAG5B,qBAAqB;CAErB,2BAA2B,MAAM,OAAO;AACtC,SAAO,UAAU,MAAM,OAAO,yBAAyB;;CAGzD,0BAA0B,MAAM,OAAO;AACrC,SAAO,UAAU,MAAM,OAAO,wBAAwB;;CAGxD,uBAAuB;CAEvB,uBAAuB,MAAM,OAAO;AAClC,SAAOC,OAAK,KAAK;GACf,GAAG,IAAI,MAAM,OAAO,mBAAmB;GACvC,KAAK,MAAM,OAAO,sBAAsB;GACxC,KAAK,MAAM,OAAO,uBAAuB;GAC1C,CAAC;;CAGJ,qBAAqB;CACrB,wBAAwB;CACxB,YAAY;CAEZ,sBAAsB,MAAM,OAAO,SAAS;EAC1C,MAAM,mBAAmB,KAAK,MAAM,OAAO,mBAAmB;EAC9D,MAAM,sBAAuB,KAAK,QAAQ,EAAE,EACxC;EACJ,MAAM,kBAAkB,wBAAwB;AAChD,MAAI,CAAC,KAAK,KAAK,SAAS,aACtB,QAAO,kBAAkB,mBAAmBF,QAAM,iBAAiB;EAGrE,MAAM,SAASA,QADI,wBAAwB,oBAE5BF,SAAO,iBAAiB,GAAG,iBACzC;EACD,MAAM,CAAC,YAAY,aAAa,IAAI,MAAM,OAAO,aAAa;EAC9D,MAAM,SAAS;GACbC;GACA,CAAC,MAAM,QAAQ,UAAUD,SAAO,WAAW,GAAG,MAAM,GAAG,WAAW,CAAC;GACnEC;GACA,CAAC,MAAM,QAAQ,UAAUD,SAAO,UAAU,GAAG,MAAM,GAAG,UAAU,CAAC;GAClE;EACD,MAAM,kBAAkB,wBAAwB;EAChD,MAAM,gBACJ,CAAC,mBAAmB,QAAQ,UACxB,SACA,MAAM,KAAK,IAAI,GAAG,QAAQ,WAAW,EAAE,EAAE,OAAO;AACtD,MAAI,gBACF,QAAO,CAAC,QAAQ,cAAc;EAEhC,MAAM,QAAQ,CAAC,QAAQA,SAAO,cAAc,CAAC;AAC7C,SAAO,kBAAkB,QAAQE,QAAM,MAAM;;CAG/C,iBAAiB,MAAM,OAAO,SAAS;EACrC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,WAAW,QACf,MACA,OACA,YAAY,UAAU;GACpB;GACA;GACA;GACA;GACD,CAAC,CACH;EACD,MAAM,YAAY,QAChB,OACA,iBAAgB;GACd,MAAM,EAAE,SAAS;GACjB,IAAI;AACJ,OAAI,WAAW,KAAK,CAClB,SAAQ,KAAK;YACJ,KAAK,SAAS,KACvB,SAAQ;OAER,SAAQ,KAAK,SAAS,QAAS,WAAW,IAAI,OAAO;AAEvD,UAAO;IAAE;IAAO,KAAK,MAAM,aAAa;IAAE;KAE5C,YAAY,UAAU;GACpB;GACA;GACA;GACA;GACD,CAAC,CACH;EACD,MAAM,WACH,KAAK,QAAQ,EAAE,EAA6B,SAAS,kBACrD,KAAK,QAAQ,EAAE,EAA6B,SAAS;EACxD,MAAM,mBACJ,SAAS,aAAa,GAAG,SAAS,wBAAwB,GAAG,SAC1D,iBAAiB;AACtB,SAAO,OAAO,UAAU,WAAW;GACjC,2BACG,UAAU,SAAS,KAAK,CAAC,SAAS,sBAClC,oBAAoB,0BAA0B,iBAAiB;GAClE;GACA,QAAQ;GACR,kBAAkB,QAAQ;GAC3B,CAAC;;CAGJ,gBAAgB,MAAM,OAAO;AAC3B,SAAO;GACL,GAAG,IAAI,MAAM,OAAO,sBAAsB;GAC1C,KAAK,MAAM,OAAO,UAAU;GAC5B,GAAG,IAAI,MAAM,OAAO,sBAAsB;GAC3C;;CAGH,4BAA4B,MAAM,OAAO;EACvC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAoB,EAAE;AAC5B,MAAI,SAAS,gCACX,YAAW,KAAK,GAAG,IAAI,MAAM,OAAO,kCAAkC,CAAC;AAEzE,aAAW,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;AAC7C,MAAI,SAAS,oBACX,YAAW,KAAK,GAAG,IAAI,MAAM,OAAO,sBAAsB,CAAC;AAE7D,SAAOE,OAAK,KAAK,WAAW;;CAG9B,QAAQ,MAAM,OAAO;EACnB,MAAM,EAAE,aAAa,KAAK;AAC1B,MAAI,CAAC,SAAS,cACZ,QAAO,KAAK,MAAM,OAAO,gBAAgB;EAE3C,MAAM,oBAAoB,SAAS,cAChC,QAAQ,EAAE,2BAAeC,WAAS,uBAAuB,CACzD,KAAK,EAAE,2BAAeA,WAAS,uBAAwB,GAAG,SAAS;EACtE,MAAM,2BAA2B,kBAAkB,MAChD,EAAE,mBACD,eAAe,GAAG,SAAS,WAAW,MACnC,EAAE,2BAAeA,WAAS,iBAC5B,CACJ;EACD,MAAM,yBACJ,SAAS,cAAc,GAAG,SAAS;EACrC,MAAM,sBACJ,kBAAkB,UACjB,yBAAyB,IAAI,KAC9B,SAAS,cAAc,QACpB,EAAE,2BAAeA,WAAS,2CAC5B,CAAC;EACJ,MAAM,eACJ,SAAS,cAAc,GAAG,SAAS,eAAe,GAAG;EACvD,MAAM,2BACJ,cAAc,yBAAyB,UACvC,SAAS,gBAAgB,GAAG,SAAS,2BAA2B;EAClE,MAAM,iCACJ,4BAA4B,wBAAwB,aAAa;EACnE,MAAM,mCACJ,4BAA4B,CAAC;EAG/B,MAAM,YADJ,kBAAkB,SAAS,KAAK,2BACcC,aAAWH;EAC3D,MAAM,SAAS,CACb,KACE,OACA,eACE,MAAM,YAAY,EAChB,eACE,kCACC,oCAAoC,wBAAwB,IACzD,KACA,WACP,CAAC,EACJ,gBACD,CACF;EACD,MAAM,6BACJ,sBAAsB,KACrB,wBAAwB,KAAK,oCAC9B,UAAU,OAAO;EACnB,MAAM,WAAkB,EAAE;AAC1B,OACE,OACA,eAAc;GACZ,MAAM,EAAE,MAAM,aAAa;GAC3B,MAAM,SAAS,MAAM,WAAW;AAChC,OAAI,KAAK,SAAS,KAAK;AACrB,QACG,+BACG,CAAC,YAAY,0BACb,UAAU,SAAS,0BACnB,UAAU,SACP,+CACN,CAAC,KAAK,SAAS,oBAAoB,UAAU,OAAO,CAErD,UAAS,KAAK,UAAU;AAE1B,aAAS,KAAK,OAAO;cACZ,SACT,UAAS,KAAK,OAAO;OAErB,QAAO,KACL,oCAAoC,uBAAuB,IACvDH,SAAO,OAAO,GACd,OACL;KAGL,gBACD;EACD,MAAM,oBAAoB,SAAS,cAAc,MAAK,WACpD,mBAAmB,OAAO,CAC3B;AACD,SAAOE,QACL,8BAA8B,oBAC1B,CAAC,QAAQF,SAAO,SAAS,CAAC,GAC1B,CAAC,QAAQ,GAAG,SAAS,CAC1B;;CAGH,eAAe;CAEf,cAAc,MAAM,OAAO;EACzB,MAAM,EAAE,aAAa,KAAK;AAC1B,MAAI,CAAC,SAAS,IACZ,QAAO,YAAY,MAAM,MAAM;EAEjC,MAAM,SAAgB,CAAC,IAAI;AAC3B,MAAI,SAAS,KACX,QAAO,KAAK,OAAO;WACV,SAAS,YAAY;AAC9B,OAAI,SAAS,cACX,QAAO,KAAK,KAAK,MAAM,OAAO,gBAAgB,CAAC;AAEjD,UAAO,KAAK,KAAK,MAAM,OAAO,aAAa,CAAC;SACvC;GACL,MAAM,YAAY,eAAe,UAAU,CACzC,oBACA,6CACD,CAAC;AACF,UAAO,KAAK,KAAK,MAAM,OAAO,UAAU,CAAC;;AAE3C,SAAO;;CAGT,aAAa,MAAM,OAAO,GAAG,MAAM;EACjC,MAAM,gBAAiB,KAAiC,iBAAiB;EACzE,MAAM,eAAe,CACnB,KAAK,MAAM,OAAO,wBAAwB,EAC1C,GAAG,IACD,OACA,aAAY;GACV,MAAM,OAAO,MAAM,SAAS;AAC5B,UAAO,SAAS,SACZ,CAAC,UAAU,KAAK,GAAGM,aAAW,eAAe,KAAK,GAClD;KAEN,uBACD,CACF;AACD,eAAa,KAAKN,SAAO,aAAa,KAAK,CAAE,CAAC;AAC9C,SAAO,KAAK,KAAK,SAAS,OACtB,CAAC,cAAc,KAAK,MAAM,OAAO,OAAO,CAAC,GACzC;;CAGN,sBAAsB,MAAM,OAAO;AACjC,SAAOI,OAAK,KAAK,CACf,GAAG,IAAI,MAAM,OAAO,aAAa,EACjC,KAAK,MAAM,OAAO,yBAAyB,CAC5C,CAAC;;CAGJ,qBAAqB,MAAM,OAAO;EAChC,MAAM,SAAS,KAAK,MAAM,OAAO,yBAAyB;EAC1D,MAAM,OAAO,KAAK,KAAK,SAAS,gBAC5B,CAAC,KAAK,MAAM,OAAO,gBAAgB,EAAE,OAAO,GAC5C;AACJ,SAAO,CAAC,KAAK,GAAGA,OAAK,KAAK,CAAC,GAAG,IAAI,MAAM,OAAO,aAAa,EAAE,KAAK,CAAC,CAAC;;CAGvE,uBAAuB,MAAM,OAAO;EAClC,MAAM,EAAE,aAAa,KAAK;EAE1B,MAAM,UAAU,KAAK,MAAM,OADR,eAAe,UAAU,CAAC,cAAc,QAAQ,CAAC,CACvB;AAC7C,SAAO,SAAS,gBACZ,CAAC,SAAS,KAAK,MAAM,OAAO,gBAAgB,CAAC,GAC7C;;CAGN,sBAAsB,MAAM,OAAO;EACjC,MAAM,aAAa,KAAK,MAAM,OAAO,aAAa;EAClD,MAAM,kBAAkB,KAAK,QAAQ,EAAE;EACvC,MAAM,2BAA2B,KAAK,QACpC,EACD;EACD,MAAM,gBAAgB,KAAK,QAAQ,GAAG;EACtC,MAAM,EAAE,uBAAuB,qBAC7B,KAAK,KAAK,SAAS,WAAW,GAAG;EACnC,MAAM,YAAY,qBAAqB;EACvC,MAAM,aACJ,wBAAwB,GAAG,SAAS,iBAAiB;EACvD,MAAM,YAAY,iBAAiB,SAAS,kBAAkB;EAC9D,MAAM,eACH,eAAe,SAAS,sBACvB,uBAAuB,cAAc,IACvC,eAAe,SAAS;AAC1B,MAAI,CAAC,aAAa,cAAc,CAAC,cAAc,cAC7C,QAAO,oBAAoB,aAAaF,QAAM,WAAW,GAAG,WAAW;WAEvE,4BACA,OAAO,KAAK,yBAAyB,SAAS,CAAC,WAAW,KAC1D,iBACA,CAAC,SAAS,kBAAkB,CAAC,SAAS,cAAc,KAAK,CAEzD,QAAO,oBAAoBA,QAAM,WAAW,CAAC;WACpC,cAAc,aAAa,CAAC,aACrC,QAAOA,QAAM;GAAC;GAAK;GAAYC;GAAU;GAAI,CAAC;MAE9C,QAAOD,QAAM;GACX;GACA,aAAa,aAAa,aAAaF,SAAO,WAAW;GACzD;GACD,CAAC;;CAIN,gBAAgB;CAEhB,wBAAwB,MAAM,OAAO;AACnC,SAAO;GACL;GACA,KAAK,MAAM,OAAO,gBAAgB;GAClC;GACA,KAAK,MAAM,OAAO,kBAAkB;GACrC;;CAGH,4BAA4B,MAAM,OAAO;EACvC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,OAAO,KAAK,MAAM,OAAO,gBAAgB;AAU/C,SAAO;GATM,SAAS,kBAClB,oBACEI,OAAKH,QAAM,CAAC,MAAM,GAAG,IAAI,MAAM,OAAO,kBAAkB,CAAC,CAAC,CAC3D,GACD;IAAC;IAAK;IAAM;IAAI;GAKN;GAAK,KAAK,MAAM,OAJR,eAAe,UAAU,CAC7C,oBACA,8BACD,CAAC,CACiD;GAAC;;CAGtD,eAAe;CAEf,2CAA2C,MAAM,OAAO;EACtD,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAoB,CAAC,OAAO;AAClC,MAAI,SAAS,cACX,YAAW,KAAK,KAAK,MAAM,OAAO,gBAAgB,CAAC;AAErD,aAAW,KACT,KAAK,MAAM,OAAO,oCAAoC,EACtD,SAAS,eACLC,QAAM;GAAC;GAAK,KAAK,MAAM,OAAO,eAAe;GAAE;GAAI,CAAC,GACpD,KACL;AACD,MAAI,SAAS,UACX,YAAW,KAAK,KAAK,KAAK,MAAM,OAAO,YAAY,CAAC;AAEtD,SAAO;;CAGT,kCAAkC,MAAM,OAAO;EAC7C,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,OAAO,SAAS,aAClB,QACE,OACA,cAAa,CACX,MAAM,UAAU,EAChB,cAAc,UAAU,KAAK,GAAG,MAAM,IACvC,EACD,CAAC,cAAc,aAAa,CAC7B,GACD,UAAU,MAAM,MAAM;AAC1B,MAAI,SAAS,uBACX,MAAK,KAAK,KAAK,MAAM,OAAO,yBAAyB,CAAC;AAExD,SAAO;;CAGT,wBAAwB;CAExB,UAAU;AACR,SAAO;;CAGT,uBAAuB,MAAM,OAAO;AAClC,SAAO,KAAK,KAAK,SAAS,eACtBA,QAAM;GAAC;GAAK,KAAK,MAAM,OAAO,eAAe;GAAE;GAAI,CAAC,GACpD,oBAAoB,sBAAsB,KAAK,EAAE,EAAE,aAAa,MAAM,CAAC;;CAG7E,aAAa,MAAM,OAAO;EACxB,MAAM,cAAc,KAAK,KAAK,SAAS;EACvC,MAAM,iBAAiB,YAAY,GACjC,GACD;EACD,MAAM,qCACJ,eAAe,SAAS,mBAAmB,GAAG,SAAS,WAAW,GAC/D,SAAS,aAAa,GAAG;EAC9B,MAAM,4CACJ,oCAAoC,wBAAwB,GAAG;EACjE,MAAM,aACJ,CAAC,eAAe,aACf,CAAC,sCACA,2CAA2C,iBAAiB,UAC5D,2CAA2C,mBAAmB,GAC3D,SAAS,gBAAgB,WAAW,MACzC,YAAY,WAAW,EAAE,eAAe,SAAS,iBAAiB,KAChE,YAAY,SAAS;EACzB,MAAM,OAAO,IAAI,MAAM,OAAO,aAAa;EAC3C,MAAM,oBAAoB,CACxBF,SAAO,CAACG,YAAU,GAAGC,OAAK,CAAC,KAAKH,OAAK,EAAE,KAAK,CAAC,CAAC,EAC9CE,WACD;AACD,MAAI,CAAC,cAAc,UAAW,KAAK,GAAG,GAAG,CAAW,GAAG,CACrD,QAAO;EAET,MAAM,WAAW,KAAK,MAAM,GAAG,GAAG;EAClC,MAAM,gBAAgB,KAAK,MACzB,YAAW,MAAM,SAAS,EAAE,KAAK,MAAM,CAAC,EACxC,YACA,cACA,KAAK,SAAS,EACf;EACD,MAAM,kBAAkBC,OAAK,MAAM,CACjC,GAAG,UACHF,QAAM,eAAe,EAAE,aAAa,MAAM,CAAC,CAC5C,CAAC;AACF,MAAI,UAAU,cAAc,CAC1B,QAAO,CACL,aACA,iBAAiB,CAAC,iBAAiB,kBAAkB,CAAC,CACvD;AAEH,SAAO,iBAAiB;GACtBE,OAAK,MAAM,CAAC,GAAG,UAAU,cAAc,CAAC;GACxC;GACA;GACD,CAAC;;CAGJ,wBAAwB,MAAM,OAAO;EACnC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,UAAU,eAAe,UAAU,CACvC,wBACA,gBACD,CAAC;EACF,MAAM,YAAY,eAAe,UAAU,CACzC,mDACA,qCACD,CAAC;AACF,SAAO;GAAC;GAAQ,KAAK,MAAM,OAAO,QAAQ;GAAE,KAAK,MAAM,OAAO,UAAU;GAAC;;CAG3E,gDAAgD,MAAM,OAAO;EAC3D,MAAM,cAAc,KAAK,MAAM,OAAO,WAAW;AACjD,SAAO,KAAK,KAAK,SAAS,OACtB,CAAC,aAAa,KAAK,MAAM,OAAO,OAAO,CAAC,GACxC;;CAGN,mCAAmC,MAAM,OAAO;AAC9C,SAAO;GACL,KAAK,MAAM,OAAO,OAAO;GACzB;GACA,KAAK,MAAM,OAAO,mBAAmB;GACtC;;CAGH,SAAS,MAAM,OAAO;AACpB,SAAO,IAAI,MAAM,OAAO,UAAU;;CAGpC,QAAQ,MAAM,OAAO;AACnB,SAAOA,OAAK,KAAK,CACf,GAAG,IAAI,MAAM,OAAO,aAAa,EACjC;GAAC;GAAK,KAAK,MAAM,OAAO,aAAa;GAAE;GAAI,CAC5C,CAAC;;CAGJ,mBAAmB,MAAM,OAAO;EAC9B,MAAM,WAAW,IAAI,MAAM,OAAO,UAAU;EAC5C,MAAM,WAAW,IAAI,MAAM,OAAO,UAAU;AAC5C,SAAO,CACL,GAAG,SAAS,SAAS,SAAS,UAAU,CAAC,SAAS,SAAS,OAAO,CAAC,EACnE,SACD;;CAGH,kBAAkB,MAAM,OAAO;AAC7B,SAAO;GAAC;GAAK,KAAK,MAAM,OAAO,aAAa;GAAE;GAAI;;CAGpD,sBAAsB,MAAM,OAAO;EACjC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,YAAmB,CAAC,KAAK;AAC/B,MAAI,SAAS,cACX,WAAU,KAAK,KAAK,MAAM,OAAO,gBAAgB,CAAC;AAEpD,YAAU,KACR,KAAK,MAAM,OAAO,eAAe,UAAU,CAAC,cAAc,MAAM,CAAC,CAAC,CACnE;AACD,SAAO;;CAGT,kBAAkB;CAClB,UAAU;CAEV,eAAe,MAAM,OAAO;AAC1B,SAAO,cACL,MACA,OACA,uBACA,qBACA,oBACD;;CAGH,kBAAkB,MAAM,OAAO;AAC7B,SAAO,cACL,MACA,OACA,0BACA,wBACA,uBACD;;CAGH,oBAAoB;CACpB,SAAS;CACT,aAAa;CAEb,cAAc,MAAM,OAAO;EACzB,MAAM,WAAW,KAAK,KAAK,SAAS,uBAChC,oBAAoB,KAAK,MAAM,OAAO,uBAAuB,CAAC,GAC9D;AACJ,SAAO,CAAC,KAAK,MAAM,OAAO,gBAAgB,EAAE,SAAS;;CAGvD,qBAAqB,MAAM,OAAO;AAChC,SAAO,UAAU,MAAM,OAAO,mBAAmB;;CAGnD,kBAAkB;CAClB,iBAAiB;CAEjB,MAAM,MAAM,OAAO;EACjB,MAAM,aAAa,KAAK,MAAM,OAAO,aAAa;AAMlD,SAAO,CACL,SALA,KAAK,KAAK,SAAS,WAAW,GAAG,SAAS,wBAAwB,GAC/D,SAAS,iBAAiB,GAAG,SAAS,gBAAgB,GAAG,SACzD,QAAQ,GAAG,SAAS,cAAc,GAAG,SAAS,0BACjD,SAII,aACAF,QAAM;GACJ,QAAQ,IAAI;GACZF,SAAO,CAACG,YAAU,WAAW,CAAC;GAC9BA;GACA,QAAQ,IAAI;GACb,CAAC,CACP;;CAEJ;AAED,SAAS,OACP,UACA,WACA,EACE,yDAA4B,OAC5B,WAAW,OACX,SAAS,OACT,oBAOG;CACL,IAAI;CACJ,IAAI;CACJ,IAAI,QAAe,EAAE;AACrB,QAAO,UAAU,QAAQ;EACvB,MAAM,eAAe,UAAU,GAAG;EAClC,MAAM,iBAAiB,sBAAsB,aAAa;AAE1D,MAAI,oBAAoB,UAAa,mBAAmB,iBAAiB;GACvE,MAAM,EAAE,OAAO,UAAU,KAAK,gBAAgB,UAAU,OAAO;AAC/D,SAAM,KAAK,SAAS,OAAO,CAAE;AAC7B,OACE,kBAAkB,UAClB,iBAAiB,eAAe,SAAS,CAEzC,SAAQ,CAAC;IAAC;IAAKD,QAAMF,SAAO,MAAM,CAAC;IAAE;IAAI,CAAC;GAE5C,MAAM,QAAQ;IAAC;IAAK;IAAaC;IAAK;AACtC,OAAI,qBAAqB,WAAW,CAAC,qBAAqB,SAAS,CACjE,OAAM,SAAS;AAEjB,SAAM,KAAK,MAAM;AACjB,mBAAgB;AAChB,qBAAkB;aACT,iBAAiB,iBAAiB;AAC3C,OAAI,CAAC,OACH;AAEF,SAAM,KAAK,SAAS,OAAO,CAAE;GAC7B,MAAM,UAAUC,QAAMF,SAAO,MAAM,CAAC;AACpC,YAAS,QACP,kBAAkB,UAChB,iBAAiB,eAAe,aAAa,GAC3C;IAAC;IAAK;IAAS;IAAI,GACnB,QACL;AACD,WAAQ,EAAE;AACV,mBAAgB;AAChB,qBAAkB;SACb;GACL,MAAM,UAAU,OAAO,UAAU,WAAW,EAAE,kBAAkB,CAAC;AACjE,YAAS,QACP,kBAAkB,UAChB,iBAAiB,cAAc,cAAc,GAC3C;IAAC;IAAKE,QAAMF,SAAO,QAAQ,CAAC;IAAE;IAAI,GAClCE,QAAM,QAAQ,CACnB;;;AAGL,OAAM,KAAK,SAAS,OAAO,CAAE;AAC7B,KACE,CAAC,iBACA,CAAC,YACA,CAAC,qBAAqB,cAAc,IACpC,kBAAkB,aAEpB,QAAO;AAET,KAAI,CAAC,UAAUK,4BACb,QAAOP,SAAO,MAAM;CAEtB,MAAM,UAAU,OAAO,aAAa;AACpC,QAAO;EACL,MAAM;EACNE,QAAMF,SAAO,MAAM,GAAG,EAAE,EAAE,IAAI,SAAS,CAAC;EACxC,cAAc,MAAM,IAAI,EAAE,SAAS,CAAC;EACrC;;AAGH,MAAM,wBAAwB,IAAI,IAChC;CACE,CAAC,KAAK;CACN,CAAC,KAAK;CACN,CAAC,IAAI;CACL,CAAC,IAAI;CACL,CAAC,IAAI;CACL,CAAC,MAAM,KAAK;CACZ;EAAC;EAAK;EAAK;EAAM;EAAM;EAAa;CACpC;EAAC;EAAM;EAAM;EAAM;CACnB,CAAC,KAAK,IAAI;CACV;EAAC;EAAK;EAAK;EAAI;CAChB,CAAC,SAAS,WAAW,UAAU,UAAU,KAAI,aAAY,CAAC,UAAU,MAAM,CAAC,CAAC,CAC9E;AACD,SAAS,sBAAsB,UAAkB;AAC/C,QAAO,sBAAsB,IAAI,SAAS,IAAI;;AAGhD,SAAS,iBAAiB,UAAkB,gBAAwB;AAClE,QACG,aAAa,QAAQ,mBAAmB,QACxC;EAAC;EAAK;EAAK;EAAK;EAAM;EAAM;EAAM,CAAC,SAAS,eAAe,IAC1D,sBAAsB,SAAS,GAC7B,sBAAsB,eAAe,IACzC,CAAC,UAAU,eAAe,CAAC,OAAM,MAAK,CAAC,MAAM,KAAK,CAAC,SAAS,EAAE,CAAC,IAC/D,CAAC,UAAU,eAAe,CAAC,OAAM,MAAK;EAAC;EAAM;EAAM;EAAM,CAAC,SAAS,EAAE,CAAC,IACrE,aAAa,OAAO,mBAAmB,OACvC,aAAa,OAAO,mBAAmB,OACvC,aAAa,OAAO;EAAC;EAAK;EAAK;EAAK;EAAI,CAAC,SAAS,eAAe,IACjE,CAAC,KAAK,IAAI,CAAC,SAAS,SAAS,IAAI,mBAAmB;;AAIzD,MAAM,sBAAsB,IAAI,IAAI;CAClC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAS,qBAAqB,UAAkB;AAC9C,QAAO,oBAAoB,IAAI,SAAS;;AAG1C,SAAS,wBAAwB,cAA+B;CAC9D,MAAM,uBAAuB,CAC3B,aAAa,sBAAsB,IACnC,GAAI,aAAa,wBAAwB,EAAE,CAC5C,CAAC,GAAG,GAAG,EAAE,SAAS,uBAAuB,GAAG,SAAS,aAAa,GAAG;AACtE,QAAO,yBAAyB,KAAK,wBAAwB,GAAG;;AAGlE,SAAS,cAGP,MAAkB,OAAoB,UAAa,QAAW,QAAW;CACzE,MAAM,QAAQ,KAAK,OAAO,EAAE,WAAW,KAAK,OAAO,SAAS;CAC5D,MAAM,OAAO,IAAI,OAAO,EAAE,WAAW,KAAK,OAAO,OAAO;CACxD,MAAM,MAAM,KAAK,OAAO,EAAE,WAAW,KAAK,OAAO,OAAO;CAExD,MAAM,aAAa,eADL;EAAC;EAAO,GAAG;EAAM;EAAI,CAAC,KAAK,GAAG,CAAC,MAAM,KAAK,CAAC,MAAM,EAAE,CACzB;CACxC,MAAM,SAAS,OAAO,IAAI,OAAO,WAAW;CAC5C,MAAM,QAAQ;EAAC;EAAO,GAAG;EAAM;EAAI,CAAC,KAAI,UACtCI,OAAKE,YAAU,MAAM,MAAM,OAAO,CAAC,CACpC;AACD,QAAON,SAAO;EACZ,MAAM;EACN,GAAG,IACD,OACC,gBAAgB,UAAU;GACzB,MAAM,aAAaE,QAAM,CACvBF,SAAO;IAACG;IAAU,MAAM,eAAe;IAAE;IAAmB,CAAC,EAC7DA,WACD,CAAC;AACF,UAAO,UAAU,IAAI,aAAa,CAAC,MAAM,QAAQ,WAAW;KAE9D,qBACD;EACD,MAAM,GAAG,GAAG;EACb,CAAC;;;;;ACrzBJ,MAAM,EAAE,gBAAO,sBAAU,kBAAQ,cAAM,iBAAS;AAEhD,yBAAe;CACb,qBAAqB,MAAM,OAAO;AAKhC,SAAO,mBACL,MACA,OACA,qBACA,KAAK,MAAM,OARU,eAAe,KAAK,KAAK,UAAU,CACxD,kCACA,6BACD,CAAC,CAKiC,EACjC,KACD;;CAGH,2BAA2B,MAAM,OAAO;EACtC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,iBAAiB,YAAY,UAAU,CAC3C,oBACA,mBACD,CAAC;EACF,MAAM,qBAAqB,eAAe,SAAS;EACnD,MAAM,oBAAoB,SAAS,mBAAmB;EACtD,MAAM,QAAQ,CAAC,cAAc,KAAK,MAAM,OAAO,iBAAiB,CAAC;AACjE,MAAI,mBAAmB;GACrB,MAAM,iBAAiB,KAAK,MAAM,OAAO,iBAAiB;AAC1D,SAAM,KACJ,qBAAqBK,QAAMC,SAAO,eAAe,CAAC,GAAG,eACtD;;AAEH,MAAI,eAAe,QAAQ;GACzB,MAAM,YAAY,qBAAqB,CAAC,qBAAqB,MAAMC;GACnE,MAAM,UAAU,eAAe,SAAQ,WAAU,CAC/C,WACA,KAAK,MAAM,OAAO,OAAO,CAC1B,CAAC;GACF,MAAM,UACJ,SAAS,cAAc,GAAG,SAAS,+BACnC;GACF,MAAM,cAAc,CAClB,qBAAqB,CAAC,qBAAqB,UAAUD,SAAO,QAAQ,EACpE,UAAU,YAAY,IACvB;AACD,SAAM,KAAK,qBAAqB,cAAcD,QAAM,YAAY,CAAC;QAEjE,OAAM,KAAK,IAAI;AAEjB,SAAO,CAACA,QAAM,MAAM,EAAE,KAAK,MAAM,OAAO,gBAAgB,CAAC;;CAG3D,mBAAmB;CAEnB,iBAAiB,MAAM,OAAO;AAC5B,SAAOA,QAAM,CACX,WACAC,SAAO,CAACC,QAAM,KAAK,MAAM,OAAO,oBAAoB,CAAC,CAAC,CACvD,CAAC;;CAGJ,kBAAkB;CAElB,cAAc,MAAM,OAAO;EACzB,MAAM,eAAsB,EAAE;EAC9B,IAAI,0BAA0B;AAC9B,OACE,OACA,oBAAmB;GACjB,MAAM,cAAc,MAAM,gBAAgB;AAC1C,OAAI,gBAAgB,GAClB;GAEF,MAAM,EAAE,MAAM,aAAa;GAC3B,MAAM,sBACJ,KAAK,SAAS,sBAAsB,GAAG;GACzC,MAAM,oBACJ,KAAK,SAAS,6BAA6B,GAAG;GAChD,MAAM,yBACH,CAAC,uBAAuB,CAAC,qBAC1B,mBAAmB,WAAW,GAAG,SAAS,UAAU,UACpD,0BACE,qBAAqB,oBACnB,mBAAmB,2BACnB,EAAE,CACL;GACH,MAAM,YACJ,aAAa,SAAS,MACrB,2BACC,0BACA,sBAAsB,KAAK,GAAG,oBAAoB,SAAU,GAAG;AACnE,gBAAa,KAAK,YAAY,CAACC,YAAU,YAAY,GAAG,YAAY;AACpE,6BAA0B;KAE5B,6BACD;AACD,SAAO,WAAW,MAAM,aAAa;;CAGvC,2BAA2B,MAAM,OAAO;EACtC,MAAM,EAAE,aAAa,KAAK;AAC1B,SAAO,SAAS,YACZ,KACA,KAAK,MAAM,OAAO,eAAe,SAAS,CAAC;;CAGjD,oBAAoB,MAAM,OAAO;AAO/B,SAAO,mBAAmB,MAAM,OAAO,oBANnB;GAClB,KAAK,MAAM,OAAO,YAAY;GAC9B;GACA,KAAK,MAAM,OAAO,yBAAyB;GAC3C;GACD,CACsE;;CAGzE,kBAAkB;CAElB,2BAA2B,MAAM,OAAO;AAMtC,SAAO,mBACL,MACA,OACA,2BARkB;GAClB,KAAK,MAAM,OAAO,eAAe;GACjC,KAAK,KAAK,SAAS,WAAW,GAAG,SAAS,YAAY,KAAK;GAC3D,KAAK,MAAM,OAAO,aAAa;GAChC,CAMA;;CAGH,yBAAyB;CAEzB,+BAA+B,MAAM,OAAO;AAC1C,SAAOC,OAAK,KAAK;GACf;GACA,KAAK,MAAM,OAAO,iBAAiB;GACnC,KAAK,MAAM,OAAO,0BAA0B;GAC7C,CAAC;;CAGJ,wBAAwB,MAAM,OAAO;EACnC,MAAM,eAAsB,EAAE;AAC9B,OACE,OACA,oBAAmB;GACjB,MAAM,cAAc,MAAM,gBAAgB;AAC1C,OAAI,gBAAgB,GAClB;AAEF,gBAAa,KACX,gBAAgB,UAAU,cAAc,CAACD,YAAU,YAAY,CAChE;KAEH,uCACD;AACD,SAAO,WAAW,MAAM,aAAa;;CAGvC,qCAAqC,MAAM,OAAO;EAChD,MAAM,EAAE,aAAa,KAAK;AAC1B,SAAO,SAAS,YACZ,KACA,KAAK,MAAM,OAAO,eAAe,SAAS,CAAC;;CAGjD,sCAAsC,MAAM,OAAO;EACjD,MAAM,EAAE,MAAM,iBAAiB,KAAK,KAAK;EACzC,MAAM,cAAc;GAClB,KAAK,MAAM,OAAO,YAAY;GAC9B;GACA,KAAK,MAAM,OAAO,aAAa;GAC/B;GACD;AACD,MAAI,KACF,aAAY,KAAK,KAAK,MAAM,OAAO,OAAO,CAAC;AAE7C,MAAI,aACF,aAAY,KAAK,KAAK,KAAK,MAAM,OAAO,eAAe,CAAC;AAE1D,cAAY,KAAK,IAAI;AACrB,SAAO,mBACL,MACA,OACA,sCACA,YACD;;CAGH,oCAAoC;CAEpC,aAAa,MAAM,OAAO;AACxB,SAAO,CAAC,YAAY,KAAK,MAAM,OAAO,eAAe,CAAC;;CAGxD,WAAW,MAAM,OAAO;EACtB,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,aAAa,CAAC,KAAK,KAAK,MAAM,OAAO,WAAW,CAAC;AACvD,MAAI,SAAS,gBAAgB,SAAS,sBAAsB;GAC1D,MAAM,YAAY,eAAe,UAAU,CACzC,gBACA,uBACD,CAAC;AACF,cAAW,KAAK,oBAAoB,KAAK,MAAM,OAAO,UAAU,CAAC,CAAC;;AAEpE,SAAO;;CAGT,qBAAqB,MAAM,OAAO;AAChC,SAAO,UAAU,MAAM,OAAO,mBAAmB;;CAGnD,iBAAiB,MAAM,OAAO;AAC5B,SAAOC,OAAK,KAAK;GACf,KAAK,MAAM,OAAO,aAAa;GAC/B,KAAK,MAAM,OAAO,SAAS;GAC3B,KAAK,MAAM,OAAO,eAAe;GAClC,CAAC;;CAGJ,cAAc;CAEd,6BAA6B,MAAM,OAAO,SAAS;AACjD,SAAO,sBAAsB,MAAM,OAAO,SAAS,mBAAmB;;CAGxE,iBAAiB,MAAM,OAAO;AAC5B,SAAOJ,QAAM,UAAU,MAAM,OAAO,eAAe,CAAC;;CAEvD;;;;AChPD,MAAM,EAAE,sBAAU,kBAAQ,iBAAS;AAEnC,gCAAe;CACb,QAAQ,MAAM,OAAO;EACnB,MAAM,EAAE,cAAc,KAAK,KAAK;AAChC,MAAI,CAAC,UACH,QAAO,YAAY,MAAM,MAAM;EAEjC,MAAM,CAAC,MAAM,GAAG,SAAS,UAAU,GAAG,MAAM,MAAM,KAAK;EACvD,MAAM,aAAa,eAAe,MAAM;EACxC,MAAM,YAAYK,OAAKC,YAAU,CAC/B,MACA,GAAG,MAAM,KAAI,WAAQC,OAAK,MAAM,WAAW,CAAC,CAC7C,CAAC;EACF,MAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,SAAO,UAAU,SAAS,yBACvB,UAAU,SAAS,sBAClB,SAAS,SAAS,qBAClBC,SAAO,UAAU,GACjB;;CAGN,gBAAgB;CAChB,sBAAsB;CACtB,gBAAgB;CAEhB,cAAc,MAAM,OAAO;AACzB,SAAO,IAAI,MAAM,OAAO,eAAe,KAAK,KAAK,SAAS,CAAC;;CAE9D;;;;ACrCD,oBAAe;CACb,gBAAgB;CAChB,YAAY;CACZ,aAAa;CACb,UAAU;CACV,gBAAgB;CAChB,YAAY;CACZ,mBAAmB;CACnB,eAAe;CAChB;;;;ACUD,MAAM,EAAE,gBAAO,UAAU,kBAAQ,cAAM,iBAAS;AAEhD,mCAAe;CACb,gBAAgB,MAAM,OAAO;AAC3B,SAAO;GAAC,GAAG,sBAAsB,KAAK;GAAE,YAAY,MAAM,MAAM;GAAE;GAAS;;CAG7E,wBAAwB,MAAM,OAAO;EACnC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,eAAsB,EAAE;AAC9B,MAAI,SAAS,mBACX,cAAa,KAAK,KAAK,MAAM,OAAO,qBAAqB,CAAC;AAE5D,MAAI,SAAS,mBAAmB;GAC9B,MAAM,cAAc,YAAY,SAAS,kBAAkB;GAC3D,MAAM,qBAAqB,IAAI,MAAM,OAAO,oBAAoB,CAAC,QAC/D,QAAO,QAAQ,GAChB;GACD,MAAM,qBAAqB,mBAAmB,MAAM,GAAG,YAAY;GACnE,MAAM,wBAAwB,mBAAmB,MAAM,YAAY;AACnE,gBAAa,KACX,GAAG,CAAC,oBAAoB,sBAAsB,CAC3C,QAAQ,EAAE,aAAa,OAAO,CAC9B,KAAI,mBAAgBC,OAAK,UAAUC,eAAa,CAAC,CACrD;;AAEH,MAAI,SAAS,gBACX,cAAa,KACX,GAAG,IAAI,MAAM,OAAO,kBAAkB,CAAC,QACrC,gBAAe,gBAAgB,GAChC,CACF;AAEH,SAAOD,OAAK,CAAC,UAAU,SAAS,EAAE,aAAa;;CAGjD,uBAAuB,MAAM,OAAO;EAClC,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,eAAsB,EAAE;AAC9B,MAAI,SAAS,mBAAmB;GAC9B,MAAM,cAAc,YAAY,SAAS,kBAAkB;GAC3D,MAAM,qBAAqB,IAAI,MAAM,OAAO,oBAAoB,CAAC,QAC/D,QAAO,QAAQ,GAChB;GACD,MAAM,qBAAqB,mBAAmB,MAAM,GAAG,YAAY;GACnE,MAAM,wBAAwB,mBAAmB,MAAM,YAAY;AACnE,gBAAa,KACX,GAAG,CAAC,oBAAoB,sBAAsB,CAC3C,QAAQ,EAAE,aAAa,OAAO,CAC9B,KAAI,mBAAgBA,OAAK,UAAUC,eAAa,CAAC,CACrD;;AAEH,eAAa,KAAK,KAAK,MAAM,OAAO,oBAAoB,CAAC;AACzD,SAAOD,OAAK,CAAC,UAAU,SAAS,EAAE,aAAa;;CAGjD,mBAAmB,MAAM,OAAO;AAC9B,SAAOA,OAAK,UAAU,CACpB,GAAG,IAAI,MAAM,OAAO,kBAAkB,EACtC;GAAC;GAAY,UAAU,MAAM,MAAM;GAAE;GAAI,CAC1C,CAAC;;CAGJ,iBAAiB;CAEjB,kBAAkB,MAAM,OAAO;EAC7B,MAAM,EAAE,aAAa,KAAK;AAC1B,MAAI,SAAS,eACX,QAAO,KAAK,MAAM,OAAO,iBAAiB;EAE5C,MAAM,cAAqB,CAAC,UAAU;AACtC,MAAI,SAAS,OACX,aAAY,KAAK,UAAU;AAE7B,cAAY,KAAK,KAAK,MAAM,OAAO,oBAAoB,CAAC;AACxD,MAAI,SAAS,KACX,aAAY,KAAK,KAAK;AAExB,cAAY,KAAK,IAAI;AACrB,SAAO;;CAGT,gBAAgB,MAAM,OAAO;AAC3B,SAAO,KAAK,KAAK,SAAS,YAAY,KAAK,YAAY,MAAM,MAAM;;CAGrE,kBAAkB,MAAM,OAAO;EAC7B,MAAM,EAAE,YAAY,SAAS,KAAK,KAAK;EACvC,MAAM,SAAgB,EAAE;AACxB,MAAI,WACF,QAAO,KAAK,GAAG,IAAI,MAAM,OAAO,aAAa,CAAC;AAEhD,MAAI,KACF,QAAO,KAAK,OAAO;EAErB,MAAM,eAAe,IACnB,OACA,oBAAmB;GACjB,MAAM,cAAc,MAAM,gBAAgB;GAC1C,MAAM,EAAE,MAAM,aAAa;AAC3B,UAAO,CAAC,YACN,sBAAsB,KAAK,IAAI,oBAAoB,SAAS,GAAG,IAC7D,cACA,CAAC,UAAU,YAAY;KAE7B,kBACD;AACD,SAAOA,OAAK,KAAK;GACf,GAAG;GACH;GACA,UAAU,MAAM,MAAM;GACtB,WAAW,MAAM,aAAa;GAC/B,CAAC;;CAGJ,iBAAiB;CAEjB,wBAAwB,MAAM,OAAO;AACnC,SAAOA,OAAK,KAAK;GACf;GACA,GAAG,IAAI,MAAM,OAAO,mBAAmB;GACvC,CAAC,KAAK,MAAM,OAAO,aAAa,EAAE,IAAI;GACvC,CAAC;;CAGJ,uBAAuB,MAAM,OAAO;AAClC,SAAO,4BAA4B,MAAM,OAAO,UAAU;;CAG5D,qBAAqB,MAAM,OAAO;AAChC,SAAO,4BAA4B,MAAM,OAAO,QAAQ;;CAG1D,oBAAoB,MAAM,OAAO;AAC/B,SAAO;GAAC;GAAS,KAAK,MAAM,OAAO,WAAW;GAAE;GAAI;;CAGtD,wBAAwB,MAAM,OAAO;EACnC,MAAM,CAAC,eAAe,GAAG,iBAAiB,IAAI,MAAM,OAAO,WAAW;AACtE,SAAO;GACL;GACA;GACAE,QACEC,SAAO,CACLC,QACAF,QAAMC,SAAO;IAAC;IAAQC;IAAM,GAAGJ,OAAK,CAAC,KAAKI,OAAK,EAAE,cAAc;IAAC,CAAC,CAAC,CACnE,CAAC,CACH;GACD;GACD;;CAGH,kBAAkB;CACnB;AAED,SAAS,YAAY,oBAAgD;AACnE,oBAAmB,MAAM,EAAE,UAAU,KAAK,EAAE,UAAU,QAAQ;AAC5D,MAAI,EAAE,UAAU,CAAC,EAAE,OACjB,QAAO;WACE,EAAE,UAAU,CAAC,EAAE,OACxB,QAAO;AAET,MAAI,CAAC,EAAE,mBAAmB;AACxB,OAAI,EAAE,kBACJ,QAAO;AAET,UAAO;aACE,CAAC,EAAE,kBACZ,QAAO;AAET,SAAO,WAAW,EAAE,kBAAkB,IAAI,EAAE,kBAAkB,GAAG;GACjE;AAEF,QAAO,mBAAmB,QACvB,aAAa,sBACZ,kBAAkB,SAAS,SAAS,cAAc,IAAI,aACxD,EACD;;AAGH,SAAS,WACP,GACA,GACA;CACA,MAAM,eAAe,EAAE,SAAS;CAChC,MAAM,eAAe,EAAE,SAAS;CAEhC,MAAM,WAAW,KAAK,IAAI,aAAa,QAAQ,aAAa,OAAO;AACnE,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;EACjC,MAAM,SAAS,aAAa,GAAG;EAC/B,MAAM,SAAS,aAAa,GAAG;AAC/B,MAAI,SAAS,OACX,QAAO;WACE,SAAS,OAClB,QAAO;;AAIX,QAAO,aAAa,SAAS,aAAa;;AAG5C,SAAS,4BACP,MACA,OACA,QACA;CACA,MAAM,YAAY;EAAC;EAAQ;EAAK,KAAK,MAAM,OAAO,cAAc;EAAC;AACjE,KAAI,KAAK,KAAK,SAAS,YAAY;EACjC,MAAM,cAAcJ,OAAK,CAAC,KAAKI,OAAK,EAAE,IAAI,MAAM,OAAO,aAAa,CAAC;AACrE,YAAU,KACRF,QAAMC,SAAO,CAACC,QAAMF,QAAMC,SAAO;GAAC;GAAMC;GAAM,GAAG;GAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CACnE;;AAEH,WAAU,KAAK,IAAI;AACnB,QAAO;;;;;AC7NT,MAAM,EAAE,OAAO,QAAQ,MAAM,MAAM,aAAa;AAEhD,yCAAe;CACb,cAAc,MAAM,OAAO;EACzB,MAAM,EAAE,aAAa,KAAK;EAC1B,MAAM,UAAU,eAAe,UAAU,CAAC,WAAW,cAAc,CAAC;AACpE,SAAO,KAAK,KAAK,CACf,GAAG,IAAI,MAAM,OAAO,aAAa,EACjC,KAAK,MAAM,OAAO,QAAQ,CAC3B,CAAC;;CAGJ,aAAa;CACb,cAAc;CACd,mBAAmB;CAEnB,cAAc,MAAM,OAAO;EACzB,MAAM,EAAE,aAAa,KAAK;EAK1B,MAAM,OAAO,KAAK,MAAM,OAJR,eAAe,UAAU,CACvC,iBACA,uBACD,CAAC,CACqC;AACvC,SAAO,KAAK,KAAK,CACf,GAAG,IAAI,MAAM,OAAO,aAAa,EACjC,SAAS,OAAO,CAAC,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC,GAAG,KACrD,CAAC;;CAGJ,sBAAsB;CACtB,WAAW;CACX,eAAe;CAEf,aAAa,MAAM,OAAO;AACxB,SAAO,KAAK,KAAK,CACf,GAAG,IAAI,MAAM,OAAO,aAAa,EACjC,KAAK,MAAM,OAAO,aAAa,CAChC,CAAC;;CAGJ,KAAK,MAAM,OAAO;AAChB,SAAO,QACL,OACA,cAAa;GACX,MAAM,QAAQ,MAAM,UAAU;AAC9B,UAAO,cAAc,UAAU,KAAK,GAAG,CAAC,OAAO,IAAI,GAAG;KAExD,YAAY,KAAK,KAAK,UAAU;GAAC;GAAc;GAAW;GAAU,CAAC,CACtE;;CAGH,cAAc,MAAM,OAAO;EACzB,MAAM,YAAY,CAChB,GAAG,IAAI,MAAM,OAAO,wBAAwB,EAC5C,KAAK,MAAM,OAAO,iBAAiB,CACpC;AACD,MAAI,KAAK,KAAK,SAAS,UACrB,WAAU,KAAK,KAAK,MAAM,OAAO,YAAY,CAAC;AAEhD,SAAO,KAAK,KAAK,UAAU;;CAG7B,uBAAuB;CAEvB,UAAU,MAAM,OAAO;EACrB,MAAM,QAAQ,CAAC,YAAY,KAAK,MAAM,OAAO,uBAAuB,CAAC;AACrE,MAAI,KAAK,KAAK,SAAS,gBACrB,OAAM,KACJ,MACE,OAAO,CAAC,MAAM,GAAG,KAAK,MAAM,IAAI,MAAM,OAAO,kBAAkB,CAAC,CAAC,CAAC,CACnE,CACF;AAEH,SAAO;;CAGT,gBAAgB,MAAM,OAAO;AAC3B,SAAO,CAAC,MAAM,KAAK,MAAM,OAAO,gBAAgB,CAAC;;CAGnD,cAAc,MAAM,OAAO;AACzB,SAAO,MAAM;GACX;GACA,OAAO,CAAC,UAAU,KAAK,MAAM,OAAO,mBAAmB,CAAC,CAAC;GACzD;GACA;GACD,CAAC;;CAGJ,iBAAiB,MAAM,OAAO;AAC5B,SAAO,UAAU,MAAM,OAAO,eAAe;;CAG/C,cAAc;CAEd,SAAS,MAAM,OAAO;EACpB,MAAM,WAAW,CAAC,GAAG,IAAI,MAAM,OAAO,aAAa,EAAE,IAAI;AACzD,MAAI,KAAK,KAAK,SAAS,eACrB,UAAS,KAAK,KAAK,MAAM,OAAO,iBAAiB,CAAC;AAEpD,SAAO,KAAK,KAAK,SAAS;;CAG5B,eAAe,MAAM,OAAO;AAC1B,SAAO;GACL,KAAK,KAAK,SAAS,UAAU,YAAY;GACzC;GACA,KAAK,MAAM,OAAO,gBAAgB;GACnC;;CAEJ;;;;ACjHD,MAAM,qBAAuC;CAC3C,GAAGC;CACH,GAAGC;CACH,GAAGC;CACH,GAAGC;CACH,GAAGC;CACH,GAAGC;CACH,GAAGC;CACH,GAAGC;CACH,GAAGC;CACJ;AAED,SAAgB,mBACd,MACoB;AACpB,QAAO,mBAAmB;;;;;ACV5B,sBAAe;CACb,MAAM,MAAoC,SAAS,OAAO,MAAM;AAC9D,SAAO,YAAY,KAAK,GACpB,KAAK,KAAK,QACV,mBAAmB,KAAK,KAAK,KAAK,CAAC,MAAM,OAAO,SAAS,KAAK;;CAEpE,kBAAkB,MAAM;EACtB,MAAM,EAAE,SAAS;AACjB,SACE,KAAK,UAAU,MAAM,EAAE,YACrB,2DAA2D,KAAK,MAAM,CACvE,KAAK,QACL,iBAAiB,KAAK,IAAI,6BAA6B,KAAK;;CAGjE;CACA,eAAe,MAAM;AACnB,SAAO,WAAW,KAAK,IAAI,KAAK,UAAU,SAAS;;CAErD,aAAa,aAAa;EACxB,MAAM,EAAE,SAAS;AACjB,MAAI,cAAc,KAAK,IAAI,KAAK,UAAU,UAAU,WAClD,OAAM,IAAI,MAAM,kBAAkB,KAAK,UAAU,KAAK,GAAG;AAE3D,SAAO,aAAa,KAAK;;CAE3B,qBAAqB,MAAM;AACzB,SAAO,cAAc,KAAK,GACtB,OAAO,OAAO,KAAK,SAAS,CAAC,SAAQ,UAAS,MAAM,GACpD,EAAE;;CAER,gBAAgB;EACd,SAAS;EACT,WAAW;EACX,WAAW;EACZ;CACF;AAED,SAAS,YAAY,MAAwD;AAC3E,QAAO,WAAW,KAAK,KAAK;;;;;ACjD9B,kBAAe;CACb,WAAW,CACT;EACE,MAAM;EACN,SAAS,CAAC,OAAO;EACjB,OAAO;EACP,SAAS;EACT,SAAS;EACT,gBAAgB;EAChB,oBAAoB;EACpB,YAAY,CAAC,QAAQ;EACrB,oBAAoB;EACpB,mBAAmB,CAAC,OAAO;EAC5B,CACF;CACD,SAAS,EACP,MAAMC,gBACP;CACD,UAAU,EACR,MAAMC,iBACP;CACD;CACA,gBAAgB,EACd,aAAa,SACd;CACF"}